| CPC H04N 19/96 (2014.11) [H04N 19/17 (2014.11); H04N 19/176 (2014.11); H04N 19/1883 (2014.11); H04N 19/46 (2014.11); H04N 19/52 (2014.11); H04N 19/53 (2014.11); H04N 19/59 (2014.11); H04N 19/593 (2014.11); H04N 19/61 (2014.11)] | 30 Claims |

|
1. A decoder for decoding a coded signaling of a multi-tree structure, the coded signaling comprising an indication of a highest hierarchy level and a sequence of flags associated with nodes of the multi-tree structure unequal to the highest hierarchy level, each flag specifying whether the associated node is an intermediate node or child node, the decoder being configured to:
decode the indication of the highest hierarchy level from a data stream; and
sequentially decode, in a depth-first or breadth-first traversal order, the sequence of flags from the data stream with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes,
wherein:
the multi-tree structure prescribes a spatial multi-tree subdivision of a tree root block of a picture,
the tree root block is rectangular,
the decoder is configured to sequentially entropy-decode the flags using probability estimation contexts,
the probability estimation contexts are the same for flags associated with nodes of the multi-tree structure lying within the same hierarchy level of the multi-tree structure, but different for nodes of the multi-tree structure lying within different hierarchy levels of the multi-tree structure.
|