Fast algorithms for grayscale morphological operations

Kyung Hoon Lee, Aldo Morales, Sung-Jea Ko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper presents efficient real time implementation methods for grayscale composite (opening and closing) function processing (FP) systems. The proposed method is based on a matrix representation of the composite FP system using a basis matrix. However, the straightforward implementation of the FP opening and closing has a complexity of O(N2), where N is the size of the structuring element. In order to improve the computational efficiency of the proposed implementation method, we present a recursive algorithm based on redundancy of the basis matrix and input matrices. It is shown that, with the proposed scheme, both opening and closing can be determined by 2N - 2 additions and 2N - 2 comparisons.

Original languageEnglish
Title of host publicationMidwest Symposium on Circuits and Systems
EditorsMagdy A. Bayoumi, Ken W. Jenkins
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages847-851
Number of pages5
Volume2
Publication statusPublished - 1994 Dec 1
EventProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2) - Lafayette, LA, USA
Duration: 1994 Aug 31994 Aug 5

Other

OtherProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2)
CityLafayette, LA, USA
Period94/8/394/8/5

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'Fast algorithms for grayscale morphological operations'. Together they form a unique fingerprint.

  • Cite this

    Lee, K. H., Morales, A., & Ko, S-J. (1994). Fast algorithms for grayscale morphological operations. In M. A. Bayoumi, & K. W. Jenkins (Eds.), Midwest Symposium on Circuits and Systems (Vol. 2, pp. 847-851). IEEE.