• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1408-1411
• /
• 2002

In this paper, we propose a method that converts motion vectors on MPEG coded domain as a uniform set, independent of the frame type and the direction of prediction, and directly utilizes these normalized motion vectors for understanding video contents. This frame-type-independent motion vectors are utilized as feature information for image retrieval or moving object tracking on compressed domain. By simulation, we evaluate the effectiveness of the proposed method and compare its performance to the conventional method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.76-85
• /
• 1993

In this paper, we propose a stroke matching method for the off-line recognition of handprinted Hangul. In this method, the preprocessing steps such as position normalization, contour tracing and thinning are carried out first. Then, after extracting features such as the firection component distribution of contour, the direction component distribution of skeleton, and the distribution of structural feature points, strokes are extracted and matched based on the midpont distribution of the direction and the length of each stroke. In order to reduce the recognition time, a preliminary classification based on the direction component distribution features of the contour is performed. In order to domonstrate the performance of the proposed method, experiments with 520 most frequently used Hangul were performed, and 90.7% of correct recognition rate and 0.46second of recognition time per one character has been obtained. This results reveal that the proposed method can absorb effectively the noise in input character and the variations of stroke slant.

• International Journal of Contents
• /
• v.17 no.4
• /
• pp.79-90
• /
• 2021

With the deepening of population aging, pension has become an urgent problem in most countries. Community smart pension can effectively resolve the problem of traditional pension, as well as meet the personalized and multi-level needs of the elderly. To predict the pension intention of the elderly in the community more accurately, this paper uses the decision tree classification method to classify the pension data. After missing value processing, normalization, discretization and data specification, the discretized sample data set is obtained. Then, by comparing the information gain and information gain rate of sample data features, the feature ranking is determined, and the C4.5 decision tree model is established. The model performs well in accuracy, precision, recall, AUC and other indicators under the condition of 10-fold cross-validation, and the precision was 89.5%, which can provide the certain basis for government decision-making.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.165-170
• /
• 2003

This paper presents an integrated approach to unconstrained face recognition in arbitrary scenes. The front end of the system comprises of a scale and pose tolerant face detector. Scale normalization is achieved through novel combination of a skin color segmentation and log-polar mapping procedure. Principal component analysis is used with the multi-view approach proposed in[10] to handle the pose variations. For a given color input image, the detector encloses a face in a complex scene within a circular boundary and indicates the position of the nose. Next, for recognition, a radial grid mapping centered on the nose yields a feature vector within the circular boundary. As the width of the color segmented region provides an estimated size for the face, the extracted feature vector is scale normalized by the estimated size. The feature vector is input to a trained neural network classifier for face identification. The system was evaluated using a database of 20 person's faces with varying scale and pose obtained on different complex backgrounds. The performance of the face recognizer was also quite good except for sensitivity to small scale face images. The integrated system achieved average recognition rates of 87% to 92%.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.603-611
• /
• 2003

This paper proposes an effective feature compensation scheme based on speech model for achieving robust speech recognition. Conventional model-based method requires off-line training with noisy speech database and is not suitable for online adaptation. In the proposed scheme, we can relax the off-line training with noisy speech database by employing the parallel model combination technique for estimation of correction factors. Applying the model combination process over to the mixture model alone as opposed to entire HMM makes the online model combination possible. Exploiting the availability of noise model from off-line sources, we accomplish the online adaptation via MAP (Maximum A Posteriori) estimation. In addition, the online channel estimation procedure is induced within the proposed framework. For more efficient implementation, we propose a selective model combination which leads to reduction or the computational complexities. The representative experimental results indicate that the suggested algorithm is effective in realizing robust speech recognition under the combined adverse conditions of additive background noise and channel distortion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1312-1317
• /
• 2003

This paper presents an integrated approach to unconstrained face recognition in arbitrary scenes. The front end of the system comprises of a scale and pose tolerant face detector. Scale normalization is achieved through novel combination of a skin color segmentation and log-polar mapping procedure. Principal component analysis is used with the multi-view approach proposed in[10] to handle the pose variations. For a given color input image, the detector encloses a face in a complex scene within a circular boundary and indicates the position of the nose. Next, for recognition, a radial grid mapping centered on the nose yields a feature vector within the circular boundary. As the width of the color segmented region provides an estimated size for the face, the extracted feature vector is scale normalized by the estimated size. The feature vector is input to a trained neural network classifier for face identification. The system was evaluated using a database of 20 person's faces with varying scale and pose obtained on different complex backgrounds. The performance of the face recognizer was also quite good except for sensitivity to small scale face images. The integrated system achieved average recognition rates of 87% to 92%.

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

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.6
• /
• pp.501-509
• /
• 2016

We propose a method to improve the robustness of speaker verification on short test utterances. The accuracy of the state-of-the-art i-vector/probabilistic linear discriminant analysis systems can be degraded when testing utterance durations are short. The proposed method compensates for utterance variations of short test feature vectors using deep neural networks. We design three different types of DNN (Deep Neural Network) structures which are trained with different target output vectors. Each DNN is trained to minimize the discrepancy between the feed-forwarded output of a given short utterance feature and its original long utterance feature. We use short 2-10 s condition of the NIST (National Institute of Standards Technology, U.S.) 2008 SRE (Speaker Recognition Evaluation) corpus to evaluate the method. The experimental results show that the proposed method reduces the minimum detection cost relative to the baseline system.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1
• /
• pp.61-74
• /
• 2004

In this paper, a contort- and speaker-dependent cepstrum extraction method and a channel normalization method for minimizing the loss of speaker characteristics in the cepstrum were proposed for a robust speaker recognition system over the channel. The proposed extraction method creates a cepstrum based on the pitch synchronous analysis using the inherent pitch of the speaker. Therefore, the cepstrum called the 〃pitch synchronous cepstrum〃 (PSC) represents the impulse response of the vocal tract more accurately in voiced speech. And the PSC can compensate for channel distortion because the pitch is more robust in a channel environment than the spectrum of speech. And the proposed channel normalization method, the 〃formant-broadened pitch synchronous CMS〃 (FBPSCMS), applies the Formant-Broadened CMS to the PSC and improves the accuracy of the intraframe processing. We compared the text-independent closed-set speaker identification on 56 females and 112 males using TIMIT and NTIMIT database, respectively. The results show that pitch synchronous km improves the error reduction rate by up to 7.7% in comparison with conventional short-time cepstrum and the error rates of the FBPSCMS are more stable and lower than those of pole-filtered CMS.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.83-92
• /
• 2020

Recently, many companies and organizations are interested in predictive process monitoring for the efficient operation of business process models. Traditional process monitoring focused on the elapsed execution state of a particular process instance. On the other hand, predictive process monitoring focuses on predicting the future execution status of a particular process instance. In this paper, we implement the function of the business process remaining time prediction, which is one of the predictive process monitoring functions. In order to effectively model the remaining time, normalization by activity is proposed and applied to the predictive model by taking into account the difference in the distribution of time feature values according to the properties of each activity. In order to demonstrate the superiority of the predictive performance of the proposed model in this paper, it is compared with previous studies through event log data of actual companies provided by 4TU.Centre for Research Data.