Comparing sets of 3D digital shapes through topological graphs

3
Comparing sets of 3D digital shapes through topological graphs L. Paraboschi, S. Biasotti, B. Falcidieno CNR - Istituto di Matematica Applicata e Tecnologie Informatiche Genoa, Italy

description

Comparing sets of 3D digital shapes through topological graphs. L. Paraboschi, S. Biasotti, B. Falcidieno CNR - Istituto di Matematica Applicata e Tecnologie Informatiche Genoa, Italy. Goal : 3D scene comparison. Each scene (i.e. a set of objects) is described - PowerPoint PPT Presentation

Transcript of Comparing sets of 3D digital shapes through topological graphs

Page 1: Comparing sets of 3D digital shapes through topological graphs

Comparing sets of 3D digital shapes through topological

graphs

L. Paraboschi, S. Biasotti, B. Falcidieno

CNR - Istituto di Matematica Applicata e Tecnologie InformaticheGenoa, Italy

Page 2: Comparing sets of 3D digital shapes through topological graphs

Goal : 3D scene comparison

Each scene (i.e. a set of objects) is described

by a set of attributed graphs stored as scene

trees.

How to compare the following sets of objects?

GbR ’07: Alicante, 11-13 June

Page 3: Comparing sets of 3D digital shapes through topological graphs

Scenes are compared by analysing the Laplacian

spectra of their scene trees.

Using the approach described in [WHL05], for

each scene a feature vector is extracted andthen a novel distance is computed.

For results, I’ll wait for you at my poster!! [WHL05] R. C. Wilson, E. R. Hancock, B. Luo, Pattern vectors from algebraic graph theory, IEEE PAMI, 27(7), 2005, pp.1112-1124.

GbR ’07: Alicante, 11-13 June

Approach