• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.5
• /
• pp.418-422
• /
• 2005

In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.11-19
• /
• 2013

In this paper we present a reodered simulated-anealing algorithm which is capable of applying odering based k-way partitioned clusters. This method is used for improvement of the objectives of partitioning which are k-way partitioned by using odering algorithm. It changes the positions of the clusters and the vertices in each clusters. Reodered vertices are splitted by using DP-RP method and this process has an opportunity to improve the objective functions. This algorithm has advantages to improve the quality of the solutions for various purposes. Experimental results on several graphs demonstrate that proposed algorithm provides substantial enhancement.

• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.2
• /
• pp.236-242
• /
• 2005

Dynamic Positioning(DP) system maintains ship's position (fixed location or predetermined track) exclusively by means of CPPs and thrusters. To generate the control input adequate to various situation an integrated controller for CPPs and thrusters is required. The integrated controller is composed of a thrust calculation algorithm and a thrust allocation algorithm. The thrust calculation algorithm generates thrusts in the surge direction and the sway direction from the desired forward and lateral speed and generates a moment about the yaw axis from desired heading angle. The thrust allocation algorithm allocates the generated thrusts and moment to each CPP and thruster. Computer simulations are executed to confirm the effectiveness of the suggested controller.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.6 no.2 s.21
• /
• pp.51-60
• /
• 2006

The objective of this research is to develop a least cost system design method for branched storm sewer systems while satisfying all the design constraints using heuristic techniques such as genetic algorithm and harmony search. Two sewer system models have been developed in this study. The SEWERGA and SEWERHS both determine the optimal discrete pipe installation depths as decision variables. Two models also determine the optimal diameter of sewer pipes using the discrete installation depths of the pipes while satisfying the discharge and velocity requirement constraints at each pipe. Two models are applied to the example that was originally solved by Mays and Yen (1975) using their dynamic programming(DP). The optimal costs obtained from SEWERGA and SEWERHS are about 4% lower than that of the DP approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.163-171
• /
• 2006

This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.412-413
• /
• 2006

This paper proposed the transmission planning mechanism in competitive power markets. This mechanism used Optimal Power Flow(OPF) to calculate operation cost and Contingency Constrained OPF(CC-OPF) to consider N-1 contingency outage. In addition, this algorithm deduced a yearly transmission planning using Dynamic Programming(DP).

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1296-1299
• /
• 2002

We implemented a CD signal processor operated on a CAV 48-speed CD-ROM drive into a VLSI. The CD signal processor is a mixed mode monolithic IC including servo-processor, data recovery, data-processor, and I-bit DAC. For servo signal processing, we included a DSP core, while, for CAV mode playback, we adopted a PLL with a wide recovery range. Data processor (DP) was designed to meet the yellow book specification.［2］So, the DP block consists of EFM demodulator, C1/C2 ECC block, audio processor and a block transferring data to an ATAPI chip. A modified Euclid's algorithm was used as a key equation solver for the ECC block To achieve the high-speed decoding, the RS decoder is operated by a pipelined method. Audio playability is increased by playing a CD-DA disc at the speed of 12X or 16X. For this, subcode sync and data are processed in the same way as main data processing. The overall performance of IC is verified by measuring a transfer rate from the innermost area of disc to the outermost area. At 48-speed, the operating frequency is 210 ㎒, and this chip is fabricated by 0.35 um STD90 cell library of Samsung Electronics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.20-28
• /
• 1992

Co-articulation is one of major factors that make connected word recognition difficult. This Study Considers the fact that the head Part Of the following word is changed by the Preceding word in a connection point, by applying the co-articulation model, and adj usting the following word .We choose a critical damping second order linear system for the co-articulation model, combining a one-stage DP matching recognition algorithm with this model, and Investigating the effects. The recognition experiment is carried out for 35 Korean 4 connected digits spoken by 5 male speakers, and recognition rate Is upgraded by 4.7 percent.

• Journal of Korea Water Resources Association
• /
• v.51 no.9
• /
• pp.803-812
• /
• 2018

The purpose of this study is to develop Particle Swarm Optimization (PSO) automatic calibration algorithm with multi-objective functions by Python, and to evaluate the applicability by applying the algorithm to the Soil and Water Assessment Tool (SWAT) watershed modeling. The study area is the upstream watershed of Gongdo observation station of Anseongcheon watershed ($364.8km^2$) and the daily observed streamflow data from 2000 to 2015 were used. The PSO automatic algorithm calibrated SWAT streamflow by coefficient of determination ($R^2$), root mean square error (RMSE), Nash-Sutcliffe efficiency ($NSE_Q$), and especially including $NSE_{INQ}$ (Inverse Q) for lateral, base flow calibration. The results between automatic and manual calibration showed $R^2$ of 0.64 and 0.55, RMSE of 0.59 and 0.58, $NSE_Q$ of 0.78 and 0.75, and $NSE_{INQ}$ of 0.45 and 0.09, respectively. The PSO automatic calibration algorithm showed an improvement especially the streamflow recession phase and remedied the limitation of manual calibration by including new parameter (RCHRG_DP) and considering parameters range.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.3
• /
• pp.148-155
• /
• 2005

A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.