Share Email Print

Proceedings Paper

Fast run-length-based algorithm for one-dimensional flat opening
Author(s): Seungchan Kim; Sinan Batman; Edward R. Dougherty
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 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.

Paper Details

Date Published: 21 September 1998
PDF: 6 pages
Proc. SPIE 3452, Parallel and Distributed Methods for Image Processing II, (21 September 1998); doi: 10.1117/12.323467
Show Author Affiliations
Seungchan Kim, Texas A&M Univ. (United States)
Sinan Batman, Texas A&M Univ. (United States)
Edward R. Dougherty, Texas A&M Univ. (United States)

Published in SPIE Proceedings Vol. 3452:
Parallel and Distributed Methods for Image Processing II
Hongchi Shi; Patrick C. Coffield, Editor(s)

© SPIE. Terms of Use
Back to Top