We relate maximum common submaps with the map edit distance by introducing special edit cost functions for which they are equivalent. We experimentally evaluate ...

Nov 1, 2012 · In this paper, we have introduced a generic distance based on the size of maximum common submaps which may either be partial or induced. In ...

Sep 26, 2012 · and we define a map edit distance which is parameterized by edit operation costs. Then, we relate the map edit distance to maximum common ...

Feb 7, 2012 · Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships ...

This paper introduces labelled maps and shows how the map edit distance may be extended to compare labeled maps, and experimentally compares the map edits ...

In this paper, we introduce distance measures for comparing generalized maps, which is an important issue for image processing and analysis. We introduce a ...

From maximum common submaps to edit distances of generalized maps · Map Edit Distance vs. · On the Complexity of Submap Isomorphism · An error-tolerant approximate ...

(a) = a. 2 Generalized maps and (sub)map ... Let us first define generalized map sizes and maximum common submaps. ... On a relation between graph edit distance and ...

PDF | Generalized maps are widely used to model the topology of nD objects (such as images) by means of incidence and adjacency relationships between.

Recently, we have introduced a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to ...