An algorithm for mean pyramids vector quantization using Hadamard transform and tree structure

Authors:
A. Swilem;M. R. Girgis;E. A. Zanaty;R. Ramadan
Affiliations:
Computer Science Dept., Faculty of science, Minia University, Egypt;Computer Science Dept., Faculty of science, Minia University, Egypt;Math. Dept., Faculty of science, Sohag University, Egypt;Computer Science Dept., Faculty of science, Sohag University, Egypt
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 3
Cited 0

Vector quantization and signal compression

Vector quantization and signal compression
Data structures and algorithm analysis in C (2nd ed.)

Data structures and algorithm analysis in C (2nd ed.)
Hadamard transform based fast codeword search algorithm for high-dimensional VQ encoding

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compressing an image is a significant technique for the sake of saving a little more bandwidth or storage space. However, one of the main problems in vector quantization (VQ) is the high computational complexity of searching for the appropriate codeword in its codebook. To overcome this problem a fast search algorithm based on Tree-Hadamard Transform of the mean pyramid levels of the codewords is proposed. The algorithm uses tree structure of the highest level for all codewords to speed up the searching process. The proposed algorithm is more efficient than using only Hadamard transformed mean pyramids especially in high dimension cases.