LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On recent trends in discrete geometry in computer science
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Abstraction Pyramids on Discrete Representations
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Hierarchical watersheds within the combinatorial pyramid framework
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
The use of plane graphs for the description of image structure and shape representation poses two problems : (1) how to obtain the set of vertices, the set of edges and the incidence relation of the graph, and (2) how to embed the graph into the plane image. Initially, the image is represented by an embedded graph G in a straight forward manner, i.e. the edges of G represent the 4-connectivity of the pixels. Let G denote a (planar) abstract dual of G. Dual graph contraction is used to reduce the pair (G, G) to a pair (H, H) of planar abstract duals. Dual graph contraction is unsymmetric due to an extra condition on the choice of the contraction kernels in G. This condition is shown to be necessary and sufficient for H to be embedded onto G. The embedding is applied to the description of image structure and to shape representation.