• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1161-1170
• /
• 2004

This paper proposes to segment skin color areas using a clustering algorithm. Most of previously proposed clustering algorithms have some difficulties, since they generally detect hyperspherical clusters, run in a batch mode, and predefine a number of clusters. In this paper, we use a well-known elliptical clustering algorithm, an EM algorithm, and modify it to learn on-line and find automatically the number of clusters, called to an EAM algorithm. The effectiveness of the EAM algorithm is demonstrated on a task of skin color region segmentation. Experimental results present the EAM algorithm automatically finds a right number of clusters in a given image without any information on the number. Comparing with the EM algorithm, we achieved better segmentation results with the EAM algorithm. Successful results were achieved to detect and segment skin color regions using a conditional probability on a region. Also, we applied to classify images with persons and got good classification results.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.11-18
• /
• 2008

Document clustering is an important method for document analysis and is used in many different information retrieval applications. This paper proposes a new document clustering model using the re-weighted term based NMF(non-negative matrix factorization) to cluster documents relevant to a user's requirement. The proposed model uses the re-weighted term by using user feedback to reduce the gap between the user's requirement for document classification and the document clusters by means of machine. The Proposed method can improve the quality of document clustering because the re-weighted terms. the semantic feature matrix and the semantic variable matrix, which is used in document clustering, can represent an inherent structure of document set more well. The experimental results demonstrate appling the proposed method to document clustering methods achieves better performance than documents clustering methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.267-271
• /
• 2007

본 논문은 원본이미지와 은닉이미지의 좋은 압축률과 만족할만한 이미지의 질, 그리고 외부공격에 강인한 이미지은닉의 한 방법으로 특이치 분해와 퍼지 군집화를 이용한 벡터양자화를 이용한 워터마킹 방법을 소개하였다. 실험에서는 은닉된 이미지의 비가시성과 외부공격에 대한 강인성을 증명하였다.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.34 no.1
• /
• pp.60-67
• /
• 2014

The comparisons between cellulolytic bacteria adhesion on rice straw and fiber digestion in time course during rumen fermentation were studied in situ. The adhesions of cellulolytic bacteria, F. succinogenes. R. albus and R. flavefaciens, were measured by RT-PCR. When the rice straws were incubated at 0. 2, 4, 8, 12 and 24 hours of the in situ rumen, straw was degraded with increasing speed during the incubation and showed the highest disappearance increasing rate (DM g/h) from 8 to 12 hour. The adhesions of F. succinogenes, R. flavefaciens and R. albus were achieved above 80% in 1 hour of in situ rumen fermentation and then keep adhesive population up after the time of fermentation. When the in situ samples were collected at 0, 5, 10, 30 and 60 min to detect the early stages of adhesion on the rice straws ingested into rumen, the numberous adhesive colony of F. succinogenes, R. flavefaciens and R. albus were detected in 5 min. In case of rice straw treated with 0, 2, 4 and 8% NaOH, all of three cellulolytic bacteria showed the increasing trends of adhesion with increasing DM disappearance of rice straw by higher concentration of NaOH at 12 hour of in situ. However, there were showed respectively difference at 24 hour. The present results gave certain evidence that adhesion of cellulolytic bacteria is definitely achieved in early stage of roughage ingestion into rumen, their colony develop the stable communities on roughage in process of rumen fermentation and then fiber degradation is accelerated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.598-600
• /
• 2005

군집 유효화 평가란 기본적으로 클래스 (Class)에 대한 정보가 주어지지 않은 상태에서 다양한 입력 변수에 의해 발생되는 군집화의 결과들을 평가하여 그들 중에서 주어진 데이터 집합의 자연적인 분할 상태에 가장 적합한 결과를 찾는 기법을 말한다. 군집 유효화 평가에서 그 척도로 사용되는 것이 군집 유효화 지수이다. 본 논문에서는 우선 현존하는 다양한 군집 유효화 지수들 중에서 합 형식을 가지는 지수들을 다룬다. 구체적으로 이 지수들의 설계 원리와 각 지수들의 부합성 (Compliance) 분석한다. 다음으로 분석을 통해 밝혀진 그들의 단점을 보완할 수 있는 새로운 군집 유효화 지수들을 제안한다. 마지막으로 기존의 군집 유효화 지수들을 포함한 새로이 제안한 지수들의 성능을 실험 학습을 통해 평가한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.20-27
• /
• 2006

Multi-level thresholding is a method that is widely used in image segmentation. However most of the existing methods are not suited to be directly used in applicable fields and moreover expanded until a step of image segmentation. This paper proposes region-based multi-level thresholding as an image segmentation method. At first we classify pixels of each color channel to two clusters by using EWFCM(Entropy-based Weighted Fuzzy C-Means) algorithm that is an improved FCM algorithm with spatial information between pixels. To obtain better segmentation results, a reduction of clusters is then performed by a region-based reclassification step based on a similarity between regions existing in a cluster and the other clusters. The clusters are created using the classification information of pixels according to color channel. We finally perform a region merging by Bayesian algorithm based on Kullback-Leibler distance between a region and the neighboring regions as a post-processing method as many regions still exist in image. Experiments show that region-based multi-level thresholding is superior to cluster-, pixel-based multi-level thresholding, and the existing mettled. And much better segmentation results are obtained by the post-processing method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.1-8
• /
• 2007

In electronic commerce, it is important for users to recommend the proper item among large item sets with saving time and effort. Therefore, if the recommendation system can be recommended the suitable item, we will gain a good satisfaction to the user. In this paper, we proposed the associative relation clustering split method in the collaborative filtering in order to perform the accuracy and the scalability. We produce the lift between associative items using the ratings data. and then split the node group that consists of the item to improve an efficiency of the associative relation cluster. This method differs the association about the items of groups. If the association of groups is filled, the reminding items combine. To estimate the performance, the suggested method is compared with the K-means and EM in the MovieLens data set.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.94-103
• /
• 2008

In this paper, we adapt the $\kappa$-means clustering technique to segmenting a given 3D mesh. In order to avoid the locally minimal convergence and speed up the computing time, first we extract sharp vertices from the mesh by analysing its curvature and convexity that respectively reflect the local and global geometric characteristics from the viewpoint of cognitive science. Next the sharp vertices are partitioned into $\kappa$ clusters by iterated converging with the $\kappa$-means clustering method based on the geodesic distance instead of the Euclidean distance between each pair of the sharp vertices. For obtaining the effective result of $\kappa$-means clustering method, it is crucial to assign an initial value to $\kappa$ appropriately. Hence, we automatically compute a reasonable number of clusters as an initial value of $\kappa$. Finally the mesh segmentation is completed by merging other vertices except the sharp vertices into the nearest cluster by geodesic distance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.488-490
• /
• 2011

본 논문에서는 문서 영상에서 글자 분할 및 인식이 필요 없는 단어 검색 알고리즘을 제안한다. 글자 분할을 하지 않고 검색하기 위해 영상 검색에 사용되는 SIFT특징을 이용하였다. 제안하는 알고리즘은 사용자가 입력한 질의어를 질의 영상으로 변환하고, 질의 영상에서 SIFT특징을 추출한다. 추출된 특징은 문서영상에서 추출한 특징과 매칭을 통해 매칭점 쌍을 생성한다. 생성된 매칭점 쌍들을 군집화 조건에 따라 군집화 한다. 군집화는 질의 영상과 지리적 분포가 유사하게 군집화 되도록 설계되었다. 생성된 군집은 군집에 포함된 특징점의 개수가 많을수록 질의 영상과 유사하다. 따라서 N개 이상의 원소를 가지는 군집을 결과로 출력한다. 실험한 결과 제안하는 알고리즘의 가능성을 확인할 수 있었다.