The Community for Technology Leaders
Green Image
Issue No. 01 - January (2010 vol. 32)
ISSN: 0162-8828
pp: 165-171
Wanli Ouyang , The Chinese University of Hong Kong, Hong Kong
Wai-Kuen Cham , The Chinese University of Hong Kong, Hong Kong
ABSTRACT
This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational requirement of the proposed algorithm is about 1.5 additions per projection vector per sample, which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding windows.
INDEX TERMS
Fast algorithm, Walsh Hadamard Transform, pattern matching, template matching, feature extraction.
CITATION
Wanli Ouyang, Wai-Kuen Cham, "Fast Algorithm for Walsh Hadamard Transform on Sliding Windows", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 165-171, January 2010, doi:10.1109/TPAMI.2009.104
86 ms
(Ver 3.3 (11022016))