• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.1
• /
• pp.117-120
• /
• 2008

This paper investigates the convergence condition of ADILC(iterative learning control with advanced output data) for nonminimum phase systems. ADILC has simple learning structure including both minimum phase and nonminimum phase systems. However, for nonminimum phase systems, the overall time horizon must be considered in input update law. This makes the dimension of convergence condition matrix large. In this paper, a new sufficient condition is proposed to satisfy the convergence condition. Also, it has been shown that this sufficient condition can be satisfied although it is not full impulse response.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.319-323
• /
• 1994

In this paper, we discuss a design method of iterative learning control systems for parabolic linear distributed parameter systems(DPSs). First, we discuss some aspects of boundary control of the DPS, and then propose to employ the Karhunen-Loeve procedure to reduce the infinite dimensional problem to a low-order finite dimensional problem. An iterative learning control(ILC) for non-square transfer function matrix is introduced finally for the reduced order system.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.225-227
• /
• 2006

This note investigates the convergence condition of ADILC (iterative learning control with advanced output data) for nonminimum phase systems. ADILC has simple learning structure including both minimum phase and nonminimum phase systems. However, for nonminimum phase systems, the overall time horizon must be considered in input update law. This makes the dimension of convergence condition matrix large. In this paper, a new sufficient condition is proposed to satisfy the convergence condition. Also, it has been shown that this sufficient condition can be satisfied although it is not full impulse response.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.396-400
• /
• 1996

It is prerequisite to apply dynamics controller to control robot manipulator required to perform fast and Precise motion. In this Paper, we Propose an adaptive 3earning control method for the dynamic control of a robot manipulator. The proposed control scheme is made up of PD controller in the feedback loop and the adaptive learning controller in the feedforward loop. This control scheme has the ability to estimate uncertain dynamic parameters included intrinsically in the system and to achieve the desired performance without the nasty matrix operation. The proposed method is applied to a SCARA robot and experimentally verified.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1395-1405
• /
• 2017

In this paper, we analyses heart beat data to identify subjects stress state (binary) using heart rate variability (HRV) features extracted from heart beat data of the subjects and implement supervised machine learning techniques to create the mental stress classifier. There are four steps need to be done: data acquisition, data processing (HRV analysis), features selection, and machine learning, before doing performance measurement. There are 56 features generated from the HRV Analysis module with several of them are selected (using own algorithm) after computing the Pearson Correlation Matrix (p-values). The results of the list of selected features compared with all features data are compared by its model error after training using several machine learning techniques: support vector machine, decision tree, and discriminant analysis. SVM model and decision tree model with using selected features shows close results compared to using all recording by only 1% difference. Meanwhile, the discriminant analysis differs about 5%. All the machine learning method used in this works have 90% maximum average accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.109-134
• /
• 2018

Collaborative Filtering (CF) is widely used in recommendation field, which can be divided into rating-based CF and learning-to-rank based CF. Although many methods have been proposed based on these two kinds of CF, there still be room for improvement. Firstly, the data sparsity problem still remains a big challenge for CF algorithms. Secondly, the malicious rating given by some illegal users may affect the recommendation accuracy. Existing CF algorithms seldom took both of the two observations into consideration. In this paper, we propose a recommendation method based on listwise learning-to-rank by incorporating users' social information. By taking both ratings and order of items into consideration, the Plackett-Luce model is presented to find more accurate similar users. In order to alleviate the data sparsity problem, the improved matrix factorization model by integrating the influence of similar users is proposed to predict the rating. On the basis of exploring the trust relationship between users according to their social information, a listwise learning-to-rank algorithm is proposed to learn an optimal ranking model, which can output the recommendation list more consistent with the user preference. Comprehensive experiments conducted on two public real-world datasets show that our approach not only achieves high recommendation accuracy in relatively short runtime, but also is able to reduce the impact of malicious ratings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1122-1132
• /
• 2012

Compressed sensing has been applied to many fields such as images, speech signals, radars, etc. It has been mainly applied to stationary signals, and reconstruction error could grow as compression ratios are increased by decreasing measurements. To resolve the problem, speech signals are divided into frames and processed in parallel. The frames are made sparse by dictionary learning, and adaptive compressed sensing is applied which designs the compressed sensing reconstruction matrix adaptively by using the difference between the sparse coefficient vector and its reconstruction. Through the proposed method, we could see that fast and accurate reconstruction of non-stationary signals is possible with compressed sensing.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.63-68
• /
• 2020

This paper proposes a face authentication system based on deep learning framework. The proposed system is consisted of face region detection and feature extraction using deep learning algorithm, and performed the face authentication using joint-bayesian matrix learning algorithm. The performance of proposed paper is evaluated by various face database , and the face image of one person consists of 2 images. The face authentication algorithm was performed by measuring similarity by applying 2048 dimension characteristic and combined Bayesian algorithm through Deep Neural network and calculating the same error rate that failed face certification. The result of proposed paper shows that the proposed system using deep learning and joint bayesian algorithms showed the equal error rate of 1.2%, and have a good performance compared to previous approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.5
• /
• pp.1671-1686
• /
• 2022

Face manipulation tools represented by Deepfake have threatened the security of people's biological identity information. Particularly, manipulation tools with deep learning technology have brought great challenges to Deepfake detection. There are many solutions for Deepfake detection based on traditional machine learning and advanced deep learning. However, those solutions of detectors almost have problems of poor performance when evaluated on different quality datasets. In this paper, for the sake of making high-quality Deepfake datasets, we provide a preprocessing method based on the image pixel matrix feature to eliminate similar images and the residual channel attention network (RCAN) to resize the scale of images. Significantly, we also describe a Deepfake detector named Cascaded-Hop which is based on the PixelHop++ system and the successive subspace learning (SSL) model. By feeding the preprocessed datasets, Cascaded-Hop achieves a good classification result on different manipulation types and multiple quality datasets. According to the experiment on FaceForensics++ and Celeb-DF, the AUC (area under curve) results of our proposed methods are comparable to the state-of-the-art models.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.869-879
• /
• 1995

The new field of learning control develops controllers that learn to improve their performance at executing a given task, based on experience performing this task. The simplest forms of learning control are based on the same concept as integral control, but operating in the domain of the repetitions of the task. In the previous paper, I had studied the use of such controllers in a decentralized system, such as a robot with the controller for each link acting independently. The basic result of the paper is to show that stability of the learning controllers for all subsystems when the coupling between subsystems is turned off, assures stability of the decentralized learning in the coupled system, provided that the sample time in the digital learning controller is sufficiently short. In this paper, we present two examples. The first illustrates the effect of coupling between subsystems in the system dynamics, and the second studies the application of decentralized learning control to robot problems. The latter example illustrates the application of decentralized learning control to nonlinear systems, and also studies the effect of the coupling between subsystems introduced in the input matrix by the discretization of the system equations. The conclusion is that for sufficiently small learning gain, and sufficiently small sample time, the simple learning control law based on integral control applied to each robot axis will produce zero tracking error in spite o the dynamic coupling in the robot equations. Of course, the results of this paper have much more general application than just to the robotics tracking problem. Convergence in decentralized systems is seen to depend only on the input and output matrices, provided the sample time is suffiently small.