A topological characterization of thinning
Theoretical Computer Science
`Continuous' functions on digital pictures
Pattern Recognition Letters
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Digitally continuous functions
Pattern Recognition Letters
A Classical Construction for the Digital Fundamental Group
Journal of Mathematical Imaging and Vision
Topological Algorithms for Digital Image Processing
Topological Algorithms for Digital Image Processing
"Continuous" multifunctions in discrete spaces with applications to fixed point theory
Digital and image geometry
Properties of Digital Homotopy
Journal of Mathematical Imaging and Vision
Homotopy Properties of Sphere-Like Digital Images
Journal of Mathematical Imaging and Vision
Active Contours Under Topology Control--Genus Preserving Level Sets
International Journal of Computer Vision
Digitally continuous multivalued functions
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Thinning algorithms as multivalued N-retractions
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A topology preserving level set method for geometric deformable models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Deletion of (26,6)-simple points as multivalued retractions
CTIC'12 Proceedings of the 4th international conference on Computational Topology in Image Context
Hi-index | 0.00 |
In a recent paper (Escribano et al. in Discrete Geometry for Computer Imagery 2008. Lecture Notes in Computer Science, vol. 4992, pp. 81---92, 2008) we have introduced a notion of continuity in digital spaces which extends the usual notion of digital continuity. Our approach, which uses multivalued functions, provides a better framework to define topological notions, like retractions, in a far more realistic way than by using just single-valued digitally continuous functions.In this work we develop properties of this family of continuous functions, now concentrating on morphological operations and thinning algorithms. We show that our notion of continuity provides a suitable framework for the basic operations in mathematical morphology: erosion, dilation, closing, and opening. On the other hand, concerning thinning algorithms, we give conditions under which the existence of a retraction F:X驴X驴D guarantees that D is deletable. The converse is not true, in general, although it is in certain particular important cases which are at the basis of many thinning algorithms.