Abstract: A method for decoding a block of a picture includes decoding, from a data stream, an intra-coding mode for the block, deriving a predictor for a prediction partition of the block using at least one already reconstructed samples neighboring the prediction partition and the intra-coding mode, deriving a prediction residual for each of the at least two transform partitions included in the prediction partition, and combining the predictor of the prediction partition and the prediction residual for each of the at least two transform partitions included in the prediction partition to reconstruct the prediction partition. The block is partitioned into multiple transform partitions based on a partition dimension flag, and the prediction partition includes at least two transform partitions of the multiple transform partitions.

Abstract: A video decoder for decoding an encoded video signal including encoded picture data and indication data of a picture of a video to reconstruct the picture of the video is provided. The video decoder includes an interface configured for receiving the encoded video signal, and a data decoder configured for reconstructing the picture of the video by decoding the encoded picture data using the indication data. The picture is partitioned into a plurality of coding areas. One or more coding areas of the plurality of coding areas include two or more coding tree units of the plurality of coding tree units, wherein each coding area of the one or more coding areas which includes two or more coding tree units exhibits a coding order for the two or more coding tree units of the coding area.

Abstract: The present invention concerns an apparatus configured to partition a picture into leaf blocks using recursive multi-tree partitioning, block-based encode the picture into a data stream using the partitioning of the picture into the leaf blocks, wherein the apparatus is configured to, in partitioning the picture into the leaf blocks, for a predetermined block which extends beyond a boundary of the picture, reduce an available set of split modes depending on a position at which the boundary of the picture crosses the predetermined block in order to obtain a reduced set of one or more split modes, wherein the apparatus is configured to signal a selected split mode in the data stream.

Abstract: A video encoder is disclosed that is configured to encode a slice of a current picture into a data stream by partitioning the slice into rows of Coding Tree Units (CTUs), select a CTU dependency offset for the slice out of a plurality of CTU dependency offsets, the CTU dependency offset indicating a minimum CTU offset between consecutive CTU rows to be obeyed by a decoder when decoding CTU rows in parallel, and signal the CTU dependency offset in the data stream. The CTU dependency offset is selected based on a slice type of the slice.

Abstract: Different concepts for improving video coding efficiency are described, many of them allow for video coding in a manner realizing tile-independent coding with reducing, however, the coding efficiency losses otherwise associated with the tile-dependency disruptions, with nevertheless merely marginally, if all, modifying the codec behavior alongside the tile boundaries

Abstract: A method for decoding a block of a picture includes decoding, from a data stream, an intra-coding mode for the block, deriving a predictor for a prediction partition of the block using at least one already reconstructed samples neighboring the prediction partition and the intra-coding mode, deriving a prediction residual for each of the at least two transform partitions included in the prediction partition, and combining the predictor of the prediction partition and the prediction residual for each of the at least two transform partitions included in the prediction partition to reconstruct the prediction partition. The block is partitioned into multiple transform partitions based on a partition dimension flag, and the prediction partition includes at least two transform partitions of the multiple transform partitions.

Abstract: Decoder for decoding a picture, wherein blocks into which the picture is subdivided are assigned to a set of prediction types, which include intra prediction and inter prediction. For each of predetermined intra-predicted blocks, the decoder is configured to derive, from the data stream, an information on a partitioning of the respective predetermined intra-predicted block into partitions. The decoder is configured to derive, from the data stream, for each partition of the respective predetermined intra-predicted block, a partition-specific prediction residual signal related to a spatial domain prediction residual signal of the respective partition of the respective predetermined intra-predicted block via a predetermined transform. The predetermined transform can be identified out of a set of transforms including a first transform and a second transform, which equals a concatenation of a primary transform and a secondary transform applied onto a subset of coefficients of the primary transform.

Abstract: A decoder includes an entropy decoder configured to derive a number of bins of the binarizations from the data stream using binary entropy decoding by selecting a context among different contexts and updating probability states associated with the different contexts, dependent on previously decoded portions of the data stream; a desymbolizer configured to debinarize the binarizations of the syntax elements to obtain integer values of the syntax elements; a reconstructor configured to reconstruct the video based on the integer values of the syntax elements using a quantization parameter, wherein the entropy decoder is configured to distinguish between 126 probability states and to initialize the probability states associated with the different contexts according to a linear equation of the quantization parameter, wherein the entropy decoder is configured to, for each of the different contexts, derive a slope and an offset of the linear equation from first and second four bit parts of a respective 8 bit initial

Abstract: Various concepts which further improve multi-view/layer coding concepts, are described.

Abstract: The handling of scalable data streams by network entities is rendered less complex by, in the data stream, accompanying packets which actually carry data by packets of a different packet type which have a scalability axes descriptor defining the number of scalability axes and a semantic meaning thereof. In another aspect, the handling of scalable data streams by network entities is rendered more efficient by conveying level and/or profile descriptors using packets other than the data carrying packets, with profile and/or level descriptors being divided up into a first set explicitly signaling the definition of the available coding option set and/or available syntax element value range for a respective operation point, and a second set of profile and/or level descriptors which signal the definition of the available coding option set and/or available syntax element value range for their respective operation points by reference another profile and/or level descriptor.

Abstract: Decoder for decoding a picture, wherein blocks into which the picture is subdivided are assigned to a set of prediction types, which include intra prediction and inter prediction. For each of predetermined intra-predicted blocks, the decoder is configured to derive, from the data stream, an information on a partitioning of the respective predetermined intra-predicted block into partitions. The decoder is configured to derive, from the data stream, for each partition of the respective predetermined intra-predicted block, a partition-specific prediction residual signal related to a spatial domain prediction residual signal of the respective partition of the respective predetermined intra-predicted block via a predetermined transform. The predetermined transform can be identified out of a set of transforms including a first transform and a second transform, which equals a concatenation of a primary transform and a secondary transform applied onto a subset of coefficients of the primary transform.

Abstract: Different concepts for improving video coding efficiency are described, many of them allow for video coding in a manner realizing tile-independent coding with reducing, however, the coding efficiency losses otherwise associated with the tile-dependency disruptions, with nevertheless merely marginally, if all, modifying the codec behavior alongside the tile boundaries.

Abstract: The handling of scalable data streams by network entities is rendered less complex by, in the data stream, accompanying packets which actually carry data by packets of a different packet type which have a scalability axes descriptor defining the number of scalability axes and a semantic meaning thereof. In another aspect, the handling of scalable data streams by network entities is rendered more efficient by conveying level and/or profile descriptors using packets other than the data carrying packets, with profile and/or level descriptors being divided up into a first set explicitly signaling the definition of the available coding option set and/or available syntax element value range for a respective operation point, and a second set of profile and/or level descriptors which signal the definition of the available coding option set and/or available syntax element value range for their respective operation points by reference another profile and/or level descriptor.

Abstract: Decoder retrieval timing information, ROI information and tile identification information are conveyed within a video data stream at a level which allows for an easy access by network entities such as MANEs or decoder. In order to reach such a level, information of such types are conveyed within a video data stream by way of packets interspersed into packets of access units of a video data stream. In accordance with an embodiment, the interspersed packets are of a removable packet type, i.e. the removal of these interspersed packets maintains the decoder's ability to completely recover the video content conveyed via the video data stream.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: A decoder for decoding a data stream into which media data is coded has a mode switch configured to activate a low-complexity mode or a high-efficiency mode depending on the data stream, an entropy decoding engine configured to retrieve each symbol of a sequence of symbols by entropy decoding using a selected one of a plurality of entropy decoding schemes, a desymbolizer configured to desymbolize the sequence of symbols to obtain a sequence of syntax elements, a reconstructor configured to reconstruct the media data based on the sequence of syntax elements, selection depending on the activated low-complexity mode or the high-efficiency mode.

Abstract: The entropy coding of a current part of a predetermined entropy slice is based on, not only, the respective probability estimations of the predetermined entropy slice as adapted using the previously coded part of the predetermined entropy slice, but also probability estimations as used in the entropy coding of a spatially neighboring, in entropy slice order preceding entropy slice at a neighboring part thereof. Thereby, the probability estimations used in entropy coding are adapted to the actual symbol statistics more closely, thereby lowering the coding efficiency decrease normally caused by lower-delay concepts. Temporal interrelationships are exploited additionally or alternatively.

Abstract: Sub-picture extraction is rendered less complex by providing each slice with start position information which indicates a starting position from which onwards the picture is, along a coding path, encoded into the respective slice, relative to an onset position at which the coding path starts traversing a segment the starting position is located in. Alternatively or additionally, sub-picture extraction processes are treated like choosing one layer out of a multi-layer datastream.

Abstract: Scalable coding concepts are described. One aspect improves parallel decoding of inter-dependent layers of a multi-layer video data stream by introducing a long-term syntax element structure for guaranteeing that during a predetermined time period the pictures of the dependent layer are subdivided so that borders of the spatial segments of the pictures of the second layer and the spatial segments of the first layer overlay. Another aspect concerns upsampling from base layer to enhancement layer. Another aspect introduces a long-term syntax element structure allowing the decoder to determine the inter-layer offset for a predetermined time period. Another aspect introduces a type indicator field changing a way a layer indicator field within the NAL unit headers is to be interpreted. Another aspect allows different codecs/standards to be used for the different layers. Another aspect concerns a syntax element structure which indicates the inter-layer offset in units of the base layer blocks.

Abstract: The entropy coding of a current part of a predetermined entropy slice is based on, not only, the respective probability estimations of the predetermined entropy slice as adapted using the previously coded part of the predetermined entropy slice, but also probability estimations as used in the entropy coding of a spatially neighboring, in entropy slice order preceding entropy slice at a neighboring part thereof. Thereby, the probability estimations used in entropy coding are adapted to the actual symbol statistics more closely, thereby lowering the coding efficiency decrease normally caused by lower-delay concepts. Temporal interrelationships are exploited additionally or alternatively.