• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.683-696
• /
• 2005

The results of using principal coordinates prior to cluster analysis are investigated on the samples from multiple binary outcomes. The retrieval ability of the known clustering algorithm is significantly improved by using principal coordinates instead of using the distance directly transformed from four association coefficients for multiple binary variables.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.4
• /
• pp.135-138
• /
• 2020

This paper suggests a method of automatic clustering to search of relevant digital photos using geo-coded information. The provided scheme labels photo images with their corresponding global positioning system coordinates and date/time at the moment of capture, and the labels are used as clustering metadata of the images when they are in the use of retrieval. Experimental results show that geo-location information can improve the accuracy of image retrieval, and the information embedded within the images are effective and precise on the image clustering.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.344-351
• /
• 2017

In this paper, we propose the obstacle database management module for obstacle estimation and clustering. The proposed G-eye manager system can create customized walking route for blind people using the UI manager and verify the coordinates of the path. Especially, G-eye management system designed a regional information module. The regional information module can improve the loading speed of the obstacle data by classifying the local information by clustering the coordinates of the obstacle. In this paper, we evaluate the reliability of the walking route generated from the obstacle map. We obtain the coordinate value of the path avoiding the virtual obstacle from the proposed system and analyze the error rate of the path avoiding the obstacle according to the size of the obstacle. And we analyze the correlation between obstacle size and route by classifying virtual obstacles into sizes.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.68-80
• /
• 1996

In this paper, we propose a novel color image segmentation algorithm based on clustering in 3-dimensional color space employing the mathematical morphology. More specifically, since we take into account the topological properties such as the shape, connectivity and distribution of clusters in the clustering process, the number of clusters in the color cube, as well as their centers, can be easily obtained, without a priori knowledge on the input images. Intensive computer simulation has been performed and the results are discussed in this paper. The resutls of the simulation on the images in various color coordinates show that the segmentation is independent of the choice of color coordinates and the shape of clustes. Segmentation results of the vector quantizer are also presented for the comparison purpose.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.10a
• /
• pp.83-86
• /
• 1986

In this paper, we propose the new color image segmentation algorithm using clustering method in the normalized r,g,b coordinates. The number of intrinsic clusters which are included in color image is estimated by the clustering quality measure and the initial centers of clusters are calculated by a hierarchical way. The proposed algorithm was varified by the computer simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.504-507
• /
• 2005

In this paper, we propose a calibration technique of 3D coordinates using orthogonal stereo vision. First, we acquire front- image and upper- image from stereo cameras with real time and extract each coordinates of a moving object using differential operation and ART2 clustering algorithm. Then, we can generate 3D coordinates of that moving object through combining these two coordinates. Finally, we calibrate 3D coordinates using orthogonal stereo vision since 3D coordinates are not accurate due to perspective. Experimental results show that accurate 3D coordinates of a moving object can be generated by the proposed calibration technique.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.638-643
• /
• 2012

This paper presents an intelligent reduction method for external noise. The main idea comes from PSO-FCM (Particle Swam Optimization Fused fuzzy C-Means) clustering. The data of the target is transformed from the antenna coordinates to the vessel one and to the system coordinates. In the conversion, the overall noises hinder observer to get the exact position and velocity of the maneuvering target. While the filter is used for tracking system, unexpected acceleration becomes the main factor which makes the uncertainty. In this paper, the tracking efficiency is improved with the PSO-FCM and the compensation methodology. The acceleration is approximated from the external noise splitted by the proposed clustering method. After extracting the approximated acceleration, the rest in the noise is filtered by the filter and the compensation is added to after that. Proposed tracking method is applicable to the linear model and nonlinear one together. Also, it can do to the on-line system. Finally, some examples are provided to examine the reliability of the proposed method.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.05a
• /
• pp.313-318
• /
• 2005

단 밴드 영상과는 달리 다차원 데이터는 분광적인 특성을 이용한 자동화된 영상 분석을 수행하는 장점이 있는 반면, 3차원 이상의 데이터를 분광차익 상에 시각화 하는데 어려움이 따른다. 클러스터링 기법을 이용한 영상 정보 추출은 자동화된 영상 분석적인 측면에서 중요한 분야 중 하나로서, 분광차원에서 구 형태의 조밀한 클러스터를 분리하는데 효과적인 방법으로 알려져 있지만 부정형(不定形)의 클러스터를 추출하는 방법에는 한계를 가진다. 따라서 본 연구는 모든 차원의 데이터를 2차원 상에 시각화하여 화소간 인접성을 개략적으로 확인할 수 있는 Star Coordinates 기법을 제안한다. 데이터의 다차원 시각화를 통해, 부정형 클러스터를 제거하여 다음 단계의 영상 분석 시 발생할 수 있는 오류를 방지할 수 있고, 명확한 클러스터를 확인 지정하여 클러스터링 정확도를 골일 수 있을 것으로 기대된다. 부가적인 연구고서, Star Coordinates 기법을 적용하여 Plot된 영상 데이터를 K-Means 알고리즘을 이용한 무감독 분류를 수행하여 그 결과를 확인하였다.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.177-190
• /
• 2001

전통적으로 많이 사용하는 군집분석의 방법들은 개체간의 거리를 고려하여 이들을 분류해 내는 것이며, 따라서 거리 측정 방법에 따라 여러 형태의 군집분석 방법이 나타나게 된다. 어떤 방법을 적용하던 간에 그 결과는 고정된 수치로써 나타난다. 다차원 자료의 구조파악이 몇 개의 수치로 나타나게 되면 어쩔 수 없이 정보의 손실이 발생하게 된다. 이를 보완하기 위해 시각적 매체를 동원하여 다차원 자료의 구조를 파악하는 연구가 있었으며, 이를 시각적 군집분석이라고 명명하고 있다. 본 연구에서는 시각적 군집분석에 대한 기본적 개념과 이를 위한 통계 도형의 활용, 구현방법 등에 대해 살펴보기로 한다.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.118-121
• /
• 1996

This paper describes ECG signal labeling based on Fuzzy clustering, which is necessary at automated ECG diagnosis. The NPPA(Non parametric partitioning algorithm) compares the correlations of wave forms, which tends to recognize the same wave forms as different when the wave forms have a little morphological variation. We propose to apply Fuzzy clustering to ECG QRS Complex labeling, which prevents the errors to mistake by using If-then comparision. The process is divided into two parts. The first part is a parameters extraction process from ECG signal, which is composed of filtering, QRS detection by mapping to a phase space by time delay coordinates and generation of characteristic vectors. The second is fuzzy clustering by FCM(Fuzzy c-means), which is composed of a clustering, an assessment of cluster validity and labeling.