Department of Electronic Engineering, The Chinese University of Hong Kong, Ho Sin Hang Engineering Building, Hong Kong, Shatin, NT, Hong Kong.
IEEE Trans Pattern Anal Mach Intell. 2010 Jan;32(1):165-71. doi: 10.1109/TPAMI.2009.104.
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.
本文提出了一种在滑动窗口上进行沃尔什-哈达玛变换的快速算法,可用于最有效地实现模式匹配。所提出算法的计算需求约为每个投影向量每个样本 1.5 次加法,在现有的在滑动窗口上进行沃尔什-哈达玛变换的快速算法中是最低的。