A Dynamic Generating Graphical Model for PointSets Matching.pdfVIP

International Journal of Information Technology, Vol. 12 No. 2 2006 A Dynamic Generating Graphical Model for Point-Sets Matching Xuan ZHAO, Shengjin WANG, and Xiaoqing DING State Key Laboratory of Intelligent Technology and Systems, Department of Electronic Engineering, Tsinghua University {zhaoxuan,wsj, dxq}@ocrserv.ee.tsinghua.edu.cn Abstract This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models proved to be quite robust to noise but are susceptible to the effect of outliers. We discuss the separator’s influences on point-sets matching in inference on graphical models theoretically and find that the separator which consists of outliers will break the message-passing, which will directly lead to the breaking down of the existing methods. Due to the conclusion above, in order to minimize the outliers in separator we propose a new algorithm in generating a graphical model and the corresponding Junction Tree for point-sets matching. The experimental results show that the proposed algorithm is significantly more stable and possesses higher accuracy on point-sets matching, which can overcome the limitation of sensitivity on outliers in the existing graphical models. 1 Introduction Point-sets matching is a fundamental method for graph matching in many applications, such as stereo matching, panoramic mosaic, and object recognition. The point-sets matching consists in finding correspondences between two point sets. Many researchers make their attempt to obtain