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


Times Cited
Web of Science19WOS source URL (as at 24/11/2020) Click here for the latest count
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.
All Author(s) ListOuyang WL, Zhang RQ, Cham WK
Name of Conference23rd IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Start Date of Conference13/06/2010
End Date of Conference18/06/2010
Place of ConferenceSan Francisco
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by IEEE,\n\nTo ORKTS: URL of publication:

http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5540058&queryText%3DFast+patter
Year2010
Month1
Day1
PublisherIEEE COMPUTER SOC
Pages3050 - 3057
eISBN978-1-4244-6984-0
ISSN1063-6919
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Imaging Science & Photographic Technology; Mathematics; Mathematics, Applied

Last updated on 2020-25-11 at 00:17