• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.60-65
• /
• 2014

This paper describes an efficient framework for the extraction of a brain tumor from magnetic resonance (MR) images. Before the segmentation process, a median filter is used to filter the image. Then, the morphological gradient is computed and added to the filtered image for intensity enhancement. After the enhancement process, the thresholding value is calculated using the mean and the standard deviation of the image. This thresholding value is used to binarize the image followed by the morphological operations. Moreover, the combination of these morphological operations allows to compute the local thresholding image supported by a flood-fill algorithm and a pixel replacement process to extract the tumor from the brain. Thus, this framework provides a new source of evidence in the field of segmentation that the specialist can aggregate with the segmentation results in order to soften his/her own decision.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.191-197
• /
• 2016

Since 3D measurement technologies have been widely used in manufacturing industries edge detection in a depth image plays an important role in computer vision applications. In this paper, we have proposed an edge detection process in a depth image based on the image based smoothing and morphological operations. In this method we have used the principle of Median filtering, which has a renowned feature for edge preservation properties. The edge detection was done based on Canny Edge detection principle and was improvised with morphological operations, which are represented as combinations of erosion and dilation. Later, we compared our results with some existing methods and exhibited that this method produced better results. However, this method works in multiframe applications with effective framerates. Thus this technique will aid to detect edges robustly from depth images and contribute to promote applications in depth images such as object detection, object segmentation, etc.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.516-517
• /
• 2015

The automatic traffic sign detection and recognition has been one of the highly researched and an important component of advanced driver assistance systems (ADAS). They are designed especially to warn the drivers of imminent dangers such as sharp curves, under construction zone, etc. This paper presents a traffic sign recognition (TSR) system using morphological operations and multiple descriptors. The TSR system is realized in three stages: segmentation, shape classification and recognition stage. The system is designed to attain maximum accuracy at the segmentation stage with the inclusion of morphological operations and boost the computation time at the shape classification stage using MB-LBP descriptor. The proposed system is tested on the German traffic sign recognition benchmark (GTSRB) and on Korean traffic sign dataset.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.76-83
• /
• 1993

A morphological filtering algorithm using directional information is presented. Directional filtering technique is effective in reducing noises and preserving edges. The proposed directional filtering is composed of two stage filtering processes. The opening and closing operations in the lst stage are performed for the pixels is aligned to the vertical, horizontal, and two diagonal directions, respectively. The opening operation supresses the positive impulse noises, while the closing operation the negative ones. Then, each directional result and their average value are filtered by the opening or closing operations in the 2nd stage. The averaging operation diminishes the effects of Gaussian noises in the homogeneous regions. Thus, the morphological operation in the 1 st stageremoves the impulse noises and in 2nd stage reduces. Gaussian ones. The experimental results show that the proposed filtering is superior to the existing nonlinear filtering in the aspects of the subjective quality. Also, the morphological filtering method reduces the computational loads.

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

• 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 Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.1
• /
• pp.92-98
• /
• 2019

In this paper, we propose a deep learning system based on morphological neural network(MNN). The deep learning layers are morphological operation layer, pooling layer, ReLU layer, and the fully connected layer. The operations used in morphological layer are erosion, dilation, and edge detection, etc. Unlike CNN, the number of hidden layers and kernels applied to each layer is limited in MNN. Because of the reduction of processing time and utility of VLSI chip design, it is possible to apply MNN to various mobile embedded systems. MNN performs the edge and shape detection operations with a limited number of kernels. Through experiments using database images, it is confirmed that MNN can be used as a deep learning system and its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.1861-1871
• /
• 1994

This paper presents efficient real time software implementation methods for the grayscale morphological composite function processing (FP) system. The proposed method is based on a matrix representation of the composite FP system using a basis matrix composed of structuring elements. We propose a procedure to derive the basis matrix for composite FP systems with any grayscale structuring element (GSE). It is shown that composite FP operations including morphological opening and closing are more efficiently accomplished by a local matrix operation with the basis matrix rather than cascade operations, eliminating delays and requiring less memory storage. In the second part of this paper, a VLSI implementation architecture for grayscale morphological operators is presented. The proposed implementation architecture employs a bit-serial approach which allows grayscale morphological operations to be decomposed into bit-level binary operation unit for the p-bit grayscale singnal. It is shown that this realization is simple and modular structure and thus is suitable for VLSI implementation.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3E
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation 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.