• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.151-155
• /
• 1996

This paper derives the two-dimensional probability distribution and density functions of morphological dilation and erosion of a one-dimensional memoryless source and reports numerical results for a uniform source, thus providing methodology for joint distributions for other morphological operations. The joint density functions expressed in closed forms contain the Dirac delta functions due to the joint discontinuity within the dilation and erosion. They also exhibit symmetry between these two morphological density functions of dilated and/or eroded sources, in the computation of other higher moments thereof, and in multidimensional quantization.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.79-93
• /
• 1997

This paper presents a linear shift-invariant system euqivalent to morphological dilation for a memoryless uniform source in the sense of the power spectral density function, and comares it with dialtion. This equivalent LSI system is found through spectral decomposition and, for dilation and with windwo size L, it is shown to be a finite impulse response filter composed of L-1 delays, L multipliers and three adders. Th ecoefficients of the equivalent systems are tabulated. The comparisons of dilation and its equivalent LSI system show that probability density functions of the output sequences of the two systems are quite different. In particular, the probability density functon from dilation of an independent and identically distributed uniform source over the unit interval (0, 1) shows heavy probability in around 1, while that from the equivalent LSI system shows probability concentration around themean vlaue and symmetricity about it. This difference is due to the fact that dilation is a non-linear process while the equivalent system is linear and shift-ivariant. In the case that dikation is fabored over LSI filters in subjective perforance tests, one of the factors can be traced to this difference in the probability distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1109-1116
• /
• 1992

Mathematical morphology, theoretical foundation for morphological filter, is very efficient for the analysis of the geometrical characteristics of signals and systems and is used as a predominant tool for smoothing the data with noise. In this study, H/W design of morphological filter is implemented to process the gray scale dilation and the erosion in the same circuit and to choose the maximum and minimum value by a selector, resulting in their education of the complexity of the circuit and an architecture for parallel processing. The structure of morphological filter consists of the structuring-element block, the image data block, the control block, the ADD block, the MIN/MAX block, etc, and is designed on an one-chip for real time operation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.2
• /
• pp.175-180
• /
• 2018

In this paper, a feature extraction and object recognition algorithm using only morphological operations is proposed. The morphological operations used in feature extraction are erosion and dilation, opening and closing combining erosion and dilation, and morphological edge and skeleton detection operation. In the process of recognizing an object based on features, a pooling operation is applied to reduce the dimension. Among various structuring elements, $3{\times}3$ rhombus, $3{\times}3$ square, and $5{\times}5$ circle are arbitrarily selected in morphological operation process. It has confirmed that the proposed algorithm can be applied in object recognition fields through experiments using Internet images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1264-1270
• /
• 1992

MF(Morphological filter) is generally composed of several morphological operation, which are the diverse structuring element. The two basic operation are erosion and dilation. The two other operation, opening and closing, are defined based on these two operation. Performance of open-closing(OC) is better exellent than close-opening(CO) to reduce noise of image data with Gaussian noise. In this paper, to use the hybrid median filter in processing the image, is shown that hybrid median filter has better results image quality than other filters, to analyze by computer simulation.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.814-817
• /
• 2005

Fast binary dilation and erosion algorithms using run-length encoding (RLE) are proposed. RLE is an alternative way of representing a binary image using a run, which is a sequence of '1' pixels. First, we derive the run-based representation of dilation and erosion and then present the full steps of the proposed algorithms in detail.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1095-1106
• /
• 1994

This paper presents a method for determining optimal grayscale function processing(FP) morphological filters under the least square (LMS) error criterion. The optimal erosion and dilation filters with a grayscale structuring element(GSE) are determined by minimizing the mean square error (MSE) between the desired signal and the filter output. It is shown that convergence of the erosion and dilation filters can be achieved by a proper choice of the step size parameter of the LMS algorithm. In an attempt to determine optimal closing and opening filters, a matrix representation of both opening and closing with a basis matrix is proposed. With this representation, opening and closing are accomplished by a local matrix operation rather than cascade operations. The LMS and back-propagation algorithm are utilzed for obtaining the optimal basis matrix for closing and opening. Some results of optimal morphological filters applied to 2-D images are presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.111-117
• /
• 1996

In tis paper, a new morphological algorihtm for binary image reconstruction from graayscale skeleton is proposed. In the proposed algorithm, grayscale morphological dilation is utilizedm instead of binary morphological operatons for the conventional methods. The algorithm is proven mathematically and verified by computer simulation results.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.3-8
• /
• 1999

In this paper, we propose a new connected operator using morphological grayscale reconstruction for region-based coding. First, an effective method of reference-image creation is proposed, which is based on the size as well as the contrast. The conventional connected operators are good for removing small regions, but have a serious drawback for low-contrast regions that are larger than the structuring element. That is, when the conventional connected operators are applied to these regions. the simplification becomes less effective or several meaningful regions are merged to one region. To avoid this, the conventional geodesic dilation is modified to propose an adaptive operator. To reduce the effect of inappropriate propagation, pixels reconstructed to the original values are excluded in the dilation operation. Experimental results have shown that the proposed algorithm achieves better performance in terms of the reconstruction of flat zones. The picture quality has also been improved by about 7dB, compared to the conventional methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.899-908
• /
• 1995

In this paper, the probabilistic relations of dual morphological operations, such as dilation and erosion, closing and opening, and close- open and open-close, and the statistical properties for a continuous stationary lst order Gauss-Markov source are analyzed. The result is that the dual filters have symmetrical means and skews, and equal variances. Also, the statistics of morphological filters are very similar with those of input source, as correlation coefficient increases.