Well-composedness of digital sets

Longin Jan Latecki; Ulrich Eckhardt; Azriel Rosenfeld

doi:10.1117/12.165012

1 December 1993 Well-composedness of digital sets

Longin Jan Latecki, Ulrich Eckhardt, Azriel Rosenfeld

Proceedings Volume 2060, Vision Geometry II; (1993) https://doi.org/10.1117/12.165012
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States

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.

Citation Download Citation

Longin Jan Latecki, Ulrich Eckhardt, and Azriel Rosenfeld "Well-composedness of digital sets", Proc. SPIE 2060, Vision Geometry II, (1 December 1993); https://doi.org/10.1117/12.165012

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available