A robust non-rigid point set registration method based on inhomogeneous Gaussian mixture models

In this paper, we propose a novel robust non-rigid point set registration method adopting a new probability model called inhomogeneous Gaussian mixture models (IGMM), where we regard one point set as the centroids of a Gaussian mixture model and the other point set as the data. The IGMM is defined by applying local features and Gaussian mixture models. Considering the local relationship among neighboring points is stable, a neighborhood structural descriptor, named as local shape context, is first presented. On the basis of local descriptors, we can obtain a measure of compatibility between local features in the point sets. Then, the similarity of the local structure of point neighborhoods can be calculated on the basis of the matching scores. Each Gaussian mixture component is assigned a different weight depending on the feature similarity, which differs from the traditional Gaussian mixture model where each Gaussian mixture component has the same weight. The proposed IGMM makes point pairs with more similar features have bigger probability to formulate a match, while in algorithms based on GMMs, all point pairs have the same probability to construct correspondence points. Finally, we support our claims through regularization theory and formulate registration as a likelihood maximization problem, which is solved by updating transformation parameters and outlier ratios using the expectation maximization algorithm. Extensive comparison and evaluation experiments on synthetic point-sets datasets demonstrate that the proposed approach is robust and achieves superior performance in the presence of non-rigid deformation, noise, outliers and occlusion. In addition, a number of experiments on real images reveal that our proposed algorithm is more applicable than state-of-the-art algorithms.

[1]  Vladimir Kolmogorov,et al.  Feature Correspondence Via Graph Matching: Models and Global Optimization , 2008, ECCV.

[2]  Li Ma,et al.  Non-rigid point set registration via coherent spatial mapping , 2015, Signal Process..

[3]  Matthijs C. Dorst Distinctive Image Features from Scale-Invariant Keypoints , 2011 .

[4]  Rong Jin,et al.  Content-based image retrieval: An application to tattoo images , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[5]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[6]  Wenbing Tao,et al.  Feature Guided Biased Gaussian Mixture Model for image matching , 2015, Inf. Sci..

[7]  Wenbing Tao,et al.  Asymmetrical Gauss Mixture Models for Point Sets Matching , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Anand Rangarajan,et al.  A new point matching algorithm for non-rigid registration , 2003, Comput. Vis. Image Underst..

[9]  Jie Ma,et al.  A robust method for vector field learning with application to mismatch removing , 2011, CVPR 2011.

[10]  Yuan Gao,et al.  A robust and outlier-adaptive method for non-rigid point registration , 2013, Pattern Analysis and Applications.

[11]  Cagatay Basdogan,et al.  A new feature-based method for robust and efficient rigid-body registration of overlapping point clouds , 2008, The Visual Computer.

[12]  Zhuowen Tu,et al.  Robust Point Matching via Vector Field Consensus , 2014, IEEE Transactions on Image Processing.

[13]  Paul W. Fieguth,et al.  Fast phase-based registration of multimodal image data , 2009, Signal Process..

[14]  Jong-Ha Lee,et al.  Topology Preserving Relaxation Labeling for Nonrigid Point Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Junjun Jiang,et al.  Robust Feature Matching for Remote Sensing Image Registration via Locally Linear Transforming , 2015, IEEE Transactions on Geoscience and Remote Sensing.

[16]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[17]  Andrea Vedaldi,et al.  Vlfeat: an open and portable library of computer vision algorithms , 2010, ACM Multimedia.

[18]  Ioannis Pratikakis,et al.  Non-rigid 3D object retrieval using topological information guided by conformal factors , 2012, The Visual Computer.

[19]  Shilin Zhou,et al.  Inexact point pattern matching algorithm based on Relative Shape Context and probabilistic relaxation labelling , 2011, 2011 3rd International Conference on Computer Research and Development.

[20]  Shinichiro Omachi,et al.  Asymmetric Gaussian and Its Application to Pattern Recognition , 2002, SSPR/SPR.

[21]  Wei Wang,et al.  Relaxation labeling for non-rigid point matching under neighbor preserving , 2013 .

[22]  Wenbing Tao,et al.  Robust Point Sets Matching by Fusing Feature and Spatial Information Using Nonuniform Gaussian Mixture Models , 2015, IEEE Transactions on Image Processing.

[23]  Zhuowen Tu,et al.  Robust Estimation of Nonrigid Transformation for Point Set Registration , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[24]  Andriy Myronenko,et al.  Point Set Registration: Coherent Point Drift , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Gang Wang,et al.  Robust Point Matching Using Mixture of Asymmetric Gaussians for Nonrigid Transformation , 2014, ACCV.

[26]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Gang Wang,et al.  Context-Aware Gaussian Fields for Non-rigid Point Set Registration , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[28]  David S. Doermann,et al.  Robust point matching for nonrigid shapes by preserving local neighborhood structures , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Takeo Kanade,et al.  A Correlation-Based Approach to Robust Point Set Registration , 2004, ECCV.

[30]  Gang Wang,et al.  A robust non-rigid point set registration method based on asymmetric gaussian representation , 2015, Comput. Vis. Image Underst..

[31]  Baba C. Vemuri,et al.  Robust Point Set Registration Using Gaussian Mixture Models , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Andrew W. Fitzgibbon Robust registration of 2D and 3D point sets , 2003, Image Vis. Comput..

[33]  Lin Lei,et al.  Point-pattern matching based on point pair local topology and probabilistic relaxation labeling , 2016, The Visual Computer.

[34]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[35]  Jan Kybic,et al.  Approximate all nearest neighbor search for high dimensional entropy estimation for image registration , 2012, Signal Process..

[36]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[37]  Xing-wei Yan晏行伟,et al.  Relaxation labeling for non-rigid point matching under neighbor preserving , 2013 .

[38]  Zhuowen Tu,et al.  Robust $L_{2}E$ Estimation of Transformation for Non-Rigid Registration , 2015, IEEE Transactions on Signal Processing.