Signatures of Combinatorial Maps

Gosselin S., Damiand G., Solnon C.

Proc. of 13th International Workshop on Combinatorial Image Analysis (IWCIA)
Lecture Notes in Computer Science 5852, pages 370-382, November 2009, Cancun, Mexico

Abstract: In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. For that, we define two combinatorial map signatures: the first one has a quadratic space complexity and may be used to decide of isomorphism with a new map in linear time whereas the second one has a linear space complexity and may be used to decide of isomorphism in quadratic time. Experimental results show that these signatures can be used to recognize images very efficiently.

Keywords: Combinatorial map; Canonical representation; Signature; Linear isomorphism

BibTex references

@InProceedings{GDS09,
      author = {Gosselin, S. and Damiand, G. and Solnon, C.},
      title = {Signatures of Combinatorial Maps},
      booktitle = {Proc. of 13th International Workshop on Combinatorial Image Analysis (IWCIA)},
      series = {Lecture Notes in Computer Science},
      publisher = {Springer Berlin/Heidelberg},
      volume = {5852},
      pages = {370-382},
      month = {November},
      year = {2009},
      address = {Cancun, Mexico},
      keywords = {Combinatorial map; Canonical representation; Signature; Linear isomorphism},
      url = {https://doi.org/10.1007/978-3-642-10210-3_29}
}

Guillaume Damiand

Signatures of Combinatorial Maps

Links:

BibTex references

Image