• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.661-666
• /
• 2003

In this paper, the conventional k-modes and fuzzy k-modes algorithms for clustering categorical data is extended by representing the clusters of categorical data with fuzzy centroids instead of the hard-type centroids used in the original algorithm. The hard-type centroids of the traditional algorithms had difficulties in dealing with ambiguous boundary data, which might be misclassified and lead to thelocal optima. Use of fuzzy centroids makes it possible to fully exploit the power of fuzzy sets in representing the uncertainty in the classification of categorical data. The distance measure between data and fuzzy centroids is more precise and effective than those of the k-modes and fuzzy k-modes. To test the proposed approach, the proposed algorithm and two conventional algorithms were used to cluster three categorical data sets. The proposed method was found to give markedly better clustering results.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.318-320
• /
• 2012

증강현실 콘텐츠를 2D 이미지기반으로 저작할 때, 작성된 증강현실 콘텐츠를 카메라 시점과 일치시켜 합성하기 위해 호모그래피를 이용한다. 이때 증강현실 콘텐츠를 이질감 없이 합성하기위해 정확한 호모그래피 행렬을 추정해야 한다. 그러나 호모그래피 행렬 추정 시 사용되는 특징점들이 선형을 이루거나, 특정 영역에 군집을 이루는 경우 정확한 호모그래피 행렬을 추정하지 못하는 문제가 발생한다. 본 논문에서는 이러한 문제를 해결하기 위해 선형제약, 거리제약을 적용한 CSP 기반의 RANSAC 알고리즘을 제안한다. 실험결과 호모그래피 행렬 추정 시 CSP를 적용한 RANSAC 알고리즘이 기존의 랜덤샘플링 또는 삼각형의 넓이를 이용한 샘플링을 적용한 RANSAC 알고리즘보다 정확도가 향상됨을 보였다.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.23-30
• /
• 2021

Although the manufacturing time series data clustering technique is an important grouping solution in the field of detecting and improving manufacturing large data-based equipment and process defects, it has a disadvantage of low accuracy when applying the existing static data target clustering technique to time series data. In this paper, an evolutionary computation-based time series cluster analysis approach is presented to improve the coherence of existing clustering techniques. To this end, first, the image shape resulting from the manufacturing process is converted into one-dimensional time series data using linear scanning, and the optimal sub-clusters for hierarchical cluster analysis and split cluster analysis are derived based on the Pearson distance metric as the target of the transformation data. Finally, by using a genetic algorithm, an optimal cluster combination with minimal similarity is derived for the two cluster analysis results. And the performance superiority of the proposed clustering is verified by comparing the performance with the existing clustering technique for the actual manufacturing process image.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.73-82
• /
• 2005

This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

• Journal of Aerospace System Engineering
• /
• v.17 no.6
• /
• pp.46-53
• /
• 2023

As urban traffic congestion and environmental pollution are becoming significant issues in major cities, Urban Air Mobility (UAM) is gaining attention as an efficient solution. In this study, we conducted a geographic information system (GIS)-based spatial analysis and clustering algorithm considering the actual data of the terrain and infrastructure in the Busan area, through which we were able to select the location of vertiports and corridors (flight routes) for the UAM operation. Based on the Gimhae International Airport, which is expected to be the center of the UAM infrastructure system in the Busan region, we judged that three vertiport locations in the target area were suitable. Subsequently, we used the A^* (A-star) algorithm considering Ground Risk to select a flight path that minimized both risk and distance. Through this, we confirmed a risk reduction effect of 80.168% compared to the minimum distance route.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.931-936
• /
• 2004

GBFCM(DM), Gradient-based Fuzzy c-means with Divergence Measure, for efficient clustering of GPDF(Gaussian Probability Density Function) in MPEG VBR video data modeling is proposed in this paper. The proposed GBFCM(DM) is based on GBFCM( Gradient-based Fuzzy c-means) with the Divergence for its distance measure. In this paper, sets of real-time MPEG VBR Video traffic data are considered. Each of 12 frames MPEG VBR Video data are first transformed to 12-dimensional data for modeling and the transformed 12-dimensional data are Pass through the proposed GBFCM(DM) for classification. The GBFCM(DM) is compared with conventional FCM and GBFCM algorithms. The results show that the GBFCM(DM) gives 5∼15% improvement in False Alarm Rate over conventional algorithms such as FCM and GBFCM.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.01a
• /
• pp.227-228
• /
• 2013

본 논문에서는 연속적으로 입력되는 스테레오 입체 영상으로부터 2차원과 3차원의 특징을 결합하여 군집화함으로써 대상 물체를 보다 강건하게 분할하는 기법을 제안한다. 제안된 방법에서는 촬영된 장면의 좌우 영상으로부터 스테레오 정합 알고리즘을 이용해 영상의 각 화소별로 카메라와 물체 사이의 거리를 나타내는 깊이 특징을 추출한다. 그런 다음, 깊이와 색상 특징을 효과적으로 군집화하여 배경에 해당하는 영역을 제외하고, 전경에 해당하는 대상 물체를 감지한다. 실험에서는 제안된 방법을 여러가지 영상에 적용하여 테스트를 해 보았으며, 제안된 방법이 기존의 2차원 기반의 물체 분리 방법에 비해 보다 강건하게 대상물체를 분할함을 확인하였다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.572-587
• /
• 2008

The Self-organizing Feature Map(SOFM) that is one of unsupervised neural networks is a very powerful tool for data clustering and visualization in high-dimensional data sets. Although the SOFM has been applied in many engineering problems, it needs to cluster similar weights into one class on the trained SOFM as a post-processing, which is manually performed in many cases. The traditional clustering algorithms, such as t-means, on the trained SOFM however do not yield satisfactory results, especially when clusters have arbitrary shapes. This paper proposes automatic clustering on trained SOFM, which can deal with arbitrary cluster shapes and be globally optimized by graph cuts. When using the graph cuts, the graph must have two additional vertices, called terminals, and weights between the terminals and vertices of the graph are generally set based on data manually obtained by users. The Proposed method automatically sets the weights based on mode-seeking on a distance matrix. Experimental results demonstrated the effectiveness of the proposed method in texture segmentation. In the experimental results, the proposed method improved precision rates compared with previous traditional clustering algorithm, as the method can deal with arbitrary cluster shapes based on the graph-theoretic clustering.