1 August 1992 Filling regions using a crack code boundary description
Author Affiliations +
Proceedings Volume 1778, Imaging Technologies and Applications; (1992) https://doi.org/10.1117/12.130975
Event: Optical Engineering Midwest 1992, 1992, Chicago, IL, United States
A space- and time-efficient algorithm for extracting the interior of a region defined by its boundary is presented. The algorithm uses crack codes rather than Freeman's codes to represent the border. The crack-code representation is topologically well-behaved, whereas the Freeman code treats the foreground and background asymmetrically. We describe the implementation advantages of several appealing properties of the crack-code representation, including uniqueness of path and invariance under complementation. The resulting algorithm is intuitively appealing, efficient, and simple to implement. It has been routinely used as a part of a semi-automatic image segmentation program for MRI image processing.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert Grzeszczuk, Robert Grzeszczuk, Steven L. Eddins, Steven L. Eddins, Thomas A. DeFanti, Thomas A. DeFanti, } "Filling regions using a crack code boundary description", Proc. SPIE 1778, Imaging Technologies and Applications, (1 August 1992); doi: 10.1117/12.130975; https://doi.org/10.1117/12.130975


Back to Top