Signatures of Combinatorial Maps

Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, 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. Key words: Combinatorial map, canonical representation, signature, linear isomorphism 1 Motivations Combinatorial maps are good data structures for modelling space subdivisions. First defined in 2D [7, 16, 9, 3], they have been extended to nD [2, 11, 12] and model the subdivision cells and their adjacency relations in any dimension. There are many different data structures for modelling the partition in regions of an image. All these structures are more or less derived from Region ...

• Type: Conference
• Year: 2009
• Where: IWCIA
• Authors: Stéphane Gosselin, Guillaume Damiand, Christine Solnon
• Keywords: Combinatorial Maps, Image, Image Processing Algorithms, Images, IWCIA 2009