• Journal of Information Processing Systems
• /
• 제11권4호
• /
• pp.643-654
• /
• 2015

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.351-359
• /
• 1991

This paper describes performances of speaker adaptation using a probabilistic spectral mapping matrix in hidden-Markov model(HMM) -based Korean isolated word recognition. Speaker adaptation based on probabilistic spectral mapping uses a well-trained prototype HMM's and is carried out by Viterbi, dynamic time warping, and forward-backward algorithms. Among these algorithms, the best performance is obtained by using the Viterbi approach together with codebook adaptation whose improvement for isolated word recognition accuracy is 42.6-68.8 %. Also, the selection of the initial values of the matrix and the normalization in computing the matrix affects the recognition accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.782-804
• /
• 2011

In video-based recognition systems, stationary cameras are used to monitor an area of interest. These systems focus on a segmentation of the foreground in the video stream and the recognition of the events occurring in that area. The usual approach to discriminating the foreground from the video sequence is background subtraction. This paper presents a novel background subtraction method based on a probabilistic approach. We represent the posterior probability of the foreground based on the current image and all past images and derive an updated method. Furthermore, we present an efficient fusion method for the color and edge information in order to overcome the difficulties of existing background subtraction methods that use only color information. The suggested method is applied to synthetic data and real video streams, and its robust performance is demonstrated through experimentation.

• 제어로봇시스템학회논문지
• /
• 제19권6호
• /
• pp.513-519
• /
• 2013

The current vision-based approaches for emotion recognition, such as facial expression analysis, have many technical limitations in real circumstances, and are not suitable for applications that use them solely in practical environments. In this paper, we propose an approach for emotion recognition by combining extrinsic representations and intrinsic activities among the natural responses of humans which are given specific imuli for inducing emotional states. The intrinsic activities can be used to compensate the uncertainty of extrinsic representations of emotional states. This combination is done by using PRMs (Probabilistic Relational Models) which are extent version of bayesian networks and are learned by greedy-search algorithms and expectation-maximization algorithms. Previous research of facial expression-related extrinsic emotion features and physiological signal-based intrinsic emotion features are combined into the attributes of the PRMs in the emotion recognition domain. The maximum likelihood estimation with the given dependency structure and estimated parameter set is used to classify the label of the target emotional states.

• 한국음향학회지
• /
• 제16권6호
• /
• pp.94-99
• /
• 1997

본 논문에서는 잡음환경에서의 음성인식을 위하여 잡음의 확률적 특성과 음성모델을 이용하는 확률적 스펙트럼 차감법을 제안한다. 기존의 스펙트럼 차감법은 음성이 존재하지 않는 구간에서 추정한 잡음을 잡음음성에서 차감하여 잡음을 제거함로, 추정한 잡음의 형태가 음성인식기에 입력되는 잡음음성에 포함된 잡음과 상이한 특성을 나타낼 경우에는 효과적인 잡음의 제거가 불가능하다. 이러한 단점을 보완하기 위해서 여러 가지 형태를 가지는 잡음의 원형을 사용하여, 잡음음성에서 잡음을 제거하는 방법을 사용하였다. 잡음의 확률적인 특성을 여러 개의 잡음원형으로 나타내므로, 스펙트럼 차감법은 입력음성에 대해서 확률적으로 수행되어 잡음이 제거된 다중의 스펙트럼을 출력하게 되고, 인식시에는 조용한 환경의 음성으로 학습된 음성모델에 따른 최적의 스펙트럼을 이용하여 인식을 수행한다. 또한 정적인 파라미터와 동적인 특징파라미터를 동시에 고려하여 잡음을 영향을 최소화하므로 보다 효과적인 잡음처리가 가능하다. 제안한 방법의 타당성을 실험적으로 검증하기 위해서, 잡음환경의 음성인식에 적용하였다. SNR 10 dB인 50개의 고립단어에 대한 실험결과, 잡음처리를 하지 않았을 경우 72.75%, 스펙트럼 차감법은 80.25%, 제안한 방법을 사용하였을 경우는 86.25%의 인식률을 얻음으로써, 효과적인 잡음처리 방법임을 확인할 수 있었다.

• 한국정보처리학회논문지
• /
• 제4권7호
• /
• pp.1881-1892
• /
• 1997

본 논문에서는 확률적 VQ 네트워크와 계층적 구조를 가지는 다단계 인식기를 이용한 인쇄체 한자 인식 방법을 제안한다. 대용량 신경망은 구현하기가 매우 어렵기 때문에 모듈화된 신경망을 이용하였으며, 이 과정에서 발생되는 문제점을 확률적 신경망 모델을 이용으로 제거하였다. 또한 엔트로피 이론을 적용하여 오인식률이 높은 혼동 문자쌍에 대하여 재분류를 수행하였다. 실험대상은 KSC5601 코드의 한자 4,888자 중, 동자이음문자를 제외한 4,619자로 하였으며, 학습 데이타와 실험 데이타에 대하여 실험결과, 각각 평균 99.33%, 92.83%의 인식률과 초당 4-5자의 인식속도를 얻음으로써 본 방법의 유효성을 보였다.

• 로봇학회논문지
• /
• 제9권4호
• /
• pp.232-241
• /
• 2014

This paper proposes an underwater localization algorithm using probabilistic object recognition. It is organized as follows; 1) recognizing artificial objects using imaging sonar, and 2) localizing the recognized objects and the vehicle using EKF(Extended Kalman Filter) based SLAM. For this purpose, we develop artificial landmarks to be recognized even under the unstable sonar images induced by noise. Moreover, a probabilistic recognition framework is proposed. In this way, the distance and bearing of the recognized artificial landmarks are acquired to perform the localization of the underwater vehicle. Using the recognized objects, EKF-based SLAM is carried out and results in a path of the underwater vehicle and the location of landmarks. The proposed localization algorithm is verified by experiments in a basin.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.227-233
• /
• 2007

Representing an environment as the probabilistic grids is effective to sense outlines of the environment in the mobile robot area. Outlines of an environment can be expressed factually by using the probabilistic grids especially if sonar sensors would be supposed to build an environment map. However, the difficult problem of a sonar such as a specular reflection phenomenon should be overcome to build a grid map through sonar observations. In this paper, the NRF(Neighborhood Recognition Factor) was developed for building a grid map in which the specular reflection effect is minimized. Also the reproduction rate of the gird map built by using NRF was analyzed with respect to a true map. The experiment was conducted in a home environment to verify the proposed technique.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1991년도 춘계학술대회
• /
• pp.65-70
• /
• 1991

A hybrid model which uses a probabilistic model and a MLP(multi layer perceptron) model for pattern recognition of EMG(electromyogram) signals is proposed in this paper. MLP model has problems which do not guarantee global minima of error due to learning method and have different approximation grade to bayesian probabilities due to different amounts and quality of training data, the number of hidden layers and hidden nodes, etc. Especially in the case of new test data which exclude design samples, the latter problem produces quite different results. The error probability of probabilistic model is closely related to the estimation error of the parameters used in the model and fidelity of assumtion. Generally, it is impossible to introduce the bayesian classifier to the probabilistic model of EMG signals because of unknown priori probabilities and is estimated by MLE(maximum likelihood estimate). In this paper we propose the method which get the MAP(maximum a posteriori probability) in the probabilistic model by estimating the priori probability distribution which minimize the error probability using the MLP. This method minimize the error probability of the probabilistic model as long as the realization of the MLP is optimal and approximate the minimum of error probability of each class of both models selectively. Alocating the reference coordinate of EMG signal to the outside of the body make it easy to suit to the applications which it is difficult to define and seperate using internal body coordinate. Simulation results show the benefit of the proposed model compared to use the MLP and the probabilistic model seperately.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2008년도 추계학술대회
• /
• pp.90-93
• /
• 2008

In natural language, it is common that repetitive constituents in an expression are to be left out and it is necessary to figure out the constituents omitted at analyzing the meaning of the sentence. This paper is on recognition of boundaries of parallel noun phrases by figuring out constituents omitted. Recognition of parallel noun phrases can greatly reduce complexity at the phase of sentence parsing. Moreover, in natural language information retrieval, recognition of noun with modifiers can play an important role in making indexes. We propose an unsupervised probabilistic model that identifies parallel cores as well as boundaries of parallel noun phrases conjoined by a conjunctive particle. It is based on the idea of swapping constituents, utilizing symmetry (two or more identical constituents are repeated) and reversibility (the order of constituents is changeable) in parallel structure. Semantic features of the modifiers around parallel noun phrase, are also used the probabilistic swapping model. The model is language-independent and in this paper presented on parallel noun phrases in Korean language. Experiment shows that our probabilistic model outperforms symmetry-based model and supervised machine learning based approaches.