• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.37-44
• /
• 2002

In this paper. we propose a new video coding scheme with multi-resolution motion compensation and residual quantization. The main functional blocks of the proposed scheme include multi-level wavelet decomposition. motion estimation and motion compensation. raster scanning within each subband. formation of block trees and blocking partitioning. and adaptive arithmetic coding. Although the proposed ceding scheme is simple and requires low computational complexity, it produces bitstreams tilth good features. such as the embedded structure and SNR scalability. Experimental results demonstrate that the proposed coding scheme is quote competitive to and often outperforms other wavelet-based video coding schemes in the literature.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.429-432
• /
• 2000

We propose a new frame rate up-conversion algorithm for high quality video. In the proposed scheme bidirectional motion estimation (ME) is performed to construct the motion vector. (MV) field for the frame to be interpolated. Unlike conventional motion-compensated interpolation (MCI) algorithms, the proposed technique does not produce any overlapped pixel and hole region in the interpolated frame, and thus can utilize the overlapped block motion compensation technique to reduce the blocking artifacts. The proposed algoritm is very simple to implement on consumer products when compared to conventional MCI methods. Computer simulation shows a high visual performance of the proposed frame rate up-conversion algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.418-428
• /
• 2002

In this paper, we propose a motion-adaptive de-interlacing method using motion compensated interpolation. In a conventional motion compensated method, a simple pre-filter such as line averaging is applied to interpolate missing lines before the motion estimation. However, this method causes interpolation error because of inaccurate motion estimation and compensation. In the proposed method, EBMF(Edge Based Median Filter) as a pre-filter is applied, and new matching method, which uses two same-parity fields and opposite-parity field as references, is proposed. For further improvement, motion correction filter is proposed to reduce the interpolation error caused by incorrect motion. Simulation results show that the proposed method provides better performance than existing methods.

• Journal of Biomedical Engineering Research
• /
• v.20 no.3
• /
• pp.265-274
• /
• 1999

In this paper, we propose a novel interframe coding algorithm especially appropriate for 3-D medical images. The proposed algorithm is based on a video coding algorithm using motion estimation/ compensation and transform coding. In the algorithm, warping is adopted lor motion compensation (MC). Then, by using adaptive mode selection, a motion compensated residual image and original image are mixed up in the wavelet transform domain for improvement in coding performance. The mixed image is then compressed by the zerotree coding method. We prove that the adaptive mode selection technique in the wavelet transform domain is very useful lor 3-D medical image coding. Simulation results show that the proposed scheme provides good performance regardless of inter-slice distance and is prospective for 3-D medical image compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.102-111
• /
• 2005

In this paper, we propose an advanced hardware architecture for the fast inter prediction engine of the video coding standard MPEG-4 AVC. We describe the algorithm and derive the hardware architecture emphasizing and real time operation of the quarter_pel based motion estimation. The fast inter prediction engine is composed of block segmentation, motion estimation, motion compensation, and the fast quarter_pel calculator. The proposed architecture has been verified by ARM-interfaced emulation board using Excalibur & Virtex2 FPGA, and also by synthesis on Samsung 0.18 um CMOS technology. The synthesis result shows that the proposed hardware can operate at 62.5MHz. In this case, it can process about 88 QCIF video frames per second. The hardware is being used as a core module when implementing a complete MPEG-4 AVC video encoder chip for real-time multimedia application.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.5
• /
• pp.239-248
• /
• 2011

In order to improve the quality of strain images in medical ultrasound imaging, displacements need to be accurately estimated. In this paper, in order to apply one-dimensional displacement estimation methods to two-dimensional motion estimation, the axial and lateral displacements are separately estimated. In order to estimate lateral displacements, one-dimensional signals aligned in the lateral direction are converted to analytic signals, which are then crosscorrelated. Strain images are produced by first compensating two-dimensional displacements for lateral motion with lateral motion displacement estimates obtained from the proposed lateral displacement estimation algorithm and then estimating axial displacements. Both phantom and human data experiments show that the proposed method provides better signal-to-noise ratio and contrast-to-noise ratio characteristics than a conventional strain imaging method that utilizes axial displacement estimates only.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.557-564
• /
• 2001

In general, several moving regions with different motions coexist in a block located on motion boundaries in the block-based motion estimation. In this case the motion compensation error(MCEs) are different with the moving regions. This is inclined to deteriorate the quality of motion compensated images because of the inaccurate motions estimated from the conventional mean absolute error(MAE) based matching function in which the matching error per pixel is accumulate throughout the block. In this paper, we divided a block into the regions according to their motions using the motion information of the spatio-temporally neighboring blocks and calculate the average MCF for each moving mentioned. From the simulation results, we showed the improved performance of the proposed method by comparing the results from other methods such as the full search method and the edge oriented block matching algorithm. Especially, we improved the quality of the motion compensated images of blocks on motion boundaries.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.1
• /
• pp.60-69
• /
• 1999

Motion compensation by affine transform has been proposed as a solution to the artifact problems in very low bit rate video coding and a HMA(Hexagoanl Matching Algorithm) has been proposed for refine motions estimation. When dividing images with an affine transform, as image objects do not necessarily conform to triangle patterns. In this paper we propose a method that first divides an image into triangular patches according to its edge information and then further divides the image into more detailed triangular patches where more complicated edge information occurs. We image propose a PMA(Polygona Matching Algorithm) for refine motion estimation because of the different triangle pattern types of neighboring blocks and its performance is compared with H.263.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.199-204
• /
• 2002

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have information about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.193-200
• /
• 2003

In this paper, we propose a motion estimation method using hierarchical triangulation that changes the triangular mesh structure according to it's motion activity. The subdivision of triangular mesh is performed from the amount of motion that is calculated from the variance of image difference. As a result, node distribution is concentrated on the region of high activity. The subdivision method that makes it possible to yield hierarchical triangular mesh is proposed as well as the additional information reduction coding method for hierarchical mesh structure is described. By the simulation, proposed method have better performance than the conventional BMA(Block Match Algorithm) and the other mesh based method.