Abstract
The encoding process of finding the best-matched codeword (winner) for a certain input vector in image vector quantization (VQ) is computationally very expensive due to a lot of k-dimensional Euclidean distance computations. In order to speed up the VQ encoding process, it is beneficial to firstly estimate how large the Euclidean distance is between the input vector and a candidate codeword by using appropriate low dimensional features of a vector instead of an immediate Euclidean distance computation. If the estimated Euclidean distance is large enough, it implies that the current candidate codeword could not be a winner so that it can be rejected safely and thus avoid actual Euclidean distance computation. Sum (1-D), L2 norm (1-D) and partial sums (2-D) of a vector are used together as the appropriate features in this paper because they are the first three simplest features. Then, four estimations of Euclidean distance between the input vector and a codeword are connected to each other by the Cauchy–Schwarz inequality to realize codeword rejection. For typical standard images with very different details (Lena, F-16, Pepper and Baboon), the final remaining must-do actual Euclidean distance computations can be eliminated obviously and the total computational cost including all overhead can also be reduced obviously compared to the state-of-the-art EEENNS method meanwhile keeping a full search (FS) equivalent PSNR.
Similar content being viewed by others
References
N. M. Nasarabadi and R. A. King: IEEE Trans. Commun. 36 (1988) 957.
L. Guan and M. Kamel: Pattern Recognition Lett. 13 (1992) 693.
C. M. Huang, Q. Bi, G. S. Stiles and R. W. Harris: IEEE Trans. Image Process. 1 (1992) 413.
C. H. Lee and L. H. Chen: IEE Proc.—Vision Image Signal Process. 141 (1994) 143.
K. Wu and J. Lin: IEEE Trans. Circuits Syst. Video Tchnol. 10 (2000) 59.
K. Hwang and C. Chang: Opt. Eng. 40 (2001) 1749.
B. Song and J. Ra: IEEE Trans. Image Process. 11 (2002) 10.
Z. M. Lu and S. H. Sun: IEICE Trans. Inf. Syst. E-86D (2003) 660.
Z. Pan, K. Kotani and T. Ohmi: Proc. 2002 IEEE Int. Symp. Circuits and Systems (ISCAS 2002), Part I, p. 797.
Z. Pan, K. Kotani and T. Ohmi: Proc. 2003 IEEE Int. Conf. Multimedia and Expo (ICME 2003), Part II, p. 261.
C. D. Bei and R. M. Gray: IEEE Trans. Commun. 33 (1985) 1132.
L. Torres and J. Huguet: IEEE Trans. Commun. 42 (1994) 208.
T. Nozawa, M. Konda, M. Fujibayashi, M. Imai, K. Kotani, S. Sugawa and T. Ohmi: IEEE J. Solid-State Circuits 35 (2000) 1744.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pan, Z., Kotani, K. & Ohmi, T. Fast Encoding Method for Image Vector Quantization Based on Multiple Appropriate Features to Estimate Euclidean Distance. OPT REV 12, 161–169 (2005). https://doi.org/10.1007/s10043-005-0161-4
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10043-005-0161-4