• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.103-110
• /
• 2011

In this paper, an adaptive motion vector smoothing scheme based on weighted vector median filtering is proposed in order to eliminate the motion outliers more effectively for improving the quality of side information in frame-based distributed video coding. We use a simple motion vector outlier reliability measure for each block in a motion compensated interpolated frame and apply weighted vector median filtering only to the blocks with unreliable motion vectors. Simulation results show that the proposed adaptive motion vector smoothing algorithm improves the quality of the side information significantly while maintaining low complexity at the encoder in frame-based distributed video coding.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.550-558
• /
• 1988

This paper presents laplacian pyramid vector quantization (LPVQ) approach in which a vector quantizer is used to encode a series of quasi-bandpassed images generated by the laplacian pyramid processing. Performance of the LPVQ is compared to those of DCT domain methods at the same bit rate via computer simulations. Experimental results show that the PSNR's (peak signal-to-noise ratio) for the LPVQ are almost the same as those of the DCT based methods. However, subjective study indicates the LPVQ obtains slightly higher scores than the DCT based techniques.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1503-1516
• /
• 2019

In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

• Journal of Information Processing Systems
• /
• v.8 no.2
• /
• pp.301-314
• /
• 2012

In this paper, two new approaches to align English-Arabic sentences in bilingual parallel corpora based on the Multi-Class Support Vector Machine (MSVM) and the Hidden Markov Model (HMM) classifiers are presented. A feature vector is extracted from the text pair that is under consideration. This vector contains text features such as length, punctuation score, and cognate score values. A set of manually prepared training data was assigned to train the Multi-Class Support Vector Machine and Hidden Markov Model. Another set of data was used for testing. The results of the MSVM and HMM outperform the results of the length based approach. Moreover these new approaches are valid for any language pairs and are quite flexible since the feature vector may contain less, more, or different features, such as a lexical matching feature and Hanzi characters in Japanese-Chinese texts, than the ones used in the current research.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.55-59
• /
• 2008

For effective mobility control of UGV(unmanned ground vehicle), the terrain cover classification is an important component as well as terrain geometry recognition and obstacle detection. The vision based terrain cover classification algorithm consists of pre-processing, feature extraction, classification and post-processing. In this paper, we present a method to classify terrain covers based on the color and texture information. The color space conversion is performed for the pre-processing, the wavelet transform is applied for feature extraction, and the SVM(support vector machine) is applied for the classifier. Experimental results show that the proposed algorithm has a promising classification performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2038-2057
• /
• 2017

Gaussian learning is a new technology in the computational intelligence area. However, this technology weakens the learning ability of a particle swarm and achieves a lack of diversity. Thus, this paper proposes a vector Gaussian learning strategy and presents an effective approach, named particle swarm optimization based on vector Gaussian learning. The experiments show that the algorithm is more close to the optimal solution and the better search efficiency after we use vector Gaussian learning strategy. The strategy adopts vector Gaussian learning to generate the Gaussian solution of a swarm's optimal location, increases the learning ability of the swarm's optimal location, and maintains the diversity of the swarm. The method divides the states into normal and premature states by analyzing the state threshold of the swarm. If the swarm is in the premature category, the algorithm adopts an inertia weight strategy that decreases linearly in addition to vector Gaussian learning; otherwise, it uses a fixed inertia weight strategy. Experiments are conducted on eight well-known benchmark functions to verify the performance of the new approach. The results demonstrate promising performance of the new method in terms of convergence velocity and precision, with an improved ability to escape from a local optimum.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1995.06a
• /
• pp.87-90
• /
• 1995

In this paper, we propose a new deinterlacing algorithm based on weighted wide vector correlations. This algorithm is developed mainly for the format conversion problem encountered in current HDTV system, but not limited to. By having wide vector correlations, visually annoying artifacts caused by interlacing, such as a serrate line, line crawling, a line flicker, and a large area flicker, can be remarkably reduced, since the use of wide vector correlation increases the detectability of edges in various orientations.

• Phonetics and Speech Sciences
• /
• v.2 no.1
• /
• pp.77-85
• /
• 2010

This paper proposes an efficient feature vector processing technique to guard the Speech Emotion Recognition (SER) system against a variety of noises. In the proposed approach, emotional feature vectors are extracted from speech processed by comb filtering. Then, these extracts are used in a robust model construction based on feature vector classification. We modify conventional comb filtering by using speech presence probability to minimize drawbacks due to incorrect pitch estimation under background noise conditions. The modified comb filtering can correctly enhance the harmonics, which is an important factor used in SER. Feature vector classification technique categorizes feature vectors into either discriminative vectors or non-discriminative vectors based on a log-likelihood criterion. This method can successfully select the discriminative vectors while preserving correct emotional characteristics. Thus, robust emotion models can be constructed by only using such discriminative vectors. On SER experiment using an emotional speech corpus contaminated by various noises, our approach exhibited superior performance to the baseline system.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.263-272
• /
• 2024

A model based on genetic algorithm optimization, GA-SVM, is proposed to warn university students of their status. This model improves the predictive effect of support vector machines. The genetic optimization algorithm is used to train the hyperparameters and adjust the kernel parameters, kernel penalty factor C, and gamma to optimize the support vector machine model, which can rapidly achieve convergence to obtain the optimal solution. The experimental model was trained on open-source datasets and validated through comparisons with random forest, backpropagation neural network, and GA-SVM models. The test results show that the genetic algorithm-optimized radial basis kernel support vector machine model GA-SVM can obtain higher accuracy rates when used for early warning in university learning.

• Journal of Korean Medical classics
• /
• v.32 no.1
• /
• pp.61-74
• /
• 2019

Objectives : The purpose of this study is to help select an appropriate word embedding method when analyzing East Asian traditional medicine texts as data. Methods : Based on prescription data that imply traditional methods in traditional East Asian medicine, we have examined 4 count-based word embedding and 2 prediction-based word embedding methods. In order to intuitively compare these word embedding methods, we proposed a "prescription generating game" and compared its results with those from the application of the 6 methods. Results : When the adjacent vectors are extracted, the count-based word embedding method derives the main herbs that are frequently used in conjunction with each other. On the other hand, in the prediction-based word embedding method, the synonyms of the herbs were derived. Conclusions : Counting based word embedding methods seems to be more effective than prediction-based word embedding methods in analyzing the use of domesticated herbs. Among count-based word embedding methods, the TF-vector method tends to exaggerate the frequency effect, and hence the TF-IDF vector or co-word vector may be a more reasonable choice. Also, the t-score vector may be recommended in search for unusual information that could not be found in frequency. On the other hand, prediction-based embedding seems to be effective when deriving the bases of similar meanings in context.