Byeongmoon Jeon

Motion Information Inferring Scheme for Multi-View Video Coding

This letter proposes a motion information inferring scheme for multi-view video coding motivated by the idea that the aspect of motion vector between the corresponding positions in the neighboring view pair is quite similar. The proposed method infers the motion information from the corresponding macroblock in the neighboring view after RD optimization with the existing prediction modes. This letter presents evaluation showing that the method significantly enhances the efficiency especially at high bit rates.

Efficient motion compensation using multiple warped reference pictures based on feature tracking and segmentation

In this paper we present an efficient motion compensation method using warped reference pictures reflecting dynamic local warping motions in the video sequences. To extract various local warping motions between two scenes, we integrate the Kanade-Lucas-Tomasi (KLT) feature tracking algorithm and feature segmentation scheme. After extracting warping motion parameters, we generate multiple warped reference pictures containing each warping motion, which are inserted to the original reference picture list as an additional reference pictures. Experimental results shows that bitrate reduction can be achieved up to 20% in some sequence having zooming motion and average 6% bitrate reduction is yielded through the whole test sequences.

Analysis of efficient coding tools for multi-view and 3D

In response to the rising interest in 3D applications, the joint video team (JVT) has finalized the standardization of multi-view video coding (MVC). MPEG has recently launched the exploration of 3D video (3DV) coding to handle multi-view video plus depth (MVD) format. During the MVC standardization process, two coding tools, motion skip (MS) and illumination compensation (IC), were proposed. The two coding tools showed good coding efficiency in MVC coding environment where all views are coded. However, in 3DV coding environment, a part of views are coded and the remaining views are generated by the view synthesis. In this situation, the correlation between views to be coded may be reduced because the distance between them is larger than that of MVC. In this paper, we employed the two coding tools for 3DV and analyzed their influences by showing the simulation results to see their impact on 3DV coding.

A Reduced Resolution Update method on transform domain for H.264/AVC

A Reduced Resolution Update (RRU) coding tool is first adopted in Annex Q of the H.263 standard [1]. This method is to perform down-sampling process of the prediction error signal and up-sampling process of the down-sampled error signal using spatial domain filters. In order to improve coding efficiency and to reduce computational complexity, we introduce a RRU coding tool on transform domain. The RRU coding tool on transform domain uses an integer 8x8 transform kernel in H.264 standard by zero-out in the encoder with quantization offset and zero-appending in the decoder. Our proposed RRU coding tool does not need additional computations for the up-sampling process in the decoder and has equal or better coding efficiency compared to the previous RRU using spatial domain filtering.

Picture-level parameteric motion representation for efficient motion compensation

When a picture contains non-translational motions in it, a picture-level parametric motion model can be more efficient than the block-based translational motion model because the former has small number of parameters that can replace many motion vectors of individual blocks. In addition, the former can represent the deformation of the image better than the latter. Based on this idea, we detected multiple homography transformations between a reference and a current picture. Then, we generated warped reference pictures1 corresponding to the homographies and inserted the one of the warped reference pictures into reference picture lists. We measured the performance of the proposed algorithm using the test condition that is proposed by MPEG and ITU recently. Experimental result showed 3.1% overall bitrate saving under low delay & high efficiency condition and 3.5% overall bitrate saving under random access & high efficiency condition compared with TMuC 0.7.3.