1 / 3

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 Informatiche Genoa, Italy. Goal : 3D scene comparison. Each scene (i.e. a set of objects) is described

eliana-weiss
Download Presentation

Comparing sets of 3D digital shapes through topological graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. 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

  3. Approach 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 and then 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

More Related