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 k-nearest-neighbor search based on projection and triangular inequality
Pattern Recognition
Novel multi-centroid, multi-run sampling schemes for $K$-medoids-based algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
A fast VQ codebook generation algorithm using codeword displacement
Pattern Recognition
Fast VQ codebook search algorithm for grayscale image coding
Image and Vision Computing
Vector Quantization of Images Using a Fuzzy Clustering Method
Cybernetics and Systems
New Bit Reduction of Vector Quantization Using Block Prediction and Relative Addressing
Fundamenta Informaticae
Fast VQ Codebook Generation Method Using Codeword Stability Check and Finite State Concept
Fundamenta Informaticae
Improvement of the fast exact pairwise-nearest-neighbor algorithm
Pattern Recognition
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
A fast VQ codebook generation algorithm via pattern reduction
Pattern Recognition Letters
Fuzzy declustering-based vector quantization
Pattern Recognition
A novel encoding algorithm for vector quantization using transformed codebook
Pattern Recognition
Quantization of filter bank frame expansions through moving horizon optimization
IEEE Transactions on Signal Processing
Image and Vision Computing
Application of Kekre's fast code book generation algorithm for face recognition
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Fast k-nearest neighbors search using modified principal axis search tree
Digital Signal Processing
Vector quantization using global codebook technique
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Fast content-based image retrieval based on equal-average k-nearest-neighbor search schemes
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
A research on behavior of sleepy lizards based on KNN algorithm
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
New Bit Reduction of Vector Quantization Using Block Prediction and Relative Addressing
Fundamenta Informaticae
Fast VQ Codebook Generation Method Using Codeword Stability Check and Finite State Concept
Fundamenta Informaticae
| Hi-index | 0.02 |
In this paper, a new and fast encoding algorithm for vector quantization is presented. This algorithm makes full use of two characteristics of a vector: the sum and the variance. A vector is separated into two subvectors: one is composed of the first half of vector components and the other consists of the remaining vector components. Three inequalities based on the sums and variances of a vector and its two subvectors components are introduced to reject those codewords that are impossible to be the nearest codeword, thereby saving a great deal of computational time, while introducing no extra distortion compared to the conventional full search algorithm. The simulation results show that the proposed algorithm is faster than the equal-average nearest neighbor search (ENNS), the improved ENNS, the equal-average equal-variance nearest neighbor search (EENNS) and the improved EENNS algorithms. Comparing with the improved EENNS algorithm, the proposed algorithm reduces the computational time and the number of distortion calculations by 2.4% to 6% and 20.5% to 26.8%, respectively. The average improvements of the computational time and the number of distortion calculations are 4% and 24.6% for the codebook sizes of 128 to 1024, respectively.