Back to Search Document details
15th Meeting: Gothenburg, SE, July 2019 2019-07-10 12:39
AHG15: Efficient encoding of chroma QP tables using piecewise linear representations
Authors: Frank Bossen Sharp Andrew Segall Sharp Adarsh Krishnan Ramasubramonian Qualcomm G. van der Auwera Qualcomm
Abstract
This contribution provides an analysis of the number of bits needed to encode various chroma QP mapping tables using the method provided in JVET-O0650. The set of tested mapping tables includes one that replicates the behaviour of CTC, but with an adjustment at low QP values such as to have equal luma and chroma QP values. Additionally, modifications to the encoding of syntax elements are proposed to reduce the number of bits typically needed to encode chroma QP mapping tables by about 20 to 40%.
Meeting Notes
JVET-O1166 AHG15: Efficient encoding of chroma QP tables using piecewise linear representations [F. Bossen, A. Segall (Sharp), A. K. Ramasubramonian, G. Van der Auwera (Qualcomm)] [late]

This was discussed Thursday 11 July at 1300 (GJS).

This is a further analysis responding to JVET-O1126. It is available for study.

Entropy coding (6)

Cited:
JVET-P0410 JVET-P0469
ARCHIVE :
JVET-O1166-v1.docx JVET-O1166-v2.docx JVET-O1166-v3.docx
Decisions
Entropy coding (6)
Citation