TY - GEN
T1 - Enhanced fast encoding method for vector quantization by finding an optimally-ordered walsh transform kernel
AU - Pan, Zhibin
AU - Kotani, Koji
AU - Ohmi, Tadahiro
PY - 2005
Y1 - 2005
N2 - In a framework of vector quantization (VQ), the encoding speed is a key issue for its practical applications. To speed up the VQ encoding process, Walsh transform is introduced in the previous work to map vectors in a k-dimensional (k-D) spatial domain into k-D Walsh domain in order to exploit the energy-compaction properly of an orthogonal transform. However, there still exist a serious problem in that previous work because it just simply used the most common sequency-ordered Walsh transform kernel, which is actually not very high efficient for fest VQ encoding. In order to solve the kernel order problem in VQ encoding, this paper proposes an optimal order for Walsh transform kernel based on the energy distribution of a particular codebook at each dimension in a k-D Walsh domain, which requires that the dimension with a larger energy distribution be put forward to be as a lower dimension. Experimental results confirmed that the proposed method could reduce the computational cost to 85.9% ∼ 53.1% compared to the previous work so as to enhance its performance obviously.
AB - In a framework of vector quantization (VQ), the encoding speed is a key issue for its practical applications. To speed up the VQ encoding process, Walsh transform is introduced in the previous work to map vectors in a k-dimensional (k-D) spatial domain into k-D Walsh domain in order to exploit the energy-compaction properly of an orthogonal transform. However, there still exist a serious problem in that previous work because it just simply used the most common sequency-ordered Walsh transform kernel, which is actually not very high efficient for fest VQ encoding. In order to solve the kernel order problem in VQ encoding, this paper proposes an optimal order for Walsh transform kernel based on the energy distribution of a particular codebook at each dimension in a k-D Walsh domain, which requires that the dimension with a larger energy distribution be put forward to be as a lower dimension. Experimental results confirmed that the proposed method could reduce the computational cost to 85.9% ∼ 53.1% compared to the previous work so as to enhance its performance obviously.
UR - http://www.scopus.com/inward/record.url?scp=33749636514&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749636514&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2005.1529815
DO - 10.1109/ICIP.2005.1529815
M3 - Conference contribution
AN - SCOPUS:33749636514
SN - 0780391349
SN - 9780780391345
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 573
EP - 576
BT - IEEE International Conference on Image Processing 2005, ICIP 2005
T2 - IEEE International Conference on Image Processing 2005, ICIP 2005
Y2 - 11 September 2005 through 14 September 2005
ER -