An improved fast encoding algorithm for vector quantization
Journal of the American Society for Information Science and Technology
Pattern Recognition Letters
An efficient law-of-cosine-based search for vector quantization
Pattern Recognition Letters
Fast codebook search algorithms based on tree-structured vector quantization
Pattern Recognition Letters
Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding
Information Sciences: an International Journal
Fast VQ codebook search algorithm for grayscale image coding
Image and Vision Computing
Efficient Fingercode Classification
IEICE - Transactions on Information and Systems
Fast Searching Algorithm for Vector Quantization Based on Subvector Technique
IEICE - Transactions on Information and Systems
Fast search algorithm for vector quantization
Proceedings of the International Conference on Advances in Computing, Communication and Control
Image and Vision Computing
Hi-index | 0.01 |
Vector quantization for image compression requires expensive encoding time to find the closest codeword to the input vector. This paper presents a fast algorithm to speed up the closest codeword search process in vector quantization encoding. By using an appropriate topological structure of the codebook, we first derive a condition to eliminate unnecessary matching operations from the search procedure. Then, based on this elimination condition, a fast search algorithm is suggested. Simulation results show that with little preprocessing and memory cost, the proposed search algorithm significantly reduces the encoding complexity while maintaining the same encoding quality as that of the full search algorithm. It is also found that the proposed algorithm outperforms the existing search algorithms