835 articles – 1515 references  [version française]
HAL: hal-00597483, version 1

Detailed view  Export this paper
Computer Vision and Image Understanding 115, 7 (2011) 996-1010
Polynomial Algorithms for Subisomorphism of nD Open Combinatorial Maps
Guillaume Damiand 1, Christine Solnon 1, Colin De La Higuera 2, Jean-Christophe Janodet 3, Émilie Samuel 3
(2011-07)

Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, there is no algorithm for comparing combinatorial maps, which is an important issue for image processing and analysis. In this paper, we address two basic comparison problems, i.e., map isomorphism, which involves deciding if two maps are equivalent, and submap isomorphism, which involves deciding if a copy of a pattern map may be found in a target map. We formally define these two problems for nD open combinatorial maps, we give polynomial time algorithms for solving them, and we illustrate their interest and feasibility for searching patterns in 2D and 3D images, as any child would aim to do when he searches Wally in Martin Handford's books.
1:  Laboratoire d'InfoRmatique en Images et Systèmes d'Information (LIRIS)
CNRS : UMR5205 – Université Claude Bernard - Lyon I – Université Lumière - Lyon II – Institut National des Sciences Appliquées (INSA) - Lyon – Ecole Centrale de Lyon
2:  Laboratoire d'Informatique de Nantes Atlantique (LINA)
CNRS : UMR6241 – Université de Nantes – École Nationale Supérieure des Mines - Nantes
3:  LAboratoire Hubert Curien (LAHC)
CNRS : UMR5516 – Université Jean Monnet - Saint-Etienne
SIC
Computer Science/Data Structures and Algorithms

Computer Science/Image Processing
Open combinatorial maps – Isomorphism and subisomorphism – Pattern detection – 2D and 3D images.
Attached file list to this document: 
PDF
cviu-2011-submap-isomorphism.pdf(908.8 KB)