An improved fast encoding algorithm for vector quantization

Authors:
Li-Juan Liu;Xu-Bang Shen;Xue-Cheng Zou
Affiliations:
Institute of Image Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, China;Institute of Image Recognition and Artificial Intelligence, Huazhong University of Science and Technology, Wuhan, China;Department of Electronic Science and Technology, Huazhong University of Science and Tecnology, Wuhan, China
Venue:
Journal of the American Society for Information Science and Technology
Year:
2004

Citing 6
Cited 1

An efficient approximation-elimination algorithm for fast nearest-neighbor search based on a spherical distance coordinate formulation

Pattern Recognition Letters
High-speed closest codeword search algorithms for vector quantization

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

IEEE Transactions on Image Processing
A fast search algorithm for vector quantization using L2-norm pyramid of codewords

IEEE Transactions on Image Processing
Fast VQ encoding by an efficient kick-out condition

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

Lakon: a middle-ground approach to high-frequency data acquisition and in-network processing in sensor networks

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the current information age, people have to access various information. With the popularization of the Internet in all kinds of information fields and the development of communication technology, more and more information has to be processed in high speed. Data compression is one of the techniques in information data processing applications and spreading images. The objective of data compression is to reduce data rate for transmission and storage. Vector quantization (VQ) is a very powerful method for data compression. One of the key problems for the basic VQ method, i.e., full search algorithm, is that it is computationally intensive and is difficult for real time processing. Many fast encoding algorithms have been developed for this reason. In this paper, we present a reasonable half-L2-norm pyramid data structure and a new method of searching and processing codewords to significantly speed up the searching process especially for high dimensional vectors and codebook with large size; reduce the actual requirement for memory, which is preferred in hardware implementation system, e.g., SOC (system-on-chip); and produce the same encoded image quality as full search algorithm. Simulation results show that the proposed method outperforms some existing related fast encoding algorithms.