Share Email Print
cover

Proceedings Paper

A new template matching method based on contour information
Author(s): Huiying Cai; Feng Zhu; Qingxiao Wu; Sicong Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Template matching is a significant approach in machine vision due to its effectiveness and robustness. However, most of the template matching methods are so time consuming that they can’t be used to many real time applications. The closed contour matching method is a popular kind of template matching methods. This paper presents a new closed contour template matching method which is suitable for two dimensional objects. Coarse-to-fine searching strategy is used to improve the matching efficiency and a partial computation elimination scheme is proposed to further speed up the searching process. The method consists of offline model construction and online matching. In the process of model construction, triples and distance image are obtained from the template image. A certain number of triples which are composed by three points are created from the contour information that is extracted from the template image. The rule to select the three points is that the template contour is divided equally into three parts by these points. The distance image is obtained here by distance transform. Each point on the distance image represents the nearest distance between current point and the points on the template contour. During the process of matching, triples of the searching image are created with the same rule as the triples of the model. Through the similarity that is invariant to rotation, translation and scaling between triangles, the triples corresponding to the triples of the model are found. Then we can obtain the initial RST (rotation, translation and scaling) parameters mapping the searching contour to the template contour. In order to speed up the searching process, the points on the searching contour are sampled to reduce the number of the triples. To verify the RST parameters, the searching contour is projected into the distance image, and the mean distance can be computed rapidly by simple operations of addition and multiplication. In the fine searching process, the initial RST parameters are discrete to obtain the final accurate pose of the object. Experimental results show that the proposed method is reasonable and efficient, and can be used in many real time applications.

Paper Details

Date Published: 24 November 2014
PDF: 7 pages
Proc. SPIE 9301, International Symposium on Optoelectronic Technology and Application 2014: Image Processing and Pattern Recognition, 930109 (24 November 2014); doi: 10.1117/12.2065931
Show Author Affiliations
Huiying Cai, Shenyang Institute of Automation (China)
Univ. of Chinese Academy of Sciences (China)
Feng Zhu, Shenyang Institute of Automation (China)
Qingxiao Wu, Shenyang Institute of Automation (China)
Sicong Li, Shenyang Institute of Automation (China)


Published in SPIE Proceedings Vol. 9301:
International Symposium on Optoelectronic Technology and Application 2014: Image Processing and Pattern Recognition
Gaurav Sharma; Fugen Zhou; Jennifer Liu, Editor(s)

© SPIE. Terms of Use
Back to Top