Vector quantization and signal compression
Vector quantization and signal compression
Evaluation of Fast Algorithms for Finding the Nearest Neighbor
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 2 - Volume 2
A fast LBG codebook training algorithm for vector quantization
IEEE Transactions on Consumer Electronics
A new image coding algorithm using variable-rate side-match finite-state vector quantization
IEEE Transactions on Image Processing
A fast exact GLA based on code vector activity detection
IEEE Transactions on Image Processing
Diagonal axes method (DAM): a fast search algorithm for vector quantization
IEEE Transactions on Circuits and Systems for Video Technology
A fast search algorithm for vector quantization using a directed graph
IEEE Transactions on Circuits and Systems for Video Technology
An efficient computation of Euclidean distances using approximated look-up table
IEEE Transactions on Circuits and Systems for Video Technology
A fast vector quantization encoding method for image compression
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
Fast codebook search algorithms based on tree-structured vector quantization
Pattern Recognition Letters
Full-Searching-Equivalent Vector Quantization Using Two-Bounds Triangle Inequality
Fundamenta Informaticae
VQ Codebook Searching Algorithm Based on Correlation Property
Fundamenta Informaticae
Full-Searching-Equivalent Vector Quantization Using Two-Bounds Triangle Inequality
Fundamenta Informaticae
VQ Codebook Searching Algorithm Based on Correlation Property
Fundamenta Informaticae
| Hi-index | 0.00 |
The routine for finding the closest codeword in the encoding phase of vector quantization (VQ) is high computational complexity and time consuming, especially when the codewords deal with the high-dimensional vectors. In this paper, we propose three newly developed schemes for speeding up the encoding phase of VQ. The proposed schemes can easily filter out many impossible codewords such that the search domain is reduced. The experimental results show that the computational time of our proposed schemes can save more than 41-52% computational time in a full search scheme. Furthermore, our schemes only require fewer than 84% of the computational time required in recently proposed alternative.