• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.743-747
• /
• 2010

This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.142-144
• /
• 2010

In this letter, we propose GPS L5 acquisition schemes to detect a fast code phase and improve the accuracy of the Doppler frequency. The proposed approach is based on the code-phase changes which occur during the acquisition processing time originating in the Doppler frequency. The proposed schemes detect a fast code phase within about 1 chip near the estimated code phase and improve the accuracy of the Doppler frequency by up to about 4 times in comparison with the popular Septentrio receiver. The feasibility of the proposed schemes is demonstrated through simulation.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.194-203
• /
• 2008

Iterative learning control (ILC) is a simple and effective method for the control of systems that perform the same task repetitively. ILC algorithm uses the repetitiveness of the task to track the desired trajectory. In this paper, we propose a PID (proportional plus integral and derivative) type ILC update law for control discrete-time single input single-output (SISO) linear time-invariant (LTI) systems, performing repetitive tasks. In this approach, the input of controlled system in current cycle is modified by applying the PID strategy on the error achieved between the system output and the desired trajectory in a last previous iteration. The convergence of the presented scheme is analyzed and its convergence condition is obtained in terms of the PID coefficients. An optimal design method is proposed to determine the PID coefficients. It is also shown that under some given conditions, this optimal iterative learning controller can guarantee the monotonic convergence. An illustrative example is given to demonstrate the effectiveness of the proposed technique.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.1
• /
• pp.131-138
• /
• 1996

In this paper, we consider an iterative learning control system(ILCS) consisting of an iterative learning controller, a feedback controller and a controlled plant in the frequency domain. At first, we review the convergence of ILCS. And we give some design guidelines of the ILCS using a nominal model of the plant. Then we present the structured and the unstructured uncertainty bound which guarantees the convergence of the designed iterative learning controller. In particular, we analyze the relationship between the convergence and the magnitude and phase uncertainties. In order to show the usefulness of the proposed analysis and design guidelines, we present some simulation examples. (author). 13 refs., 5 figs.

• Journal of the Korean institute of surface engineering
• /
• v.51 no.6
• /
• pp.365-371
• /
• 2018

1D core-shell nanostructures have attracted great attention due to their enhanced physical and chemical properties. Specifically, oriented single-crystalline $TiO_2$ nanorods or nanowires on a transparent conductive substrate would be more desirable as the building core backbone. However, a facile approach to produce such structure-based hybrids is highly demanded. In this study, a three-step hydrothermal method was developed to grow NiMn-layered double hydroxide-decorated $TiO_2$/carbon core-shell nanorod arrays on transparent conductive fluorine-doped tin oxide (FTO) substrates. XRD, SEM, TEM, XPS and Raman were used to analyze the obtained samples. The in-situ fabricated hybrid nanostructured materials are expected to be applicable for photoelectrode working in water splitting.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.312-320
• /
• 2021

Increase in computational cost and exhaustive search can lead to more complexity and computational energy. Thus, there is need for effective and efficient scheme to reduce the complexity to achieve optimal energy utilization. This will improve the energy efficiency and enhance the proficiency in terms of the resources needed to achieve convergence. This paper primarily focuses on the development of hybrid swarm intelligence scheme for reducing the computational complexity in binary optimization. In order to reduce the complexity, both artificial bee colony (ABC) and particle swarm optimization (PSO) have been employed to effectively minimize the exhaustive search and increase convergence. First, a new approach using ABC and PSO has been proposed and developed to solve the binary optimization problem. Second, the scout for good quality food sources is accomplished through the deployment of PSO in order to optimally search and explore the best source. Extensive experimental simulations conducted have demonstrate that the proposed scheme outperforms the ABC approaches for reducing complexity and energy consumption in terms of convergence, search and error minimization performance measures.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.732-734
• /
• 2023

Facial Action Units Detection (FAUs) problem focuses on identifying various detail units expressing on the human face, as defined by the Facial Action Coding System, which constitutes a fine-grained classification problem. This is a challenging task in computer vision. In this study, we propose a Prompt Tuning approach to address this problem, involving a 2-step training process. Our method demonstrates its effectiveness on the Affective in the Wild dataset, surpassing other existing methods in terms of both accuracy and efficiency.

• Journal of Korea Artificial Intelligence Association
• /
• v.1 no.1
• /
• pp.17-21
• /
• 2023

The primary objective of this research is to utilize machine learning models to analyze factors tailored to each dataset for predicting mental health conditions. The study aims to develop appropriate models based on specific datasets, with the goal of accurately predicting mental health states through the analysis of distinct factors present in each dataset. This approach seeks to design more effective strategies for the prevention and intervention of depression, enhancing the quality of mental health services by providing personalized services tailored to individual circumstances. Overall, the research endeavors to advance the development of personalized mental health prediction models through data-driven factor analysis, contributing to the improvement of mental health services on an individualized basis.

• Communications for Statistical Applications and Methods
• /
• v.15 no.2
• /
• pp.213-228
• /
• 2008

Using a linear loss function, this paper considers the one-sided testing problem for the exponential distribution via the empirical Bayes(EB) approach. Based on right censored data, we propose an EB test for the exponential parameter and obtain its convergence rate and asymptotic optimality, firstly, under the condition that the censoring distribution is known and secondly, that it is unknown.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.13-18
• /
• 2010

The composite stock cutting problem is defined as allocating rectangular and irregular patterns onto a large composite stock sheet of finite dimensions in such a way that the resulting scrap will be minimized. In this paper, we introduce a novel approach to hybrid optimization algorithm called MGA in MPI (Message Passing Interface) environments. The proposed MGA combines the benefit of rapid convergence property of Mean Field Annealing and the effective genetic operations. This paper also proposes the efficient data structures for pattern related information.