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

香港中文大學研究人員

引用次數
替代計量分析
.

其它資訊
摘要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 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.
著者Ouyang WL, Zhang RQ, Cham WK
會議名稱23rd IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
會議開始日13.06.2010
會議完結日18.06.2010
會議地點San Francisco
會議國家/地區美國
詳細描述organized by IEEE,\n\nTo ORKTS: URL of publication:

http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5540058&queryText%3DFast+patter
出版年份2010
月份1
日期1
出版社IEEE COMPUTER SOC
頁次3050 - 3057
電子國際標準書號978-1-4244-6984-0
國際標準期刊號1063-6919
語言英式英語
Web of Science 學科類別Computer Science; Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Imaging Science & Photographic Technology; Mathematics; Mathematics, Applied

上次更新時間 2021-19-01 於 23:11