Visual Analysis for 2-D Point Set Matching

摘要：

This paper presents a theoretically simple,yet efficient approach for the problem of matching the 2-D point sets under rigid motion, where jitter is allowed. It is a fundamental problem in pattern recognition, having applications ranging from robotics to astronautics. Commonly, the previous methods tend to use symbolic arithmetic to solve this problem. However, they are always complex and limited by computational cost. In this paper, we present a visual analysis for the point set matching problem and develop a geometrical arithmetic which is proven to yield equivalent results to the symbolic arithmetic. This allows us to view the problem as one of shape matching and obtain an algorithm that firstly generates a probabilistic shape descriptor (PSD) to describe the local geometric property of each point in the point sets, then acquires the local correspondence from the Euclidean distance matrix of the descriptors, and validates the global transformation finally. Experimental results demonstrate that our simple algorithm with a lower computation complexity effectively improves accuracy over current method, particularly when matching equal-sizepatterns under varying jitter.

关键词： probabilistic shape generic Fourier descriptor point pattern matching

作者: Jiaqi Gong Hui Ge Zhongliang Jing

作者单位: Institute of Aerospace Science and Technology,Shanghai Jiao Tong University, Shanghai, China, on gra Institute of Aerospace Science and Technology, Shanghai Jiao Tong University, Shanghai, China

会议类型: 国际会议

会议名称: 2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)

会议地点: 四川绵阳

会议语种:英文

页码: 498-503

在线出版日期: 2011-05-23（万方平台首次上网日期，不代表论文的发表时间）