N. Tsapanos, A. Tefas, N. Nikolaidis, and I. Pitas, Shape matching using a binary search tree structure of weak classifiers, Pattern Recognition, vol.45, issue.6, pp.2363-2376, 2012.
DOI : 10.1016/j.patcog.2011.11.025

S. K. Aaron, R. I. Christopher, and C. G. Sharon, Characterizing complex particle morphologies through shape matching: descriptors, applications, and algorithms, Journal of Computational Physics, vol.230, issue.17, p.20, 2011.

D. F. Luciano and M. C. &roberto, Shape Classification and Analysis: Theory and Practice, 2009.

A. Kolesnikov, ISE-bounded polygonal approximation of digital curves, Pattern Recognition Letters, vol.33, issue.10, pp.15-1329, 2012.
DOI : 10.1016/j.patrec.2012.02.015

M. T. Parvez and A. M. &sabri, Polygonal approximation of digital planar curves through adaptive optimizations, Pattern Recognition Letters, vol.31, issue.13, 1997.
DOI : 10.1016/j.patrec.2010.06.007

A. C. Poyato, F. J. Cuevas, R. M. Carnicer, and R. M. Salinas, Polygonal approximation of digital planar curves through break point suppression, Pattern Recognition, vol.43, issue.1, pp.14-25, 2010.
DOI : 10.1016/j.patcog.2009.06.010

M. T. Parvez and A. M. &sabri, Polygonal Approximation of Planar Curves Using Triangular Suppression, Proceeding Of International Conference on Information Science, Signal Processing and their Applications, 2010.

S. K. Aaron, R. I. Christopher, and C. G. Sharon, Characterizing complex particle morphologies through shape matching: descriptors, applications, and algorithms, Journal of Computational Physics, vol.230, issue.17, pp.6438-6463, 2011.

. De-sousa, S. De, N. M. Artner, and W. G. Kropatsch, On the Evaluation of Graph Centrality for Shape Matching, Lecture Notes in Computer Science, vol.7877, pp.204-213, 2013.
DOI : 10.1007/978-3-642-38221-5_22

G. Li, H. Kim, J. K. Tan, and S. Ishikawa, 3D Organic Shape Correspondence Using Spherical Conformal Mapping, World Congress on Medical Physics and Biomedical Engineering, vol.39, pp.943-946, 2012.
DOI : 10.1007/978-3-642-29305-4_247

C. D. Ruberto and A. Morgera, ACO contour matching: A dominant point approach., 2011 4th International Congress on Image and Signal Processing, pp.1391-1395, 2012.
DOI : 10.1109/CISP.2011.6100471

C. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity, pp.0-13, 1982.

C. Scott and R. D. Nowak, Robust contour matching via the order-preserving assignment problem, IEEE Transactions on Image Processing, vol.15, issue.7, pp.1831-1838, 2006.
DOI : 10.1109/TIP.2006.877038

O. V. Kaick, G. Hammarneh, H. Zhang, and P. Wighton, Contour CorrespondenceVia Ant Colony Optimization. Proc, 15 Pacific Graphic, pp.271-280, 2007.

X. Zhu, Shape Matching Based on Ant Colony Optimization, CCIS, vol.15, pp.101-108, 2008.
DOI : 10.1007/978-3-540-85930-7_14

S. Rusinkiewicz and M. &levoy, Efficient Variants of the ICP Algorithm.3-D Digital Imaging and Modeling, Third International Conference IEEE, pp.145-152, 2001.

O. V. Kaick, H. Zhang, G. Hamarneh, and D. Cohen-or, A Survey on Shape Correspondence, Computer Graphics Forum, vol.29, issue.6, pp.1681-1707, 2011.
DOI : 10.1111/j.1467-8659.2011.01884.x

L. J. Latecki and R. Lakämper, Shape similarity measure based on correspondence of visual parts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.10, pp.1185-1190, 2000.
DOI : 10.1109/34.879802