Accelerating VQ-based codeword search on the basis of partial search strategy

Authors:
Cheng-Hsing Yang;Shiuh-Jeng Wang
Affiliations:
Department of Computer Science, National Pingtung Teachers College, Ping-Tung County 900, Taiwan;Department of Information Management, Central Police University, Taoyuan 333, Taiwan
Venue:
Computer Standards & Interfaces
Year:
2005

Citing 7
Cited 0

Vector quantization and signal compression

Vector quantization and signal compression
Fast K-dimensional tree algorithms for nearest neighborsearch with application to vector quantization encoding

IEEE Transactions on Signal Processing
Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform

IEEE Transactions on Image Processing
Fast full search equivalent encoding algorithms for image compression using vector quantization

IEEE Transactions on Image Processing
An efficient computation of Euclidean distances using approximated look-up table

IEEE Transactions on Circuits and Systems for Video Technology
Modular VLSI architectures for real-time full-search-based vector quantization

IEEE Transactions on Circuits and Systems for Video Technology
An efficient Euclidean distance computation for vector quantization using a truncated look-up table

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a technique for accelerating the search on VQ-based codeword search is proposed. With our approach, all the pixel blocks of vector representation in an image picture could be encoded efficiently into their corresponding indices, and be associated with the closest codeword in the pre-generated codebook. The technique adopted in our scheme is inspired by the concept of space partition of the initial codebook. It is accomplished in a manner that the search range for the image block is significantly reduced. There is a key-codebook comprised of numerous key-codewords, and with a smaller book size, which is generated from the given codewords during system initialization. Any image block is then directed to look for the closest key-codeword in the key-codebook. Ultimately, the best-match codeword is checked out according to the relation between the closest key-codeword and the 'genuine' codewords in the given codebook. This short-time achievement is obtained because of the considerable book size reduction. A flexible radius, spread by a key-codeword is imposed in our elaborated algorithm to attain the most precise hit ratio estimation. The experiments show that our scheme is at least two and a half times faster than that of a full search in VQ implementation. Moreover, the strategy we proposed is also compatible with the search algorithms in finding the closest codeword, and the high quality of image display remained the same.