Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration

Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional spaces and match shapes by aligning their embeddings in virtue of their invarian...

Celý popis

Podrobná bibliografia

Vydané v:	2008 IEEE Conference on Computer Vision and Pattern Recognition s. 1 - 8
Hlavní autori:	Mateus, Diana, Horaud, Radu, Knossow, David, Cuzzolin, Fabio, Boyer, Edmond
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2008
Predmet:	Clustering algorithms Eigenvalues and eigenfunctions Fellows Graph theory Histograms Kernel Laplace equations Noise shaping Shape Topology
ISBN:	9781424422425, 1424422426
ISSN:	1063-6919, 1063-6919
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!