• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.25-31
• /
• 2011

Principal component analysis (PCA) is a well-known method for dimensionality reduction and feature extraction. Although PCA has been applied in many areas successfully, it is sensitive to outliers due to the use of sum-square-error. Several variants of PCA have been proposed to resolve the noise sensitivity and, among the variants, improved robust fuzzy PCA (RF-PCA2) demonstrated promising results. RF-PCA2, however, still can fall into a local optimum due to equal initial membership values for all data points. Another reason comes from the fact that RF-PCA2 is based on sum-square-error although fuzzy memberships are incorporated. In this paper, a variant of RF-PCA2 called RF-PCA3 is proposed. The proposed algorithm is based on the objective function of RF-PCA2. RF-PCA3 augments RF-PCA2 with the objective function of PCA and initial membership calculation using data distribution, which make RF-PCA3 to have more chance to converge on a better solution than that of RF-PCA2. RF-PCA3 outperforms RF-PCA2, which is demonstrated by experimental results.

• Proceedings of the KIPE Conference
• /
• 1998.07a
• /
• pp.309-313
• /
• 1998

고성능 서보 전동기 시스템을 구축하기 위해서는 저속영역과 고속영역을 포함하는 넓은 속도영역에서의 정확한 속도검출을 통한 정밀한 속도제어기 필수적이며, 관성모멘트와 같은 전동기의 파라메터 변동에 대해 강인한 속도제어와 외란 억제능력도 중요한 요소로서 고려되어야 한다. 변동하는 부하의 관성모멘트을 식별하여 PI 속도제어기를 실시간으로 적응 동정하고, 플랜트 잡음과 측정잡음을 고려하는 상태 관측기인 칼만필터의 부하관성에 대한 민감성을 제거하기 위해 이를 적응 동정하여 적응 상태 추정기를 구현함으로써 우수한 속도 추정 성능을 얻었다. 또한 외란과 불확실한 모델링은 등가 외란으로 추정되어 전향적으로 보상된다. 본 논문에서는 이러한 특징을 이용하여 전동기의 고성능 속도제어를 구현하고 유도전동기를 이용한 실험을 통하여 연구결과의 유효성을 확인한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.353-356
• /
• 2002

본 논문은 카오스 신호를 이용하여 안전한 음성신호의 전송을 위한 아날로그 비화통신 시스템의 성능분석에 관한 연구이다. 기존의 카오스 동기화 및 카오스 변조통신 알고리즘을 개선하여 실제 통신환경에서 발생하는 다양한 조건들을 적용하여 음성신호의 복원능력을 모의실험으로 분석하였다. 일반적인 PC 제어기법과 제안한 피드백 마스킹 기법을 사용하여 송신단에서 음성신호를 카오스 신호로 마스킹하여 변조하고, 통신채널에 잡음신호를 추가하여 전송하였다. 수신단에서는 카오스 응답시스템을 이용하여 음성신호를 복조하고, 복원성능을 계산하기 위하여 아날로그 복원 에러신호의 평균전력을 제안하여 계산하였다. 실험결과 마스킹 정도, 파라미터들의 민감성, 채널잡음 등에 대하여 PC 제어기법보다 피드백 제어기법의 복원성능이 우수함을 확인할 수 있었다. 또한 로렌쯔 카오스 시스템을 비화통신시스템에 사용할 경우 파라미터들의 조합으로 암호키를 구성해야 하므로 키값들의 선정에 기준이 되는 파라미터 변화율에 대응하는 복원에러율의 관계를 실험 값으로 구하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.361-369
• /
• 2002

In order to extract motion features from an input image acquired by a static CCD-camera in a restricted area, we need a robust algorithm to cope with noise sensitivity and condition change. In this paper, we proposed an efficient algorithm to extract and track motion features in a noisy environment or with sudden condition changes. We extract motion features by considering a change of neighborhood pixels when moving objects exist in a current frame with an initial background. To remove noise in moving regions, we used a morphological filter and extracted a motion of each object using 8-connected component labeling. Finally, we provide experimental results and statistical analysis with various conditions and models.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.52-61
• /
• 2006

Orthogonal wavelet tansform which is generally used in image and signal processing applications has limited performance because of lack of shift invariance and low directional selectivity. To overcome these demerits complex wavelet transform has been proposed. In this paper, we present an efficient image denoising method using dual-tree complex wavelet transform and Bernoulli-Gauss prior model. In estimating hyper-parameters for Bernoulli-Gaussian model, we present two simple and non-iterative methods. We use hypothesis-testing technique in order to estimate the mixing parameter, Bernoulli random variable. Based on the estimated mixing parameter, variance for clean signal is obtained by using maximum generalized marginal likelihood (MGML) estimator. We simulate our denoising method using dual-tree complex wavelet and compare our algorithm to well blown denoising schemes. Experimental results show that the proposed method can generate good denoising results for high frequency image with low computational cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1330-1341
• /
• 2010

Power analysis (PA) is known as a powerful physical attack method in the field of information security. This method uses the statistical characteristics of leaked power consumption signals measured from security devices to reveal the secret keys. However, when measuring a leakage power signal, it may be easily distorted by the noise due to its low magnitude values, and thus the PA attack shows different performances depending on the noise level of the measured signal. To overcome this vulnerability of the PA attack, we propose a noise-reduction method based on wavelet de-noising. Experimental results show that the proposed de-noising method improves the attack efficiency in terms of the number of signals required for the successful attack as well as the reliability on the guessing key.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2179-2181
• /
• 2003

기존의 이산시간 슬라이딩 모드 제어기에서는 주어진 슬라이딩 평면으로부터 등가 제어기를 설계하고 그로부터 폐루프 시스템의 고유값이 결정 되어 폐루프 시스템의 극점을 임의로 배치시키는 것이 어려웠다. 최근 슬라이딩 모드제어에 극점 배치기법을 도입하여 폐루프 시스템의 고유값을 임의로 배치시킬 수 있는 방법이 소개되었다. 그러나 극점 배치 기법은 루프 전달함수의 이득과 위상에 대한 여유도 관점에서 설계된 제어기가 아니므로 직접적으로 이득과 위상에 대한 여유도를 보장하기가 힘들다. 따라서 본 논문에서는 루프 전달함수의 이득과 위상에 대한 여유도를 확보할 수 있고 측정 잡음에 대한 민감성을 줄이기 위해 LTR과 멀티레이트 출력 제어기법을 적용해 해결하는 방법을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.37-45
• /
• 2013

Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.477-481
• /
• 2008

Place recognition is necessary for a mobile user to be provided with place-dependent information. This paper proposes real-time video based place recognition system that identifies users' current place while moving in the building. As for the feature extraction of a scene, there have been existing methods based on global feature analysis that has drawback of sensitive-ness for the case of partial occlusion and noises. There have also been local feature based methods that usually attempted object recognition which seemed hard to be applied in real-time system because of high computational cost. On the other hand, researches using statistical methods such as HMM(hidden Markov models) or bayesian networks have been used to derive place recognition result from the feature data. The former is, however, not practical because it requires huge amounts of efforts to gather the training data while the latter usually depends on object recognition only. This paper proposes a combined approach of global and local feature analysis for feature extraction to complement both approaches' drawbacks. The proposed method is applied to a mobile information system and shows real-time performance with competitive recognition result.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.11-18
• /
• 2010

Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.