A robust coherent point drift approach based on rotation invariant shape context

Point set matching is a common problem in many domains, such as medical image analysis, object recognition, 3D reconstruction, and motion tracking. Coherent point drift (CPD) appears as an efficient algorithm to align two point sets. It treated point set matching as a problem of Gaussian mixture density estimation. But there are four drawbacks in the CPD method: outlier ratio given manually, equal prior probability for the mixture model, lack of shape information and failure for large rotation transformations. To deal with these limitations, we propose a robust CPD approach based on rotation invariant shape context. First, a rotation invariant shape context (RISC) is constructed for each point of the two sets to keep the rotation invariance of shape features. Then an adaptive prior probability and outlier ratio are computed based on RISC. For each Gaussian mixture model (GMM) component, the prior probability is linked to the number of the sample points derived from this component. Finally, the correspondence and transformation are achieved through expectation-maximization (EM) process. The results on synthetic and real data show that our method is a robust and effective non-rigid point matching approach.

[1]  Jie Yang,et al.  Affine SoftAssign with bidirectional distance for point matching , 2013, 2013 IEEE International Conference on Image Processing.

[2]  Xavier Pennec,et al.  Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration , 2002, ECCV.

[3]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

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

[5]  Jitendra Malik,et al.  Efficient shape matching using shape contexts , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Mohamed A. Deriche,et al.  3D registration using a new implementation of the ICP algorithm based on a comprehensive lookup matrix: Application to medical imaging , 2007, Pattern Recognit. Lett..

[7]  Jihua Zhu,et al.  Robust affine iterative closest point algorithm with bidirectional distance , 2012 .

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

[9]  MyronenkoAndriy,et al.  Point Set Registration , 2010 .

[10]  Dewen Hu,et al.  Tracking objects using shape context matching , 2012, Neurocomputing.

[11]  Gérard G. Medioni,et al.  Object modelling by registration of multiple range images , 1992, Image Vis. Comput..

[12]  Danni Ai,et al.  Shape context and projection geometry constrained vasculature matching for 3D reconstruction of coronary artery , 2016, Neurocomputing.

[13]  Iasonas Kokkinos,et al.  Intrinsic shape context descriptors for deformable shapes , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Miguel Á. Carreira-Perpiñán,et al.  Non-rigid point set registration: Coherent Point Drift , 2006, NIPS.

[15]  Zhengyou Zhang,et al.  Iterative point matching for registration of free-form curves and surfaces , 1994, International Journal of Computer Vision.

[16]  Sid-Ahmed Selouani,et al.  Rotation invariant fuzzy shape contexts based on Eigenshapes and fourier transforms for efficient radiological image retrieval , 2012, 2012 International Conference on Multimedia Computing and Systems.

[17]  Philip David,et al.  Simultaneous pose and correspondence determination using line features , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[18]  David Nister,et al.  Alignment of continuous video onto 3D point clouds , 2004, CVPR 2004.

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

[20]  Leiku Yang,et al.  A new approach to select the optimum neighborhood for edge preserving filter , 2007, Fourth International Conference on Image and Graphics (ICIG 2007).

[21]  B. Schölkopf,et al.  Non-rigid point set registration: Coherent Point Drift , 2007 .

[22]  Ping Wang,et al.  A refined coherent point drift (CPD) algorithm for point set registration , 2011, Science China Information Sciences.

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

[24]  Nanning Zheng,et al.  Affine iterative closest point algorithm for point set registration , 2010, Pattern Recognit. Lett..

[25]  Qiang Sang,et al.  Non-rigid point set registration: A bidirectional approach , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[26]  Nanning Zheng,et al.  Affine Registration of Point Sets Using ICP and ICA , 2008, IEEE Signal Processing Letters.

[27]  Su Yang,et al.  Rotation Invariant Shape Contexts based on Feature-space Fourier Transformation , 2007, Fourth International Conference on Image and Graphics (ICIG 2007).

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

[29]  Jitendra Malik,et al.  Shape Context: A New Descriptor for Shape Matching and Object Recognition , 2000, NIPS.

[30]  Eric Mjolsness,et al.  New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence , 1998, NIPS.

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

[32]  Marcel Körtgen,et al.  3D Shape Matching with 3D Shape Contexts , 2003 .

[33]  Rolf Lakämper,et al.  Using the Particle Filter Approach to Building Partial Correspondences Between Shapes , 2010, International Journal of Computer Vision.