论文信息 - Measuring the Distance of Generalized Maps

Measuring the Distance of Generalized Maps

Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships between cells (vertices, edges, faces, volumes, ...). In this paper, we define a first error-tolerant distance measure for comparing generalized maps, which is an important issue for image processing and analysis. This distance measure is defined by means of the size of a largest common submap, in a similar way as a graph distance measure may be defined by means of the size of a largest common subgraph. We show that this distance measure is a metric, and we introduce a greedy randomized algorithm which allows us to efficiently compute an upper bound of it.

Christine Solnon | Guillaume Damiand | Camille Combier

[1] PASCAL LIENHARDT,et al. N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds , 1994, Int. J. Comput. Geom. Appl..

[2] Christine Solnon,et al. A Polynomial Algorithm for Submap Isomorphism , 2009, GbRPR.

[3] DamiandGuillaume. Topological model for 3D image representation , 2008 .

[4] Horst Bunke,et al. On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[5] Francisco Escolano,et al. Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings , 2007, GbRPR.

[6] Guillaume Damiand. Topological model for 3D image representation: Definition and incremental extraction algorithm , 2008, Comput. Vis. Image Underst..

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

[8] Christophe Fiorio,et al. Topological model for two-dimensional image representation: definition and optimal extraction algorithm , 2004, Comput. Vis. Image Underst..