• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.2
• /
• pp.10-12
• /
• 2014

This work is based on the motion estimation to handle the ill-posed nature. The algorithm used in this study that performs the motion estimation for overlapped block is used to calculate with using pixel of neighborhood block with higher correlation and present block by considering the correlation level of neighborhood block. The proposed method shows in a significant improvement in the quality of the mothion field when comparing the conventional methods.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.39-42
• /
• 2000

Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

• Journal of Broadcast Engineering
• /
• v.18 no.3
• /
• pp.342-348
• /
• 2013

In this paper, a novel frame rate up conversion (FRUC) algorithm using adaptive extended bilateral motion estimation (AEBME) is proposed. Conventionally, extended bilateral motion estimation (EBME) conducts dual motion estimation (ME) processes on the same region, therefore involves high complexity. However, in this proposed scheme, a novel block type matching procedure is suggested to accelerate the ME procedure. We calculate the edge information using sobel mask, and the calculated edge information is used in block type matching procedure. Based on the block type matching, decision will be made whether to use EBME. Motion vector smoothing (MVS) is adopted to detect outliers and correct outliers in the motion vector field. Finally, overlapped block motion compensation (OBMC) and motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which OBMC is employed adaptively based on frame motion activity. Experimental results show that this proposed algorithm has outstanding performance and fast computation comparing with EBME.

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.54-63
• /
• 2004

A new motion compensated frame Interpolation (MCI) algorithm by block based motion estimation (BME) is proposed. The block for the BME is composed of a large overlapped block for practical object motion estimation (ME) and a small block (which has a coinciding center with the ME-block) for the more precise motion compensated image description. Pixels in the block for the ME are sub-sampled to reduce computational complexity. The proposed method is executed with the various ME-blocks which have different size and sub-sampling ratio, and compared to the conventional method.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.915-922
• /
• 2014

We propose an adaptive zoom motion estimation method where a picture is divided into two areas based on the distance information with a depth camera : the one is object area and the other is background area. In the proposed method, the zoom motion is only applied to the object area except the background area. Further, the block size of motion estimation for the object area is set to smaller than that of background area. This adaptive zoom motion estimation method can be reduced at the complexity of motion estimation and can be improved at the motion estimation performance by reducing the block size of the object area in comparison with the conventional zoom motion estimation method. Based on the simulation results, the proposed method is compared with the conventional methods in terms of motion estimation accuracy and computational complexity.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.11-16
• /
• 2003

In this paper, a Fast Block Sum Pyramid Algorithm (FBSPA) is presented for motion estimation in video coding. PBSPA is based on Block Sum Pyramid Algorithm(BSPA), Efficient Multilevel Successive Elimination Algorithms for Block Matching Motion Estimation, and Fast Algorithms for the Estimation of Motion Vectors. FBSPA reduces the computations for motion estimation of BSPA 29％ maximally using partial distortion elimination(PDE) scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.20-23
• /
• 1996

The block matching algorithm for the motion estimation is relatively simple to implement, and thus widely applied in image sequence coding such as H.261, MPEG- I and MPEG-2. Most techniques of the block matching method use fixed-size blocks for the motion estimation. And their success relies on the assumption that the motion within each block is uniform. But if the block size is increased to reduce the number of motion vectors for high data compression, the estimated image brings about many errors. In this paper, the variable-sized blocks are used to solve this problem. And the top down method is used to select the block size.

• Journal of Korea Multimedia Society
• /
• v.20 no.11
• /
• pp.1711-1719
• /
• 2017

In this paper, we propose a method of the zoom motion estimation for the depth video coding. The proposed method calculates the zoom ratio using the average of the depth values in the current block and in the reference block. It resizes the reference block by the zoom ratio and interpolates the reference block to size of the current block. It compares the current block with the reference block that is obtained by subtracting the average of pixels from the current block to the reference block in order to find the reference block that is the best closest one to the current block. The results of the simulation for the proposed method show that the motion estimation errors are significantly reduced.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.104-115
• /
• 1993

The motion compensated coding (MCC) technique, which exploits the temporal redundancies in the moving images with the motion estimation technique,is one of the most popular techniques currently used. Recently, a variable block size(VBS) motion estimation scheme has been utilized to improve the performance of the motion compensted coding. This scheme allows large blocks to the used when smaller blocks provide little gain, saving rates for areas containing more complex motion. Hence, a new VBS motion estimation scheme with a hierarchical structure is proposed in this paper, in order to combine the motion vector coding technique efficiently. Topmost level motion vector, which is obtained by the gain/cost motion estimation technique with selective motion prediction method, is always transmitted. Thus, the hierarchical VBS motion estimation scheme can efficiently exploit the redundancies among neighboring motion vectors, providing an efficient motion vector encoding scheme. Also, a restricted search with respect to the topmost level motion vector enables more flexible and efficient motion estimation for the remaining lower level blocks. Computer simulations on the high resolution image sequence show that, the VBS motion estimation scheme provides a performance improvement of 0.6~0.7 dB, in terms of PSNR, compared to the fixed block size motion estimation scheme.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.257-264
• /
• 2015

In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.