• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.512-517
• /
• 2011

In this paper, we propose an Active Shape Model (ASM) and Lucas-Kanade (LK) optical flow-based feature extraction and analysis method for analyzing the emotional features from facial images. Considering the facial emotion feature regions are described by Facial Action Coding System, we construct the feature-related shape models based on the combination of landmarks and extract the LK optical flow vectors at each landmarks based on the centre pixels of motion vector window. The facial emotion features are modelled by the combination of the optical flow vectors and the emotional states of facial image can be estimated by the probabilistic estimation technique, such as Bayesian classifier. Also, we extract the optimal emotional features that are considered the high correlation between feature points and emotional states by using common spatial pattern (CSP) analysis in order to improvise the operational efficiency and accuracy of emotional feature extraction process.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1113-1121
• /
• 2019

In this paper, we propose the face anti-spoofing method based on combination of luminance and chrominance with convolutional neural networks. The proposed method extracts luminance and chrominance features independently from live and fake faces by using stacked convolutional neural networks and auxiliary networks. Unlike previous methods, an attention module has been adopted to adaptively combine extracted features instead of simply concatenating them. In addition, we propose a new loss function, called the contrast loss, to learn the classifier more efficiently. Specifically, the contrast loss improves the discriminative power of the features by maximizing the distance of the inter-class features while minimizing that of the intra-class features. Experimental results demonstrate that our method achieves the significant improvement for face anti-spoofing compared to existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.99-118
• /
• 2013

Electrocardiograms (ECGs) are widely used by clinicians to identify the functional status of the heart. Thus, there is considerable interest in automated systems for real-time monitoring of arrhythmia. However, intra- and inter-patient variability as well as the computational limits of real-time monitoring poses significant challenges for practical implementations. The former requires that the classification model be adjusted continuously, and the latter requires a reduction in the number and types of ECG features, and thus, the computational burden, necessary to classify different arrhythmias. We propose the use of adaptive learning to automatically train the classifier on up-to-date ECG data, and employ adaptive feature selection to define unique feature subsets pertinent to different types of arrhythmia. Experimental results show that this hybrid technique outperforms conventional approaches and is therefore a promising new intelligent diagnostic tool.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1431-1434
• /
• 2005

In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the development of recognition system for the characters, which was marked at the billet material by use template-marking plate and hand written method, in the steel plant. For the recognition of template-marked characters, we propose PSVM algorithm. And for the recognition of hand written character, we propose combination methods of CCD algorithm and PSVM algorithm. The PSVM algorithm need some more time than the conventional KLT or SVM algorithm. The CCD algorithm makes shorter classification time than the PSVM algorithm and good for the classification of closed curve characters from Arabic numerals. For the confirmation of algorithm, we have compared our algorithm with conventional methods such as KLT classifier and one-to-one SVM. The recognition rate of experimented billet characters shows that the proposing PSVM algorithm is 97 % for the template-marked characters and combinational algorithm of CCD & PSVM is 95.5 % for the hand written characters. The experimental results show that our proposing method has higher recognition rate than that of the conventional methods for the template-marked characters and hand written characters. By using our algorithm, we have installed real time character recognition system at the billet processing line of the steel-iron plant.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.175-186
• /
• 2004

We present a hybrid approach of texture-based method and connected component (CC)-based method for text extraction in complex images. Two primary methods, which are mainly utilized in this area, are sequentially merged for compensating for their weak points. An automatically constructed MLP-based texture classifier can increase recall rates for complex images with small amount of user intervention and without explicit feature extraction. CC-based filtering based on the shape information using NMF enhances the precision rate without affecting overall performance. As a result, a combination of texture and CC-based methods leads to not only robust but also efficient text extraction. We also enhance the processing speed by adopting appropriate region marking methods for each input image category.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.191-201
• /
• 2017

This paper proposes an approach using taxonomic relatedness for answer-type recognition and type coercion in a question-answering system. We introduce a question analysis method for a lexical answer type (LAT) and semantic answer type (SAT) and describe the construction of a taxonomy linking them. We also analyze the effectiveness of type coercion based on the taxonomic relatedness of both ATs. Compared with the rule-based approach of IBM's Watson, our LAT detector, which combines rule-based and machine-learning approaches, achieves an 11.04% recall improvement without a sharp decline in precision. Our SAT classifier with a relatedness-based validation method achieves a precision of 73.55%. For type coercion using the taxonomic relatedness between both ATs and answer candidates, we construct an answer-type taxonomy that has a semantic relationship between the two ATs. In this paper, we introduce how to link heterogeneous lexical knowledge bases. We propose three strategies for type coercion based on the relatedness between the two ATs and answer candidates in this taxonomy. Finally, we demonstrate that this combination of individual type coercion creates a synergistic effect.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.4
• /
• pp.692-700
• /
• 2017

In this paper, we propose the structural design of Interval Type-2 FCM based RBFNN. Proposed model consists of three modules such as condition, conclusion and inference parts. In the condition part, Interval Type-2 FCM clustering which is extended from FCM clustering is used. In the conclusion part, the parameter coefficients of the consequence part are estimated through LSE(Least Square Estimation) and WLSE(Weighted Least Square Estimation). In the inference part, final model outputs are acquired by fuzzy inference method from linear combination of both polynomial and activation level obtained through Interval Type-2 FCM and acquired activation level through Interval Type-2 FCM. Additionally, The several parameters for the proposed model are identified by using differential evolution. Final model outputs obtained through benchmark data are shown and also compared with other already studied models' performance. The proposed algorithm is performed by using Iris and Vehicle data for pattern classification. For the validation of regression problem modeling performance, modeling experiments are carried out by using MPG and Boston Housing data.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.6-10
• /
• 2007

Classification of hyperspectral images is challenging. A very high dimensional input space requires an exponentially large amount of data to adequately and reliably represent the classes in that space. In other words in order to obtain statistically reliable classification results, the number of necessary training samples increases exponentially as the number of spectral bands increases. However, in many situations, acquisition of the large number of training samples for these high-dimensional datasets may not be so easy. This problem can be overcome by using multiple classifiers. In this paper we compared the effectiveness of two approaches for creating multiple classifiers, feature selection and feature extraction. The methods are based on generating multiple feature subsets by running feature selection or feature extraction algorithm several times, each time for discrimination of one of the classes from the rest. A maximum likelihood classifier is applied on each of the obtained feature subsets and finally a combination scheme was used to combine the outputs of individual classifiers. Experimental results show the effectiveness of feature extraction algorithm for generating multiple classifiers.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.41-48
• /
• 2005

This paper presents a face recognition method based on the combination of well-known statistical representations of Principal Component Analysis(PCA), and Linear Discriminant Analysis(LDA) with Radial Basis Function Networks. The original face image is first processed by PCA to reduce the dimension, and thereby avoid the singularity of the within-class scatter matrix in LDA calculation. The result of PCA process is applied to LDA classifier. In the second approach, the LDA process Produce a discriminational features of the face image, which is taken as the input of the Radial Basis Function Network(RBFN). The proposed approaches has been tested on the ORL face database. The experimental results have been demonstrated, and the recognition rate of more than 93.5% has been achieved.

• Phonetics and Speech Sciences
• /
• v.6 no.2
• /
• pp.21-28
• /
• 2014

We propose a novel scheme for digital audio authentication of given audio files which are edited by inserting small audio segments from different environmental sources. The purpose of this research is to detect inserted sections from given audio files. We expect that the proposed method will assist human investigators by notifying suspected audio section which considered to be recorded or transmitted on different environments. GMM-UBM and GSV-SVM are applied for modeling the dominant environment of a given audio file. Four kinds of likelihood ratio based scores and SVM score are used to measure the likelihood for a dominant environment model. We also use an ensemble score which is a combination of the aforementioned five kinds of scores. In the experimental results, the proposed method shows the lowest average equal error rate when we use the ensemble score. Even when dominant environments were unknown, the proposed method gives a similar accuracy.