科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2003-7
- 单位哈尔滨工业大学
