• International Journal of Contents
• /
• 제12권3호
• /
• pp.12-16
• /
• 2016

Brain computer interfaces (BCI) usually have focused on classifying the explicitly-expressed intentions of humans. In contrast, implicit intentions should be considered to develop more intelligent systems. However, classifying implicit intention is more difficult than explicit intentions, and the difficulty severely increases for subject independent classification. In this paper, we address the subject independent classification of implicit intention based on electroencephalography (EEG) signals. Among many machine learning models, we use the support vector machine (SVM) with radial basis kernel functions to classify the EEG signals. The Fisher scores are evaluated after extracting the gamma, beta, alpha and theta band powers of the EEG signals from thirty electrodes. Since a more discriminant feature has a larger Fisher score value, the band powers of the EEG signals are presented to SVM based on the Fisher score. By training the SVM with 1-out of-9 validation, the best classification accuracy is approximately 65% with gamma and theta components.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.227-232
• /
• 2003

Recently, support vector learning attracts an enormous amount of interest in the areas of function approximation, pattern classification, and novelty detection. One of the main reasons for the success of the support vector machines(SVMs) seems to be the availability of global and sparse solutions. Among the approaches sharing the same reasons for success and exhibiting a similarly good performance, we have KFD(kernel Fisher discriminant) approach. In this paper, we consider the problem of function approximation utilizing both predetermined basis functions and the KFD approach for regression. After reviewing support vector regression, semi-parametric approach for including predetermined basis functions, and the KFD regression, this paper presents an extension of the conventional KFD approach for regression toward the direction that can utilize predetermined basis functions. The applicability of the presented method is illustrated via a regression example.

• 정보과학회 논문지
• /
• 제42권2호
• /
• pp.203-212
• /
• 2015

본 논문은 도로주행 영상에서 도로표지판을 인식하는 방법을 제안한다. 지능형 차량에서 얻어지는 도로표지판 영상은 일반적인 사물 영상과는 다른 두 가지 특징이 있다. 첫째는 대상이 되는 사물들은 종류가 제한적이고 형태가 단순한 도형인 경우가 대부분이다. 둘째는 일반적인 도로주행 영상은 다양한 조명 환경과 날씨 상태로 인해서 선명한 영상을 취득하기 어려운 점이다. 본 논문에서는 조명 변화가 심한 도로주행 영상에 대해서 효과적으로 특징을 추출하기 위해서 Modified Census Transform(MCT)을 개선한 특징추출 방법을 제안한다. 추출된 특징들은 히스토그램으로 쌓여지고 영상 전반에 걸쳐 아주 고차원의 기술자(Descriptor)로 변환되며, 변환된 수많은 기술자들은 가우시안 혼합 모델(Gaussian Mixture Model)을 활용한 Fisher-vector 방법에 의해서 저차원으로 변형하여 특징으로 사용한다. 본 논문에서 제안하는 방법은 일반적인 표지판 인식 방법에 비해서 조명변화에 강한 검출 결과를 보여주었으며, 실시간 검출 및 인식도 가능하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.619-622
• /
• 2001

In this paper, an efficient approach to classification of transient and harmonic disturbances in power systems is proposed. First, the Stop-and-Go CA CFAR Detector is utilized to detect a disturbance from the power signals which are mixed with other disturbances and noise. Then, (i) Wigner Distribution, SVD(Singular Value Decomposition) and Fisher´s Criterion (ii) DWT and Fisher´s Criterion, are applied to extract an efficient feature vector. For the classification procedure, a combined neural network classifier is proposed to classify each corresponding disturbance class. Finally, the 10 class data simulated by Matlab power system blockset are used to demonstrate the performance of the proposed classification system.

• Communications for Statistical Applications and Methods
• /
• 제26권6호
• /
• pp.635-644
• /
• 2019

Class probability is a fundamental target in classification that contains complete classification information. In this article, we propose a class probability estimation method when the predictor is functional. Motivated by Wang et al. (Biometrika, 95, 149-167, 2007), our estimator is obtained by training a sequence of functional weighted support vector machines (FWSVM) with different weights, which can be justified by the Fisher consistency of the hinge loss. The proposed method can be extended to multiclass classification via pairwise coupling proposed by Wu et al. (Journal of Machine Learning Research, 5, 975-1005, 2004). The use of FWSVM makes our method model-free as well as computationally efficient due to the piecewise linearity of the FWSVM solutions as functions of the weight. Numerical investigation to both synthetic and real data show the advantageous performance of the proposed method.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2018년도 추계학술대회
• /
• pp.536-537
• /
• 2018

본 논문은 개와 고양이에 해당하는 애완동물 영상에서 세부 분류인 동물의 종을 인식하는 것을 목표로 한다. 영상의 세부 분류 인식에 대한 연구는 계속적으로 발전하고 있지만, 다형성의 성질을 갖는 동물에 대한 객체인식 연구는 더디게 진행되고 있다. 본 논문에서는 객체 분리를 위해 Grab-cut 알고리즘을 이용하고, 영상 인코딩을 위해 Fisher Vector를 이용하여 더 높은 동물 객체인식 방법을 제안한다.

• 제어로봇시스템학회논문지
• /
• 제6권7호
• /
• pp.551-558
• /
• 2000

In this paper a systematic approach to automatic classificationi of power system harmonic disturbances is proposed where the proposed approach consists of the following three steps:(i) detecting and localizing each harmonic disturbance by applying discrete wavelet transform(DWT) (ii) extracting an efficient feature vector from each detected disturbance waveform by utilizing FFT and principal component analysis (PCA) along with Fisher's criterion and (iii) classifying the corresponding type of each harmonic disturbance by recognizing the pattern of each feature vector. To demonstrate the performance and applicability of the proposed classification procedure some simulation results obtained by analyzing 8-class power system harmonic disturbances being generated with Matlab power system blockset are also provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.832-854
• /
• 2019

Action recognition has been studied in computer vision field for years. We present an effective approach to recognize actions using a dimension reduction method, which is applied as a crucial step to reduce the dimensionality of feature descriptors after extracting features. We propose to use sparse matrix and randomized kd-tree to modify it and then propose modified Local Fisher Discriminant Analysis (mLFDA) method which greatly reduces the required memory and accelerate the standard Local Fisher Discriminant Analysis. For feature encoding, we propose a useful encoding method called mix encoding which combines Fisher vector encoding and locality-constrained linear coding to get the final video representations. In order to add more meaningful features to the process of action recognition, the convolutional neural network is utilized and combined with mix encoding to produce the deep network feature. Experimental results show that our algorithm is a competitive method on KTH dataset, HMDB51 dataset and UCF101 dataset when combining all these methods.

• Kyungpook Mathematical Journal
• /
• 제62권2호
• /
• pp.389-405
• /
• 2022

We study the Fisher Information (FI) of m-generalized order statistics (m-GOSs) and their concomitants about the shape-parameter vector of the Iterated Farlie-Gumbel-Morgenstern (IFGM) bivariate distribution. We carry out a computational study and show how the FI matrix (FIM) helps in finding information contained in singly or multiply censored bivariate samples from the IFGM. We also run numerical computations about the FIM for the sub-models of order statistics (OSs) and sequential order statistics (SOSs). We evaluate FI about the mean and the shape-parameter of exponential and power distributions, respectively. Finally, we investigate the Kullback-Leibler distance in concomitants of m-GOSs.

• Communications for Statistical Applications and Methods
• /
• 제20권3호
• /
• pp.225-233
• /
• 2013

The linear support vector machine(SVM) is motivated by the maximal margin separating hyperplane and is a popular tool for binary classification tasks. Many studies exist on the consistency properties of SVM; however, it is unknown whether the linear SVM is consistent for estimating the optimal classification boundary even in the simple case of two Gaussian classes with a common covariance, where the optimal classification boundary is linear. In this paper we show that the linear SVM can be inconsistent in the univariate Gaussian classification problem with a common variance, even when the best tuning parameter is used.