• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.109-112
• /
• 1999

Image segmentation is the critical first step in image information extraction for computer vision systems. Clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are divided from the fuzzy c-means(FCM) algorithm. The FCM algorithm uses fie probabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belonging or compatibility. Moreover, the FCM algorithm has considerable trouble under noisy environments in the feature space. Recently, a possibilistic approach to clustering(PCM) for solving above problems was proposed. In this paper, we used the PCM for color image segmentation. This approach differs from existing fuzzy clustering methods for color image segmentation in that the resulting partition of the data can be interpreted as a possibilistic partition. So, the problems in the FCM can be solved by the PCM. But, the clustering results by the PCM are not smoothly bounded, and they often have holes. The region growing was used as a postprocessing after smoothing the noise points in the pixel seeds. In our experiments, we illustrate that the PCM us reasonable than the FCM in noisy environments.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.476-479
• /
• 2003

The Rough transform (HT) is often used for extracting global features in binary images, for example curve and line segments, from local features such as single pixels. The HT is useful due to its insensitivity to missing edge points and occlusions, and robustness in noisy images. However, it possesses some disadvantages, such as time and memory consumption due to the number of input data and the selection of an optimal and efficient resolution of the accumulator space can be difficult. Another problem of the HT is in the difficulty of peak detection due to the discrete nature of the image space and the round off in estimation. In order to resolve the problem mentioned above, a possibilistic C-means approach to clustering [1] is used to cluster neighboring peaks. Several experimental results are given.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.102-107
• /
• 2009

The Possibilistic C-means(PCM) was proposed to overcome some of the drawbacks associated with the Fuzzy C-means(FCM) such as improved performance for noise data. However, PCM possesses some drawbacks such as sensitivity in initial parameter values and to patterns that have relatively short distances between the prototypes. To overcome these drawbacks, we propose an interval type 2 fuzzy approach to PCM by considering uncertainty in the fuzzy parameter m in the PCM algorithm.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1731-1741
• /
• 1999

Color images are often corrupted by the noise due to noisy sensors or channel transmission errors. Some filters such as vector media and vector $\alpha$-trimmed mean filter have bee used for color noise removal. In this paper, We propose the fuzzy cluster filters based on the possibilistic c-means clustering, because the possibilistic c-means clustering can get robust memberships in noisy environments. Also, we propose weighted vector $\alpha$-trimmed mean filter to improve the conventional vector $\alpha$-trimmed mean filter. In this filter, the central data are more weighted than the outlying data. In this paper, we implemented the color noise generator to evaluate the performance of the proposed filters in the color noise environments. The NCD measure and visual measure by human observer are used for evaluation the performance of the proposed filters. In the experiment, proposed fuzzy cluster filters in the sense of NCD measure gave the best performance over conventional filters in the mixed noise. Simulation results showed that proposed weighted vector $\alpha$-trimmed mean filters better than the conventional vector $\alpha$-trimmed mean filter in any kinds of noise.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.146-153
• /
• 2010

For the indoor location, wireless fingerprinting is most favorable because fingerprinting is most accurate among the technique for wireless network based indoor location which does not require any special equipments dedicated for positioning. 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 neighborsk and positions of reference points(RPs). So possibilistic fuzzy c-means(PFCM) clustering algorithm is applied to improve KNN, which is the KNN/PFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN,k RPs are firstly chosen as the data samples of PFCM based on signal to noise ratio(SNR). Then, thek RPs are classified into different clusters through PFCM based on SNR. Experimental results indicate that the proposed KNN/PFCM hybrid algorithm generally outperforms KNN and KNN/FCM algorithm when the locations error is less than 2m.