Filling regions using a crack code boundary description

Robert Grzeszczuk; Steven L. Eddins; Thomas A. DeFanti

doi:10.1117/12.130975

1 August 1992 Filling regions using a crack code boundary description

Robert Grzeszczuk, Steven L. Eddins, Thomas A. DeFanti

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

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.

Citation Download Citation

Robert Grzeszczuk, Steven L. Eddins, and Thomas A. DeFanti "Filling regions using a crack code boundary description", Proc. SPIE 1778, Imaging Technologies and Applications, (1 August 1992); https://doi.org/10.1117/12.130975

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