3D-CE5.h: Reducing the coding cost of merge index by dynamic merge index re-allocation
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.4 % on average are observed on side views and up to 1.0% is attained for the Ghost Town Fly sequence for both side views.
Domains
Multimedia [cs.MM]
Origin : Files produced by the author(s)