Block basis matrix implementation of the morphological open-closing and close-opening

Sung-Jea Ko, Aldo Morales, Kyung Hoon Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this letter, we propose a method for the real-time implementation of function processing (FP), open-closing (OC), and close-opening (CO) morphological operations. The proposed method is based on the block basis matrix (BBM), which is an extension of the basis matrix. A procedure to obtain the BBM is proposed. This matrix is skew symmetric, and some related properties lead to simplify the FP morphological operations. It is shown that the real-time calculation of open-closing and close- opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage.

Original languageEnglish
Pages (from-to)7-9
Number of pages3
JournalIEEE Signal Processing Letters
Volume2
Issue number1
DOIs
Publication statusPublished - 1995 Jan 1

Fingerprint

Morphological Operations
Real-time
Processing
Skew
Cascade
Simplify
Data storage equipment

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Block basis matrix implementation of the morphological open-closing and close-opening. / Ko, Sung-Jea; Morales, Aldo; Lee, Kyung Hoon.

In: IEEE Signal Processing Letters, Vol. 2, No. 1, 01.01.1995, p. 7-9.

Research output: Contribution to journalArticle

@article{ef58d6283a3e417c884619b254c0fd0b,
title = "Block basis matrix implementation of the morphological open-closing and close-opening",
abstract = "In this letter, we propose a method for the real-time implementation of function processing (FP), open-closing (OC), and close-opening (CO) morphological operations. The proposed method is based on the block basis matrix (BBM), which is an extension of the basis matrix. A procedure to obtain the BBM is proposed. This matrix is skew symmetric, and some related properties lead to simplify the FP morphological operations. It is shown that the real-time calculation of open-closing and close- opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage.",
author = "Sung-Jea Ko and Aldo Morales and Lee, {Kyung Hoon}",
year = "1995",
month = "1",
day = "1",
doi = "10.1109/97.365518",
language = "English",
volume = "2",
pages = "7--9",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Block basis matrix implementation of the morphological open-closing and close-opening

AU - Ko, Sung-Jea

AU - Morales, Aldo

AU - Lee, Kyung Hoon

PY - 1995/1/1

Y1 - 1995/1/1

N2 - In this letter, we propose a method for the real-time implementation of function processing (FP), open-closing (OC), and close-opening (CO) morphological operations. The proposed method is based on the block basis matrix (BBM), which is an extension of the basis matrix. A procedure to obtain the BBM is proposed. This matrix is skew symmetric, and some related properties lead to simplify the FP morphological operations. It is shown that the real-time calculation of open-closing and close- opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage.

AB - In this letter, we propose a method for the real-time implementation of function processing (FP), open-closing (OC), and close-opening (CO) morphological operations. The proposed method is based on the block basis matrix (BBM), which is an extension of the basis matrix. A procedure to obtain the BBM is proposed. This matrix is skew symmetric, and some related properties lead to simplify the FP morphological operations. It is shown that the real-time calculation of open-closing and close- opening is accomplished by local matrix operations rather than cascade operations (opening/closing followed by closing/opening), thus eliminating delays and requiring less memory storage.

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

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

U2 - 10.1109/97.365518

DO - 10.1109/97.365518

M3 - Article

AN - SCOPUS:0029211522

VL - 2

SP - 7

EP - 9

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 1

ER -