Paper
10 October 1994 Digital topology of multicolor images
Author Affiliations +
Abstract
In this paper a solution is presented which guarantees we avoid the connectivity paradoxes related to the Jordan Curve Theorem for all multicolor images. Only one connectedness relation is used for the entire digital image. We use only 4-connectedness (which is equivalent to 8-connectedness) for every component of every color. The idea is not to allow a certain `critical configuration' which can be detected locally to occur in digital pictures; such pictures are called `well-composed.' Well-composed images have very nice topological properties. For example, the Jordan Curve Theorem holds and the Euler characteristic is locally computable. This implies that properties of algorithms used in computer vision can be stated and proved in a clear way, and that the algorithms themselves become simpler and faster.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Longin Jan Latecki "Digital topology of multicolor images", Proc. SPIE 2353, Intelligent Robots and Computer Vision XIII: Algorithms and Computer Vision, (10 October 1994); https://doi.org/10.1117/12.188924
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Image segmentation

Computer vision technology

Digital image processing

Image processing

Machine vision

3D image processing

RELATED CONTENT

3D well-composed pictures
Proceedings of SPIE (August 11 1995)
Multicolor well-composed pictures
Proceedings of SPIE (January 04 1995)
Well-composedness of digital sets
Proceedings of SPIE (December 01 1993)

Back to Top