Paper
1 December 1993 Problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology
T. Yung Kong
Author Affiliations +
Proceedings Volume 2060, Vision Geometry II; (1993) https://doi.org/10.1117/12.165013
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States
Abstract
Loosely speaking, a simple set of a finite binary image is a set of 1s whose deletion `preserves topology.' This concept can be made precise in different (and inequivalent) ways. Ronse established results which imply that, for finite 2-D binary images on a Cartesian grid and three different definitions of simple set, a set S of 1s is simple if every subset of S that lies in a 2- point by 2-point square is simple. In fact this is a special case of a general result which applies to arbitrary finite binary images -- not just 2-D images on a Cartesian grid -- and any definition of simple set which satisfies three axioms stated in this paper. For finite binary images on an n-dimensional Cartesian grid, we give appropriate definitions of simple set which satisfy all the axioms. When these definitions of simple set are used, verification that a parallel reduction operator for n-dimensional binary images preserves the topology of all possible input images may be achievable by checking only a finite number of cases.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
T. Yung Kong "Problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology", Proc. SPIE 2060, Vision Geometry II, (1 December 1993); https://doi.org/10.1117/12.165013
Lens.org Logo
CITATIONS
Cited by 48 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Silicon

Vision geometry

3D image processing

Analog electronics

Applied mathematics

Computer science

RELATED CONTENT

Real m-neighbor distance
Proceedings of SPIE (April 09 1993)
3D well-composed pictures
Proceedings of SPIE (August 11 1995)
Well-composedness of digital sets
Proceedings of SPIE (December 01 1993)
Regular polygons and their application to digital curves
Proceedings of SPIE (September 30 1996)
Topology preservation on 3D images
Proceedings of SPIE (December 01 1993)
Marching Chains algorithm for Alexandroff-Khalimsky spaces
Proceedings of SPIE (November 24 2002)

Back to Top