CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2010 vol.32 Issue No.01 - January
Issue No.01 - January (2010 vol.32)
Wanli Ouyang , The Chinese University of Hong Kong, Hong Kong
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.
Fast algorithm, Walsh Hadamard Transform, pattern matching, template matching, feature extraction.
Wanli Ouyang, "Fast Algorithm for Walsh Hadamard Transform on Sliding Windows", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.32, no. 1, pp. 165-171, January 2010, doi:10.1109/TPAMI.2009.104