]. W. Grimson, Object Recognition by Computer: The role of geometric constraints, p.14, 1990.

D. A. Forsyth and J. Ponce, Computer Vision: A Modern Approach, 20032.
URL : https://hal.archives-ouvertes.fr/hal-01063327

S. Belongie, J. Malik, and J. Puzicha, Shape matching and object recognition using shape contexts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.4, pp.509-522, 2002.
DOI : 10.1109/34.993558

Z. Yefeng and D. Doermann, Robust point matching for nonrigid shapes by preserving local neighborhood structures, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.4, pp.643-649, 2002.
DOI : 10.1109/TPAMI.2006.81

M. Leordeanu and M. Hebert, A spectral technique for correspondence problems using pairwise constraints, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, pp.1482-1489, 2002.
DOI : 10.1109/ICCV.2005.20

O. Duchenne, F. Bach, I. Kweon, and J. Ponce, A tensor-based algorithm for high-order graph matching, Proc. IEEE Conference on Computer Vision and Pattern Recognition CVPR 2009, pp.1980-1987, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01063322

M. A. Fischler and R. C. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM, vol.24, issue.6, pp.381-395, 1981.
DOI : 10.1145/358669.358692

M. Neuhaus, K. Riesen, and H. Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, SSPR/SPR, pp.163-172, 2006.
DOI : 10.1007/11815921_17

H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, pp.522-525, 1993.
DOI : 10.1109/34.211474

M. Zaslavskiy, F. Bach, and J. Vert, A Path Following Algorithm for the Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, p.12, 2008.
DOI : 10.1109/TPAMI.2008.245
URL : https://hal.archives-ouvertes.fr/hal-00433567

S. Umeyama, An eigendecomposition approach to weighted graph matching problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.10, issue.5, pp.695-703, 1988.
DOI : 10.1109/34.6778

T. Caelli and S. Kosinov, An eigenspace projection clustering method for inexact graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.4, pp.515-519, 2003.
DOI : 10.1109/TPAMI.2004.1265866

M. Carcassoni and E. Hancock, Spectral correspondence for point pattern matching, Pattern Recognition, vol.36, issue.1, pp.193-204, 2002.
DOI : 10.1016/S0031-3203(02)00054-7

T. Cour, P. Srinivasan, and J. Shi, Balanced graph matching, Advanced in Neural Information Processing Systems, 2004.

S. Berretti, A. D. Bimbo, and P. Pala, A Graph Edit Distance Based on Node Merging, Proc. of ACM International Conference on Image and Video Retrieval (CIVR), pp.464-472, 2004.
DOI : 10.1007/978-3-540-27814-6_55

R. Ambauen, S. Fischer, and H. Bunke, Graph edit distance with node splitting and merging, and its application to diatom idenfication, GbRPR, pp.95-106, 2003.

Y. Keselman, A. Shokoufandeh, M. F. Demirci, and S. Dickinson, Manyto-many graph matching via metric embedding, CVPR, pp.850-857, 2003.

D. Bertsekas, Nonlinear programming, Athena Scientific, vol.6, p.7, 1999.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

T. Cour and J. Shi, Recognizing objects by piecing together the Segmentation Puzzle, 2007 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2007.
DOI : 10.1109/CVPR.2007.383051

Z. Tu, X. Chen, and A. L. Yuille, Image parsing: Unifying segmentation, detection, and recognition, Int. J. Comput. Vis, p.13, 2004.