Share Email Print

Proceedings Paper

Template matching based on image gray value
Author(s): Qiang Li; Bo Zhang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new fast template matching algorithm is proposed in this work. It extracts the local self-similarity as image feature. Feature matching is based on equal comparison and clustering. Its time complexity reduced to 0(size of search image), the theoretic lower limit for classical image template matching. The new algorithm is generalized to partial matching of two images. By partitioning images into blocks by nona-tree decomposition, it detects the matching regions between blocks and merges the matching results using first order Markov chain in horizontal direction. In the vertical direction merging is implemented directly according neighbor parts connected and keeping the consistent displacements of correspond parts in two image. The algorithm is robust for the linear transformation of image grey value and image noise.

Paper Details

Date Published: 24 June 2005
PDF: 9 pages
Proc. SPIE 5960, Visual Communications and Image Processing 2005, 59601U (24 June 2005); doi: 10.1117/12.631587
Show Author Affiliations
Qiang Li, Tsinghua Univ. (China)
Bo Zhang, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 5960:
Visual Communications and Image Processing 2005
Shipeng Li; Fernando Pereira; Heung-Yeung Shum; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top