Map Edit Distance vs Graph Edit Distance for Matching Images

Combier C., Damiand G., Solnon C.

Proc. of 9th Workshop on Graph-Based Representation in Pattern Recognition (GBR)
Lecture Notes in Computer Science 7877, pages 152-161, May 2013, Vienna, Austria

Abstract: 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.

Keywords: Generalized maps; Graphs; Edit distances.

BibTex references

@InProceedings{CDS13,
      author = {Combier, C. and Damiand, G. and Solnon C.},
      title = {Map Edit Distance vs Graph Edit Distance for Matching Images},
      booktitle = {Proc. of 9th Workshop on Graph-Based Representation in Pattern Recognition (GBR)},
      series = {Lecture Notes in Computer Science},
      publisher = {Springer Berlin/Heidelberg},
      volume = {7877},
      pages = {152-161},
      month = {May},
      year = {2013},
      address = {Vienna, Austria},
      keywords = {Generalized maps; Graphs; Edit distances.},
      url = {https://doi.org/10.1007/978-3-642-38221-5_16}
}

Guillaume Damiand

Map Edit Distance vs Graph Edit Distance for Matching Images

Links:

BibTex references

Image