Fast algorithms for grayscale morphological operations

Kyung Hoon Lee, Aldo W. 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 (US)
Title of host publicationMidwest Symposium on Circuits and Systems
EditorsMagdy A. Bayoumi, Ken W. Jenkins
PublisherIEEE
Pages847-851
Number of pages5
Volume2
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

Other

OtherProceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2)
CityLafayette, LA, USA
Period8/3/948/5/94

Fingerprint

Processing
Composite materials
Computational efficiency
Redundancy

All Science Journal Classification (ASJC) codes

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

Cite this

Lee, K. H., Morales, A. W., & 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.
Lee, Kyung Hoon ; Morales, Aldo W. ; Ko, Sung Jea. / Fast algorithms for grayscale morphological operations. Midwest Symposium on Circuits and Systems. editor / Magdy A. Bayoumi ; Ken W. Jenkins. Vol. 2 IEEE, 1994. pp. 847-851
@inproceedings{40f36277045841ee896df7e3afed79ca,
title = "Fast algorithms for grayscale morphological operations",
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.",
author = "Lee, {Kyung Hoon} and Morales, {Aldo W.} and Ko, {Sung Jea}",
year = "1994",
language = "English (US)",
volume = "2",
pages = "847--851",
editor = "Bayoumi, {Magdy A.} and Jenkins, {Ken W.}",
booktitle = "Midwest Symposium on Circuits and Systems",
publisher = "IEEE",

}

Lee, KH, Morales, AW & Ko, SJ 1994, Fast algorithms for grayscale morphological operations. in MA Bayoumi & KW Jenkins (eds), Midwest Symposium on Circuits and Systems. vol. 2, IEEE, pp. 847-851, Proceedings of the 37th Midwest Symposium on Circuits and Systems. Part 2 (of 2), Lafayette, LA, USA, 8/3/94.

Fast algorithms for grayscale morphological operations. / Lee, Kyung Hoon; Morales, Aldo W.; Ko, Sung Jea.

Midwest Symposium on Circuits and Systems. ed. / Magdy A. Bayoumi; Ken W. Jenkins. Vol. 2 IEEE, 1994. p. 847-851.

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

TY - GEN

T1 - Fast algorithms for grayscale morphological operations

AU - Lee, Kyung Hoon

AU - Morales, Aldo W.

AU - Ko, Sung Jea

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028749320&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028749320&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 847

EP - 851

BT - Midwest Symposium on Circuits and Systems

A2 - Bayoumi, Magdy A.

A2 - Jenkins, Ken W.

PB - IEEE

ER -

Lee KH, Morales AW, Ko SJ. Fast algorithms for grayscale morphological operations. In Bayoumi MA, Jenkins KW, editors, Midwest Symposium on Circuits and Systems. Vol. 2. IEEE. 1994. p. 847-851