• Speech Sciences
• /
• v.13 no.4
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.49-54
• /
• 2009

A fuzzy weighted mean method on a 2D shape recognition system is introduced in this paper. The bispectrum based on third order cumulant is applied to the contour sequence of each image for the extraction of a feature vector. This bispectral feature vector, which is invariant to shape translation, rotation and scale, represents a 2D planar image. However, to obtain the best performance, it should be considered certain criterion on the calculation of weights for the fuzzy weighted mean method. Therefore, a new method to calculate weights using means by differences of feature values and their variances with the maximum distance from differences of feature values. is developed. In the experiments, the recognition results with fifteen dimensional bispectral feature vectors, which are extracted from 11.808 aircraft images based on eight different styles of reference images, are compared and analyzed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.183-190
• /
• 2016

This study proposed a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. The algorithm proposed detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). Also, by applying the feature vector obtained for SVM, face areas can be tested. After the testing, using the feature vector is final face recognition performed. The algorithm proposed in this study could increase the stability and accuracy of recognition rates and as a large amount of calculation was not necessary due to the use of two dimensions, real-time recognition was possible.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.40-49
• /
• 2018

We propose a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. We propose detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). The feature vector is applied to LDA and using Euclidean distance of intra-class variance and inter class variance in the 2nd dimension, the final analysis and matching is performed. Experimental results show that the proposed method has a wider distribution when the input image is rotated $45^{\circ}$ left / right. We can improve the recognition rate by applying this feature value to a single algorithm and complex algorithm, and it is possible to recognize in real time because it does not require much calculation amount due to dimensional reduction.

• Speech Sciences
• /
• v.15 no.3
• /
• pp.7-15
• /
• 2008

This paper proposes the method to extract new feature vectors using the difference between the cepstrum for static characteristics and delta cepstrum for dynamic characteristics in speaker recognition (SR). The difference vector (DV) which it proposes from this paper is containing the static and the dynamic characteristics simultaneously at the intermediate characteristic vector which uses the deference between the static and the dynamic characteristics and as the characteristic vector which is new there is a possibility of doing. Compared to the conventional method, the proposed method can achieve new feature vector without increasing of new parameter, but only need the calculation process for the difference between the cepstrum and delta cepstrum. Experimental results show that the proposed method has a good performance more than 2.03%, on average, compared with conventional method in speaker identification (SI).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.579-582
• /
• 2001

Vector Transformation is a new method unified vector quantization and coding. So far, codebook generation applied to coding was LBG algorithm. But using the advantage of SOFM(Self-Organizing Feature Map) based on neural network can improve a system's performance. In this paper, we generated VTC(Vector Transformation Coding) codebook applied with SOFM algorithm and compare the result for several coding rates with LBG algorithm. The problem of Vector quantization is complicated calculation and codebook generation. So, to solve this problem, we used neural network approach method.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.581-584
• /
• 1999

In order to retrieve the rotated image within database by the content based image retrieval system, the algorithms with rotation robustness is usually applied in the procedure of the feature extraction. In that case, it requires much calculation time for feature extraction and much indexed data for feature indexing. Thus. in this paper. we propose the rotation robust algorithm using the block variance of the projected vector. The algorithm does not require additional calculation for feature extraction and is executed within query time by comparing the extracted data. Proposed method can be processed through database including various size of images with shape information and executed with fast response time in implementation.

• Journal of Multimedia Information System
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2019

There are many ways to perform face recognition. The first step of face recognition is the face detection step. If the face is not found in the first step, the face recognition fails. Face detection research has many difficulties because it can be varied according to face size change, left and right rotation and up and down rotation, side face and front face, facial expression, and light condition. In this study, facial features are extracted and the extracted features are geometrically reconstructed in order to improve face recognition rate in extracted face region. Also, it is aimed to adjust face angle using reconstructed facial feature vector, and to improve recognition rate for each face angle. In the recognition attempt using the result after the geometric reconstruction, both the up and down and the left and right facial angles have improved recognition performance.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1307-1314
• /
• 2015

This study proposed a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. The algorithm proposed detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). Also, by applying the feature vector obtained for SVM, face areas can be tested. After the testing, the feature vector is applied to LDA and using Euclidean distance in the 2nd dimension, the final analysis and matching is performed. The algorithm proposed in this study could increase the stability and accuracy of recognition rates and as a large amount of calculation was not necessary due to the use of two dimensions, real-time recognition was possible.

• Journal of Biomedical Engineering Research
• /
• v.32 no.4
• /
• pp.295-304
• /
• 2011

In this study, we evaluated the EEG based BCI algorithm using common spatial pattern to find realistic applicability using neurofeedback EEG based BCI algorithm - EEG mode, feature vector calculation, the number of selected channels, 3 types of classifier, window size is evaluated for 10 subjects. The experimental results have been evaluated depending on conditioned experiment whether neurofeedback is used or not In case of using neurofeedback, a few subjects presented exceptional but general tendency presented the performance improvement Through this study, we found a motivation of development for the specific classifier based BCI system and the assessment evaluation system. We proposed a need for an optimized algorithm applicable to the robust motor imagery evaluation system with more useful functionalities.