Patent ID: 9591335
Date: 2017-03-07
CPC Classifications: H04N

Claim:
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 a subset of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning the subset of 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 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 a subset of the smaller simply connected regions into even smaller simply connected regions by recursively multi-partitioning the subset 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, and 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 the subset of the tree root sub-regions into the even smaller simply connected regions, wherein the further sub-divider is configured to, in subdividing the subset 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 further maximum hierarchy level 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.