• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.49-57
• /
• 2012

Conventional fuzzy c-means (FCM) algorithms have achieved a good clustering performance. However, they do not fully utilize the spatial information in the image and this results in lower clustering performance for images that have low contrast, vague boundaries, and noises. To overcome this issue, we propose an enhanced spatial fuzzy c-means (ESFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors in a $3{\times}3$ square window. To evaluate between the proposed ESFCM and various FCM based segmentation algorithms, we utilized clustering validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), and Xie-Bdni function ($V_{xb}$). Experimental results show that the proposed ESFCM outperforms other FCM based algorithms in terms of clustering validity functions.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.357-362
• /
• 2008

The new approach was proposed which uses Shannon function based on variable length in order to detect the edges of image. The proposed casted the detection of edges in images on the space information of the images. In addition the algorithm which measures the possibility of edges was proposed. Lots of simulations showed that the approach in this paper was more good than the conventional methods in detecting meaningful discontinuities in gray level.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.225-227
• /
• 2006

The transmission network clustering using a fuzzy entropy function are proposed in this paper. We can define a similarity measure through a fuzzy entropy. All node in the transmission network system has its own values indicating the physical characteristics of that system and the similarity measure in this paper is defined through the system-wide characteristic values at each node. However, to tackle the geometric mis-clustering problem, that is, to avoid the clustering of geometrically distant locations with similar measures, the locational informations are properly considered and incorporated in the proposed similarity measure. In this paper, a new regional clustering measure for the transmission network system is proposed and proved. The proposed measure is verified through IEEE 39 bus system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.349-352
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, we have proposed the fuzzy entropy function and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1390-1397
• /
• 1996

In this paper, in case of segmenting an image by a fuzzy entropy, an image segmentation algorithm is derived under an extended fuzzy entropy including the probabilistic including the probabilistic information in order to cover the toal uncertainty of information contained in fuzzy sets. By describing the image with fuzzysets, the total uncertainty of a fuzzy set consists of the uncertain information arising from its fuzziness and the uncertain information arising from the randomness in its ordinary set. To optimally segment all the boundary regions in the image, the total entropy function is computed by locally applving the fuzzy and Shannon entropies within the width of the fuzzy regions and the image is segmented withthe global maximum andlocal maximawhich correspond to the boundary regions. Comtional one by detecting theboundary regions more than 5 times.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.755-758
• /
• 2001

본 논문에서는 서로 다른 크기의 클러스터에 대해서 효과적으로 데이터를 분류할 수 있는 내부클러스터를 이용한 개선된 FCM 알고리즘을 제안하였다. 내부클러스터는 평균내부거리 안쪽에 속하는 데이터 집합으로 클러스터의 크기와 밀도에 비례한다. 그러므로 이를 이용한 개선된 FCM 알고리즘은 기존의 FCM 알고리즘이 클러스터 크기가 다를 경우 퍼지분할과 중심탐색을 제대로 하지 못하는 문제점을 개선한 수 있다. 실험을 통하여 개선된 FCM 알고리즘이 분류 엔트로피에 의해 기존의 FCM 알고리즘 보다 더 좋은 결과를 나타냄을 알 수 있었다.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2876-2878
• /
• 1999

There have been several tipical methods being used to measure the fuzziness (entropy) of fuzzy sets. Pedrycz is the original motivation of this paper. This paper studies the entropy variation on the fuzzy numbers with arithmetic operations(addition, subtraction, multiplication). It is shown that through the arithmetic operations, the entropy of the resultant fuzzy number has the arithmetic relation with the entropy of each original fuzzy number. This paper generalize earlier results of Pedrycz [FSS 64(1994) 21-30] and Wang and Chiu [FSS 103(1999) 443-455].

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.183-188
• /
• 2013

A variety of cluster analysis techniques prerequisite to cluster objects having similar characteristics in data mining. But the clustering of those algorithms have lots of difficulties in dealing with categorical data within the databases. The imprecise handling of uncertainty within categorical data in the clustering process stems from the only algebraic logic of rough set, resulting in the degradation of stability and effectiveness. This paper proposes a information-theoretic rough entropy(RE) by taking into account the dependency of attributes and proposes a technique called min-mean-mean roughness(MMMR) for selecting clustering attribute. We analyze and compare the performance of the proposed technique with K-means, fuzzy techniques and other standard deviation roughness methods based on ZOO dataset. The results verify the better performance of the proposed approach.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.55-62
• /
• 2014

This paper proposes a fault detection method utilizing converted images of acoustic emission signals and texture analysis for identifying bearing's multi-faults which frequently occur in an induction motor. The proposed method analyzes three texture features from the converted images of multi-faults: multi-faults image's entropy, homogeneity, and energy. These extracted features are then used as inputs of a fuzzy-ARTMAP to identify each multi-fault including outer-inner, inner-roller, and outer-roller. The experimental results using ten times trials indicate that the proposed method achieves 100% accuracy in the fault classification.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.