• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.51-57
• /
• 1993

This paper develops 0($n^3$) algorithm to construct a cut-tree generated by Gomory-Hu algorithm. The algorithm only requires node sets defined by the minimal cut in each of the (n-1) maximal flow determinations. Merging computerized facility layout procedure that uses cut-tree concept to generate design skeletons with our algorithm requires less storage space than merging it with Gomory-Hu algorithm. Also, the cut-tree can easily be modified when the (n-1) minimal cut-sets are updated due to changes on arc capacities.

• Korean Journal of Mathematics
• /
• v.19 no.3
• /
• pp.243-253
• /
• 2011

We would like to propose a Cooley-Tukey modied algorithm in fast Fourier transform(FFT). Of course, this is a kind of Cooley-Tukey twiddle factor algorithm and we focused on the choice of integers. The proposed algorithm is better than existing ones in speeding up the calculation of the FFT.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2007.08b
• /
• pp.1486-1489
• /
• 2007

Generally many kind of phase unwrapping method are used to obtain three-dimensional feature in digital holography. Goldstein algorithm is representative method. But Goldstein algorithm has some problems. We developed a modified Goldstein algorithm that could solve the problem of Goldstein algorithm using the boundary information. Obtained three-dimensional information can be applied to 3-D contents of stereoscopic, multi-view, SMV, or holographic display.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.401-406
• /
• 2011

This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

• International Journal of Ocean System Engineering
• /
• v.2 no.3
• /
• pp.139-150
• /
• 2012

This paper presents an improved guidance algorithm for autonomous underwater vehicles (AUV) in 3D space for generating smoother vehicle turn during the course change at the way-points. The way-point guidance by the line-of-sight (LOS) method has been modified for correcting the reference angles to achieve minimal calculation and smoother transition at the way-points. The algorithm has two phases in which the first phase brings the vehicle to converge to a distance threshold point on the line segment connecting the first two way-points and the next phase generates an angular path with smoother transition at the way-points. Then the desired angles are calculated from the reference and correction angles. The path points are regularly parameterized in the spherical coordinates and mapped to the Cartesian coordinates. The proposed algorithm is found to be simple and can be used for real time implementation. The details of the algorithm and simulation results are presented.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.430-435
• /
• 2008

In the paper, an algorithm called a Constraint algorithm is proposed to solve the fan-in problem occurred in ADC encoding circuits. The Flash ADC architecture uses a double-base number system (DBNS). The DBNS has known to represent the multi-dimensional logarithmic number system (MDLNS) used for implementing the multiplier accumulator architecture of FIR filter in digital signal processing (DSP) applications. The authors use the DBNS with the base 2 and 3 to represent binary output of ADC. A symmetric map is analyzed first, and then asymmetric map is followed to provide addition read DBNS to DSP circuitry. The simulation results are shown for the Double-Base Integer Encoder (DBIE) of the 6-bit ADC to demonstrate an effectiveness of the Constraint algorithm, using $0.18{\mu}\;m$ CMOS technology. The DBIE’s processing speed of the ADC is fast compared to the FAT tree encoder circuit by 0.95 GHz.

• Journal of Advanced Marine Engineering and Technology
• /
• v.23 no.2
• /
• pp.259-269
• /
• 1999

A new algorithm for measuring 3-D velocity components of high speed flows were developed using a digital image processing technique. The measuring system consists of three CCD cameras an optical instrument called AOM a digital image grabber and a host computer. The images of mov-ing particles arranged spatially on a rotation plate are taken by two or three CCD cameras and are recorderd onto the image grabber or a video tape recoder. The three-dimensionl velocity com-ponents of the particles are automatically obtained by the developed algorithm In order to verify the validity of this technique three-dimensional velocity data sets obtained from a computer simu-lation of a backward facing step flow were used as test data for the algorithm. an uncertainty analysis associated with the present algorithm is systematically evaluated, The present technique is proved to be used as a tookl for the measurement of unsteady three-dimensional fluid flows.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.84-96
• /
• 1997

In this paper an efficient morphologica algorithm for reducing gaussian and impulse noise in gray-scale image is presented. Based on the edge information the input image is partitioned into a flat region and an edge region, then different algorithms are selectively applied to each region. in case of impulse noise, MGR (morphologica grayscale reconstruction) algorithm with directional SE (structuring element) is applied to the flat region. For theedge region opening-closing (closing-opening) is used instead of dialation (erosion), so that the remaining noise around large objects can be removed. In case of gaussian noise, 5*5 OCCO(opening closing closing opening) and 3*3 DMF(directional morphological filter ) are used for the flat region and the edgeregion, respectively. In order to remove discontinuity at the edge boundary, the algorithm uses 3*3 OCCO around the edge region to reconstruct the final image. Experimetnal results have shown that the proposed algorithm achieves a high performance in terms of noise removal, detail preservation, and NMSE.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1850-1856
• /
• 1989

For determining motion/structure of a 3-D rigid object from point correspondences over two perspective views, a linear algorithm was developed in Refs. 3 and 4. This algorithm fails when the 3-D points under observation satisfy certain geometrical constraints, as demonstrated in Refs. 7 and 8. In the present paper, we show that the linear algorithm can be resurrected in these degenerate cases by adding additional lower order polynomial constraints to original equations.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.162-167
• /
• 2005

A 3D solid element mesh generation algorithm was newly developed. 3D surface points of global rectangular coordinates were supplied by a 3D laser scanner. The algorithm is strait forward and simple but it generates hexahedral solid elements. Then, the surface rectangular elements were generated from the solid elements. The key of the algorithm is elimination of unnecessary elements and 3D boundary surface fitting using given 3D surface point data.