18 search results - page 2 / 4 » Fast pattern matching using orthogonal Haar transform |
ICIP
2003
IEEE
14 years 7 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, a robust and efficient digital image watermarking algorithm using the fast Hadamard transform (FHT) is proposed for the copyright protection of digital images. This...
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...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
PAMI
2008
13 years 5 months ago
2008
This paper describes a method for robust real time pattern matching. We first introduce a family of image distance measures, the "Image Hamming Distance Family". Members ...