Skip to Main content Skip to Navigation
Reports

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

Thomas Guionnet 1 Laurent Guillo 1 Christine Guillemot 1
1 Sirocco - Analysis representation, compression and communication of visual data
Inria Rennes – Bretagne Atlantique , IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/hal-00755737
Contributor : Laurent Guillo <>
Submitted on : Thursday, November 22, 2012 - 11:16:22 AM
Last modification on : Friday, July 10, 2020 - 4:14:34 PM
Long-term archiving on: : Saturday, December 17, 2016 - 12:53:54 PM

Files

JCT2-A0133_r2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00755737, version 1

Citation

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⟩

Share

Metrics

Record views

512

Files downloads

256