Fast Pattern Matching Using Orthogonal Haar Transform
Abstract
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 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 × 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.
Cite
Text
Ouyang et al. "Fast Pattern Matching Using Orthogonal Haar Transform." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010. doi:10.1109/CVPR.2010.5540058Markdown
[Ouyang et al. "Fast Pattern Matching Using Orthogonal Haar Transform." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2010.](https://mlanthology.org/cvpr/2010/ouyang2010cvpr-fast/) doi:10.1109/CVPR.2010.5540058BibTeX
@inproceedings{ouyang2010cvpr-fast,
title = {{Fast Pattern Matching Using Orthogonal Haar Transform}},
author = {Ouyang, Wanli and Zhang, Renqi and Cham, Wai-kuen},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2010},
pages = {3050-3057},
doi = {10.1109/CVPR.2010.5540058},
url = {https://mlanthology.org/cvpr/2010/ouyang2010cvpr-fast/}
}