Fast algorithm for Walsh Hadamard Transform on sliding windows.
Where this comes from
- Record sourced from PubMed, PMID 19926906.
- Also identified by DOI 10.1109/TPAMI.2009.104.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.