• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.148-155
• /
• 2006

For the improvement of coding efficiency, the H.264 standard uses new coding tools which are not used in previous coding standards. Among new coding tools, motion estimation using smaller block sizes leads to higher correlation between the motion vectors of neighboring blocks. This characteristic of H.264 is useful for the motion vector recovery. In this paper, we propose the motion vector recovery method based on optical flow. Since the proposed method estimates the optical flow velocity vector from more accurate initial value and optical flow region is limited to 16$\times$16 block size, we can alleviate the complexity of computation of optical flow velocity. Simulation results show that our proposed method gives higher objective and subjective video quality than previous methods.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.107-118
• /
• 2015

Although most current video coding standards set a fixed motion vector resolution like quarter-pel accuracy, a scheme supporting multiple motion vector resolutions can improve the coding efficiency of video since it can allow to use just required motion vector accuracy depending on the video content and at the same time to generate more accurate motion predictor. However, the selected motion vector resolution for each motion vector is a signaling overhead. This paper proposes a contradiction testing-based signaling scheme of the motion vector resolution. The proposed method selects a best resolution for each motion vector among multiple candidates in such a way to produce the minimum amount of coded bits for the motion vector. The signaling overhead is reduced by contradiction testing that operates under a predefined criterion at both encoder and decoder with a purpose of pruning irrelevant candidate motion vector resolutions from signaling responsibility. Experimental results verified that the proposed scheme is effective in reducing coded motion information by achieving its $Bj{\o}ntegaard$ delta bit rate (BDBR) gain of about 4.01% on average (and up to 15.17%) compared to the conventional scheme with a fixed motion vector resolution.

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

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.65-74
• /
• 2006

The MPEG-2 video compressed bitstream is very sensitive to transmission errors due to the complex coding structure of the MPEG-2 video coding standard. If one packet is lost or received with errors, not only the current frame will be corrupted, but also errors will propagate to succeeding frames within a group of pictures. Therefore, we employ various error resilient coding/decoding techniques to protect and reduce the transmission error effects. Error concealment technique is one of them. Error concealment technique exploits spatial and temporal redundancies of the correctly received video data to conceal the corrupted video data. Motion vector recovery and compensation with the estimated motion vector is good approach to conceal the corrupted data. In this paper, we propose various error concealment algorithms based on motion vector recovery, and compare their performance to those of conventional error concealment methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1036-1043
• /
• 2005

In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.269-275
• /
• 2005

In this paper, we propose a new efficient motion vector coding algorithm for the video sequence with slow motion. In the proposed algorithm, the amount of motion for a given video sequence is determined by a Skip_rate parameter. The motion difference for slow motion is encoded with a combined codeword which is generated from the conventional codewords. The simulation results show that the proposed algorithm achieves approximately $15\%$ bits gain compared to the conventional methods. Moreover, additional memory and calculations for statistical observation are not required in the proposed algorithm.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.305-312
• /
• 2020

As a demand for a new video coding standard having higher coding efficiency than the existing standards is growing, recently, MPEG and VCEG has been developing and standardizing the next-generation video coding project, named Versatile Video Coding (VVC). Many inter prediction techniques have been introduced to increase the coding efficiency, and among them, an adaptive motion vector resolution (AMVR) technique has contributed on increasing the efficiency of VVC. However, the best motion vector can only be determined by computing many rate-distortion costs, thereby increasing encoding complexity. It is necessary to reduce the complexity for real-time video broadcasting and streaming services, but it is yet an open research topic to reduce the complexity of AMVR. Therefore, in this paper, an efficient technique is proposed, which reduces the encoding complexity of AMVR. For that, the proposed method exploits a special VVC tree structure (i.e., multi-type tree structure) to accelerate the decision process of AMVR. Experiment results show that the proposed decision method reduces the encoding complexity of VVC test model by 10% with a negligible loss of coding efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2080-2089
• /
• 2015

In 3D video compression, a disparity vector (DV) pointing a corresponding block position in an adjacent view is a key coding tool to exploit statistical correlation in multi-view videos. In this paper, neighboring block-based disparity vector (NBDV) is shown with detail algorithm descriptions and coding performance analysis. The proposed method derives a DV from disparity motion vector information, obtained from spatially and temporally neighboring blocks, and provides a significant coding gain about 20% BD-rate saving in a texture-video-first-coding scheme. The proposed DV derivation method is adopted into the recent 3D video coding standards such as 3D-AVC and 3D-HEVC as the state-of-the-art DV derivation method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.56-65
• /
• 2009

Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

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