7 search results - page 1 / 2 » Fast Algorithm for Walsh Hadamard Transform on Sliding Windo... |
PAMI
2010
13 years 3 months ago
2010
— 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 require...
TSP
2010
12 years 11 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
ISMVL
2002
IEEE
13 years 9 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
CVPR
2010
IEEE
13 years 8 months ago
2010
IEEE
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...