• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.98-105
• /
• 1997

Image transformation ahs been widely used in compuater graphics, computer vision, robot vision, and image processing. Image rotation is one of important part of image transformation. In image rotation, a two-pass algorithm has many advantages over a one-pass algorithm in high speed computation. This paper presents a new two-pass algorithm that overcomes the limitations of previously reported effect of interpolation. A brief comparison of existent techniques and the twp-pass algorithm newly suggeste is presented. This paper also present the hardware structure for the two-pass algorithm suggested.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2014년도 하계학술대회
• /
• pp.179-180
• /
• 2014

The main goal of this paper is to present an adaptive filter system using NLMS(Normalized Least mean square) adaptive algorithm for noise cancellation. The proposed algorithm has less computational complexity and better convergence property than the former algorithms like spectral subtraction algorithm, etc. We use TIMIT criterion voice and Noisex-92 for the experiment. The experimental result shows the feasibility of our algorithm for filtering noise from voice effectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국내학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.67-71
• /
• 1988

We present an algorithm that uses trajectory following errors to improve a feedforward command to a robot in the iterative manner. It has been shown that when the manipulator handles an unknown object, the P-type learning algorithm can make the trajectory converge to a desired path and also that the proposed learning control algorithm performs better than the other type learning control algorithm. A numerical simulation of a three degree of freedom manipulator such as PUMA-560 ROBOT has been performed to illustrate the effectiveness of the proposed learning algorithm.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.400-403
• /
• 2004

This paper presents an optimum design of journal bearings using a hybrid method to find the solutions of optimization problem. The present hybrid algorithm, namely Enhanced Artificial Life Algorithm(EALA), is a synthesis of an artificial life algorithm(ALA) and the random tabu search(R-tabu) method. EALA is applied to the optimum design of journal bearings supporting simple rotor. The applicability of EALA to optimum design of rotor-bearing system is exemplified through this study.

• 경영과학
• /
• 제19권1호
• /
• pp.189-196
• /
• 2002

Data clustering is often one of the first steps in data mining analysis. It Identifies groups of related objects that can be used as a starling point for exploring further relationships. This technique supports the development of population segmentation models, such as demographic-based customer segmentation. This paper Purpose to present the development of two phase hierarchical clustering algorithm for group formation. Applications of the algorithm for product-customer group formation in customer relationahip management are also discussed. As a result of computer simulations, suggested algorithm outperforms single link method and k-means clustering.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1272-1274
• /
• 2003

In this paper, we present a new algorithm for high dimensional data reduction based on wavelet decomposition and Genetic Algorithm (GA). Comparative results show the superiority of our algorithm for dimensionality reduction and accuracy improvement.

• 한국정밀공학회지
• /
• 제15권7호
• /
• pp.175-181
• /
• 1998

This paper describes realtime visual tracking system of moving object for three dimensional target using EKF(Extended Kalman Filter). We present a new realtime visual tracking using EKF algorithm and image prediction algorithm. We demonstrate the performance of these tracking algorithm through real experiment. The experimental results show the effectiveness of the EKF algorithm and image prediction algorithm for realtime tracking and estimated state value of filter, predicting the position of moving object to minimize an image processing area, and by reducing the effect by quantization noise of image.

• 한국지능시스템학회논문지
• /
• 제5권2호
• /
• pp.3-12
• /
• 1995

A controller utilizing fuzzy logic is developed to control the speed of a motor in a washing machine by choosing an appropriate phase. Due to the hardship imposed on obtaining a result from a relation established for inputs, present speed and present rate of speed, and ouput, a phase, of the system that can be tested against an experimental result, it is impossible to apply a genetic algorithm to fine-tune the fuzzy logic controller. To avoid this difficulty, a proper assumption that the parameters of an if-part of a primary fuzzy logic controller have a functional relationship with an error between computed values and experimental ones in made. Setting up of a fuzzy relationship between the parameters and the errors is then achieved through experimentally obtained data. Genetic Algorithm is then applied to this secondary fuzzy logic controller to verify the fuzzy logic. In the verification process, the primary fuzzy logic controller is used in obtaining experimental results. In this way the kind of difficulty in obtaining enough experimental values used to verify the fuzzy logic with genetic algorithm is gotten around. Selection of the parameters that would produce the least error when using the secondary fuzzy logic controller is done with applying genetic algorithm to the then-part of the controller. In doing so the optimal values for the parameters of the if-part of the primary fuzzy logic controller are assumed to be contained. The experimental result presented in the paper validates the assumption.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권1호
• /
• pp.89-100
• /
• 2016

Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

• 산업기술연구
• /
• 제22권B호
• /
• pp.35-44
• /
• 2002

To find the optimal solution as rapidly and exactly as possible with Nelder-Mead simplex algorithm, the present values of the reflection, expansion, contraction and/or shrink parameters of this algorithm are needed to be changed at appropriate time during the search process. The reflection parameter is selected in this study in order to be changed because reflection, expansion and contraction process can be simultaneously effected by only this parameter. Two independent indices for determining whether the present value of the reflection parameter of this algorithm should be changed or not during the search process are suggested in this study. Those indices were made of the equations of Nelder-Mead simplex algorithm's convergence criterion and Dennis-Wood's convergence criterion, respectively. It is appeared that the optimal solution can be find with smaller numbers of objective function evaluation than the original Nelder-Mead's one with fixed parameter when the those indices are used during the search process. and the more remarkable reduction effect of the number of an objective function evaluation can be obtained when the latter index is used.