.png){kind=icon}
.png){kind=icon}
Return
A generalized multiple projection axes method for fast encoding of vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2004.11.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2004 Elsevier B.V. All rights reserved.
Keywords:
generalized projection axis
fast encoding
vector quantization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
No organization information available