• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.1
• /
• pp.1-12
• /
• 2019

This paper proposes a new motion vector smoothing and motion compensation method to increase the frame rate of videos. The proposed method reduces false motion vector smoothing by improving the weight with reflecting accuracy to overcome the limitation of the conventional motion vector smoothing using the adaptively weighted vector median. Also, to improve the interpolated image quality of the conventional OBMC(Overlapped Block Motion Compensation), a scheme that divides an original block into 4 sub-blocks and then generates the interpolated frame using the reestimated motion vector for each sub-block is proposed. The simulation results prove that the proposed method can provide much better objective and subjective image quality than the conventional method.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.2007-2012
• /
• 2011

To reduce huge computation in the block matching, this paper proposes a fast block matching algorithm which limits search points in the search area. On the basis of two facts that most motion vectors are located in central part of search area and matching error is monotonic decreasing toward the best similar block, the proposed algorithm moves a matching pattern between steps by the one pixel, predicts the motion direction for the best similar block from similar blocks decided in previous steps, and limits movements of search points to ${\pm}45^{\circ}C$ on it. As a result, it could remove the needless search points and reduce the block matching computation. In comparison with the conventional similar algorithms, the proposed algorithm caused the trivial image degradation in images with fast motion but kept the equivalent image quality in images with normal motion, and it, meanwhile, reduced from about 20% to over 67% of the their block matching computation.

• Journal of Korea Multimedia Society
• /
• v.21 no.9
• /
• pp.1052-1061
• /
• 2018

In this paper, we propose a new algorithm that is robust against the effects of objects that are relatively unaffected by camera motion and can accurately detect camera motion even in high resolution images. First, for more accurate camera motion detection, a global motion filter based on entropy of a motion vector is used to distinguish the background and the object. A block matching algorithm is used to find exact motion vectors. In addition, a matched filter with the angle of the ideal motion vector of each block is used. Motion vectors including 4 kinds of diagonal direction, zoom in, and zoom out are added additionally. The experiment shows that the precision, recall, and accuracy of camera motion detection compared to the recent results is improved by 12.5%, 8.6% and 9.5%, respectively.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.275-280
• /
• 2004

In this paper, a very fast block matching scheme was proposed to reduce the computations of Block Sum Pyramid Algorithm for motion estimation in video coding. The proposed algorithm is based on Block Sum Pyramid Algorithm and Efficient Multi-level Successive Elimination Algorithm. The proposed algorithm can reduce the computations of motion estimation greatly with 100% motion estimation accuracy. The efficiency of the proposed algorithm was verified by experimental results.

• Journal of Korea Multimedia Society
• /
• v.21 no.8
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.927-928
• /
• 2008

In this paper, a interpolation error concealment algorithm of motion compensated interpolated frame for motion compensated frame rate conversion to reduce the block artifacts caused by failure of conventional motion estimation based on block matching algorithm is proposed. Experimental results show good performance of the proposed scheme with significant reduction of the block artifacts.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.81-85
• /
• 1991

In this paper, we present a motion compensated video compression method based on both block and object motions. A simplified objectoriented motion parameter is estimated from the block based motion vectors. A decision rule for the global or local MCP modes is established. Simulation results show that the proposed method has lower bit-rates than the BMA based method at the same reconstruction errors.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.259-260
• /
• 2007

In this paper, a frame rate up-conversion algorithm using the motion vector frequency of neighboring blocks to reduce the block artifacts caused by failure of conventional motion estimation based on block matching algorithm is proposed. Experimental results show good performance of the proposed scheme with significant reduction of the erroneous motion vectors and block artifacts.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.