J. Franco and E. Boyer, Efficient Polyhedral Modeling from Silhouettes, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.3, p.414427, 2009.
DOI : 10.1109/TPAMI.2008.104
URL : https://hal.archives-ouvertes.fr/inria-00349103

J. Starck and A. Hilton, Surface Capture for Performance-Based Animation, IEEE Computer Graphics and Applications, vol.27, issue.3, pp.21-31, 2007.
DOI : 10.1109/MCG.2007.68

G. Slabaugh, B. Culbertson, T. Malzbender, and R. Schafer, A Survey of Methods for Volumetric Scene Reconstruction from Photographs, International Workshop on Volume Graphics, pp.81-100, 2001.
DOI : 10.1007/978-3-7091-6756-4_6

S. M. Seitz, B. Curless, J. Diebel, D. Scharstein, and R. Szeliski, A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Volume 1 (CVPR'06), pp.519-528, 2006.
DOI : 10.1109/CVPR.2006.19

D. Vlasic, I. Baran, W. Matusik, and J. Popovic, Articulated mesh animation from multi-view silhouettes, Proc. SIGGRAPH), pp.1-979, 2008.
DOI : 10.1145/1360612.1360696

A. Zaharescu, E. Boyer, and R. P. Horaud, Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multiview Reconstruction, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.4, pp.823-837, 2011.
DOI : 10.1109/TPAMI.2010.116
URL : https://hal.archives-ouvertes.fr/inria-00590271

S. Rusinkiewicz and M. Levoy, Efficient variants of the ICP algorithm, Proceedings Third International Conference on 3-D Digital Imaging and Modeling, pp.145-152, 2001.
DOI : 10.1109/IM.2001.924423

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

J. H. Wilkinson, Elementary proof of the Wielandt-Hoffman theorem and of its generalization, 1970.

A. Bronstein, M. Bronstein, and R. Kimmel, Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching, Proceedings of National Academy of Sciences, pp.1168-1172, 2006.
DOI : 10.1073/pnas.0508601103

S. Wang, Y. Wang, M. Jin, X. Gu, D. Samaras et al., Conformal Geometry and Its Applications on 3D Shape Matching, Recognition, and Stitching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.7, pp.1209-1220, 2007.
DOI : 10.1109/TPAMI.2007.1050

V. Jain, H. Zhang, and O. Van-kaick, NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES, International Journal of Shape Modeling, vol.13, issue.01, pp.101-124, 2007.
DOI : 10.1142/S0218654307000968

W. Zeng, Y. Zeng, Y. Wang, X. Yin, X. Gu et al., 3D Non-rigid Surface Matching and Registration Based on Holomorphic Differentials, European Conference on Computer Vision, pp.1-14, 2008.
DOI : 10.1007/978-3-540-88690-7_1

D. Mateus, R. Horaud, D. Knossow, F. Cuzzolin, and E. Boyer, Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/CVPR.2008.4587538
URL : https://hal.archives-ouvertes.fr/inria-00590251

M. R. Ruggeri, G. Patané, M. Spagnuolo, and D. Saupe, Spectral-Driven Isometry-Invariant Matching of 3D Shapes, International Journal of Computer Vision, vol.27, issue.5, pp.248-265, 2010.
DOI : 10.1007/s11263-009-0250-0

Y. Lipman and T. Funkhouser, M??bius voting for surface correspondence, Proc. SIGGRAPH), pp.1-7212, 2009.
DOI : 10.1145/1531326.1531378

A. Dubrovina and R. Kimmel, Matching shapes by eigendecomposition of the Laplace-Beltrami operator, International Symposium on 3D Data Processing, Visualization and Transmission, 2010.

H. Qiu and E. R. Hancock, Graph matching and clustering using spectral partitions, Pattern Recognition, vol.39, issue.1, pp.22-34, 2006.
DOI : 10.1016/j.patcog.2005.06.014
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.6296

H. F. Wang and E. R. Hancock, Correspondence matching using kernel principal components analysis and label consistency constraints, Pattern Recognition, vol.39, issue.6, pp.1012-1025, 2006.
DOI : 10.1016/j.patcog.2005.05.013

H. Qiu and E. R. Hancock, Graph simplification and matching using commute times, Pattern Recognition, vol.40, issue.10, pp.2874-2889, 2007.
DOI : 10.1016/j.patcog.2006.11.013

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, 2005.
DOI : 10.1109/ICCV.2005.20

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

L. Torresani, V. Kolmogorov, and C. Rother, Feature Correspondence Via Graph Matching: Models and Global Optimization, European Conference on Computer Vision, pp.596-609, 2008.
DOI : 10.1007/978-3-540-88688-4_44

R. Zass and A. Shashua, Probabilistic graph and hypergraph matching, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/CVPR.2008.4587500

J. Maciel and J. P. Costeira, A global solution to sparse correspondence problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.2, pp.187-199, 2003.
DOI : 10.1109/TPAMI.2003.1177151

Q. Huang, B. Adams, M. Wicke, and L. J. Guibas, Non-Rigid Registration Under Isometric Deformations, Computer Graphics Forum, vol.26, issue.3, pp.1449-1457, 2008.
DOI : 10.1111/j.1467-8659.2008.01285.x

Y. Zeng, C. Wang, Y. Wang, X. Gu, D. Samras et al., Dense non-rigid surface registration using high-order graph matching, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.382-389, 2010.
DOI : 10.1109/CVPR.2010.5540189
URL : https://hal.archives-ouvertes.fr/hal-00856064

Y. Sahillioglu and Y. Yemez, 3D Shape correspondence by isometry-driven greedy optimization, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.453-458, 2010.
DOI : 10.1109/CVPR.2010.5540178

A. M. Bronstein, M. M. Bronstein, U. Castellani, A. Dubrovina, L. J. Guibas et al., Shrec 2010: robust correspondence benchmark, Eurographics Workshop on 3D Object Retrieval, 2010.

M. Ovsjanikov, Q. Merigot, F. Memoli, and L. Guibas, One Point Isometric Matching with the Heat Kernel, Proc. SGP), pp.1555-1564, 2010.
DOI : 10.1111/j.1467-8659.2010.01764.x
URL : https://hal.archives-ouvertes.fr/hal-00543885

A. Sharma and R. Horaud, Shape matching based on diffusion embedding and on mutual isometric consistency, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Workshops, 2010.
DOI : 10.1109/CVPRW.2010.5543278
URL : https://hal.archives-ouvertes.fr/inria-00549406

A. Sharma, R. Horaud, J. Cech, and E. Boyer, Topologically-robust 3D shape matching based on diffusion geometry and seed growing, CVPR 2011, 2011.
DOI : 10.1109/CVPR.2011.5995455
URL : https://hal.archives-ouvertes.fr/inria-00590280

D. Knossow, A. Sharma, D. Mateus, and R. Horaud, Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors, Graph-Based Representations in Pattern Recognition, pp.144-153, 2009.
DOI : 10.1007/978-3-540-73510-6
URL : https://hal.archives-ouvertes.fr/inria-00446989

R. P. Horaud, F. Forbes, M. Yguel, G. Dewaele, and J. Zhang, Rigid and Articulated Point Registration with Expectation Conditional Maximization, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.3, pp.587-602, 2011.
DOI : 10.1109/TPAMI.2010.94
URL : https://hal.archives-ouvertes.fr/inria-00435772

M. Belkin and P. Niyogi, Laplacian Eigenmaps for Dimensionality Reduction and Data Representation, Neural Computation, vol.15, issue.6, pp.1373-1396, 2003.
DOI : 10.1126/science.290.5500.2319

U. Luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1007/s11222-007-9033-z

F. R. Chung, Spectral Graph Theory, 1997.
DOI : 10.1090/cbms/092

L. Grady and J. R. Polimeni, Discrete Calculus: Applied Analysis on Graphs for Computational Science, 2010.
DOI : 10.1007/978-1-84996-290-2

C. Godsil and G. Royle, Algebraic Graph Theory, 2001.
DOI : 10.1007/978-1-4613-0163-9

A. J. Hoffman and H. W. Wielandt, The variation of the spectrum of a normal matrix, Duke Mathematical Journal, vol.20, issue.1, pp.37-39, 1953.
DOI : 10.1215/S0012-7094-53-02004-3

J. H. Wilkinson, The Algebraic Eigenvalue Problem, 1965.

R. A. Horn and C. A. Johnson, Matrix Analysis, 1994.

J. Ham, D. D. Lee, S. Mika, and B. Schölkopf, A kernel view of the dimensionality reduction of manifolds, Twenty-first international conference on Machine learning , ICML '04, pp.47-54, 2004.
DOI : 10.1145/1015330.1015417

H. Qiu and E. R. Hancock, Clustering and Embedding Using Commute Times, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.11, pp.1873-1890, 2007.
DOI : 10.1109/TPAMI.2007.1103

C. M. Grinstead and L. J. Snell, Introduction to Probability, 1998.

D. W. Scott, On optimal and data-based histograms, Biometrika, vol.66, issue.3, pp.605-610, 1979.
DOI : 10.1093/biomet/66.3.605

M. M. Zavlanos and G. J. Pappas, A dynamical systems approach to weighted graph matching, Automatica, vol.44, issue.11, pp.2817-2824, 2008.
DOI : 10.1016/j.automatica.2008.04.009

J. Sun, M. Ovsjanikov, and L. Guibas, A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion, SGP, 2009.
DOI : 10.1111/j.1467-8659.2009.01515.x

C. Luo, I. Safa, and Y. Wang, Approximating Gradients for Meshes and Point Clouds via Diffusion Metric, Proc. SGP), pp.1497-1508, 2009.
DOI : 10.1111/j.1467-8659.2009.01526.x