• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1392-1394
• /
• 1996

This paper presents an algorithm to separate vowels from consonants in Korean characters captured in noisy images and to recognize them. The algorithm has been originally developed for the recognition of the usage code (which is represented by a single Korean character) in the license plates or Korean vehicles. It, however, could be easily adopted to other applications with minor changes, in which character recognition is needed and the environment is noisy. The key ideas or the algorithm are to localize the vowels utilizing the Hough transformation and to separate the vowels from consonants utilizing mathematical morphology. We observed that the presented algorithm effectively separates vowels even if the vowels and consonants are joined together after thresholding. We also observed that our algorithm outperforms some conventional algorithms especially when the input images are noisy. The details of the comparison study are presented in the paper.

• Smart Structures and Systems
• /
• v.28 no.6
• /
• pp.779-789
• /
• 2021

Cracks in railway sleeper are an inevitable condition and has a significant influence on the safety of railway system. Although the technology of railway sleeper condition monitoring using machine learning (ML) models has been widely applied, the crack recognition accuracy is still in need of improvement. In this paper, a two-stage method using edge detection and convolutional neural network (CNN) is proposed to reduce the burden of computing for detecting cracks in railway sleepers with high accuracy. In the first stage, the edge detection is carried out by using the 3×3 neighborhood range algorithm to find out the possible crack areas, and a series of mathematical morphology operations are further used to eliminate the influence of noise targets to the edge detection results. In the second stage, a CNN model is employed to classify the results of edge detection. Through the analysis of abundant images of sleepers with cracks, it is proved that the cracks detected by the neighborhood range algorithm are superior to those detected by Sobel and Canny algorithms, which can be classified by proposed CNN model with high accuracy.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1421-1431
• /
• 2005

There are two methods in 3-D sound reproduction: a surround system, like 3.1 channel method and a binaural system using 2-channel method. The binaural system utilizes the sound localization principle of a human using two ears. Generally, a crosstalk between each channel of 2-channel loudspeaker system should be canceled to produce a natural 3-D sound. To solve this problem, it is necessary to trace a head movement. In this paper, we propose a new algorithm to correctly trace the head movement of a listener. The Proposed algorithm is based on the detection of face and eye. The face detection uses the intensity of an image and the position of eyes is detected by a mathematical morphology. When the head of the listener moves, length of borderline between face area and eyes may change. We use this information to the tracking of head movement. A computer simulation results show That head movement is effectively estimated within +10 margin of error using the proposed algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.23-28
• /
• 2017

Shape from focus (SFF) is a technique used to reconstruct 3D shape of objects from a sequence of images obtained at different focus settings of the lens. In this paper, a new shape from focus method for 3D reconstruction of microscopic objects is described, which is based on gradient operator in Mathematical Morphology. Conventionally, in SFF methods, a single focus measure is used for measuring the focus quality. Due to the complex shape and texture of microscopic objects, single measure based operators are not sufficient, so we propose morphological operators with multi-structuring elements for computing the focus values. Finally, an optimal focus measure is obtained by combining the response of all focus measures. The experimental results showed that the proposed algorithm has provided more accurate depth maps than the existing methods in terms of three-dimensional shape recovery.

• Journal of the Korean Institute of Navigation
• /
• v.19 no.3
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.113-117
• /
• 1998

The image recognition, with various technics, recently presented an effective recognition scheme both for image and character. The analyzing process, however, is highly complicated so that this does not utilized fully. This paper examines the validity of the image recognition through morphology, which is simple and a theory of sets. The morphology applies erosion and dilation, opening and closing, and structuring element.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.4
• /
• pp.7-17
• /
• 2002

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.883-898
• /
• 1996

In this paper, we propose improved method to recognize the shape for enhancing the quality of the pattern recognition system by compressing the source images. In the proposed method, we reduced the data amount by skeletonizing the source images using mathematical morphology, and then matched patterns after accomplishing the translation and scale normalization, and rotation invariance on the transformed images. Through the scale normalization, it was possible for the shape recognition at minimum amount of the pixel by giving the weight to the skeleton pixel. As the source images was replaced by the skeleton images, it was possible to reduce the amount of data and computational loads dramatically, and so become much faster even with a smaller memory capacity. Through the experiment, we investigated the optimum scale factor and good result was proved when realizing the pattern recognition system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1221-1227
• /
• 2015

Edge detection is one of the important technologies to simplify images in the text, lane and object recognition implementation process, and various studies are actively carried out at home and abroad. Existing edge detection methods include a method to detect edge by applying directional gradient masks in spatial space, and a mathematical morphology-based edge detection method. These existing detection methods show insufficient edge detection results in excessively dark or bright images. In this regard, to complement these drawbacks, we proposed an algorithm using the Sobel and histogram equalization among the existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1076-1082
• /
• 2005

Recently, there have been much efforts in the image segmentation using morphological approach. Among them, the watershed algorithm is one of powerful tools which can take advantages of both of the conventional edge-based segmentation and region-based segmentation. The concept of watershed is based on topographic analogy. But, its high sensitivity to noise yields a very large number of resulting segmented regions which leads to oversegmentation. So we suggest the restricted waterfall algorithm which reduce the oversegmentation by eliminate not only local minima but also local maxima. As a result, the restricted waterfall algorithm has a good segmented image than the other methods, and has a better binary image than the histogram thresholding method.