Fast algorithms for grayscale morphological operations

Kyung Hoon Lee, Aldo Morales, Sung Jea Ko

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations


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 (US)
Number of pages5
StatePublished - 1994
EventProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2) - Lafayette, LA, USA
Duration: Aug 3 1994Aug 5 1994


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

All Science Journal Classification (ASJC) codes

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


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

Cite this