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)] | 4 Claims |
1. A decoder for decoding a coded signaling of a multi-tree structure, the multi-tree structure prescribing a spatial multi-tree subdivision of a tree root block according to which the tree root block is recursively multi-partitioned into leaf blocks, 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 and whether an area of the tree root block corresponding to the node with which the respective flag is associated, is multi-partitioned,
wherein the spatial multi-tree subdivision is a quadtree-subdivision, and in accordance with a depth-first traversal order, a zigzag scan is defined among nodes of a same hierarchy level of the quadtree subdivision having a common parent node, the decoder being configured to:
decode the indication of the highest hierarchy level from a data stream, and then sequentially entropy-decode, in the depth-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, and using probability estimation contexts which are the same for flags associated with nodes of the multi-tree structure lying within a 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.
|