Comparing Sets of 3D Digital Shapes Through Topological Structures

New technologies for shape acquisition and rendering of digital shapes have simplified the process of creating virtual scenes; nonetheless, shape annotation, recognition and manipulation of both the complete virtual scenes and even of subparts of them are still open problems. Once the main components of a virtual scene are represented by structural descriptions, this paper deals with the problem of comparing two (or more) sets of 3D objects, where each model is represented by an attributed graph. We will define a new distance to estimate the possible similarities among the sets of graphs and we will validate our work using a shape graph [1].

[1]  Szymon Rusinkiewicz,et al.  Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors , 2003, Symposium on Geometry Processing.

[2]  Leonidas J. Guibas,et al.  The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.

[3]  Andrea Torsello,et al.  Polynomial-time metrics for attributed trees , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Daniela Giorgi,et al.  Size functions for 3D shape retrieval , 2006, SGP '06.

[5]  M. Fatih Demirci,et al.  Object Recognition as Many-to-Many Feature Matching , 2006, International Journal of Computer Vision.

[6]  Ali Shokoufandeh,et al.  Indexing hierarchical structures using graph spectra , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

[8]  Ming Ouhyoung,et al.  On Visual Similarity Based 3D Model Retrieval , 2003, Comput. Graph. Forum.

[9]  Ravindra B. Bapat,et al.  Distance matrix and Laplacian of a tree with attached graphs , 2005 .

[10]  Silvia Biasotti,et al.  3D Scene Comparison using Topological Graphs , 2007, Eurographics Italian Chapter Conference.

[11]  Edwin R. Hancock,et al.  Graph Matching using Adjacency Matrix Markov Chains , 2001, BMVC.

[12]  Edwin R. Hancock,et al.  Pattern Vectors from Algebraic Graph Theory , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[14]  B. Falcidieno,et al.  Invited Lecture: A Shape Abstraction Paradigm for Modeling Geometry and Semantics , 1998 .

[15]  Michela Spagnuolo,et al.  From Exact to Approximate Maximum Common Subgraph , 2005, GbRPR.

[16]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[17]  Valerio Pascucci,et al.  Spectral surface quadrangulation , 2006, SIGGRAPH 2006.

[18]  Radu Horaud,et al.  Polyhedral object recognition by indexing , 1995, Pattern Recognit..