Fast tree-structured nearest neighbor encoding for vector quantization

IEEE Transactions on Image Processing

Volumn 5, Issue 2, 1996, Pages 398-404

  Katsavounidis, Ioannis ^a   Kuo, C C Jay ^a   Zhang, Zhen ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; IMAGE CODING; PERFORMANCE;

BINARY TREE; CODEBOOK; FAST TREE STRUCTURED NEAREST NEIGHBOR ENCODING; GENERALIZED LLOYD ALGORITHM;

VECTOR QUANTIZATION;

EID: 0030081743     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.480778     Document Type: Article

References (17)

1. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression. Boston: Kluwer, 1992.
2. Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., vol. COM-28, pp. 84-95, Jan. 1980.
3. J. Makhoul, S. Roucos, and H. Gish, "Vector quantization in speech coding," in Proc. IEEE, vol. 43, no. 11, pp. 1551-1587, Nov. 1985.
4. N. Moayeri, D. L. Neuhoff, and W. E. Stark, "Fine-coarse vector quantization," IEEE Trans. Signal Processing, vol. 39, no. 7, pp. 1503-1515, July 1991.
5. C.-D. Bei and R. M. Gray, "An improvement of the minimum distortion encoding algorithm for vector quantization," IEEE Trans. Commun., vol. COM-33, no. 10, pp. 1132-1133, Oct. 1985.
6. D. Y. Cheng, A. Gersho, B. Ramamurthi, and Y. Shoham, "Fast search algorithms for vector quantization and pattern matching," in Proc. Int. Conf. Acoust., Speech, Signal Processing, San Diego, Mar. 1984, pp. 9.11.1-9.11.4.
7. J. H. Friedman, F. Baskett, and L. J. Shustek, "An algorithm for finding nearest neighbors," IEEE Trans. Comput., vol. C-24, no. 10, pp. 1000-1006, Oct. 1975.
8. S.-W. Ra and I.-K. Kim, "A fast mean-distance-ordered partial codebook search algorithm for image vector quantization," IEEE Trans. Circuits Syst. II, vol. 40, no. 9, pp. 576-579, Sept. 1993.
9. D. Y. Cheng and A. Gersho, "A fast codebook search algorithm for nearest-neighbor pattern matching," in Proc. Int. Conf. Acoust., Speech, Signal Processing, Tokyo, vol. 1, Apr. 1986, pp. 265-268.
10. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, Sept. 1975.
11. A. Lowry, S. Hossain, and W. Millar, "Binary search trees for vector quantization," in Proc. Int. Conf. Acoust., Speech, Signal Processing, Dallas, 1987, pp. 2205-2208.
12. V. Ramasubramanian and K. K. Paliwal, "Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding," IEEE Trans. Signal Processing, vol. 40, no. 3, pp. 518-531, Mar. 1992.
13. M. Orchard, "A fast nearest neighbor search algorithm," in Proc. Int. Conf. Acoust., Speech, Signal Processing, Toronto, Canada, May 1991, pp. 2297-2300.
14. M. R. Soleymani and S. D. Morgera, "A fast mmse encoding technique for vector quantization," IEEE Trans. Commun., vol. 37, no, 6, pp. 656-659, June 1989.
15. L. Torres and J. Huguet, "An improvement on codebook search for vector quantization," IEEE Trans. Commun., vol. 42, nos. 2-4, pp. 208-210, 1994.
16. I. Katsavounidis, C.-C. J. Kuo, and Z. Zhang, "A new initialization technique for generalized lloyd iteration," IEEE Signal Processing Lett., vol. 1, no. 10, pp. 144-146, Oct. 1994.
17. _, "Fast generalized lloyd iteration for vq codebook design," in 1995 IS&T/SPIE Symp. Electron. Imaging: Sci. Technol., San Jose, CA, Feb. 1995.