• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.2
• /
• pp.153-160
• /
• 2000

A Particle Image Velocimetry(PIV) algorithm is developed to analyze whole flow field both qualitatively and quantitatively. The practical use of PIV requires the use of fast, reliable, computer-based methods for tracking numerous particles suspended in a flow field. The TSS, NTSS, FFT-Hybrid, which are developed in the area of image compression and coding, are introduced to develop fast vector search algorithm. The numerical solution of the lid-driven cavity flow by the ADI algorithm with the Wachspress Formula is introduced to produce synthetic data for the validation of the tracking algorithms. The algorithms are applied to image data of real flow experiments. The comparisons in CPU time and mean error show, with a small loss of accuracy, CPU time for tracking is reduced considerably.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1043-1052
• /
• 2003

In this paper, we present a fast motion estimation algorithm to reduce the computations of block matching algorithm for motion estimation in video coding. The proposed algorithm is based on Multi-level Successive Elimination Algorithm and Efficient Multi-level Successive Elimination Algorithms. The best estimate of the motion vectors can be obtained by hierarchical search point sampling and thus the proposed algorithm can decrease the number of matching evaluations that require very intensive computations. The efficiency of the proposed algorithm was verified by experimental results.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.147-156
• /
• 2004

In this paper, a new fast motion estimation algorithm which is based on the Block Sum Pyramid Algorithm(BSPA) is presented. The Spiral Diamond Mesh Search scheme and Partial Distortion Elimination scheme of Efficient Multi-level Successive Elimination Algorithm were improved and then the improved schemes were applied to the BSPA. The motion estimation accuracy of the proposed algorithm is nearly 100% and the cost of Block Sum Pyramid Algorithm was reduced in the proposed algorithm. The efficiency of the proposed algorithm was verified by experimental results.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.7
• /
• pp.37-42
• /
• 2008

In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2389-2392
• /
• 2005

We present fast stereo matching algorithm using edge projection. Traditional stereo matching algorithm uses 2D template for the search of corresponding point thus it requires huge the computational cost. In this paper, we reduce the 2D search problem into 1D using edge projection along vertical and horizontal direction inside the region of interest. Also, by accumulation of edge projection along vertical and horizontal direction, the edge projection within the region of interest could simply be obtained by just subtracting two values. Experimental results show that matching algorithm using edge projection also gives comparable discriminating power compared to that of using intensity.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.669-672
• /
• 1998

In this paper, w epropose a fast fractal coding method based on correlation coefficients of subblocks in input image. In the proposed method, domain pool is selected based on correlation analysis of input image and the isometry transform for each block is chosen based on the IFS method. To investigate the performance of the proposed method, we compared image quality and encoding time with full search PIFS method and jacquin's PIFS method. Experimental results show that proposed method yields nearly the same performance in PSNR, and its encoding time is reduced for images size of 512*512 compared with full search PIFS method and jacquin's PIFS method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.135-135
• /
• 2001

In recent years there have been increasing interests in real-time object tracking with image information. Since image information is affected by illumination, this paper presents the real-time object tracking method based on neural networks that have robust characteristics under various illuminations. This paper proposes three steps to track the object and the fast tracking method. In the first step the object color is extracted using neural networks. In the second step we detect the object feature information based on invariant moment. Finally the object is tracked through a shape recognition using neural networks. To achieve the fast tracking performance, we have a global search for entire image and then have tracking the object through local search when the object is recognized.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.75-78
• /
• 1997

In this paper we present new sound spectral analysis methods or prosthetic heart valve sounds. Phonocardiograms(PCG) of prosthetic heart valve were analyzed in order to derive frequency domain feature suitable or the classification of the valve state. The fast orthogonal search method and MUSIC (MUltiple SIgnal Classification) method are described or finding the significant frequencies in PCG. The fast orthogonal search method is effective with short data records and cope with noisy, missing and unequally-spaced data. MUSIC method's key to the performance is the division of the information in the autocorrelation matrix or the data matrix into two vector subspaces, one a signal subspace and the other a noise subspace.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.411-412
• /
• 2006

In this paper, we proposed a fast algorithm for inter prediction included the most complexity in H.264/AVC. It decide search range according to direction of predicted motion vector, and then perform adaptive candidate spiral search. Simultaneously, it perform motion estimation of variable loop with threshold for variable block size. Conclusively, it is implemented in JM FME with high complexity applying to rate-distortion optimization. Experimental results show that significant complexity reduction is achieved while the degradation in video quality is negligible.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.306-312
• /
• 2000

In this paper, the efficient architecture of small Reed-solomon architecture is suggested. Here, 3-stage pipeline is adopted. In decoding, error-location polynomials are obtained by BMA using fast iteration method, and syndrome polynomials, where calculation complexity is required, are obtained by parallel calculation using ROM table, and the roots of error location polynomial are calculated by ROM table using Chein search algorithm. In the suggested decoder, it is confirmed that 3 symbol random errors can be corrected and 124Mbps decoding rate is obtained using 25 Mhz system clock.