Articulated Shape Matching by Robust Alignment of Embedded Representations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Articulated Shape Matching by Robust Alignment of Embedded Representations

Résumé

In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented by 2-D or 3-D point clouds. The original pointsets are embedded in a spectral representation and the actual matching is carried out in the embedded space. We analyze the advantages of this choice as well as the reasons for which the task remains a difficult one. In particular, we show that although embedded-space matching still has intrinsic combinatorial difficulties, it can be solved by searching for an optimal orthogonal transformation that aligns the two shape embeddings. Relying on the model based clustering formalism, we propose a probabilistic formulation which casts the matching into an EM algorithm. Outliers are properly handled by the algorithm and a simple strategy is adopted to initialize it. Experiments are performed with three embedding methods (Isomap, LLE, and Laplacian embedding) and with 3-D voxelsets representing a human-motion sequence.
Fichier principal
Vignette du fichier
3drr07.pdf (1.4 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00590238 , version 1 (03-05-2011)

Identifiants

Citer

Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond Boyer. Articulated Shape Matching by Robust Alignment of Embedded Representations. 3DRR 2007 - IEEE Workshop on 3D Representation for Recognition, Oct 2007, Rio de Janeiro, Brazil. pp.1-8, ⟨10.1109/ICCV.2007.4408833⟩. ⟨inria-00590238⟩
126 Consultations
168 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More