Share Email Print

Proceedings Paper

Digital topology of multicolor images
Author(s): Longin Jan Latecki
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 10 October 1994
PDF: 7 pages
Proc. SPIE 2353, Intelligent Robots and Computer Vision XIII: Algorithms and Computer Vision, (10 October 1994); doi: 10.1117/12.188924
Show Author Affiliations
Longin Jan Latecki, Univ. Hamburg (Germany)

Published in SPIE Proceedings Vol. 2353:
Intelligent Robots and Computer Vision XIII: Algorithms and Computer Vision
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top