Sciweavers

Share
PAMI
2010

Fast Algorithm for Walsh Hadamard Transform on Sliding Windows

8 years 9 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— 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 4/3 additions per projection vector per sample which is the lowest among existing fast algorithms for Walsh Hadamard Transform on sliding windows.
Wanli Ouyang, Wai-kuen Cham
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where PAMI
Authors Wanli Ouyang, Wai-kuen Cham
Comments (0)
books