Coding of a spatial sampling of a two-dimensional information signal using sub-division

1. A decoder comprising:

an extractor configured to extract a maximum region size and multi-tree subdivision information from a data stream representing an encoded video sequence;

a sub-divider configured to spatially divide an array of information samples representing a spatially sampled portion of the video sequence into tree root regions of the maximum region size and subdividing, in accordance with a multi-tree subdivision information, at least some of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning said some tree root regions; and

a reconstructor configured to reconstruct the array of samples from the data stream using the subdivision into the smaller simply connected regions, wherein the reconstructor is configured to perform a prediction of the array of information samples at a granularity which depends on the subdivision into smaller simply connected regions and the extractor is configured to extract subordinate multi-tree subdivision information of a subordinate multi-tree-subdivision from the data stream, and

wherein the decoder further comprises a further subdivider configured to subdivide, in accordance with the subordinate multi-tree-subdivision information, at least some of the smaller simply connected regions into even smaller simply connected regions by recursively multi-partitioning said some of the smaller simply connected regions, wherein the reconstructor is configured to perform a retransformation from spectral to spatial domain in units of the even smaller simply connected regions,

wherein the extractor is configured to extract a further maximum region size from the data stream, and wherein the further sub-divider is configured to divide each smaller simply connected region exceeding the further maximum region size into tree root sub-regions of the further maximum region size and subdivide, in accordance with the subordinate multi-tree- subdivision information, at least some of the tree root sub-regions into the even smaller simply connected regions, wherein the further sub-divider is configured to, in subdividing said some of smaller simply connected regions, check, for each smaller simply connected region, as to whether the respective smaller simply connected region exceeds the further maximum region size, and, if the respective smaller simply connected region does exceed the further maximum region size, divide the respective smaller simply connected region into tree root sub-regions of the further maximum region size;

for each tree root sub-region, check the subordinate multi-tree-subdivision information as to whether the respective tree root sub-region is to be partitioned, and

if the respective tree root sub-region is to be partitioned, partition the respective tree root sub-region into sub-sub-regions, and

recursively repeat the check and partitioning for the sub-sub regions until no further partition is to be performed according to the subordinate multi-tree-subdivision information or a maximum hierarchy level of the subordinate multi-tree-subdivision is reached, and

wherein for smaller simply connected region not exceeding the further maximum region size, the division into tree root sub-regions is skipped.

2. The decoder according to claim 1 , wherein the sub-divider is configured to perform the division of the array of information samples into tree root regions such that the tree root regions are rectangular blocks of a size determined by the maximum region size, regularly arranged in order to gaplessly cover the array of information samples.

3. The decoder according to claim 1 , wherein the sub-divider is configured to,

check, for each tree root region, the multi-tree-subdivision information as to whether the respective tree root region is to be partitioned, and

if the respective tree root region is to be partitioned,

partition the respective tree root region into regions of a first hierarchy level according to a partition rule associated with the first hierarchy level, and

recursively repeat the check and partitioning for the regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using partition rules associated therewith,

with stopping the recursive repetition when no further partitioning is to be performed according to the multi-tree subdivision information, or a maximum hierarchy level of the primary multi-tree-subdivision is reached,

wherein regions of said at least some of tree root regions to be subdivided not further partitioned in accordance with the multi-tree-subdivision information, represent the smaller simply connected regions and the leaf regions of the multi-tree subdivision, respectively.

4. The decoder according to claim 3 , wherein the extractor is configured to extract also information about the maximum hierarchy level of the primary multi-tree-subdivision from the data stream.

5. The decoder according to claim 3 , wherein the sub-divider is configured to, in accordance with the partition rules associated with the first and higher-order hierarchy levels, perform a partition into sub-regions of equal size, the number of sub-regions thus obtained by one partitioning being common to all hierarchy levels.

6. The decoder according to claim 3 , wherein the extractor is configured to extract syntax elements associated with the leaf regions of said at least some of tree root regions to be subdivided, in a depth-first traversal processing order starting from first hierarchy level, from the data stream.

7. The decoder according to claim 3 , wherein the multi-tree subdivision information has a partition indication flag associated with each tree root region and region of the first and higher-order hierarchy levels not belonging to the regions of the maximum hierarchy level of the primary multi-tree-subdivision, respectively, the partition indication flags indicating as to whether the associated tree root region and region of the first and higher-order hierarchy level, respectively, is partitioned.

8. The decoder according to claim 7 , wherein the extractor is configured to context-adaptively decode each of the partition indication flags in a depth-first traversal processing order defined among the associated tree root regions and regions of the first and higher-order hierarchy levels, respectively, using contexts which are the same for partition indication flags relating to the same hierarchy level, but different for partition indication flags relating to different hierarchy levels.

9. The decoder according to claim 3 , wherein each leaf region has associated therewith coding parameters, the coding parameters being, for each leaf region, represented by a respective set of syntax elements, each syntax element being of a respective syntax element type out of a set of syntax element types, and wherein the extractor is configured to

extract, for each tree root region, an inheritance information from the data stream, the inheritance information indicating as to whether inheritance of the coding parameter information is used within the respective tree root region or not, and if inheritance is indicated to be used; an inheritance region among the regions of the respective tree root region, which, according to the subdivision information, are to be partitioned,

for the inheritance region of the tree root regions within which, according to the respective inheritance information inheritance is used,

extract an inheritance subset including at least one syntax element of a predetermined syntax element type from the data stream, and

copy the inheritance subset into, or use the inheritance subset as a prediction for, a corresponding inheritance subset of syntax elements within the set of syntax elements representing the coding parameters associated with the leaf regions lying spatially within the respective inheritance region.

10. The decoder according to claim 3 , wherein each leaf region has associated therewith coding parameters, the coding parameters being, for each leaf region, represented by a respective set of syntax elements, each syntax element being of a respective syntax element type out of a set of syntax element types, and wherein the extractor is configured to

extract and check, for regions of an inheritance set of at least one hierarchy level, which, according to the subdivision information, are to be partitioned, and using an hierarchy level order from lower hierarchy level to higher hierarchy level, an associated inheritance flag from the data stream, as to whether the respective inheritance flag prescribes inheritance or not;

for each region for which the associated inheritance flag prescribes inheritance,

extract an inheritance subset including at least one syntax element of a predetermined syntax element type from the data stream,

copy the inheritance subset into, or use the inheritance subset as a prediction for, a corresponding inheritance subset of syntax elements within the set of syntax elements representing the coding parameters associated with the leaf regions lying spatially within the respective region for which the associated inheritance flag prescribes inheritance; and

in checking the inheritance flags in the hierarchy level order from lower hierarchy level to higher hierarchy level, suppress extraction and check of further inheritance flags for the leaf regions lying spatially within the respective region for which the associated inheritance flag prescribes inheritance.

11. The decoder according to claim 1 , wherein the reconstructor is configured to perform one or more of the following measures at a granularity which depends on the subdivision into the smaller simply connected regions:

decision which prediction mode among, at least, intra and inter prediction mode to use;

transformation from spectral to spatial domain;

performing, and/or setting parameter for, an inter-prediction; and

performing, and/or setting parameter for, an intra prediction.

12. The decoder according to claim 1 , further comprising

a merger configured to combine, depending on a first subset of syntax elements of the data stream, disjoint from a second subset of syntax elements of the data stream forming the multi-tree subdivision information, spatially neighboring ones of the smaller simply connected regions to obtain an intermediate subdivision of the array of information samples, wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision.

13. The decoder according to claim 12 , wherein the array of information samples is a simply connected portion out of an overall array of information samples, the decoder comprising

a predictor configured to predict the array of information samples from the data stream, wherein the reconstructor is configured to perform a retransformation from spectral to spatial domain in units of the smaller simply connected regions to obtain a residual for the array of information samples, and to combine the residual and the prediction of the array of information samples to reconstruct the array of information samples.

14. A decoding method comprising:

extracting a maximum region size and multi-tree subdivision information of a primary multi-tree-subdivision from a data stream representing an encoded video sequence;

spatially dividing an array of information samples representing a spatially sampled portion of the video sequence into tree root regions of the maximum region size and subdividing, in accordance with a multi-tree subdivision information, at least some of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning said some of tree root regions; and

reconstructing the array of samples from the data stream using the subdivision into the smaller simply connected regions, wherein the reconstruction comprises predicting the array of information samples at a granularity which depends on the subdivision into smaller simply connected regions and the method further comprises extracting subordinate multi-tree subdivision information of a subordinate multi-tree-subdivision from the data stream, and wherein the method further comprises:

further subdividing, in accordance with the subordinate multi-tree-subdivision information, at least some of the smaller simply connected regions into even smaller simply connected regions by recursively multi-partitioning said some of the smaller simply connected regions, wherein the reconstruction comprises performing a retransformation from spectral to spatial domain in units of the even smaller simply connected regions, and

wherein the method further comprises extracting a further maximum region size from the data stream, and the further subdivision comprises dividing each smaller simply connected region exceeding the further maximum region size into tree root sub-regions of the further maximum region size and subdividing, in accordance with the subordinate multi-tree- subdivision information, at least said some of the tree root sub-regions into the even smaller simply connected regions, and

wherein the further subdividing of said some of smaller simply connected regions comprises checking, for each smaller simply connected region, as to whether the respective smaller simply connected region exceeds the further maximum region size, and, if the respective smaller simply connected region does exceed the further maximum region size, divide the respective smaller simply connected region into tree root sub-regions of the further maximum region size;

for each tree root sub-region, checking the subordinate multi-tree-subdivision information as to whether the respective tree root sub-region is to be partitioned, and

if the respective tree root sub-region is to be partitioned, partitioning the respective tree root sub-region into sub-sub-regions, and

recursively repeating the check and partitioning for the sub-sub regions until no further partition is to be performed according to the subordinate multi-tree-subdivision information or a maximum hierarchy level of the subordinate multi-tree-subdivision is reached, and

wherein for smaller simply connected region not exceeding the further maximum region size, the division into tree root sub-regions is skipped.

15. An encoder comprising:

a sub-divider configured to spatially divide an array of information samples representing a spatially sampled portion of a video sequence into tree root regions of a maximum region size and subdividing, in accordance with a multi-tree subdivision information of a primary multi-tree-subdivision, at least some of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning said some of tree root regions; and

a data stream generator configured to encode the array of samples using the subdivision into the smaller simply connected regions, into a data stream with inserting the maximum region size and multi-tree subdivision information into the data stream, wherein the data stream generator is configured to perform a prediction of the array of information samples at a granularity which depends on the subdivision into smaller simply connected regions and is configured to insert subordinate multi-tree subdivision information of a subordinate multi-tree-subdivision into the data stream, and

wherein the encoder further comprises a further subdivider configured to subdivide, in accordance with the subordinate multi- tree-subdivision information, at least some of the smaller simply connected regions into even smaller simply connected regions by recursively multi-partitioning said some of the smaller simply connected regions, wherein the data stream generator is configured to perform a transformation from spatial domain to spectral domain in units of the even smaller simply connected regions, wherein the data stream generator is configured to insert a further maximum region size into the data stream, and wherein the further sub-divider is configured to divide each smaller simply connected region exceeding the further maximum region size into tree root

sub-regions of the further maximum region size and subdivide, in accordance with the subordinate multi-tree-subdivision information, at least said some of the tree root sub-regions into the even smaller simply connected regions, and

wherein the further sub-divider is configured to, in subdividing said some of smaller simply connected regions, check, for each smaller simply connected region, as to whether the respective smaller simply connected region exceeds the further maximum region size, and, if the respective smaller simply connected region does exceed the further maximum region size, divide the respective smaller simply connected region into tree root sub-regions of the further maximum region size;

for each tree root sub-region, check the subordinate multi-tree-subdivision information as to whether the respective tree root sub-region is to be partitioned, and

if the respective tree root sub-region is to be partitioned, partition the respective tree root sub-region into sub-sub-regions, and

recursively repeat the check and partitioning for the sub-sub regions until no further partition is to be performed according to the subordinate multi-tree-subdivision information or a maximum hierarchy level of the subordinate multi-tree-subdivision is reached, and

wherein for smaller simply connected region not exceeding the further maximum region size, the division into tree root sub-regions is skipped.

16. A method for encoding comprising:

spatially dividing an array of information samples representing a spatially sampled portion of a video sequence into tree root regions of a maximum region size and subdividing, in accordance with a multi-tree subdivision information of a primary multi-tree-subdivision, at least some of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning said some of tree root regions; and

encoding the array of samples using the subdivision into the smaller simply connected regions, into a data stream with inserting the maximum region size and multi-tree subdivision information into the data stream, wherein the encoding comprises performing a prediction of the array of information samples at a granularity which depends on the subdivision into smaller simply connected regions with inserting subordinate multi-tree subdivision information of a subordinate multi-tree-subdivision into the data stream, and wherein the method further comprises further subdividing, in accordance with the subordinate multi-tree-subdivision information, at least some of the smaller simply connected regions into even smaller simply connected regions by recursively multi-partitioning said some of the smaller simply connected regions, wherein the encoding comprises performing a transformation from spatial domain to spectral domain in units of the even smaller simply connected regions, wherein the method further comprises inserting a further maximum region size into the data stream, and the further subdividing comprises dividing each smaller simply connected region exceeding the further maximum region size into tree root sub-regions of the further maximum region size and subdividing, in accordance with the subordinate multi-tree-subdivision

information, at least said some of the tree root sub-regions into the even smaller simply connected regions, wherein the further subdividing said some of smaller simply connected regions comprises checking, for each smaller simply connected region, as to whether the respective smaller simply connected region exceeds the further maximum region size, and, if the respective smaller simply connected region does exceed the further maximum region size, divide the respective smaller simply connected region into tree root sub-regions of the further maximum region size;

for each tree root sub-region, checking the subordinate multi-tree-subdivision information as to whether the respective tree root sub-region is to be partitioned, and

if the respective tree root sub-region is to be partitioned, partitioning the respective tree root sub-region into sub-sub-regions, and

recursively repeating the check and partitioning for the sub-sub regions until no further partition is to be performed according to the subordinate multi-tree-subdivision information or a maximum hierarchy level of the subordinate multi-tree-subdivision is reached, and

wherein for smaller simply connected region not exceeding the further maximum region size, the division into tree root sub-regions is skipped.

17. A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code for performing, when running on a computer, a method according to claim 14 .

18. A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code for performing, when running on a computer, a method according to claim 16 .