Measuring the distance of generalized maps - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Measuring the distance of generalized maps

Résumé

Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships between cells (vertices, edges, faces, volumes, ...). In this paper, we define a first error-tolerant distance measure for comparing generalized maps, which is an important issue for image processing and analysis. This distance measure is defined by means of the size of a largest common submap, in a similar way as a graph distance measure may be defined by means of the size of a largest common subgraph. We show that this distance measure is a metric, and we introduce a greedy randomized algorithm which allows us to efficiently compute an upper bound of it.
Fichier principal
Vignette du fichier
MeasuringTheDistanceOfGeneralizedMapsHAL.pdf (342.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00595088 , version 1 (23-05-2011)

Identifiants

Citer

Camille Combier, Christine Solnon, Guillaume Damiand. Measuring the distance of generalized maps. 8th IAPR - TC-15 Workshop on Graph-based Representations in Pattern Recognition, May 2011, Münster, Germany. pp.82-91, ⟨10.1007/978-3-642-20844-7⟩. ⟨hal-00595088⟩
202 Consultations
138 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More