QUALITY SCALABLE CODING WITH MAPPING DIFFERENT RANGES OF BIT DEPTHS

    公开(公告)号:US20190082174A1

    公开(公告)日:2019-03-14

    申请号:US16190409

    申请日:2018-11-14

    Abstract: A more efficient way of addressing different bit-depths, or different bit-depths and chroma sampling format requirements is achieved by using a low bit-depth and/or low-chroma resolution representation for providing a respective base layer data stream representing this low bit-depth and/or low-chroma resolution representation as well as for providing a higher bit-depth and/or higher chroma resolution representation so that a respective prediction residual may be encoded in order to obtain a higher bit-depth and/or higher chroma resolution representation. By this measure, an encoder is enabled to store a base-quality representation of a picture or a video sequence, which can be decoded by any legacy decoder or video decoder, together with an enhancement signal for higher bit-depth and/or reduced chroma sub-sampling, which may be ignored by legacy decoders or video decoders.

    ENTROPY ENCODING AND DECODING SCHEME
    69.
    发明申请

    公开(公告)号:US20180034472A1

    公开(公告)日:2018-02-01

    申请号:US15717427

    申请日:2017-09-27

    CPC classification number: H03M7/00 H03M7/40 H03M7/4006 H03M7/46

    Abstract: Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols si with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols si yields z, and, if n>1, for all i=1 . . . n−1, the value of si corresponds to a range of the ith partition.

Patent Agency Ranking