Fast pattern matching using orthogonal Haar transform
Refereed conference paper presented and published in conference proceedings


Times Cited
Altmetrics Information
.

Other information
AbstractPattern 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 kernels (GCK) are successfully applied for fast transform domain pattern matching. This paper introduces strip sum on the image. The sum of pixels in a rectangle can be computed by one addition using the strip sum. Then we propose to use the orthogonal Haar transform (OHT) for pattern matching. Applied for pattern matching, the algorithm using strip sum requires O(log u) additions per pixel to project input data of size N x N onto u 2-D OHT basis while existing fast algorithms require O(u) additions per pixel to project the same data onto u 2-D WHT or GCK basis. Experimental results show the efficiency of pattern matching using OHT. ©2010 IEEE.
All Author(s) ListOuyang W., Zhang R., Cham W.-K.
Name of Conference2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2010
Start Date of Conference13/06/2010
End Date of Conference18/06/2010
Place of ConferenceSan Francisco, CA
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by IEEE,
Year2010
Month8
Day31
Pages3050 - 3057
ISBN9781424469840
ISSN1063-6919
LanguagesEnglish-United Kingdom

Last updated on 2020-30-11 at 23:43