• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2010

Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.151-156
• /
• 2015

In this paper, we have proposed personal multimodal biometric authentication system based on face detection, recognition and speaker verification for smart-phone environment. Proposed system detect the face with Modified Census Transform algorithm then find the eye position in the face by using gabor filter and k-means algorithm. Perform preprocessing on the detected face and eye position, then we recognize with Linear Discriminant Analysis algorithm. Afterward in speaker verification process, we extract the feature from the end point of the speech data and Mel Frequency Cepstral Coefficient. We verified the speaker through Dynamic Time Warping algorithm because the speech feature changes in real-time. The proposed multimodal biometric system is to fuse the face and speech feature (to optimize the internal operation by integer representation) for smart-phone based real-time face detection, recognition and speaker verification. As mentioned the multimodal biometric system could form the reliable system by estimating the reasonable performance.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.115-119
• /
• 2005

In this paper, we propose a method that search the sweet spot of array antenna beam, and keep it for fast speed transmission in millimeter wave on single array antenna link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on single array antenna link.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.7
• /
• pp.23-27
• /
• 2000

We provide an useful method to design codebooks with better performance than conventional methods. In the proposed method, new codevectors obtained from learning iterations are not the centroid vectors which are the representatives of partitions, but the vectors manipulated by the distance between new codevectors and old codevectors in the early stages of learning iteration. Experimental results show that the codevectors obtained by the proposed method converge to a locally better optimal codebook.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.4
• /
• pp.721-727
• /
• 2016

In this paper, in order to resolve the problem of reduction for D2D (device to device) advertisement dissemination efficiency of conventional dissemination algorithms, we here propose several clustering algorithms (modified single linkage algorithm (MSL), K-means algorithm, and expectation maximization algorithm with Gaussian mixture model (EM)) based advertisement dissemination algorithms to improve advertisement dissemination efficiency in D2D communication networks. Target areas are clustered in several target groups by the proposed clustering algorithms. Then, D2D advertisements are consecutively distributed by using a routing algorithm based on the geographical distribution of the target areas and a relay selection algorithm based on the distance between D2D sender and D2D receiver. Via intensive MATLAB simulations, we analyze the performance excellency of the proposed algorithms with respect to maximum number of relay transmissions and D2D user density ratio in a target area and a non-target area.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.47-54
• /
• 2005

In this paper, we propose a method that search the sweet spot of antenna beam, and keep it for fast speed transmission in millimeter wave on point-to-point link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on point-to-point link.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.289-292
• /
• 2001

This paper investigates a RBF equalizer (RBFE) reducing a center Estimating Speed. One of method for RBF center estimation is using k-means clustering. The performance of RBFE is depends on the estimation ability of the RBF center. We Propose a RBF Equalizer using modified k-means clustering algorithm (MKMC) to speed up channel estimation and to reduce complexity of calculation. Computer simulations are included to illustrate the analytical results. It is shown that a discussed method improves about 1 dB via less training data.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.7
• /
• pp.57-60
• /
• 1998

본 논문에서는 MKM(Modified K-Means) 알고리듬의 성능을 개선하기 위해 새로운 학습알고리듬을 제안한다. MKM 알고리듬에서 새로운 코드워드는 이전 코드워드와 새로 얻 은 중심점을 이은 직선 상의 임의적으로 선택된다. 따라서 MKM 알고리듬은 통계적 이완 방법의 코드북 교란 알고리듬으로 이해될 수 있다. MKM 알고리듬을 통계적 이완 알고리듬 과 비교해보면 도입되는 교란의 양이 상대적으로 적고 그 교란 자체도 임의적이지 않다는 걸 알 수 있다. 따라서 MKM 알고리듬에 도입되는 교란의 양을 보다 크고 임의적이게 하면 MKM 알고리듬이 국소 최적화에 빠질 가능성이 줄어들 것이다. 따라서 본 논문에서는 MKM 알고리듬의 코드북 갱신과정을 변화시킨 새로운 알고리듬을 제안하였으며, 화상 데이 터와 음성 데이터를 이용하여 실험한 결과 제안된 알고리듬이 MKM 알고리듬보다 우수한 성능을 보인다는 걸 확인할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.276-283
• /
• 1994

Using a neural network for vector quantization, we can expect to have better codebook design algorithm for its adaptive process. Also, the designed codebook puts the codewords in order by its self-organizing characteristics, which makes it possible to partially search the codebook for real time process. To exploit these features of the neural network, in this paper, we propose a new codebook design algorithm that modified the KSFM(Kohonen`s Self-organizing Feature Map) and then combines the K-means algorithm. Experimental results show the performance improvment and the ability of the partical seach of the codebook for the real time process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3112-3127
• /
• 2018

Since time series clustering is performed without prior information, it is used for exploratory data analysis. In particular, clusters of time series with similar shapes can be used in various fields, such as business, medicine, finance, and communications. However, existing time series clustering algorithms have a problem in that time series with different shapes are included in the clusters. The reason for such a problem is that the existing algorithms do not consider the limitations on the size of the generated clusters, and use a dimension reduction method in which the information loss is large. In this paper, we propose a method to alleviate the disadvantages of existing methods and to find a better quality of cluster containing similarly shaped time series. In the data preprocessing step, we normalize the time series using z-transformation. Then, we use piecewise aggregate approximation (PAA) to reduce the dimension of the time series. In the clustering step, we use density-based spatial clustering of applications with noise (DBSCAN) to create a precluster. We then use a modified K-means algorithm to refine the preclusters containing differently shaped time series into subclusters containing only similarly shaped time series. In our experiments, our method showed better results than the existing method.