Fast run-length-based algorithm for one-dimensional flat opening Conference Paper uri icon

abstract

  • A computationally efficient algorithm for computing openings by one-dimensional 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.

name of conference

  • Parallel and Distributed Methods for Image Processing II

published proceedings

  • Proceedings of SPIE

author list (cited authors)

  • Kim, S., Batman, S., & Dougherty, E. R.

citation count

  • 1

complete list of authors

  • Kim, Seungchan||Batman, Sinan||Dougherty, Edward R

editor list (cited editors)

  • Shi, H., & Coffield, P. C.

publication date

  • September 1998