Two fast nearest neighbor searching algorithms for image vector quantization

Shen-Chuan Tai, C. C. Lai, Yu-Cheng Lin

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In this paper two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector. It achieves a full search equivalent performance. As compared with other fast methods of the same kind this algorithm requires the fewest multiplications and the least total times of distortion measurements. Then a suboptimal searching method which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor is presented. This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector. Experimental results show that this method not only needs less CPU time to encode an image but also encounter less loss of reconstructed signal quality than treestructured VQ does.

Original languageEnglish
Number of pages1
JournalIEEE Transactions on Communications
Volume44
Issue number12
Publication statusPublished - 1996 Dec 1

Fingerprint

Vector quantization
Program processors

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{91d89c752bf14536889472eb64bfee1a,
title = "Two fast nearest neighbor searching algorithms for image vector quantization",
abstract = "In this paper two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector. It achieves a full search equivalent performance. As compared with other fast methods of the same kind this algorithm requires the fewest multiplications and the least total times of distortion measurements. Then a suboptimal searching method which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor is presented. This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector. Experimental results show that this method not only needs less CPU time to encode an image but also encounter less loss of reconstructed signal quality than treestructured VQ does.",
author = "Shen-Chuan Tai and Lai, {C. C.} and Yu-Cheng Lin",
year = "1996",
month = "12",
day = "1",
language = "English",
volume = "44",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

Two fast nearest neighbor searching algorithms for image vector quantization. / Tai, Shen-Chuan; Lai, C. C.; Lin, Yu-Cheng.

In: IEEE Transactions on Communications, Vol. 44, No. 12, 01.12.1996.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Two fast nearest neighbor searching algorithms for image vector quantization

AU - Tai, Shen-Chuan

AU - Lai, C. C.

AU - Lin, Yu-Cheng

PY - 1996/12/1

Y1 - 1996/12/1

N2 - In this paper two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector. It achieves a full search equivalent performance. As compared with other fast methods of the same kind this algorithm requires the fewest multiplications and the least total times of distortion measurements. Then a suboptimal searching method which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor is presented. This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector. Experimental results show that this method not only needs less CPU time to encode an image but also encounter less loss of reconstructed signal quality than treestructured VQ does.

AB - In this paper two efficient codebook searching algorithms for vector quantization (VQ) are presented. The first fast search algorithm utilizes the compactness property of signal energy on transform domain and the geometrical relations between the input vector and every codevector to eliminate those codevectors that have no chance to be the closest codeword of the input vector. It achieves a full search equivalent performance. As compared with other fast methods of the same kind this algorithm requires the fewest multiplications and the least total times of distortion measurements. Then a suboptimal searching method which sacrifices the reconstructed signal quality to speed up the search of nearest neighbor is presented. This algorithm performs the search process on predefined small subcodebooks instead of the whole codebook for the closest codevector. Experimental results show that this method not only needs less CPU time to encode an image but also encounter less loss of reconstructed signal quality than treestructured VQ does.

UR - http://www.scopus.com/inward/record.url?scp=33747508519&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33747508519&partnerID=8YFLogxK

M3 - Article

VL - 44

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 12

ER -