• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.79-88
• /
• 1997

This paper introduces a new energy function, as maximum a posteriori(MAP) estimate of binocular disparity, that can deal with both random dot stereo-gram(RDS) and natural scenes. The energy function uses phase-magnitude as features to detect only the shift for a pair of corrupted conjugate images. Also we adopted Fleet singularity that effectively detects unstable areas of image plant and thus eliminates in advance error-prone stereo mathcing. The multi-scale concept is applied to the multi laser architecture that can search the solutions systematically from coarse to fine details and thereby avoids drastically the local minima. Using mean field approximation, we obtained a compact representation that is suitable for fast computation. In this manner, the energy function satisfies major natural constraints and requirements for implementing parallel relaxation. As an experiment, the proposed algorithm is applied to RDS and natural stereo images. As a result we will see that it reveals good performance in terms of recognition errors, parallel implementation, and noise characteristics.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2405-2407
• /
• 2001

In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.41-56
• /
• 2005

Product recommender system is one of the most popular techniques for customer relationship management. In addition, collaborative filtering (CF) has been known to be one of the most successful recommendation techniques in product recommender systems. However, CF has some limitations such as sparsity and scalability problems. This study proposes hybrid cluster analysis and case-based reasoning (CBR) to address these problems. CBR may relieve the sparsity problem because it recommends products using customer profile and transaction data, but it may still give rise to scalability problem. Thus, this study uses cluster analysis to reduce search space prior to CBR for scalability Problem. For cluster analysis, this study employs hybrid genetic and K-Means algorithms to avoid possibility of convergence in local minima of typical cluster analyses. This study also develops a Web-based prototype system to test the superiority of the proposed model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.139-141
• /
• 2006

유전자 알고리즘에서 좋은 염색체(chromosome)를 선택하는 방법은 알고리즘의 성능을 향상시키는데 매우 중요한 핵심 요소이다. 이러한 선택 기법 중에는 비례 선택 기법, 순위기반 선택 기법, 토너먼트 선택기법 등이 잘 알려져 있다. 이 중 가장 성능이 좋은 토너먼트 선택 기법은 열성 염색체중 우성인 유전자를 포함하는 열성 염색체가 선택에서 배제되어 지역적 최적해(local minima)를 구할 가능성, 열성 염색체가 다음 세대 진화를 방해할 가능성 등의 문제점을 가지고 있다. 본 논문에서는 토너먼트 선택 기법의 문제점을 해결하기 위해서 토너먼트-교배 선택 기법을 제안하였다. 이 방법은 토너먼트 선택 기법을 기반으로 하되 열성 염색체가 선택되었을 경우 그 안에 들어 있는 우성 유전자를 알고리즘 진화에 반영시키고자 교배 단계를 추가한 기법이다. 제안된 토너먼트-교배 선택 기법을 이용하면 기존의 토너먼트 선택 기법보다 평균수행시간이 짧아져 해에 수렴하는 속도가 향상된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.277-280
• /
• 2003

현재 많은 관심의 대상이 되고 있는 데이터 마이닝은 대용량의 데이터베이스로부터 일정한 패턴을 분류하여 지식의 형태로 추출하는 작업이다. 데이터 마이닝의 대표적인 기법인 군집화는 군집내의 유사성을 최대화하고 군집들간의 유사성을 최소화시키도록 데이터 집합을 분할하는 것이다. 데이터 마이닝에서 군집화는 대용량 데이터를 다루기 때문에 원시 데이터에 대한 접근횟수를 줄이고 알고리즘이 다루어야 할 데이터 구조의 크기를 줄이는 군집화 기법이 활발하게 사용된다. 그런데 기존의 군집화 알고리즘은 잡음에 매우 민감하고, local minima에 반응한다. 또한 사전에 군집의 개수를 미리 결정해야 하고, initialization 값에 다라 군집의 성능이 좌우되는 문제점이 있다. 본 연구에서는 유전자 알고리즘을 이용하여 자동으로 군집의 개수를 결정하는 군집화 알고리즘을 제안하고, 여기서 제시하는 적합도 함수의 최적화된 군집을 찾아내어 조금더 효율적인 알고리즘을 만들어 대용량 데이터를 다루는 데이터 마이닝에 적용해 보려한다.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2414-2416
• /
• 2003

In this raper, we present a Wavelet Neural Network(WNN) approach to the solution of the tracking problem for mobile robots that possess complexity, nonlinearity and uncertainty. The neural network is constructed by the wavelet orthogonal decomposition to form a wavelet neural network that can overcome the problems caused by local minima of optimization and various uncertainties. This network structure is helpful to determine the number of the hidden nodes and the initial value of weights with compact structure. In our control method, the control signals are directly obtained by minimizing the difference between the reference track and the pose of a mobile robot that is controlled through a wavelet neural network. The control process is a dynamic on-line process that uses the wavelet neural network trained by the gradient-descent method. Through computer simulations, we demonstrate the effectiveness and feasibility of the proposed control method.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.968-970
• /
• 1993

In this paper, the loss components of IPMSM(Inteiror Permanent Magnet Synchronous Motor) is derived. To maximize the efficiency of the motor, a design method that optimizes the design variables is proposed Objective function consists of stator winding loss, core loss, and mechanical loss. Simulated annealing is used as the optimization method which is appropriate for finding the global minimum of nonlinear function with many local minima. Through the simulation of the motor characteristics, the prominence of the proposed design method is verified.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.335-337
• /
• 1998

This paper presents a efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in distribution systems of radial type. Simulated Annealing can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing Algorithm, we may use advanced Simulated Annealing Algorithm. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• Bulletin of the Korean Chemical Society
• /
• v.8 no.1
• /
• pp.39-45
• /
• 1987

Daunomycin, an anthracycline antibiotic, has been found to inhibit virus multiplication and shows considerable activity against tumors. Its activity may be varied by conformational changes of daunomycin. The conformational changes are come from the pucker of D-ring and variation of environments. We have carried out conformational analyses by using empirical potential function. We found that when daunomycin is hydrated or bound to $Mg^{2+}$ ion, the minimum conformer of each state is altered from ${\alpha}$ conformer to ${\beta}$ conformer through the pathway having four local minima. Our calculated results are in good agreements with those of X-ray crystallography and biological experiments, in which metal ion inhibits the binding of daunomycin to DNA.