This Letter presents a fast codeword search algorithm based on ordered Hadamard transform. Before encoding, the ordered Hadamard transform is performed offline on all codewords. During the encoding process, the ordered Hadamard transform is first performed on the input vector, and then a new inequality based on characteristic values of transformed vectors is used to reject the unlikely transformed codewords. Experimental results show that the algorithm outperforms many newly presented algorithms in the case of high dimensionality, especially for high-detail images.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Zhe-Ming LU, Dian-Guo XU, Sheng-He SUN, "Fast Codeword Search Algorithm for Image Vector Quantization Based on Ordered Hadamard Transform" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 7, pp. 1318-1320, July 2003, doi: .
Abstract: This Letter presents a fast codeword search algorithm based on ordered Hadamard transform. Before encoding, the ordered Hadamard transform is performed offline on all codewords. During the encoding process, the ordered Hadamard transform is first performed on the input vector, and then a new inequality based on characteristic values of transformed vectors is used to reject the unlikely transformed codewords. Experimental results show that the algorithm outperforms many newly presented algorithms in the case of high dimensionality, especially for high-detail images.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_7_1318/_p
Copy
@ARTICLE{e86-d_7_1318,
author={Zhe-Ming LU, Dian-Guo XU, Sheng-He SUN, },
journal={IEICE TRANSACTIONS on Information},
title={Fast Codeword Search Algorithm for Image Vector Quantization Based on Ordered Hadamard Transform},
year={2003},
volume={E86-D},
number={7},
pages={1318-1320},
abstract={This Letter presents a fast codeword search algorithm based on ordered Hadamard transform. Before encoding, the ordered Hadamard transform is performed offline on all codewords. During the encoding process, the ordered Hadamard transform is first performed on the input vector, and then a new inequality based on characteristic values of transformed vectors is used to reject the unlikely transformed codewords. Experimental results show that the algorithm outperforms many newly presented algorithms in the case of high dimensionality, especially for high-detail images.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Fast Codeword Search Algorithm for Image Vector Quantization Based on Ordered Hadamard Transform
T2 - IEICE TRANSACTIONS on Information
SP - 1318
EP - 1320
AU - Zhe-Ming LU
AU - Dian-Guo XU
AU - Sheng-He SUN
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2003
AB - This Letter presents a fast codeword search algorithm based on ordered Hadamard transform. Before encoding, the ordered Hadamard transform is performed offline on all codewords. During the encoding process, the ordered Hadamard transform is first performed on the input vector, and then a new inequality based on characteristic values of transformed vectors is used to reject the unlikely transformed codewords. Experimental results show that the algorithm outperforms many newly presented algorithms in the case of high dimensionality, especially for high-detail images.
ER -