Template matching based on image gray value

Qiang Li; Bo Zhang

doi:10.1117/12.631587

24 June 2005 Template matching based on image gray value

Qiang Li, Bo Zhang

Proceedings Volume 5960, Visual Communications and Image Processing 2005; 59601U (2005) https://doi.org/10.1117/12.631587
Event: Visual Communications and Image Processing 2005, 2005, Beijing, China

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.

Citation Download Citation

Qiang Li and Bo Zhang "Template matching based on image gray value", Proc. SPIE 5960, Visual Communications and Image Processing 2005, 59601U (24 June 2005); https://doi.org/10.1117/12.631587

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available