A generalized multiple projection axes method for fast encoding of vector quantization

The encoding process of vector quantization (VQ) is computationally very expensive due to a lot of k-dimensional Euclidean distance computations. In order to speed up VQ's encoding process, it is very effective to use a computationally inexpensive distance estimation first to try to reject a candidate codeword instead of an immediate actual distance computation. If a successful rejection is achieved, the computational burden can be reduced because the actual distance computation becomes unnecessary. A very search-efficient VQ encoding method by using multiple projection axes has already been developed in the previous work, which is a general version of the central axis. In this paper, a further generalized version of this previous work is proposed, which can completely remove the constraints for selecting the projection axis in a diagonally symmetric way as required by the previous work. Meanwhile, a theoretical criterion of how to select an optimal projection axis for a candidate codeword is also given. Furthermore, in order to use the generalized multi projection axes simultaneously, the energy accumulation property in an orthogonal space is integrated. Experimental results confirmed the effectiveness of the proposed method.

[1]  Kuldip K. Paliwal,et al.  Fast nearest-neighbor search algorithms based on approximation-elimination search , 2000, Pattern Recognit..

[2]  Nasser M. Nasrabadi,et al.  Image coding using vector quantization: a review , 1988, IEEE Trans. Commun..

[3]  Mohamed S. Kamel,et al.  Equal-average hyperplane partitioning method for vector quantization of image data , 1992, Pattern Recognit. Lett..

[4]  Koji Kotani,et al.  A fast full search equivalent encoding method for vector quantization by using appropriate features , 2003, 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698).

[5]  K. Sung,et al.  A fast encoding algorithm for vector quantization , 1997, IEEE Signal Process. Lett..

[6]  Koeng-Mo Sung,et al.  A fast vector quantization encoding algorithm using multiple projection axes , 1999, Signal Process..

[7]  K. Kotani,et al.  A parallel vector-quantization processor eliminating redundant calculations for real-time motion picture compression , 2000, IEEE Journal of Solid-State Circuits.

[8]  Robert M. Gray,et al.  An Improvement of the Minimum Distortion Encoding Algorithm for Vector Quantization , 1985, IEEE Trans. Commun..

[9]  Kuldip K. Paliwal,et al.  An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation , 1992, Pattern Recognit. Lett..

[10]  Richard C. T. Lee,et al.  Application of Principal Component Analysis to Multikey Searching , 1976, IEEE Transactions on Software Engineering.

[11]  G. Poggi Fast algorithm for full-search VQ encoding , 1993 .