Block Basis Matrix Implementation of the Morphological Open-Closing and Close-Opening

Sung Jea Ko; Kyung Hoon Lee; Aldo Morales

doi:10.1109/97.365518

Block Basis Matrix Implementation of the Morphological Open-Closing and Close-Opening

Sung Jea Ko, Kyung Hoon Lee, Aldo Morales

School of Science, Engineering & Technology (Harrisburg)

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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 [1]. 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. 1070-9908/95$04.00

Original language	English (US)
Pages (from-to)	7-9
Number of pages	3
Journal	IEEE Signal Processing Letters
Volume	2
Issue number	1
DOIs	https://doi.org/10.1109/97.365518
State	Published - Jan 1995

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/97.365518

Cite this

@article{9412ae3f02904076829537ff712cac59,

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 [1]. 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. 1070-9908/95$04.00",

author = "Ko, {Sung Jea} and Lee, {Kyung Hoon} and Aldo Morales",

year = "1995",

month = jan,

doi = "10.1109/97.365518",

language = "English (US)",

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 - Lee, Kyung Hoon

AU - Morales, Aldo

PY - 1995/1

Y1 - 1995/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 [1]. 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. 1070-9908/95$04.00

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 [1]. 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. 1070-9908/95$04.00

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

SN - 1070-9908

VL - 2

SP - 7

EP - 9

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 1

ER -

Block Basis Matrix Implementation of the Morphological Open-Closing and Close-Opening

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this