Abstract: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.

Abstract: A coding efficiency increase is achieved by using a common signalization within the bitstream with regard to activation of merging and activation of the skip mode. One possible state of one or more syntax elements within the bitstream may signalize for a current sample set of a picture that the sample set is to be merged and has no prediction residual encoded and inserted into the bitstream. A common flag may signalize whether the coding parameters associated with a current sample set are to be set according to a merge candidate or to be retrieved from the bitstream, and whether the current sample set of the picture is to be reconstructed based on a prediction signal depending on the coding parameters associated with the current sample set, without any residual data, or to be reconstructed by refining the prediction signal depending on the coding parameters associated with the current sample set by means of residual data within the bitstream.

Abstract: In accordance with a first aspect, the intra prediction direction of a neighboring, intra-predicted block is used in order to predict the extension direction of the wedgelet separation line of a current block, thereby reducing the side information rate necessitated in order to convey the partitioning information. In accordance with a second aspect, the idea is that previously reconstructed samples, i.e. reconstructed values of blocks preceding the current block in accordance with the coding/decoding order allow for at least a prediction of a correct placement of a starting point of the wedgelet separation line, namely by placing the starting point of the wedgelet separation line at a position of a maximum change between consecutive ones of a sequence of reconstructed values of samples of a line of samples extending adjacent to the current block along a circumference thereof. Both aspects may be used individually or in combination.

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 coding efficiency of a multi-component picture or video coding concept is improved by reconstructing a third component signal relating to a third component of the multi-component video using inter-component prediction from both a reconstructed first component signal and a reconstructed second component signal.

Abstract: The way of predicting a current block by assigning constant partition values to the partitions of a bi-partitioning of a block is quite effective, especially in case of coding sample arrays such as depth/disparity maps where the content of these sample arrays is mostly composed of plateaus or simple connected regions of similar value separated from each other by steep edges. The transmission of such constant partition values would, however, still need a considerable amount of side information which should be avoided. This side information rate may be further reduced if mean values of values of neighboring samples associated or adjoining the respective partitions are used as predictors for the constant partition values.

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: Although wedgelet-based partitioning seems to represent a better tradeoff between side information rate on the one hand and achievable variety in partitioning possibilities on the other hand, compared to contour partitioning, the ability to alleviate the constraints of the partitioning to the extent that the partitions have to be wedgelet partitions, enables applying relatively uncomplex statistical analysis onto overlaid spatially sampled texture information in order to derive a good predictor for the bi-segmentation in a depth/disparity map. Thus, in accordance with a first aspect it is exactly the increase of the freedom which alleviates the signaling overhead provided that co-located texture information in form of a picture is present. Another aspect pertains the possibility to save side information rate involved with signaling a respective coding mode supporting irregular partitioning.

Abstract: Coding schemes for coding a spatially sampled information signal using sub-division and coding schemes for coding a sub-division or a multitree structure are described, wherein representative embodiments relate to picture and/or video coding applications.

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: Coding schemes for coding a spatially sampled information signal using sub-division and coding schemes for coding a sub-division or a multitree structure are described, wherein representative embodiments relate to picture and/or video coding applications.

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: An idea used herein is to use the same function for the dependency of the context and the dependency of the symbolization parameter on previously coded/decoded transform coefficients. Using the same function—with varying function parameter—may even be used with respect to different transform block sizes and/or frequency portions of the transform blocks in case of the transform coefficients being spatially arranged in transform blocks. A further variant of this idea is to use the same function for the dependency of a symbolization parameter on previously coded/decoded transform coefficients for different sizes of the current transform coefficient's transform block, different information component types of the current transform coefficient's transform block and/or different frequency portions the current transform coefficient is located within the transform block.

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: A favorable merging or grouping of simply connected regions into which the array of information samples is sub-divided, is coded with a reduced amount of data. To this end, a predetermined relative locational relationship is defined enabling an identifying, for a predetermined simply connected region, of simply connected regions within the plurality of simply connected regions which have the predetermined relative locational relationship to the predetermined simply connected region. Namely, if the number is zero, a merge indicator for the predetermined simply connected region may be absent within the data stream. In other embodiments, spatial sub-division is performed depending on a first subset of syntax elements, followed by combining spatially neighboring simply connected regions depending on a second subset of syntax elements, to obtain an intermediate sub-division.

Abstract: A higher coding efficiency for coding a significance map indicating positions of significant transform coefficients within a transform coefficient block is achieved by the scan order by which the sequentially extracted syntax elements indicating, for associated positions within the transform coefficient block, as to whether at the respective position a significant or insignificant transform coefficient is situated, are sequentially associated to the positions of the transform coefficient block, among the positions of the transform coefficient block depends on the positions of the significant transform coefficients indicated by previously associated syntax elements. Alternatively, the first-type elements may be context-adaptively entropy decoded using contexts which are individually selected for each of the syntax elements dependent on a number of significant transform coefficients in a neighborhood of the respective syntax element, indicated as being significant by any of the preceding syntax elements.

Abstract: Coding quantization parameter variation or adaptation is made more effective by basing the determination of a coding quantization parameter for a predetermined block of the picture on a dispersion of a statistical sample value distribution of a high-pass filtered version of the predetermined block. The usage of the high-pass filtered version of the predetermined block as a basis for the determination of the dispersion instead of using, for instance, the un-filtered or original version of the predetermined block assists in a better adaptation of the resulting coding quantization parameter variation across the picture to the human visual system. Alternatively or additionally, coding quantization parameter variation or adaptation across a picture is made more efficient by a control of coding quantization parameter variation/adaptation across a picture in a manner dependent on a prediction of the actual dispersion.

Abstract: The coding efficiency of scalable video coding is increased by substituting missing spatial intra prediction parameter candidates in a spatial neighborhood of a current block of the enhancement layer by use of intra prediction parameters of a co-located block of the base layer signal. By this measure, the coding efficiency for coding the spatial intra prediction parameters is increased due to the improved prediction quality of the set of intra prediction parameters of the enhancement layer, or, more precisely stated, the increased likelihood, that appropriate predictors for the intra prediction parameters for an intra predicted block of the enhancement layer are available thereby increasing the likelihood that the signaling of the intra prediction parameter of the respective enhancement layer block may be performed, on average, with less bits.

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: Reconstructing a second component signal relating to a second component of a multi-component picture from a spatially corresponding portion of a reconstructed first component signal and a correction signal derived from a data stream for the second component promises increased coding efficiency over a broader range of multi-component picture content. By including the spatially corresponding portion of the reconstructed first component signal into the reconstruction of the second component signal, any remaining inter-component redundancies/correlations present such as still present despite a possibly a priori performed component space transformation, or present because of having been introduced by such a priori performed component space transformation, for example, may readily be removed by way of the inter-component redundancy/correlation reduction of the second component signal.