Share Email Print

Proceedings Paper

Filling regions using a crack code boundary description
Author(s): Robert Grzeszczuk; Steven L. Eddins; Thomas A. DeFanti
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 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.

Paper Details

Date Published: 1 August 1992
PDF: 12 pages
Proc. SPIE 1778, Imaging Technologies and Applications, (1 August 1992); doi: 10.1117/12.130975
Show Author Affiliations
Robert Grzeszczuk, Univ. of Illinois/Chicago (United States)
Steven L. Eddins, Univ. of Illinois/Chicago (United States)
Thomas A. DeFanti, Univ. of Illinois/Chicago (United States)

Published in SPIE Proceedings Vol. 1778:
Imaging Technologies and Applications
Robert J. Heaston, Editor(s)

© SPIE. Terms of Use
Back to Top