• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.600-602
• /
• 1997

In this study, a hybrid neural net consisting of an Adaptive LVQ(ALVQ) algorithm and MLP is proposed to perform speaker identification task. ALVQ is a new learning procedure using adaptively feature vector sequence instead of only one feature vector in training codebooks initialized by LBG algorithm and the optimization criterion of this method is consistent with the speaker classification decision rule. ALVQ aims at providing a compressed, geometrically consistent data representation. It is fit to cover irregular data distributions and computes the distance of the input vector sequence from its nodes. On the other hand, MLP aim at a data representation to fit to discriminate patterns belonging to different classes. It has been shown that MLP nets can approximate Bayesian "optimal" classifiers with high precision, and their output values can be related a-posteriori class probabilities. The different characteristics of these neural models make it possible to devise hybrid neural net systems, consisting of classification modules based on these two different philosophies. The proposed method is compared with LBG algorithm, LVQ algorithm and MLP for performance.

• Journal of Korea Multimedia Society
• /
• v.23 no.10
• /
• pp.1236-1249
• /
• 2020

In a most recent object tracking research work, applying Convolutional Neural Network and Recurrent Neural Network-based strategies become relevant for resolving the noticeable challenges in it, like, occlusion, motion, object, and camera viewpoint variations, changing several targets, lighting variations. In this paper, the LSTM Network-based Tracking association method has proposed where the technique capable of real-time multi-object tracking by creating one of the useful LSTM networks that associated with tracking, which supports the long term tracking along with solving challenges. The LSTM network is a different neural network defined in Keras as a sequence of layers, where the Sequential classes would be a container for these layers. This purposing network structure builds with the integration of tracking association on Keras neural-network library. The tracking process has been associated with the LSTM Network feature learning output and obtained outstanding real-time detection and tracking performance. In this work, the main focus was learning trackable objects locations, appearance, and motion details, then predicting the feature location of objects on boxes according to their initial position. The performance of the joint object tracking system has shown that the LSTM network is more powerful and capable of working on a real-time multi-object tracking process.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3433-3446
• /
• 2019

Aiming at the high complexity of traditional single-channel demodulation algorithm for PCMA signals, a new demodulation algorithm based on neural network is proposed to reduce the complexity of demodulation in the system of non-cooperative PCMA communication. The demodulation network is trained in this paper, which combines the preprocessing module and decision module. Firstly, the preprocessing module is used to estimate the initial parameters, and the auxiliary signals are obtained by using the information of frequency offset estimation. Then, the time-frequency characteristic data of auxiliary signals are obtained, which is taken as the input data of the neural network to be trained. Finally, the decision module is used to output the demodulated bit sequence. Compared with traditional single-channel demodulation algorithms, the proposed algorithm does not need to go through all the possible values of transmit symbol pairs, which greatly reduces the complexity of demodulation. The simulation results show that the trained neural network can greatly extract the time-frequency characteristics of PCMA signals. The performance of the proposed algorithm is similar to that of PSP algorithm, but the complexity of demodulation can be greatly reduced through the proposed algorithm.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.167-172
• /
• 2005

This paper introduces a method which improves the performance of the identification of splice sites in the genomic DNA sequence of eukaryotes. This method combines a low order Markov model in series with a neural network for the predictions of splice sites. The lower order Markov model incorporates the biological knowledge surrounding the splice sites as probabilistic parameters. The Neural network takes the Markov encoded parameters as the inputs and produces the prediction. Two types of neural networks are used for the comparison. This method reduces the computational complexity and shows encouraging accuracy in the predictions of splice sites when applied to several standard splice site dataset.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2
• /
• pp.79-84
• /
• 1996

In this paper, adaptive correlator model using backpropagation neural network based on complex multilayer perceptron is presented for suppressing interference of narrow-band of direct sequence spread spectrum receiver in CDMA mobile communication systems. Recursive least square backpropagation algorithm with backpropagation error is used for fast convergence and better performance in adaptive correlator scheme. According to signal noise ratio and transmission power ratio, computer simulation results show that bit error ratio of adaptive correlator uswing backpropagation neural network improved than that of adaptive transversal filter of direct sequence spread spectrum considering of co-channel and narrow-band interference. Bit error ratio of adaptive correlator using backpropagation neural network is reduced about $10^{-1}$ than that of adaptive transversal filter where interference versus signal ratio is 5 dB.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.1
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• The Journal of Korea Robotics Society
• /
• v.13 no.1
• /
• pp.16-25
• /
• 2018

The talking head (TH) indicates an utterance face animation generated based on text and voice input. In this paper, we propose the generation method of TH with facial expression and intonation by speech input only. The problem of generating TH from speech can be regarded as a regression problem from the acoustic feature sequence to the facial code sequence which is a low dimensional vector representation that can efficiently encode and decode a face image. This regression was modeled by bidirectional RNN and trained by using SAVEE database of the front utterance face animation database as training data. The proposed method is able to generate TH with facial expression and intonation TH by using acoustic features such as MFCC, dynamic elements of MFCC, energy, and F0. According to the experiments, the configuration of the BLSTM layer of the first and second layers of bidirectional RNN was able to predict the face code best. For the evaluation, a questionnaire survey was conducted for 62 persons who watched TH animations, generated by the proposed method and the previous method. As a result, 77% of the respondents answered that the proposed method generated TH, which matches well with the speech.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.3
• /
• pp.193-199
• /
• 2017

Instead of using only spatial features from a single frame for person re-identification, a combination of spatial and temporal factors boosts the performance of the system. A recurrent neural network (RNN) shows its effectiveness in generating highly discriminative sequence-level human representations. In this work, we implement RNN, three Long Short Term Memory (LSTM) network variants, and Gated Recurrent Unit (GRU) on Caffe deep learning framework, and we then conduct experiments to compare performance in terms of size and accuracy for person re-identification. We propose using GRU for the optimized choice as the experimental results show that the GRU achieves the highest accuracy despite having fewer parameters than the others.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.242-250
• /
• 2019

In this paper, we propose a method to predict the failure of industrial robot using Seq2Seq (Sequence to Sequence) model, which is a model for transforming time series data among Artificial Neural Network models. The proposed method uses the data of the joint current and angular value, which can be measured by the robot itself, without additional sensor for fault diagnosis. After preprocessing the measured data for the model to learn, the Seq2Seq model was trained to convert the current to angle. Abnormal degree for fault diagnosis uses RMSE (Root Mean Squared Error) during unit time between predicted angle and actual angle. The performance evaluation of the proposed method was performed using the test data measured under different conditions of normal and defective condition of the robot. When the Abnormal degree exceed the threshold, it was classified as a fault, and the accuracy of the fault diagnosis was 96.67% from the experiment. The proposed method has the merit that it can perform fault prediction without additional sensor, and it has been confirmed from the experiment that high diagnostic performance and efficiency are available without requiring deep expert knowledge of the robot.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.213-221
• /
• 1996

An assembly sequence is considered to be optimal when is minimizes assembly cost while satisfying assembly constraints. To derive such an optimal sequence for robotic assembly, this paper proposes a method using a simulated annealing algorithm. In this method, an energy funciton is derived inconsideration of both the assembly constraints and the assembly cost. The energy function thus derived is iteratively minimized until no further change in energy occurs. During the minimization, the energy is occationally perturbed probabilistically in order to escape from local minima. The minimized energy yields an optimal assembly sequence. To show the effectiveness of the proposed method, case studies are presented for industrial products such as an electrical relay and an automobil alternator. The performance is analyzed by comparing the results with those of a neural network-based method, based upon the optimal solutions of an expert system.