• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2747-2752
• /
• 2007

A numerical study has been performed on the flow past a two-staged orifice in a rectangular duct. The flow field including the recirculation region behind the orifice was investigated and the pressure drop was calculated. Water was used as a working fluid and the flow was treated as the turbulent flow, of which the Raynolds number was 6000. The main parameters for the pressure drop and the recirculation region were the orifice's inclined angle against the duct, the interval between two orifices, the shape of the orifice's hole having the same area, and the change of the hole position at the same interval. The variation of the flow field was investigated with each parameter. Consequently, it was found that the most dominant parameter influencing the drop of the pressure was the change of the hole position at the same interval between orifices. Especially when the interval between orifices was narrow and the relative position the holes was changed, its effect to the flow field was shown most drastically as a result of this study. The SIMPLER algorithm with FLUENT code was employed to analyze the flow field.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2006.05a
• /
• pp.253-256
• /
• 2006

A numerical study for spray flow of fuel and oxidizer droplets in the combustion chamber has been conducted prior to the analysis of spray combustion of the liquid rocket engine. As the spray combustion model, DSF model and Euler-Lagrange scheme have been used. While the coupling effects of the droplets between gas phase and evaporated vapor have been calculated using PSIC model, SIMPLER algorithm and QUICK scheme have been used as numerical schemes. As the results, the calculations have shown velocity and temperature distribution in combustion chamber as well as mole fraction of fuel and oxidizer.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.15-23
• /
• 1996

Bump mapping is an elegant rendering technique to simulate wrinkled surfaces such as bark, which enables to produce more realistic image than texture-mapped one. This paper presents a new algorithm for bump mapping along with a hardware architecture to run our algorithm in real-time. The proposed approach is more efficient than previous one, and in particular, our hardware architecture is simpler to implement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2541-2546
• /
• 2009

In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other DFSA algorithms. However, the standard does not define an optimized parameter value for adjusting the frame size. In this paper, we propose the optimized parameter values for minimizing the identification time by various computer simulations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.1
• /
• pp.57-68
• /
• 2004

Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.166-172
• /
• 2012

The standard wave height measurement system is usually based on spectrum analysis for measuring wave height. The spectrum analysis is complicated because of the FFT, and the FFT is not for real time processing since it requires the saved data segments. In this paper, we carried out the performance evaluation of real-time and simpler wave height measurement system using the kalman filter and inertial sensors. The kalman filter theory is complicated, but its algorithm is simpler than the FFT and the kalman filter is used to estimate wave height by integrating acceleration data. But the accumulated error is occurred when the acceleration data is integrated. We developed the algorithm using the wind wave characteristic to decrease the accumulated error. In this paper, the performance evaluation of the wave height measurement system is carried out for various wind wave conditions. Through the experiments, we verified that it shows high measurement performance with the 3.5% margin of error in wind wave condition.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2247-2258
• /
• 1997

Quadtree, which is hierarchical data structure, is a very important data structure to represent binary images. Since a linear quadtree representation as is a way to store a quadtree is efficient to save space compared with other representations. It is, however, complicated and takes a large amount of time to build the linear quadtree. In this paper, we present O(1) time a linear quadtree building algorithm for a $n{\times}n$ binary image using three-dimensional $n{\times}n{\times}n$ processors on RMESH structure. Our algorithm, by use of O(1) time collapsing algorithm and reported O(1) time sorting algorithm, is simpler and easier to understand than resently presented algorithm on PARBUS structure.

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.53-60
• /
• 2006

In the applications such as CAD or image processing, a variety of geometric objects are manipulated. A polygon in which all the edges are parallel to x- or y-axis is decomposed into simple rectangles for efficient handling. But, depending on the partitioning algorithms, the same region can be decomposed into a completely different set of rectangles in the number, size and shape of rectangles. So, it is necessary an algorithm that compares two sets of rectangles extracted from two scenes such as CAD or image to see if they represent the same region. This paper proposes an efficient algorithm that compares two sets of rectangles. The proposed algorithm is not only simpler than the algorithm based on sweeping method, but also reduces the number $O(n^2)$ of overlapped rectangles from the algorithm based on a balanced binary tree to O(nlogn).

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1137-1139
• /
• 1987

We discuss several issues related to the sorting algorithms on hypercube machine. The efficiencies of the algorithms are compared under the simpler assumption and the load balancing problem arising from the various algorithms and the data distribution is also discussed.