Patent Grant
11810019
The present invention relates to coding schemes for two-dimensionally sampled information signals such as videos or still pictures.
In image and video coding, the pictures or particular sets of sample arrays for the pictures are usually decomposed into blocks, which are associated with particular coding parameters. The pictures usually consist of multiple sample arrays. In addition, a picture may also be associated with additional auxiliary samples arrays, which may, for example, specify transparency information or depth maps. The sample arrays of a picture (including auxiliary sample arrays) can be grouped into one or more so-called plane groups, where each plane group consists of one or more sample arrays. The plane groups of a picture can be coded independently or, if the picture is associated with more than one plane group, with prediction from other plane groups of the same picture. Each plane group is usually decomposed into blocks. The blocks (or the corresponding blocks of sample arrays) are predicted by either inter-picture prediction or intra-picture prediction. The blocks can have different sizes and can be either quadratic or rectangular. The partitioning of a picture into blocks can be either fixed by the syntax, or it can be (at least partly) signaled inside the bitstream. Often syntax elements are transmitted that signal the subdivision for blocks of predefined sizes. Such syntax elements may specify whether and how a block is subdivided into smaller blocks and associated coding parameters, e.g. for the purpose of prediction. For all samples of a block (or the corresponding blocks of sample arrays) the decoding of the associated coding parameters is specified in a certain way. In the example, all samples in a block are predicted using the same set of prediction parameters, such as reference indices (identifying a reference picture in the set of already coded pictures), motion parameters (specifying a measure for the movement of a blocks between a reference picture and the current picture), parameters for specifying the interpolation filter, intra prediction modes, etc. The motion parameters can be represented by displacement vectors with a horizontal and vertical component or by higher order motion parameters such as affine motion parameters consisting of six components. It is also possible that more than one set of particular prediction parameters (such as reference indices and motion parameters) are associated with a single block. In that case, for each set of these particular prediction parameters, a single intermediate prediction signal for the block (or the corresponding blocks of sample arrays) is generated, and the final prediction signal is build by a combination including superimposing the intermediate prediction signals. The corresponding weighting parameters and potentially also a constant offset (which is added to the weighted start) can either be fixed for a picture, or a reference picture, or a set of reference pictures, or they can be included in the set of prediction parameters for the corresponding block. The difference between the original blocks (or the corresponding blocks of sample arrays) and their prediction signals, also referred to as the residual signal, is usually transformed and quantized. Often, a two-dimensional transform is applied to the residual signal (or the corresponding sample arrays for the residual block). For transform coding, the blocks (or the corresponding blocks of sample arrays), for which a particular set of prediction parameters has been used, can be further split before applying the transform. The transform blocks can be equal to or smaller than the blocks that are used for prediction. It is also possible that a transform block includes more than one of the blocks that are used for prediction. Different transform blocks can have different sizes and the transform blocks can represent quadratic or rectangular blocks. After transform, the resulting transform coefficients are quantized and so-called transform coefficient levels are obtained. The transform coefficient levels as well as the prediction parameters and, if present, the subdivision information is entropy coded.
In image and video coding standards, the possibilities for sub-dividing a picture (or a plane group) into blocks that are provided by the syntax are very limited. Usually, it can only be specified whether and (potentially how) a block of a predefined size can be sub-divided into smaller blocks. As an example, the largest block size in H.264 is 16×16. The 16×16 blocks are also referred to as macroblocks and each picture is partitioned into macroblocks in a first step. For each 16×16 macroblock, it can be signaled whether it is coded as 16×16 block, or as two 16×8 blocks, or as two 8×16 blocks, or as four 8×8 blocks. If a 16×16 block is sub-divided into four 8×8 block, each of these 8×8 blocks can be either coded as one 8×8 block, or as two 8×4 blocks, or as two 4×8 blocks, or as four 4×4 blocks. The small set of possibilities for specifying the partitioning into blocks in state-of-the-art image and video coding standards has the advantage that the side information rate for signaling the sub-division information can be kept small, but it has the disadvantage that the bit rate necessitated for transmitting the prediction parameters for the blocks can become significant as explained in the following. The side information rate for signaling the prediction information does usually represent a significant amount of the overall bit rate for a block. And the coding efficiency could be increased when this side information is reduced, which, for instance, could be achieved by using larger block sizes. Real images or pictures of a video sequence consist of arbitrarily shaped objects with specific properties. As an example, such objects or parts of the objects are characterized by a unique texture or a unique motion. And usually, the same set of prediction parameters can be applied for such an object or part of an object. But the object boundaries usually don't coincide with the possible block boundaries for large prediction blocks (e.g., 16×16 macroblocks in H.264). An encoder usually determines the sub-division (among the limited set of possibilities) that results in the minimum of a particular rate-distortion cost measure. For arbitrarily shaped objects this can result in a large number of small blocks. And since each of these small blocks is associated with a set of prediction parameters, which need to be transmitted, the side information rate can become a significant part of the overall bit rate. But since several of the small blocks still represent areas of the same object or part of an object, the prediction parameters for a number of the obtained blocks are the same or very similar.
That is, the sub-division or tiling of a picture into smaller portions or tiles or blocks substantially influences the coding efficiency and coding complexity. As outlined above, a sub-division of a picture into a higher number of smaller blocks enables a spatial finer setting of the coding parameters, wherein enabling a better adaptivity of these coding parameters to the picture/video material. On the other hand, setting the coding parameters at a finer granularity poses a higher burden onto the amount of side information necessitated in order to inform the decoder on the necessitated settings. Even further, it should be noted that any freedom for the encoder to (further) sub-divide the picture/video spatially into blocks tremendously increases the amount of possible coding parameter settings and thereby generally renders the search for the coding parameter setting leading to the best rate/distortion compromise even more difficult.
According to an embodiment, a decoder may have: an extractor configured to extract, for each of a plurality of simply connected regions into which an array of information samples representing a spatially sampled information signal is sub-divided, payload data from a data stream, and a reconstructor configured to reconstruct the array of information samples from the payload data for the simply connected regions of the array of information samples, by processing, for each simply connected region, the payload data for the respective simply connected region in a way prescribed by coding parameters associated with the respective simply connected region, wherein the extractor is further configured to identify, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, extract a merge indicator for the predetermined simply connected region from the data stream, if the merge indicator suggests a merged processing of the predetermined block, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is one, adopting the coding parameters of the simply connected region as the coding parameters for the predetermined simply connected region, or predicting the coding parameters for the predetermined simply connected region from the coding parameters of the simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region with extracting a prediction residual for the predetermined simply connected region from the data stream.
According to another embodiment, a decoder may have: an extractor configured to extract, for each of a plurality of simply connected regions into which an array of information samples representing a spatially sampled information signal is sub-divided, payload data from a data stream; and a reconstructor configured to reconstruct the array of information samples from the payload data for the simply connected regions of the array of information samples, by processing, for each simply connected region, the payload data for the respective simply connected region in a way prescribed by coding parameters associated with the respective simply connected region, wherein the extractor is further configured to extract a first subset of the coding parameters for the predetermined simply connected region from the data stream, identify, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, extract a merge indicator for the predetermined simply connected region from the data stream, if the merge indicator suggests a merged processing of the predetermined block, calculating, for each of the plurality of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region, a distance according to a predetermined distance measure, between the first subset of the coding parameters of the predetermined simply connected region and a corresponding subset of the coding parameters of the respective simply connected region having the predetermined relative locational relationship to the predetermined simply connected region, and adopting the corresponding subset of the coding parameters of the simply connected region having minimum distance as a second subset of the coding parameters for the predetermined simply connected region, disjoint from the first subset or predicting the second subset of the coding parameters for the predetermined simply connected region from the corresponding subset of the coding parameters of the simply connected region having minimum distance with extracting a prediction residual for the predetermined simply connected region from the data stream.
According to another embodiment, a decoder for decoding a data stream into which a two-dimensional information signal is coded may have: a sub-divider configured to spatially sub-divide, depending on a first subset of syntax elements contained in the data stream, an array of information samples representing a spatially sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning; a merger configured to combine, depending on a second subset of syntax elements within the data stream, being disjoined from the first subset, spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of information samples into disjoint sets of simply connected regions, the union of which is the plurality of simply connected regions; and a reconstructor configured to reconstruct the array of information samples from the data stream using the intermediate subdivision.
According to another embodiment, a decoding method may have the steps of: extracting, for each of a plurality of simply connected regions into which an array of information samples representing a spatially sampled information signal is sub-divided, payload data from a data stream; and reconstructing the array of information samples from the payload data for the simply connected regions of the array of information samples, by processing, for each simply connected region, the payload data for the respective simply connected region in a way prescribed by coding parameters associated with the respective simply connected region, wherein the extracting includes identifying, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, extracting a merge indicator for the predetermined simply connected region from the data stream, if the merge indicator suggests a merged processing of the predetermined block, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is one, adopting the coding parameters of the simply connected region as the coding parameters for the predetermined simply connected region, or predicting the coding parameters for the predetermined simply connected region from the coding parameters of the simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region with extracting a prediction residual for the predetermined simply connected region from the data stream.
According to another embodiment, a method for decoding a data stream into which a two-dimensional information signal is coded may have the steps of: spatially sub-dividing, depending on a first subset of syntax elements contained in the data stream, an array of information samples representing a spatially sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning; combining, depending on a second subset of syntax elements within the data stream, being disjoined from the first subset, spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of information samples into disjoint sets of simply connected regions, the union of which is the plurality of simply connected regions; and reconstruct the array of information samples from the data stream using the intermediate subdivision.
According to another embodiment, an encoder configured to encode an array of information samples representing a spatially sampled information signal into payload data for each of a plurality of simply connected regions into which the array of information samples is sub-divided, and coding parameters associated with the respective simply connected region so as to prescribe the way the payload data for the respective simply connected region is to be reconstructed from the payload data for the respective simply connected region, wherein the encoder is further configured to identify, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, insert merge indicator for the predetermined simply connected region into the data stream, if the merge indicator suggests a merged processing of the predetermined block, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is one, not inserting the coding parameters of the predetermined simply connected region into the data stream, or predicting the coding parameters for the predetermined simply connected region from the coding parameters of the simply connected region having the predetermined relative locational relationship to the predetermined simply connected region with inserting a prediction residual for the predetermined simply connected region into the data stream.
According to another embodiment, an encoder for generating a data stream into which a two-dimensional information signal is coded may have: a subdivision merge stage configured to determine a first subset of syntax elements defining a spatial sub-division of an array of information samples representing a spatially sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning, and second subset of syntax elements being disjoined from the first subset, defining a combination of spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of information samples into dis joint sets of simply connected regions, the union of which is the plurality of simply connected regions; and a data stream generator configured to code the array of information samples into a data stream using the intermediate subdivision with inserting the first and second subsets of syntax elements into the data stream.
Another embodiment may have an encoder configured to encode an array of information samples representing a spatially sampled information signal into payload data for each of a plurality of simply connected regions into which the array of information samples is sub-divided, and coding parameters associated with the respective simply connected region so as to prescribe the way the payload data for the respective simply connected region is to be reconstructed from the payload data for the respective simply connected region, wherein the encoder is further configured to insert a first subset of the coding parameters for a predetermined simply connected region into the data stream, identify, for the predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, insert a merge indicator for the predetermined simply connected region into the data stream, if the merge indicator suggests a merged processing of the predetermined block, calculating, for each of the plurality of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region, a distance according to a predetermined distance measure, between the first subset of the coding parameters of the predetermined simply connected region and the a corresponding subset of the coding parameters of the respective simply connected region having the predetermined relative locational relationship to the predetermined simply connected region, and not inserting a second subset of the coding parameters for the predetermined simply connected region, disjoint from the first subset, into the data stream or predicting the second subset of the coding parameters for the predetermined simply connected region from a corresponding subset of the coding parameters of the simply connected region having minimum distance with inserting a prediction residual for the predetermined simply connected region into the data stream.
According to another embodiment, a method for encoding an array of information samples representing a spatially sampled information signal into payload data for each of a plurality of simply connected regions into which the array of information samples is sub-divided, and coding parameters associated with the respective simply connected region so as to prescribe the way the payload data for the respective simply connected region is to be reconstructed from the payload data for the respective simply connected region, may have the steps of: identifying, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero, inserting merge indicator for the predetermined simply connected region into the data stream, if the merge indicator suggests a merged processing of the predetermined block, if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is one, not inserting the coding parameters of the predetermined simply connected region into the data stream, or predicting the coding parameters for the predetermined simply connected region from the coding parameters of the simply connected region having the predetermined relative locational relationship to the predetermined simply connected region with inserting a prediction residual for the predetermined simply connected region into the data stream.
According to another embodiment, a method for generating a data stream into which a two-dimensional information signal is coded may have the steps of: determining a first subset of syntax elements defining a spatial sub-division of an array of information samples representing a spatially sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning, and second subset of syntax elements being disjoined from the first subset, defining a combination of spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of information samples into disjoint sets of simply connected regions, the union of which is the plurality of simply connected regions; and coding the array of information samples into a data stream using the intermediate subdivision with inserting the first and second subsets of syntax elements into the data stream.
Another embodiment may have a computer readable digital storage medium having stored thereon a computer program having a program code for performing, when running on a computer, an inventive method.
According to another embodiment, a data stream having encoded therein an array of information samples representing a spatially sampled information signal, the data stream including payload data for each of a plurality of simply connected regions into which the array of information samples is sub-divided, and coding parameters associated with the respective simply connected region so as to prescribe the way the payload data for the respective simply connected region is to be reconstructed from the payload data for the respective simply connected region, may have: a merge indicator for predetermined simply connected regions for which the number of simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected regions, is greater than zero if the merge indicator for a respective predetermined simply connected region suggests a merged processing, and if the number of simply connected regions having the predetermined relative locational relationship to the respective predetermined simply connected region is one, an absence of the coding parameters of the respective predetermined simply connected region within the data stream, or a prediction residual for the respective predetermined simply connected region for reconstruction by predicting the coding parameters for the respective predetermined simply connected region from the coding parameters of the simply connected regions having the predetermined relative locational relationship to the respective predetermined simply connected region.
According to another embodiment, a data stream into which a two-dimensional information signal is coded may have: a first subset of syntax elements defining a spatial sub-division of an array of information samples representing a spatially sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning, and a second subset of syntax elements being disjoined from the first subset, defining a combination of spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of information samples into disjoint sets of simply connected regions, the union of which is the plurality of simply connected regions; and wherein the array of information samples is coded into the data stream depending on the intermediate subdivision.
In accordance with an embodiment, 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, for the simply connected regions, 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. Further, if the number of simply connected regions having the predetermined relative location relationship to the predetermined simply connected region is one, the coding parameters of the simply connected region may be adopted or may be used for a prediction for the coding parameters for the predetermined simply connected region without the need for any further syntax element. Otherwise, i.e., if the number of simply connected regions having the predetermined relative location relationship to the predetermined simply connected regions is greater than one, the introduction of a further syntax element may be suppressed even if the coding parameters associated with these identified simply connected regions are identical to each other.
In accordance with an embodiment, if the coding parameters of the neighboring simply connected regions are unequal to each other, a reference neighbor identifier may identify a proper subset of the number of simply connected regions having the predetermined relative location relationship to the predetermined simply connected region and this proper subset is used when adopting the coding parameters or predicting the coding parameters of the predetermined simply connected region.
In accordance with even further embodiments, a spatial sub-division of an area of samples representing a spatial sampling of the two-dimensional information signal into a plurality of simply connected regions of different sizes by recursively multi-partitioning is performed depending on a first subset of syntax elements contained in the data stream, followed by a combination of spatially neighboring simply connected regions depending on a second subset of syntax elements within the data stream being disjoined from the first subset, to obtain an intermediate sub-division of the array of samples into disjoint sets of simply connected regions, the union of which is the plurality of simply connected regions. The intermediate sub-division is used when reconstructing the array of samples from the data stream. This enables rendering the optimization with respect to the sub-division less critical due to the fact that a too line sub-division may be compensated by the merging afterwards. Further, the combination of the sub-division and the merging enables achieving intermediate sub-divisions which would not be possible by way of recursive multi-partitioning only so that the concatenation of the sub-division and the merging by use of disjoined sets of syntax elements enables a better adaptation of the effective or intermediate sub-division to the actual content of the two-dimensional information signal. Compared to the advantages, the additional overhead resulting from the additional subset of syntax elements for indicating the merging details, is negligible.
In accordance with an embodiment, the array of information samples representing the spatially sampled information signal is spatially into tree root regions first with then sub-dividing, in accordance with multi-tree-sub-division information extracted from a data-stream, at least a subset of the tree root regions into smaller simply connected regions of different sizes by recursively multi-partitioning the subset of the tree root regions. In order to enable finding a good compromise between a too fine sub-division and a too coarse sub-division in rate-distortion sense, at reasonable encoding complexity, the maximum region size of the tree root regions into which the array of information samples is spatially divided, is included within the data stream and extracted from the data stream at the decoding side. Accordingly, a decoder may comprise an extractor configured to extract a maximum region size and multi-tree-sub-division information from a data stream, a sub-divider configured to spatially divide an array of information samples representing a spatially sampled information signal into tree root regions of the maximum region size and sub-dividing, in accordance with the multi-tree-sub-division 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 information samples from the data stream using the sub-division into the smaller simply connected regions.
In accordance with an embodiment, the data stream also contains the maximum hierarchy level up to which the subset of tree root regions are subject to the recursive multi-partitioning. By this measure, the signaling of the multi-tree-sub-division information is made easier and needs less bits for coding.
Furthermore, the reconstructor may be configured to perform one or more of the following measures at a granularity which depends on the intermediate sub-division decision which prediction mode among, at least, intra and inter prediction mode to use; transformation from spectral to spatial domain, performing and/or setting parameters for, an inter-prediction; performing and/or setting the parameters for all intra prediction.
Furthermore, the extractor may be configured to extract syntax elements associated with the leaf regions of the partitioned treeblocks in a depth-first traversal order from the data stream. By this measure, the extractor is able to exploit the statistics of syntax elements of already coded neighboring leaf regions with a higher likelihood than using a breadth-first traversal order.
In accordance with another embodiment, a further sub-divider is used in order to sub-divide, in accordance with a further multi-tree sub-division information, at least a subset of the smaller simply connected regions into even smaller simply connected regions. The first-stage sub-division may be used by the reconstructor for performing the prediction of the area of information samples, while the second-stage sub-division may be used by the reconstructor to perform the retransformation from spectral to spatial domain. Defining the residual sub-division to be subordinate relative to the prediction sub-division renders the coding of the overall sub-division less bit consuming and on the other hand, the restriction and freedom for the residual sub-division resulting from the subordination has merely minor negative affects on coding efficiency since mostly, portions of pictures having similar motion compensation parameters are larger than portions having similar spectral properties.
In accordance with even a further embodiment, a further maximum region size is contained in the data stream, the further maximum region size defining the size of tree root sub-regions into which the smaller simply connected regions are firstly divided before sub-dividing at least a subset of the tree root sub-regions in accordance with the further multi-tree sub-division information into even smaller simply connected regions. This, in turn, enables an independent setting of the maximum region sizes of the prediction sub-division on the one hand and the residual sub-division on the other hand and, thus, enables finding a better rate/distortion compromise.
In accordance with an even further embodiment of the present invention, the data stream comprises a first subset of syntax elements disjoined from a second subset of syntax elements forming the multi-tree sub-division information, wherein a merger at the decoding side is able to combine, depending on the first subset of syntax elements, spatially neighboring smaller simply connected regions of the multi-tree sub-division to obtain an intermediate sub-division of the array of samples. The reconstructor may be configured to reconstruct the array of samples using the intermediate sub-division. By this measure, it is easier for the encoder to adapt the effective sub-division to the spatial distribution of properties of the array of information samples with finding an optimum rate/distortion compromise. For example, if the maximum region size is high, the multi-tree sub-division information is likely to get more complex due to the treeroot regions getting larger. On the other hand, however, if the maximum region size is small, it becomes more likely that neighboring treeroot regions pertain to information content with similar properties so that these treeroot regions could also have been processed together. The merging fills this gap between the afore-mentioned extremes, thereby enabling a nearly optimum sub-division of granularity. From the perspective of the encoder, the merging syntax elements allow for a more relaxed or computationally less complex encoding procedure since if the encoder erroneously uses a too fine sub-division, this error my be compensated by the encoder afterwards, by subsequently setting the merging syntax elements with or without adapting only a small part of the syntax elements having been set before selling the merging syntax elements.
In accordance with an even further embodiment, the maximum region size and the multi-tree-sub-division information is used for the residual sub-division rather than the prediction sub-division.
A depth-first traversal order for treating the simply connected regions of a quadtree sub-division of an array of information samples representing a spatially sampled information signal is used in accordance with an embodiment rather than a breadth-first traversal order. By using the depth-first traversal order, each simply connected region has a higher probability to have neighboring simply connected regions which have already been traversed so that information regarding these neighboring simply connected regions may be positively exploited when reconstructing the respective current simply connected region.
When the array of information samples is firstly divided into a regular arrangement of tree root regions of zero-order hierarchy size with then sub-dividing at least a subset of the tree root regions into smaller simply connected regions of different sizes, the reconstructor may use a zigzag scan in order to scan the tree root regions with, for each tree root region to be partitioned, treating the simply connected leaf regions in depth-first traversal order before stepping further to the next tree root region in the zigzag scan order. Moreover, in accordance with the depth-first traversal order, simply connected leaf regions of the same hierarchy level may be traversed in a zigzag scan order also. Thus, the increased likelihood of having neighboring simply connected leaf regions is maintained.
According to an embodiment, although the flags associated with the nodes of the multi-tree structure are sequentially arranged in a depth-first traversal order, the sequential coding of the flags uses probability estimation contexts which 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, thereby allowing for a good compromise between the number of contexts to be provided and the adaptation to the actual symbol statistics of the flags on the other hand.
In accordance with an embodiment, the probability estimation contexts for a predetermined flag used also depends on flags preceding the predetermined flag in accordance with the depth-first traversal order and corresponding to areas of the tree root region having a predetermined relative location relationship to the area to which the predetermined flag corresponds. Similar to the idea underlying the proceeding aspect, the use of the depth-first traversal order guarantees a high probability that flags already having been coded also comprise flags corresponding to areas neighboring the area corresponding to the predetermined flag so that this knowledge may be used to better adapt the contest to be used for the predetermined flag.
The flags which may be used for setting the context for a predetermined flag, may be those corresponding to areas lying to the top of and/or to the left of the area to which the predetermined flag corresponds. Moreover, the flags used for selecting the context may be restricted to flags belonging to the same hierarchy level as the node with which the predetermined flag is associated.
According to an embodiment, the coded signaling comprises 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 a sequentially decoding, in a depth-first or breadth-first traversal order, of the sequence of flags from the data stream takes place, with skipping nodes of the highest hierarchy level and automatically appointing same leaf nodes, thereby reducing the coding rate.
In accordance with a further embodiment, the coded signaling of the multi-tree structure may comprise the indication of the highest hierarchy level. By this measure, it is possible to restrict the existence of flags to hierarchy levels other than the highest hierarchy level as a further partitioning of blocks of the highest hierarchy level is excluded anyway.
In case of the spatial multi-tree-sub-division being part of a secondary sub-division of leaf nodes and un-partitioned tree root regions of a primary multi-tree-sub-division, the context used for coding the flags of the secondary sub-division may be selected such that the context are the same for the flags associated with areas of the same size.
Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:
In the following description of the Figs., elements occurring in several of these Figs. are indicated by common reference numbers and a repeated explanation of these elements is avoided. Rather, explanations with respect to an element presented within one Fig. shall also apply to other Figs. in which the respective element occurs as long as the explanation presented with these other Figs. indicate deviations therefrom.
Further, the following description starts with embodiments of an encoder and decoder which are explained with respect to
The encoder 10 of
As will be outlined in more detail below, the divider 20 uses a multi-tree sub-division in order to sub-divide the picture 24 into the blocks 26 of different sizes. To be even more precise, the specific embodiments outlined below with respect to
As illustrated by dashed lines in
The residual pre-coder 14, in turn, may use a residual sub-division of the pictures 24 in order to encode the residual of the prediction of the pictures 24 provided by predictor 12. As the residual reconstructor 16 reconstructs the residual from the syntax elements output by residual pre-coder 14, residual reconstructor 16 also operates on the just-mentioned residual sub-division. The data stream inserter 18 may exploit the divisions just-mentioned, i.e., the prediction and residual sub-divisions, in order to determine insertion orders and neighborships among the syntax elements for the insertion of the syntax elements output by residual pre-coder 14 and predictor 12 into the data stream 22 by means of, for example, entropy encoding.
As shown in
Having described the structure of encoder 10, the mode of operation is described in more detail in the following.
As described above, divider 20 decides for each picture 24 how to sub-divide same into sub-regions 26. In accordance with a sub-division of the picture 24 to be used for prediction, predictor 12 decides for each sub-region corresponding to this sub-division, how to predict the respective sub-region. Predictor 12 outputs the prediction of the sub-region to the inverting input of substractor 34 and to the further input of adder 36 and outputs prediction information reflecting the way how predictor 12 obtained this prediction from previously encoded portions of the video, to data stream inserter 18.
At the output of subtractor 34, the prediction residual is thus obtained wherein residual pre-coder 14 processes this prediction residual in accordance with a residual sub-division also prescribed by divider 20. As described in further detail below with respect to
Residual precoder 14 subjects each residual sub-region to a transformation from spatial to spectral domain by a two-dimensional transform followed by, or inherently involving, a quantization of the resulting transform coefficients of the resulting transform blocks whereby distortion results from the quantization noise. The data stream inserter 18 may, for example, losslessly encode syntax elements describing the afore-mentioned transform coefficients into the data stream 22 by use of, for example, entropy encoding.
The residual reconstructor 16, in turn, reconverts, by use of a re-quantization followed by a re-transformation, the transform coefficients into a residual signal wherein the residual signal is combined within adder 36 with the prediction used by subtractor 34 for obtaining the prediction residual, thereby obtaining a reconstructed portion or subregion of a current picture at the output of adder 36. Predictor 12 may use the reconstructed picture subregion for intra prediction directly, that is for predicting a certain prediction sub-region by extrapolation from previously reconstructed prediction sub-regions in the neighborhood. However, an intra prediction performed within the spectral domain by predicting the spectrum of the current subregion from that of a neighboring one, directly would theoretically also be possible.
For inter prediction, predictor 12 may use previously encoded and reconstructed pictures in a version according to which same have been filtered by an optional in-loop filter 38. In-loop filter 38 may, for example, comprise a de-blocking filter and/or an adaptive filter having a transfer function adapted to advantageously form the quantization noise mentioned before.
Predictor 12 chooses the prediction parameters revealing the way of predicting a certain prediction sub-region by use of a comparison with the original samples within picture 24. The prediction parameters may, as outlined in more detail below, comprise for each prediction sub-region an indication of the prediction mode, such as intra picture prediction and inter picture prediction. In case of intra picture prediction, the prediction parameters may also comprise an indication of an angle along which edges within the prediction sub-region to be intra predicted mainly extend, and in case of inter picture prediction, motion vectors, motion picture indices and, eventually, higher order motion transformation parameters and, in case of both intra and/or inter picture prediction, optional filter information for filtering the reconstructed image samples based on which the current prediction sub-region is predicted.
As will be outlined in more detail below, the aforementioned sub-divisions defined by a divider 20 substantially influence the rate distortion ratio maximally achievable by residual precoder 14, predictor 12 and data stream inserter 18. In case of a too fine sub-division, the prediction parameters 40 output by predictor 12 to be inserted into data stream 22 necessitate a too large coding rate although the prediction obtained by predictor 12 might be better and the residual signal to be coded by residual precoder 14 might be smaller so that same might be coded by less bits. In case, of a too coarse sub-division, the opposite applies. Further, the just-mentioned thought also applies for the residual sub-division in a similar manner: a transformation of a picture using a finer granularity of the individual transformation blocks leads to a lower complexity for computing the transformations and an increased spatial resolution of the resulting transformation. That is, smaller residual sub-regions enable the spectral distribution of the content within individual residual sub-regions to be more consistent. However, the spectral resolution is reduced and the ratio between significant and insignificant, i.e. quantized to zero, coefficients gets worse. That is, the granularity of the transform should be adapted to the picture content locally. Additionally, independent from the positive effect of a finder granularity, a finer granularity regularly increases the amount of side information necessitated in order to indicate the subdivision chosen to the decoder. As will be outlined in more detail below, the embodiments described below provide the encoder 10 with the ability to adapt the sub-divisions very effectively to the content of the information signal to be encoded and to signal the sub-divisions to be used to the decoding side by instructing the data stream inserter 18 to insert the sub-division information into the coded data stream 22. Details are presented below.
However, before defining the sub-division of divider 20 in more detail, a decoder in accordance with an embodiment of the present application is described in more detail with respect to
The decoder of
Generally speaking, the residual reconstructor 106, the adder 108 and predictor 110 act like elements 16, 36 and 12 in
Several deviations may be performed on the above embodiments. Some are mentioned within the following detailed description with respect to the sub-division performed by sub-divider 28 and the merging performed by merger 30 and others are described with respect to the subsequent
In providing further details regarding the division of the pictures into sub-regions, the following description firstly focuses on the sub-division part which sub-divider 28 and 104a assume responsibility for. Then the merging process which merger 30 and merger 104b assume responsibility for, is described. Lastly, inter plane adaptation prediction is described.
The way, sub-divider 28 and 104a divide the pictures is such that a picture is dividable into a number of blocks of possibly different sizes for the purpose of predictive and residual coding of the image or video data. As mentioned before, a picture 24 may be available as one or more arrays of image sample values. In case of YUV/YCbCr color space, for example, the first array may represent the luma channel while the other two arrays represent chroma channels. Those arrays may have differing dimensions. All arrays may be grouped into one or more plane groups with each plane group consisting of one or more consecutive planes such that each plane is contained in one and only one plane group. For each plane group the following applies. The first array of a particular plane group may be called the primary array of this plane group. The possibly following arrays are subordinate arrays. The block division of the primary array may be done based on a quadtree approach best described below. The block division of the subordinate arrays may be derived based on the division of primary array.
In accordance with the embodiments described below, sub-dividers 28 and 104a are configured to divide the primary array into a number of square blocks of equal size, so-called treeblocks in the following. The edge length of the treeblocks is typically a power of two such as 16, 32 or 64 when quadtrees are used. For sake of completeness, however, it is noted that the use of other tree types would be possible as well such as binary trees or trees with any number of leaves. Moreover, the number of children of the tree may be varied depending on the level of the tree and depending on what signal the tree is representing.
Beside this, as mentioned above, the array of samples may also represent other information than video sequences such as depth maps or lightfields, respectively. For simplicity, the following description focuses on quadtrees as a representative example for multi-trees. Quadtrees are trees that have exactly four children at each internal node. Each of the treeblocks constitutes a primary quadtree together with subordinate quadtrees at each of the leaves of the primary quadtree. The primary quadtree determines the sub-division of a given treeblock for prediction while a subordinate quadtree determines the sub-division of a given prediction block for the purpose of residual coding.
The root node of the primary quadtree corresponds to the full treeblock. For example,
Along the quadtree structure for treeblock 150, each node can be further divided onto four child nodes, which in the case of the primary quadtree means that each treeblock 150 can be split into four sub-blocks with half the width and half the height of the treeblock 150. In
Each leaf of the primary quadtree corresponds to a variable-sized block for which individual prediction parameters can be specified (i.e., intra or inter, prediction mode, motion parameters, etc.). In the following, these blocks are called prediction blocks. In particular, these leaf blocks are the blocks shown in
The prediction blocks shown in
Just as described for the case of the sub-division of a given treeblock into prediction blocks, each prediction block can be divided into a number of residual blocks by usage of subordinate quadtree decomposition(s). Each leaf of a subordinate quadtree corresponds to a residual block for which individual residual coding parameters can be specified (i.e., transform mode, transform coefficients, etc.) by residual precoder 14 which residual coding parameters control, in turn, residual reconstructors 16 and 106, respectively.
In other words, sub-divider 28 may be configured to determine for each picture or for each group of pictures a prediction sub-division and a subordinate residual sub-division by firstly dividing the picture into a regular arrangement of treeblocks 150, recursively partitioning a subset of these treeblocks by quadtree sub-division in order to obtain the prediction sub-division into prediction blocks—which may be treeblocks if no partitioning took place at the respective treeblock, or the leaf blocks of the quadtree sub-division—with then further sub-dividing a subset of these prediction blocks in a similar way, by, if a prediction block is greater than the maximum size of the subordinate residual sub-division, firstly dividing the respective prediction block into a regular arrangement of sub-treeblocks with then sub-dividing a subset of these sub-treeblocks in accordance with the quadtree sub-division procedure in order to obtain the residual blocks—which may be prediction blocks if no division into sub-treeblocks took place at the respective prediction block, sub-treeblocks if no division into even smaller regions took place at the respective sub-treeblock, or the leaf blocks of the residual quadtree sub-division.
As briefly outlined above, the sub-divisions chosen for a primary array may be mapped onto subordinate arrays. This is easy when considering subordinate arrays of the same dimension as the primary array. However, special measures have to be taken when the dimensions of the subordinate arrays differ from the dimension of the primary array. Generally speaking, the mapping of the primary array sub-division onto the subordinate arrays in case of different dimensions could be done by spatially mapping, i.e., by spatially mapping the block boarders of the primary array sub-division onto the subordinate arrays. In particular, for each subordinate array, there may be a scaling factor in horizontal and vertical direction that determines the ratio of the dimension of the primary array to the subordinate array. The division of the subordinate array into sub-blocks for prediction and residual coding may be determined by the primary quadtree and the subordinate quadtree(s) of each of the collocated treeblocks of the primary array, respectively, with the resulting treeblocks of the subordinate array being scaled by the relative scaling factor. In case the scaling factors in horizontal and vertical directions differ (e.g., as in 4:2:2 chroma sub-sampling), the resulting prediction and residual blocks of the subordinate array would not be squares anymore. In this case, it is possible to either predetermine or select adaptively (either for the whole sequence, one picture out of the sequence or for each single prediction or residual block) whether the non-square residual block shall be split into square blocks. In the first case, for example, encoder and decoder could agree onto a sub-division into square blocks each time a mapped block is not squared. In the second case, the sub-divider 28 could signal the selection via data stream inserter 18 and data stream 22 to sub-divider 104a. For example, in case of 4:2:2 chroma sub-sampling, where the subordinate arrays have half the width but the same height as the primary array, the residual blocks would be twice as high as wide. By vertically splitting this block, one would obtain two square blocks again.
As mentioned above, the sub-divider 28 or divider 20, respectively, signals the quadtree-based division via data stream 22 to sub-divider 104a. To this end, sub-divider 28 informs data stream inserter 18 about the sub-divisions chosen for pictures 24. The data stream inserter, in turn, transmits the structure of the primary and secondary quadtree, and, therefore, the division of the picture array into variable-size blocks for prediction or residual coding within the data stream or bit stream 22, respectively, to the decoding side.
The minimum and maximum admissible block sizes are transmitted as side information and may change from picture to picture. Or the minimum and maximum admissible block sizes can be fixed in encoder and decoder. These minimum and maximum block size can be different for prediction and residual blocks. For the signaling of the quadtree structure, the quadtree has to be traversed and for each node it has to be specified whether this particular node is a leaf node of the quadtree (i.e., the corresponding block is not sub-divided any further) or if it branches into its four child nodes (i.e., the corresponding block is divided into four sub-blocks with half the size).
The signaling within one picture is done treeblock by treeblock in a raster scan order such as front left to right and top to down as illustrated in
In an embodiment, not only the sub-division information, i.e., the structure of the tree, but also the prediction data etc., i.e. the payload associated with the leaf nodes of the tree, are transmitted/processed in depth-first order. This is done because depth-first traversal has big advantages over breadth-first order. In
Consequently, the signaling for each treeblock is done recursively along the quadtree structure of the primary quadtree such that for each node, a flag is transmitted, specifying whether the corresponding block is split into four sub-blocks. If this flag has the value “1” (for “true”), then this signaling process is repeated recursively for all four child nodes, i.e., sub-blocks in raster scan order (top left, top right, bottom left, bottom right) until the leaf node of the primary quadtree is reached. Note that a leaf node is characterized by having a sub-division flag with a value of “0”. For the case that a node resides on the lowest hierarchy level of the primary quadtree and thus corresponds to the smallest admissible prediction block size, no sub-division flag has to be transmitted. For the example in
The different background shadings in this binary string representation of
Note, that for the case of a breadth-first traversal, the sub-division information would be transmitted in a different order, shown in
Similar to the sub-division of each treeblock for the purpose of prediction, the division of each resulting prediction block into residual blocks has to be transmitted in the bitstream. Also, there may be a maximum and minimum block size for residual coding which is transmitted as side information and which may change from picture to picture. Or the maximum and minimum block size for residual coding can be fixed in encoder and decoder. At each leaf node of the primary quadtree, as those shown in
For entropy coding, residual block sub-division flags belonging to residual blocks of the same block size may be encoded using one and the same probability model.
Thus, in accordance with the example presented above with respect to
The extractor 102 extracts the respective bit sequences from the data stream at input 116 and informs divider 104 about the sub-division information thus obtained. Besides this, data stream inserter 18 and extractor 102 may use the afore-mentioned order among the prediction blocks and residual blocks to transmit further syntax elements such as residual data output by residual precoder 14 and prediction parameters output by predictor 12. Using this order has advantages in that adequate contexts for encoding the individual syntax elements for a certain block may be chosen by exploiting already coded/decoded syntax elements of neighboring blocks. Moreover, similarly, residual pre-coder 14 and predictor 12 as well as residual reconstructor 106 and pre-coder 110 may process the individual prediction and residual blocks in the order outlined above.
Next, in a step 302, extractor 102 decodes a flag or bit from the data stream. The first time step 302 is performed, the extractor 102 knows that the respective flag is the first flag of the bit sequence belonging to the first tree root block 150 in tree root block scan order 140. As this flag is a flag of hierarchy level 0, extractor 102 may use a context modeling associated with that hierarchy level 0 in step 302 in order to determine a context. Each context may have a respective probability estimation for entropy decoding the flag associated therewith. The probability estimation of the contexts may context-individually be adapted to the respective context symbol statistic. For example, in order to determine an appropriate context for decoding the flag of hierarchy level 0 in step 302, extractor 102 may select one context of a set of contexts, which is associated with that hierarchy level 0 depending on the hierarchy level 0 flag of neighboring treeblocks, or even further, depending on information contained within the bit strings defining the quadtree sub-division of neighboring treeblocks of the currently-processed treeblock, such as the top and left neighbor treeblock.
In the next step, namely step 304, extractor 102 checks as to whether the recently-decoded flag suggests a partitioning. If this is the case, extractor 102 partitions the current block—presently a treeblock—or indicates this partitioning to sub-divider 104a in step 306 and checks, in step 308, as to whether the current hierarchy level was equal to the maximum hierarchy level minus one. For example, extractor 102 could, for example, also have the maximum hierarchy level extracted from the data stream in step 300. If the current hierarchy level is unequal to the maximum hierarchy level minus one, extractor 102 increases the current hierarchy level by 1 in step 310 and steps back to step 302 to decode the next flag from the data stream. This time, the flags to be decoded in step 302 belongs to another hierarchy level and, therefore, in accordance with an embodiment, extractor 102 may select one of a different set of contexts, the set belonging to the current hierarchy level. The selection may be based also on sub-division bit sequences according to
If a flag is decoded, and the check in step 304 reveals that this flag does not suggest a partitioning of the current block, the extractor 102 proceeds with step 312 to check as to whether the current hierarchy level is 0. If this is the case, extractor 102 proceeds processing with respect to the next tree root block in the scan order 140 in step 314 or stops processing extracting the sub-division information if there is no tree root block to be processed left.
It should be noted that the description of
If, in step 312 she hierarchy level turns out to be unequal to 0, the operation proceeds in step 316 with a check as to whether further child nodes pertaining the current node exist. That is, when extractor 102 performs the check in step 316, it has already been checked in step 312 that the current hierarchy level is a hierarchy level other than 0 hierarchy level. This, in turn, means that a parent node exists, which belongs to a tree root block 150 or one of the smaller blocks 152a-d, or even smaller blocks 152a-d, and so on. The node of the tree structure, which the recently-decoded flag belongs to, has a parent node, which is common to three further nodes of the current tree structure. The scan order among such child nodes having a common parent node has been illustrated exemplarily in
By performing the steps shown in
In particular,
For the example in
For a currently-visited prediction block, the process of
In the next step, namely step 402, a check is performed as to whether the prediction block size of the currently-visited block is greater than the internal parameter denoting the current size. If this is the case, the currently-visited prediction block, which may be a leaf block of the prediction sub-division or a treeblock of the prediction sub-division, which has not be partitioned any further, is greater than the maximum residual block size and in this case, the process of
If, however, the currently-visited prediction block has a size equal to or smaller than the internal parameter indicting the current size, the process of
If, however, the prediction block size of the currently-visited prediction block is smaller than the internal parameter indicating the current size, the process of
As already noted above, there may be more than one array of samples and these arrays of samples may be grouped into one or more plane groups. The input signal to be encoded, entering input 32, for example, may be one picture of a video sequence or a still image. The picture may, thus, be given in the form of one or more sample arrays. In the context of the coding of a picture of a video sequence or a still image, the sample arrays might refer to the three color planes, such as red, green and blue or to luma and chroma planes, such in color representations of YUV or YCbCr. Additionally, sample arrays representing alpha, i.e. transparency, and/or depth information for 3-D video material might be present as well. A number of these sample arrays may be grouped together as a so-called plane group. For example, luma (Y) might be one plane group with only one sample array and chroma, such as CbCr, might be another plane group with two sample arrays or, in another example, YUV might be one plane group with three matrices and a depth information for 3-D video material might be a different plane group with only one sample array. For every plane group, one primary quadtree structure may be coded within the data stream 22 for representing the division into prediction blocks and for each prediction block, a secondary quadtree structure representing the division into residual blocks. Thus, in accordance with a first example just mentioned where the luma component is one plane group, whereas the chroma component forms the other plane group, there would be one quadtree structure for the prediction blocks of the luma plane, one quadtree structure for the residual blocks of the luma plane, one quadtree structure for the prediction block of the chroma plane and one quadtree structure for the residual blocks of the chroma plane. In the second example mentioned before, however, there would be one quadtree structure for the prediction blocks of luma and chroma together (YUV), one quadtree structure for the residual blocks of luma and chroma together (YUV), one quadtree structure for the prediction blocks of the depth information for 3-D video material and one quadtree structure for the residual blocks of the depth information for 3-D video material.
Further, in the foregoing description, the input signal was divided into prediction blocks using a primary quadtree structure and it was described how these prediction blocks were further sub-divided into residual blocks using a subordinate quadtree structure. In accordance with an alternative embodiment, the sub-division might not end at the subordinate quadtree stage. That is, the blocks obtained from a division using the subordinate quadtree structure might be further sub-divided using a tertiary quadtree structure. This division, in turn, might be used for the purpose of using further coding tools that might facilitate encoding the residual signal.
The foregoing description concentrated on the sub-division performed by sub-divider 28 and sub-divider 104a, respectively. As mentioned above, the sub-division defined by sub-divider 28 and 104a, respectively, may control the processing granularity of the afore-mentioned modules of encoder 10 and decoder 100. However, in accordance with the embodiments described in the following, the sub-dividers 228 and 104a, respectively, are followed by a merger 30 and merger 104b, respectively. It should be noted, however, that the mergers 30 and 104b are optional and may be left away.
In effect, however, and as will be outlined in more detail below, the merger provides the encoder with the opportunity of combining some of the prediction blocks or residual blocks to groups or clusters, so that the other, or at least some of the other modules may treat these groups of blocks together. For example, the predictor 12 may sacrifice the small deviations between the prediction parameters of some prediction blocks as determined by optimization using the subdivision of subdivider 28 and use prediction parameters common to all these prediction blocks instead if the signalling of the grouping of the prediction blocks along with a common parameter transmission for all the blocks belonging to this group is more promising in rate/distortion ratio sense than individually signaling the prediction parameters for all these prediction blocks. The processing for retrieving the prediction in predictors 12 and 110, itself, based on these common prediction parameters, may, however, still take place prediction-block wise. However, it is also possible that predictors 12 and 110 even perform the prediction process once for the whole group of prediction blocks.
As will be outlined in more detail below, it is also possible that the grouping of prediction blocks is not only for using the same or common prediction parameters for a group of prediction blocks, but, alternatively, or additionally, enables the encoder 10 to send one prediction parameter for this group along with prediction residuals for prediction blocks belonging to this group, so that the signaling overhead for signalling the prediction parameters for this group may be reduced. In the latter case, the merging process may merely influence the data stream inserter 18 rather than the decisions made by residual pre-coder 14 and predictor 12. However, more details are presented below. For completeness, however, it should be noted that the just-mentioned aspect also applies to the other sub-divisions, such as the residual sub-division or the filter sub-division mentioned above.
Firstly, the merging of sets of samples, such as the aforementioned prediction and residual blocks, is motivated in a more general sense, i.e. not restricted to the above-mentioned multi-tree sub-division. Subsequently, however, the description focuses on the merging of blocks resulting from multi-tree sub-division for which embodiments have just been described above.
Generally speaking, merging the syntax elements associated with particular sets of samples for the purpose of transmitting associated coding parameters enables reducing the side information rate in image and video coding applications. For example, the sample arrays of the signal to be encoded are usually partitioned into particular sets of samples or sample sets, which may represent rectangular or quadratic blocks, or any other collection of samples, including arbitrarily-shaped regions, triangles or other shapes. In the afore-described embodiments, the simply-connected regions were the prediction blocks and the residual blocks resulting from the multi-tree sub-division. The sub-division of sample arrays may be fixed by the syntax or, as described above, the sub-division may be, at least partially, signaled inside the bit stream. To keep the side information rate for signalling the sub-division information small, the syntax usually allows only a limited number of choices resulting in simple partitioning, such as the sub-division of blocks to smaller blocks. The sample sets are associated with particular coding parameters, which may specify prediction information or residual coding modes, etc. Details regarding this issue have been described above. For each sample set, individual coding parameters, such as for specifying the prediction and/or residual coding may be transmitted. In order to achieve an improved coding efficiency, the aspect of merging described hereinafter, namely the merging of two or more sample sets into so-called groups of sample sets, enables some advantages, which are described further below. For example, sample sets may be merged such that all sample sets of such a group share the same coding parameters, which can be transmitted together with one of the sample sets in the group. By doing so, the coding parameters do not have to be transmitted for each sample set of the group of sample sets individually, but, instead, the coding parameters are transmitted only once for the whole group of sample sets. As a result, the side information rate for transmitting the coding parameters may be reduced and the overall coding efficiency may be improved. As an alternative approach, an additional refinement for one or more of the coding parameters can be transmitted for one or more of the sample sets of a group of sample sets. The refinement can either be applied to all sample sets of a group or only to the sample set for which it is transmitted.
The merging aspect further described below also provides the encoder with a greater freedom in creating the bit stream 22, since the merging approach significantly increases the number of possibilities for selecting a partitioning for the sample arrays of a picture. Since the encoder can choose between more options, such as, for minimizing a particular rate/distortion measure, the coding efficiency can be improved. There are several possibilities of operating an encoder. In a simple approach, the encoder could firstly determine the best sub-division of the sample arrays. Briefly referring to
It should be noted that the merging approach described hereinafter does not change the processing order of the sample sets. That is, the merging concept can be implemented in a way so that the delay is not increased, i.e. each sample set remains decodable at the same time instant as without using the merging approach.
If, for example, the bit rate that is saved by reducing the number of coded prediction parameters is larger than the bit rate that is to be additionally spent for coding merging information for indicating the merging to the decoding side, the merging approach further to be described below results in an increased coding efficiency. It should further be mentioned that the described syntax extension for the merging provides the encoder with the additional freedom in selecting the partitioning of a picture or plane group into blocks. In other words, the encoder is not restricted to do the sub-division first and then to check whether some of the resulting blocks have the same set or a similar set of prediction parameters. As one simple alternative, the encoder could first determine the sub-division in accordance with a rate-distortion cost measure and then the encoder could check, for each block, whether a merging with one of its neighbor blocks or the associated already-determined group of blocks reduces a rate-distortion cost measure. At this, the prediction parameters associated with the new group of blocks can be re-estimated, such as by performing a new motion search or the prediction parameters that have already been determined for the current block and the neighboring block or groups of blocks could be evaluated for the new group of blocks. The merging information can be signaled on a block basis. Effectively, the merging could also be interpreted as inference of the prediction parameters for a current block, wherein the inferred prediction parameters are set equal to the prediction parameters of one of the neighboring blocks. Alternatively, residuals may be transmitted for blocks within a group of blocks.
Thus, the basic idea underlying the merging concept further described below is to reduce the bit rate that is necessitated for transmitting the prediction parameters or other coding parameters by merging neighboring blocks into a group of blocks, where each group of blocks is associated with a unique set of coding parameters, such as prediction parameters or residual coding parameters. The merging information is signaled inside the bit stream in addition to the sub-division information, if present. The advantage of the merging concept is an increased coding efficiency resulting from a decreased side information rate for the coding parameters. It should be noted that the merging processes described here could also extend to other dimensions than the spatial dimensions. For example, a group of sets of samples or blocks, respectively, lying within several different video pictures, could be merged into one group of blocks. Merging could also be applied to 4-D compression and light-field coding.
Thus, briefly returning to the previous description of
In any case, merging provides the above-mentioned briefly discussed advantages, such as reducing the side information rate bit in image and video coding applications. Particular sets of samples, which may represent the rectangular or quadratic blocks or arbitrarily-shaped regions or any other collection of samples, such as any simply-connected region or samples are usually connected with a particular set of coding parameters and for each of the sample sets, the coding parameters are included in the bit stream, the coding parameters representing, for example, prediction parameters, which specify how the corresponding set of samples is predicted using already-coded samples. The partitioning of the sample arrays of a picture into sample sets may be fixed by the syntax or may be signaled by the corresponding sub-division information inside the bit stream. Tie coding parameters for the sample set may be transmitted in a predefined order, which is given by the syntax. According to the merging functionality, merger 30 is able to signal, for a common set of samples or a current block, such as a prediction block or a residual block that it is merged with one or more other sample sets, into a group of sample sets. The coding parameters for a group of sample sets, therefore, needs to be transmitted only once. In a particular embodiment, the coding parameters of a current sample set are not transmitted if the current sample set is merged with a sample set or an already-existing group of sample sets for which the coding parameters have already been transmitted. Instead, the coding parameters for the current set of samples are set equal to the coding parameters of the sample set or group of sample sets with which the current set of samples is merged. As an alternative approach, an additional refinement for one or more of the coding parameters can be transmitted for a current sample set. The refinement can either be applied to all sample sets of a group or only to the sample set for which it is transmitted.
In accordance with an embodiment, for each set of samples such as a prediction block as mentioned above, a residual block as mentioned above, or a leaf block of a multitree subdivision as mentioned above, the set of all previously coded decoded sample sets is called the “set of causal sample sets”. See, for example,
The sets of samples that can be used for the merging with a current set of samples is called the “set of candidate sample sets” in the following and is a subset of the “set of causal sample sets”. The way how the subset is formed can either be known to the decoder or it can be specified inside the data stream or bit stream from the encoder to the decoder. If a particular current set of samples is coded/decoded and its set of candidate sample sets is not empty, it is signaled within the data stream at the encoder or derived from the data stream at the decoder whether the common set of samples is merged with one sample set out of this set of candidate sample sets and, if so, with which of them. Otherwise, the merging cannot be used for this block, since the set of candidate sample sets is empty anyway.
There are different ways how to determine the subset of the set of causal sample sets, which shall represent the set of candidate sample sets. For example, the determination of candidate sample sets may be based on a sample inside the current set of samples, which is uniquely geometrically-defined, such as the upper-left image sample of a rectangular or quadratic block. Starting from this uniquely geometrically-defined sample, a particular non-zero number of samples is determined, which represent direct spatial neighbors of this uniquely geometrically-defined sample. For example, this particular, non-zero number of samples comprises the top neighbor and the left neighbor of the uniquely geometrically-defined sample of the current set of samples, so that the non-zero number of neighboring samples may be, at the maximum, two, one if one of the top or left neighbors is not available or lies outside the picture, or zero in case of both neighbors missing.
The set of candidate sample sets could then be determined to encompass those sample sets that contain at least one of the non-zero number of the just-mentioned neighboring samples. See, for example,
In accordance with another embodiment, the set of candidate sample sets determined for the sake of merging may additionally or exclusively include sets of samples that contain a particular non-zero number of samples, which may be one or two that have the same spatial location, but are contained in a different picture, namely, for example, a previously coded/decoded picture. For example, in addition to blocks A and B in
It should be noted that the derivation of the candidate sample sets is performed in parallel by both merger 30 at the encoder side and merger 104b at the decoder side. As just mentioned, both may determine the set of candidate sample sets independent from each other based on a predefined way known to both or the encoder may signal hints within the bit stream, which bring merger 104b into a position to perform the derivation of these candidate sample sets in a way equal to the way merger 30 at the encoder side determined the set of candidate sample sets.
As will be described in more detail below; merger 30 and data stream inserter 18 cooperate in order to transmit one or more syntax elements for each set of samples, which specify whether the set of samples is merged with another sample set, which, in turn, may be part of an already-merged group of sample sets and which of the set of candidate sample sets is employed for merging. The extractor 102, in turn, extracts these syntax elements and informs merger 104b accordingly. In particular, in accordance with the specific embodiment described later on, one or two syntax elements are transmitted for specifying the merging information for a specific set of samples. The first syntax element specifies whether the current set of samples is merged with another sample set. The second syntax element, which is only transmitted if the first syntax element specifies that the current set of samples is merged with another set of samples, specifies which of the sets of candidate sample sets is employed for merging. The transmission of the first syntax element may be suppressed if a derived set of candidate sample sets is empty. In other words, the first syntax element may only be transmitted if a derived set of candidate sample sets is not empty. The second syntax element may only be transmitted if a derived set of candidate sample sets contains more than one sample set, since if only one sample set is contained in the set of candidate sample sets, a further selection is not possible anyway. Even further, the transmission of the second syntax element may be suppressed if the set of candidate sample sets comprises more than one sample set, but if all of the sample sets of the set of candidate sample sets are associated with the same coding parameter. In other words, the second syntax element may only be transmitted if at least two sample sets of a derived set of candidate sample sets are associated with different coding parameters.
Within the bitstream, the merging information for a set of samples may be coded before the prediction parameters or other particular coding parameters that are associated with that sample set. The prediction or coding parameters may only be transmitted if the merging information signals that the current set of samples is not to be merged with any other set of samples.
The merging information for a certain set of samples, i.e. a block, for example, may be coded after a proper subset of the prediction parameters or, in a more general sense, coding parameters that are associated with the respective sample set, has been transmitted. The subset of prediction/coding parameters may consist of one or more reference picture indices or one or more components of a motion parameter vector or a reference index and one or more components of a motion parameter vector, etc. The already-transmitted subset of prediction or coding parameters can be used for deriving a set of candidate sample sets out of a greater provisional set of candidate sample sets, which may have been derived as just described above. As an example, a difference measure or distance according to a predetermined distance measure, between the already-coded prediction and coding parameters of the current set of samples and the corresponding prediction or coding parameters of the preliminary set of candidate sample sets can be calculated. Then, only those sample sets for which the calculated difference measure, or distance, is smaller than or equal to a predefined or derived threshold, are included in the final, i.e. reduced set of candidate sample sets. See, for example,
The afore-mentioned threshold against which the afore-mentioned distances are compared may be fixed and known to both encoder and decoder or may be derived based on the calculated distances such as the median of the difference values, or some other central tendency or the like. In this case, the reduced set of candidate sample sets would unavoidably be a proper subset of the preliminary set of candidate sample sets. Alternatively, only those sets of samples are selected out of the preliminary set of candidate sample sets for which the distance according to the distance measure is minimized. Alternatively, exactly one set of samples is selected out of the preliminary set of candidate sample sets using the afore-mentioned distance measure. In the latter case, the merging information would only need to specify whether the current set of samples is to be merged with a single candidate set of samples or not.
Thus, the set of candidate blocks could be formed or derived as described in the following with respect to
Alternatively, the set of candidate blocks, additionally, or exclusively, may include blocks that contain one or more samples that are located at the same position as any of the samples of the current block, but are contained in a different, i.e. already coded/decoded picture.
Even alternatively, the candidate set of blocks represents a subset of the above-described sets of blocks, which were determined by the neighborhood in spatial or time direction. The subset of candidate blocks may be fixed, signaled or derived. The derivation of the subset of candidate blocks may consider decisions made for other blocks in the picture or in other pictures. As an example, blocks that are associated with the same or very similar coding parameters than other candidate blocks might not be included in the candidate set of blocks.
The following description of an embodiment applies for the case where only two blocks that contain the left and top neighbor sample of the top-left sample of the current block are considered as potential candidate at the maximum.
If the set of candidate blocks is not empty, one flag called merge_flag is signaled, specifying whether the current block is merged with any of the candidate blocks. If the merge_flag is equal to 0 (for “false”), this block is not merged with one of its candidate blocks and all coding parameters are transmitted ordinarily. If the merge_flag is equal to 1 (for “true”), the following applies. If the set of candidate blocks contains one and only one block, this candidate block is used for merging. Otherwise, the set of candidate blocks contains exactly two blocks. If the prediction parameters of these two blocks are identical, these prediction parameters are used for the current block. Otherwise (the two blocks have different prediction parameters), a flag called merge_left_flag is signaled. If merge_left_flag is equal to 1 (for “true”), the block containing the left neighboring sample position of the top-left sample position of the current block is selected out of the set of candidate blocks. If merge_left_flag is equal to 0 (for “false”), the other (i.e., top neighboring) block out of the set of candidate blocks is selected. The prediction parameters of the selected block are used for the current block.
In summarizing some of the above-described embodiments with respect to merging, reference is made to
The process starts at 450 with identifying the candidate blocks or sample sets for a current sample set or block. It should be recalled that the coding parameters for the blocks are transmitted within the data stream 22 in a certain one-dimensional order and accordingly,
As mentioned before, the identification and step 450 may comprise the identification among previously decoded blocks, i.e. the causal set of blocks, based on neighborhood aspects. For example, those neighboring blocks may be appointed candidate, which include certain neighboring samples neighboring one or more geometrically predetermined samples of the current block X in space or time. Further, the step of identifying may comprise two stages, namely a first stage involving an identification as just-mentioned, namely based on the neighborhood, leading to a preliminary set of candidate blocks, and a second stage according to which merely those blocks are appointed candidates the already transmitted coding parameters of which fulfill a certain relationship to the a proper subset of the coding parameters of the current block X, which has already been decoded from the data stream before step 450.
Next, the process steps to step 452 where it is determined as to whether the number of candidate blocks is greater than zero. If this is the case, a merge_flag is extracted from the data stream in step 454. The step of extracting 454 may involve entropy decoding. The context for entropy decoding the merge_flag in step 454 may be determined based on syntax elements belonging to, for example, the set of candidate blocks or the preliminary set of candidate blocks, wherein the dependency on the syntax elements may be restricted to the information whether the blocks belonging to the set of interest has been subject to merging or not. The probability estimation of the selected context may be adapted.
If, however, the number of candidate blocks is determined to be zero instead 452, the process
Returning to step 454, the process proceeds after extraction in step 454, with step 458 with a check as to whether the extracted merge_flag suggests the occurrence or absence of a merging of the current block. If no merging shall take place, the process proceeds with afore-mentioned step 456. Otherwise, the process proceeds with step 460, including a check as to whether the number of candidate blocks is equal to one. If this is the case, the transmission of an indication of a certain candidate block among the candidate blocks was not necessitated and therefore, the process of
If, however, the number of candidate blocks is determined to be greater than one in step 460, the process of
It should be noted that the merge partner itself may have been a block for which merging was signaled. In this case, the adopted or productively obtained coding parameters of that merging partner are used in step 464.
Otherwise, however, i.e. in case the coding parameters are not identical, the process of
Of course, there exist many alternatives. For example, a combined syntax element may be transmitted within the data stream instead of the separate syntax elements merge_flag and merge_left_flag described before, the combined syntax elements signaling the merging process. Further, the afore-mentioned merge_left_flag may be transmitted within the data stream irrespective of whether the two candidate blocks have the same prediction parameters or not, thereby reducing the computational overhead for performing process of
As was already denoted with respect to, for example,
The syntax for signaling which of the blocks of the candidate blocks to be used, may be set simultaneously and/or parallel at the encoder and decoder side. For example, if there are three choices for candidate blocks identified in step 450, the syntax is chosen such that only these three choices are available and are considered for entropy coding, for example, in step 470. In other words, the syntax element is chosen such that its symbol alphabet has merely as many elements as choices of candidate blocks exist. The probabilities for all other choices may be considered to be zero and the entropy-coding/decoding may be adjusted simultaneously at encoder and decoder.
Further, as has already been noted with respect to step 464, the prediction parameters that are inferred as a consequence of the merging process may represent the complete set of prediction parameters that are associated with the current block or they may represent a subset of these prediction parameters such as the prediction parameters for one hypothesis of a block for which multi-hypothesis prediction is used.
As noted above, the syntax elements related to the merging information could be entropy-coded using context modeling. The syntax elements may consist of the merge_flag and the merge_left_flag described above (or similar syntax elements). In a concrete example, one out of three context models or contexts could be used for coding/decoding the merge_flag in step 454, for example. The used context model index merge_flag_ctx may be derived as follows: if the set of candidate blocks contains two elements, the value of merge_flag_ctx is equal to the sum of the values of the merge_flag of the two candidate blocks. If the set of candidate blocks contains one element, however, the value of merge_flag_ctx may be equal to two times the value of merge_flag of this one candidate block. As each merge_flag of the neighboring candidate blocks may either be one or zero, three contexts are available for merge_flag. The merge_left_flag may be coded using merely a single probability model.
However, according to an alternative embodiment, different context models might be used. For example, non-binary syntax elements may be mapped onto a sequence of binary symbols, so-called bins. The context models for some syntax elements or bins of syntax elements defining the merging information may be derived based on already transmitted syntax elements of neighboring blocks or the number of candidate blocks or other measures while other syntax elements or bins of the syntax elements may be coded with a fixed context model.
Regarding the above description of the merging of blocks, it is noted that the set of candidate blocks may also be derived the same way as for any of the embodiments described above with the following amendment: candidate blocks are restricted to blocks using motion-compensated prediction or interprediction, respectively. Only those can be elements of the set of candidate blocks. The signaling and context modeling of the merging information could be done as described above.
Returning to the combination of the multitree subdivision embodiments described above and the merging aspect described now, if the picture is divided into square blocks of variable size by use of a quadtree-based subdivision structure, for example, the merge_flag and merge_left_flag or other syntax elements specifying the merging could be interleaved with the prediction parameters that are transmitted for each leaf node of the quadtree structure. Consider again, for example, FIG.. 9A.
In
Before proceeding with the description with regard to the aspect how to handle different sample arrays of a picture in accordance with embodiments of the present application, it is noted that the above discussion regarding the multitree subdivision and the signaling on the one hand and the merging aspect on the other hand made clear that these aspects provide advantages which may be exploited independent from each other. That is, as has already been explained above, a combination of a multitree subdivision with merging has specific advantages but advantages result also from alternatives where, for example, the merging feature is embodied with, however, the subdivision performed by subdividers 30 and 104a not being based on a quadtree or multitree subdivision, but rather corresponding to a macroblock subdivision with regular partitioning of these macroblocks into smaller partitions. On the other hand, in turn, the combination of the multitree subdivisioning along with the transmission of the maximum treeblock size indication within the bitstream, and the use of the multitree subdivision along with the use of the depth-first traversal order transporting the corresponding coding parameters of the blocks is advantageous independent from the merging feature being used concurrently or not. Generally, the advantages of merging can be understood, when considering that, intuitively, coding efficiency may be increased when the syntax of sample array codings is extended in a way that it does not only allow to subdivide a block, but also to merge two or more of the blocks that are obtained after subdivision. As a result, one obtains a group of blocks that are coded with the same prediction parameters. The prediction parameters for such a group of blocks need to be coded only once. Further, with respect to the merging of sets of samples, it should again been noted that the considered sets of samples may be rectangular or quadratic blocks, in which case the merged sets of samples represent a collection of rectangular and/or quadratic blocks. Alternatively, however, the considered sets of samples are arbitrarily shaped picture regions and the merged sets of samples represent a collection of arbitrarily shaped picture regions.
The following description focuses on the handling of different sample arrays of a picture in case there are more than one sample arrays per picture, and some aspects outlined in the following sub-description are advantageous independent from the kind of subdivision used, i.e. independent from the subdivision being based on multitree subdivision or not, and independent from merging being used or not. Before starting with describing specific embodiments regarding the handling of different sample arrays of a picture, the main issue of these embodiments is motivated by way of a short introduction into the field of the handling of different sample arrays per picture.
The following discussion focuses on coding parameters between blocks of different sample arrays of a picture in an image or video coding application, and, in particular, a way of adaptively predicting coding parameters between different sample arrays of a picture in, for example, but not exclusively the encoder and decoder of
Image and video coders are typically designed for coding color pictures (either still images or pictures of a video sequence). A color picture consists of multiple color planes, which represent sample arrays for different color components. Often, color pictures are coded as a set of sample arrays consisting of a luma plane and two chroma planes, where the latter ones specify color difference components. In some application areas, it is also common that the set of coded sample arrays consists of three color planes representing sample arrays for the three primary colors red, green, and blue. In addition, for an improved color representation, a color picture may consist of more than three color planes. Furthermore, a picture can be associated with auxiliary sample arrays that specify additional information for the picture. For instance, such auxiliary sample arrays can be sample arrays that specify the transparency (suitable for specific display purposes) for the associated color sample arrays or sample arrays that specify a depth map (suitable for rendering multiple views, e.g., for 3-D displays).
In the conventional image and video coding standards (such as H.264), the color planes are usually coded together, whereby particular coding parameters such as macroblock and sub-macroblock prediction modes, reference indices, and motion vectors are used for all color components of a block. The luma plane can be considered as the primary color plane for which the particular coding parameters are specified in the bitstream, and the chroma planes can be considered as secondary planes, for which the corresponding coding parameters are inferred from the primary luma plane. Each luma block is associated with two chroma blocks representing the same area in a picture. Depending on the used chroma sampling format, the chroma sample arrays can be smaller than the luma sample array for a block. For each macroblock consisting of a luma and two chroma components, the same partitioning into smaller blocks is used (if the macroblock is subdivided). For each block consisting of a block of luma samples and two blocks of chroma samples (which may be the macroblock itself or a subblock of the macroblock), the same set of prediction parameters such as reference indices, motion parameters, and sometimes intra prediction modes are employed. In specific profiles of conventional video coding standards (such as the 4:4:4 profiles in H.264), it is also possible to code the different color planes of a picture independently. In that configuration, the macroblock partitioning, the prediction modes, reference indices, and motion parameters can be separately chosen for a color component of a macroblock or subblock. Conventional coding standards either all color planes are coded together using the same set of particular coding parameters (such as subdivision information and prediction parameters) or all color planes are coded completely independently of each other.
If the color planes are coded together, one set of subdivision and prediction parameters has to be used for all color components of a block. This ensures that the side information is kept small, but it can result in a reduction of the coding efficiency compared to an independent coding, since the usage of different block decompositions and prediction parameters for different color components can result in a smaller rate-distortion cost. As an example, the usage of a different motion vector or reference frame for the chroma components can significantly reduce the energy of the residual signal for the chroma components and increase their overall coding efficiency. If the color planes are coded independently, the coding parameters such as the block partitioning, the reference indices, and the motion parameters can be selected for each color component separately in order to optimize the coding efficiency for each color component. But it is not possible, to employ the redundancy between the color components. The multiple transmissions of particular coding parameters does result in an increased side information rate (compared to the combined coding) and this increased side information rate can have a negative impact on the overall coding efficiency. Also, the support for auxiliary sample arrays in the state-of-the-art video coding standards (such as H.264) is restricted to the case that the auxiliary sample arrays are coded using their own set of coding parameters.
Thus, in all embodiments described so far, the picture planes could be handled as described above, but as also discussed above, the overall coding efficiency for the coding of multiple sample arrays (which may be related to different color planes and/or auxiliary sample arrays) can be increased, when it would be possible to decide on a block basis, for example, whether all sample arrays for a block are coded with the same coding parameters or whether different coding parameters are used. The basic idea of the following inter-plane prediction is to allow such an adaptive decision on a block basis, for example. The encoder can choose, for example based on a rate-distortion criterion, whether all or some of the sample arrays for a particular block are coded using the same coding parameters or whether different coding parameters are used for different sample arrays. This selection can also be achieved by signaling for a particular block of a sample array whether specific coding parameters are inferred from an already coded co-located block of a different sample array. It is also possible to arrange different sample arrays for a picture in groups, which are also referred to as sample array groups or plane groups. Each plane group can contain one or more sample arrays of a picture. Then, the blocks of the sample arrays inside a plane group share the same selected coding parameters such as subdivision information, prediction modes, and residual coding modes, whereas other coding parameters such as transform coefficient levels are separately transmitted for each sample arrays inside the plane group. One plane group is coded as primary plane group, i.e., none of the coding parameters is inferred or predicted from other plane groups. For each block of a secondary plane group, it can be adaptively chosen whether a new set of selected coding parameters is transmitted or whether the selected coding parameters are inferred or predicted from the primary or another secondary plane group. The decisions of whether selected coding parameters for a particular block are inferred or predicted are included in the bitstream. The inter-plane prediction allows a greater freedom in selecting the trade-off between the side information rate and prediction quality relative to the state-of-the-art coding of pictures consisting of multiple sample arrays. The advantage is an improved coding efficiency relative to the conventional coding of pictures consisting of multiple sample arrays.
Intra-plane adoption/prediction may extend an image or video coder, such as those of the above embodiments, in a way that it can be adaptively chosen for a block of a color sample array or an auxiliary sample array or a set of color sample arrays and/or auxiliary sample arrays whether a selected set of coding parameters is inferred or predicted from already coded co-located blocks of other sample arrays in the same picture or whether the selected set of coding parameters for the block is independently coded without referring to co-located blocks of other sample arrays in the same picture. The decisions of whether the selected set of coding parameters is inferred or predicted for a block of a sample array or a block of multiple sample arrays may be included in the bitstream. The different sample arrays that are associated with a picture don't need to have the same size.
As described above, the sample arrays that are associated with a picture (the sample arrays can represent color components and/or auxiliary sample arrays) may be arranged into two or more so-called plane groups, where each plane group consists of one or more sample arrays. The sample arrays that are contained in a particular plane group don't need to have the same size. Note that this arrangement into plane group includes the case that each sample array is coded separately.
To be more precise, in accordance with an embodiment, it is adaptively chosen, for each block of a plane group, whether the coding parameters specifying how a block is predicted are inferred or predicted from an already coded co-located block of a different plane group for the same picture or whether these coding parameters are separately coded for the block. The coding parameters that specify how a block is predicted include one or more of the following coding parameters: block prediction modes specifying what prediction is used for the block (intra prediction, inter prediction using a single motion vector and reference picture, inter prediction using two motion vectors and reference pictures, inter prediction using a higher-order, i.e., non-translational motion model and a single reference picture, inter prediction using multiple motion models and reference pictures), intra prediction modes specifying how an intra prediction signal is generated, an identifier specifying how many prediction signals are combined for generating the final prediction signal for the block, reference indices specifying which reference picture(s) is are employed for motion-compensated prediction, motion parameters (such as displacement vectors or affine motion parameters) specifying how the prediction signal(s) is/are generated using the reference picture(s), an identifier specifying how the reference picture(s) is/are filtered for generating motion-compensated prediction signals. Note that in general, a block can be associated with only a subset of the mentioned coding parameters. For instance, if the block prediction mode specifies that a block is intra predicted, the coding parameters for a block can additionally include intra prediction modes, but coding parameters such as reference indices and motion parameters that specify how an inter prediction signal is generated are not specified; or if the block prediction mode specifies inter prediction, the associated coding parameters can additionally include reference indices and motion parameters, but intra prediction modes are not specified.
One of the two or more plane groups may be coded or indicated within the bitstream as the primary plane group. For all blocks of this primary plane group, the coding parameters specifying how the prediction signal is generated are transmitted without referring to other plane groups of the same picture. The remaining plane groups are coded as secondary plane groups. For each block of the secondary plane groups, one or more syntax elements are transmitted that signal whether the coding parameters for specifying how the block is predicted are inferred or predicted from a co-located block of other plane groups or whether a new set of these coding parameters is transmitted for the block. One of the one or more syntax elements may be referred to as inter-plane prediction flag or inter-plane prediction parameter. If the syntax elements signal that the corresponding coding parameters are not inferred or predicted, a new set of the corresponding coding parameters for the block are transmitted in the bitstream. If the syntax elements signal that the corresponding coding parameters are inferred or predicted, the co-located block in a so-called reference plane group is determined. The assignment of the reference plane group for the block can be configured in multiple ways. In one embodiment, a particular reference plane group is assigned to each secondary plane group; this assignment can be fixed or it can signaled in high-level syntax structures such as parameter sets, access unit header, picture header, or slice header.
In a second embodiment, the assignment of the reference plane group is coded inside the bitstream and signaled by the one or more syntax elements that are coded for a block in order to specify whether the selected coding parameters are inferred or predicted or separately coded.
In order to ease the just-mentioned possibilities in connection with inter-plane prediction and the following detailed embodiments, reference is made to
In accordance with an embodiment, all sample arrays of a picture belong to the same portion of a spatial scene wherein the resolution along the vertical and horizontal direction may differ between the individual sample arrays 502-506. Further, for illustration purposes, the sample arrays 502 and 504 are considered to belong to one plane group 510, whereas the sample array 506 is considered to belong to another plane group 512. Further,
As is exemplarily shown in
Now, when encoding the individual sample arrays 502-506, the encoder 10 may begin with coding the primary array 504 of plane group 510 in, for example, the manner described above. The blocks shown in
After the transmission of the syntax element for primary array 504, encoder 10 may decide to declare primary array 504 to be the reference plane for subordinate plane 502. Encoder 10 and extractor 30, respectively, may signal this decision via the bitstream 22 while the association may be clear from the fact that sample array 504 forms the primary array of plane group 510 which information, in turn, may also be part of the bitstream 22. In any case, for each block within sample array 502 inserter 18 or any other module of encoder 10 along with inserter 18 may decide to either suppress a transferal of the coding parameters of this block within the bitstream and to signal within the bitstream for that block instead that the coding parameters of a co-located block within the primary array 504 shall be used instead, or that the coding parameters of the co-located block within the primary array 504 shall be used as a prediction for the coding parameters of the current block of sample array 502 with merely transferring the residual data thereof for the current block of the sample array 502 within the bitstream. In case of a negative decision, the coding parameters are transferred within the data stream as usual. The decision is signaled within the data stream 22 for each block. At the decoder side, the extractor 102 uses this inter-plane prediction information for each block in order to gain the coding parameters of the respective block of the sample array 502 accordingly, namely by inferring the coding parameters of the co-located block of the primary array 504 or, alternatively, extracting residual data for that block from the data stream and combining this residual data with a prediction obtained from the coding parameters of the co-located block of the primary array 504 if the inter-plane adoption prediction information suggests inter-plane adoption/prediction, or extracting the coding parameters of the current block of the sample array 502 as usual independent from the primary array 504.
As also described before, reference planes are not restricted to reside within the same plane group as the block for which inter-plane prediction is currently of interest. Therefore, as described above, plane group 510 may represent the primary plane group or reference plane group for the secondary plane group 512. In this case, the bitstream might contain a syntax element indicating for each block of sample array 506 as to whether the afore-mentioned adoption/prediction of coding parameters of co-located macroblocks of any of the planes 502 and 504 of the primary plane group or reference plane group 510 shall be performed or not wherein in the latter case the coding parameters of the current block of sample array 506 are transmitted as usual.
It should be noted that the subdivision and/or prediction parameters for the planes inside a plane group can be the same, i.e., because they are only coded once for a plane group (all secondary planes of a plane group infer the subdivision information and/or prediction parameters from the primary plane inside the same plane group), and the adaptive prediction or inference of the subdivision information and or prediction parameters is done between plane groups.
It should be noted that the reference plane group can be a primary plane group, or a secondary plane group.
The co-location between blocks of different planes within a plane group is readily understandable as the subdivision of the primary sample array 504 is spatially adopted by the subordinate sample array 502, except the just-described sub-partitioning of the blocks in order to render the adopted leaf blocks into quadratic blocks. In case of inter-plane adoption/prediction between different plane groups, the co-location might be defined in a way so as to allow for a greater freedom between the subdivisions of these plane groups. Given the reference plane group, the co-located block inside the reference plane group is determined. The derivation of the co-located block and the reference plane group can be done by a process similar to the following. A particular sample 514 in the current block 516 of one of the sample arrays 506 of the secondary plane group 512 is selected. Same may be the top-left sample of the current block 516 as shown at 514 in
In an embodiment, the coding parameters specifying the prediction for the current block 516 are completely inferred using the corresponding prediction parameters of the co-located block 522/524 in a different plane group 510 of the same picture 500, without transmitting additional side information. The inference can consist of a simply copying of the corresponding coding parameters or an adaptation of the coding parameters taken into account differences between the current 512 and the reference plane group 510. As an example, this adaptation may consist of adding a motion parameter correction (e.g., a displacement vector correction) for taking into account the phase difference between luma and chroma sample arrays; or the adaptation may consist of modifying the precision of the motion parameters (e.g., modifying the precision of displacement vectors) for taking into account the different resolution of luma and chroma sample arrays. In a further embodiment, one or more of the inferred coding parameters for specifying the prediction signal generation are not directly used for the current block 516, but are used as a prediction for the corresponding coding parameters for the current block 516 and a refinement of these coding parameters for the current block 516 is transmitted in the bitstream 22. As an example, the inferred motion parameters are not directly used, but motion parameter differences (such as a displacement vector difference) specifying the deviation between the motion parameters that are used for the current block 516 and the inferred motion parameters are coded in the bitstream; at the decoder side, the actual used motion parameters are obtained by combining the inferred motion parameters and the transmitted motion parameter differences.
In another embodiment the subdivision of a block, such as the treeblocks of the aforementioned prediction subdivision into prediction blocks (i.e., blocks of samples for which the same set of prediction parameters is used) is adaptively inferred or predicted from an already coded co-located block of a different plane group for the same picture, i.e. the bit sequence according to
In a further embodiment, the subdivision information for the current block, such as the quadtree-based subdivision info according to
In a further embodiment, both the subdivision of a block into prediction blocks and the coding parameters specifying how that subblocks are predicted are adaptively inferred or predicted from an already coded co-located block of a different plane group for the same picture. In an embodiment of the invention, one of the two or more plane groups is coded as primary plane group. For all blocks of this primary plane group, the subdivision information and the prediction parameters are transmitted without referring to other plane groups of the same picture. The remaining plane groups are coded as secondary plane groups. For blocks of the secondary plane groups, one or more syntax elements are transmitted that signal whether the subdivision information and the prediction parameters are inferred or predicted from a co-located block of other plane groups or whether the subdivision information and the prediction parameters are transmitted in the bitstream. One of the one or more syntax elements may be referred to as inter-plane prediction flag or inter-plane prediction parameter. If the syntax elements signal that the subdivision information and the prediction parameters are not inferred or predicted, the subdivision information for the block and the prediction parameters for the resulting subblocks are transmitted in the bitstream without referring to other plane groups of the same picture. If the syntax elements signal that the subdivision information and the prediction parameters for the subblock are inferred or predicted, the co-located block in a so-called reference plane group is determined. The assignment of the reference plane group for the block can be configured in multiple ways. In one embodiment, a particular reference plane group is assigned to each secondary plane group; this assignment can be fixed or it can signaled in high-level syntax structures such as parameter sets, access unit header, picture header, or slice header. In a second embodiment, the assignment of the reference plane group is coded inside the bitstream and signaled by the one or more syntax elements that are coded for a block in order to specify whether the subdivision information and the prediction parameters are inferred or predicted or separately coded. The reference plane group can be the primary plane group or another secondary plane group. Given the reference plane group, the co-located block inside the reference plane group is determined. The co-located block may be the block in the reference plane group that corresponds to the same image area as the current block, or the block that represents the block inside the reference plane group that shares the largest portion of the image area with the current block. The co-located block can be partitioned into smaller prediction blocks. In an embodiment, the subdivision information for the current block as well as the prediction parameters for the resulting subblocks are completely inferred using the subdivision information of the co-located block in a different plane group of the same picture and the prediction parameters of the corresponding subblocks, without transmitting additional side information. As a particular example, if the co-located block is partitioned into two or four prediction blocks, the current block is also partitioned into two or four subblocks for the purpose of prediction and the prediction parameters for the subblocks of the current block are derived as described above. As another particular example, if the co-located block is partitioned into four subblocks and one of these subblocks is further partitioned into four smaller subblocks, the current block is also partitioned into four subblocks and one of these subblocks (the one corresponding to the subblock of the co-located block that is further decomposed) is also partitioned into four smaller subblocks and the prediction parameters for all not further partitioned subblocks are inferred as described above. In a further embodiment, the subdivision information is completely inferred based on the subdivision information of the co-located block in the reference plane group, but the inferred prediction parameters for the subblocks are only used as prediction for the actual prediction parameters of the subblocks. The deviations between the actual prediction parameters and the inferred prediction parameters are coded in the bitstream. In a further embodiment, the inferred subdivision information is used as a prediction for the actual subdivision information for the current block and the difference is transmitted in the bitstream (as described above), but the prediction parameters are completely inferred. In another embodiment, both the inferred subdivision information and the inferred prediction parameters are used as prediction and the differences between the actual subdivision information and prediction parameters and their inferred values are transmitted in the bitstream.
In another embodiment, it is adaptively chosen, for a block of a plane group, whether the residual coding modes (such as the transform type) are inferred or predicted from an already coded co-located block of a different plane group for the same picture or whether the residual coding modes are separately coded for the block. This embodiment is similar to the embodiment for the adaptive inference/prediction of the prediction parameters described above.
In another embodiment, the subdivision of a block (e.g., a prediction block) into transform blocks (i.e., blocks of samples to which a two-dimensional transform is applied) is adaptively inferred or predicted from an already coded co-located block of a different plane group for the same picture. This embodiment is similar to the embodiment for the adaptive inference prediction of the subdivision into prediction blocks described above.
In another embodiment, the subdivision of a block into transform blocks and the residual coding modes (e.g., transform types) for the resulting transform blocks are adaptively inferred or predicted from an already coded co-located block of a different plane group for the same picture. This embodiment is similar to the embodiment for the adaptive inference/prediction of the subdivision into prediction blocks and the prediction parameters for the resulting prediction blocks described above.
In another embodiment, the subdivision of a block into prediction blocks, the associated prediction parameters, the subdivision information of the prediction blocks, and the residual coding modes for the transform blocks are adaptively inferred or predicted from an already coded co-located block of a different plane group for the same picture. This embodiment represents a combination of the embodiments described above. It is also possible that only some of the mentioned coding parameters are inferred or predicted.
Thus, the inter-plane adoption prediction may increase the coding efficiency described previously. However, the coding efficiency gain by way of inter-plane adoption prediction is also available in case of other block subdivisions being used than multitree-based subdivisions and independent from block merging being implemented or not.
The above-outlined embodiments with respect to inter plane adaptation/prediction are applicable to image and video encoders and decoders that divide the color planes of a picture and, if present, the auxiliary sample arrays associated with a picture into blocks and associate these blocks with coding parameters. For each block, a set of coding parameters may be included in the bitstream. For instance, these coding parameters can be parameters that describe how a block is predicted or decoded at the decoder side. As particular examples, the coding parameters can represent macroblock or block prediction modes, sub-division information, intra prediction modes, reference indices used for motion-compensated prediction, motion parameters such as displacement vectors, residual coding modes, transform coefficients, etc. The different sample arrays that are associated with a picture can have different sizes.
Next, a scheme for enhanced signaling of coding parameters within a tree-based partitioning scheme as, for example, those described above with respect to
Generally, the improved coding scheme for coding side information within a tree-based partitioning scheme, called inheritance, described next enables the following advantages relative to conventional schemes of coding parameter treatment.
In conventional image and video coding, the pictures or particular sets of sample arrays for the pictures are usually decomposed into blocks, which are associated with particular coding parameters. The pictures usually consist of multiple sample arrays. In addition, a picture may also be associated with additional auxiliary samples arrays, which may, for example, specify transparency information or depth maps. The sample arrays of a picture (including auxiliary sample arrays) can be grouped into one or more so-called plane groups, where each plane group consists of one or more sample arrays. The plane groups of a picture can be coded independently or, if the picture is associated with more than one plane group, with prediction from other plane groups of the same picture. Each plane group is usually decomposed into blocks. The blocks (or the corresponding blocks of sample arrays) are predicted by either inter-picture prediction or intra-picture prediction. The blocks can have different sizes and can be either quadratic or rectangular. The partitioning of a picture into blocks can be either fixed by the syntax, or it can be (at least partly) signaled inside the bitstream. Often syntax elements are transmitted that signal the subdivision for blocks of predefined sizes. Such syntax elements may specify whether and how a block is subdivided into smaller blocks and being associated coding parameters, e.g. for the purpose of prediction. For all samples of a block (or the corresponding blocks of sample arrays) the decoding of the associated coding parameters is specified in a certain way. In the example, all samples in a block are predicted using the same set of prediction parameters, such as reference indices (identifying a reference picture in the set of already coded pictures), motion parameters (specifying a measure for the movement of a blocks between a reference picture and the current picture), parameters for specifying the interpolation filter, intra prediction modes, etc. The motion parameters can be represented by displacement vectors with a horizontal and vertical component or by higher order motion parameters such as affine motion parameters consisting of six components. It is also possible that more than one set of particular prediction parameters (such as reference indices and motion parameters) are associated with a single block. In that case, for each set of these particular prediction parameters, a single intermediate prediction signal for the block (or the corresponding blocks of sample arrays) is generated, and the final prediction signal is build by a combination including superimposing the intermediate prediction signals. The corresponding weighting parameters and potentially also a constant offset (which is added to the weighted sum) can either be fixed for a picture, or a reference picture, or a set of reference pictures, or they can be included in the set of prediction parameters for the corresponding block. The difference between the original blocks (or the corresponding blocks of sample arrays) and their prediction signals, also referred to as the residual signal, is usually transformed and quantized. Often, a two-dimensional transform is applied to the residual signal (or the corresponding sample arrays for the residual block). For transform coding, the blocks (or the corresponding blocks of sample arrays), for which a particular set of prediction parameters has been used, can be further split before applying the transform. The transform blocks can be equal to or smaller than the blocks that are used for prediction. It is also possible that a transform block includes more than one of the blocks that are used for prediction. Different transform blocks can have different sizes and the transform blocks can represent quadratic or rectangular blocks. After transform, the resulting transform coefficients are quantized and so-called transform coefficient levels are obtained. The transform coefficient levels as well as the prediction parameters and, if present, the subdivision information is entropy coded.
In some image and video coding standards, the possibilities for subdividing a picture (or a plane group) into blocks that are provided by the syntax are very limited. Usually, it can only be specified whether and (potentially how) a block of a predefined size can be subdivided into smaller blocks. As an example, the largest block size in H.264 is 16×16. The 16×16 blocks are also referred to as macroblocks and each picture is partitioned into macroblocks in a first step. For each 16×16 macroblock, it can be signaled whether it is coded as 16×16 block, or as two 16×8 blocks, or as two 8×16 blocks, or as four 8×8 blocks. If a 16×16 block is subdivided into four 8×8 block, each of these 8×8 blocks can be either coded as one 8×8 block, or as two 8×4 blocks, or as two 4×8 blocks, or as four 4×4 blocks. The small set of possibilities for specifying the partitioning into blocks in state-of-the-art image and video coding standards has the advantage that the side information rate for signaling the subdivision information can be kept small, but it has the disadvantage that the bit rate necessitated for transmitting the prediction parameters for the blocks can become significant as explained in the following. The side information rate for signaling the prediction information does usually represent a significant amount of the overall bit rate for a block. And the coding efficiency could be increased when this side information is reduced, which, for instance, could be achieved by using larger block sizes. Real images or pictures of a video sequence consist of arbitrarily shaped objects with specific properties. As an example, such objects or parts of the objects are characterized by a unique texture or a unique motion. And usually, the same set of prediction parameters can be applied for such an object or part of an object. But the object boundaries usually don't coincide with the possible block boundaries for large prediction blocks (e.g., 16×16 macroblocks in H.264). An encoder usually determines the subdivision (among the limited set of possibilities) that results in the minimum of a particular rate-distortion cost measure. For arbitrarily shaped objects this can result in a large number of small blocks. And since each of these small blocks is associated with a set of prediction parameters, which need to be transmitted, the side information rate can become a significant part of the overall bit rate. But since several of the small blocks still represent areas of the same object or part of an object, the prediction parameters for a number of the obtained blocks are the same or very similar. Intuitively, the coding efficiency could be increased when the syntax is extended in a way that it does not only allow to subdivide a block, but also to share coding parameters between the blocks that are obtained after subdivision. In a tree-based subdivision, sharing of coding parameters for a given set of blocks can be achieved by assigning the coding parameters or parts thereof to one or more parent nodes in the tree-based hierarchy. As a result, the shared parameters or parts thereof can be used in order to reduce the side information that is necessitated to signal the actual choice of coding parameters for the blocks obtained after subdivision. Reduction can be achieved by omitting the signaling of parameters for subsequent blocks or by using the shared parameter(s) for prediction and/or context modeling of the parameters for subsequent blocks.
The basic idea of the inheritance scheme describe below is to reduce the bit rate that is necessitated for transmitting the coding parameters by sharing information along the tree-based hierarchy of blocks. The shared information is signaled inside the bitstream (in addition to the subdivision information). The advantage of the inheritance scheme is an increased coding efficiency resulting from a decreased side information rate for the coding parameters.
In order to reduce the side information rate, in accordance with the embodiments described below, the respective coding parameters for particular sets of samples, i.e. simply connected regions, which may represent rectangular or quadratic blocks or arbitrarily shaped regions or any other collection of samples, of a multitree subdivision are signaled within the data stream in an efficient way. The inheritance scheme described below enables that the coding parameters do not have to be explicitly included in the bitstream for each of these sample sets in full. The coding parameters may represent prediction parameters, which specify how the corresponding set of samples is predicted using already coded samples. Many possibilities and examples have been described above and do also apply here. As has also been indicated above, and will be described further below, as far as the following inheritance scheme is concerned, the tree-based partitioning of the sample arrays of a picture into sample sets may be fixed by the syntax or may be signaled by corresponding subdivision information inside the bitstream. The coding parameters for the sample sets may, as described above, transmitted in a predefined order, which is given by the syntax.
In accordance with the inheritance scheme, the decoder or extractor 102 of the decoder is configured to derive the information on the coding parameters of the individual simply connected region or sample sets in a specific way. In particular, coding parameters or parts thereof such as those parameters serving for the purpose of prediction, are shared between blocks along the given tree-based partitioning scheme with the sharing group along the tree structure being decided by the encoder or inserter 18, respectively. In a particular embodiment, sharing of the coding parameters for all child nodes of a given internal node of the partitioning tree is indicated by using a specific binary-valued sharing flag. As an alternative approach, refinements of the coding parameters can be transmitted for each node such that the accumulated refinements of parameters along the tree-based hierarchy of blocks can be applied to all sample sets of the block at a given leaf node. In another embodiment, parts of the coding parameters that are transmitted for internal nodes along the tree-based hierarchy of blocks can be used for context-adaptive entropy encoding and decoding of the coding parameter or parts thereof for the block at a given leaf node.
In the following description of inheritance, the following notation is used for describing the embodiments:
Reconstructed samples of current leaf node: r
Reconstructed samples of neighboring leaves: R′
Predictor of the current leaf node: p
Residual of the current leaf node: Re s
Reconstructed residual of the current leaf node: Re c Re s
Scaling and Inverse transform: SIT
Sharing flag: f
As a first example of inheritance, the intra-prediction signalization at internal nodes may be described. To be more precise, it is described how to signalize intra-prediction modes at internal nodes of a tree-based block partitioning for the purpose of prediction. By traversing the tree from the root node to the leaf nodes, internal nodes (including the root node) may convey parts of side information that will be exploited by its corresponding child nodes. To be more specific, a sharing flag f is transmitted for internal nodes with the following meaning:
If f has a value of 1 (“true”), all child nodes of the given internal node share the same intra-prediction mode. In addition to the sharing flag f with a value of 1, the internal node also signals the intra-prediction mode parameter to be used for all child nodes. Consequently, all subsequent child nodes do not carry any prediction mode information as well as any sharing flags. For the reconstruction of all related leaf nodes, the decoder applies the intra-prediction mode from the corresponding internal node.
If f has a value of 0 (“false”), the child nodes of the corresponding internal node do not share the same intra-prediction mode and each child node that is an internal node carries a separate sharing flag.
As a second example of inheritance, the inter-prediction refinement may be described. To be more precise, it is described how to signalize side information of inter-prediction modes at internal modes of a tree-based block partitioning for the purpose of refinement of motion parameters, as e.g., given by motion vectors. By traversing the tree from the root node to the leaf nodes, internal nodes (including the root node) may convey parts of side information that will be refined by its corresponding child nodes. To be more specific, a sharing flag f is transmitted for internal nodes with the following meaning:
If f has a value of 1 (“true”), all child nodes of the given internal node share the same motion vector reference. In addition to the sharing flag f with a value of 1, the internal node also signals the motion vector and the reference index. Consequently, all subsequent child nodes carry no further sharing flags but may carry a refinement of this inherited motion vector reference. For the reconstruction of all related leaf nodes, the decoder adds the motion vector refinement at the given leaf node to the inherited motion vector reference belonging to its corresponding internal parent node that has a sharing flag f with a value of 1. This means that the motion vector refinement at a given leaf node is the difference between the actual motion vector to be applied for motion-compensated prediction at this leaf node and the motion vector reference of its corresponding internal parent node.
If f has a value of 0 (“false”), the child nodes of the corresponding internal node do not necessarily share the same inter-prediction mode and no refinement of the motion parameters is performed at the child nodes by using the motion parameters from the corresponding internal node and each child node that is an internal node carries a separate sharing flag.
Reference is made now to
In step 550, an inheritance information is extracted from the data stream. In case of
The array of information samples may already be a subpart of a picture, such as a treeblock, namely the treeblock 150 of
Further, the inheritance information indicates, if inheritance is indicated to be used, at least one inheritance region of the array of information samples, which is composed of a set of leaf regions and corresponds to an hierarchy level of the sequence of hierarchy levels of the multi-tree subdivision, being lower than each of the hierarchy levels with which the set of leaf regions are associated. In other words, the inheritance information indicates as to whether inheritance is to be used or not for the current sample array such as the treeblock 150. If yes, it denotes at least one inheritance region or subregion of this treeblock 150, within which the leaf regions share coding parameters. Thus, the inheritance region may not be a leaf region. In the example of
It should be noted, however, that more than one inheritance region may be defined within one sample array or treeblock 150, respectively. Imagine, for example, the bottom left subblock 152c was also partitioned into smaller blocks. In this case, subblock 152c could also form an inheritance region.
In step 552, the inheritance information is checked as to whether inheritance is to be used or not. If yes, the process of
All the syntax elements contained in the inheritance subset is copied into or used as a prediction for the corresponding coding parameters of the leaf blocks within that inheritance region, i.e. leaf blocks 154a,b,d and 156a to 156d. In case of prediction being used, residuals are transmitted for the individual leaf blocks.
One possibility of transmitting the inheritance information for the treeblock 150 is the afore-mentioned transmission of a sharing flag f. The extraction of the inheritance information in step 550 could, in this case, comprise the following. In particular, the decoder could be configured to extract and check, for non-leaf regions corresponding to any of an inheritance set of at least one hierarchy level of the multi-tree subdivision, using an hierarchy level order from lower hierarchy level to higher hierarchy level, the sharing flag f from the data stream, as to whether the respective inheritance flag or share flag prescribes inheritance or not. For example, the inheritance set of hierarchy levels could be formed by hierarchy layers 1 to 3 in
The sharing flags f could be interleaved with the afore-mentioned bits signaling the quadtree sub-division. For example, an interleave bit sequence including both sub-division flags as well as sharing flags could be:
10001101(0000)000, which is the same sub-division information as illustrated in
Another way to define the inheritance information indicating the inheritance region would be the use of two sub-divisions defined in a subordinate manner to each other as explained above with respect to the prediction and residual sub-division, respectively. Generally speaking, the leaf blocks of the primary sub-division could form the inheritance region defining the regions within which inheritance subsets of syntax elements are shared while the subordinate sub-division defines the blocks within these inheritance regions for which the inheritance subset of syntax elements are copied or used as a prediction.
Consider, for example, the residual tree as an extension of the prediction tree. Further, consider the case where prediction blocks can be further divided into smaller blocks for the purpose of residual coding. For each prediction block that corresponds to a leaf node of the prediction-related quadtree, the corresponding subdivision for residual coding is determined by one or more subordinate quadtree(s).
In this case, rather than using any prediction signalization at internal nodes, we consider the residual tree as being interpreted in such a way that it also specifies a refinement of the prediction tree in the sense of using a constant prediction mode (signaled by the corresponding leaf node of the prediction-related tree) but with refined reference samples. The following example illustrates this case.
For example,
In the decoding process, as shown in
After the SIT process,
Re c Re s=SIT(Re s)
the reconstructed signal r is calculated and stored for the next prediction calculation process:
r=Re c Re s+p
The decoding order for prediction is the same as the residual decoding order, which is illustrated in
Each residual leaf node is decoded as described in the previous paragraph. The reconstructed signal r is stored in a buffer as shown in
After having described specific embodiments with respect to
In particular, the embodiments described above with respect to the framework of
Accordingly, the embodiments outlined in the following generalize the afore-mentioned embodiments regarding aspects pertaining to the merging. As the following embodiments represent generalizations of the embodiments described above, many of the above described details may be regarded as being combinable with the embodiments described in the following.
As described above with respect to
The payload data associated with each of the plurality of simply connected regions may, as already discussed above, comprise residual data in spatial domain or in a transform domain such as transform coefficients and a significance map identifying the positions of significant transform coefficients within a transform block corresponding to a residual block. Generally speaking, the payload data extracted by extractor 600 for each simply connected region from the data stream 604 is data which spatially describes its associated simply connected region either in the spatial domain or in a spectral domain and either directly or as a residual to some sort of prediction thereof, for example.
The reconstructor 602 is configured to reconstruct the array of information samples from the payload data for the simply connected regions of the array of information samples by processing, for each simply connected region, the payload data for the respective simply connected regions in a way prescribed by coding parameters associated with the respective simply connected regions. Similar to the above discussion, the coding parameters may be prediction parameters and accordingly, the simply connected regions shown in
The extractor 600 is configured to identify, for a predetermined simply connected region, simply connected regions within the plurality of simply connected regions which have a predetermined relative locational relationship to the predetermined simply connected region. Details with regard to this step have been described above with respect to step 450. That is, in addition to the predetermined relative locational relationship, the identification may depend on a subset of the coding parameters associated with the predetermined simply connected region. After the identification, the extractor 600 extracts a merge indicator for the predetermined simply connected region from the data stream 604. If the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than zero. This corresponds to the above description of steps 452 and 454. If the merge indicator suggests as a merge processing of the predetermined block, the extractor 600 is configured to check if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is one, or if the number of simply connected regions having the predetermined relative locational relationship to the predetermined simply connected region is greater than one with, however, the coding parameters thereof being identical to each other. If one of both alternatives applies, the extractor adopts the coding parameters or uses them for a prediction of the coding parameters of the predetermined simply connected region or the remaining subset thereof, just as described above with respect to steps 458-468. As was described above with respect to
By use of the latter checks, the transmission of a further indicator indicating one or a subset of the candidate simply connected regions may be suppressed thereby reducing the side information overhead.
Further, it should be noted that the structure of the encoder of
The merger 702 is configured to combine, depending on a second subset of syntax elements in the data stream, being disjoint from the first subset, spatially neighboring simply connected regions of the plurality of simply connected regions to obtain an intermediate subdivision of the array of sampled into disjoint sets of simply connected regions, the union of which has the plurality of simply connected regions. In other words, merger 702 combines the simply connected regions and assigns them in a unique manner to merging groups of simply connected regions. The second subset of syntax elements just-mentioned, indicating the merging information may be defined in the way presented above with respect to
Again, as in the case of
As described before, the embodiments described with respect to
Further, as mentioned above, the simply connected regions mentioned in connection with the description of
When comparing the encoder of
When comparing the decoder of
As far as the encoder of
Although some aspects have been described in the context of an apparatus, it is clear that these aspects also represent a description of the corresponding method, where a block or device corresponds to a method step or a feature of a method step. Analogously, aspects described in the context of a method step also represent a description of a corresponding block or item or feature of a corresponding apparatus. Some or all of the method steps may be executed by (or using) a hardware apparatus, like for example, a microprocessor, a programmable computer or an electronic circuit. In some embodiments, some one or more of the most important method steps may be executed by such an apparatus.
The inventive encoded compressed signals can be stored on a digital storage medium or can be transmitted on a transmission medium such as a wireless transmission medium or a wired transmission medium such as the Internet.
Depending on certain implementation requirements, embodiments of the invention can be implemented in hardware or in software. The implementation can be performed using a digital storage medium, for example a floppy disk, a DVD, a Blu-Ray, a CD, a ROM, a PROM, an EPROM, an EEPROM or a FLASH memory, having electronically readable control signals stored thereon, which cooperate (or are capable of cooperating) with a programmable computer system such that the respective method is performed. Therefore, the digital storage medium may be computer readable.
Some embodiments according to the invention comprise a data carrier having electronically readable control signals, which are capable of cooperating with a programmable computer system, such that one of the methods described herein is performed.
Generally, embodiments of the present invention can be implemented as a computer program product with a program code, the program code being operative for performing one of the methods when the computer program product runs on a computer. The program code may for example be stored on a machine readable carrier.
Other embodiments comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier.
In other words, an embodiment of the inventive method is, therefore, a computer program having a program code for performing one of the methods described herein, when the computer program runs on a computer.
A further embodiment of the inventive methods is, therefore, a data carrier (or a digital storage medium, or a computer-readable medium) comprising, recorded thereon, the computer program for performing one of the methods described herein.
A further embodiment of the inventive method is, therefore, a data stream or a sequence of signals representing the computer program for performing one of the methods described herein. The data stream or the sequence of signals may for example be configured to be transferred via a data communication connection, for example via the Internet.
A further embodiment comprises a processing means, for example a computer, or a programmable logic device, configured to or adapted to perform one of the methods described herein.
A further embodiment comprises a computer having installed thereon the computer program for performing one of the methods described herein.
In some embodiments, a programmable logic device (for example a field programmable gate array) may be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor in order to perform one of the methods described herein. Generally, the methods are performed by any hardware apparatus.
While this invention has been described in terms of several advantageous embodiments, there are alterations, permutations, and equivalents which fall within the scope of this invention. It should also be noted that there are many alternative ways of implementing the methods and compositions of the present invention. It is therefore intended that the following appended claims be interpreted as including all such alterations, permutations, and equivalents as fall within the true spirit and scope of the present invention.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10159799 | Apr 2010 | EP | regional |
| PCT/EP2010/054833 | Apr 2010 | WO | international |
The present application is a continuation of U.S. patent application Ser. No. 17/346,904 filed Jun. 14, 2021, which is a continuation of U.S. patent application Ser. No. 16/907,861 filed Jun. 22, 2020, now U.S. Pat. No. 11,037,194, which is a continuation of U.S. patent application Ser. No. 16/578,542 filed Sep. 23, 2019, now U.S. Pat. No. 10,719,850, which is a continuation of U.S. patent application Ser. No. 16/261,823 filed Jan. 30, 2019, now U.S. Pat. No. 10,803,483, which is a continuation of U.S. patent application Ser. No. 13/650,635, filed Oct. 12, 2012, now U.S. Pat. No. 10,621,614, which is a continuation of International Application PCT/EP2011/055795, filed Apr. 13, 2011, which claims priority from International Application No. PCT/EP2010/054833, filed Apr. 13, 2010, and European Patent Application EP 10159799.5, filed Apr. 13, 2010, all of which are incorporated herein by reference in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4980764 | Henot | Dec 1990 | A |
| 5603012 | Sotheran | Feb 1997 | A |
| 5724537 | Jcnes | Mar 1998 | A |
| 5809270 | Robbins | Sep 1998 | A |
| 6005981 | Ng | Dec 1999 | A |
| 6057884 | Chen | May 2000 | A |
| 6067574 | Tzeng | May 2000 | A |
| 6202178 | Spruyt | Mar 2001 | B1 |
| 6269175 | Hanna | Jul 2001 | B1 |
| 6269192 | Sodagar et al. | Jul 2001 | B1 |
| 6408097 | Kondo | Jun 2002 | B1 |
| 7254533 | Jabri | Aug 2007 | B1 |
| 9591335 | Kirchhoffer | Mar 2017 | B2 |
| 9596488 | Kirchhoffer | Mar 2017 | B2 |
| 10248966 | Helle | Apr 2019 | B2 |
| 10261614 | Chuang | Apr 2019 | B2 |
| 10460344 | Helle | Oct 2019 | B2 |
| 10621614 | Helle | Apr 2020 | B2 |
| 10672028 | Helle | Jun 2020 | B2 |
| 10681390 | Kirchhoffer | Jun 2020 | B2 |
| 10687086 | Kirchhoffer | Jun 2020 | B2 |
| 10708628 | Kirchhoffer et al. | Jul 2020 | B2 |
| 10719850 | Helle | Jul 2020 | B2 |
| 10721495 | Kirchhoffer et al. | Jul 2020 | B2 |
| 10748183 | Helle | Aug 2020 | B2 |
| 10764608 | Kirchhoffer et al. | Sep 2020 | B2 |
| 10771822 | Kirchhoffer | Sep 2020 | B2 |
| 10803483 | Helle et al. | Oct 2020 | B2 |
| 10803485 | Helle | Oct 2020 | B2 |
| 10848767 | Winken et al. | Nov 2020 | B2 |
| 10855990 | Winken et al. | Dec 2020 | B2 |
| 10893301 | Kirchhoffer et al. | Jan 2021 | B2 |
| 11037194 | Helle | Jun 2021 | B2 |
| 11087355 | Helle et al. | Aug 2021 | B2 |
| 11102518 | Kirchhoffer et al. | Aug 2021 | B2 |
| 20010004404 | Itokawa | Jun 2001 | A1 |
| 20010039487 | Hammersley | Nov 2001 | A1 |
| 20020009233 | Pesquet-Popescu | Jan 2002 | A1 |
| 20020064231 | Felts | May 2002 | A1 |
| 20020106019 | Chaddha | Aug 2002 | A1 |
| 20020181745 | Hu | Dec 2002 | A1 |
| 20030021485 | Raveendran et al. | Jan 2003 | A1 |
| 20030076881 | Akiyoshi | Apr 2003 | A1 |
| 20030123545 | Prakash | Jul 2003 | A1 |
| 20030156652 | Wise | Aug 2003 | A1 |
| 20030179940 | Lin et al. | Sep 2003 | A1 |
| 20030198290 | Millin | Oct 2003 | A1 |
| 20030202596 | Lainema et al. | Oct 2003 | A1 |
| 20040234143 | Hagai | Jan 2004 | A1 |
| 20040028049 | Wan | Feb 2004 | A1 |
| 20040028282 | Kato | Feb 2004 | A1 |
| 20040047418 | Tourapis et al. | Mar 2004 | A1 |
| 20040061883 | Kanatsu | Apr 2004 | A1 |
| 20040062445 | Kim | Apr 2004 | A1 |
| 20040131269 | Kobayashi | Jul 2004 | A1 |
| 20040184662 | Kravec et al. | Sep 2004 | A1 |
| 20040194008 | Garudadri et al. | Sep 2004 | A1 |
| 20040213469 | Apostclopoulos et al. | Oct 2004 | A1 |
| 20050013370 | Kim | Jan 2005 | A1 |
| 20050013376 | Dattani et al. | Jan 2005 | A1 |
| 20050018770 | Adolph | Jan 2005 | A1 |
| 20050123042 | Park | Jan 2005 | A1 |
| 20050114093 | Cha et al. | May 2005 | A1 |
| 20050114298 | Fan et al. | May 2005 | A1 |
| 20050117789 | Kim et al. | Jun 2005 | A1 |
| 20050129122 | Booth et al. | Jun 2005 | A1 |
| 20050200630 | Evans | Sep 2005 | A1 |
| 20050213655 | Thoreau et al. | Sep 2005 | A1 |
| 20050286759 | Zitnick, III et al. | Dec 2005 | A1 |
| 20060002474 | Au | Jan 2006 | A1 |
| 20060013308 | Kim | Jan 2006 | A1 |
| 20060203911 | Zhou | Jan 2006 | A1 |
| 20060233262 | Ridge et al. | Jan 2006 | A1 |
| 20060083309 | Schwarz | Apr 2006 | A1 |
| 20060089832 | Ojanpera | Apr 2006 | A1 |
| 20060120448 | Han et al. | Jun 2006 | A1 |
| 20060120454 | Park | Jun 2006 | A1 |
| 20060126962 | Sun | Jun 2006 | A1 |
| 20060153295 | Wang | Jul 2006 | A1 |
| 20060153300 | Wang | Jul 2006 | A1 |
| 20060198444 | Wada | Sep 2006 | A1 |
| 20060209959 | Sun | Sep 2006 | A1 |
| 20060233251 | Kim | Oct 2006 | A1 |
| 20060233254 | Lee | Oct 2006 | A1 |
| 20060262216 | Zhai | Nov 2006 | A1 |
| 20060268988 | Sun et al. | Nov 2006 | A1 |
| 20070005795 | Gonzalez | Jan 2007 | A1 |
| 20070018994 | Sekine | Jan 2007 | A1 |
| 20070177667 | Subramana | Jan 2007 | A1 |
| 20070237224 | Krishnan | Jan 2007 | A1 |
| 20070036215 | Pan et al. | Feb 2007 | A1 |
| 20070053441 | Wang et al. | Mar 2007 | A1 |
| 20070063877 | Shmunk et al. | Mar 2007 | A1 |
| 20070074266 | Raveendran et al. | Mar 2007 | A1 |
| 20070086516 | Lee et al. | Apr 2007 | A1 |
| 20070110153 | Cho et al. | May 2007 | A1 |
| 20070115154 | Park et al. | May 2007 | A1 |
| 20070160133 | Bao et al. | Jul 2007 | A1 |
| 20070223582 | Borer et al. | Sep 2007 | A1 |
| 20070230574 | Valente | Oct 2007 | A1 |
| 20070248274 | Govindaswamy et al. | Oct 2007 | A1 |
| 20080069203 | Karczewicz | Jan 2008 | A1 |
| 20080165855 | Wang | Jan 2008 | A1 |
| 20080086545 | Fatt et al. | Apr 2008 | A1 |
| 20080089417 | Bao | Apr 2008 | A1 |
| 20080095238 | Wu | Apr 2008 | A1 |
| 20080127597 | Puchniak | Jun 2008 | A1 |
| 20080170793 | Yamada et al. | Jul 2008 | A1 |
| 20080247657 | Kalevo et al. | Oct 2008 | A1 |
| 20080267291 | Vieron et al. | Oct 2008 | A1 |
| 20080298694 | Kim et al. | Dec 2008 | A1 |
| 20080310504 | Ye et al. | Dec 2008 | A1 |
| 20090003441 | Sekiguchi | Jan 2009 | A1 |
| 20090003448 | Sekiguchi et al. | Jan 2009 | A1 |
| 20090003457 | Liu et al. | Jan 2009 | A1 |
| 20090003717 | Sekiguchi et al. | Jan 2009 | A1 |
| 20090028245 | Vieron et al. | Jan 2009 | A1 |
| 20090028427 | Yamada et al. | Jan 2009 | A1 |
| 20090055749 | Chatterjee et al. | Jan 2009 | A1 |
| 20090154567 | Lei et al. | Jan 2009 | A1 |
| 20090175333 | Hsiang | Jan 2009 | A1 |
| 20090273706 | Tu | Jan 2009 | A1 |
| 20090037791 | Pavlov et al. | Feb 2009 | A1 |
| 20090080521 | Marpe | Mar 2009 | A1 |
| 20090080535 | Yin | Mar 2009 | A1 |
| 20090080536 | Lee et al. | Mar 2009 | A1 |
| 20090092188 | Lee et al. | Apr 2009 | A1 |
| 20090096643 | Chang | Apr 2009 | A1 |
| 20090103602 | Xiong et al. | Apr 2009 | A1 |
| 20090129465 | Lai et al. | May 2009 | A1 |
| 20090147866 | She et al. | Jun 2009 | A1 |
| 20090152357 | Lei et al. | Jun 2009 | A1 |
| 20090165041 | Penberthy et al. | Jun 2009 | A1 |
| 20090180552 | Visharam et al. | Jul 2009 | A1 |
| 20090196342 | Divorra Escoda et al. | Aug 2009 | A1 |
| 20090196517 | Divorra Escoda et al. | Aug 2009 | A1 |
| 20090225846 | Francois et al. | Sep 2009 | A1 |
| 20090238279 | Tu et al. | Sep 2009 | A1 |
| 20090296017 | Itoh | Dec 2009 | A1 |
| 20090304090 | Cordara et al. | Dec 2009 | A1 |
| 20100202512 | Choi | Jan 2010 | A1 |
| 20100220469 | Ivey | Jan 2010 | A1 |
| 20100284466 | Pandit et al. | Jan 2010 | A1 |
| 20100299454 | Lyashevsky | Jan 2010 | A1 |
| 20100027624 | Yu | Feb 2010 | A1 |
| 20100034260 | Shimizu et al. | Feb 2010 | A1 |
| 20100034265 | Kim et al. | Feb 2010 | A1 |
| 20100046626 | Tu | Feb 2010 | A1 |
| 20100061450 | Sato et al. | Mar 2010 | A1 |
| 20100086029 | Chen | Apr 2010 | A1 |
| 20100086031 | Chen | Apr 2010 | A1 |
| 20100086032 | Chen | Apr 2010 | A1 |
| 20100124273 | Divorra Escoda et al. | May 2010 | A1 |
| 20100135387 | Divorra Escoda et al. | Jun 2010 | A1 |
| 20100150394 | Bloom | Jun 2010 | A1 |
| 20100158110 | Pandit et al. | Jun 2010 | A1 |
| 20100165077 | Yin | Jul 2010 | A1 |
| 20100208818 | Yin et al. | Aug 2010 | A1 |
| 20100208827 | Divorra Escoda et al. | Aug 2010 | A1 |
| 20100226569 | Mokrushin | Sep 2010 | A1 |
| 20100254463 | Narroschke et al. | Oct 2010 | A1 |
| 20100290527 | Park et al. | Nov 2010 | A1 |
| 20110019096 | Lee | Jan 2011 | A1 |
| 20110122225 | Kim et al. | Jan 2011 | A1 |
| 20110170595 | Shi | Jan 2011 | A1 |
| 20110170608 | Shi et al. | Jan 2011 | A1 |
| 20110038422 | Cheon et al. | Feb 2011 | A1 |
| 20110110428 | Chang et al. | May 2011 | A1 |
| 20110142133 | Takahashi et al. | Jun 2011 | A1 |
| 20110243233 | Alshina | Oct 2011 | A1 |
| 20110243249 | Lee | Oct 2011 | A1 |
| 20110249721 | Karczewicz et al. | Oct 2011 | A1 |
| 20110249743 | Zhao et al. | Oct 2011 | A1 |
| 20110299788 | Suzuki et al. | Dec 2011 | A1 |
| 20120177106 | Divorra Escoda et al. | Jan 2012 | A1 |
| 20120147957 | Alshina | Jun 2012 | A1 |
| 20120170648 | Chen | Jul 2012 | A1 |
| 20120300850 | Yie et al. | Nov 2012 | A1 |
| 20130039423 | Helle | Jan 2013 | A1 |
| 20130034157 | Helle | Feb 2013 | A1 |
| 20130034171 | Winken | Feb 2013 | A1 |
| 20130039422 | Kirchhoffer | Feb 2013 | A1 |
| 20130121415 | Wahadaniah et al. | May 2013 | A1 |
| 20130279577 | Schwarz | Oct 2013 | A1 |
| 20130287116 | Helle | Oct 2013 | A1 |
| 20140112387 | Ye et al. | Jan 2014 | A1 |
| 20150016525 | Alshin et al. | Jan 2015 | A1 |
| 20150201200 | Cheong et al. | Jul 2015 | A1 |
| 20150229957 | Zhao et al. | Aug 2015 | A1 |
| 20160029035 | Nguyen et al. | Jan 2016 | A1 |
| 20170197579 | Helle et al. | Jul 2017 | A1 |
| 20180218397 | Helle | Aug 2018 | A1 |
| 20190087857 | Helle et al. | Jan 2019 | A1 |
| 20190164188 | Helle et al. | Jan 2019 | A1 |
| 20190089962 | Winken et al. | Mar 2019 | A1 |
| 20190089992 | Kirchhoffer | Mar 2019 | A1 |
| 20190394497 | Kirchhoffer et al. | Dec 2019 | A1 |
| 20200007897 | Kirchhoffer et al. | Jan 2020 | A1 |
| 20200074503 | Helle et al. | Mar 2020 | A1 |
| 20210029365 | Winken et al. | Jan 2021 | A1 |
| 20210297673 | Zhang et al. | Sep 2021 | A1 |
| 20210304248 | Helle | Sep 2021 | A1 |
| 20210385500 | Zhang et al. | Dec 2021 | A1 |
| 20220210460 | Deng et al. | Jun 2022 | A1 |
| 20230058538 | Deng et al. | Feb 2023 | A1 |
| Number | Date | Country |
|---|---|---|
| 2007205337 | Apr 2010 | AU |
| 2732532 | Jan 2007 | CA |
| 1168054 | Dec 1997 | CN |
| 1395231 | Feb 2003 | CN |
| 1418436 | May 2003 | CN |
| 1549206 | Nov 2004 | CN |
| 1549206 | Nov 2004 | CN |
| 1549988 | Nov 2004 | CN |
| 1551636 | Dec 2004 | CN |
| 1581977 | Feb 2005 | CN |
| 1595990 | Mar 2005 | CN |
| 1637782 | Jul 2005 | CN |
| 1672177 | Sep 2005 | CN |
| 1691087 | Nov 2005 | CN |
| 1717047 | Jan 2006 | CN |
| 1728833 | Feb 2006 | CN |
| 1418437 | May 2006 | CN |
| 1766990 | May 2006 | CN |
| 1780278 | May 2006 | CN |
| 1795680 | Jun 2006 | CN |
| 1812579 | Aug 2006 | CN |
| 1882093 | Dec 2006 | CN |
| 101366283 | Dec 2006 | CN |
| 1893655 | Jan 2007 | CN |
| 197647 | Feb 2007 | CN |
| 1917647 | Feb 2007 | CN |
| 1933600 | Mar 2007 | CN |
| 1957617 | May 2007 | CN |
| 1960491 | May 2007 | CN |
| 1976458 | Jun 2007 | CN |
| 101018333 | Aug 2007 | CN |
| 101047733 | Oct 2007 | CN |
| 101068362 | Nov 2007 | CN |
| 101068366 | Nov 2007 | CN |
| 101073265 | Nov 2007 | CN |
| 101106711 | Jan 2008 | CN |
| 101119493 | Feb 2008 | CN |
| 101120584 | Feb 2008 | CN |
| 101124589 | Feb 2008 | CN |
| 101127899 | Feb 2008 | CN |
| 101189641 | May 2008 | CN |
| 101189876 | May 2008 | CN |
| 101416149 | May 2008 | CN |
| 101199121 | Jun 2008 | CN |
| 101204092 | Jun 2008 | CN |
| 101213840 | Jul 2008 | CN |
| 101213842 | Jul 2008 | CN |
| 101222644 | Jul 2008 | CN |
| 101385350 | Mar 2009 | CN |
| 101385351 | Mar 2009 | CN |
| 101395922 | Mar 2009 | CN |
| 101404774 | Apr 2009 | CN |
| 101406056 | Apr 2009 | CN |
| 101416399 | Apr 2009 | CN |
| 101459847 | Jun 2009 | CN |
| 101459847 | Jun 2009 | CN |
| 101493890 | Jul 2009 | CN |
| 101494782 | Jul 2009 | CN |
| 101502119 | Aug 2009 | CN |
| 101502120 | Aug 2009 | CN |
| 101507280 | Aug 2009 | CN |
| 101507280 | Aug 2009 | CN |
| 101510865 | Aug 2009 | CN |
| 100545870 | Sep 2009 | CN |
| 101617538 | Dec 2009 | CN |
| 101617538 | Dec 2009 | CN |
| 101676744 | Mar 2010 | CN |
| 101682763 | Mar 2010 | CN |
| 101682769 | Mar 2010 | CN |
| 101682770 | Mar 2010 | CN |
| 101321283 | Apr 2010 | CN |
| 101854550 | Oct 2010 | CN |
| 101889449 | Nov 2010 | CN |
| 102939750 | Feb 2013 | CN |
| 1589022 | Dec 2015 | CN |
| 101001374 | Aug 2016 | CN |
| 105915924 | Aug 2016 | CN |
| 103733622 | Jun 2017 | CN |
| 101325714 | Dec 2018 | CN |
| 105915922 | Jul 2019 | CN |
| 106412607 | Sep 2020 | CN |
| 1158773 | Nov 2001 | EP |
| 1507415 | Jun 2005 | EP |
| 1696674 | Aug 2006 | EP |
| 1806931 | Nov 2007 | EP |
| 2086239 | Aug 2009 | EP |
| 2485490 | Aug 2012 | EP |
| 2545710 | Jan 2013 | EP |
| 2559245 | Aug 2015 | EP |
| 2633468 | Dec 1989 | FR |
| 09-507347 | Jul 1997 | JP |
| 2000-350207 | Dec 2000 | JP |
| 2004-129260 | Apr 2004 | JP |
| 2004-135252 | Apr 2004 | JP |
| 2005-039842 | Feb 2005 | JP |
| 2005039841 | Feb 2005 | JP |
| 2005160089 | Jun 2005 | JP |
| 2007-503784 | Feb 2007 | JP |
| 2008537402 | Sep 2008 | JP |
| 2008-259171 | Oct 2008 | JP |
| 2008-311781 | Dec 2008 | JP |
| 2009-010943 | Jan 2009 | JP |
| 2009-512347 | Mar 2009 | JP |
| 2010502102 | Jan 2010 | JP |
| 2010502102 | Jan 2010 | JP |
| 2010-045853 | Feb 2010 | JP |
| 2010-081465 | Apr 2010 | JP |
| 2011509631 | Mar 2011 | JP |
| 2011526770 | Oct 2011 | JP |
| 2012504310 | Feb 2012 | JP |
| 2013509080 | Mar 2013 | JP |
| 2003-0065606 | Aug 2003 | KR |
| 10-2006-0079051 | Jul 2006 | KR |
| 2009-0057225 | Jun 2009 | KR |
| 1020090057225 | Jun 2009 | KR |
| 1020110017783 | Feb 2011 | KR |
| 1020110135471 | Dec 2011 | KR |
| 1020130007654 | Jan 2013 | KR |
| 1020130020890 | Mar 2013 | KR |
| 1020140071506 | Jun 2014 | KR |
| 1020130027504 | Dec 2015 | KR |
| 1020130084314 | Dec 2015 | KR |
| 1020130095292 | Dec 2015 | KR |
| 200723886 | Jun 2007 | TW |
| 200907860 | Feb 2009 | TW |
| 200910977 | Mar 2009 | TW |
| 200913726 | Mar 2009 | TW |
| 200949824 | Dec 2009 | TW |
| 200952461 | Dec 2009 | TW |
| 9514349 | May 1995 | WO |
| 9715146 | Apr 1997 | WO |
| 9717797 | May 1997 | WO |
| 03034743 | Apr 2003 | WO |
| 2004086302 | Oct 2004 | WO |
| I311870 | Jan 2005 | WO |
| 2005041420 | May 2005 | WO |
| 2008071542 | Jun 2005 | WO |
| 2007047736 | Apr 2007 | WO |
| 2008030067 | Mar 2008 | WO |
| 2008027192 | Mar 2008 | WO |
| 2008127072 | Oct 2008 | WO |
| 2008127597 | Oct 2008 | WO |
| 2008128898 | Oct 2008 | WO |
| 2008156548 | Dec 2008 | WO |
| 2008156548 | Dec 2008 | WO |
| 2009001864 | Dec 2008 | WO |
| 2009041843 | Apr 2009 | WO |
| 2009051719 | Apr 2009 | WO |
| 2009092454 | Jul 2009 | WO |
| 2009092455 | Jul 2009 | WO |
| 2010002214 | Jan 2010 | WO |
| 2010039731 | Apr 2010 | WO |
| 2010039733 | Apr 2010 | WO |
| 2010039733 | Apr 2010 | WO |
| 2011049396 | Apr 2011 | WO |
| 2011128365 | Oct 2011 | WO |
| 2018124957 | Jul 2018 | WO |
| Entry |
|---|
| De Forni, R.; Taubman, D.S., “On the benefits of leaf merging in quad-tree motion models,” in Image Processing, 2005. ICIP 2005. IEEE International Conference on , vol. 2, No. pp. 11-858-61, Sep. 11-14, 2005. (Year: 2005). |
| Bozinovic, N., et al, “Modeling Motion for Spatial Scalability”, Acoustics, Speech and Signal Processing, 2006, ICASSP 2006 Proceedings, 2006 IEEE International Conference on Toulouse, France May 14-19, 2006, pp. 29-11, XP031386333, ISBN: 978-1-4244-0439-8, 4 pages. |
| Decision to Grant Patent, dated Apr. 28, 2015, issued in corresponding Japanese Patent Application No. 2013-504257, with English translation, 6 pages. |
| Decision to Grant a Patent, dated Oct. 13, 2015, issued in corresponding Japanese Patent Application No. 2014-096318, with Englis translation, 6 pages. |
| Decision to Grant dated Nov. 2, 2015, from corresponding Korean Patent Application No. 10-2012-7029512, 2 pages. |
| Decision to Grant dated Nov. 2, 2015, from corresponding Korean Patent Application No. 10-2014-7014050, 2 pages. |
| Decision to Grant a Patent, dated Nov. 10, 2015, issued in corresponding Japanese Patent Application No. 2013-504211, with English translation, 6 pages. |
| Decision to Grant dated Nov. 25, 2015, in corresponding Korean Patent Application No. 10-2014-7027407, with English translation, 8 pages. |
| Decision to Grant dated Oct. 20, 2015, with English translation, from corresponding Japanese Application No. 2013-504130, 8 pages. |
| Deforni, Raffaele et al., “On The Benefits of Leaf Merging in Quad-Tree Motion Models”, IEEE, Apr. 20, 2010. |
| Extended European Search Report dated Jan. 28, 2016, 12 pages. |
| Extended European Search Report dated Oct. 27, 2015 from corresponding European Patent Application No. 15174132.9, 11 pages. |
| Final Rejection dated Jan. 29, 2016 in parallel U.S. Appl. No. 13/649,251, 29 pages. |
| Grewatsch, S., et al., “Sharing of Motion Vectors in 3D Video Coding”, Proc. of the 2004 Int. Conf. on Image Processing (ICIP '04), Oct. 27, 2004, vol. 5, p. 3271-3274, ISBN: 0-7803-8554-3, 4 pages. |
| Horowitz, et al., “Picture Segmentation by a Tree Traversal Algorithm”, Journal of the Association of Computing Machinery, vol. 23, No. 2, Jan. 1976, 22 pages. |
| Hsiang, et al., “Embedded Image Coding Using Zeroblocks of Sbubband/Wavelet Coefficients and Context Modeling”, Proceeding Int'l Symposium on Circuits and Systems (ISCAS), Geneva, May 2000, 111-652-111-665. |
| Kamolrat, B., et al., “3D Motion Estimation for Depth Image Coding in 3D Video Coding”, IEEE Transactions on Consumer Electronics, May 2009, vol. 55, No. 2, p. 824-830, ISSN: 0098-3063, 7 pages. |
| Kim, J.W., et al., “Video Coding with R-D Constrained Hierarchical Variable Block Size (VBS) Motion Estimation”, Journal of Visual Communication and Image Representation, Academic Press, Inc., US, vol. 9, No. 3, Jan. 1, 1998, pp. 243-254, XP000914354, ISSN: 1047-3203, DOI: 10.1006/JVCI., 1998, 12 pages. |
| Kim, Jaeil, et al., “Enlargng MB size for High Fidelity Video Coding Beyond HD”, ITU—Telecommunications Standardization Sector Study Group 16 Question 6 Video Coding Experts Group, 36th Meeting: San Diego, USA, Dec. 2008, VCEG-AJ21, pp. 1-6, 7 pages. |
| Kim, Yong-Hwan, et al., “Efficient RGB Video Coding Using Adaptive Inter-Plane Residual Prediction”, Digest of Technical Papers of IEEE Int. Conf. on Consumer Electronics 2008 (ICCE 2008), Jan. 13, 2008, p. 1-2, ISBN: 978-1-4244-1458-1, 2 pages. |
| Kimata, Hideaki, “The standardized trend about the three-dimensional picture—MPEG standardization of 3 dimension and a multiaspect picture”, Technical report of the Institute of Image and Information and Television Engineers, Japan, The Institute of Image and Information and Television Engineers, Nov. 8, 2007, vol. 31, No. 52, p. 7-12, ISSN: 1342-6893. |
| Lange, R et al., “Extended Inter-Layer Motion Vectors Prediction in Scalable Video Coding—Case Study and Improvement Proposal”, ISO/IED JTC1 SC291WG11 Coding of Moving Pictures and Audio. Bangkok, Thailand., Jan. 2006, 17 Pages. |
| Marpe, D., et al., “Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 13, No. 7, Jul. 1, 2003, pp. 620-636, XP055120073, ISSN: 1051-8215, DOI: 10.1109/TCSVT.2003.815173, 18 pages. |
| Merkle, P., et al. , “The effects of multiview depth video compression on multiview rendering”, Signal Processing: Image Communication, Jan. 2009, vol. 24, No. 1-2, p. 73-88, ISSN: 0923-5965, [online][search on Apr. 17, 2015], Internet, URL, http://iphome.hhi.de/wiegand/assets/pdfs/multiview_depth_video_compression.pdf , 16 pages. |
| Merkle, Philipp, et al., “Multi-View Video Plus Depth Representation and Coding”, Image Processing, 2007, ICIP 2007, IEEE International Conference on, IEEE, P1, Sep. 1, 2007, XP031157713, 4 pages. |
| Office Action dated Dec. 17, 2015, in parallel Taiwanese Patent Application No. 103137506, with English translation, 10 pages. |
| Office Action dated Jan. 5, 2016, in parallel Japanese Patent Application No. 2015-061416, with English translation, 9 pages. |
| Office Action dated May 13, 2016 issued in parallel U.S. Appl. No. 13/649,233, 20 pages. |
| Office Action dated Oct. 30, 2015, with English translation, from corresponding Taiwanese Patent Application No. 100112640, 14 pages. |
| Office Action issued in parallel Taiwanese Patent Application No. 104123545, dated Nov. 26, 2015, 7 pages. |
| Office Action issued in parallel U.S. Appl. No. 13/649,233 dated Dec. 22, 2015, 23 pages. |
| Office Action, dated May 31, 2016, in parallel Korean Patent Application No. 10-2012-7029634, with English translation, 15 pages. |
| Oh, Han, et al., “H.264-Based Depth Map Sequence Coding Using Motion Information of Corresponding Texture Video”, Proceedings of the PSIVT 2006, 2006, p. 898-907, [online], [search on Jun. 25, 2014], Internet, URL, http://vclab.gist.ac.kr/papers/01/2006/1_2006_HOH_H.264-based_Depth_Map_Sequence_Coding_Using_Motion_Information_of_Corresponding_Texture_Video.pdf, 10 pages. |
| Quadtree-based adaptive loop filter, Toshiba Corporation; Telecommunication Standardization Sector;Jan. 2009. |
| Result of Consultation dated Nov. 12, 2015, from corresponding European Patent Application No. 11 714 653.0, 4 pages. |
| Richardson, I.E.G., “H.264 and MPEG-4 Video Compression, video coding for next-generation multimedia, passage”, Jan. 1, 2003, H.264 and MPEG-4 Video Compression; Video Coding for Next Generation Multimedia, Hoboken, NJ: John Wiley & Sons, US, pp. 175-176, 210, XP002367662, ISBN: 978-0-470-84837-1, 3 pages. |
| Richardson, I.E.G., “H264/MPEG-4, Part 10, White Paper—Prediction of Intra Macroblocks”, Internet Citation, Apr. 30, 2003, XP002281494, URL: http://www.vcodex.com/h264.html/h264_intrapred.pdf, retrieved May 24, 2004, 6 pages. |
| Santillana-Rivero, “Hierarchical Motion-Based Image Segmentation Applied To HDTV”, Proceedings of the Int'l Workshop on Signal Processing of HDTV; Amsterdam, Feb.-Mar. 1988, pp. 367-374. |
| Schwarz, H et al., “Tree-Structured Macroblock Partition”, ITU—Telecommunications Standardization Sector Study Group 16—Video Coding Experts Group (VCEG) 15th Meeting. Pattaya, Thailand., Dec. 2001, 1-6. |
| Sekiguchi, S et al., “Results of CE on Separate Prediction Modes for 4:4:4 Coding (CE9)”, Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISOIIEC JTC1/SC291WG11 and ITU-T SG16 0.6) 18th Meeting. Bangkok, TH., Jan. 2006, 28 Pages. |
| Sullivan, G et al., “New Standardized Extensions of MPEG4-A VC/H.264 for Professional-Quality Video Applications”, IEEE. ICIP 2007., Sep. 1, 2007, 4 Pages. |
| Text of ISO/IEC 14496-10 FCD Advanced Video Coding, 61, MPEG Meeting, Jul. 22-26, 2002, Klagenfurt, (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11, No. N4920, Aug. 11, 2002, XP030012343, ISSN: 0000-0365, 208 pages. |
| Extended European Search Report dated Aug. 23, 2016 in European Application 16173177.3. |
| Joel Jung et al: Competition-Based Scheme for Motion Vector Selection and Coding, 29. VCEG Meeting; 77. MPEG Meeting; Jul. 17, 2006-Jul. 17, 2006; Klagenfurt, AT; (Video Coding Experts Group of ITU-T SG.16), No. VCEG-AC06ri, Aug. 2, 2006 (Aug. 2, 2006), XP030003490. |
| Yang W et al.: Efficient Motion Vector Coding Algorithms Based on Adaptive Template Matching Techniques 39. VCEG Meeting; Jan. 16, 2010-Jan. 22, 2010; Kyoto; (Video Coding Expertsgroup of ITU-T SG.16) URL: http://wftp3.itu.int/av-arch/video-site/, No. VCEG-AM16, Jan. 16, 2010 (Jan. 16, 2010), XP030003736. |
| Non-Final Office Action issued in parallel U.S, U.S. Appl. No. 13/649,233 dated May 13, 2016, 20 pages. |
| Office Action dated Feb. 24, 2016 in parallel U.S. Appl. No. 13/649,291, 24 pages. |
| Office Action dated Sep. 13, 2016 in parallel U.S. Appl. No. 13/649,251, 37 pages. |
| Office Action dated Sep. 14, 2016 in parallel U.S. Appl. No. 13/649,291, 46 pages. |
| Office Action dated Sep. 23, 2016 in U.S. Appl. No. 13/650,635. |
| Office Action dated Nov. 3, 2016 in U.S. Appl. No. 15/197,189. |
| Notice of Allowance dated Oct. 28, 2016 in U.S. Appl. No. 15/195,067. |
| Office Action dated Nov. 9, 2016 in U.S. Appl. No. 15/196,890. |
| Notice of Allowance dated Nov. 14, 2016 in U.S. Appl. No. 15/195,407. |
| Office Action dated Nov. 10, 2016 in U.S. Appl. No. 15/196,113. |
| Office Action dated Nov. 23, 2016 in U.S. Appl. No. 15/196,342. |
| Office Action dated Nov. 23, 2016 in U.S. Appl. No. 15/195,266. |
| Office Action dated Dec. 2, 2016 in U.S. Appl. No. 15/197,406. |
| Notice of Allowance dated Jan. 20, 2017 in Taiwanese Application 105124461. |
| Office Action dated Jan. 9, 2017 in U.S. Appl. No. 13/649,233. |
| Office Action dated Feb. 21, 2017 in U.S. Appl. No. 13/649,291. |
| Office Action dated Feb. 23, 2017 in U.S. Appl. No. 13/650,635. |
| Office Action dated Mar. 16, 2017 in U.S. Appl. No. 13/649,251. |
| Office Action dated Mar. 28, 2017 in U.S. Appl. No. 15/413,852. |
| Office Action dated Apr. 3, 2017 in U.S. Appl. No. 15/413,590. |
| Office Action dated May 26, 2017 in U.S. Appl. No. 15/196,890. |
| Office Action dated Jun. 8, 2017 in U.S. Appl. No. 15/196,113. |
| Office Action dated Jun. 8, 2017 in U.S. Appl. No. 15/196,342. |
| Office Action dated Jun. 9, 2017 in U.S. Appl. No. 15/197,406. |
| Notice of Allowance dated Jun. 16, 2017 in U.S. Appl. No. 15/197,189. |
| Touradj Ebrahimi, A new technique for motion field segmentation and coding for very low bitrate video coding applications, 1994, AT&T Bell Lab, IEEE, pp. 1-5. |
| Decision of Grant dated Jul. 28, 2017 in Korean Application 10-2016-7035916. |
| Decision of Grant dated Jul. 28, 2017 in Korean Application 10-2016-7035919. |
| Office Action dated Aug. 22, 2017 in European Application 15174132.9. |
| Guido M. Schuster et al., “A Video Compression Scheme with Optimal Bit Allocation Among Segmentation, Motion, and Residual Error”, IEEE Transactions on Image Processing, IEEE Service Center, Piscataway, NJ, US, vol. 6, No. 11, Nov. 1, 1997. |
| Office Action dated Aug. 10, 2017 in U.S. Appl. No. 15/195,266. |
| Office Action dated Sep. 29, 2017 in European Application 10716518.5. |
| “Joint Scalable Video Model (JSVM) 7”, 77. MPEG Meeting:Jul. 17, 2006-Jul. 21, 2006; Klagenfurt; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/ WG11), No. N8242, Oct. 27, 2006 (Oct. 27, 2006), XP030014734. |
| Office Action dated Aug. 24, 2017 in Chinese Application 2015104728008. |
| Office Action dated Oct. 3, 2017 in U.S. Appl. No. 15/413,852. |
| Office Action dated Oct. 3, 2017 in U.S. Appl. No. 15/413,590. |
| Office Action dated Oct. 12, 2017 in U.S. Appl. No. 15/137,406. |
| Office Action dated Oct. 25, 2017 in U.S. Appl. No. 13/649,251. |
| Office Action dated Nov. 6, 2017 in U.S. Appl. No. 15/196,342. |
| Office Action dated Nov. 17, 2017 in U.S. Appl. No. 13/649,291. |
| Office Action dated Nov. 20, 2017 in U.S. Appl. No. 13/650,635. |
| Notice of Allowance dated Jan. 17, 2018 in U.S. Appl. No. 15/196,893. |
| Office Action dated Feb. 8, 2018 in U.S. Appl. No. 15/195,266. |
| Extended European Search Report EP Application No. 17201697.4 dated Feb. 16, 2018. |
| Office Action dated Mar. 13, 2018 in U.S. Appl. No. 15/707,467. |
| Office Action dated Mar. 8, 2018 in U.S. Appl. No. 13/649,291. |
| Notice of Allowance dated Mar. 26, 2018 in U.S. Appl. No. 13/649,233. |
| Notice of Allowance dated Apr. 12, 2018 in U.S. Appl. No. 15/196,113. |
| Office Action dated Mar. 20, 2018 in Indian Patent Application No. 3089/KOLNP/2012. |
| Final Office Action U.S. Appl. No. 15/196,342 dated May 25, 2018. |
| Final Office Action U.S. Appl. No. 13/650,635 dated May 29, 2018. |
| Final Office Action U.S. Appl. No. 15/195,266 dated Jun. 6, 2018. |
| Non-final office action U.S. Appl. No. 15/940,879 dated Jun. 18, 2018. |
| Non-final office Action U.S. Appl. No. 15/954,991 dated Jun. 12, 2018. |
| Non-final office action U.S. Appl. No. 15/940,839 dated May 29, 2018. |
| Office Action Chinese Patent Application No. 2015104108885 dated May 3, 2018. |
| Office Action Chinese Patent Application No. 201610422931X dated May 4, 2 018. |
| Non-final Office Action U.S. Appl. No. 15/197,406 dated Jun. 29, 2018. |
| Notice of Allowance U.S. Appl. No. 15/413,852 dated Jul. 5, 2018. |
| Office Action Chinese Patent Application No. 2015104128342 dated May 18, 2018. |
| Notice of Allowance Taiwanese Patent Application No. 106102724 dated Jun. 6, 2018. |
| Notification of First Office Action Taiwanese Patent Application No. 2016104213275 dated Jun. 4, 2018. |
| Notification of First Office Action Chinese Patent Application No. 2016104110565 dated May 30, 2018. |
| Sekiguchi et al., Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG 16 Q. 6) 18th Meeting, Jan. 14-20, 2006, 31 pgs. |
| Final Office Action U.S. Appl. No. 13/649,251 dated Jul. 10, 2018. |
| HM Software Manual—HEVC—https://hevc.hhi.fraunhofer.de/trac/hevc/export/HEAD/trunk/.../software-mauel.tex, Feb. 12, 2010 (Year: 2010). |
| Non-final office action U.S. Appl. No. 13/649,291 dated Aug. 7, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 20166104209015 dated Jun. 8, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104128323 dated Jun. 4, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104209369 dated Jun. 27, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104229593 dated Jul. 3, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104153556 dated Jul. 2, 2018. |
| Notification of the First Office Action Chinese Paten* Application No. 201610422988 dated Jul. 25, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105715736 dated Jul. 27, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107307594 dated Jul. 31, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016106709805 dated Jul. 31, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107392101 dated Aug. 2, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104109163 dated Jul. 31, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107368456 dated Aug. 2, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104212535 dated Aug. 10, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016106711237 dated Aug. 15, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104152074 dated Aug. 23, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 201610534834X dated Aug. 29, 2018. |
| Non-final Office Action U.S. Appl. No. 16/000,534 dated Sep. 28, 2018. |
| Non-final Office Action U.S. Appl. No. 16/017,453 dated Sep. 21, 2018. |
| Notice of Allowance U.S. Appl. No. 15/954,991 dated Oct. 29, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104151283 dated Sep. 3, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105347667 dated Sep. 4, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105710200 dated Sep. 6, 2018. |
| Notification of the first Office Action Chinese Patent Application No. 2016106716086 dated Aug. 31, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107368691 dated Sep. 10, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107392900 dated Sep. 14, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105700834 dated Sep. 12, 2018. |
| Office Action Taiwanese Patent Application No. 106105964 dated Oct. 2, 2018. |
| Notification of the first Office Action Chinese Patent Application No. 2016107307700 dated Sep. 25, 2018. |
| Notice of Allowance U.S. Appl. No. 13/650,635 dated Oct. 30, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016106700995 dated Sep. 26, 2018. |
| First Office Action Chinese Patent Application No. 201610736938.9 dated Oct. 29, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105337769 dated Sep. 28, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105336376 dated Oct. 8, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105318522 dated Sep. 27, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105341410 dated Sep. 27, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105343929 dated Sep. 28, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104149480 dated Sep. 30, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107368973 dated Sep. 28, 2018. |
| Jong Won Kim et al., “Video Coding with R-D Constrained Hierarchical Variable Block Size (VBS) Motion Estimation” Journal of Visual Communication and Image Representation vol. 9, No. 3, Sep. 1998, pp. 243-254. |
| Notification of the First Office Action Chinese Patent Application No. 2016107392205 dated Oct. 9, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 201610736815.5 dated Oct. 18, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105336874 dated Oct. 8, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016104150577 dated Oct. 12, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105710785 dated Oct. 9, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105337082 dated Oct. 8, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 201610410920X dated Oct. 17, 2018. |
| Notice of Allowance U.S. Appl. No. 15/940,839 dated Nov. 6, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107307382 dated Oct. 23, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016107392084 dated Oct. 10, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105337627 dated Oct. 12, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105310840 dated Oct. 16, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105323215 dated Nov. 8, 2018. |
| First Office Action Chinese Patent Application No. 2016107393176 dated Nov. 5, 2618. |
| Notice of Allowance U.S. Appl. No. 16/033,345 dated Nov. 8, 2018. |
| Office Action Chinese Patent Application No. 201610533982.X dated Nov. 21, 2018. |
| Office Action Taiwanese Patent Application No. 10721027110 dated Nov. 5, 2018. |
| Office Action Taiwanese Patent Application No. 10721027120 dated Nov. 5, 2018. |
| Non-final Office Action U.S. Appl. No. 13/649,251 dated Nov. 26, 2018. |
| Final Office Action U.S, U.S. Appl. No. 15/707,467 dated Nov. 27, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2016105339355 filed Nov. 21, 2018. |
| Final Office Action U.S. Appl. No. 15/940,879 dated Nov. 27, 2018. |
| Grant of Patent Korean Patent Application No. 10-2017-7331115 dated Dec. 10, 2018. |
| Non-final Office Action U.S. Appl. No. 16/148,417 dated Dec. 10, 2018. |
| Non-final Office Action U.S. Appl. No. 15/195,266 dated Dec. 21, 2018. |
| Final Office Action U.S. Appl. No. 13/649,251 dated Dec. 26, 2018. |
| Notice of Allowance U.S. Appl. No. 15/196,342 dated Jan. 8, 2019. |
| Muller, J.H., “Descriptions of sprite and prediction core experiments on coding efficiency in MPEG-4 Video”, 39. MPEG Meeting, Apr. 7-11, 1997, Bristol, No. M2139 pp. 1-136. |
| Extended European Search Report EP Application No. 18195953.7 dated Jan. 16, 2019. |
| Non-final Office Action U.S. Appl. No. 16/155,281 dated Jan. 24, 2019. |
| Non-final Office Action U.S. Appl. No. 16/197,210 dated Jan. 30, 2019. |
| Notice of Allowance U.S. Appl. No. 16/017,453 dated Feb. 13, 2019. |
| Non-final Office Action U.S. Appl. No. 16/197,154 dated Feb. 11, 2019. |
| Non-final Office Action U.S. Appl. No. 16/197,232 dated Feb. 28, 2019. |
| Non-final Office Action U.S. Appl. No. 16/261,823 dated Mar. 14, 2019. |
| Notice of Allowance U.S. Appl. No. 15/197,406 dated Feb. 11, 2019. |
| Notice of Allowance U.S. Appl. No. 13/649,251 dated Mar. 14, 2019. |
| Non-final Office Action U.S. Appl. No. 16/271,094 dated Mar. 22, 2019. |
| Extended European Search Report EP Application No. 18195956.0 dated Mar. 19, 2019. |
| Decision to Grant a Patent Korean Patent Application No. 10-2018-7017801 dated Mar. 22, 2019. |
| Second Office Action Chinese Patent Application No. 201610534733.2 dated Mar. 29, 2019. |
| Notice of Allowance U.S. Appl. No. 16/148,417 dated Apr. 2, 2019. |
| Notice of Allowance U.S. Appl. No. 16/155,281 dated Apr. 10, 2019. |
| Non-final Office Action dated Apr. 15, 2019 issued in corresponding U.S. Appl. No. 16/268,136. |
| Non-final Office Action U.S. Appl. No. 16/259,592 dated Mar. 22, 2019. |
| Grant of Patent Korean Patent Application No. 10-2018-7011962 dated Apr. 22, 2019. |
| Notification of Reasons for Refusal dated Jul. 4, 2018 issued in corresponding Korean Patent Application No. 10-2018-7011962. |
| Second Office Action dated Mar. 14, 2019 issued in corresponding Chinese Patent Application No. 2016106715736. |
| Final Office Action U.S. Appl. No. 15/195,266 dated Apr. 19, 2019. |
| Non-final Office Action U.S. Appl. No. 13/649,291 dated Apr. 22, 2019. |
| Final Office Action U.S. Appl. No. 16/000,534 dated Apr. 24, 2019. |
| Office Action Chinese Patent Application No. 201610535021.2 dated Apr. 30, 2019. |
| Notice of Allowance U.S. Appl. No. 15/707,467 dated May 22, 2019. |
| Notice of Allowance U.S. Appl. No. 16/155,281 dated Jun. 5, 2019. |
| Notice of Allowance U.S. Appl. No. 16/017,453 dated Jun. 6, 2019. |
| Notice of Allowance U.S. Appl. No. 16/197,210 dated Jun. 5, 2019. |
| Non-final Office Action U.S. Appl. No. 15/940,879 dated Jun. 6, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016106710785 dated May 21, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016105347667 dated May 17, 2019. |
| Second Office Action dated Jun. 6, 2019 Chinese Patent Application No. 201610736897.3. |
| Second Office Action dated Mar. 14, 2019 Chinese Patent Application No. 201610671573.6. |
| Notice of Allowance U.S. Appl. No. 15/197,406 dated Jun. 21, 2019. |
| Notice of Allowance U.S. Appl. No. 16/261,823 dated Jun. 21, 2019. |
| Second Office Action dated May 30, 2019 Chinese Patent Application No. 201610414948.0. |
| Third Office Action dated Jun. 12, 2019 Chinese Patent Application No. 201610671573.6. |
| Office Action Korean Patent Application No. 10-2019-7005877 dated Jun. 3, 2019. |
| Notification of Grant Chinese Patent Application No. 201610422988.X dated Jun. 11, 2019. |
| Second Office Action Chinese Patent Application No. 201610531084.0 dated Jun. 17, 2019. |
| Final Office Action U.S. Appl. No. 16/197,232 dated Jun. 21, 2019. |
| Non-final Office Action U.S. Appl. No. 16/376,671 dated Jun. 28, 2019. |
| Grant of Patent Chinese Patent Application No. 201610533776.9 dated Jun. 26, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 201610730738.2 dated Jun. 11, 2019. |
| Second Office Action Chinese Patent Application No. 201610410920.X dated Jun. 26, 2019. |
| Grant of Patent Korean Patent Application No. 10-2018-7027551 dated Jul. 3, 2019. |
| Grant of Patent Chinese Patent Application No. 201610415057.7 dated Jul. 4, 2019. |
| First Office Action Chinese Patent Application No. 201610730770.0 dated Jul. 11, 2019. |
| Office Action Chinese Patent Application No. 201610534392.9 dated Jul. 10, 2 019. |
| Office Action Chinese Patent Application No. 201610534141.0 dated Jul. 10, 2019. |
| Office Action Korean Patent Application No. 10-2018-7025913 dated Jul. 3, 2019. |
| Notice of Issuance Chinese Patent Application No. 201610533986.8 dated Jul. 9, 2019. |
| Second Office Action Chinese Patent Application No. 201610671079.X dated Jul. 10, 2019. |
| Grant of Patent Chinese Patent Application No. 201610533708.2 dated Jul. 3, 2019. |
| Grant of Patent Chinese Patent Application No. 201610533687.4 dated Jul. 3, 2019. |
| Second Office Action Chinese Patent Application No. 201610671123.7 dated Jul. 15, 2019. |
| Second Office Action Chinese Patent Application No. 201610670083.4 dated Jul. 3, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016105343929 dated Jul. 10, 2019. |
| Notice of Allowance Chinese Patent Application No. 201610415355.6 dated Jul. 16, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016107392084 dated Aug. 5, 2019. |
| Second Office Action Chinese Patent Application No. 201610739220.5 dated Aug. 5, 2019. |
| Notice of Issuance Chinese Patent Application No. 201610730759.4 dated Aug. 8, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016107392205 dated Aug. 5, 2019. |
| Notification of the Second Office Action Chinese Patent Application No. 2016107392900 dated Aug. 2, 2019. |
| Office Action dated Aug. 5, 2019 in Chinese Aoplication 2016107392084. |
| Notice of Issuance dated Aug. 6, 2019 in Chinese Application 201610532321.5. |
| Notice of Issuance dated Aug. 16, 2019 in Chinese Application 201610410916.3. |
| Notice of Allowance dated Aug. 19, 2019 in Taiwanese Application 106133751. |
| Notice of Allowance dated Aug. 19, 2019 in Taiwanese Application 106133750. |
| Notice of Allowance dated Aug. 19, 2019 in Taiwanese Application 106133748. |
| Notice of Allowance dated Aug. 20, 2019 in U.S. Appl. No. 13/650,635. |
| Notice of Allowance dated Aug. 21, 2019 in U.S. Appl. No. 15/413,852. |
| Notice of Issuance dated Aug. 29, 2019 in Chinese Application 201610412836.1. |
| Notice of Allowance dated Aug. 7, 2019 in U.S. Appl. No. 16/268,136. |
| Office Action dated Sep. 6, 2019 in Chinese Application 201610736815.5. |
| Office Acton dated Sep. 9, 2019 in Chinese Application 201610736938.9. |
| Office Action dated Aug. 13, 2019 in Korean Application 10-2019-7018213. |
| Office Action dated Sep. 3, 2019 in Chinese Application 201610670978.8. |
| Office Action dated Sep. 4, 2019 in Korean Application 10-2019-7021820. |
| Notice of Allowance dated Sep. 4, 2019 in Chinese Application 201610422931.X. |
| Office Action dated Sep. 16, 2019 in Chinese Application 201610533982.X. |
| Office Action dated Sep. 30, 2019 in Chinese Application 201610671122.2. |
| Office Action dated Oct. 9, 2019 in Chinese Application 201610535021.2. |
| Notice of Allowance dated Oct. 16, 2019 in U.S. Appl. No. 16/446,150. |
| Office Action dated Oct. 22, 2019 in Chinese Application 201610533637.6. |
| Notice of Issuance dated Oct. 28, 2019 in Chinese Patent Application 201610534733.2. |
| Notice of Allowance dated Oct. 21, 2019 in U.S. Appl. No. 16/376,671. |
| Office Action dated Nov. 7, 2019 in U.S. Appl. No. 15/195,266. |
| Office Action dated Sep. 24, 2019 in Japanese Patent Application 2018-165921. |
| Office Action dated Sep. 24, 2019 in Japanese Patent Application 2018-165922. |
| Notice of Allowance dated Oct. 28, 2019 in Chinese Application 2016107307664. |
| Notice of Issuance dated Oct. 30, 2019 in Chinese Application 201610534766.7. |
| Notice of Allowance dated Nov. 14, 2019 in U.S. Appl. No. 16/261,823. |
| Office Action dated Nov. 14, 2019 in U.S. Appl. No. 16/578,542. |
| Office Action dated Oct. 1, 2019 in Japanese Application 2018-165914. |
| Office Action dated Nov. 20, 2019 in U.S. Appl. No. 16/566,063. |
| Notice of Issuance dated Sep. 4, 2019 in Chinese Application 201610736897.3. |
| Office Action dated Nov. 21, 2019 in U.S. Appl. No. 16/000,534. |
| Notice of Issuance dated Nov. 22, 2019 in Chinese Application 201610420936.9. |
| Notice of Issuance dated Nov. 19, 2019 in Chinese Application 201610671573.6. |
| Notice of Allowance dated Nov. 27, 2019 in U.S. Appl. No. 15/259,592. |
| Notice of Allowance dated Oct. 23, 2019 in U.S. Appl. No. 16/561,427. |
| Notice of Issuance dated Dec. 3, 2019 in Chinese Application 2016107307683. |
| Office Action dated Dec. 4, 2019 in Chinese Application 201610414948.0. |
| Office Action dated Dec. 23, 2019 In U.S. Appl. No. 16/561,558. |
| Office Action dated Dec. 10, 2019 in Chinese Application 201610730738.2. |
| Office Action dated Dec. 10, 2019 in European Application 18195953.7. |
| Notice of Issuance dated Dec. 16, 2019 in Chinese Application 201610533637.6. |
| Notice of Issuance dated Dec. 24, 2019 in Chinese Application 201610534392.9. |
| Notice of Allowance dated Jan. 2, 2020 in U.S. Appl. No. 16/578,620. |
| Office Action dated Jan. 2, 2020 in U.S. Appl. No. 15/940,879. |
| Notice of Issuance dated Dec. 24, 2019 in Chinese Application 201610534141.0. |
| Office Action dated Dec. 17, 2019 in Korean Application 10-2019-7029076. |
| Notice of Issuance dated Dec. 27, 2019 in Chinese Application 201610671078.5. |
| Notice of Issuance dated Dec. 31, 2019 in Chinese Application 201610533982.X. |
| Office Action dated Dec. 25, 2019 in Chinese Application 201610736815.5. |
| Office Action dated Dec. 27, 2019 In Chinese Application 201610739290.0. |
| Office Action dated Jan. 2, 2020 in Chinese Application 201610531084.0. |
| Notice of Issuance dated Jan. 2, 2020 in Chinese Application 201610410920.X. |
| Office Action dated Jan. 8, 2020 in Chinese Application 201610671020.0. |
| Office Action dated Jan. 22, 2020 in U.S. Appl. No. 16/677,083. |
| Notice of Issuance dated Jan. 20, 2020 in Chinese Application 201610730770.0. |
| Office Action dated Jan. 23, 2020 in U.S. Appl. No. 16/686,558. |
| Notice of Issuance dated Jan. 22, 2020 in Chinese Patent Application 201610670083.4. |
| Office Action dated Jan. 19, 2020 in Chinese Patent Application 201610671079.X. |
| Office Action dated Jan. 28, 2020 in European Application 19185278.9. |
| Decision to Grant dated Jan. 21, 2020 in Korean Application 10-2019-7007867. |
| Office Action dated Feb. 11, 2020 in European Application 19187893.3. |
| Winken et al. Description of Video Coding Technology Proposal by Fraunhofer HHI, Joint Ccllaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 1st Meeting, Dresden DE, Apr. 15-23, 2010. |
| Marpe, D., et al., Video Compression Using Nested Quadtree Structures, Leaf Merging, and Improved Techniques for Motion Representation and Entropy Coding, IEEE Transactions on Circuits and Systems for Video Technology, 2010, vol. 20, No. 12, pp. 1675-1687. |
| Office Action dated Jan. 21, 2020 in Japanese Application 2019-033521. |
| Marco Tagliasacchi et al., Motion Estimation By Quadtree Pruning and Merging, Multimedia and Expo, 2006 IEEE International Conference on, Jul. 9, 2006, pp. 1861-1864. |
| Notice of Issuance dated Feb. 21, 2020 in Chinese Application 2016105350212. |
| Notice of Issuance dated Feb. 26, 2020 in Chinese Application 201610671123.7. |
| Hearing Notice issued Feb. 25, 2020 in Indian Patent Application 3089/KOLNP/2012. |
| Notice of Allowance dated Mar. 6, 2020 in U.S. Appl. No. 13/649,251. |
| Notice of Allowance dated Mar. 3, 2020 in U.S. Appl. No. 16/578,542. |
| Notice of Allowance dated Mar. 4, 2020 in U.S. Appl. No. 16/566,063. |
| Office Action dated Jan. 17, 2020 in Brazilian Application 11 2012 026400 1. |
| Notice of Issuance dated Mar. 3, 2020 in Chinese Application 201610736938.9. |
| Office Action dated Mar. 17, 2020 in U.S. Appl. 16/778,484. |
| Notice of Issuance dated Mar. 5, 2020 in Chinese Application 201610670978.8. |
| Office Action dated Mar. 23, 2020 in U.S. Appl. 16/247,834. |
| Notice of Allowance dated Mar. 19, 2020 in U.S. Appl. No. 16/664,031. |
| Notice of Allowance dated Mar. 25, 2020 in U.S. Appl. No. 16/197,232. |
| Notice of Allowance dated Mar. 25, 2020 in U.S. Appl. No. 13/649,291. |
| Notice of Allowance dated Mar. 26, 2020 in U.S. Appl. No. 15/195,266. |
| Office Action dated Mar. 3, 2020 in Korean Application 10-2020-7003599. |
| Notice of Issuance dated Mar. 12, 2020 in Chinese Application 201610739290.0. |
| Office Action dated Mar. 10, 2020 in Korean Application 10-2020-7004435. |
| Notice of Issuance dated Mar. 17, 2020 in Chinese Application 201610739208.4. |
| Decision to Grant dated Mar. 24, 2020 in Korean Application 10-2019-7006877. |
| Notice of Allowance dated Apr. 8, 2020 in U.S. Appl. No. 16/000,534. |
| Notice of Issuance dated Apr. 17, 2020 in Chinese Application 201610739220.5. |
| Notice of Issuance dated Apr. 9, 2020 in Chinese Application 201610736815.5. |
| Decision to Grant dated Apr. 24, 2020 in Korean Application 10-2019-7018213. |
| Decision to Grant dated Apr. 21, 2020 in Japanese Application 2018-165914. |
| Notice of Allowance dated Apr. 9, 2020 in U.S. Appl. No. 16/197,154. |
| Decision to Grant dated Apr. 21, 2020 in Japanese Application 2018-165921. |
| Decision to Grant dated Apr. 21, 2020 in Japanese Application 2018-165922. |
| Office Action dated Apr. 6, 2020 in Brazilian Application 11 2012 026383 8. |
| Office Action dated May 4, 2020 in European Application 20150595.5. |
| Notice of Allowance dated Apr. 9, 2020 in U.S. Appl. No. 16/561,558. |
| Notice of Allowance dated May 4, 2020 in U.S. Appl. No. 16/677,083. |
| Office Action dated Mar. 27, 2020 in Korean Application 10-2020-7004587. |
| Notice of Allowance dated May 7, 2020 in U.S. Appl. No. 16/686,558. |
| Notice of Allowance dated May 14, 2020 in U.S. Appl. No. 16/803,167. |
| Notification of Grant dated May 11, 2023 in Korean Application 10-2018-7026913. |
| Notice of Allowance dated May 19, 2020 in U.S. Appl. No. 15/413,852. |
| Office Action dated Jun. 2, 2020 in U.S. Appl. No. 16/855,266. |
| Notice of Issuance dated May 28, 2020 in Chinese Application 201610730738.2. |
| Office Action dated Jun. 4, 2020 in European Application 20155684.2. |
| Office Action dated May 29, 2020 in European Application 16173177.3. |
| Notice of Issuance dated Jun. 3, 2020 in Chinese Application 201610414948.0. |
| Notice of Allowance dated May 22, 2020 in Taiwanese Patent 108118367. |
| Office Action dated Jun. 16, 2020 in U.S. Appl. No. 15/940,879. |
| Office Action dated Jun. 3, 2020 in Chinese Application 201610671122.2. |
| Office Action dated May 18, 2020 in Brazilian Application 11 2012 026391 9. |
| Office Action dated Jul. 3, 202 in Korean Application 10-2020-7013818. |
| Office Action dated Jun. 15, 2020 in Taiwanese Application 109106524. |
| Hearing Notice issued Jul. 10, 2020 in Indian Application 3088/KOLNP/2012. |
| Office Action dated Jul. 22, 2020 in European Application 18195956.0. |
| Notice of Allowance dated Jul. 23, 2020 in Taiwanese Application 108113851. |
| Jerry D. Gibson, Wen-Whei Chang, “Fractional rate multitree speech coding”, IEEE Transactions On Communications, vol. 39, No. 6, Jun. 1991. |
| Notice of Allowance dated Jul. 2, 2020 in U.S. Appl. No. 16/778,484. |
| Office Action dated Jul. 27, 2020 in U.S. Appl. No. 16/907,861. |
| Notice of Allowance issued for CN 201610671608.6 dated May 5, 2019. |
| DeForni, IEEE International Conference, “On The Benefits of Leaf Merging in Quad-Tree Motion Models”, Sep. 14, 2005. |
| Final Office Action issued in corresponding U.S. Appl. No. 17/113,604 dated Jun. 17, 2022. |
| Extended European Search Report issued in corresponding European Patent Application 22 155 192.2-1208 dated Jul. 25, 2022. |
| Thomas Wiegand, editor, Text of Final Committee Draft of Joint Video Specification (ITU-T Rec. H.264I ISO/IEC 2 14496-10 AVC), International Organisation for Standardisation, ISO/IEC JTC1/SC29/WG11, Coding of Moving Pictures and Audio, Jul. 2002, Klagenfurt, AT, 207 pages. |
| Written Opposition issued in corresponding Japanese Patent Application No. 6909818 dated Jan. 28, 2022. |
| Office Action (Notice of Issuance) issued in corresponding Brazilian Patent Application BR 1220200076690 dated Apr. 5, 2022. |
| Office Action issued in corresponding Brazilian Patent Application BR 12202000791690 dated May 26, 2022. |
| Office Action (Notice of Issuance) issued in corresponding Brazilian Patent Application BR 1220200079207 dated Apr. 5, 2022. |
| Notice of Allowance issued in corresponding Brazilian Patent Application BR 11 2012 026393 5 dated May 26, 2022. |
| Office Action issued in corresponding Brazilian Patent Application BR 1220200079185 dated May 26, 2022. |
| Office Action (Notice of Issuance) issued in corresponding Brazilian Patent Application BR 12 2020 007668 2 dated Jun. 2, 2022. |
| Notice of Allowance issued in corresponding Taiwanese Patent Application No. 111117967 dated Jun. 13, 2022, with English translation. |
| Notice of Allowance issued in corresponding Taiwanese Patent Application No. 109136800 dated Jun. 27, 2022, with English translation. |
| Notice for Reasons for Revocation of Japanese Patent Application No. 2019-033521 issued in Japanese Patent Opposition No. 2022-700077 dated Jun. 30, 2022, with English translation. |
| Office Action (Decision to Grant a Patent) issued in corresponding Korean Patent Application No. 10-2021-7031920 dated Jul. 4, 2022, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2022-7003716 dated Apr. 25, 2022. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/211,013 dated Apr. 28, 2022. |
| Final Office Action issued in corresponding U.S. Appl. No. 17/211,013 dated May 25, 2022. |
| Decision of Dismissal of Amendment issued in corresponding Japanese Patent Application No. 2020-0887 44 dated Mar. 15, 2022. |
| Decision of Rejection issued in corresponding Japanese Patent Application No. 2020-088744 dated Mar. 15, 2022. |
| Notification of Reasons for Refusal issued in corresponding Japanese Patent Application No. 2021-028054 dated Mar. 22, 2022. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/020,622 dated Apr. 15, 2022. |
| Office Action and Search Report issued in corresponding Taiwanese Patent Application No. 109136800 dated Mar. 8, 2022, with English translation. |
| Notice of Allowance issued in corresponding Taiwan Patent Application No. 110121018 with English translation dated Feb. 15, 2022. |
| Non-Final Office Action issued in corresponding U.S. Appl. No. 17/211,013 dated Feb. 15, 2022. |
| Office Action issued In corresponding Brazilian Patent Application BR 12 2020 007668 2 dated Jan. 24, 2022. |
| Office Action issued in corresponding Brazilian Patent Application BR 12 2020 007663 1 dated Jan. 14, 2022. |
| Office Action issued in corresponding Brazilian Patent Application BR 12 2020 007669 2 dated Jan. 25, 2022. |
| Notifications of Request for Invalidation issued in corresponding Chinese Patent ZL 201610422931X dated Feb. 16, 2022. |
| ITU-T H.264 (Mar. 2009) Advanced Video Coding for Generic Audiovisual Services. |
| Office Action issued in corresponding Chinese Patent ZL 201610420998X dated Feb. 16, 2022. |
| Office Action issued in corresponding Chinese Patent ZL 201080067394.2 dated Feb. 16, 2022. |
| Office Action issued in corresponding Chinese Patent ZL201610412832.3 dated Feb. 16, 2022. |
| Notification of Granting a Patent Right in corresponding Korean Patent Application 10-2022-7001860 dated Mar. 2, 2022. |
| Nom-Final Office Action issued in corresponding U.S. Appl. No. 17/113,604 dated Dec. 21, 2021. |
| Final Office Action issued in corresponding U.S. Appl. No. 16/987,854 dated Jan. 27, 2022. |
| Office Action issued in corresponding Korean Patent Application 10-2021-7038705, dated Jan. 13, 2022. |
| Extended European Search Report issued in corresponding European Patent Application No. 21198748.2 dated Jan. 12, 2022. |
| Extended European Search Report issued in corresponding European Patent Application No. 21198746.6 dated Jan. 12, 2022. |
| Cheng-Tie Chen Ed—Institute of Electrical And Electronics Engineers: “Adaptive Transform Coding Via Quadlree-Based Variable Blocksize Del”, Multidimensional Signal Processing, Audio And Electroacousti Cs. Glasgow, May 23 J6, 1989; [International Conference On Acoustics, Speech & Signal Processin. Icassp], New York, IEEE, US, vol. 3, May 23, 1989 (May 23, 1989), pp. 1854-1857, XP000089238, ⋅ Section II. |
| Office Action issued in corresponding Brazilian Patent Application No. 1220200079207 dated Dec. 9, 2021, with English translation. |
| Office Action issued in corresponding Brazilian Patent Application No. 1220200079185 dated Dec. 9, 2021, with English translation. |
| Office Action issued in corresponding Indian Patent Application No. 201938026989 dated Oct. 14, 2021, with English translation. |
| Office Action issued in corresponding Indian Patent Application No. 20193802697 4 dated Oct. 14, 2021, with English translation. |
| Office Action issued in corresponding Brazilian Patent Application No. 112012026393 5 dated Dec. 9, 2021, with English translation. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 15/197,406 dated Dec. 1, 2020. |
| Office Action issued in corresponding U.S. Appl. No. 16/987,854 dated Aug. 17, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 17/113,604 dated Aug. 27, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 16/987,530 dated Sep. 16, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 16/747,834 dated Oct. 5, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 16/747,834 dated Oct. 21, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 17/065,934 dated Sep. 21, 2022. |
| Office Action (Notification of Grant) issued in corresponding Korean Patent Application 10-2022-7003716 dated Sep. 19, 2022. |
| Office Action issued in corresponding Korean Patent Application 10-2022-7034164 dated Oct. 21, 2022, with English translation. |
| Office Action issued in corresponding Taiwanese Patent Application 111134064 dated Oct. 26, 2022, with English translation. |
| Office Action issued in corresponding U.S. Appl. No. 17/202,622 dated Oct. 22, 2021. |
| Office Action (Notice of Issuance) issued in corresponding Brazilian Patent Application No. 11 2012 026383 8 dated Sep. 16, 2021. |
| Office Action (Notice of Allowance) issued in corresponding Taiwan Patent Application No. 110100258 dated Oct. 12, 2021. |
| Office Action issued in corresponding Indian Patent Application No. 202038010255 dated Oct. 27, 2021, with English translation. |
| Office Action issued in corresponding Indian Patent Application No. 201938026960 dated Jun. 28, 2021, with English translation. |
| Notification of Granting a Patent Right issued in corresponding Korean Patent Application No. 10-2020-7027094 dated Aug. 24, 2021. |
| Notice of Allowance issued in corresponding Korean Patent Application No. 10-2020-7023157 dated Sep. 6, 2021. |
| Final Office Action issued in corresponding U.S. Appl. No. 16/987,530 dated Feb. 25, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 17/113,604 dated Apr. 26, 2021 |
| Notice of Allowance issued in corresponding U.S. Appl. No. 16/988,120 dated May 28, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 16/988,120 dated Feb. 18, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 15/940,879 dated Apr. 9, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 15/940,879 dated Mar. 8, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 15/940,879 dated Feb. 18, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 15/940,879 dated Feb. 3, 2021. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 16/747,834 dated Dec. 16, 2020. |
| Office Action issued in corresponding U.S. Appl. No. 16/747,834 dated Mar. 19, 2021. |
| Final Office Action issued in corresponding U.S. Appl. No. 17/065,934 dated May 21, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 17/065,934 dated Jan. 21, 2021. |
| Notice of Allowance issued in corresponding Taiwanese Patent Application No. 109106524 dated Dec. 24, 2020, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2021-7002778 dated Mar. 9, 2021, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2021-7001014 dated Feb. 19, 2021, with English translation. |
| Office Action issued in corresponding Indian Patent Application No. 201938037063 dated Mar. 2, 2021, with English translation. |
| Notice of Allowance issued in corresponding Taiwanese Patent Application No. 109128744 dated Mar. 9, 2021, with English translation. |
| Office Action issued in corresponding Brazilian Patent Application No. BR 122020008236-4 dated Nov. 29, 2020. |
| Decision to Grant a Patent Application issued in corresponding Japanese Patent Application No. 2019-109392 dated Jan. 26, 2021, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7029023 dated Jan. 12, 2021, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7028960 dated Jan. 12, 2021, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7028322 dated Nov. 17, 2020, with English translation. |
| Notice of issuance issued in Brazilian Patent Application No. BR122020008249-6 dated Nov. 29, 2020. |
| Jong Won Kim et al., “Video Coding with R-D Constrained Hierarchical Variable Block Size (VBS) Motion Estimation”, Journal of Visual Communication and Image Representation, Academic Press, Inc., U.S. (Jan. 1, 1998), vol. 9. No. 3, DOI:10.1006/JVC1, 1998.0387, ISSN 1047-3203, pp. 243-254. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7028323 dated Dec. 16, 2020, with English translation. |
| Office Action issued in corresponding Indian Patent Application No. 201838048992 dated Dec. 21, 2020, with English translation. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7023157 dated Oct. 28, 2020, with English translation. |
| Notice of Allowance dated Aug. 10, 2020 in Taiwanese Application 109111740. |
| Office Action dated Jun. 30, 2020 in Japanese Application 2019-109392. |
| Notice of Issuance dated Aug. 20, 2020 in Brazilian Application 11 2012 026391 9. |
| Appeal Decision issued Sep. 15, 2020 in Japanese Application No. 2016-056526. |
| Notice of Allowance dated Jul. 27, 202 in U.S. Appl. No. 16/907,724. |
| Notice of Allowance dated Aug. 24, 202 in U.S. Appl. No. 13/649,291. |
| Office Action dated Sep. 10, 202 in U.S. Appl. No. 16/988,120. |
| Office Action dated Sep. 14, 202 in U.S. Appl. No. 16/987,530. |
| Office Action dated May 18, 2020 in Brazilian Application 11 2012 026393.5. |
| Notification of Grant dated Jun. 18, 2020 in Korean Application 10-2019-7021820. |
| Decision to Grant dated Jul. 3, 2020 in Korean Application 10-2020-7003599. |
| Notification of Grant dated Jul. 8, 2020 in Korean Application 10-2019-7029076. |
| Notification of Grant dated Jul. 8, 2020 in Korean Application 10-2019-7004587. |
| Notice of Issuance dated Jul. 10, 2020 in Chinese Application 201610671079.X. |
| Office Action dated Jul. 16, 2020 in European Application 20155683.4. |
| Office Action (Notice of Allowance) issued in corresponding Taiwanese Patent Application No. 111136719 dated Dec. 21, 2022, with English translation. |
| Final Office Action issued in corresponding U.S. Appl. No. 17/113,604 dated Dec. 27, 2022. |
| Office Action issued in corresponding U.S. Appl. No. 18/052,520 dated Jan. 6, 2023 (withdrawn). |
| Office Action issued in corresponding U.S. Appl. No. 18/052,616 dated Jan. 27, 2023. |
| Office Action issued in corresponding U.S. Appl. No. 18/052,520 dated Jan. 24, 2023. |
| Office Action issued in corresponding Japanese Patent Application 2022-151363 dated Dec. 13, 2022, with English translation. |
| Office Action issued in corresponding Korean Patent Application 10-2022-7034164 dated Jan. 10, 2023, with English translation. |
| Opponent's Written Opinion issued in corresponding Japanese Patent 6909818 dated Jan. 4, 2023. |
| Office Action (Notice of Allowance) issued in corresponding Taiwanese Patent Application No. 111134064 dated Feb. 16, 2023, with English translation. |
| Summons to attend Oral Proceedings issued in corresponding European Patent Application 18 195 953.7-1208 dated Feb. 17, 2023. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/211,013 dated Jan. 20, 2023. |
| Office Action issued in corresponding U.S. Appl. No. 18/052,718 dated Mar. 8, 2023. |
| Office Action issued in corresponding Indian Patent Application 202139017357 dated Mar. 31, 2023. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/346,904, dated Apr. 14, 2023. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 18/052,616 dated May 1, 2023. |
| Notification of Request for Invalidation issued in corresponding Chinese Patent ZL 2016104149480 dated Apr. 24, 2023. |
| Notice of Acceptance of Request for Invalidation issued in correponding Chinese Patent Application No. 201610670083.4 dated Jun. 6, 2023 (translation to follow). |
| Search Report issued in correponding Chinese Patent Application No. 201610670083.4 dated Feb. 28, 2020 (translation to follow). |
| Search Report issued in correponding Chinese Patent Application No. 201610670083.4 dated May 22, 2023 (translation to follow). |
| Notice of Acceptance of Request for Invalidation issued in correponding Chinese Patent Application No. 201610671078.5 dated Jun. 6, 2023 (translation to follow). |
| Search Report issued in correponding Chinese Patent Application No. 201610671078.5 dated Mar. 24, 2020 (translation to follow). |
| Search Report issued in correponding Chinese Patent Application No. 201610671078.5 dated May 22, 2023 (translation to follow). |
| Notice of Acceptance of Request for Invalidation issued in correponding Chinese Patent Application No. 201610671079.X dated Jun. 6, 2023 (translation to follow). |
| Search Report issued in correponding Chinese Patent Application No. 201610671079.X dated May 19, 2023 (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 201610671079.X dated Sep. 11, 2020 (translation to follow). |
| Notice of Allowance issued in corresponding Taiwanese Patent Application No. 111103939 dated May 22, 2023, with English translation. |
| Notice of Acceptance Request for Invalidation issued in corresponding Chinese Patent Application No. 201610671020.0 dated Jun. 20, 2023 (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 201610671020.0 dated Sep. 11, 2020 (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 201610671020.0 dated Jun. 5, 2023 (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 201610671020.0 dated May 19, 2023, 2 pages (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 201610671020.0 dated May 19, 2023, 71 pages (translation to follow). |
| Search Report issued in corresponding Chinese Patent Application No. 112115708 dated Jun. 1, 2023, English translation only. |
| Office Action issued in corresponding Brazilian Patent Application No. BR122020007663-1 dated May 19, 2023 (translation to follow). |
| Final Office Action issued in corresponding U.S. Appl. No. 18/052,520 dated Jun. 26, 2023. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/113,604 dated Jun. 30, 2023. |
| Summons to attend oral proceedings pursuant to Rule 115(1) issued in corresponding European Patent Application No. 20 155 684.2 dated Jul. 18, 2023. |
| Extended European Search Report issued in corresponding European Patent Application No. 23 177 811.9-1208 dated Jul. 14, 2023. |
| Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL 2016 1 0670978.8 dated Jun. 27, 2023. |
| Search Report and Supplementary Invalidation Request issued in corresponding Chinese Patent Application No. ZL 2016 1 0670978.8 dated May 22, 2023. |
| English translation of Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL2016106700834 dated Jun. 26, 2023 (Action previously submitted Jun. 30, 2023) |
| English translation of Supplementary Invalidation Request issued in corresponding Chinese Patent Application No. ZL2016106700834 (Action previously submitted Jun. 30, 2023) |
| English translation of Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL 2016 1 0671078.5 dated Jun. 6, 2023 (Action previously submitted Jun. 30, 2023). |
| English translation of Supplementary Invalidation Request issued in corresponding Chinese Patent Application No. ZL 2016 1 0671078.5 (Action previously submitted Jun. 30, 2023). |
| English translation of Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL 2016 1 0671079.X dated Jun. 6, 2023 (Action previously submitted Jun. 30, 2023). |
| English translation of Supplementary Invalidation Request issued in corresponding Chinese Patent Application No. ZL 2016 1 0671079.X (Action previously submitted Jun. 30, 2023). |
| English translation of Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL 2016 1 0671020.0 dated Jun. 20, 2023 (Action previously submitted June 30, 2023). |
| English translation of Supplementary Invalidation Request issued in corresponding Chinese Patent Application No. ZL 2016 1 0671020.0 (Action previously submitted Jun. 30, 2023). |
| Notification of Acceptance of Request for Invalidation issued in corresponding Chinese Patent Application No. ZL 2016 1 0410920.X dated May 24, 2023, with English translation. |
| Search Report issued in corresponding Chinese Patent Application No. ZL 2016 1 0410920.X dated Mar. 27, 2020. |
| Number | Date | Country | |
|---|---|---|---|
| 20230099885 A1 | Mar 2023 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17346904 | Jun 2021 | US |
| Child | 18052491 | US | |
| Parent | 16907861 | Jun 2020 | US |
| Child | 17346904 | US | |
| Parent | 16578542 | Sep 2019 | US |
| Child | 16907861 | US | |
| Parent | 16261823 | Jan 2019 | US |
| Child | 16578542 | US | |
| Parent | 13650635 | Oct 2012 | US |
| Child | 16261823 | US | |
| Parent | PCT/EP2011/055795 | Apr 2011 | US |
| Child | 13650635 | US |
