• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.517-524
• /
• 2004

The fuzzy set theory has been wide used in clustering of machine learning with data mining since fuzzy theory has been introduced in 1960s. In particular, fuzzy C-means algorithm is a popular fuzzy clustering algorithm up to date. An element is assigned to any cluster with each membership value using fuzzy C-means algorithm. This algorithm is affected from the location of initial cluster center and the proper cluster size like a general clustering algorithm as K-means algorithm. This setting up for initial clustering is subjective. So, we get improper results according to circumstances. In this paper, we propose a cluster merging using enhanced density based fuzzy C-means clustering algorithm for solving this problem. Our algorithm determines initial cluster size and center using the properties of training data. Proposed algorithm uses grid for deciding initial cluster center and size. For experiments, objective machine learning data are used for performance comparison between our algorithm and others.

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

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.191-197
• /
• 2011

An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.367-368
• /
• 2012

Possibilistic c-means (PCM) 알고리즘은 fuzzy c-means (FCM) 의 노이즈 민감성을 극복하기 위해 제안 되었다. 하지만, PCM 은 사용되는 시스템 파라미터들의 초기화와 coincident 클러스터링 문제로 인하여 그 성능이 민감하다. 본 논문에서는 이러한 문제점들을 극복하기 위해 개미군집 알고리즘(Ant colony algorithm)을 이용한 퍼지 클러스터링(fuzzy clustering) 알고리즘을 제안한다. 먼저, 개미군집 알고리즘을 통해 PCM 의 클러스터 개수 및 중심 값 파라미터를 최적화 하고, 미리 분류된 화소 정보를 이용하여 PCM 의 coincident 클러스터링 문제를 해결하였다. 제안된 알고리즘의 효율성을 의료 영상 분할 문제에 적용하여 확인하였다.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.81-90
• /
• 2007

This paper shows an intelligent disease diagnosis system for public. Our system deals with 30 diseases and their typical symptoms selected based on the report from Ministry of Health and Welfare, Korea. Technically, the system uses a modified FCM algorithm for clustering diseases and the input vector consists of the result of user-selected questionnaires. The modified FCM algorithm improves the quality of clusters by applying symmetrically measure based on the fuzzy theory so that the clusters are relatively sensitive to the shape of the pattern distribution. Furthermore, we extract the highest 5 diseases only related to the user-selected questionnaires based on the fuzzy membership function between questionnaires and diseases in order to avoid diagnosing unrelated disease.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.110-115
• /
• 2005

This paper proposes the method to detect contours of a face, eyes and a mouth in a color image for making an avatar automatically. First, we use the HSI color model to exclude the effect of various light condition, and we find skin regions in an input image by using the skin color is defined on HS-plane. And then, we use deformable templates and Genetic Algorithm(GA) to detect contours of a face, eyes and a mouth. Deformable templates consist of B-spline curves and control point vectors. Those can represent various shape of a face, eyes and a mouth. And GA is very useful search procedure based on the mechanics of natural selection and natural genetics. Second, an avatar is created automatically by using contours and Fuzzy C-means clustering(FCM). FCM is used to reduce the number of face color As a result, we could create avatars like handmade caricatures which can represent the user's identity, differing from ones generated by the existing methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.3
• /
• pp.185-191
• /
• 2007

Remote sensing images are multispectral image data collected from several band divided by wavelength ranges. The classification of remote sensing images is the method of classifying what has similar spectral characteristics together among each pixel composing an image as the important algorithm in this field. This paper presents a pattern classification method of remote sensing images by applying a possibilistic fuzzy c-means (PFCM) algorithm. The PFCM algorithm is a hybridization of a FCM algorithm, which adopts membership degree depending on the distance between data and the center of a certain cluster, combined with a PCM algorithm, which considers class typicality of the pattern sets. In this proposed method, we select the training data for each class and perform supervised classification using the PFCM algorithm with spectral signatures of the training data. The application of the PFCM algorithm is tested and verified by using Landsat TM and IKONOS remote sensing satellite images. As a result, the overall accuracy showed a better results than the FCM, PCM algorithm or conventional maximum likelihood classification(MLC) algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.37-38
• /
• 2011

본 논문은 상대적으로 대비도 차이가 크게 나타나는 역광 이미지에 대해서 Retinex 알고리즘을 적용하여 보정 했을 경우 발생하는 밝은 영역에서의 컬러 성분의 손실을 개선하기 위한 새로운 기법을 제안한다. 역광 이미지의 경우 밝은 영역과 어두운 영역에 대한 밝기 차이가 매우 크게 발생하기 때문에 Retinex 알고리즘을 이용하여 영상의 대비도를 향상시킬 경우 밝은 영역에서의 컬러 성분이 손실되는 현상이 발생한다. 이러한 손실을 보완하기 위해서 원본 영상의 밝은 영역에 해당하는 컬러 성분을 Retinex 알고리즘으로 보정된 영상에 추가해준다. Fuzzy c-means 군집화 알고리즘을 이용하여 원본 영상에서의 밝은 영역과 어두운 영역에 대하여 모든 화소의 소속 정도를 나타내는 퍼지 소속 함수를 구한다. 밝은 영역에 대해서의 컬러 성분은 원본 영상 값에 밝은 영역 퍼지 소속 함수를 적용하고, 어두운 영역에 대해서의 컬러 성분은 Retinex 복원 영상 값에 어두운 영역 퍼지 소속 함수를 이용한다. 제안하는 알고리즘의 성능 평가를 위해 역광 현상이 강하게 나타나는 자연영상들을 대상으로 적용하여 기존의 Retinex 알고리즘(MSRCR) 보다 우수한 성능을 가지고 있음을 보였다.

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.7-18
• /
• 2003

Due to the changes of shipping and logistic environment, Asian ports today face severe competition. To be a mega-hub port, Asian ports have achieved a big scale development. For these reasons, it has been widely recognized as an important study to analyze and evaluate characteristics of Asian ports, from the standpoint of Korea where Busan Port is located. Although some previous studies have been reported, most of them have been beyond the scope of Asian ports and analyzed the world's major ports; moreover, the studied ports have been about the ports which are well known from the previous research and reports. So, most studies is unlikely to be used as substantial indicators from the perspective of Busan Port. In addition. most of the existing studies have used hierarchical evaluation algorithm for port ranking, such as AHP (analytical hierarchy process) and clustering analysis. However, these two methods have fundamental weaknesses from the algorithm perspective. The aim of this study is to classify major Asian ports based on competitiveness level. Especially. in order to overcome serious problem of the existing studies, major Asian ports were analyzed by using objective indicators. and Fuzzy C-Means algorithm, which alleviates the weakness of the clustering method. It was found that 10 ports of 16 major Asian ports have their own phases and were classified into 4 port groups. This result implies that some ports have higher potential as ports to lead some zones in Asia. Based on those results. present status and future direction of Busan port were discussed as well.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.125-133
• /
• 2011

For any pattern matching based algorithm in WLAN environment, the characteristics of signal to noise ratio(SNR) to multiple access points(APs) are utilized to establish database in the training phase, and in the estimation phase, the actual two dimensional coordinates of mobile unit(MU) are estimated based on the comparison between the new recorded SNR and fingerprints stored in database. As fingerprinting method, k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighbors k and positions of reference points(RPs). So intuitive fuzzy c-means(IFCM) clustering algorithm is applied to improve KNN, which is the KNN/IFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN, k RPs are firstly chosen as the data samples of IFCM based on signal to noise ratio(SNR). Then, the k RPs are classified into different clusters through IFCM based on SNR. Experimental results indicate that the proposed KNN/IFCM hybrid algorithm generally outperforms KNN, KNN/FCM, KNN/PFCM algorithm when the locations error is less than 2m.