TY - GEN

T1 - Constructing better partial sums based on energy-maximum criterion for fast encoding of VQ

AU - Pan, Zhibin

AU - Ohmi, Tadahiro

AU - Kotani, Koji

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In a vector quantization (VQ) framework, one of the key problems in its practical applications is the encoding speed. In order to speed up VQ encoding process, it is most important to avoid computing unnecessary k-dimensional (k-D) real Euclidean distances for the obviously unlikely candidate codewords. The mean, the variance and the two partial sums of a k-D vector have already been proposed as the effective features in the previous works in order to realize a rejection to the unlikely codeword by using just a little computational cost. It is clear that the mean and the variance of a k-D vector are constant but the two partial sums of a k-D vector are not constant depending on how they have been constructed. Therefore, how to construct two better partial sums for fast VQ encoding becomes important. Instead of using fixed the first half vector and the second half vector criterion that has been introduced in the previous works, this paper proposes a new energy-maximum criterion to construct two better partial sums for a k-D vector. Mathematical analysis and experimental results confirmed that the proposed criterion is much more effective for fast VQ encoding compared to the fixed criterion used in the previous works. In addition, it is very easy to use the energy-maximum criterion in practice.

AB - In a vector quantization (VQ) framework, one of the key problems in its practical applications is the encoding speed. In order to speed up VQ encoding process, it is most important to avoid computing unnecessary k-dimensional (k-D) real Euclidean distances for the obviously unlikely candidate codewords. The mean, the variance and the two partial sums of a k-D vector have already been proposed as the effective features in the previous works in order to realize a rejection to the unlikely codeword by using just a little computational cost. It is clear that the mean and the variance of a k-D vector are constant but the two partial sums of a k-D vector are not constant depending on how they have been constructed. Therefore, how to construct two better partial sums for fast VQ encoding becomes important. Instead of using fixed the first half vector and the second half vector criterion that has been introduced in the previous works, this paper proposes a new energy-maximum criterion to construct two better partial sums for a k-D vector. Mathematical analysis and experimental results confirmed that the proposed criterion is much more effective for fast VQ encoding compared to the fixed criterion used in the previous works. In addition, it is very easy to use the energy-maximum criterion in practice.

KW - Fast encoding

KW - Partial sums

KW - Vector quantization

UR - http://www.scopus.com/inward/record.url?scp=50249172197&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50249172197&partnerID=8YFLogxK

U2 - 10.1109/APCCAS.2006.342542

DO - 10.1109/APCCAS.2006.342542

M3 - Conference contribution

AN - SCOPUS:50249172197

SN - 1424403871

SN - 9781424403875

T3 - IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS

SP - 1563

EP - 1566

BT - APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems

T2 - APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems

Y2 - 4 December 2006 through 6 December 2006

ER -