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 1.5 additions per projection vector per sample, which is the lowest among existing f...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 2010-01, Vol.32 (1), p.165-171
Main Authors: Wanli Ouyang, Cham, W.K.
Format: Article
Language:English
Subjects:
Application software
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Computer vision
Exact sciences and technology
Fast algorithm
Feature extraction
Kernel
Manufacturing
Pattern matching
Pattern recognition. Digital image processing. Computational geometry
Signal processing algorithms
template matching
Tree data structures
Video compression
Video signal processing
Walsh Hadamard Transform
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0162-8828
1939-3539
DOI:10.1109/TPAMI.2009.104