arrow
Return

Adaptive basis matrix for the morphological function processing opening and closing

delete1997-05-01
delete9
PRE
AI
K
Kyung-Hoon Lee
A
Aldo Morales
S
Sung‐Jea Ko
DOI:10.1109/83.568935delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A method for adaptation of the basis matrix of the gray-scale function processing (FP) opening and closing under the least mean square (LMS) error criterion is presented. We proposed the basis matrix for efficient representation of opening and closing in [1] and [2]. Withz this representation, the opening and closing operations are accomplished by a local matrix operation rather than cascade operation. Moreover, the analysis of the basis matrix shows that the basis matrix is skeiy symmetric, permitting to derive a simpler matrix representation for opening and closing operators. Furthermore, we propose an adaptation algorithm of the basis matrix for both opening and closing. The LMS and backpropagation algorithms are utilized for adaptation of the basis matrix. At each iteration of the adaptation process, the elements of the basis matrix are updated using the estimation of gradient to decrease the mean square error (MSE) between the desired signal and the actual alter output. Some results of optimal morphological filters applied to two-dimensional (2-D) images are presented.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Image Processing cover
IEEE Transactions on Image Processing
IF:
13.7
Papers:
1.0W
Citations:
8.4W

Organization

No organization information available