• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1487-1493
• /
• 2010

H.264 processes more detailed and more motion information for the compression efficiency. However, motion vector of H.264 takes more portion than previous standards such as MPEG-1/2/4 do, so that it is needed to consider motion vectors. This paper proposes the new algorithm with leaf mode in order to compress the motion vector efficiently. The proposed algorithm concentrates modes' distribution with leaf mode and carries out the compression of motion vector with less modes. The proposed algorithm adopted in current $4{\times}4$ motion vector matrix also can be extend to $8{\times}8$. The experiments shows that the proposed algorithm reduces up to 12.68% at header and 9.7% at resultant bitstream.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.238-247
• /
• 2002

In this paper, we propose an object-based stereo sequence compression technique using disparity-motion vector relationship. The proposed method uses the coherence of motion vectors and disparity vectors in the left and right Image sequences. After two motion vectors and one disparity vector ate computed using FBMA(Fixed Block Matching Algorithm), the disparity vector of the current stereoscopic pall is computed by disparity-motion vector relationship with vectors which are previously estimated. Moreover, a vector regularization technique is applied in order to obtain reliable vectors. For an object-based coding. the object is defined and coded in terms of layers of VOP such as in MPEG-4. we present a method using disparity and motion vector relationship for extending two-frame compensation into three-frame compensation method for prediction coding of B-VOP. The proposed algorithm shows a high performance when comparing with a conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.464-471
• /
• 2010

The demand for high quality of multimedia applications, which far surpasses the rapid evolution of transmission and storage technologies, makes better compression coding capabilities ever increasingly more important. In order to provide enhanced video coding performance, this paper proposes an efficient competition-based motion vector coding scheme. The proposed algorithm adaptively forms the motion vector predictors based on the contexts of scene characteristics such as camera motion and nearby motion vectors, providing more efficient candidate predictors than the previous competition-based motion vector coding schemes which resort to the fixed candidates optimized by extensive simulations. Up to 200% of compression gain was observed in the experimental results for the proposed scheme applied to the motion vector selection for skip mode processing.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.37-48
• /
• 2008

Generally, a motion vector and a disparity vector represent the motion information of an object in a single-view of camera and the displacement of the same scene between two cameras that located spatially different from each other, respectively. Conventional H.264/AVC does not use the disparity vector in the motion vector prediction because H.264/AVC has been developed for the single-view video. But, multi-view video coding that uses the inter-view prediction structure based on H.264/AVC can make use of the disparity vector instead of the motion vector when the current frame refers to the frame of different view. Therefore, in this paper, we propose an improved motion/disparity vector prediction method that consists of global disparity vector replacement and extended neighboring block prediction. From the experimental results of the proposed method compared with the conventional motion vector prediction of H.264/AVC, we achieved average 1.07% and 1.32% of BD (Bjontegaard delta)-bitrate saving for ${\pm}32$ and ${\pm}64$ of global vector search range, respectively, when the search range of the motion vector prediction is set to ${\pm}16$.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.880-887
• /
• 2015

In this paper, frame rate up conversion (FRUC) algorithm considering the direction and magnitude of identical motion vectors is proposed. extended bilateral motion estimation (EBME) has higher complexity than bilateral motion estimation (BME). By using average magnitude of motion vector with x and y direction respectively, dynamic frame and static frame are decided. We reduce complexity to decide EBME. also, After we compare the direction and magnitude of identical motion vectors, We reduce complexity to decide motion vector smoothing(MVS). Experimental results show that this proposed algorithm has fast computation and better peak singnal to noise ratio(PSNR) results compared with EBME.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

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

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.1029-1039
• /
• 2012

In this papar, we propose a new motion estimation and coding technique using adaptive motion vector resolution. Currently, HEVC encodes a video using 1/4 motion vector resolution. If there are high texture regions in a picture, HEVC can't get a performance enough. So, we insert additional 1-bit flag meaning whether motion vector resolution is 1/4 or 1/8 in PU syntax. Therefore, decoder can recognize the transmitted motion vector resolution. Experimental results show that maximum coding efficiency gain of the proposed method is up to 5.3% in luminance and 7.9% in chrominance. Average computional time complexity is increased about 33% in encoder and up to 5% in decoder.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.460-465
• /
• 2009

This paper presents a new algorithm that includes a mechanism to avoid local solutions in a motion vector detection method that uses the steepest descent method. Two different implementations of the algorithm are demonstrated using two major search methods for tree structures, depth first search and breadth first search. Furthermore, it is shown that by avoiding local solutions, both of these implementations are able to obtain smaller prediction errors compared to conventional motion vector detection methods using the steepest descent method, and are able to perform motion vector detection within an arbitrary upper limit on the number of computations. The effects that differences in the search order have on the effectiveness of avoiding local solutions are also presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2448-2463
• /
• 2013

The traditional block-based motion compensation methods in frame rate up-conversion (FRUC) only use a single uniquely motion vector field. However, there will always be some mistakes in the motion vector field whether the advanced motion estimation (ME) and motion vector analysis (MA) algorithms are performed or not. Once the motion vector field has many mistakes, the quality of the interpolated frame is severely affected. In order to solve the problem, this paper proposes a novel joint overlapped block motion compensation method (8J-OBMC) which adopts motion vectors of the interpolated block and its 8-neighbor blocks to jointly interpolate the target block. Since the smoothness of motion filed makes the motion vectors of 8-neighbor blocks around the interpolated block quite close to the true motion vector of the interpolated block, the proposed compensation algorithm has the better fault-tolerant capability than traditional ones. Besides, the annoying blocking artifacts can also be effectively suppressed by using overlapped blocks. Experimental results show that the proposed method is not only robust to motion vectors estimated wrongly, but also can to reduce blocking artifacts in comparison with existing popular compensation methods.