• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.1
• /
• pp.193-200
• /
• 2003

This paper proposes a novel algorithm to recognize the curve of a structured road. The proposed algorithm uses an LCF (Lane Curve Function) obtained by the transformation of a parabolic function defined on world coordinate into image coordinate. Unlike other existing methods, the algorithm needs no transformation between world coordinate and image coordinate owing to the LCF. In order to search for an LCF describing the lane best, the differential comparison between the slope of an assumed LCF and the phase angle of edge pixels in the LROI (Lane Region Of Interest) constructed by the LCF is implemented. As finding the true LCF, the lane curve is determined. The proposed method is proved to be efficient through various kinds of images, providing the reliable curve direction and the valid curvature compared to the real road.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.297-299
• /
• 2006

Searching the region of interest on the Hough transform domain is done to determine the real road boundary on the high speed way. The mathematical morphology is employed to obtain the gradient image which is utilized in Hough transform. Many possible candidates of lines could appear on the ordinary road environment and simple selection of the strongest line segments likely to be fault boundary lines. To solve such problem, the search area for the candidates of the road boundary which is called the region of interest is limited on the Hough space. The effectiveness of the proposed algorithm has been shown with experimental results.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.580-583
• /
• 2018

본 논문에서는 SeqGAN 모델을 사용하여 한국어 시를 자동 생성해 보았다. SeqGAN 모델은 문장 생성을 위해 재귀 신경망과 강화 학습 알고리즘의 하나인 정책 그라디언트(Policy Gradient)와 몬테카를로 검색(Monte Carlo Search, MC) 기법을 생성기에 적용하였다. 시 문장을 자동 생성하기 위한 학습 데이터로는 사랑을 주제로 작성된 시를 사용하였다. SeqGAN 모델을 사용하여 자동 생성된 시는 동일한 구절이 여러번 반복되는 문제를 보였지만 한국어 텍스트 생성에 있어 SeqGAN 모델이 적용 가능함을 확인하였다.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.483-487
• /
• 1994

In this paper, we analize the effect of a steering water used in a unified phase I-phase II semi-infinite constrained optimization algorithm and present a new algorithm based on the facts that when the point x is far away from the feasible region where all the constraints are satisfied, reaching to the feasible region is more important than minimizing the cost function and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. Also, the angle between the search direction vector and the gradient of the cost function is considered when the steering parameter value is computed. Even though changing the steering parameter does not change the rate of convergence of the algorithm, we show through some examples that the proposed algorithm performs better than the other algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1-4
• /
• 1996

It is difficult that a non-translational motion in a block is estimated by the block matching algorithm (BMA). In this paper, a nodal-displacement-based deformation model is used for this reason. This model assumes that a selected number of control nodes move freely in a block and that displacement of any interior point can be interpolated from nodal displacements. As a special case with a single node this model is equivalent to a translational model. And this model can represent more complex deformation using more nodes. We used an iterative gradient based search algorithm to estimate nodal displacement. Each iteration involves the solution of a simple linear equation. This method is called the deformable block matching algorithm (DBMA).

• Proceedings of the Korean Geotechical Society Conference
• /
• 2005.03a
• /
• pp.765-776
• /
• 2005

As a result of industrial advancement and land development, a number of highway slopes have been gradually formed and numerous problems related to their stability have been frequently caused. Generally, major factors for rock slope stability are lithology, slope inclination, slope height, degree of weathering, precipitation, condition of groundwater and so onl. Many complex factors are mostly involved in the collapse of rock slopes. In this study, a database for 94 collapsed Jungang highway slopes were set up using GIS program through literature search, site investigation, geological map and Korea tectonic province map. The analyses for the collapsed factor including sort of rock(by origin), tectonic province, highway direction, slope gradient and direction, degree of weathering, slope height were carried.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.8
• /
• pp.308-316
• /
• 1985

This paper proposes an analytic tool for long-term generation expansion planning based on the maximum principle. Many research works have been performed in the field of generation expansion planning. But few works can be found with the maxinmum principle. A recently published one worked by professor Young Moon Park et al. shows remarkable improvements in modeling and computation. But this modeling allows only thermal units. This paper has extended Professor Park's model so that the optimal pumped-storage operation is taken into account. So the ability for practical application is enhanced. In addition, the analytic supply-shortage cost function is included. The maximum principle is solved by gradient search due to its simplicity. Every iteration is treated as if mathematical programming such that all controls from the initial to the terminal time are manipulated within the same plane. Proposed methodology is tested in a real scale power system and the simulation results are compared with other available package. Capability of proposed method is fully demonstrated. It is expected that the proposed method can be served as a powerful analytic tool for long-term generation expansion planning.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.1
• /
• pp.56-63
• /
• 2009

Cell migration is one of the essential mechanisms responsible for complex biological processes. Intensive researches have begun to elucidate the mechanisms and search intriguing conditions for efficient control of cell migration. One general mechanism that is widely applicable for cells including Escherichia coli, amoebae and endothelial cell is chemotaxis. The single cell study for bacterial chemotaxis has an advantage over studies with the population of cells in providing a clearer observation of cell migration, which leads to more accurate assessments of chemotaxis. In this paper, we propose a three-dimensional model considering a single bacterium to study its chemotaxis. The semi-implicit Fourier spectral method is applied for high efficiency and numerical stability. The simulation results reveal rich dynamics of cell migration and provide quantitative assessments of bacterial chemotaxis with various chemoattractant gradient fields.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.6
• /
• pp.37-42
• /
• 1998

본 논문에서는 SCHMM에 적용된 관찰 확률 최대화에 의한 화자 적응 알고리즘을 제안한다. 제안된 알고리즘은 SCHMM의 관찰 확률 밀도들이 새로운 화자의 음성 특징을 잘 표현하지 못하는 경우 인식 성능이 저하되는 것을 막기 위하여, 적응 데이터의 각 특징 벡터들이 최대의 관찰 확률을 가질 수 있도록 관찰 확률 밀도를 결정하는 평균 벡터 μ와 분산 행렬 Σ를 기울기 탐색(gradient search) 알고리즘에 의해 반복적으로 적응시켜 주는 방법이다. SCHMM의 상태 천이 확률 A와 혼합 밀도 계수 C는 관찰 확률 밀도 적응 과정 을 거친 후, 적응 데이터로부터 구한 확률과 기존 확률의 가중 평균을 취하는 과정을 반복 하여 적응시켜 주었다. 제안된 화자 적응 알고리즘을 사용하여 단독음 인식 실험을 수행한 결과, 화자 적응을 수행하지 않았을 때와 비교하여 화자 독립 시스템에서는 평균 9.8%, 남 성 화자 종속 시스템에서는 평균 46.0%, 여성 화자 종속 시스템에서는 평균 52.7%의 인식 률 향상을 보였다.