• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.637-639
• /
• 2021

자율주행 연구가 활발히 진행되면서 ADAS(Advanced Driver Assistance System)에서 차량의 위치를 파악하고 경로를 유지하는데 차선 검출은 필수적인 기술이다. 차선 검출은 허프 변환과 RANSAC(Random Sample Consensus)과 같은 영상처리 알고리즘을 이용하여 검출한다. 본 논문은 라즈베리파이3 B+에 OpenCV를 이용하여 선형 도형 검출 알고리즘을 구현하고 있다. OpenCV 가우시안 블러 구조와 캐니 에지 검출을 통해 문턱값을 설정하였고, 선형 검출 알고리즘을 통한 차선 인식에 성공하였다.

• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

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

In this paper, an iterative leaning control algorithm for the linear discrete system is proposed. Based upon the parameter estimation method, the learning for good tracking control is acqured through a sequence of repetitive operations. A series of simulation are performed to show the validity of this algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제21권5호
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• 한국컴퓨터정보학회논문지
• /
• 제20권9호
• /
• pp.81-86
• /
• 2015

This paper suggests heuristic algorithm with linear time complexity to decide the normal and optimal point at minimum loss/maximum profit maximum shortest scheduling problem with additional loss cost and bonus profit cost. This algorithm computes only the earliest ending time for each node. Therefore, this algorithm can be get the critical path and project duration within O(n) time complexity and reduces the five steps of critical path method to one step. The proposed algorithm can be show the result more visually than linear programming and critical path method. For real experimental data, the proposed algorithm obtains the same solution as linear programming more quickly.

• Steel and Composite Structures
• /
• 제12권6호
• /
• pp.505-522
• /
• 2012

An artificial bee colony (ABC) algorithm is developed for the optimum design of geometrically non-linear steel frames. The ABC is a new swarm intelligence method which simulates the intelligent foraging behaviour of honeybee swarm for solving the optimization problems. Minimum weight design of steel frames is aimed under the strength, displacement and size constraints. The geometric non-linearity of the frame members is taken into account in the optimum design algorithm. The performance of the ABC algorithm is tested on three steel frames taken from literature. The results obtained from the design examples demonstrate that the ABC algorithm could find better designs than other meta-heuristic optimization algorithms in shorter time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(I)
• /
• pp.144-147
• /
• 1987

An adaptive control algorithm for a plant with unmodelled dynamics is proposed. The upper bounds of the output due to the unmodelled dynamics and measurement noise is assumed to be known. Linear programming is used in estimating the bounds of plant parameters. Projection type algorithm is used in estimating the plant parameter with these bounds. This algorithm is nearly the same as those proposed by Kreisselmeier or Middleton except that the bounds are computed by linear programming. The stability of the proposed algorithm Can be proved in nearly the same way as that of Middleton. Simulation results show that the proposed algorithm gives better parameter convergence and smaller overshoot in the plant output than the algorithm without computing the bounds of plant parameters by linear programming.

• 한국정보처리학회논문지
• /
• 제4권9호
• /
• pp.2247-2258
• /
• 1997

계층적 자료구조인 사진트리는 이진 영상을 표현하는데 매우 중요한 자료구조이다. 사진트리를 메모리에 저장하는 방법 중 선형 사진트리 표현 방법은 다른 표현 방법과 비교할 때 저장 공간을 매우 효율적으로 절약할 수 있는 이점이 있으나, 이를 구축하기 위해서는 복잡하고 시간이 많이 걸린다. 본 논문에서는 RMESH 구조에서 3-차원 $n{\times}n{\times}n$ 프로세서를 사용하여 $n{\times}n$ 이진 영상을 O(1)시간에 선형 사진트리를 구축하는 알고리즘을 제안하였다. 제안한 알고리즘은 시간 복잡도 O(1)을 갖는 합병 알고리즘과 기존의 O(1) 정렬 알고리즘을 사용함으로써 PARBUS 구조에서 제안된 알고리즘보다 간단하고 쉽게 이해할 수 있는 장점이 있다.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.58-65
• /
• 1994

A recursive on-line algorithm for orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters time delay and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursiveform by using new functions of two dimensional autocorrelations and crosscorrelations of inputs and outputs. This proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.58-63
• /
• 1993

A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters, time delay, and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursive form by using new functions of two dimensional autocorrelations and cross-correlations of inputs and outputs. The proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.