Map Edit Distance vs Graph Edit Distance for Matching Images

Camille Combier (1) , Guillaume Damiand (1) , Christine Solnon (1)

1 M2DisCo - Geometry Processing and Constrained Optimization

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). Recently, we have introduced a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another map. In this paper, we introduce labelled maps and we show how the map edit distance may be extended to compare labeled maps. We experimentally compare our map edit distance to the graph edit distance for matching regions of different segmentations of a same image.

Mots clés: Edit distances; Generalized maps; Graphs; Edit distances.

Domaines: Algorithme et structure de données [cs.DS]; Traitement des images [eess.IV]

Camille Combier, Guillaume Damiand, Christine Solnon. Map Edit Distance vs Graph Edit Distance for Matching Images. Graph-Based Representation in Pattern Recognition, May 2013, Vienna, Austria. pp.152-161, ⟨10.1007/978-3-642-38221-5_16⟩. ⟨hal-00825788⟩