[1] Park S H, Lee K M, Lee S U. A line feature matching technique based on an eigenvector approach. Computer Vision and Image Understanding, 2000, 77(3): 263-283 doi: 10.1006/cviu.2000.0808
[2] Kong W X, Kimia B B. On solving 2D and 3D puzzles using curve matching. In: Proceedings of the 2001 IEEE Conference on Computer Vision and Pattern Recognition. Kauai, HI, USA: IEEE, 2001. II-583-II-590
[3] Cochran S D, Medioni G. 3-D surface description from binocular stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1992, 14(10): 981-994 doi: 10.1109/34.159902
[4] Belongie S, Malik J, Puzicha J. Shape matching and object recognition using shape contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(4): 509-521 doi: 10.1109/34.993558
[5] Körtgen M, Park G J, Novotni M, Klein R. 3D shape matching with 3D shape contexts. In: Proceedings of the 7th Central European Seminar on Computer Graphics. Budmerice, Slovakia,2003. 22-24
[6] Balakrishnan V. Graph Theory (lst Edition). New York: McGraw-Hill, 1997.
[7] Sundar H, Silver D, Gagvani N, Dickinson S. Skeleton based shape matching and retrieval. In: Proceedings of the 2003 Shape Modeling International (SMI'03). Seoul, South Korea: IEEE, 2003. 130-139
[8] Zheng Y F, Doermann D. Robust point matching for nonrigid shapes by preserving local neighborhood structures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(4): 643-649 doi: 10.1109/TPAMI.2006.81
[9] Zhou F, De la Torre F. Factorized graph matching. In: Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition. Providence, RI: IEEE, 2012. 127-134
[10] Caetano T S, Cheng L, Le Q V, Smola A J. Learning graph matching. In: Proceedings of the 11th IEEE International Conference on Computer Vision. Rio de Janeiro, Brazil: IEEE, 2007. 1-8
[11] Leordeanu M, Hebert M. Smoothing-based optimization. In: Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition. Anchorage, AK: IEEE, 2008. 1-8
[12] Caetano T S, McAuley J J, Cheng L, Le Q V, Smola A J. Learning graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(6): 1048-1058 doi: 10.1109/TPAMI.2009.28
[13] Leordeanu M, Sukthankar R, Hebert M. Unsupervised learning for graph matching. International Journal of Computer Vision, 2012, 96: 28-45 doi: 10.1007/s11263-011-0442-2
[14] Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(2): 259-271 doi: 10.1109/TPAMI.2012.105
[15] Xiao D, Zahra D, Bourgeat P, Berghofer P, Tamayo O A, Wimberley C, Gregoire M C, Salvado O. An improved 3D shape context based non-rigid registration method and its application to small animal skeletons registration. Computerized Medical Imaging and Graphics, 2010, 34(4): 321-332 doi: 10.1016/j.compmedimag.2009.12.003
[16] Jian B, Vemuri B C. Robust point set registration using Gaussian mixture models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011, 33(8): 1633-1645 doi: 10.1109/TPAMI.2010.223
[17] Chui H L, Rangarajan A. A new point matching algorithm for non-rigid registration. Computer Vision and Image Understanding, 2003, 89(2-3): 114-141 doi: 10.1016/S1077-3142(03)00009-2
[18] Rangarajan A, Chui H, Bookstein F L. The softassign procrustes matching algorithm. In: Proceedings of the 15th International Conference on Information Processing in Medical Imaging. Poultney, Vermont, USA: Springer, 1997. 29-42
[19] Chui H L, Rambo J, Duncan J, Schultz R, Rangarajan A. Registration of cortical anatomical structures via robust 3D point matching. In: Proceedings of the 16th International Conference on Information Processing in Medical Imaging. Visegrád, Hungary: Springer, 1999. 168-181
[20] Gold S, Rangarajan A, Lu C P, Pappu S, Mjolsness E. New algorithms for 2D and 3D point matching: pose estimation and correspondence. Pattern Recognition, 1998, 31(8): 1019-1031 doi: 10.1016/S0031-3203(98)80010-1
[21] Yuille A L. Generalized deformable models, statistical physics, and matching problems. Neural Computation, 1990, 2(1): 1-24 doi: 10.1162/neco.1990.2.1.1
[22] Bookstein F L. Principal warps: thin-plate splines and the decomposition of deformations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1989, 11(6): 567-585 doi: 10.1109/34.24792
[23] Myronenko A, Song X B, Carreira-Perpiñán M Á. Non-rigid point set registration: coherent point drift. In: Proceedings of the 2006 Advances in Neural Information Processing Systems 19. Cambridge, MA: MIT Press, 2006. 1009-1016
[24] Yuille A L, Grzywacz N M. A mathematical analysis of the motion coherence theory. International Journal of Computer Vision, 1989, 3(2): 155-175 doi: 10.1007/BF00126430
[25] Myronenko A, Song X B. Point set registration: coherent point drift. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(12): 2262-2275 doi: 10.1109/TPAMI.2010.46
[26] Greengard L, Strain J. The fast Gauss transform. SIAM Journal of Scientific and Statistical Computing, 1991, 12(1): 79-94 doi: 10.1137/0912004
[27] Markovsky I. Structured low-rank approximation and its applications. Automatica, 2008, 44(4): 891-909 doi: 10.1016/j.automatica.2007.09.011
[28] Rüschendorf L, Rachev S T. A characterization of random variables with minimum L.2-distance. Journal of Multivariate Analysis, 1990, 32(1): 48-54 doi: 10.1016/0047-259X(90)90070-X
[29] Ma J Y, Zhao J, Tian J W, Tu Z W, Yuille A L. Robust estimation of nonrigid transformation for point set registration. In: Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition. Portland, OR: IEEE, 2013. 2147-2154
[30] Scott D W. Parametric statistical modeling by minimum integrated square error. Technometrics, 2001, 43(3): 274-285 doi: 10.1198/004017001316975880
[31] Wang G, Wang Z C, Chen Y F, Zhao W D. A robust non-rigid point set registration method based on asymmetric Gaussian representation. Computer Vision and Image Understanding, 2015, 141: 67-80 doi: 10.1016/j.cviu.2015.05.014
[32] Jonker R, Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 1987, 38(4): 325-340 doi: 10.1007/BF02278710
[33] Miller M L, Stone H S, Cox I J. Optimizing Murty's ranked assignment method. IEEE Transactions on Aerospace and Electronic Systems, 1997, 33(3): 851-862 doi: 10.1109/7.599256
[34] Wahba G. Spline Models for Observational Data. Philadelphia: SIAM, 1990.