• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.135-144
• /
• 2003

A method for the automatic segmentation of speech signals is described. The method is dedicated to the construction of a large database for a Text-To-Speech (TTS) synthesis system. The main issue of the work involves the refinement of an initial estimation of phone boundaries which are provided by an alignment, based on a Hidden Market Model(HMM). Multi-layer perceptron (MLP) was used as a phone boundary detector. To increase the performance of segmentation, a technique which individually trains an MLP according to phonetic transition is proposed. The optimum partitioning of the entire phonetic transition space is constructed from the standpoint of minimizing the overall deviation from hand labelling positions. With single speaker stimuli, the experimental results showed that more than 95% of all phone boundaries have a boundary deviation from the reference position smaller than 20 ms, and the refinement of the boundaries reduces the root mean square error by about 25%.

• Journal of the HCI Society of Korea
• /
• v.6 no.1
• /
• pp.9-16
• /
• 2011

The previous researches of 3D object modeling have been performed in a limited environment where a target object only exists. However, in order to model an object in the real environment, we need to consider a dynamic environment, which has various objects and a frequently changing background. Therefore, this paper presents a segmentation and tracking method for a foreground which includes a target object in the dynamic environment. By using depth information than color information, the foreground region can be segmented and tracked more robustly. In addition, the foreground region can be tracked on the sequential images by referring depth distributions of the foreground region because both the position and the status in the consecutive images of the foreground region are almost unchanged. Experimental results show that our proposed method can robustly segment and track the foreground region in various conditions of the real environment. Moreover, as an application of the proposed method, it is presented a method for modeling an object extracting the object regions from the foreground region that is segmented and tracked.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2555-2564
• /
• 2000

In this paper, a new unsupervised image segmentation algorithm is proposed. To model the contextual information presented in images, the characteristics of the Markov random fields (MRF) are utilized. Textured images are modeled as realizations of the stationary Gaussian MRF on a two-dimensional square lattice using the conditional autoregressive (CAR) equations with a second-order noncausal neighborhood. To detect boundaries, hypothesis tests over two masked areas are performed. Under the hypothesis, masked areas are assumed to belong to the same class of textures and CAR equation parameters are estimated in a minimum-mean-square-error (MMSE) sense. If the hypothesis is rejected, a measure of dissimilarity between two areas is accumulated on the rejected area. This approach produces potential edge maps. Using these maps, boundary detection can be performed, which resulting no micro edges. The performance of the proposed algorithm is evaluated by some experiments using real images as weB as synthetic ones. The experiments demonstrate that the proposed algorithm can produce satisfactorY segmentation without any a priori information.

• 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 the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.1-11
• /
• 2007

As the availability of an image information has been significantly increasing, necessity of system that can manage an image information is increasing. Accordingly, we proposed the region-based content retrieval(CBIR) algorithm based on an efficient combination of an image segmentation, an image texture, a color feature and an image's shape and position information. As a color feature, a HSI color histogram is chosen which is known to measure spatial of colors well. We used active contour and CWT(complex wavelet transform) to perform an image segmentation and extracting an image texture. And shape and position information are obtained using Hu invariant moments in the luminance of HSI model. For efficient similarity computation, the extracted features(color histogram, Hu invariant moments, and complex wavelet transform) are combined and then precision and recall are measured. As a experimental result using DB that was supported by www.freefoto.com. the proposed image retrieval engine have 94.8% precision, 82.7% recall and can apply successfully image retrieval system.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.521-526
• /
• 2005

In this Paper, we propose a keyword spotting system as an alternative to searching system for poor quality Korean document images and compare the Proposed system with an OCR-based document retrieval system. The system is composed of character segmentation, feature extraction for the query keyword, and word-to-word matching. In the character segmentation step, we propose an effective method to remove the connectivity between adjacent characters and a character segmentation method by making the variance of character widths minimum. In the query creation step, feature vector for the query is constructed by a combination of a character model by typeface. In the matching step, word-to-word matching is applied base on a character-to-character matching. We demonstrated that the proposed keyword spotting system is more efficient than the OCR-based one to search a keyword on the Korean document images, especially when the quality of documents is quite poor and point size is small.

• Korean Journal of Remote Sensing
• /
• v.27 no.3
• /
• pp.379-388
• /
• 2011

At present, GEOBIA (Geographic Object-based Image Analysis), heir of OBIA (Object-based Image Analysis), is regarded as an important methodology by object-oriented paradigm for remote sensing, dealing with geo-objects related to image segmentation and classification in the different view point of pixel-based processing. This also helps to directly link to GIS applications. Thus, GEOBIA software is on the booming. The main theme of this study is to look into the applicability of geo-spatial processing open source to GEOBIA. However, there is no few fully featured open source for GEOBIA which needs complicated schemes and algorithms, till It was carried out to implement a preliminary system for GEOBIA running an integrated and user-oriented environment. This work was performed by using various open sources such as OTB or PostgreSQL/PostGIS. Some points are different from the widely-used proprietary GEOBIA software. In this system, geo-objects are not file-based ones, but tightly linked with GIS layers in spatial database management system. The mean shift algorithm with parameters associated with spatial similarities or homogeneities is used for image segmentation. For classification process in this work, tree-based model of hierarchical network composing parent and child nodes is implemented by attribute join in the semi-automatic mode, unlike traditional image-based classification. Of course, this integrated GEOBIA system is on the progressing stage, and further works are necessary. It is expected that this approach helps to develop and to extend new applications such as urban mapping or change detection linked to GIS data sets using GEOBIA.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.216-222
• /
• 2008

This paper proposed the multi characters detection algorithm using Color segmentation and the closing curve feature of LoG Operator in order to complement the demerit of the existing research which is weak in complexity of background, variety of light and disordered line and similarity of left and background color, etc. The proposed multi characters detection algorithm divided into three parts : The feature detection, characters format and characters detection Parts in order to be possible to apply to image of various feature. After preprocess that the new multi characters detection algorithm that proposed in this paper used wavelet, morphology, hough transform which is the synthesis logical model in order to raise detection rate by acquiring the non-perfection characters as well as the perfection characters with processing OR operation after processing each color area by AND operation sequentially. And the proposal algorithm is simulated with natural images which include natural character area regardless of size, resolution and slant and so on of image. And the proposal algorithm in this paper is confirmed to an excellent detection rate by compared with the conventional detection algorithm in same image.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.103-110
• /
• 2015

Recently, Classification of characters in a 3D FPS game has emerged as a very significant issue. In this study, We propose the game character Classification method using Image Region Segmentation of the extracting meaningful object in a simple operation. In this method, first used a non-linear RGB color model and octree color quantization scheme. The input image represented a less than 20 quantized color and uses a small number of meaningful color histogram. And then, the image divided into small blocks, calculate the degree of similarity between the color histogram intersection and adjacent block in block units. Because, except for the block boundary according to the texture and to extract only the boundaries of the object block. Set a region by these boundary blocks as a game object and can be used for FPS game play. Through experiment, we obtain accuracy of more than 80% for Classification method using each feature. Thus, using this property, characters could be classified effectively and it draws the game more speed and strategic actions as a result.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.324-333
• /
• 2001

In this paper we present a novel color image segmentation algorithm based on a Gaussian Mixture Model(GMM). It is introduced a Deterministic Annealing Expectation Maximization(DAEM) algorithm which is developed using the principle of maximum entropy to overcome the local maxima problem associated with the standard EM algorithm. In our approach, the GMM is used to represent the multi-colored objects statistically and its parameters are estimated by DAEM algorithm. We also develop the automatic determination method of the number of components in Gaussian mixtures models. The segmentation of image is based on the maximum posterior probability distribution which is calculated by using the GMM. The experimental results show that the proposed DAEM can estimate the parameters more accurately than the standard EM and the determination method of the number of mixture models is very efficient. When tested on two natural images, the proposed algorithm performs much better than the traditional algorithm in segmenting the image fields.