Joint coding and embedding techniques for multimedia images
Information Sciences: an International Journal
Fast search algorithm for vector quantization
Proceedings of the International Conference on Advances in Computing, Communication and Control
Fast codebook search algorithm for vector quantization using sorting technique
Proceedings of the International Conference on Advances in Computing, Communication and Control
A fast VQ codebook generation algorithm via pattern reduction
Pattern Recognition Letters
Application of Kekre's fast code book generation algorithm for face recognition
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Iris recognition using discrete cosine transform and Kekre's fast codebook generation algorithm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Coloring gray scale digital images using Kekre's fast code book generation algorithm
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Kekre's Fast Codebook Generation algorithm for tumor detection in mammography images
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Compression-unimpaired batch-image encryption combining vector quantization and index compression
Information Sciences: an International Journal
Vector quantization using global codebook technique
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Hi-index | 0.01 |
This paper presents a fast codebook search method for improving the quantization complexity of full-search vector quantization (VQ). The proposed method is built on the planar Voronoi diagram to label a ripple search domain. Then, the appropriate codeword can easily be found just by searching the local region instead of global exploration. In order to take a step further and obtain the close result full-search VQ would, we equip the proposed method with a duplication mechanism that helps to bring down the possible quantizing distortion to its lowest level. According to the experimental results, the proposed method is indeed capable of providing better outcome at a faster quantization speed than the existing partial-search methods. Moreover, the proposed method only requires a little extra storage for duplication