• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.162-171
• /
• 2003

It is difficult to reuse the captured motion data, because the data has a difficulty in editing it. In this paper, a uniform posture mar (UPM) algorithm, one of unsupervised learning neural network is proposed to edit the captured motion data. Because it needs much less computational cost than other motion editing algorithms, it is adequate to apply in teal-time applications. The UPM algorithm prevents from generating an unreal posture in learning phase. It not only makes more realistic motion curves, but also contributes to making more natural motions. Above of all, it complements the weakness of the existing algorithm where the calculation quantity increases in proportion to increase the number of restricted condition to solve the problems of high order articulated body. In this paper, it is shown two applications as a visible the application instance of UPM algorithm. One is a motion transition editing system, the other is a inductive inverse kinematics system. This method could be applied to produce 3D character animation based on key frame method, 3D game, and virtual reality, etc.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.2
• /
• pp.149-158
• /
• 2005

In this paper, we have designed and implemented a portable e-tongue (electronic tongue) system using MACS (multi array chemical sensor) and PDA. The system embedded in PDA has merits such as comfortable user interface and data transfer by internet from on-site to remote computer. MACS was made up 7 electrodes (${NH_4}^+$, $Na^+$, $Cl^-$, ${NO_3}^-$, $K^+$, $Ca^{2+}$, $Na^+$, pH) and a reference electrode. For learning the system, we adapted the Levenberg-Marquardt algorithm based on the back-propagation, which could iteratively learned the pre-determined standard patterns, in e-tongue system. Conclusionally, the relationship between the standard patterns and unknown pattern can be easily analyzed. The e-tongue was applied to whiskeys and cognac (one high level whisky, one low level whiskey, two cognac) and 2 sample whiskeys for each standard patterns and unknown patterns. The relationship between the standard patterns and unknown patterns can be easily analyzed.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.674-679
• /
• 2017

In big-data environments wherein large amounts of text documents are produced daily, titles are very important clues that enable a prompt catching of the key ideas in documents; however, titles are absent for numerous document types such as blog articles and social-media messages. In this paper, a title-generation model for which sequence-to-sequence RNNs with attention and copying mechanisms are employed is proposed. For the proposed model, input sentences are encoded based on bi-directional GRU (gated recurrent unit) networks, and the title words are generated through a decoding of the encoded sentences with keywords that are automatically selected from the input sentences. Regarding the experiments with 93631 training-data documents and 500 test-data documents, the attention-mechanism performances are more effective (ROUGE-1: 0.1935, ROUGE-2: 0.0364, ROUGE-L: 0.1555) than those of the copying mechanism; in addition, the qualitative-evaluation radiative performance of the former is higher.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.2
• /
• pp.129-134
• /
• 2008

In this paper, we carry out the simulation for an optimal solution of one-dimensional nonlinear photonic crystal structure using Genetic algorithm, and show the proposed method to apply for photonic transistors. Unlike a conventional steepest descent method for an optimization, the proposed method based on Genetic Algorithm has advantages for finding out excellent solutions without any analytic forms, which can easily apply to other applications. Also, as several solutions around global minimum solution can be obtained, it is very good optimization tool to give us the patterns about the optimal structure of a photonic crystal transistor. To design an all-optical filter transistor, Neural network algorithm is firstly performed for an initial design and then Genetic Algorithm is finally used to get the optimal solution. From the simulation of one-dimensional photonic crystal transistor, 27dB of the switching On/Off ratio is obtained.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.85-93
• /
• 2008

For music score recognition, several approaches have been proposed including shape matching, statistical methods, neural network based methods and structural methods. In this paper, we deal with recognition for low resolution images which are captured by the digital camera of a mobile phone. Considerable distortions are included in these low resolution images, so when existing technology is used, many problems appear. First, captured images are not stable in the sense that they contain lots of distortions or non-uniform illumination changes. Therefore, notes or symbols in the music score are damaged and recognition process gets difficult. This paper presents recognition technology to overcome these problems. First, musical note to head, stick, tail part are separated. Then template matching on head part of musical note, and remainder part is applied. Experimental results show nearly 100% recognition rate for music scores with single musical notes.

• Journal of the Korean Chemical Society
• /
• v.45 no.5
• /
• pp.422-428
• /
• 2001

Retention relative times(RRTs) of PAH molecules and their derivatives in gas chromatography are trained and predicted in testing sets using a multiple linear regression(MLR) and an artificial neural network(ANN). The main descriptors of PAHs and their derivatives in QSRR are the square root of molecular weight(sqmw), molecular connectivity($^1{\chi}_v$), molecular dipole moment(D) and length-to-breadth ratios(L/B). The results of MLR shows that a heavy molecule has a propensity for long retention time. L/B closely related with slot model is a good descriptor in MLR. On the other hand, ANN which is not effected by the linear dependencies among the descriptors were exclusively based on molecular weight and molecular dipole moment. The variances which shows the accuracy of prediction for retention times in testing sets are 1.860, 0.206 for MLR and ANN, respectively. It was shown that ANN can exceed the MLR in prediction accuracy.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.438-441
• /
• 2007

Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

• Communications for Statistical Applications and Methods
• /
• v.18 no.6
• /
• pp.859-869
• /
• 2011

Interest has increased in academic research regarding key factors that drive box-office success as well as the ability to predict the box-office success of a movie from a commercial perspective. This study analyzed the relationship between key success factors of a movie and box office records based on movies released in 2010 in Korea. At the pre-production investment decision-making stage, the movie genre, motion picture rating, director power, and actor power were statistically significant. At the stage of distribution decision-making process after movie production, among other factors, the influence of star actors, number of screens, power of distributors, and social media turned out to be statistically significant. We verified movie success factors through the application of a Multinomial Logit Model that used the concept of choice probabilities. The Multinomial Logit Model resulted in a higher level of accuracy in predicting box-office success compared to the Artificial Neural Network and Discriminant Analysis.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.489-495
• /
• 2014

A micro-genetic algorithm (MGA) is one of the improved forms of a genetic algorithm. It is used to reduce the number of iterations and the computing resources required by using small populations. The efficiency of MGAs has been proved through many problems, especially problems with 3-5 design variables. This study proposes an optimization algorithm based on the sequential design of experiments (SDOE) and an MGA. In a previous study, the authors used the SDOE technique to reduce trial-and-error in the conventional approximate optimization method by using the statistical design of experiments (DOE) and response surface method (RSM) systematically. The proposed algorithm has been applied to various mathematical examples and a structural problem.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.12
• /
• pp.55-63
• /
• 2003

The traffic accident is the prerequisite of the traffic accident reconstruction. In this study, the traffic accident (forward collision) and traffic accident reconstruction (inverse collision) simulations are conducted to improve the quality and accuracy of the traffic accident reconstruction. The vehicle and tire models are used to simulate the trajectories for the post-impact motion of the vehicles after collision. The impact dynamic model applicable to the forward and inverse collision simulations is also provided. The accuracy of impact analysis for the vehicular collision depends on the accuracy of the coefficients of restitution and friction. The neural network is used to estimate these coefficients. The forward and inverse collision simulations for the multi-collisions are conducted. The new method fur the accident reconstruction is proposed to calculate the pre-impact velocities of the vehicles without using the trial and error process which requires the repeated calculations of the initial velocities until the forward collision simulation satisfies with the accident evidences. This method estimates the pre-impact velocities of the vehicles by analyzing the trajectories of the vehicles. The vehicle slides on a road surface not only under the skidding during an emergency braking but also under the steering. A vehicle over steering or cornering with excessive speed loses the traction and leaves tile yaw marks on the road surface. The new critical speed formula based on the vehicle dynamics is proposed to analyze the yaw marks and shows smaller errors than ones of the existing critical speed formula.