Fast run-length-based algorithm for one-dimensional flat opening

Seungchan Kim; Sinan Batman; Edward R. Dougherty

doi:10.1117/12.323467

21 September 1998 Fast run-length-based algorithm for one-dimensional flat opening

Seungchan Kim, Sinan Batman, Edward R. Dougherty

Proceedings Volume 3452, Parallel and Distributed Methods for Image Processing II; (1998) https://doi.org/10.1117/12.323467
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

A computationally efficient algorithm for computing openings by 1D flat structuring elements is proposed. The algorithm utilizes the run-length encoded image and allows implementation of the opening of a gray-scale image by a sequence of arbitrarily sized flat structuring elements. The new algorithm compares favorably to existing methods for recursive implementation of a sequence of openings, and its computation time decreases with the size of the structuring element.

Citation Download Citation

Seungchan Kim, Sinan Batman, and Edward R. Dougherty "Fast run-length-based algorithm for one-dimensional flat opening", Proc. SPIE 3452, Parallel and Distributed Methods for Image Processing II, (21 September 1998); https://doi.org/10.1117/12.323467

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