• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.31-33
• /
• 2004

TSP(Traveling Salesman Problem)는 주어진 N개의 City들을 단 한번씩만 거쳐 출발지로 되돌아오는 경로들 중 가장 작은 비용이 소요되는 경로를 찾는 문제이며, 고전적인 최적화 문제로 널리 알려져 있다. City의 수가 증가하면 최적 Tour를 찾기 위한 연산 시간이 길어지는 단점이 있다. 본 논문에서는 대규모 TSP의 효율적 해결을 위해 새로운 알고리즘을 제안한다. 본 논문에서는 대규모의 City들의 집합을 두개의 소집합으로 분할하고, 병합을 위해 하나의 Junction City를 지정한다. 분할된 두개의 소집합 각각의 최적 Tour를 구한 후 분할된 두 최적 Tour를 병합하여 하나의 근사 Tour를 구한다. 지정된 Junction City는 병합 시 최적 병합조건을 구하는 연산의 간편화를 기대할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.74-84
• /
• 1988

This paper presents feature extraction technique for linear image using edge detection algorithms. The process of edge finding consists of determining edge magnitud and direction by convolution of an image with a number of edge masks, of thinning and ghresholding these edge magnitudes, of linking the edge elemtnts based on proximity ans orientation, and finally, of approximating the linked elements by piede-wise linear segmentss. These techniques are intened to be general and opplications to terminal detection and road recognition tasks are described. The presentation will be helpful to other researchers attempting to implement similar algorithms.

• Proceedings of the KAIS Fall Conference
• /
• 2004.06a
• /
• pp.327-330
• /
• 2004

공급사슬은 공급자, 공장, 유통센터, 소비자 둥의 네트워크로 구성되고, 이러한 공급사슬네트워크에서 생산과 분배의 각 활동사이의 상호작용에 대해 고려해야만 한다. 공급사슬관리(SCM) 연구에 있어서 생산과 분배에 대한 총비용을 최소화하는 것은 중요한 문제인데, 본 연구에서는 다설비, 다제품에 대한 생산과 분배를 동시에 고려하는 연구를 수행하였다. 이를 위하여 공급사슬 네트워크에서의 총비용을 최소화하는 수학적 모델을 제안하였고, 유전자 알고리즘기반의 총비용의 근사최적해와 각각의 생산비용, 재고비용, 수송비용을 얻을 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.23-32
• /
• 2007

The H.264/AVC video coding standard uses rate distortion optimization (RDO) method to improve the compression performance in the intra prediction. The complexity and computational load are increased more than previous standard by using this method, even though this standard selects the best coding mode for the current macroblock. This paper proposes a fast intra mode decision algorithm for H.264/AVC encoder based on dominant edge direction (DED). To apply the idea, this algorithm uses the approximation of discrete cosine transform (DCT) coefficient. By detecting the DED, 3 modes instead of 9 modes are chosen for RDO calculation to decide the best mode in the $4{\times}4$ luma block. As for the $16{\times}16$ luma and $8{\times}8$ chroma block, instead of 4 modes, only 2 modes are searched. Experimental results show that the computation time of the proposed algorithm is decreased to about 72% of the full search method with negligible quality loss.

• Journal of Advanced Navigation Technology
• /
• v.20 no.1
• /
• pp.53-58
• /
• 2016

In this paper, we propose a novel quadratic Kalman filter based object tracking algorithm using moving pictures. Quadratic Kalman filter, which is introduced recently, has not yet been applied to the problem of 3-dimensional (3-D) object tracking. Since the mapping of a position in 2-D moving pictures into a 3-D world involves non-linear transformation, appropriate algorithm must be chosen for object tracking. In this situation, the quadratic Kalman filter can achieve better accuracy than extended Kalman filter. Under the same conditions, we compare extended Kalman filter, unscented Kalman filter and sequential importance resampling particle filter together with the proposed scheme. In conculsion, the proposed scheme decreases the divergence rate by half compared with the scheme based on extended Kalman filter and improves the accuracy by about 1% in comparison with the one based on unscented Kalman filter.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.186-200
• /
• 2010

In order to render global illumination realistically, we need to accurately compute the direct and indirect illumination that represents the light information incoming through complex light paths. In this process, the indirect illumination at given point is greatly affected by surrounding geometries. Harmonic mean distance is a mathematical tool which is often used as a metric indicating the distance from a surface point to its visible objects in 3D space, and plays a key role in such advanced global illumination algorithms as irradiance/radiance caching and ambient occlusion. In this paper, we analyze the accuracy of harmonic mean distance estimated against various environments in the final gathering and photon mapping methods. Based on the experimental results, we discuss our experiences and future directions that may help develop an effective harmonic mean distance computation method in the future.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.3
• /
• pp.228-235
• /
• 2010

This paper deals with an autonomous flight controller design problem for a tilt-rotor aircraft in rotary-wing mode. The inner-loop algorithm is designed using the output-based approximate feedback linearization. The model error originated from the feedback linearization is cancelled within allowable tolerance by using single-hidden-layer neural network. According to Lyapunov direct stability theory, the adaptive update law is derived to run the neural network on-line, which is based on the linear observer dynamics. Moreover, the outer-loop algorithm is designed to track the trajectory generated from way-point guidance. Especially, heading and flight-path angle line-of-sight guidance are applied to the outer-loop to improve accuracy of the landing tracking performance. The 6-DOF nonlinear simulation shows that the overall performance of the flight control algorithm is satisfactory even though the collective input response shows instantaneous actuator saturation for a short time due to the lack of the neural network and the saturation protection logic in that loop.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.2
• /
• pp.139-148
• /
• 2012

The MLS(Moving Least Squares) Difference Method is a numerical scheme that combines the MLS method of Meshfree method and Taylor expansion involving not numerical quadrature or mesh structure but only nodes. This paper presents an dynamic algorithm of MLS difference method for solving transient solid mechanics problems. The developed algorithm performs time integration by using Newmark method and directly discretizes strong forms. It is very convenient to increase the order of Taylor polynomial because derivative approximations are obtained by the Taylor series expanded by MLS method without real differentiation. The accuracy and efficiency of the dynamic algorithm are verified through numerical experiments. Numerical results converge very well to the closed-form solutions and show less oscillation and periodic error than FEM(Finite Element Method).

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.