Equal-average hyperplane partitioning method for vector quantization of image data

[1]  L. Guan.  Fast algorithms for vector quantization of image data , 1991 .

[2]  J.-K. Kim,et al.  Fast sliding search algorithm for vector quantisation in image coding , 1988 .

[3]  E. Ruiz.  An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .

[4]  Allen Gersho,et al.  A fast codebook search algorithm for nearest-neighbor pattern matching , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[6]  Allen Gersho,et al.  Fast search algorithms for vector quantization and pattern matching , 1984, ICASSP.

[7]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[8]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[9]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[10]  Thomas P. Yunck,et al.  A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Victor R. Lesser,et al.  The Effects-of Emerging Technology and Emulation Requirements on Microprogramming , 1976, IEEE Transactions on Computers.

[12]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[13]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.