• 한국컴퓨터정보학회논문지
• /
• 제23권7호
• /
• pp.99-104
• /
• 2018

In this paper, we compare Fisher's continuous method with an exact discrete analog of Fisher's continuous method from permutation tests for combining p values. The discrete analog of Fisher's continuous method is known to be adequate for combining independent p values from discrete probability distributions. Also permutation tests are widely used as alternatives to conventional parametric tests since these tests are distribution-free, and yield discrete probability distributions and exact p values. In this paper, we obtain permutation p values from discrete probability distributions using Mann-Whitney test data sets (real data and hypothetical data) and combine p values by the exact discrete analog of Fisher's continuous method.

• 한국통신학회논문지
• /
• 제34권10B호
• /
• pp.1111-1116
• /
• 2009

본 논문에서는 집적 영상의 획득과 복원을 이용하여 왜곡에 강인한 물체를 인식하는 방법을 연구한다. 해당 화소들의 확률적 특성인 평균과 표준편차를 이용하여 3차원 공간에서 물체를 복원하고 거리를 추정한다. 표적인식은 Fisher 선형판별법(linear discriminant analysis, LDA)과 주성분 분석법(principal component analysis, PCA) 기술을 결합한 통계적 분류기(statistical classifier)로 수행한다. Fisher 선형판별법은 클래스 간의 판별력을 최대로 하고 주성분 분석법은 Fisher 선형판별법을 수행하기 위한 차원축소를 실행한다. 주성분 분석법은 차원축소 후 복원된 벡터와 원 벡터의 오차를 최소화하는 기술로 알려져 있다. 실험 및 시뮬레이션을 통하여 면외(out-of-plane) 회전된 표적을 본 논문에서 제안한 방법으로 분류한다.

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

얼굴영상의 인식 기술은 보안과 감시를 비롯하여 머신 인터페이스와 콘텐츠 검색 등에서 활용이 광범위 하다. 그러나 주로 고해상도 영상이 연구의 대상이었고 원거리에서 획득된 저해상도 표적에 대하여 상대적으로 드물게 연구가 이루어졌다. 본 논문에서는 포톤 카운팅(Photon-counting) 선형판별법을 이용하여 저해상도 환경에서 얼굴영상의 인식을 수행한다. 포톤 카운팅 선형판별법은 Fisher 선형 판별법에서 발생하는 특이행렬 문제없이 Fisher의 최적화 기준을 실현한다. 즉, 차원의 축소나 특징 추출 과정 없이 고차원 공간에서 최적화된 투영을 위한 선형판별함수를 구성하고 이를 이용하여 판정하므로 저해상도 환경을 비롯한 얼굴영상의 왜곡의 극복에 효과적이다. 실험 결과는 제안한 방법이 주성분 분석을 활용하는 Eigen face 또는 주성분 분석과 Fisher 선형판별법이 결합된 Fisher face보다 우수하다는 것을 보여준다.

• Journal of Information Processing Systems
• /
• 제15권4호
• /
• pp.957-966
• /
• 2019

This paper studies a novel approach to natural gait cycles based gait recognition via kernel Fisher discriminant analysis (KFDA), which can effectively calculate the features from gait sequences and accelerate the recognition process. The proposed approach firstly extracts the gait silhouettes through moving object detection and segmentation from each gait videos. Secondly, gait energy images (GEIs) are calculated for each gait videos, and used as gait features. Thirdly, KFDA method is used to refine the extracted gait features, and low-dimensional feature vectors for each gait videos can be got. The last is the nearest neighbor classifier is applied to classify. The proposed method is evaluated on the CASIA and USF gait databases, and the results show that our proposed algorithm can get better recognition effect than other existing algorithms.

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

• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.447-456
• /
• 2007

Recently, the multivariate statistical analysis has been used to analyze meaningful information for various data. In this paper, we develope the multivariate statistical analysis system combined with Fisher discriminant analysis, logistic regression, neural network, and decision tree using visual basic 6.0.

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

• Journal of Information Processing Systems
• /
• 제12권3호
• /
• pp.392-409
• /
• 2016

The aim of this paper is to examine the effectiveness of combining three popular tools used in pattern recognition, which are the Active Appearance Model (AAM), the two-dimensional discrete cosine transform (2D-DCT), and Kernel Fisher Analysis (KFA), for face recognition across age variations. For this purpose, we first used AAM to generate an AAM-based face representation; then, we applied 2D-DCT to get the descriptor of the image; and finally, we used a multiclass KFA for dimension reduction. Classification was made through a K-nearest neighbor classifier, based on Euclidean distance. Our experimental results on face images, which were obtained from the publicly available FG-NET face database, showed that the proposed descriptor worked satisfactorily for both face identification and verification across age progression.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
• /
• pp.106-109
• /
• 2004

Many reported methods assume that the faces in an image or an image sequence have been identified and localization. Face detection from image is a challenging task because of variability in scale, location, orientation and pose. In this paper, we present an efficient linear discriminant for multi-view face detection. Our approaches are based on linear discriminant. We define training data with fisher linear discriminant to efficient learning method. Face detection is considerably difficult because it will be influenced by poses of human face and changes in illumination. This idea can solve the multi-view and scale face detection problem poses. Quickly and efficiently, which fits for detecting face automatically. In this paper, we extract face using fisher linear discriminant that is hierarchical models invariant pose and background. We estimation the pose in detected face and eye detect. The purpose of this paper is to classify face and non-face and efficient fisher linear discriminant..

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