• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.3
• /
• pp.306-310
• /
• 2004

This paper suggests a reverse segmentation algorithm using affix information and some preference pattern information of Korean compound nouns. The structure of Korean compound nouns is mostly derived from Chinese characters, and it includes some preference patterns utilized as a segmentation rule in this paper. To evaluate the accuracy of the proposed algorithm, an experiment was performed with 36,061 compound nouns. The experiment resulted in getting 99.3% of correct segmentation and showed excellent satisfactory results from the comparative experimentation with other algorithms. Especially, most of the four-syllable or five-syllable compound nouns were successfully segmented without fail.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.63-71
• /
• 2003

This paper describes a color image segmentation algorithm based on region merging using hue difference as a restrictive condition. The proposed algorithm using mathematical morphology and a modified watershed algorithm does over-segmentation in the RGB space to preserve contour information of regions. Then, the segmentation result of color image is acquired by repeated region merging using hue differences as a restrictive condition. This stems from human visual system based on hue, saturation, and intensity. Hue difference between two regions is used as a restrictive condition for region merging because it becomes more important factor than color difference if intensity is not low. Simulation results show that the proposed color image segmentation algorithm provides efficient segmentation results with the predefined number of regions for various color images.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.45-52
• /
• 2000

In this study, we propose the image segmentation algorithm for facial region segmentation. The proposed algorithm separates the mean image of low frequency band from the differential image of high frequency band in order to make a boundary using HWT, and then we reduce the isolation pixels, projection pixels, and overlapped boundary pixels from the low frequency band. Also the boundaries are detected and simplified by the proposed boundary detection algorithm, which are cleared on the thinning process of 1 pixel unit. After extracting facial image boundary by using the proposed algorithm, we make the mask and segment facial image through matching original image. In the result of facial region segmentation experiment by using the proposed algorithm, the successive facial segmentation have 95.88% segmentation value.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.4
• /
• pp.246-253
• /
• 2016

Infrared (IR) imaging has been researched for various applications such as surveillance. IR radiation has the capability to detect thermal characteristics of objects under low-light conditions. However, automatic segmentation for finding the object of interest would be challenging since the IR detector often provides the low spatial and contrast resolution image without color and texture information. Another hindrance is that the image can be degraded by noise and clutters. This paper proposes multi-level segmentation for extracting regions of interest (ROIs) and objects of interest (OOIs) in the IR scene. Each level of the multi-level segmentation is composed of a k-means clustering algorithm, an expectation-maximization (EM) algorithm, and a decision process. The k-means clustering initializes the parameters of the Gaussian mixture model (GMM), and the EM algorithm estimates those parameters iteratively. During the multi-level segmentation, the area extracted at one level becomes the input to the next level segmentation. Thus, the segmentation is consecutively performed narrowing the area to be processed. The foreground objects are individually extracted from the final ROI windows. In the experiments, the effectiveness of the proposed method is demonstrated using several IR images, in which human subjects are captured at a long distance. The average probability of error is shown to be lower than that obtained from other conventional methods such as Gonzalez, Otsu, k-means, and EM methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.431-436
• /
• 2014

Cell segmentation which extracts cell objects from background is one of basic works in bio-imaging which analyze cell images acquired from live cells in cell culture. In the case of clear images, they have a bi-modal histogram distribution and segmentation of them can easily be performed by global threshold algorithm such as Otsu algorithm. But In the case of degraded images, it is difficult to get exact segmentation results. In this paper, we developed a cell segmentation system that it classify input images by the type of their histogram distribution and then apply a proper segmentation algorithm. If it has a bi-modal distribution, a global threshold algorithm is applied for segmentation. Otherwise it has a uni-modal distribution, our algorithm is performed. By experimentation, our system gave exact segmentation results for uni-modal cell images as well as bi-modal cell images.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.111-114
• /
• 2004

Object-based segmentation is the first essential step for image processing applications. Recently, SAR (Synthetic Aperture Radar) segmentation techniques have been developed, however not enough to preserve the significant information contained in the small regions of the images. The proposed method is to partition an SAR image into homogeneous regions by using a fuzzy hit-or-miss operator with an inherent spatial transformation, which endows to preserve the small regions. In our algorithm, an iterative segmentation technique is formulated as a consequential process. Then, each time in iterating, hypothesis testing is used to evaluate the quality of the segmented regions with a homogeneity index. The segmentation algorithm is unsupervised and employed few parameters, most of which can be calculated from the input data. This comparative study indicates that the new iterative segmentation algorithm provides acceptable results as seen in the tested examples of satellite images.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.389-391
• /
• 2007

This paper describes about the printed character segmentation and recognition system for slabs in steel manufacturing process. To increase the recognition rate, it is important to improve success rate of character segmentation. Since Slabs front area surface are not uniform and surface temperature is very high, marked characters not only undergo damages but also have much noise. On the other hand, since almost marked characters are very thick and the space between characters is only about 10 $^{\sim}$ 15 mm, there are many touching characters. Therefore appropriate character image preprocessing and segmentation algorithm is needed. In this paper we propose a multi-local thresholding method for damaged character restoration, a modified touching character segmentation, algorithm for marked characters. Finally a effective Multi-Class SVM is used to recognize segmented characters.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.151-159
• /
• 2006

The ratio of a segmentation algorithm of compound nouns causes an effect a lot in nouns which are not in the dictionary. The structure of Korean compound nouns are mostly derived from the Chinese characters and it includes some preference ratio. So it will be able to use segmentation rule of compound nouns. This paper suggests a segmentation algorithm using some preference ratio of Korean compound nouns which are not in the dictionary. The experiment resulted in getting 88.49% of correct segmentation and showed effective result from the comparative experimentation with other algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

The current paper proposes a genetic algorithm (GA)-based segmentation method that can automatically extract and track moving objects. The proposed method mainly consists of spatial and temporal segmentation; the spatial segmentation divides each frame into regions with accurate boundaries, and the temporal segmentation divides each frame into background and foreground areas. The spatial segmentation is performed using chromosomes that evolve distributed genetic algorithms (DGAs). However, unlike standard DGAs, the chromosomes are initiated from the segmentation result of the previous frame, then only unstable chromosomes corresponding to actual moving object parts are evolved by mating operators. For the temporal segmentation, adaptive thresholding is performed based on the intensity difference between two consecutive frames. The spatial and temporal segmentation results are then combined for object extraction, and tracking is performed using the natural correspondence established by the proposed spatial segmentation method. The main advantages of the proposed method are twofold: First, proposed video segmentation method does not require any a priori information second, the proposed GA-based segmentation method enhances the search efficiency and incorporates a tracking algorithm within its own architecture. These advantages were confirmed by experiments where the proposed method was success fully applied to well-known and natural video sequences.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.299-300
• /
• 2006

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.