Signatures of Combinatorial Maps

被引：0
|
作者：
Gosselin, Stephane [1 ]
Damiand, Guillaume [1 ]
Solnon, Christine [1 ]
机构：
[1] Univ Lyon 1, LIRIS, CNRS, UMR5205, F-69622 Villeurbanne, France
来源：
COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS | 2009年 / 5852卷
关键词：
Combinatorial map; canonical representation; signature; linear isomorphism; EXTRACTION ALGORITHM; IMAGE REPRESENTATION; TOPOLOGICAL MODEL; ISOMORPHISM; DEFINITION;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：370 / 382
页数：13
相关论文
共 50 条
12345