• 제어로봇시스템학회논문지
• /
• 제12권4호
• /
• pp.315-319
• /
• 2006

Support vector machines in biped humanoid robot are presented in this paper. The trajectory of the ZMP in biped walking robot poses an important criterion for the balance of the walking robots but complex dynamics involved make robot control difficult. We are establishing empirical relationships based on the dynamic stability of motion using SVMs. SVMs and kernel method have become very popular method for learning from examples. We applied SVM to model the practical humanoid robot. Three kinds of kernels are employed also and each result has been compared. As a result, SVM based on kernel method have been found to work well. Especially SVM with RBF kernel function provides the best results. The simulation results show that the generated ZMP from the SVM can be improve the stability of the biped walking robot and it can be effectively used to model and control practical biped walking robot.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.592-595
• /
• 2009

In this paper, we propose a face detection technique for still pictures which sequentially uses a skin-color model and a support vector machine (SVM). SVM is a learning algorithm for solving the classification problem. Some studies on face detection have reported superior results of SVM over neural networks. The SVM method searches for a face in a picture while changing the size of the window. The detection accuracy and the processing time of SVM vary largely depending on the complexity of the background of the picture or the size of the face. Therefore, we apply a face candidate area detection method using a skin-color model as a preprocessing technique. We compared the method using SVM alone with that of the proposed method in respect to face detection accuracy and processing time. As a result, the proposed method showed improved processing time while maintaining a high recognition rate.

• Asia pacific journal of information systems
• /
• 제15권2호
• /
• pp.51-63
• /
• 2005

There has been substantial research into the bankruptcy prediction. Many researchers used the statistical method in the problem until the early 1980s. Since the late 1980s, Artificial Intelligence(AI) has been employed in bankruptcy prediction. And many studies have shown that artificial neural network(ANN) achieved better performance than traditional statistical methods. However, despite ANN's superior performance, it has some problems such as overfitting and poor explanatory power. To overcome these limitations, this paper suggests a relatively new machine learning technique, support vector machine(SVM), to bankruptcy prediction. SVM is simple enough to be analyzed mathematically, and leads to high performances in practical applications. The objective of this paper is to examine the feasibility of SVM in bankruptcy prediction by comparing it with ANN, logistic regression, and multivariate discriminant analysis. The experimental results show that SVM provides a promising alternative to bankruptcy prediction.

• Management Science and Financial Engineering
• /
• 제18권1호
• /
• pp.49-53
• /
• 2012

A novel method of transient stability analysis is presented in this paper. The proposed method extracts data points near the basin-of-attraction boundary and then builds a support vector machine (SVM) model learned from the generated data. The constructed SVM classifier has been shown to reduce dramatically the conservativeness of the estimated basin of attraction.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.43-46
• /
• 2003

In this paper, a novel rotor flux estimation method of an induction motor using support vector machine(SVM) is presented. Two veil-known different flux models with respect to voltage and current are necessary to estimate the rotor flux of an induction motor. The theory of the SVM algorithm is based on statistical teaming theory. Training of SVH leads to a quadratic programming(QP) problem. The proposed SVM rotor flux estimator guarantees the improvement of performance in the transient and steady state in spite of parameter variation circumstance. The validity and the usefulness of Proposed algorithm are throughly verified through numerical simulation.

• 한국지능시스템학회논문지
• /
• 제14권3호
• /
• pp.369-374
• /
• 2004

Convex한 클러스터간의 최적의 거리와 Fuzzy Convex Clustering(FCC) 방법에 의한 효과적인 클러스터 결합 알고리즘을 제시하였다. 또한 두 convex한 클러스터간의 거리 측정 방법의 문제점인 정확성과 수행속도 개선하기 위하여 Support Vector Machines(SVM) 을 이용한 빠르고 정확한 거리 측정 방법을 제시하였다. 따라서 데이터의 부적절한 표현 없이 클러스터들의 개수를 크게 더 줄일 수 있었다. 본 논문에서는 제시한 알고리즘의 타당성을 위하여 여러 데이터에 대한 실험결과를 보여주므로서 제시한 알고리즘을 실제 영상 분할에 적용하여 다른 클러스터링 방법의 결과와 비교분석한다.

• 대한전자공학회논문지SP
• /
• 제45권6호
• /
• pp.142-147
• /
• 2008

본 논문에서는 support vector machine (SVM)을 이용하여 기존의 3GPP2 selectable mode vocoder (SMV)코덱의 음성/음악 분류 성능을 향상시키는 방법을 제시한다. SVM은 통계적 학습 이론으로 훈련 데이터 사이의 최적 분류 초평면을 찾아내 최적화된 이진 분류를 보여준다. SMV의 음성/음악 실시간 분류 알고리즘에서 사용된 특징벡터와 분류방법을 분석하고, 이를 기반으로 분류성능향상을 위해 통계적 학습 이론인 SVM을 도입한다. 구체적으로, SMV의 음성/음악 분류알고리즘에서 사용되어진 특징벡터만을 선택적으로 사용하여 효과적으로 SVM을 구성한 분류기법을 제시한다. SMV의 음성/음악 분류에 적용한 SVM의 성능 평가를 위해 SMV 원래의 분류알고리즘과 비교하였으며, 다양한 음악장르에 대해 시스템의 성능을 평가한 결과 SVM을 이용하였을 때 기존의 SMV의 방법보다 우수한 음성/음악 분류 성능을 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.9-12
• /
• 2001

Learning vector quantization (LVQ) is a supervised learning technique that uses class information to move the vector quantizer slightly, so as to improve the quality of the classifier decision regions. In this paper we propose a selection method of initial codebook vectors for a teaming vector quantization (LVQ3) using support vector machines (SVM). The method is experimented with artificial and real design data sets and compared with conventional methods of the condensed nearest neighbor (CNN) and its modifications (mCNN). From the experiments, it is discovered that the proposed method produces higher performance than the conventional ones and then it could be used efficiently for designing nonparametric classifiers.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2164-2167
• /
• 2003

In this paper we propose effective speech recognizer through recognition experiments for three feature parameters(PCA, ICA and MFCC) using SVM(Support Vector Machine) classifier In general, SVM is classification method which classify two class set by finding voluntary nonlinear boundary in vector space and possesses high classification performance under few training data number. In this paper we compare recognition result for each feature parameter and propose ICA feature as the most effective parameter

• 대한전자공학회논문지SP
• /
• 제41권3호
• /
• pp.195-200
• /
• 2004

본 논문은 두 가지 비교 실험을 통하여 효과적 음성인식 시스템을 제안한다. 분별적 이진 패턴 분류기인 SVM(Support Vector Machines)은 특징 공간에서 비선형 경계를 찾아 분류하는 방법으로 적은 학습 데이터에서도 좋은 분류 성능을 나타낸다고 알려져 있다. 본 논문에서는 학습데이터 수에 따른 HMM(Hidden Markov Model)과 SVM의 인식 성능을 비교하고, 최적의 특징 파라메터를 선택하기 위해 SVM을 이용하여 주성분해석과 독립성분분석을 적용하여 MFCC(Mel Frequency Cepstrum Coefficient)의 특징 공간을 변화시키면서 각각의 인식 성능을 비교 검토하였다. 실험 결과 SVM은 HMM에 비해 적은 학습데이터에서도 높은 인식 성능을 보여주었고, 독립성분분석에 의한 특징 파라메터가 특징 공간상에서의 높은 선형 분별성에 의해 다른 특징 파라메터보다 인식 성능에서 우수함을 확인 할 수 있었다.