Share Email Print
cover

Proceedings Paper

Well-composedness of digital sets
Author(s): Longin Jan Latecki; Ulrich Eckhardt; Azriel Rosenfeld
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

A special class of subsets of binary digital images called `well-composed sets' are defined. The sets of this class have very nice topological properties; for example, the Jordan Curve Theorem holds, the Euler characteristic is locally computable, and there is only one connectedness relation, since 4- and 8-connectedness are equivalent. 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: 1 December 1993
PDF: 8 pages
Proc. SPIE 2060, Vision Geometry II, (1 December 1993); doi: 10.1117/12.165012
Show Author Affiliations
Longin Jan Latecki, Univ. of Maryland/College Park (United States)
Ulrich Eckhardt, Univ. of Hamburg (Germany)
Azriel Rosenfeld, Univ. of Maryland/College Park (United States)


Published in SPIE Proceedings Vol. 2060:
Vision Geometry II
Robert A. Melter; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top