Registration and matching method for directed point set with orientation attributes and local information

Abstract Point set registration and matching are the basic problems of pattern recognition and computer vision. The key to solve these problems is to determine the correspondences between the two point sets and to describe the deformation between them. In this paper, we propose an optimization model for the registration and matching of 2D directed point sets with coordinate and orientation attributes ( x , y , θ ) . First, the thin-plate spline (TPS) function with coordinate and orientation attributes is derived by variational method to describe the directed point set deformation. Second, an optimization objective function with coordinates and angles is constructed for point set registration and matching. Finally, the objective function is solved by alternately obtaining the correspondences and describing the deformation between the point sets. In the algorithm, the initial solution of correspondences is obtained by utilizing the neighborhood information of the point set to make the algorithm more robust. Several registration and matching experiments were performed on the artificial point sets and FVC fingerprint image databases to verify the robustness, effectiveness, and accuracy of the algorithm. Compared with the current popular algorithm, the proposed algorithm shows higher precision and robustness.

[1]  Umut Uludag,et al.  Standard Fingerprint Databases: Manual Minutiae Labeling and Matcher Performance Analyses , 2013, ArXiv.

[2]  Jinzhong Yang,et al.  The thin plate spline robust point matching (TPS-RPM) algorithm: A revisit , 2011, Pattern Recognit. Lett..

[3]  Yun Zhang,et al.  A Novel Interest-Point-Matching Algorithm for High-Resolution Satellite Images , 2009, IEEE Transactions on Geoscience and Remote Sensing.

[4]  Z. Li,et al.  A fast expected time algorithm for the 2-D point pattern matching problem , 2004, Pattern Recognit..

[5]  Walter G. Kropatsch,et al.  Graph-based point drift: Graph centrality on the registration of point-sets , 2015, Pattern Recognit..

[6]  Venu Govindaraju,et al.  K-plet and Coupled BFS: A Graph Based Fingerprint Representation and Matching Algorithm , 2006, ICB.

[7]  Sabih H. Gerez,et al.  Fingerprint matching by thin-plate spline modelling of elastic deformations , 2003, Pattern Recognit..

[8]  Dale Schuurmans,et al.  Graphical Models and Point Pattern Matching , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Somnath Dey,et al.  Score-level fusion for cancelable multi-biometric verification , 2019, Pattern Recognit. Lett..

[10]  Weiqiang Wang,et al.  An Efficient Indexing Scheme Based on K-Plet Representation for Fingerprint Database , 2015, ICIC.

[11]  Horst Bunke,et al.  Error Correcting Graph Matching: On the Influence of the Underlying Cost Function , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Andreas Wieser,et al.  The Perfect Match: 3D Point Cloud Matching With Smoothed Densities , 2018, 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR).

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

[14]  Anil K. Jain,et al.  FVC2004: Third Fingerprint Verification Competition , 2004, ICBA.

[15]  Patrick J. Flynn,et al.  Multiple Nose Region Matching for 3D Face Recognition under Varying Facial Expression , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Ke Li,et al.  Probability iterative closest point algorithm for m-D point set registration with noise , 2015, Neurocomputing.

[17]  Anil K. Jain,et al.  FVC2000: Fingerprint Verification Competition , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Nasser Kehtarnavaz,et al.  Affine invariant comparison of point-sets using convex hulls and hausdorff distances , 2007, Pattern Recognit..

[19]  Wolfgang Straßer,et al.  A Probabilistic Framework for Robust and Accurate Matching of Point Clouds , 2004, DAGM-Symposium.

[20]  Sandip Das,et al.  Simple algorithms for partial point set pattern matching under rigid motion , 2006, Pattern Recognit..

[21]  Francisco Herrera,et al.  A survey on fingerprint minutiae-based local matching for verification and identification: Taxonomy and experimental evaluation , 2015, Inf. Sci..

[22]  Ming Yu,et al.  Probabilistic Model for Robust Affine and Non-Rigid Point Set Matching , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Naima Kaabouch,et al.  A survey on image mosaicing techniques , 2016, J. Vis. Commun. Image Represent..

[24]  Shinji Umeyama Parameterized Point Pattern Matching and Its Application to Recognition of Object Families , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Anil K. Jain,et al.  Handbook of Fingerprint Recognition , 2005, Springer Professional Computing.

[26]  Fred L. Bookstein,et al.  Principal Warps: Thin-Plate Splines and the Decomposition of Deformations , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  Hui Zhang,et al.  Towards a comprehensive framework for movement and distortion correction of diffusion MR images: Within volume movement , 2017, NeuroImage.

[28]  Bernard W. Silverman,et al.  Thin plate splines , 1993 .

[29]  Karl Rohr,et al.  Spline-based elastic image registration: integration of landmark errors and orientation attributes , 2003, Comput. Vis. Image Underst..