Loading...
Please wait, while we are loading the content...
Similar Documents
Map Edit Distance vs Graph Edit Distance for Matching Images
| Content Provider | CiteSeerX |
|---|---|
| Author | Combier, Camille Dami, Guillaume Solnon, Christine |
| Abstract | Abstract. Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes,...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another map. In this paper, we introduce labelled maps and we show how the map edit distance may be extended to compare labeled maps. We exper-imentally compare our map edit distance to the graph edit distance for matching regions of different segmentations of a same image. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Matching Image Map Edit Distance Different Segmentation Nd Object Labeled Map Edit Operation Minimum Cost Sequence Adjacency Relationship Graph Edit Distance |
| Content Type | Text |
| Resource Type | Article |
