CE5.h related: Reducing the coding cost of merge index by dynamic merge candidate list re-ordering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2012

CE5.h related: Reducing the coding cost of merge index by dynamic merge candidate list re-ordering

Abstract

HEVC implements a candidate vector list for merge and skip modes. When merge or skip modes are selected, a merge index is written in the bitstream. This index is first binarized using a unary code, then CABAC encoded. A CABAC context is dedicated to the first bin of the unary coded index while the remaining bins are considered as equiprobable. This strategy is efficient as long as the candidate list is constructed such as being ordered by decreasing index occurrence probability. In the context of 3D video encoding, an inter-view motion vector predictor is added at the first position of the candidate list. It is reported in this document that the inter-view motion vector predictor is not always the most probable candidate. It actually depends on the video sequence characteristics. Therefore, a dynamic candidate vector list ordering is proposed. Coding gains of 0.1 % on average are observed on side views and up to 0.6% is attained for the GTFly sequence view 2.
Fichier principal
Vignette du fichier
JCT2-A0133_r2.pdf (294.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00755737 , version 1 (22-11-2012)

Identifiers

  • HAL Id : hal-00755737 , version 1

Cite

Thomas Guionnet, Laurent Guillo, Christine Guillemot. CE5.h related: Reducing the coding cost of merge index by dynamic merge candidate list re-ordering. [Technical Report] 2012. ⟨hal-00755737⟩
286 View
127 Download

Share

Gmail Facebook X LinkedIn More