• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.84-91
• /
• 2006

In this paper, we present a new segmentation algorithm for color images based on mathematical morphology and a Gaussian mixture model(GMM). We use the morphological operations to determine the number of components in a mixture model and to detect their modes of each mixture component. Next, we have adopted the GMM to represent the probability distribution of color feature vectors and used the deterministic annealing expectation maximization (DAEM) algorithm to estimate the parameters of the GMM that represents the multi-colored objects statistically. Finally, we segment the color image by using posterior probability of each pixel computed from the GMM. The experimental results show that the morphological operation is efficient to determine a number of components and initial modes of each component in the mixture model. And also it shows that the proposed DAEM provides a global optimal solution for the parameter estimation in the mixture model and the natural color images are segmented efficiently by using the GMM with parameters estimated by morphological operations and the DAEM algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.23-34
• /
• 2004

In this paper we propose a feature point tracking algorithm using optical flow under non-prior taming active feature model (NPT-AFM). The proposed algorithm mainly focuses on analysis non-rigid objects[1], and provides real-time, robust tracking by NPT-AFM. NPT-AFM algorithm can be divided into two steps: (i) localization of an object-of-interest and (ii) prediction and correction of the object position by utilizing the inter-frame information. The localization step was realized by using a modified Shi-Tomasi's feature tracking algoriam[2] after motion-based segmentation. In the prediction-correction step, given feature points are continuously tracked by using optical flow method[3] and if a feature point cannot be properly tracked, temporal and spatial prediction schemes can be employed for that point until it becomes uncovered again. Feature points inside an object are estimated instead of its shape boundary, and are updated an element of the training set for AFH Experimental results, show that the proposed NPT-AFM-based algerian can robustly track non-rigid objects in real-time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.49-60
• /
• 2002

We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.168-179
• /
• 2002

In this paper, we investigate video representation techniques that are the foundational work for the subsequent video processing such as video storage and retrieval. A video data set if a collection of video clips, each of which is a sequence of video frames and is represented by a multidimensional data sequence (MDS). An MDS is partitioned into video segments considering temporal relationship among frames, and then similar segments of the clip are grouped into video clusters. Thus, the video clip is represented by a small number of video clusters. The video segmentation and clustering algorithm, VDCluster, proposed in this paper guarantee clustering quality to south an extent that satisfies predefined conditions. The experiments show that our algorithm performs very effectively with respect to various video data sets.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.705-716
• /
• 2002

This paper proposes a method which visualizes MRI head data in 3 dimensions with direct volume rendering. Though surface rendering is usually used for MRI data visualization, it has some limits of displaying little speckles because it loses the information of the speckles in the surfaces while acquiring the information. Direct volume rendering has ability of displaying little speckles, but it doesn't treat MRI data because of the data features of MRI. In this paper, we try to visualize MRI head data in 3 dimensions as follows. First, we separate the brain region from the head region of MRI head data, next increase the pixel level of the brain region, then combine the brain region with the increased pixel level and the head region without brain region, last visualizes the combined MRI head data with direct volume rendering. We segment the brain region from head region based on histogram threshold, morphology operations and snakes algorithm. The proposed segmentation method shows 91~95% similarity with a hand segmentation. The method rather clearly visualizes the organs of the head in 3 dimensions.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.19-25
• /
• 2013

In this paper, we propose an approach to tracking road regions from video sequences. The proposed method segments and tracks road regions by utilizing the prior information from the result of the previous frame. For the efficiency of the system, we have a simple assumption that the road region is usually shown in the lower part of input images so that lower 60% of input images is set to the region of interest(ROI). After initial segmentation using flood-fill algorithm, we merge neighboring regions based on color similarity measure. The previous segmentation result, in which seed points for the successive frame are extracted, is used as prior information to segment the current frame. The similarity between the road region of the previous frame and that of the current frame is measured by the modified Jaccard coefficient. According to the similarity we refine and track the detected road regions. The experimental results reveal that the proposed method is effective to segment and track road regions in noisy and non-noisy environments.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.4
• /
• pp.249-255
• /
• 2004

In fingerprint verification and identification, fingerprint and background region should be segmented. For this purpose, most systems obtain variance of brightness of X and Y direction using Sobel mask. To decide given local region is background or not, the variance is compared with a certain threshold. Although this method is simple, most fingerprint image does not separated with two region of fingerprint and background region. In this paper, we presented a new segmentation algorithm based on Run-Length Connectivity analysis. For a given binary image after thresholding, suggested algorithm calculates RL of X and Y direction. Until the given image is segmented to two regions, small run region is successively inverted. Experimental result show that this algorithm effectively separates fingerprint region and background region.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.88-97
• /
• 2000

This paper presents motion estimation method using region segmentation information Motion estimation which is very difficult to be implemented only by software because of intensive computation cost, is implemented by special-purpose hardware in real-time applications In this paper, we propose region based motion estimation algorithm which can reduce the computation cost by using region segmentation information and setting the variable search window compared with FSMA algorithm Secondly, another proposed algorithm is to segment semantic region like face for selective coding and transfer of semantic region using segmented region information This work alms to improving the subjective quality of skin color region or face region m the picture that has slow motion and IS mainly composed of one or two speakers of video conference and video telephony applications.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.297-303
• /
• 2007

In this paper, the stroke-based text extraction algorithm for digital video is proposed. The proposed algorithm consists of four stages such as text detection, text localization, text segmentation and geometric verification. The text detection stage ascertains that a given frame in a video sequence contains text. This procedure is accomplished by morphological operations for the pixels with higher possibility of being stroke-based text, which is called as seed points. For the text localization stage, morphological operations for the edges including seed points ate adopted followed by horizontal and vortical projections. Text segmentation stage is to classify projected areas into text and background regions according to their intensity distribution. Finally, in the geometric verification stage, the segmented area are verified by using prior knowledge of video text characteristics.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.49-57
• /
• 2012

Conventional fuzzy c-means (FCM) algorithms have achieved a good clustering performance. However, they do not fully utilize the spatial information in the image and this results in lower clustering performance for images that have low contrast, vague boundaries, and noises. To overcome this issue, we propose an enhanced spatial fuzzy c-means (ESFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors in a $3{\times}3$ square window. To evaluate between the proposed ESFCM and various FCM based segmentation algorithms, we utilized clustering validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), and Xie-Bdni function ($V_{xb}$). Experimental results show that the proposed ESFCM outperforms other FCM based algorithms in terms of clustering validity functions.