Patent Grant
11533485
The present invention is concerned with an entropy coding concept for coding video data.
Many video codecs are known in the art. Generally, these codecs reduce the amount of data necessitated in order to represent the video content, i.e. they compress the data. In the context of video coding, it is known that the compression of the video data is advantageously achieved by sequentially applying different coding techniques: motion-compensated prediction is used in order to predict the picture content. The motion vectors determined in motion-compensated prediction as well as the prediction residuum are subject to lossless entropy coding. In order to further reduce the amount of data, the motion vectors themselves are subject to prediction so that merely motion vector differences representing the motion vector prediction residuum, have to be entropy encoded. In H.264, for example, the just-outlined procedure is applied in order to transmit the information on motion vector differences. In particular, the motion vector differences are binarized into bin strings corresponding to a combination of a truncated unary code and, from a certain cutoff value on, an exponential Golomb code. While the bins of the exponential Golomb code are easily coded using an equi-probability bypass mode with fixed probability of 0.5, several contexts are provided for the first bins. The cutoff value is chosen to be nine. Accordingly, a high amount of contexts is provided for coding the motion vector differences.
Providing a high number of contexts, however, not only increases coding complexity, but may also negatively affect the coding efficiency: if a context is visited too rarely, the probability adaptation, i.e. the adaptation of the probability estimation associated with the respective context during the cause of entropy coding, fails to perform effectively. Accordingly, the probability estimations applied inappropriately estimate the actual symbol statistics. Moreover, if for a certain bin of the binarization, several contexts are provided, the selection thereamong may necessitate the inspection of neighboring bins/syntax element values whose necessity may hamper the execution of the decoding process. On the other hand, if the number of contexts is provided too low, bins of highly varying actual symbol statistics are grouped together within one context and accordingly, the probability estimation associated with that context fails to effectively encode the bins associated therewith.
There is an ongoing need to further increase the coding efficiency of entropy coding of motion vector differences.
According to an embodiment, a decoder for decoding a video from a data stream into which horizontal and vertical components of motion vector differences are coded using binarizations of the horizontal and vertical components, the binarizations equaling a truncated unary code of the horizontal and vertical components, respectively, within a first interval of the domain of the horizontal and vertical components below a cutoff value, and a combination of a prefix in form of the truncated unary code for the cutoff value and a suffix in form of a Exp-Golomb code of the horizontal and vertical components, respectively, within a second interval of the domain of the horizontal and vertical components inclusive and above the cutoff value, wherein the cutoff value is two and the Exp-Golomb code has order one, may have: an entropy decoder configured to, for the horizontal and vertical components of the motion vector differences, derive the truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for the horizontal and vertical components of the motion vector differences, and the Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences; a desymbolizer configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences; a reconstructor configured to reconstruct the video based on the integer values of the horizontal and vertical components of the motion vector differences.
According to another embodiment, an encoder for encoding a video into a data stream may have: a constructor configured to predictively code the video by motion compensated prediction using motion vectors and predictively coding the motion vectors by predicting the motion vectors and setting integer values of horizontal and vertical components of motion vector differences to represent a prediction error of the predicted motion vectors; a symbolizer configured to binarize the integer values to obtain binarizations of the horizontal and vertical components of the motion vector differences, the binarizations equaling a truncated unary code of the horizontal and vertical components, respectively, within a first interval of the domain of the horizontal and vertical components below a cutoff value, and a combination of a prefix in form of the truncated unary code for the cutoff value and a suffix in form of a Exp-Golomb code of the horizontal and vertical components, respectively, within a second interval of the domain of the horizontal and vertical components inclusive and above the cutoff value, wherein the cutoff value is two and the Exp-Golomb code has order one; and an entropy encoder configured to, for the horizontal and vertical components of the motion vector differences, encode the truncated unary code into the data stream using context-adaptive binary entropy encoding with exactly one context per bin position of the truncated unary code, which is common for the horizontal and vertical components of the motion vector differences, and the Exp-Golomb code using a constant equi-probability bypass mode.
According to another embodiment, a method for decoding a video from a data stream into which horizontal and vertical components of motion vector differences are coded using binarizations of the horizontal and vertical components, the binarizations equaling a truncated unary code of the horizontal and vertical components, respectively, within a first interval of the domain of the horizontal and vertical components below a cutoff value, and a combination of a prefix in form of the truncated unary code for the cutoff value and a suffix in form of a Exp-Golomb code of the horizontal and vertical components, respectively, within a second interval of the domain of the horizontal and vertical components inclusive and above the cutoff value, wherein the cutoff value is two and the Exp-Golomb code has order one, may have the steps of: for the horizontal and vertical components of the motion vector differences, deriving the truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for the horizontal and vertical components of the motion vector differences, and the Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences; debinarizing the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences; reconstructing the video based on the integer values of the horizontal and vertical components of the motion vector differences. According to another embodiment, a method for encoding a video into a data stream may have the steps of: predictively coding the video by motion compensated prediction using motion vectors and predictively coding the motion vectors by predicting the motion vectors and setting integer values of horizontal and vertical components of motion vector differences to represent a prediction error of the predicted motion vectors; binarizing the integer values to obtain binarizations of the horizontal and vertical components of the motion vector differences, the binarizations equaling a truncated unary code of the horizontal and vertical components, respectively, within a first interval of the domain of the horizontal and vertical components below a cutoff value, and a combination of a prefix in form of the truncated unary code for the cutoff value and a suffix in form of a Exp-Golomb code of the horizontal and vertical components, respectively, within a second interval of the domain of the horizontal and vertical components inclusive and above the cutoff value, wherein the cutoff value is two and the Exp-Golomb code has order one; and for the horizontal and vertical components of the motion vector differences, encoding the truncated unary code into the data stream using context-adaptive binary entropy encoding with exactly one context per bin position of the truncated unary code, which is common for the horizontal and vertical components of the motion vector differences, and the Exp-Golomb code using a constant equi-probability bypass mode.
Another embodiment may have a computer program having a program code for performing, when running on a computer, the inventive methods.
A basic finding of the present invention is that the coding efficiency of entropy coding of motion vector differences may further be increased by reducing the cutoff value up to which the truncated unary code is used in order to binarize the motion vector differences, down to two so that there are merely two bin positions of the truncated unary code, and if an order of one is used for the exponential Golomb code for the binarization of the motion vector differences from the cutoff value on and if, additionally, exactly one context is provided for the two bin positions of the truncated unary code, respectively, so that context selection based on bins or syntax element values of neighboring image blocks is not necessitated and a too fine classification of the bins at these bin positions into contexts is avoided so that probability adaptation works properly, and if the same contexts are used for horizontal and vertical components thereby further reducing the negative effects of a too fine context subdivison.
Further, it has been found out that the just-mentioned settings with regard to the entropy coding of motion vector differences is especially valuable when combining same with advanced methods of predicting the motion vectors and reducing the necessitated amount of motion vector differences to be transmitted. For example, multiple motion vector predictors may be provided so as to obtain an ordered list of motion vector predictors, and an index into this list of motion vector predictors may be used so as to determine the actual motion vector predictor the prediction residual of which is represented by the motion vector difference in question. Although the information on the list index used has to be derivable from the data stream at the decoding side, the overall prediction quality of the motion vectors is increased and accordingly, the magnitude of the motion vector differences is further reduced so that altogether, the coding efficiency is increased further and the reduction of the cutoff value and the common use of the context for horizontal and vertical components of the motion vector differences fits to such an improved motion vector prediction. On the other hand, merging may be used in order to reduce the number of motion vector differences to be transmitted within the data stream: to this end, merging information may be conveyed within the data stream signaling to the decoder blocks of a subdivision of blocks which are grouped into a group of blocks. The motion vector differences may then be transmitted within the data stream in units of these merged groups instead of the individual blocks, thereby reducing the number of motion vector differences having to be transmitted. As this clustering of blocks reduces the inter-correlation between neighboring motion vector differences, the just-mentioned omittance of the provision of several contexts for one bin position prevents the entropy coding scheme from a too fine classification into contexts depending on neighboring motion vector differences. Rather, the merging concept already exploits the inter-correlation between motion vector differences of neighboring blocks and accordingly, one context for one bin position—the same for horizontal and vertical components—is sufficient.
Embodiments of the present invention will be detailed subsequently referring to the appended drawings, in which:
It is noted that during the description of the figures, elements occurring in several of these Figures are indicated with the same reference sign in each of these Figures and a repeated description of these elements as far as the functionality is concerned is avoided in order to avoid unnecessitated repetitions. Nevertheless, the functionalities and descriptions provided with respect to one figure shall also apply to other Figures unless the opposite is explicitly indicated.
In the following, firstly, embodiments of a general video coding concept are described, with respect to
The encoder encodes an array of information samples 20 into a data stream. The array of information samples may represent information samples corresponding to, for example, brightness values, color values, luma values, chroma values or the like. However, the information samples may also be depth values in case of the sample array 20 being a depth map generated by, for example, a time of light sensor or the like.
The encoder 10 is a block-based encoder. That is, encoder 10 encodes the sample array 20 into the data stream 30 in units of blocks 40. The encoding in units of blocks 40 does not necessarily mean that encoder 10 encodes these blocks 40 totally independent from each other. Rather, encoder 10 may use reconstructions of previously encoded blocks in order to extrapolate or intra-predict remaining blocks, and may use the granularity of the blocks for setting coding parameters, i.e. for setting the way each sample array region corresponding to a respective block is coded.
Further, encoder 10 is a transform coder. That is, encoder 10 encodes blocks 40 by using a transform in order to transfer the information samples within each block 40 from spatial domain into spectral domain. A two-dimensional transform such as a DCT of FFT or the like may be used. The blocks 40 are of quadratic shape or rectangular shape.
The sub-division of the sample array 20 into blocks 40 shown in
However, several alternatives are possible. For example, the blocks may overlap each other. The overlapping may, however, be restricted to such an extent that each block has a portion not overlapped by any neighboring block, or such that each sample of the blocks is overlapped by, at the maximum, one block among the neighboring blocks arranged in juxtaposition to the current block along a predetermined direction. The latter would mean that the left and right hand neighbor blocks may overlap the current block so as to fully cover the current block but they may not overlay each other, and the same applies for the neighbors in vertical and diagonal direction.
As a further alternative, the sub-division of sample array 20 into blocks 40 may be adapted to the content of the sample array 20 by the encoder 10 with the sub-division information on the sub-division used being transferred to the decoder side via bitstream 30.
Instead of a quadtree-based sub-division a more general multi tree-based sub-division may be used and the number of child nodes per hierarchy level may differ between different hierarchy levels.
Encoder 10 and decoder 50 may be configured to perform entropy encoding/decoding in order to insert the information on the transform coefficient blocks into, and extract this information from the data stream, respectively. Details in this regard in accordance with different embodiments are described later. It should be noted that the data stream 30 not necessarily comprises information on transform coefficient blocks for all the blocks 40 of the sample array 20. Rather, as sub-set of blocks 40 may be coded into the bitstream 30 in another way. For example, encoder 10 may decide to refrain from inserting a transform coefficient block for a certain block of blocks 40 with inserting into the bitstream 30 alternative coding parameters instead which enable the decoder 50 to predict or otherwise fill the respective block in the reconstructed version 60. For example, encoder 10 may perform a texture analysis in order to locate blocks within sample array 20 which may be filled at the decoder side by decoder by way of texture synthesis and indicate this within the bitstream accordingly.
As discussed with respect to the following Figures, the transform coefficient blocks not necessarily represent a spectral domain representation of the original information samples of a respective block 40 of the sample array 20. Rather, such a transform coefficient block may represent a spectral domain representation of a prediction residual of the respective block 40.
The coder of
That is, in accordance with the embodiment of
It should be noted that several alternatives exist for the embodiment of
It should be noted that in the above-described embodiments, the spatial granularity at which the prediction and the transformation of the residual is performed, do not have to be equal to each other. This is shown in
The above embodiments have in common that a block of (residual or original) samples is to be transformed at the encoder side into a transform coefficient block which, in turn, is to be inverse transformed into a reconstructed block of samples at the decoder side. This is illustrated in
As already noted above, it may be seen from
All the encoders and decoders described above, are, thus, configured to deal with a certain syntax of syntax elements. That is, the afore-mentioned syntax elements such as the transform coefficient levels, syntax elements concerning the significance map of transform blocks, the motion data syntax elements concerning inter-prediction blocks and so on are assumed to be sequentially arranged within the data stream in a prescribed way. Such a prescribed way may be represented in form of a pseudo code as it is done, for example, in the H.264 standard or other video codecs.
In even other words, the above description, primarily dealt with the conversion of media data, here exemplarily video data, to a sequence of syntax elements in accordance with a predefined syntax structure prescribing certain syntax element types, its semantics and the order among them. The entropy encoder and entropy decoder of
An entropy encoder according to an embodiment is illustrated in
In an embodiment of the invention, each syntax element 301 is associated with a category of a set of one or more categories, i.e. a syntax element type. As an example, the categories can specify the type of the syntax element. In the context of hybrid video coding, a separate category may be associated with macroblock coding modes, block coding modes, reference picture indices, motion vector differences, subdivision flags, coded block flags, quantization parameters, transform coefficient levels, etc. In other application areas such as audio, speech, text, document, or general data coding, different categorizations of syntax elements are possible.
In general, each syntax element can take a value of a finite or countable infinite set of values, where the set of possible syntax element values can differ for different syntax element categories. For example, there are binary syntax elements as well as integer-valued ones.
For reducing the complexity of the encoding and decoding algorithm and for allowing a general encoding and decoding design for different syntax elements and syntax element categories, the syntax elements 301 are converted into ordered sets of binary decisions and these binary decisions are then processed by simple binary coding algorithms. Therefore, the binarizer 302 bijectively maps the value of each syntax element 301 onto a sequence (or string or word) of bins 303. The sequence of bins 303 represents a set of ordered binary decisions. Each bin 303 or binary decision can take one value of a set of two values, e.g. one of the values 0 and 1. The binarization scheme can be different for different syntax element categories. The binarization scheme for a particular syntax element category can depend on the set of possible syntax element values and/or other properties of the syntax element for the particular category.
Table 1 illustrates three example binarization schemes for countable infinite sets. Binarization schemes for countable infinite sets can also be applied for finite sets of syntax element values. In particular for large finite sets of syntax element values, the inefficiency (resulting from unused sequences of bins) can be negligible, but the universality of such binarization schemes provides an advantage in terms of complexity and memory requirements. For small finite sets of syntax element values, it is often advantageous (in terms of coding efficiency) to adapt the binarization scheme to the number of possible symbol values.
Table 2 illustrates three example binarization schemes for finite sets of 8 values. Binarization schemes for finite sets can be derived from the universal binarization schemes for countable infinite sets by modifying some sequences of bins in a way that the finite sets of bin sequences represent a redundancy-free code (and potentially reordering the bin sequences). As an example, the truncated unary binarization scheme in Table 2 was created by modifying the bin sequence for the syntax element 7 of the universal unary binarization (see Table 1). The truncated and reordered Exp-Golomb binarization of order 0 in Table 2 was created by modifying the bin sequence for the syntax element 7 of the universal Exp-Golomb order 0 binarization (see Table 1) and by reordering the bin sequences (the truncated bin sequence for symbol 7 was assigned to symbol 1). For finite sets of syntax elements, it is also possible to use non-systematic/non-universal binarization schemes, as exemplified in the last column of Table 2.
Each bin 303 of the sequence of bins created by the binarizer 302 is fed into the parameter assigner 304 in sequential order. The parameter assigner assigns a set of one or more parameters to each bin 303 and outputs the bin with the associated set of parameters 305. The set of parameters is determined in exactly the same way at encoder and decoder. The set of parameters may consist of one or more of the following parameters:
In particular, parameter assigner 304 may be configured to assign to a current bin 303 a context model. For example, parameter assigner 304 may select one of available context indices for the current bin 303. The available set of contexts for a current bin 303 may depend on the type of the bin which, in turn, may be defined by the type/category of the syntax element 301, the binarization of which the current bin 303 is part of, and a position of the current bin 303 within the latter binarization. The context selection among the available context set may depend on previous bins and the syntax elements associated with the latter. Each of these contexts has a probability model associated therewith, i.e. a measure for an estimate of the probability for one of the two possible bin values for the current bin. The probability model may in particular be a measure for an estimate of the probability for the less probable or more probable bin value for the current bin, with a probability model additionally being defined by an identifier specifying an estimate for which of the two possible bin values represents the less probable or more probable bin value for the current bin 303. In case of merely one context being available for the current bin, the context selection may be left away. As will be outlined in more detail below, parameter assigner 304 may also perform a probability model adaptation in order to adapt the probability models associated with the various contexts to the actual bin statistics of the respective bins belonging to the respective contexts.
As will also be described in more detail below, parameter assigner 304 may operate differently depending on a high efficiency (HE) mode or low complexity (LC) mode being activated. In both modes the probability model associates the current bin 303 to any of the bin encoders 310 as will be outlined below, but the mode of operation of the parameter assigner 304 tends to be less complex in the LC mode with, however, the coding efficiency being increased in the high efficiency mode due to the parameter assigner 304 causing the association of the individual bins 303 to the individual encoders 310 to be more accurately adapted to the bin statistics, thereby optimizing the entropy relative to the LC mode.
Each bin with an associated set of parameters 305 that is output of the parameter assigner 304 is fed into a bin buffer selector 306. The bin buffer selector 306 potentially modifies the value of the input bin 305 based on the input bin value and the associated parameters 305 and feeds the output bin 307—with a potentially modified value—into one of two or more bin buffers 308. The bin buffer 308 to which the output bin 307 is sent is determined based on the value of the input bin 305 and/or the value of the associated parameters 305.
In an embodiment of the invention, the bin buffer selector 306 does not modify the value of the bin, i.e., the output bin 307 has the same value as the input bin 305. In a further embodiment of the invention, the bin buffer selector 306 determines the output bin value 307 based on the input bin value 305 and the associated measure for an estimate of the probability for one of the two possible bin values for the current bin. In an embodiment of the invention, the output bin value 307 is set equal to the input bin value 305 if the measure for the probability for one of the two possible bin values for the current bin is less than (or less than or equal to) a particular threshold; if the measure for the probability for one of the two possible bin values for the current bin is greater than or equal to (or greater than) a particular threshold, the output bin value 307 is modified (i.e., it is set to the opposite of the input bin value). In a further embodiment of the invention, the output bin value 307 is set equal to the input bin value 305 if the measure for the probability for one of the two possible bin values for the current bin is greater than (or greater than or equal to) a particular threshold; if the measure for the probability for one of the two possible bin values for the current bin is less than or equal to (or less than) a particular threshold, the output bin value 307 is modified (i.e., it is set to the opposite of the input bin value). In an embodiment of the invention, the value of the threshold corresponds to a value of 0.5 for the estimated probability for both possible bin values.
In a further embodiment of the invention, the bin buffer selector 306 determines the output bin value 307 based on the input bin value 305 and the associated identifier specifying an estimate for which of the two possible bin values represents the less probable or more probable bin value for the current bin. In an embodiment of the invention, the output bin value 307 is set equal to the input bin value 305 if the identifier specifies that the first of the two possible bin values represents the less probable (or more probable) bin value for the current bin, and the output bin value 307 is modified (i.e., it is set to the opposite of the input bin value) if identifier specifies that the second of the two possible bin values represents the less probable (or more probable) bin value for the current bin.
In an embodiment of the invention, the bin buffer selector 306 determines the bin buffer 308 to which the output bin 307 is sent based on the associated measure for an estimate of the probability for one of the two possible bin values for the current bin. In an embodiment of the invention, the set of possible values for the measure for an estimate of the probability for one of the two possible bin values is finite and the bin buffer selector 306 contains a table that associates exactly one bin buffer 308 with each possible value for the estimate of the probability for one of the two possible bin values, where different values for the measure for an estimate of the probability for one of the two possible bin values can be associated with the same bin buffer 308. In a further embodiment of the invention, the range of possible values for the measure for an estimate of the probability for one of the two possible bin values is partitioned into a number of intervals, the bin buffer selector 306 determines the interval index for the current measure for an estimate of the probability for one of the two possible bin values, and the bin buffer selector 306 contains a table that associates exactly one bin buffer 308 with each possible value for the interval index, where different values for the interval index can be associated with the same bin buffer 308. In an embodiment of the invention, input bins 305 with opposite measures for an estimate of the probability for one of the two possible bin values (opposite measure are those which represent probability estimates P and 1−P) are fed into the same bin buffer 308. In a further embodiment of the invention, the association of the measure for an estimate of the probability for one of the two possible bin values for the current bin with a particular bin buffer is adapted over time, e.g. in order to ensure that the created partial bitstreams have similar bit rates. Further below, the interval index will also be called pipe index, while the pipe index along with a refinement index and a flag indicating the more probable bin value indexes the actual probability model, i.e. the probability estimate.
In a further embodiment of the invention, the bin buffer selector 306 determines the bin buffer 308 to which the output bin 307 is sent based on the associated measure for an estimate of the probability for the less probable or more probable bin value for the current bin. In an embodiment of the invention, the set of possible values for the measure for an estimate of the probability for the less probable or more probable bin value is finite and the bin buffer selector 306 contains a table that associates exactly one bin buffer 308 with each possible value of the estimate of the probability for the less probable or more probable bin value, where different values for the measure for an estimate of the probability for the less probable or more probable bin value can be associated with the same bin buffer 308. In a further embodiment of the invention, the range of possible values for the measure for an estimate of the probability for the less probable or more probable bin value is partitioned into a number of intervals, the bin buffer selector 306 determines the interval index for the current measure for an estimate of the probability for the less probable or more probable bin value, and the bin buffer selector 306 contains a table that associates exactly one bin buffer 308 with each possible value for the interval index, where different values for the interval index can be associated with the same bin buffer 308. In a further embodiment of the invention, the association of the measure for an estimate of the probability for the less probable or more probable bin value for the current bin with a particular bin buffer is adapted over time, e.g. in order to ensure that the created partial bitstreams have similar bit rates.
Each of the two or more bin buffers 308 is connected with exactly one bin encoder 310 and each bin encoder is only connected with one bin buffer 308. Each bin encoder 310 reads bins from the associated bin buffer 308 and converts a sequence of bins 309 into a codeword 311, which represents a sequence of bits. The bin buffers 308 represent first-in-first-out buffers; bins that are fed later (in sequential order) into a bin buffer 308 are not encoded before bins that are fed earlier (in sequential order) into the bin buffer. The codewords 311 that are output of a particular bin encoder 310 are written to a particular partial bitstream 312. The overall encoding algorithm converts syntax elements 301 into two or more partial bitstreams 312, where the number of partial bitstreams is equal to the number of bin buffers and bin encoders. In an embodiment of the invention, a bin encoder 310 converts a variable number of bins 309 into a codeword 311 of a variable number of bits. One advantage of the above- and below-outlined embodiments of the invention is that the encoding of bins can be done in parallel (e.g. for different groups of probability measures), which reduces the processing time for several implementations.
Another advantage of embodiments of the invention is that the bin encoding, which is done by the bin encoders 310, can be specifically designed for different sets of parameters 305. In particular, the bin encoding and encoding can be optimized (in terms of coding efficiency and/or complexity) for different groups of estimated probabilities. On the one hand side, this allows a reduction of the encoding/decoding complexity, and on the other hand side, it allows an improvement of the coding efficiency. In an embodiment of the invention, the bin encoders 310 implement different encoding algorithms (i.e. mapping of bin sequences onto codewords) for different groups of measures for an estimate of the probability for one of the two possible bin values 305 for the current bin. In a further embodiment of the invention, the bin encoders 310 implement different encoding algorithms for different groups of measures for an estimate of the probability for the less probable or more probable bin value for the current bin.
In an embodiment of the invention, the bin encoders 310—or one or more of the bin encoders—represent entropy encoders that directly map sequences of input bins 309 onto codewords 310. Such mappings can be efficiently implemented and don't necessitate a complex arithmetic coding engine. The inverse mapping of codewords onto sequences of bins (as done in the decoder) should to be unique in order to guarantee perfect decoding of the input sequence, but the mapping of bin sequences 309 onto codewords 310 doesn't necessarily need to be unique, i.e., it is possible that a particular sequence of bins can be mapped onto more than one sequence of codewords. In an embodiment of the invention, the mapping of sequences of input bins 309 onto codewords 310 is bijective. In a further embodiment of the invention, the bin encoders 310—or one or more of the bin encoders—represent entropy encoders that directly map variable-length sequences of input bins 309 onto variable-length codewords 310. In an embodiment of the invention, the output codewords represent redundancy-free codes such as general huffman codes or canonical huffman codes.
Two examples for the bijective mapping of bin sequences to redundancy-free codes are illustrated in Table 3. In a further embodiment of the invention, the output codewords represent redundant codes suitable for error detection and error recovery. In a further embodiment of the invention, the output codewords represent encryption codes suitable for encrypting the syntax elements.
In a further embodiment of the invention, the bin encoders 310—or one or more of the bin encoders—represent entropy encoders that directly map variable-length sequences of input bins 309 onto fixed-length codewords 310. In a further embodiment of the invention, the bin encoders 310—or one or more of the bin encoders—represent entropy encoders that directly map fixed-length sequences of input bins 309 onto variable-length codewords 310.
The decoder according an embodiment of the invention is illustrated in
The decoding of a syntax element is triggered by a request for a new decoded syntax element 313 that is sent to the binarizer 314. In an embodiment of the invention, each request for a new decoded syntax element 313 is associated with a category of a set of one or more categories. The category that is associated with a request for a syntax element is the same as the category that was associated with the corresponding syntax element during encoding.
The binarizer 314 maps the request for a syntax element 313 into one or more requests for a bin that are sent to the parameter assigner 316. As final response to a request for a bin that is sent to the parameter assigner 316 by the binarizer 314, the binarizer 314 receives a decoded bin 326 from the bin buffer selector 318. The binarizer 314 compares the received sequence of decoded bins 326 with the bin sequences of a particular binarization scheme for the requested syntax element and, if the received sequence of decoded bins 26 matches the binarization of a syntax element, the binarizer empties its bin buffer and outputs the decoded syntax element as final response to the request for a new decoded symbol. If the already received sequence of decoded bins does not match any of the bin sequences for the binarization scheme for the requested syntax element, the binarizer sends another request for a bin to the parameter assigner until the sequence of decoded bins matches one of the bin sequences of the binarization scheme for the requested syntax element. For each request for a syntax element, the decoder uses the same binarization scheme that was used for encoding the corresponding syntax element. The binarization scheme can be different for different syntax element categories. The binarization scheme for a particular syntax element category can depend on the set of possible syntax element values and/or other properties of the syntax elements for the particular category.
The parameter assigner 316 assigns a set of one or more parameters to each request for a bin and sends the request for a bin with the associated set of parameters to the bin buffer selector. The set of parameters that are assigned to a requested bin by the parameter assigner is the same that was assigned to the corresponding bin during encoding. The set of parameters may consist of one or more of the parameters that are mentioned in the encoder description of
In an embodiment of the invention, the parameter assigner 316 associates each request for a bin with the same parameters as assigner 304 did, i.e. a context and its associated measure for an estimate of the probability for one of the two possible bin values for the current requested bin, such as a measure for an estimate of the probability for the less probable or more probable bin value for the current requested bin and an identifier specifying an estimate for which of the two possible bin values represents the less probable or more probable bin value for the current requested bin.
The parameter assigner 316 may determine one or more of the above mentioned probability measures (measure for an estimate of the probability for one of the two possible bin values for the current requested bin, measure for an estimate of the probability for the less probable or more probable bin value for the current requested bin, identifier specifying an estimate for which of the two possible bin values represents the less probable or more probable bin value for the current requested bin) based on a set of one or more already decoded symbols. The determination of the probability measures for a particular request for a bin replicates the process at the encoder for the corresponding bin. The decoded symbols that are used for determining the probability measures can include one or more already decoded symbols of the same symbol category, one or more already decoded symbols of the same symbol category that correspond to data sets (such as blocks or groups of samples) of neighboring spatial and/or temporal locations (in relation to the data set associated with the current request for a syntax element), or one or more already decoded symbols of different symbol categories that correspond to data sets of the same and/or neighboring spatial and/or temporal locations (in relation to the data set associated with the current request for a syntax element).
Each request for a bin with an associated set of parameters 317 that is output of the parameter assigner 316 is fed into a bin buffer selector 318. Based on the associated set of parameters 317, the bin buffer selector 318 sends a request for a bin 319 to one of two or more bin buffers 320 and receives a decoded bin 325 from the selected bin buffer 320. The decoded input bin 325 is potentially modified and the decoded output bin 326—with a potentially modified value—is send to the binarizer 314 as final response to the request for a bin with an associated set of parameters 317.
The bin buffer 320 to which the request for a bin is forwarded is selected in the same way as the bin buffer to which the output bin of the bin buffer selector at the encoder side was sent.
In an embodiment of the invention, the bin buffer selector 318 determines the bin buffer 320 to which the request for a bin 319 is sent based on the associated measure for an estimate of the probability for one of the two possible bin values for the current requested bin. In an embodiment of the invention, the set of possible values for the measure for an estimate of the probability for one of the two possible bin values is finite and the bin buffer selector 318 contains a table that associates exactly one bin buffer 320 with each possible value of the estimate of the probability for one of the two possible bin values, where different values for the measure for an estimate of the probability for one of the two possible bin values can be associated with the same bin buffer 320. In a further embodiment of the invention, the range of possible values for the measure for an estimate of the probability for one of the two possible bin values is partitioned into a number of intervals, the bin buffer selector 318 determines the interval index for the current measure for an estimate of the probability for one of the two possible bin values, and the bin buffer selector 318 contains a table that associates exactly one bin buffer 320 with each possible value for the interval index, where different values for the interval index can be associated with the same bin buffer 320. In an embodiment of the invention, requests for bins 317 with opposite measures for an estimate of the probability for one of the two possible bin values (opposite measure are those which represent probability estimates P and 1−P) are forwarded to the same bin buffer 320. In a further embodiment of the invention, the association of the measure for an estimate of the probability for one of the two possible bin values for the current bin request with a particular bin buffer is adapted over time.
In a further embodiment of the invention, the bin buffer selector 318 determines the bin buffer 320 to which the request for a bin 319 is sent based on the associated measure for an estimate of the probability for the less probable or more probable bin value for the current requested bin. In an embodiment of the invention, the set of possible values for the measure for an estimate of the probability for the less probable or more probable bin value is finite and the bin buffer selector 318 contains a table that associates exactly one bin buffer 320 with each possible value of the estimate of the probability for the less probable or more probable bin value, where different values for the measure for an estimate of the probability for the less probable or more probable bin value can be associated with the same bin buffer 320. In a further embodiment of the invention, the range of possible values for the measure for an estimate of the probability for the less probable or more probable bin value is partitioned into a number of intervals, the bin buffer selector 318 determines the interval index for the current measure for an estimate of the probability for the less probable or more probable bin value, and the bin buffer selector 318 contains a table that associates exactly one bin buffer 320 with each possible value for the interval index, where different values for the interval index can be associated with the same bin buffer 320. In a further embodiment of the invention, the association of the measure for an estimate of the probability for the less probable or more probable bin value for the current bin request with a particular bin buffer is adapted over time.
After receiving a decoded bin 325 from the selected bin buffer 320, the bin buffer selector 318 potentially modifies the input bin 325 and sends the output bin 326—with a potentially modified value—to the binarizer 314. The input/output bin mapping of the bin buffer selector 318 is the inverse of the input/output bin mapping of the bin buffer selector at the encoder side.
In an embodiment of the invention, the bin buffer selector 318 does not modify the value of the bin, i.e., the output bin 326 has the same value as the input bin 325. In a further embodiment of the invention, the bin buffer selector 318 determines the output bin value 326 based on the input bin value 325 and the measure for an estimate of the probability for one of the two possible bin values for the current requested bin that is associated with the request for a bin 317. In an embodiment of the invention, the output bin value 326 is set equal to the input bin value 325 if the measure for the probability for one of the two possible bin values for the current bin request is less than (or less than or equal to) a particular threshold; if the measure for the probability for one of the two possible bin values for the current bin request is greater than or equal to (or greater than) a particular threshold, the output bin value 326 is modified (i.e., it is set to the opposite of the input bin value). In a further embodiment of the invention, the output bin value 326 is set equal to the input bin value 325 if the measure for the probability for one of the two possible bin values for the current bin request is greater than (or greater than or equal to) a particular threshold; if the measure for the probability for one of the two possible bin values for the current bin request is less than or equal to (or less than) a particular threshold, the output bin value 326 is modified (i.e., it is set to the opposite of the input bin value). In an embodiment of the invention, the value of the threshold corresponds to a value of 0.5 for the estimated probability for both possible bin values.
In a further embodiment of the invention, the bin buffer selector 318 determines the output bin value 326 based on the input bin value 325 and the identifier, specifying an estimate for which of the two possible bin values represents the less probable or more probable bin value for the current bin request, that is associated with the request for a bin 317. In an embodiment of the invention, the output bin value 326 is set equal to the input bin value 325 if the identifier specifies that the first of the two possible bin values represents the less probable (or more probable) bin value for the current bin request, and the output bin value 326 is modified (i.e., it is set to the opposite of the input bin value) if identifier specifies that the second of the two possible bin values represents the less probable (or more probable) bin value for the current bin request.
As described above, the bin buffer selector sends a request for a bin 319 to one of the two or more bin buffers 320. The bin buffers 20 represent first-in-first-out buffers, which are fed with sequences of decoded bins 321 from the connected bin decoders 322. As response to a request for a bin 319 that is sent to a bin buffer 320 from the bin buffer selector 318, the bin buffer 320 removes the bin of its content that was first fed into the bin buffer 320 and sends it to the bin buffer selector 318. Bins that are earlier sent to the bin buffer 320 are earlier removed and sent to the bin buffer selector 318.
Each of the two or more bin buffers 320 is connected with exactly one bin decoder 322 and each bin decoder is only connected with one bin buffer 320. Each bin decoder 322 reads codewords 323, which represent sequences of bits, from a separate partial bitstream 324. The bin decoder converts a codeword 323 into a sequence of bins 321 that is sent to the connected bin buffer 320. The overall decoding algorithm converts two or more partial bitstreams 324 into a number of decoded syntax elements, where the number of partial bitstreams is equal to the number of bin buffers and bin decoders and the decoding of syntax elements is triggered by requests for new syntax elements. In an embodiment of the invention, a bin decoder 322 converts codewords 323 of a variable number of bits into a sequence of a variable number of bins 321. One advantage of embodiments of the invention is that the decoding of bins from the two or more partial bitstreams can be done in parallel (e.g. for different groups of probability measures), which reduces the processing time for several implementations.
Another advantage of embodiments of the invention is that the bin decoding, which is done by the bin decoders 322, can be specifically designed for different sets of parameters 317. In particular, the bin encoding and decoding can be optimized (in terms of coding efficiency and/or complexity) for different groups of estimated probabilities. On the one hand side, this allows a reduction of the encoding/decoding complexity relative to state-of-the-art entropy coding algorithms with similar coding efficiency. On the other hand side, it allows an improvement of the coding efficiency relative to state-of-the-art entropy coding algorithms with similar encoding/decoding complexity. In an embodiment of the invention, the bin decoders 322 implement different decoding algorithms (i.e. mapping of bin sequences onto codewords) for different groups of measures for an estimate of the probability for one of the two possible bin values 317 for the current bin request. In a further embodiment of the invention, the bin decoders 322 implement different decoding algorithms for different groups of measures for an estimate of the probability for the less probable or more probable bin value for the current requested bin.
The bin decoders 322 do the inverse mapping of the corresponding bin encoders at the encoder side.
In an embodiment of the invention, the bin decoders 322—or one or more of the bin decoders—represent entropy decoders that directly map codewords 323 onto sequences of bins 321. Such mappings can be efficiently implemented and don't necessitate a complex arithmetic coding engine. The mapping of codewords onto sequences of bins has to be unique. In an embodiment of the invention, the mapping of codewords 323 onto sequences of bins 321 is bijective. In a further embodiment of the invention, the bin decoders 310—or one or more of the bin decoders—represent entropy decoders that directly map variable-length codewords 323 into variable-length sequences of bins 321. In an embodiment of the invention, the input codewords represent redundancy-free codes such as general huffman codes or canonical huffman codes. Two examples for the bijective mapping of redundancy-free codes to bin sequences are illustrated in Table 3.
In a further embodiment of the invention, the bin decoders 322—or one or more of the bin decoders—represent entropy decoders that directly map fixed-length codewords 323 onto variable-length sequences of bins 321. In a further embodiment of the invention, the bin decoders 322—or one or more of the bin decoders—represent entropy decoders that directly map variable-length codewords 323 onto fixed-length sequences of bins 321.
Thus,
The decoder for reconstructing a sequence of symbols comprises a plurality of entropy decoders 322, each of which is configured to convert a respective bitstream 323 into symbols 321; an assigner 316 configured to assign a number of parameters 317 to each symbol 315 of a sequence of symbols to be reconstructed based on information contained within previously reconstructed symbols of the sequence of symbols (see 326 and 327 in
Termination of Finite Syntax Element Sequences
In an embodiment of the invention, the encoding and decoding is done for a finite set of syntax elements. Often a certain quantity of data such as a still image, a frame or field of a video sequence, a slice of an image, a slice of a frame or a field of a video sequence, or a set of successive audio samples, etc. is coded. For finite sets of syntax elements, in general, the partial bitstreams that are created at the encoder side have to be terminated, i.e., it has to be ensured that all syntax elements can be decoded from the transmitted or stored partial bitstreams. After the last bin is inserted into the corresponding bin buffer 308, the bin encoder 310 has to ensure that a complete codeword is written to the partial bitstream 312. If the bin encoder 310 represents an entropy encoder that implements a direct mapping of bin sequences onto codewords, the bin sequence that is stored in the bin buffer after writing the last bin to the bin buffer might not represent a bin sequence that is associated with a codeword (i.e., it might represent a prefix of two or more bin sequences that are associated with codewords). In such a case, any of the codewords associated with a bin sequence that contains the bin sequence in the bin buffer as prefix has to be written to the partial bitstream (the bin buffer has to be flushed). This could be done by inserting bins with a particular or an arbitrary value into the bin buffer until a codeword is written. In an embodiment of the invention, the bin encoder selects one of the codewords with minimum length (in addition to the property that the associated bin sequence has to contain the bin sequence in the bin buffer as prefix). At the decoder side, the bin decoder 322 may decode more bins than necessitated for the last codeword in a partial bitstream; these bins are not requested by the bin buffer selector 318 and are discarded and ignored. The decoding of the finite set of symbols is controlled by requests for decoded syntax elements; if no further syntax element is requested for a quantity of data, the decoding is terminated.
Transmission and Multiplexing of the Partial Bitstreams
The partial bitstreams 312 that are created by the encoder can be transmitted separately, or they can be multiplexed into a single bitstream, or the codewords of the partial bitstreams can be interleaved in a single bitstream.
In an embodiment of the invention, each partial bitstream for a quantity of data is written to one data packet. The quantity of data can be an arbitrary set of syntax elements such as a still picture, a field or frame of a video sequence, a slice of a still picture, a slice of a field or frame of a video sequence, or a frame of audio samples, etc.
In another embodiment of the invention, two or more of the partial bitstreams for a quantity of data or all partial bitstreams for a quantity of data are multiplexed into one data packet. The structure of a data packet that contains multiplexed partial bitstreams is illustrated in
The data packet 400 consists of a header and one partition for the data of each partial bitstream (for the considered quantity of data). The header 400 of the data packet contains indications for the partitioning of the (remainder of the) data packet into segments of bitstream data 402. Beside the indications for the partitioning, the header may contain additional information. In an embodiment of the invention, the indications for the partitioning of the data packet are the locations of the beginning of the data segments in units of bits or bytes or multiples of bits or multiples of bytes. In an embodiment of the invention, the locations of the beginning of the data segments are coded as absolute values in the header of the data packet, either relative to the beginning of the data packet or relative to the end of the header or relative to the beginning of the previous data packet. In a further embodiment of the invention, the locations of the beginning of the data segments are differentially coded, i.e., only the difference between the actual beginning of a data segment and a prediction for the beginning of the data segment is coded. The prediction can be derived based on already known or transmitted information such as the overall size of the data packet, the size of the header, the number of data segments in the data packet, the location of the beginning of preceding data segments. In an embodiment of the invention, the location of the beginning of the first data packet is not coded, but inferred based on the size of the data packet header. At the decoder side, the transmitted partition indications are used for deriving the beginning of the data segments. The data segments are then used as partial bitstreams and the data contained in the data segments are fed into the corresponding bin decoders in sequential order.
There are several alternatives for multiplexing the partial bitstreams into a data packet. One alternative, which can reduce the necessitated side information, in particular for cases in which the sizes of the partial bitstreams are very similar, is illustrated in
Interleaving of Variable-Length Codewords
For some applications, the above described multiplexing of the partial bitstreams (for a quantity of syntax elements) in one data packet can have the following disadvantages: On the one hand side, for small data packets, the number of bits for the side information that is necessitated for signaling the partitioning can become significant relative to the actual data in the partial bitstreams, which finally reduces the coding efficiency. On the other hand, the multiplexing may not suitable for applications that necessitate a low delay (e.g. for video conferencing applications). With the described multiplexing, the encoder cannot start the transmission of a data packet before the partial bitstreams have been completely created, since the locations of the beginning of the partitions are not known before. Furthermore, in general, the decoder has to wait until it receives the beginning of the last data segment before it can start the decoding of a data packet. For applications as video conferencing systems, these delays can add-up to an additional overall delay of the system of several video pictures (in particular for bit rates that are close to the transmission bit rate and for encoders/decoders that necessitate nearly the time interval between two pictures for encoding/decoding a picture), which is critical for such applications. In order to overcome the disadvantages for certain applications, the encoder of an embodiment of the invention can be configured in a way that the codewords that are generated by the two or more bin encoders are interleaved into a single bitstream. The bitstream with the interleaved codewords can be directly send to the decoder (when neglecting a small buffer delay, see below). At the decoder side, the two or more bin decoders read the codewords directly from the bitstream in decoding order; the decoding can be started with the first received bit. In addition, no side information is necessitated for signaling the multiplexing (or interleaving) of the partial bitstreams. A further way of reducing the decoder complexity can be achieved when the bin decoders 322 don't read variable-length codewords from a global bit buffer, but instead they read fixed-length sequences of bits from the global bit buffer and add these fixed-length sequences of bits to a local bit buffer, where each bin decoder 322 is connected with a separate local bit buffer. The variable-length codewords are then read from the local bit buffer. Hence, the parsing of variable-length codewords can be done in parallel, only the access of fixed-length sequences of bits has to be done in a synchronized way, but such an access of fixed-length sequences of bits is usually very fast, so that the overall decoding complexity can be reduced for some architectures. The fixed number of bins that are sent to a particular local bit buffer can be different for different local bit buffer and it can also vary over time, depending on certain parameters as events in the bin decoder, bin buffer, or bit buffer. However, the number of bits that are read by a particular access does not depend on the actual bits that are read during the particular access, which is the important difference to the reading of variable-length codewords. The reading of the fixed-length sequences of bits is triggered by certain events in the bin buffers, bin decoders, or local bit buffers. As an example, it is possible to request the reading of a new fixed-length sequence of bits when the number of bits that are present in a connected bit buffer falls below a predefined threshold, where different threshold values can be used for different bit buffers. At the encoder, it has to be insured that the fixed-length sequences of bins are inserted in the same order into the bitstream, in which they are read from the bitstream at the decoder side. It is also possible to combine this interleaving of fixed-length sequences with a low-delay control similar to the ones explained above. In the following, an embodiment for the interleaving of fixed-length sequences of bits is described. For further details regards the latter interleaving schemes, reference is made to WO2011/128268A1.
After having described embodiments according to which the even previously coding is used for compressing video data, is described as an even further embodiment for implementing embodiments of the present invention which renders the implementation especially effective in terms of a good trade-off between compression rate on the one hand and look-up table and computation overhead on the other hand. In particular, the following embodiments enable the use of computationally less complex variable length codes in order to entropy-code the individually bitstreams, and effectively cover portions of the probability estimate. In the embodiments described below, the symbols are of binary nature and the VLC codes presented below effectively cover the probability estimate represented by, for example, RLPS, extending within [0;0.5].
In particular, the embodiments outlined below describe possible implementations for the individual entropy coders 310 and decoders 322 in
Advantageously, the codes described below do not necessitate look-up tables. The codes are implementable in form of finite state machines. The v2v-codes presented here, can be generated by simple construction rules such that there is no need to store large tables for the code words. Instead, a simple algorithm can be used to carry out encoding or decoding. Three construction rules are described below where two of them can be parameterized. They cover different or even disjoint portions of the afore-mentioned probability interval and are, accordingly, specifically advantageous if used together, such as all three codes in parallel (each for different ones of the en/decoders 11 and 22), or two of them. With the construction rules described below, it is possible to design a set of v2v-codes, such that for Bernoulli processes with arbitrary probability p, one of the codes performs well in terms of excess code length.
As stated above, the encoding and decoding of the streams 312 and 324 respectively, can either be performed independently for each stream or in an interleaved manner. This, however, is not specific to the presented classes of v2v-codes and therefore, only the encoding and decoding of a particular codeword is described for each of the three construction rules in the following. However, it is emphasized, that all of the above embodiments concerning the interleaving solutions are also combinable with the presently described codes or en- and decoders 310 and 322, respectively.
Construction Rule 1: ‘Unary Bin Pipe’ Codes or En-/Decoders 310 and 322
Unary bin pipe codes (PIPE=probability interval partitioning entropy) are a special version of the so-called ‘bin pipe’ codes, i.e. codes suitable for coding of any of the individual bitstreams 12 and 24, each transferring data of a binary symbol statistics belonging to a certain probability sub-interval of the afore-mentioned probability range [0;0.5]. The construction of bin pipe codes is described first. A bin pipe code can be constructed from any prefix-free code with at least three code words. To form a v2v-code, it uses the prefix-free code as primary and secondary code, but with two code words of the secondary prefix-free code interchanged. This means that except for two code words, the bins are written to the bit stream unchanged. With this technique, only one prefix-free code needs to be stored along with the information, which two code words are interchanged and thus, memory consumption is reduced. Note, that it only makes sense to interchange code words of different length since otherwise, the bit stream would have the same length as the bin stream (neglecting effects that can occur at the end of the bin stream).
Due to this construction rule, an outstanding property of the bin pipe codes is, that if primary and secondary prefix-free code are interchanged (while the mapping of the code words is retained), the resulting v2v-code is identical to the original v2v-code. Therefore, the encoding algorithm and decoding algorithm are identical for bin-pipe codes.
A unary bin pipe code is constructed from a special prefix-free code. This special prefix-free code is constructed as follows. First, a prefix-free code consisting of n unary code words is generated starting with ‘01’, ‘001’, ‘0001’, . . . until n code words are produced. n is the parameter for the unary bin pipe code. From the longest code word, the trailing 1 is removed. This corresponds to a truncated unary code (but without the code word ‘0’). Then, n−1 unary code words are generated starting with ‘10’, ‘110’, ‘1110’, . . . until n−1 code words are produced. From the longest of these code words, the trailing 0 is removed. The union set of these two prefix-free codes are used as input to generate the unary bin pipe code. The two code words that are interchanged are the one only consisting of 0s and the one only consisting of Is. Example for n=4:
Construction Rule 2: ‘Unary to Rice’ Codes and Unary to Rice En-/Decoders 10 and 22:
Unary to rice codes use a truncated unary code as primary code. I.e. unary code words are generated starting with ‘1’, ‘01’, ‘001’, . . . until 2n+1 code words are generated and from the longest code word, the trailing 1 is removed. n is the parameter of the unary to rice code. The secondary prefix-free code is constructed from the code words of the primary prefix-free code as follows. To the primary code word only consisting of 0s, the code word ‘1’ is assigned. All other code words consist of the concatenation of the code word ‘0’ with the n-bit binary representation of the number of 0s of the corresponding code word of the primary prefix-free code.
Example for n=3:
Note, that this is identical to mapping an infinite unary code to a rice code with rice parameter 2n.
Construction rule 3: ‘Three bin’ code
The three bin code is given as:
It has the property, that the primary code (symbol sequences) is of fixed length (three bins) and the code words are sorted by ascending numbers of Is.
An efficient implementation of three bin code is described next. An encoder and decoder for the three bin code can be implemented without storing tables in the following way.
In the encoder (any of 10), three bins are read from the bin stream (i.e. 7). If these three bins contain exactly one 1, the code word ‘1’ is written to the bit stream followed by two bins consisting of the binary representation of the position of the 1 (starting from right with 00). If the three bins contain exactly one 0, the code word ‘111’ is written to the bit stream followed by two bins consisting of the binary representation of the position of the 0 (starting from the right with 00). The remaining code words ‘000’ and ‘111’ are mapped to ‘0’ and ‘11111’, respectively.
In the decoder (any of 22), one bin or bit is read from the respective bitstream 24. If it equals ‘0’, the code word ‘000’ is decoded to the bin stream 21. If it equals ‘1’, two more bins are read from the bit stream 24. If these two bits do not equal ‘11’, they are interpreted as the binary representation of a number and two 0s and one 1 is decoded to the bit stream such that the position of the 1 is determined by the number. If the two bits equal ‘11’, two more bits are read and interpreted as binary representation of a number. If this number is smaller than 3, two Is and one 0 are decoded and the number determines the position of the 0. If it equals 3, ‘111’ is decoded to the bin stream.
An efficient implementation of unary bin pipe codes is described next. An encoder and decoder for unary bin pipe codes can be efficiently implemented by using a counter. Due to the structure of bin pipe codes, encoding and decoding of bin pipe codes is easy to implement:
In the encoder (any of 10), if the first bin of a code word equals ‘0’, bins are processed until a ‘1’ occurs or until n 0s are read (including the first ‘0’ of the code word). If a ‘1’ occurred, the read bins are written to the bit stream unchanged. Otherwise (i.e. n 0s were read), n−1 is are written to the bit stream. If the first bin of the code word equals ‘1’, bins are processed until a ‘0’ occurs or until n−1 is are read (including the first ‘1’ of the code word). If a ‘0’ occurred, the read bins are written to the bit stream unchanged. Otherwise (i.e. n−1 is were read), n 0s are written to the bit stream.
In the decoder (any of 322), the same algorithm is used as for the encoder, since this is the same for bin pipe codes as described above.
An efficient implementation of unary to rice codes is described next. An encoder and decoder for unary to rice codes can be efficiently implemented by using a counter as will be described now.
In the encoder (any of 310), bins are read from the bin stream (i.e. 7) until a 1 occurs or until 2n 0s are read. The number of 0s is counted. If the counted number equals 2n, the code word ‘1’ is written to the bit stream. Otherwise, ‘0’ is written, followed by the binary representation of the counted number, written with n bits.
In the decoder (any of 322), one bit is read. If it equals ‘1’, 2n 0s are decoded to the bin string. If it equals ‘0’, n more bits are read and interpreted as binary representation of a number. This number of 0s is decoded to the bin stream, followed by a ‘1’.
In other words, the just-described embodiments describe an encoder for encoding a sequence of symbols 303, comprising an assigner 316 configured to assign a number of parameters 305 to each symbol of the sequence of symbols based on information contained within previous symbols of the sequence of symbols; a plurality of entropy encoders 310 each of which is configured to convert the symbols 307 forwarded to the respective entropy encoder 310 into a respective bitstream 312; and a selector 6 configured to forward each symbol 303 to a selected one of the plurality of entropy encoders 10, the selection depending on the number of parameters 305 assigned to the respective symbol 303. According to the just-outlined embodiments, at least a first subset of the entropy encoders may be a variable length encoder configured to map symbol sequences of variable lengths within the stream of symbols 307 to codewords of variable lengths to be inserted in bitstream 312, respectively, with each of the entropy coders 310 of the first subset using a bijective mapping rule according to which code words of a primary prefix-free code with (2n−1)≥3 code words are mapped to code words of a secondary prefix-free code which is identical to the primary prefix code such that all but two of the code words of the primary prefix-free code are mapped to identical code words of the secondary prefix-free code while the two code words of the primary and secondary prefix-free codes have different lengths and are mapped onto each other in an interchanged manner, wherein the entropy encoders may use different n so as to covers different portions of an interval of the above-mentioned probability interval. The first prefix-free code may be constructed such that the codewords of the first prefix-free code are (a,b)2, (a,a,b)3, . . . , (a, . . . ,a,b)n, (a, . . . ,a)n, (b,a)2, (b,b,a)3, . . . , (b, . . . ,b,a)n-1, (b, . . . ,b)n-1, and the two codewords mapped onto each other in the interchanged manner are (a, . . . ,a)n and (b, . . . ,b)n-1 with b≠a and a,b∈{0,1}. However, alternatives are feasible.
In other words, each of a first subset of entropy encoders may be configured to, in converting the symbols forwarded to the respective entropy encoder into the respective bitstream, examine a first symbol forwarded to the respective entropy encoder, to determine as to whether (1) the first symbol equals a ∈{0,1}, in which case the respective entropy encoder is configured to examine the following symbols forwarded to the respective entropy encoder to determine as to whether (1.1) b with b≠a and b∈{0,1}occurs within the next n−1 symbols following the first symbol, in which case the respective entropy encoder is configured to write a codeword to the respective bitstream, which equals the first symbol followed by the following symbols forwarded to the respective entropy encoder, up to the symbol b; (1.2) no b occurs within the next n−1 symbols following the first symbol, in which case the respective entropy encoder is configured to write a codeword to the respective bitstream, which equals (b, . . . ,b)n-1; or (2) the first symbol equals b, in which case the respective entropy encoder is configured to examine the following symbols forwarded to the respective entropy encoder to determine as to whether (2.1) a occurs within the next n−2 symbols following the first symbol, in which case the respective entropy encoder is configured to write a codeword to the respective bitstream, which equals the first symbol followed by the following symbols forwarded to the respective entropy encoder up to the symbol a; or (2.2) no a occurs within the next n−2 symbols following the first symbol, in which case the respective entropy encoder is configured to write a codeword to the respective bitstream, which equals (a, . . . ,a)n.
Additionally or alternatively, a second subset of the entropy encoders 10 may be a variable length encoder configured to map symbol sequences of variable lengths to codewords of fixed lengths, respectively, with each of the entropy coders of the second subset using a bijective mapping rule according to which code words of a primary truncated unary code with 2n+1 code words of the type {(a), (ba), (bba), . . . , (b . . . ba), (bb . . . b)} with b≠a and a,b∈{0,1} are mapped to code words of a secondary prefix-free code such that the codeword (bb . . . b) of the primary truncated unary code is mapped onto codeword (c) of the secondary prefix-free code and all other codewords {(a), (ba), (bba), . . . , (b . . . ba)} of the primary truncated unary code are mapped onto codewords having (d) with c≠d and c,d∈{0,1} as a prefix and a n-bit word as suffix, wherein the entropy encoders use different n. Each of the second subset of entropy encoders may be configured such that the n-bit word is an n-bit representation of the number of b's in the respective codeword of the primary truncated unary code. However, alternatives are feasible.
Again, from the perspective of the mode of operation of the respective encoder 10, each of the second subset of entropy encoders may be configured to, in converting the symbols forwarded to the respective entropy encoder into the respective bitstream, count a number of b's in a sequence of symbols forwarded to the respective entropy encoder, until an a occurs, or until the number of the sequence of symbols forwarded to the respective entropy encoder reaches 2n with all 2n symbols of the sequence being b, and (1) if the number of b's equals 2n, write c with c∈{0,1} as codeword of a secondary prefix-free code to the respective bitstream, and (2) if the number of b's is lower than 2n, write a codeword of the secondary prefix-free code to the respective bitstream, which has (d) with c≠d and d∈{0,1} as prefix and a n-bit word determined depending on the number of b's as suffix.
Also additionally or alternatively, a predetermined one of the entropy encoders 10 may be a variable length encoder configured to map symbol sequences of fixed lengths to codewords of variable lengths, respectively, the predetermined entropy coder using a bijective mapping rule according to which 23 code words of length 3 of a primary code are mapped to code words of a secondary prefix-free code such that the codeword (aaa)3 of the primary code with a ∈{0,1} is mapped onto codeword (c) with c∈{0,1}, all three codewords of the primary code having exactly one b with b≠a and b∈{0,1} are mapped onto codewords having (d) with c≠d and d∈{0,1} as a prefix and a respective first 2-bit word out of a first set of 2-bit words as a suffix, all three codewords of the primary code having exactly one a are mapped onto codewords having (d) as a prefix and a concatenation of a first 2-bit word not being an element of the first set and a second 2-bit word out of a second set of 2-bit words, as a suffix, and wherein the codeword (bbb)3 is mapped onto a codeword having (d) as a prefix and a concatenation of the first 2-bit word not being an element of the first set and a second 2-bit word not being an element of the second set, as a suffix. The first 2-bit word of the codewords of the primary code having exactly one b may be a 2-bit representation of a position of the b in the respective codeword of the primary code, and the second 2-bit word of the codewords of the primary code having exactly one a may be a 2-bit representation of a position of the a in the respective codeword of the primary code. However, alternatives are feasible.
Again, the predetermined one of the entropy encoders may be configured to, in converting the symbols forwarded to the predetermined entropy encoder into the respective bitstream, examine the symbols to the predetermined entropy encoder in triplets as to whether (1) the triplet consists of a's, in which case the predetermined entropy encoder is configured to write the codeword (c) to the respective bitstream, (2) the triplet exactly comprises one b, in which case the predetermined entropy encoder is configured to write a codeword having (d) as a prefix and a 2-bit representation of a position of the b in the triplet as a suffix, to the respective bitstream; (3) the triplet exactly comprises one a, in which case the predetermined entropy encoder is configured to write a codeword having (d) as a prefix and a concatenation of the first 2-bit word not being an element of the first set and a 2-bit representation of a position of the a in the triplet as a suffix, to the respective bitstream; or (4) the triplet consists of b's, in which case the predetermined entropy encoder is configured to write a codeword having (d) as a prefix and a concatenation of the first 2-bit word not being an element of the first set and the first 2-bit word not being an element of the second set as a suffix, to the respective bitstream.
Regarding the decoding side, just-described embodiments disclose a decoder for reconstructing a sequence of symbols 326, comprising a plurality of entropy decoders 322, each of which is configured to convert a respective bitstream 324 into symbols 321; an assigner 316 configured to assign a number of parameters to each symbol 326 of a sequence of symbols to be reconstructed based on information contained within previously reconstructed symbols of the sequence of symbols; and a selector 318 configured to retrieve each symbol 325 of the sequence of symbols to be reconstructed from a selected one of the plurality of entropy decoders, the selection depending on the number of parameters defined to the respective symbol. According to the just-described embodiments at least a first subset of the entropy decoders 322 are variable length decoders configured to map codewords of variable lengths to symbol sequences of variable lengths, respectively, with each of the entropy decoders 22 of the first subset using a bijective mapping rule according to which code words of a primary prefix-free code with (2n−1)≥3 code words are mapped to code words of a secondary prefix-free code which is identical to the primary prefix code such that all but two of the code words of the primary prefix-free code are mapped to identical code words of the secondary prefix-free code while the two code words of the primary and secondary prefix-free codes have different lengths and are mapped onto each other in an interchanged manner, wherein the entropy encoders use different n. The first prefix-free code may be constructed such that the codewords of the first prefix-free code are (a,b)2, (a,a,b)3, . . . , (a, . . . ,a,b)n, (a, . . . ,a)n, (b,a)2, (b,b,a)3, . . . , (b, . . . ,b,a).n-1, (b, . . . ,b).n-1, and the two codewords mapped onto each other in the interchanged manner may be (a, . . . ,a)n, and (b, . . . ,b)n-1 with b≠a and a,b∈{0,1}. However, alternatives are feasible.
Each of the first subset of entropy encoders may be configured to, in converting the respective bitstream into the symbols, examine a first bit of the respective bitstream, to determine as to whether (1) the first bit equals a 0 {0,1}, in which case the respective entropy encoder is configured to examine the following bits of the respective bitstream to determine as to whether (1.1) b with b≠a and b 0 {0,1} occurs within the next n−1 bits following the first bit, in which case the respective entropy decoder is configured to reconstruct a symbol sequence, which equals the first bit followed by the following bits of the respective bitstream, up to the bit b; or (1.2) no b occurs within the next n−1 bits following the first bit, in which case the respective entropy decoder is configured to reconstruct a symbol sequence, which equals (b, . . . ,b)n-1; or (2) the first bit equals b, in which case the respective entropy decoder is configured to examine the following bits of the respective bitstream to determine as to whether (2.1) a occurs within the next n−2 bits following the first bit, in which case the respective entropy decoder is configured to reconstruct a symbol sequence, which equals the first bit followed by the following bits of the respective bitstream up to the symbol a; or (2.2) no a occurs within the next n−2 bits following the first bit, in which case the respective entropy decoder is configured to reconstruct a symbol sequence, which equals (a, . . . ,a)n.
Additionally or alternatively, at least a second subset of the entropy decoders 322 may be a variable length decoder configured to map codewords of fixed lengths to symbol sequences of variable lengths, respectively, with each of the entropy decoders of the second subset using a bijective mapping rule according to which code words of a secondary prefix-free code are mapped onto code words of a primary truncated unary code with 2n+1 code words of the type {(a), (ba), (bba), . . . , (b . . . ba), (bb . . . b)} with b≠a and a,b∈{0,1} such that codeword (c) of the secondary prefix-free code is mapped onto the codeword (bb . . . b) of the primary truncated unary code and codewords having (d) with c≠d and c,d∈{0,1} as a prefix and a n-bit word as suffix, are mapped to a respective one of the other codewords {(a), (ba), (bba), . . . , (b . . . ba)} of the primary truncated unary code, wherein the entropy decoders use different n. Each of the second subset of entropy decoders may be configured such that the n-bit word is an n-bit representation of the number of b's in the respective codeword of the primary truncated unary code. However, alternatives are feasible.
Each of a second subset of entropy decoders may be a variable length decoder configured to map codewords of fixed lengths to symbol sequences of variable lengths, respectively, and configured to, in converting the bitstream of the respective entropy decoder into the symbols, examine a first bit of the respective bitstream to determine as to whether (1) same equals c with c∈{0,1}, in which case the respective entropy decoder is configured to reconstruct a symbol sequence which equals (bb . . . b)2n with b∈{0,1}; or (2) same equals d with c≠d and c,d∈{0,1}, in which case the respective entropy decoder is configured to determine a n-bit word from n further bits of the respective bitstream, following the first bit, and reconstruct a symbol sequence therefrom which is of the type {(a), (ba), (bba), . . . , (b . . . ba), (bb . . . b)} with b≠a and b∈{0,1} with the number of b's depending on the n-bit word.
Additionally or alternatively, a predetermined one of the entropy decoders 322 may be a variable length decoders configured to map codewords of variable lengths to symbol sequences of fixed lengths, respectively, the predetermined entropy decoder using a bijective mapping rule according to which code words of a secondary prefix-free code are mapped to 23 code words of length 3 of a primary code such that codeword (c) with c∈{0,1} is mapped to the codeword (aaa)3 of the primary code with a ∈{0,1}, codewords having (d) with c≠d and d∈{0,1} as a prefix and a respective first 2-bit word out of a first set of three 2-bit words as a suffix are mapped onto all three codewords of the primary code having exactly one b with b≠a and b∈{0,1}, codewords having (d) as a prefix and a concatenation of a first 2-bit word not being an element of the first set and a second 2-bit word out of a second set of three 2-bit words, as a suffix are mapped onto all three codewords of the primary code having exactly one a, and a codeword having (d) as a prefix and a concatenation of the first 2-bit word not being an element of the first set and a second 2-bit word not being an element of the second set, as a suffix is mapped onto the codeword (bbb)3. The first 2-bit word of the codewords of the primary code having exactly one b may be a 2-bit representation of a position of the b in the respective codeword of the primary code, and the second 2-bit word of the codewords of the primary code having exactly one a may be a 2-bit representation of a position of the a in the respective codeword of the primary code. However, alternatives are feasible.
The predetermined one of the entropy decoders may be a variable length decoder configured to map codewords of variable lengths to symbol sequences of three symbols each, respectively, and configured to, in converting the bitstream of the respective entropy decoder into the symbols, examine the first bit of the respective bitstream to determine as to whether (1) the first bit of the respective bitstream equals c with c∈{0,1}, in which case the predetermined entropy decoder is configured to reconstruct a symbol sequence which equals (aaa)3 with a 0 {0,1}, or (2) the first bit of the respective bitstream equals d with c d and d∈{0,1}, in which case the predetermined entropy decoder is configured to determine a first 2-bit word from 2 further bits of the respective bitstream, following the first bit, and examine the first 2-bit word to determine as to whether (2.1) the first 2-bit word is no element of a first set of three 2-bit words, in which case the predetermined entropy decoder is configured to reconstruct a symbol sequence which has exactly one b with b≠a and b 0 {0,1}, with the position of b in the respective symbol sequence depending on the first 2-bit word, or (2.2) the first 2-bit word is element of the first set, in which case the predetermined entropy decoder is configured to determine a second 2-bit word from 2 further bits of the respective bitstream, following the two bits from which the first 2-bit word has been determined, and examine the second 2-bit word to determine as to whether (3.1) the second 2-bit word is no element of a second set of three 2-bit words, in which case the predetermined entropy decoder is configured to reconstruct a symbol sequence which has exactly one a, with the position of a in the respective symbol sequence depending on the second 2-bit word, or (3.2) the second 2-bit word is element of a second set of three 2-bit words, in which case the predetermined entropy decoder is configured to reconstruct a symbol sequence which equals (bbb)3.
Now, after having described the general concept of a video coding scheme, embodiments of the present invention are described with respect to the above embodiments. In other words, the embodiments outlined below may be implemented by use of the above schemes, and vice versa, the above coding schemes may be implemented using and exploiting the embodiments outlined below.
In the above embodiments described with respect to
To be more precise, in accordance with an embodiment, the entropy encoder attached to the output of parameter assigner (which acts as a context assigner, here) may operate in the following way:
0. The assigner 304 forwards the bin value along with the probability parameter. The probability is pState_current[bin].
1. Thus, the entropy encoding engine receives: 1) va1LPS, 2) the bin and 3) the probability distribution estimate pState_current[bin]. pState_current[bin] may have more states than the number of distinguishable probability state indices of Rtab. If so, pState_current[bin] may be quantized such as, for example, by disregarding m LSBs with m being greater than or equal to 1 and advantageously 2 or 3 so as to obtain an p_state, i.e. the index which is then used to access the table Rtab. The quantization may, however, be left away, i.e. p_state may be pState_current[bin].
2. Then, a quantization of R is performed (As mentioned above: either one R (and corresponding L with one common bitstream) is used/managed for all distinguishable values of p_state, or one R (and corresponding L with associated partial bitstream per R/L pair) per distinguishable value of p_state which latter case would correspond to having one bin encoder 310 per such value)
3. Then, a determination of RLPS and R is performed:
4. Calculation of the new partial interval:
5. Renormalization of L and R, writing bits,
Analogously, the entropy decoder attached to the output of parameter assigner (which acts as a context assigner, here) may operate in the following way:
0. The assigner 304 forwards the bin value along with the probability parameter. The probability is pState_current[bin].
1. Thus, the entropy decoding engine receives the request for a bin along with: 1) va1LPS, and 2) the probability distribution estimate pState_current[bin]. pState_current[bin] may have more states than the number of distinguishable probability state indices of Rtab. If so, pState_current[bin] may be quantized such as, for example, by disregarding m LSBs with m being greater than or equal to 1 and advantageously 2 or 3 so as to obtain an p_state, i.e. the index which is then used to access the table Rtab. The quantization may, however, be left away, i.e. p_state may be pState_current[bin].
2. Then, a quantization of R is performed (As mentioned above: either one R (and corresponding V with one common bitstream) is used/managed for all distinguishable values of p_state, or one R (and corresponding V with associated partial bitstream per R/L pair) per distinguishable value of p_state which latter case would correspond to having one bin encoder 310 per such value)
3. Then, a determination of RLPS and R is performed:
4. Determination of bin depending on the position of the partial interval:
5. Renormalization of R, reading out one bit and updating V,
As described above, the assigner 4 assigns pState_current[bin] to each bin. The association may be done based on a context selection. That is, assigner 4 may select a context using an context index ctxIdx which, in turn, has a respective pState_current associated therewith. A probability update may be performed each time, a probability pState_current[bin] has been applied to a current bin. An update of the probability state pState_current[bin] is performed depending on the value of the coded bit:
If more than one context is provided, the adaptation is done context-wise, i.e. pState_current[ctxIdx] is used for coding and then updated using the current bin value (encoded or decoded, respectively).
As will be outlined in more detail below, in accordance with embodiments described now, the encoder and decoder may optionally be implemented to operate in different modes, namely Low complexity (LC), and High efficiency (HE) mode. This is illustrated primarily regarding PIPE coding in the following (then mentioning LC and HE PIPE modes), but the description of the complexity scalability details is easily transferable to other implementations of the entropy encoding/decoding engines such as the embodiment of using one common context-adaptive arithmetic en/decoder.
In accordance with the embodiments outlined below, both entropy coding modes may share
Generally speaking, LC-PIPE differs from HE-PIPE in the processing complexity, such as the complexity of selecting the PIPE path 312 for each bin.
For example, the LC mode may operate under the following constraints: For each bin (binIdx), there may be exactly one probability model, i.e., one ctxIdx. That is, no context selection/adaptation may be provided in LC PIPE. Specific syntax elements such as those used for residual coding may, hover, coded using contexts, as further outlined below. Moreover, all probability models may be non-adaptive, i.e., all models may be initialized at the beginning of each slice with appropriate model probabilities (depending on the choice of slice type and slice QP) and may be kept fixed throughout processing of the slice. For example, only 8 different model probabilities corresponding to 8 different PIPE codes 310/322 may be supported, both for context modelling and coding. Specific syntax elements for residual coding, i.e., significance_coeff_flag and coeff_abs_level_greaterX (with X=1,2), the semantics of which are outlined in more detail below, may be assigned to probability models such that (at least) groups of, for example, 4 syntax elements are encoded/decoded with the same model probability. Compared to CAVLC, the LC-PIPE mode achieves roughly the same R-D performance and the same throughput.
HE-PIPE may be configured to be conceptually similar to CABAC of H.264 with the following differences: Binary arithmetic coding (BAC) is replaced by PIPE coding (same as in the LC-PIPE case). Each probability model, i.e., each ctxIdx, may be represented by a pipeIdx and a refineIdx, where pipeIdx with values in the range from 0 . . . 7 represents the model probability of the 8 different PIPE codes. This change affects only the internal representation of states, not the behavior of the state machine (i.e., probability estimation) itself. As will be outlined in more detail below, the initialization of probability models may use 8 bit initialization values as stated above. Backward scanning of syntax elements coeff_abs_level_greaterX (with X=1, 2), coeff_abs_level_minus3, and coeff_sign_flag (the semantics of which will get clear from the below discussion) may be performed along the same scanning path as the forward scan (used in, for example, the significance map coding). Context derivation for coding of coeff_abs_level_greaterX (with X=1, 2) may also be simplified. Compared to CABAC, the proposed HE-PIPE achieves roughly the same R-D performance at a better throughput.
It is easy to see that the just-mentioned modes are readily generated by rendering, for example, the afore-mentioned context-adaptive binary arithmetic en/decoding engine such that same operates in different modes.
Thus, in accordance with an embodiment in accordance with a first aspect of the present invention, a decoder for decoding a data stream may be constructed as shown in
Further, the decoder of
Further, the decoder of
As already noted above, the reconstructor 404 may be the part of a predictive block-based video decoder operating on a fixed syntax and semantics of syntax elements, i.e., fixed relative to the mode selection by mode switch 400. That is, the construction of the reconstructor 404 does not suffer from the mode switchability. To be more precise, the reconstructor 404 does not increase the implementation overhead due to the mode switchability offered by mode switch 400 and at least the functionality with regard to the residual data and the prediction data remains the same irrespective of the mode selected by switch 400. The same applies, however, with regard to the entropy decoders 322. All these decoders 322 are reused in both modes and, accordingly, there is no additional implementation overhead although the decoder of
As a side aspect it should be noted that the decoder of
Thus, the decoder of
The selector 402, however, acts independently on the mode selected by mode switch 400. The mode of operation of selector 402 tends to be more complex in case of the high efficiency mode, and less complex in case of the low-complexity mode. Moreover, the following discussion will show that the mode of operation of selector 402 in the less-complex mode also tends to reduce the rate at which selector 402 changes the selection among the entropy decoders 322 in retrieving the consecutive symbols from the entropy decoders 322. In other words, in the low-complexity mode, there is an increased probability that immediately consecutive symbols are retrieved from the same entropy decoder among the plurality of entropy decoders 322. This, in turn, allows for a faster retrieval of the symbols from the entropy decoders 322. In the high-efficiency mode, in turn, the mode of operation of the selector 402 tends to lead to a selection among the entropy decoders 322 where the probability interval associated with the respective selected entropy decoder 322 more closely fits to the actual symbol statistics of the symbol currently retrieved by selector 402, thereby yielding a better compression ratio at the encoding side when generating the respective data stream in accordance with the high-efficiency mode.
For example, the different behavior of the selector 402 in both modes, may be realized as follows. For example, the selector 402 may be configured to perform, for a predetermined symbol, the selection among the plurality of entropy decoders 322 depending on previously retrieved symbols of the sequence 326 of symbols in case of the high-efficiency mode being activated and independent from any previously retrieved symbols of the sequence of symbols in case of the low-complexity mode being activated. The dependency on previously retrieved symbols of the sequence 326 of symbols may result from a context adaptivity and/or a probability adaptivity. Both adaptivities may be switched off during low complexity mode in selector 402.
In accordance with a further embodiment, the datastream 401 may be structured into consecutive portions such as slices, frames, group of pictures, frame sequences or the like, and each symbol of the sequence of symbols may be associated with a respective one of a plurality of symbol types. In this case, the selector 402 may be configured to vary, for symbols of a predetermined symbol type within a current portion, the selection depending on previously retrieved symbols of the sequence of symbols of the predetermined symbol type within the current portion in case of the high-efficiency mode being activated, and leave the selection constant within the current portion in case of the low-complexity mode being activated. That is, selector 402 may be allowed to change the selection among the entropy decoders 322 for the predetermined symbol type, but these changes are restricted to occur between transitions between consecutive portions. By this measure, evaluations of actual symbol statistics are restricted to seldom occurring time instances while coding complexity is reduced within the majority of the time.
Further, each symbol of the sequence 326 of symbols may be associated with a respective one of a plurality of symbol types, and the selector 402 may be configured to, for a predetermined symbol of a predetermined symbol type, select one of a plurality of contexts depending on previously retrieved symbols of the sequence 326 of symbols and perform the selection among the entropy decoders 322 depending on a probability model associated with a selected context along with updating the probability model associated with a selected context depending on the predetermined symbol in case of the high-efficiency mode being activated, and perform selecting the one of the plurality of context depending on the previously retrieved symbols of the sequence 326 of symbols and perform the selection among the entropy decoders 322 depending on the probability model associated with the selected context along with leaving the probability model associated with the selected context constant in case of the low-complexity mode being activated. That is, selector 402 may use context adaptivity with respect to a certain syntax element type in both modes, while suppressing probability adaptation in case of the LC mode.
Alternatively, instead of completely suppressing the probability adaptation, selector 402 may merely reduce an update rate of the probability adaptation of the LC mode relative to the HE mode.
Further, possible LC-pipe-specific aspects, i.e., aspects of the LC mode, could be described as follows in other words. In particular, non-adaptive probability models could be used in the LC mode. A non-adaptive probability model can either have a hardcoded, i.e., overall constant probability or its probability is kept fixed throughout processing of a slice only and thus can be set dependent on slice type and QP, i.e., the quantization parameter which is, for example, signaled within the datastream 401 for each slice. By assuming that successive bins assigned to the same context follow a fixed probability model, it is possible to decode several of those bins in one step as they are encoded using the same pipe code, i.e., using the same entropy decoder, and a probability update after each decoded bin is omitted. Omitting probability updates saves operations during the encoding and decoding process and, thus, also leads to complexity reductions and a significant simplification in hardware design.
The non-adaptive constraint may be eased for all or some selected probability models in such a way that probability updates are allowed after a certain number of bins have been encoded/decoded using this model. An appropriate update interval allows a probability adaptation while having the ability to decode several bins at once.
In the following, a more detailed description of possible common and complexity-scalable aspects of LC-pipe and HE-pipe is presented. In particular, in the following, aspects are described which may be used for LC-pipe mode and HE-pipe mode in the same way or in a complexity-scalable manner. Complexity-scalable means that the LC-case is derived from the HE-case by removing particular parts or by replacing them with something less complex. However, before proceeding therewith, it should be mentioned that the embodiment of
For example, in implementing the embodiment of
This modified coding scheme may be used as a basis for the complexity-scalable video coding approach. When performing probability mode adaptation, the selector 402 or context-adaptive binary arithmetic decoder, respectively, would select the PIPE decoder 322, .i.e. derive the pipe index, to be used, and the probability index into Rtab, respectively, based on the probability state index—here exemplarily ranging from 0 to 62-associated with the currently to be decoded symbol—such as via a context—using the mapping shown in table A, and would update this probability state index depending on the currently decoded symbol using, for example, specific table walk transition values pointing to the next probability state index to be visited in case of an MPS and a LPS, respectively. In case of LC mode, the latter update could be left away. Even the mapping could be left away in case of globally fixed probability models.
However, an arbitrary entropy coding setup could be used and the techniques in this document can also be used with minor adaptations.
The above description of
For example, the reconstructor 404 may be configured to reconstruct a transform block 200 of transform coefficient levels 202 based on a portion of the sequence of syntax elements independent from the high-efficiency mode or the low-complexity mode being activated, the portion of the sequence 327 of syntax elements comprising, in an un-interleaved manner, significance map syntax elements defining a significance map indicating positions of non-zero transform coefficient levels within the transform block 200, and then (followed by) level syntax elements defining the non-zero transform coefficient levels. In particular, the following elements may be involved: end position syntax elements (last-significant_pos_x, last_significant_pos_y) indicating a position of a last non-zero transform coefficient level within the transform block; first syntax elements (coeff_significant_flag) together defining a significance map and indicating, for each position along a one-dimensional path (274) leading from a DC position to the position of the last non-zero transform coefficient level within the transform block (200), as to whether the transform coefficient level at the respective position is non-zero or not; second syntax elements (coeff_abs_greater1) indicating, for each position of the one-dimensional path (274) where, according to the first binary syntax elements, a non-zero transform coefficient level is positioned, as to whether the transform coefficient level at the respective position is greater than one; and third syntax elements (coeff_abs_greater2, coeff_abs_minus3) revealing, for each position of the one-dimensional path where, according to the first binary syntax elements, a transform coefficient level greater than one is positioned, an amount by which the respective transform coefficient level at the respective position exceeds one.
The order among the end position syntax elements, the first, the second and the third syntax elements may be same for the high-efficiency mode and the low-complexity mode, and the selector 402 may be configured to perform the selection among the entropy decoders 322 for symbols from which the de-symbolizer 314 obtains the end position syntax elements, first syntax elements, second syntax elements and/or the third syntax elements, differently depending on the low-complexity mode or the high-efficiency mode being activated.
In particular, the selector 402 may be configured, for symbols of a predetermined symbol type among a subsequence of symbols from which the de-symbolizer 314 obtains the first syntax elements and second syntax elements, to select for each symbol of the predetermined symbol type one of a plurality of contexts depending on previously retrieved symbols of the predetermined symbol type among the subsequence of symbols and perform the selection depending on a probability model associated with the selected context in case of the high-efficiency mode being activated, and perform the selection in a piece wise constant manner such that the selection is constant over consecutive continuous subparts of the subsequence in case of the low-complexity mode be activated. As described above, the subparts may be measured in the number of positions over which the respective subpart extends when measured along the one-dimensional path 274, or in the number of syntax elements of the respective type already coded with the current context. That is, the binary syntax elements coeff_significant_flag_coeff_abs_greater1 and coeff_abs_greater2, for example, are coded context adaptively with selecting the decoder 322 based on the probability model of the selected context in HE mode. Probability adaptation is used as well. In LC mode, there are also different contexts which are used for each of the binary syntax elements coeff_significant_flag, coeff_abs_greater1 and coeff_abs_greater2. However, for each of these syntax elements, the context is kept static for the first portion along path 274 with changing the context merely at a transition to the next, immediately following portion along the path 274. For example, each portion may defined to be 4, 8, 16 positions of block 200 long, independent from as to whether for the respective position the respective syntax element is present or not. For example, coeff_abs_greater1 and coeff_abs_greater2 are merely present for significant positions, i.e. positions where—or for which—coeff_significant_flag is 1. Alternatively, each portion may defined to be 4, 8, 16 syntax elements long, independent from as to whether for the thus resulting respective portion extends over a higher number of block positions. For example, coeff_abs_greater1 and coeff_abs_greater2 are merely present for significant positions, and thus, portions of four syntax elements each may extend over more than 4 block positions due to positions therebetween along path 274 for which no such syntax element is transmitted such as no coeff_abs_greater1 and coeff_abs_greater2 because the respective level at this position is zero.
The selector 402 may be configured to, for the symbols of the predetermined symbol type among the subsequence of symbols from which the de-symbolizer obtains the first syntax elements and second syntax elements, select for each symbol of the predetermined symbol type the one of a plurality of contexts depending on a number of previously retrieved symbols of the predetermined symbol type within the subsequence of symbols, which have a predetermined symbol value and belong to the same subpart, or a number of previously retrieved symbols of the predetermined symbol type within the sequence of symbols, which belong to the same subpart. The first alternative has been true for coeff_abs_greater1 and the secondary alternative has be true for coeff_abs_greater2 in accordance with the above specific embodiments.
Further, the third syntax elements revealing, for each position of the one-dimensional path where, according to the first binary syntax elements, a transform coefficient level greater than one is positioned, an amount by which the respective transform coefficient level at the respective position exceeds one, may comprise integer-valued syntax elements, i.e. coeff_abs_minus3, and the desymbolizer 314 may be configured to use a mapping function controllable by a control parameter to map a domain of symbol sequence words to a co-domain of the integer-valued syntax elements, and to set the control parameter per integer-valued syntax element depending on integer-valued syntax elements of previous third syntax elements if the high-efficiency mode is activated, and perform the setting in a piecewise constant manner such that the setting is constant over consecutive continuous subparts of the subsequence in case of the low-complexity mode being activated, wherein the selector 402 may configured to select a predetermined one of the entropy decoders (322) for the symbols of symbol sequence words mapped onto the integer-valued syntax elements, which is associated with an equal probability distribution, in both the high-efficiency mode and the low-complexity mode. That is, even the desymbolizer may operate dependent on the mode selected be switch 400 is illustrated by dotted line 407. Instead of a piecewise constant setting of the control parameter, the desymbolizer 314 may keep the control parameter constant during the current slice, for example, or constant globally in time.
Next, a complexity-scalable context modelling is described.
The evaluation of the same syntax element of the top and the left neighbour for the derivation of the context model index is a common approach and is often used in the HE case, e.g. for the motion vector difference syntax element. However, this evaluation necessitates more buffer storage and disallows the direct coding of the syntax element. Also, to achieve higher coding performance, more available neighbours can be evaluated.
In an embodiment, all context modelling stage evaluating syntax elements of neighbor square or rectangle blocks or prediction units are fixed to one context model. This is equal to the disabling of the adaptivity in the context model selection stage. For that embodiment, the context model selection depending on the bin index of the bin string after a binarization is not modified compared to the current design for CABAC. In another embodiment, additional to the fixed context model for syntax elements employ the evaluation of neighbors, also the context model for the different bin index are fixed. Note that the description does not include the binarization and context model selection for the motion vector difference and the syntax elements related to the coding of the transform coefficient levels.
In an embodiment, only the evaluation of the left neighbor is allowed. This leads to reduced buffer in the processing chain because the last block or coding unit line has not to be stored anymore. In a further embodiment, only neighbors lying in the same coding unit are evaluated.
In an embodiment, all available neighbors are evaluated. For example, in addition to the top and the left neighbor, the top left, the top right, and the bottom left neighbor are evaluated in case of availability.
That is, the selector 402 of
Next, a reduced-complexity coding of motion vector differences in accordance with an embodiment is described.
In the H.264/AVC video codes standard, a motion vector associated with a macroblock is transmitted by signaling the difference (motion vector difference—mvd) between the motion vector of the current macroblock and the median motion vector predictor. When the CABAC is used as entropy coder, the mvd is coded as follows. The integer-valued mvd is split into an absolute and the sign part. The absolute part is binarized using a combination of truncated unary and 3rd order Exp-Golomb, referred to as the prefix and the suffix of the resulting bin string. The bins related to the truncated unary binarization is coded using context models, while bins related to the Exp-Golomb binarization is coded in a bypass mode, i.e. with a fixed probability of 0.5 with CABAC. The unary binarization works as follows. Let the absolute integer-value of the mvd be n, then the resulting bin string consists of n times ‘1’ and one trailing ‘0’. As an example, let n=4, then the bin string is ‘11110’. In case of truncated unary, a limit exists and if the value excesses this limit, the bin string consists of n+1 times ‘1’. For the case of mvd, the limit is equal to 9. That means if an absolute mvd is equal to or greater than 9 is coded, resulting in 9 times ‘1’, the bin string consists of a prefix and a suffix with Exp-Golomb binarization. The context modelling for the truncated unary part is done as follows. For the first bin of the bin string, the absolute mvd values from the top and the left neighbour macroblocks are taken if available (if not available, the value is inferred to be 0). If the sum for the specific component (horizontal or vertical direction) is greater than 2, the second context model is selected, if the absolute sum is greater than 32, the third context model is selected, otherwise (the absolute sum is smaller than 3) the first context model is selected. Furthermore, the context models are different for each component. For the second bin of the bin string, the fourth context model is used and the fifth context model is employed for the remaining bins of the unary part. When the absolute mvd is equal to or greater than 9, e.g. all bins of the truncated unary part are equal to ‘1’, the difference between the absolute mvd value and 9 is coded in a bypass mode with 3rd order Exp-Golomb binarization. In the last step, the sign of the mvd is coded in a bypass mode.
The latest coding technique for the mvd when using CABAC as entropy coder is specified in the current Test Model (HM) of the High Efficiency Video Coding (HEVC) project. In HEVC, the block sizes are variable and the shape specified by a motion vector is referred to as prediction unit (PU). The PU size of the top and the left neighbor may have other shapes and sizes than the current PU. Therefore, whenever relevant, the definition of top and the left neighbor are referred now as top and left neighbor of the top-left corner of the current PU. For the coding itself, only the derivation process for the first bin may be changed in accordance with an embodiment. Instead of evaluating the absolute sum of the MV from the neighbors, each neighbor may be evaluated separately. If the absolute MV of a neighbor is available and greater than 16, the context model index may be incremented resulting in the same number of context models for the first bin, while the coding of the remaining absolute MVD level and the sign is exactly the same as in H.264/AVC.
In the above outlined technique on coding of the mvd, up to 9 bins have to be coded with a context model, while the remaining value of an mvd can be coded in a low complexity bypass mode together with the sign information. This present embodiment describes a technique to reduce the number of bins coded with context models resulting in increased number of bypass and reduces the number of context models necessitated for the coding of mvd. For that, the cut-off value is decreased from 9 to 1 or 2. That means only the first bin specifying if the absolute mvd is greater than zero is coded using context model or the first and the second bin specifying if the absolute mvd is greater than zero and one is coded using context model, while the remaining value is coded in the bypass mode and/or using a VLC code. All bins resulting from the binarization using the VLC code—not using the unary or truncated unary code—are coded using a low complexity bypass mode. In case of PIPE, a direct insertion into and from the bitstream are possible. Moreover, a different definition of the top and the left neighbor to derive better context model selection for the first bin, may be used, if ever.
In an embodiment, Exp-Golomb codes are used to binarize the remaining part of the absolute MVD components. For that, the order of the Exp-Golomb code is variable. The order of the Exp-Golomb code is derived as follows. After the context model for the first bin, and therefore the index of that context model, is derived and coded, the index is used as the order for the Exp-Golomb binarization part. In this embodiment, the context model for the first bin is ranged from 1-3 resulting in the index 0-2, which are used as the order of the Exp-Golomb code. This embodiment can be used for the HE case.
In an alternative to the above outlined technique of using two times five contexts in coding of the absolute MVD, in order to code the 9 unary code binarization bins, 14 context models (7 for each component) could be used as well. For example, while the first and second bins of the unary part could be could be coded with four different contexts as described before, a fifth context could be used for the third bin and a sixth context could be used with respect to the forth bin, while the fifth to ninth bins are coded using a seventh context. Thus, in this case even 14 contexts would be necessitated, and merely the remaining value can be coded in a low complexity bypass mode. A technique to reduce the number of bins coded with context models resulting in increased number of bypass and reduce the number of context models necessitated for the coding of MVD, is to decrease the cut-off value such as, for example, from 9 to 1 or 2. That means only the first bin specifying if the absolute MVD is greater than zero would be coded using a context model or the first and the second bin specifying if the absolute MVD is greater than zero and one would be coded using a respective context model, while the remaining value is coded with a VLC code. All bins resulting from the binarization using the VLC code are coded using a low complexity bypass mode. In case of PIPE, a direct insertion into and from the bitstream is possible. Furthermore, the presented embodiment uses another definition of the top and the left neighbor to derive better context model selection for the first bin. In addition to this, the context modeling is modified in a way so that the number of context models necessitated for the first or the first and second bin is decreased leading to a further memory reduction. Also, the evaluation of the neighbours such as the above neighbour can be disabled resulting in the saving of the line buffer/memory necessitated for storage of mvd values of the neighbours. Finally, the coding order of the components may be split in a way allowing the coding of the prefix bins for both components (i.e. bins coded with context models) followed by the coding of bypass bins.
In an embodiment, Exp-Golomb codes are used to binarize the remaining part of the absolute mvd components. For that, the order of the Exp-Golomb code is variable. The order of the Exp-Golomb code may be derived as follows. After the context model for the first bin, and therefore the index of that context model is derived, the index is used as the order for the Exp-Golomb binarization. In this embodiment, the context model for the first bin is ranged from 1-3 resulting in the index 0-2, which is used as the order of the Exp-Golomb code. This embodiment can be used for the HE case and the number of context models is reduced to 6. In order to reduce the number of context models again and therefore to save memory, the horizontal and the vertical components may share the same context models in a further embodiment. In that case, only 3 context models are necessitated. Furthermore, only the left neighbour may be taken into account for the evaluation in a further embodiment of the invention. In this embodiment, the threshold can be unmodified (e.g. only single threshold of 16 resulting in Exp-Golomb parameter of 0 or 1 or single threshold of 32 resulting in Exp-Golomb parameter of 0 or 2). This embodiment saves the line buffer necessitated for the storage of mvd. In another embodiment, the threshold is modified and is equal to 2 and 16. For that embodiment, in total 3 context models are necessitated for the coding of the mvd and the possible Exp-Golomb parameter is ranged from 0-2. In a further embodiment, the threshold is equal to 16 and 32. Again, the described embodiment is suitable for the HE case.
In a further embodiment of the invention, the cut-off value is decreased from 9 to 2. In this embodiment, the first bin and the second bin may be coded using context models. The context model selection for the first bin can be done as in the state-of-the-art or modified in a way described in the embodiment above. For the second bin, a separate context model is selected as in the state-of-the-art. In a further embodiment, the context model for the second bin is selected by evaluating the mvd of the left neighbour. For that case, the context model index is the same as for the first bin, while the available context models are different than those for the first bin. In total, 6 context models are necessitated (note that the components sharing the context models). Again, the Exp-Golomb parameter may depend on the selected context model index of the first bin. In another embodiment of the invention, the Exp-Golomb parameter is depending on the context model index of the second bin. The described embodiments of the invention can be used for the HE case.
In a further embodiment of the invention, the context models for both bins are fixed and not derived by evaluating either the left or the above neighbours. For this embodiment, the total number of context models is equal to 2. In a further embodiment of the invention, the first bin and the second bin shares the same context model. As a result, only one context model is necessitated for the coding of the mvd. In both embodiments of the invention, the Exp-Golomb parameter may be fixed and be equal to 1. The described embodiment of the invention are suitable for both HE and LC configuration.
In another embodiment, the order of the Exp-Golomb part is derived independently from the context model index of the first bin. In this case, the absolute sum of the ordinary context model selection of H.264/AVC is used to derive the order for the Exp-Golomb part. This embodiment can be used for the HE case.
In a further embodiment, the order of the Exp-Golomb codes is fixed and is set to 0. In another embodiment, the order of the Exp-Golomb codes is fixed and set to 1. In an embodiment, the order of the Exp-Golomb codes is fixed to 2. In a further embodiment, the order of the Exp-Golomb codes is fixed to 3. In a further embodiment, the order of the Exp-Golomb codes is fixed according the shape and the size of the current PU. The presented embodiments can be used for the LC case. Note that the fixed order of the Exp-Golomb part are considered with reduced number of bins coded with context models.
In an embodiment, the neighbors are defined as follows. For the above PU, all PUs covers the current PU are taken into account and the PU with the largest MV used. This is done also for the left neighbor. All PUs covers the current PU are evaluated and the PU with the largest MV is used. In another embodiment, the average absolute motion vector value from all PUs cover the top and the left border the current PU is used to derive the first bin.
For the presented embodiments above, it is possible to change the coding order as follows. The mvd have to be specified for the horizontal and vertical direction one after another (or vice versa). Thus, two bin strings have to be coded. In order to minimize the number of mode switching for the entropy coding engine (i.e. the switch between the bypass and the regular mode), it is possible to code the bins coded with context models for both components in the first step followed by the bins coded in bypass mode in the second step. Note that this is a reordering only.
Please note that the bins resulting from the unary or truncated unary binarization can also be represented by an equivalent fixed length binarization of one flag per bin index specifying whether the value is greater than the current bin index. As an example, the cut-off value for truncated unary binarization of mvd is set to 2 resulting in codewords 0, 10, 11 for values 0, 1, 2. In the corresponding fixed length binarization with one flag per bin index, one flag for bin index 0 (i.e. the first bin) specifies whether the absolute mvd value is greater than 0 or not and one flag for the second bin with bin index 1 specifies whether the absolute mvd value is greater than 1 or not. When the second flag is only coded when the first flag is equal to 1, this results in the same codewords 0, 10, 11.
Next, complexity-scalable representation of the internal state of probability models in accordance with an embodiment as described.
In the HE-PIPE setup, the internal state of a probability model is updated after encoding a bin with it. The updated state is derived by a state transition table lookup using the old state and the value of the coded bin. In the case of CABAC, a probability model can take 63 different states where each state corresponds to a model probability in the interval (0.0, 0.5). Each of these states is used to realize two model probabilities. In addition to the probability assigned to the state, 1.0 minus the probability is also used and a flag called valMps stores the information whether the probability or 1.0 minus the probability is used. This leads to a total of 126 states. To use such a probability model with the PIPE coding concept, each of the 126 states needs to be mapped to one of the available PIPE coders. In current implementations of PIPE coders, this is done by using a lookup-table. An example of such a mapping is depicted in Table A.
In the following, an embodiment is described how the internal state of a probability model can be represented to avoid using a lookup table to convert the internal state to a PIPE index. Solely some simple bit masking operations are needed to extract the PIPE index from the internal state variable of the probability model. This novel complexity-scalable representation of the internal state of a probability model is designed in a two level manner. For applications where low complexity operation is mandatory only the first level is used. It describes only the pipe index and the flag valMps that is used to encode or decode the associated bins. In the case of the described PIPE entropy coding scheme, the first level can be used to differentiate between 8 different model probabilities. Thus, the first level would need 3 bit for the pipeIdx and one further bit for the valMps flag. With the second level each of the coarse probability ranges of the first level is refined into several smaller intervals that support the presentation of probabilities at higher resolutions. This more detailed presentation enables the more exact operation of probability estimators. In general, it is suitable for coding applications that aim towards high RD-performances. As an example this complexity-scaled representation of the internal state of probability models with the usage of PIPE is illustrated as follows:
The first and the second level are stored in a single 8 bit memory. 4 bits are necessitated to store the first level—an index that defines the PIPE index with the value of the MPS on the most significant bit- and another 4 bits are used to store the second level. To implement the behaviour of the CABAC probability estimator, each PIPE index has a particular number of allowed refinement indices depending on how many CABAC states were mapped on the PIPE index. E.g. for the mapping in Table A, the number of CABAC states per PIPE index is depicted in Table B.
During the encoding or decoding process of a bin the PIPE index and valMps can be accessed directly by employing simple bit mask or bit shift operations. Low complexity coding processes necessitate the 4 bits of the first level only and high efficiency coding processes can additionally utilize the 4 bits of the second level to perform the probability model update of the CABAC probability estimator. For carrying out this update, a state transition lookup-table can be designed that does the same state transitions as the original table, but using the complexity-scalable two-level representation of states. The original state transition table consists of two times 63 elements. For each input state, it contains two output states. When using the complexity-scalable representation, the size of the state transition table does not exceed two times 128 elements which is an acceptable increase of table size. This increase depends on how many bits are used to represent the refinement index and to exactly emulate the behavior of the CABAC probability estimator, four bits are needed. However, a different probability estimator could be used, that can operate on a reduced set of CABAC states such that for each pipe index no more than 8 states are allowed. Therefore memory consumption can be matched to the given complexity level of the coding process by adapting the number of bits used to represent the refinement index. Compared to the internal state of model probabilities with CABAC—where 64 probability state indices exist—the usage of table lookups to map model probabilities to a specific PIPE code is avoided and no further conversion is necessitated.
Next, a complexity-scalable context model updating in accordance with an embodiment is described.
For updating a context model, its probability state index may be updated based on one or more previously coded bins. In the HE-PIPE setup, this update is done after encoding or decoding of each bin. Conversely, in the LC-PIPE setup, this update may never be done.
However, it is possible to do an update of context models in a complexity-scalable way. That is, the decision whether to update a context model or not may be based on various aspects. E.g., a coder setup could do no updates for particular context models only like e.g. the context models of syntax element coeff_significant_flag, and do updates for all other context models.
In other words, the selector 402 could be configured to, for symbols of each of a number of predetermined symbol types, perform the selection among the entropy decoders 322 depending on a respective probability model associated the respective predetermined symbol such that the number of predetermined symbol types is lower in the low complexity mode than compared to the high-efficiency mode
Furthermore, criteria for controlling whether to update a context model or not could be, e.g. the size of a bitstream packet, the number of bins decoded so far, or the update is done only after coding a particular fixed or variable number of bins for a context model.
With this scheme for deciding whether to update context models or not, complexity-scalable context model updating can be implemented. It allows for increasing or decreasing the portion of bins in a bitstream for which context model updates are done. The higher the number of context model updates, the better is the coding efficiency and the higher the computational complexity. Thus, complexity-scalable context model updating can be achieved with the described scheme.
In an embodiment, the context model update is done for bins of all syntax elements except the syntax elements coeff_significant_flag, coeff_abs_greater1, and coeff_abs_greater2.
In a further embodiment, the context model update is done for bins of the syntax elements coeff_significant_flag, coeff_abs_greater1, and coeff_abs_greater2 only.
In a further embodiment, the context model update is done for all context models when encoding or decoding of a slice starts. After a particular predefined number of transform blocks being processed, context model update is disabled for all context models until the end of the slice is reached.
For example, the selector 402 may be configured to, for symbols of a predetermined symbol type, perform the selection among the entropy decoders 322 depending on a probability model associated with the predetermined symbol type along with or without updating the associated probability model, such that a length of a learning phase of the sequence of symbols over which the selection for the symbols of the predetermined symbol type is performed along with the update, is shorter in the low complexity mode than compared to the high-efficiency mode.
A further embodiment is identical to the previously described embodiment, but it uses the complexity-scalable representation of the internal state of context models in a way, such that one table stores the “first part” (valMps and pipeIdx) of all context models and a second table stores the “second part” (refineIdx) of all context models. At the point, where the context model updating is disabled for all context models (as described in the previous embodiment), the table storing the “second part” is not needed any longer and can be discarded.
Next, context model updating for a sequence of bins in accordance with an embodiment is described.
In the LC-PIPE configuration, the bins of syntax elements of type coeff_significant_flag, coeff_abs_greater1, and coeff_abs_greater2 are grouped into subsets. For each subset, a single context model is used to encode its bins. In this case, a context model update may be done after coding of a fixed number of bins of this sequence. This is denoted multi-bin update in the following. However, this update may differ from the update using only the last coded bin and the internal state of the context model. E.g., for each bin that was coded, one context model update step is conducted.
In the following, examples are given for the encoding of an exemplary subset consisting of 8 bins. The letter ‘b’ denotes the decoding of a bin and the letter ‘u’ denotes the update of the context model. In the LC-PIPE case only the bin decoding is done without doing context model updates:
In the HE-PIPE case, after decoding of each bin, a context model update is done:
In order to somewhat decrease the complexity, the context model update may be done after a sequence of bins (in this example after each 4 bins, the updates of these 4 bins are done):
That is, the selector 402 may be configured to, for symbols of a predetermined symbol type, perform the selection among the entropy decoders 322 depending on a probability model associated with the predetermined symbol type along with or without updating the associated probability model such that a frequency at which the selection for the symbols of the predetermined symbol type is performed along with the update, is lower in the low complexity mode than compared to the high-efficiency mode.
In this case, after the decoding of 4 bins, 4 update steps follow based on the 4 bins just-decoded. Note that these four update steps can be conducted in one single step by using a lookup special lookup-table. This lookup table stores for each possible combination of 4 bins and each possible internal state of the context model the resulting new state after the four conventional update steps.
In a certain mode, the multi-bin update is used for syntax element coeff_significant_flag. For bins of all other syntax elements, no context model update is used. The number of bins that are coded before a multi-bin update step is done is set to n. When the number of bins of the set is not divisible by n, 1 to n−1 bins remain at the end of the subset after the last multi-bin update. For each of these bins, a conventional single-bin update is done after coding all of these bins. The number n may be any positive number greater than 1. Another mode could be identical to the previous mode, except that multi-bin update is done for arbitrary combinations of coeff_significant_flag, coeff_abs_greater1 and coeff_abs_greater2 (instead of coeff_significant_flag only). Thus, this mode would be more complex than the other. All other syntax elements (where multi-bin update is not used) could be divided into two disjoint subsets where for one of the subsets, single bin update is used and for the other subset no context model update is used. Any possible disjoint subsets are valid (including the empty subset).
In an alternative embodiment, the multi-bin update could be based on the last m bins only that are coded immediately before the multi-bin update step. m may be any natural number smaller than n. Thus, decoding could be done like:
That is, the selector 402 may be configured to, for symbols of a predetermined symbol type, perform the selection among the entropy decoders 322 depending on a probability model associated with the predetermined symbol type, along with updating the associated probability model every n-th symbol of the predetermined type based on m most recent symbols of the predetermined symbol type such that the ratio n/m is higher in the low complexity mode than compared to the high-efficiency mode.
In a further embodiment, for syntax element coeff_significant_flag, the context modeling scheme using a local template as described above for the HE-PIPE configuration may be used to assign context models to bins of the syntax element. However, for these bins, no context model update is used.
Further, the selector 402 may be configured to, for symbols of a predetermined symbol type, select one of a number of contexts depending on a number of previously retrieved symbols of the sequence of symbols and perform the selection among the entropy decoders 322 depending on a probability model associated with the selected context, such that the number of contexts, and/or the number of previously retrieved symbols, is lower in the low complexity mode than compared to the high-efficiency mode.
Probability Model Initialization Using 8 Bit Initialization Values
This section describes the initialization process of the complexity-scalable internal state of probability models using a so-called 8 bit initialization value instead of two 8 bit values as is the case in the state-of-the-art video coding standard H.265/AVC. It consists of two parts which are comparable to the initialization value pairs used for probability models in CABAC of H.264/AVC. The two parts represent the two parameters of a linear equation to compute the initial state of a probability model, representing a particular probability (e.g. in form of a PIPE index) from a QP:
Two different modes are available to initialize a probability model using the given initialization value. The first mode is denoted QP-independent initialization. It only uses the PIPE index and valMps defined in the second part of the initialization value for all QPs. This is identical to the case where the slope equals 0. The second mode is denoted QP-dependent initialization and it additionally uses the slope of the first part of the initialization value to alter the PIPE index and to define the refinement index. The two parts of an 8 bit initialization value is illustrated as follows:
It consists of two 4 bit parts. The first part contains an index that points to 1 out of 16 different predefined slopes that are stored in an array. The predefined slopes consist of 7 negative slopes (slope index 0-6), one slope that equals zero (slope index 7) and 8 positive slopes (slope index 8-15). The slopes are depicted in Table C.
All values are scaled by a factor of 256 to avoid the usage of floating point operations. The second part is the PIPE index which embodies the ascending probability of valMps=1 between the probability interval p=0 and p=1. In other words, PIPE coder n has to operate at a higher model probability than PIPE coder n−1. For every probability model one PIPE probability index is available and it identifies the PIPE coder whose probability interval contains the probability of pvalMPs=1 for QP=26.
The QP and the 8 bit initialization value are necessitated to calculate the initialization of the internal state of the probability models by computing a simple linear equation in the form of y=m*(QP−QPref)+256*b. Note m defines the slope that is taken from Table C by using the slope index (the first part of the 8 bit initialization value) and b denotes the PIPE coder at QPref=26 (the second part of the 8 bit initialization value: “PIPE Probability Index”). Then, va1MPS is 1 and the pipeIdx equals (y−2048)>>8 if y is greater than 2047. Otherwise, va1MPS is 0 and pipeIdx equals (2047−y)>>8. The refinement index equals (((y−2048) & 255)*numStates)>>8 if va1MPS equals 1. Otherwise, the refinement index equals (((2047−y) & 255)*numStates)>>8. In both cases, numStates equals the number of CABAC states of the pipeIdx as depicted in Table B.
The above scheme can not only be used in combination with PIPE coders, but also in connection with the above-mentioned CABAC schemes. In the absence of PIPE, the number of CABAC states, i.e. the probability states between which the state transition in the probability update is performed (pState_current[bin]), per PIPE Idx (i.e. the respective most significant bits of pState_current[bin]) is then only a set of parameters which realizes, in fact, a piece-wise linear interpolation of the CABAC state depending on the QP. Furthermore, this piece-wise linear interpolation can also virtually be disabled in the case where the parameter numStates uses the same value for all PIPE Idx. For example, setting numStates to 8 for all cases yields a total of 16*8 states and the computation of the refinement index simplifies to ((y−2048) & 255)>>5 for va1MPS equal 1 or ((2047-y)&255)>>5 for va1MPS equal 0. For this case, mapping the representation using va1MPS, PIPE idx, and refinement idx back to the representation used by the original CABAC of H.264/AVC is very simple. The CABAC state is given as (PIPE Idx <<3)+refinement Idx. This aspect is described further below with regard to
Unless the slope of the 8 bit initialization value equals zero or unless the QP equals 26 it is necessitated to compute the internal state by employing the linear equation with the QP of the encoding or decoding process. In the case of the slope equaling to zero or that the QP of the current coding process equals 26 the second part of 8 bit initialization value can be used directly for initializing the internal state of a probability model. Otherwise the decimal part of the resulting internal state can be further exploited to determine a refinement index in high efficiency coding applications by linear interpolation between the limits of the specific PIPE coder. In this embodiment the linear interpolation is executed by simply multiplying the decimal part with the total number of refinement indices available for the current PIPE coder and mapping the result to the closest integer refinement index.
The process of initialization of the internal state of the probability models could be varied with regard to the number of PIPE probability index states. In particular, the double occurrence of the equal probable mode using PIPE coder El, i.e. the use of two different PIPE indices to distinguish between MPS being 1 or 0, could be avoided as follows. Again, the process could be invoked during the start of parsing of the slice data, and the input of this process could an 8 bit initialization value as depicted in Table E, which would be, for example, transmitted within the bit stream for every context model to be initialized.
The first 4 bits define a slope index and are retrieved by masking the bits b4-b7. For every slope index a slope (m) is specified and displayed in Table F.
Bits b0-b3, the last 4 bits of the 8 bit initialization value, identify the probIdx and describe the probability at a predefined QP. probIdx 0 indicates the highest probability for symbols with value 0 and respectively, probIdx 14 indicates the highest probability for symbols with value 1. Table G shows for each probIdx the corresponding pipeCoder and its valMps.
With both values the calculation of the internal state could be done by using a linear equation like y=m*x+256*b, where m denotes the slope, x denotes the QP of the current slice and b is derived from the probIdx as shown in the following description. All values in this process are scaled by a factor of 256 to avoid the usage of floating point operations. The output (y) of this process represents the internal state of the probability model at the current QP and is stored in a 8 bit memory. As shown in G the internal state consists of the valMPs, the pipeIdx and the refineIdx.
The assignment of the refineIdx and pipeIdx is similar to the internal state of the CABAC probability models (pStateCtx) and is presented in H.
In an embodiment the probIdx is defined at QP26. Based on the 8 bit initialization value the internal state (valMps, pipeIdx and refineIdx) of a probability model is processed as described in the following pseudo-code:
As shown in the pseudo code the refineIdx is calculated by linearly interpolating between the interval of the pipeIdx and quantizing the result to the corresponding refineIdx. The offset specifies the total number of refineIdx for each pipeIdx. The interval [7, 8) of fullCtxState/256 is divided in half The interval [7, 7.5) is mapped to pipeIdx=0 and valMps=0 and the interval [7.5, 8) is mapped to pipeIdx=0 and valMps=1.
Note the slope indicates the dependency of the probIdx and the QP. If the slopeIdx of the 8 bit initialization value equals 7 the resulting internal state of the probability model is the same for all slice QPs—hence the initialization process of the internal state is independent from the current QP of the slice.
That is, selector 402 may initialize the pipe indices to be used in decoding the following portion of the datastream such as the whole stream or the next slice, using the syntax element indicating the quantization step size QP used in order to quantize the data of this portion, such as the transform coefficient levels contained therein using this syntax element as an index into a table which may be common for both modes, LC and HE. The table such as table D may comprise pipe indices for each symbol type, for a respective reference QPref, or other data for each symbol type. Depending on the actual QP of the current portion, the selector may compute a pipe index value using the respective table entry a indexed by the actual QP and QP itself, such as by multiplication a with (QP−QPref). The only difference in LC and HE mode: The selector computes the result merely at a lower accuracy in case of LC compared to HE mode. The selector may, for example, merely use the integer part of the computation result. In HE mode, the higher accuracy remainder, such as the fractional part, is used to select one of available refinement indices for the respective pipe index as indicated by the lower accuracy or integer part. The refinement index is used in HE mode (in potentially more seldomly also in LC mode) in order to perform the probability adaptation such as by using the above-mentioned table walk. When leaving the available indices for the current pipe index at the higher bound, then the higher pipe index is selected next with minimizing the refinement index. When leaving the available indices for the current pipe index at the lower bound, then the next lower pipe index is selected next with maximizing the refinement index to the maximum available for the new pipe index. The pipe index along with the refinement index define the probability state, but for the selection among the partial streams, the selector merely uses the pipe index. The refinement index merely serves for tracking the probability more closely, or in a finer accuracy.
The above discussion also showed, however, that a complexity scalability may be achieved independent from the PIPE coding concept of
Some of the above embodiments made use of the aspect of
See, for example, the motion vector difference coding denoted above. The desymbolizer 602 may be configured such that the mapping function uses a truncated unary code to perform the mapping within a first interval of the domain of integer-valued syntax elements below a cutoff value and a combination of a prefix in form of the truncated unary code for the cutoff value and a suffix in form of a VLC codeword within a second interval of the domain of integer-valued syntax elements inclusive and above the cutoff value, wherein the decoder may comprise an entropy decoder 608 configured to derive a number of first bins of the truncated unary code from the data stream 601 using entropy decoding with varying probability estimation and a number of second bins of the VLC codeword using a constant equi-probability bypass mode. In HE mode, the entropy coding may be more complex than in LC coding as illustrated by arrow 609. That is, context-adaptivity and/or probability adaptation may be applied in HE mode and suppressed in LC mode, or the complexity may be scaled in other terms, as set out above with respect to the various embodiments.
An encoder fitting to decoder of
An encoder fitting to decoder of
Again, it should be mentioned that the embodiment of
It has briefly been noted above that the mode switching ability explained with respect to some of the above embodiments may, in accordance with alternative embodiments, be left away. To make this clear, reference is made to
In particular,
In order to explain this in more detail, reference is briefly made to
Before describing in more detail, as to how the entropy decoder 409 could, in accordance with the above description, be implemented in order to perform the just-mentioned tasks, the description now focuses on a possible implementation of the reconstructor 404 which uses the motion vector differences 800 and the integer values thereof as obtained by the desymbolizor 314 by re-binarizing the bins of codes 106 and 108 with the re-binarization being illustrated in
Likewise, the reconstructor 404 may be configured to reduce the information content to be transferred by way of the motion vector differences further (beyond the spatial and/or temporal prediction of motion vectors) by using a multi-hypothesis prediction concept according to which, firstly, a list of motion vector predictors is generated for each block or merge group, with then, explicitly or implicitly transmitting within the data stream information on the index of the predictor to be actually used to predict the motion vector difference. See, for example, the non-shaded block 122 in
It is essential to note that in the above description, the whole details provided with the
For a better understanding of the just-outlined prediction scheme, see
Thus, proceeding further with the description of the implementations of the entities shown in
The reconstructor 404 may, as described above, spatially and/or temporally predict the horizontal and vertical components of motion vectors so as to obtain predictors 126 for the horizontal and vertical components of the motion vector and reconstruct the horizontal and vertical components of the motion vectors by refining the predictors 826 using the horizontal and vertical components of the motion vector differences, such as simply by adding the motion vector difference to the respective predictor.
Further, the reconstructor 404 may be configured to predict the horizontal and vertical components of motion vectors in different manners so as to obtain an ordered list of predictors for the horizontal and vertical component of motion vectors, obtain an list index from the data stream and reconstruct the horizontal and vertical components of motion vectors by refining the predictor to which a predictor of the list to which the list index points using the horizontal and vertical components of the motion vector differences.
Further, as has already been described above, the reconstructor 404 may be configured to reconstruct the video using the motion-compensated prediction by applying the horizontal and vertical component 802x,y of the motion vectors at a spatial granularity defined by a subdivision of the video's pictures into blocks wherein the reconstructor 404 may use merging syntax elements present in the data stream 401 so as to group the blocks into merge groups and apply the integer values of the horizontal and vertical components 802x,y of the motion vector differences obtained by the binarizer 314, in units of merge groups.
The reconstructor 404 may derive the subdivision of the video's pictures into blocks from a portion of the data stream 401 which excludes the merging syntax elements. The reconstructor 404 may also adapt the horizontal and vertical components of the predetermined motion vector for all blocks of an associated merge group, or refine same by the horizontal and vertical components of the motion vector differences associated with the blocks of the merge group.
For sake of completeness only,
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 signal 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 Blue-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. The data carrier, the digital storage medium or the recorded medium are typically tangible and/or non-transitionary.
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.
A further embodiment according to the invention comprises an apparatus or a system configured to transfer (for example, electronically or optically) a computer program for performing one of the methods described herein to a receiver. The receiver may, for example, be a computer, a mobile device, a memory device or the like. The apparatus or system may, for example, comprise a file server for transferring the computer program to the receiver.
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.
The present application is a continuation of U.S. patent application Ser. No. 16/454,387 filed Jun. 27, 2019, which is a continuation of U.S. patent application Ser. No. 16/259,815, filed Jan. 28, 2019, now U.S. Pat. No. 10,432,940, which is a continuation of U.S. patent application Ser. No. 16/103,266, filed Aug. 14, 2018, now U.S. Pat. No. 10,306,232, which is a continuation of U.S. patent application Ser. No. 15/880,772 filed Jan. 26, 2018, now U.S. Pat. No. 10,148,962, which is a continuation of U.S. patent application Ser. No. 15/641,992 filed Jul. 5, 2017, now U.S. Pat. No. 9,936,227, which is a continuation of U.S. patent application Ser. No. 15/238,523 filed Aug. 16, 2016, now U.S. Pat. No. 9,729,883, which is a continuation of U.S. patent application Ser. No. 14/108,108 filed Dec. 16, 2013, now U.S. Pat. No. 9,473,170, which is a continuation of International Application PCT/EP2012/061613 filed Jun. 18, 2012, and additionally claims priority from U.S. Provisional Patent Applications 61/497,794 filed Jun. 16, 2011 and 61/508,506 filed Jul. 15, 2011, all of which are incorporated herein by reference in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5381145 | Allen | Jan 1995 | A |
| 5717394 | Schwartz | Feb 1998 | A |
| 5847776 | Khmelnitsky | Dec 1998 | A |
| 6771197 | Yedidia | Aug 2004 | B1 |
| 6894628 | Marpe | May 2005 | B2 |
| 6900748 | Marpe | May 2005 | B2 |
| 6943710 | Marpe | Sep 2005 | B2 |
| 7221296 | Ziauddin | May 2007 | B2 |
| 7535387 | Delva | May 2009 | B1 |
| 7656320 | Schneider | Feb 2010 | B2 |
| 7884743 | Sakaguchi | Feb 2011 | B2 |
| 7932843 | Demircin | Apr 2011 | B2 |
| 7956930 | Sullivan | Jun 2011 | B2 |
| 8351500 | Shimofure | Jan 2013 | B2 |
| 8699562 | Park | Apr 2014 | B2 |
| 8806050 | Chen | Aug 2014 | B2 |
| 8902988 | Rojals et al. | Dec 2014 | B2 |
| 9490838 | Schwarz | Nov 2016 | B2 |
| 9930371 | George et al. | Mar 2018 | B2 |
| 10630988 | George et al. | Apr 2020 | B2 |
| 20020013150 | Kerofsky et al. | Sep 2002 | A1 |
| 20020131506 | Kerofsky et al. | Sep 2002 | A1 |
| 20020176631 | Li | Nov 2002 | A1 |
| 20050012648 | Marpe | Jan 2005 | A1 |
| 20050013372 | Srinivasan | Jan 2005 | A1 |
| 20050036551 | Winger | Feb 2005 | A1 |
| 20050038837 | Marpe | Feb 2005 | A1 |
| 20050126481 | Xue et al. | Jun 2005 | A1 |
| 20060209961 | Han et al. | Sep 2006 | A1 |
| 20070009027 | Zhu et al. | Jan 2007 | A1 |
| 20070040711 | Ziauddin | Feb 2007 | A1 |
| 20070041653 | Lafon | Feb 2007 | A1 |
| 20070065026 | Lee et al. | Mar 2007 | A1 |
| 20070217702 | Sung | Sep 2007 | A1 |
| 20070242894 | Kautzer et al. | Oct 2007 | A1 |
| 20070274676 | Diomelli et al. | Nov 2007 | A1 |
| 20080162432 | Wang | Jul 2008 | A1 |
| 20080165036 | Shima | Jul 2008 | A1 |
| 20080298464 | Hinz et al. | Dec 2008 | A1 |
| 20090002379 | Baeza | Jan 2009 | A1 |
| 20090180536 | Shimofure | Jul 2009 | A1 |
| 20090201986 | Schwarz | Aug 2009 | A1 |
| 20090256729 | Schneider | Oct 2009 | A1 |
| 20090304071 | Shi | Dec 2009 | A1 |
| 20100127904 | Oxman et al. | May 2010 | A1 |
| 20100266048 | Yang et al. | Oct 2010 | A1 |
| 20100303147 | Miyazaki | Dec 2010 | A1 |
| 20100316118 | Li | Dec 2010 | A1 |
| 20110206125 | Chien et al. | Aug 2011 | A1 |
| 20110206135 | Drugeon | Aug 2011 | A1 |
| 20110216833 | Chen | Sep 2011 | A1 |
| 20120014429 | Zhao | Jan 2012 | A1 |
| 20120093226 | Chien | Apr 2012 | A1 |
| 20120189058 | Chen et al. | Jul 2012 | A1 |
| 20120207220 | Kim | Aug 2012 | A1 |
| 20120287237 | Piccinelli | Nov 2012 | A1 |
| 20120314771 | Lim | Dec 2012 | A1 |
| 20130027230 | Marpe | Jan 2013 | A1 |
| 20130188700 | Guo | Jul 2013 | A1 |
| 20170223379 | Chuang | Aug 2017 | A1 |
| 20170366810 | George et al. | Dec 2017 | A1 |
| 20180262770 | Budagavi | Sep 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 1210429 | Mar 1999 | CN |
| 1221290 | Jun 1999 | CN |
| 1878309 | Dec 2006 | CN |
| 1933601 | Mar 2007 | CN |
| 101009939 | Aug 2007 | CN |
| 101115200 | Jan 2008 | CN |
| 101223780 | Jul 2008 | CN |
| 101304522 | Nov 2008 | CN |
| 101478672 | Jul 2009 | CN |
| 101653003 | Feb 2010 | CN |
| 101820548 | Sep 2010 | CN |
| 101841707 | Sep 2010 | CN |
| 101902639 | Dec 2010 | CN |
| 101933328 | Dec 2010 | CN |
| 101951516 | Jan 2011 | CN |
| 107347161 | Nov 2017 | CN |
| 1294193 | Mar 2003 | EP |
| 1727371 | Nov 2006 | EP |
| 2257069 | Dec 2010 | EP |
| 2003153265 | May 2003 | JP |
| 2005223533 | Aug 2005 | JP |
| 2005525018 | Aug 2005 | JP |
| 2007020141 | Jan 2007 | JP |
| 101005287 | Jul 2007 | JP |
| 2007228582 | Sep 2007 | JP |
| 2007300455 | Nov 2007 | JP |
| 2007306370 | Nov 2007 | JP |
| 2009171188 | Jul 2009 | JP |
| 2009525627 | Jul 2009 | JP |
| 101517899 | Aug 2009 | JP |
| 2009268031 | Nov 2009 | JP |
| 2010268094 | Nov 2010 | JP |
| 2010538547 | Dec 2010 | JP |
| 2012147248 | Aug 2012 | JP |
| 5925884 | Apr 2016 | JP |
| 6560393 | Aug 2019 | JP |
| 20060038189 | May 2006 | KR |
| 102187981 | Dec 2020 | KR |
| 2336661 | Oct 2008 | RU |
| 2371881 | Oct 2009 | RU |
| 2406258 | Aug 2010 | RU |
| 2005022924 | Mar 2005 | WO |
| 2009017301 | Feb 2009 | WO |
| 2009029797 | Mar 2009 | WO |
| WO-2011074874 | Jun 2011 | WO |
| 2011128268 | Oct 2011 | WO |
| 2010063883 | Jun 2020 | WO |
| Entry |
|---|
| Marpe 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 13.7: 620-636. (Year: 2003). |
| Dai et al. “Motion vector coding based on predictor selection and boundary-matching estimation.” 2009 IEEE International Workshop on Multimedia Signal Processing. IEEE . (Year: 2009). |
| Notice of Acceptance for Patent Application issued in corresponding Australian Patent Application No. 2019203279 dated Nov. 12, 2020. |
| Decision to Grant Patent issued in corresponding Korean Patent Application No. 10-2020-7015415 dated Feb. 22, 2021, with English translation. |
| T. Wiegand, et al., WD3: Working Draft 3 of High-Efficiency Video Coding. JCT-VC of ITU-T and ISO/IEC. JCTVC-E603. Ver.8. Jun. 27, 2011, pp. 1-215. |
| V. Sze, et al. Simplified MVD context selection (Extension of E324). JCT-VC of ITU-T and ISO/IEC. JCTVC-F133. Ver.3. Jul. 6, 2011, pp. 1-2. |
| JCT-VC. Encoder-side description of Test Model under Consideration. JCT-VC of ITU-T and ISO/IEC. JCTVC-B204. Oct. 3, 2010, pp. 1-19. |
| Decision to Grant Patent issued in corresponding Japanese Patent Application No. 2018-121555 dated Mar. 5, 2021, with English translation. |
| Notice of Allowance issued in corresponding Israeli Patent Application No. 265636 dated Mar. 2, 2021. |
| Office Action issued in corresponding Indian Patent Application 201938042690 dated Mar. 19, 2021, with English translation. |
| Notice of Allowance issued in corresponding Chinese Patent Application No. 201710477823.7 dated Mar. 4, 2021, with English translation. |
| Office Action dated Mar. 4, 2020 in Chinese Application 201710477823.7. |
| Notice of Issuance dated Mar. 5, 2020 in Chinese Application 201710694391.5. |
| Notice of Allowance dated Feb. 26, 2020 in Chinese Application 201710491640.0. |
| Notice of Issuance dated Mar. 25, 2020 in Chinese Application 201710962467.8. |
| Notice of Issuance dated Mar. 19, 2020 in Chinese Application 201710694312.0. |
| Office Action dated Apr. 8, 2020 in Australian Patent 2019203792. |
| Notice of Issuance dated Mar. 30, 2020 in Chinese Application 201710977462.2. |
| Office Action dated Apr. 2, 2020 in European Application 18203401.7. |
| Decision to Grant Patent issued in corresponding Ukrainian Patent Application No. a 2017 01791 dated Mar. 24, 2021, with English translation. |
| Office Action dated Sep. 21, 2020 in Russian Application 2019127048. |
| Office Action dated Sep. 25, 2020 in Malaysian Application PI 2014000425. |
| Office Action dated Sep. 30, 2020 in Chinese Application 201710477823.7. |
| Office Action dated Aug. 19, 2020 in Indonesian Application P-00 2018 02498. |
| Decision to Grant a Patent issued in corresponding Japanese Patent Application No. 2018-216486 dated Dec. 1, 2020, with English translation. |
| Search Report issued in corresponding African Patent Application No. AP/P/2018/011102 dated Nov. 29, 2020. |
| Office Action issued in corresponding Russian Patent Application No. 2018120845 dated Dec. 14, 2020. |
| Notice of Issuance issued in corresponding Chinese Patent Application No. 201710694392X dated Dec. 14, 2020. |
| Decision on Grant, dated Mar. 14, 2016, issued in parallel Russian patent application No. 2014101164, with English translation, 26 pages. |
| Decision on Grant, dated May 12, 2016, issued in parallel Japanese patent application No. 2014-515231, 3 pages. |
| Decision to Grant dated Mar. 22, 2016 in parallel Japanese Patent Application No. 2014-515230, and English translation thereto, 5 pages. |
| Dorot V. L. et al., “Explanatory Dictionary on Modern Computer Vocabulary”, 3rd revised and expanded edition, St. Petersburg, “BHV-Petersburg”, p. 381, 314 and 452; 6 pages. |
| Encoder-side description of test model under consideration, Joint Collaborative Team in Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IÄEC JTC1/SC29/WG11, Jul. 28, 2010, 2nd Meeting: Geneva, CH, pp. 1-2, 15-19, 8 pages. |
| Kirchhoffer et al., “Reduced complexity PIPE coding using systematic v2v code [online], Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 4th Meeting”, Daegu, KR, Jan. 18, 2011 [JCTVC-D380], pp. 1-10, 11 pages. |
| Marpe, et al., “Novel entropy coding concept”, JCT-VC Meeting, Apr. 15, 2010, 18 pages. |
| Marpe, Detlev, Heiko Schwarz, and Thomas Wiegand. “Context-based adaptive binary arithmetic coding in the H. 264/AVC video compression standard.” Circuits and Systems for Video Technology, IEEE Transactions on 13.7 (2003): 620-636. |
| Marpe, et al., Entropy coding in video compression using probability interval partitioning, Picture Coding Symposium (PCS), 2010, pp. 66-69, 5 pages. |
| Marpe, et al., “Unified PIPE-Based Entropy Coding for HEVC”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting: Torino, IT, Jul. 14-22, 2011, JCTVC-F268, pp. 1-16, 21 pages. |
| Non-Final Office Action dated Apr. 20, 2016, issued by the U.S. Patent Office, in parallel U.S. Appl. No. 14/108,132, 11 pages. |
| Notice of Allowance, dated May 20, 2016, issued in parallel U.S. Appl. No. 14/108,108, 35 pages. |
| Office Action, dated Apr. 26, 2016, issued in parallel Chinese patent application No. 2012800399222, with English translation, 14 pages. |
| Office Action, dated Mar. 3, 2015, issued in parallel Japanese patent application No. 2014-515229, with English translation, 19 pages. |
| Office Action, dated Mar. 3, 2015, issued in parallel Japanese patent application No. 2014-515230, with English translation, 11 pages. |
| Office Action, dated May 19, 2016, issued in parallel Russian patent application No. 2014101166, with English translation, 5 pages. |
| Office Action, dated May 9, 2016, issued in parallel Chinese patent application No. 201280039832.3, with English translation, 10 pages. |
| Sugimoto, et al., “High Efficient 1 byte fixed length coding for Low Complexity Entropy Coding Aa not PIPE/V2F”, MPEG Meeting, Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11, Jan. 2011, pp. 1-7. |
| Sullivan, G., “Meeting report of the first meeting of the Joint Collaborative Team on Video Coding (JVT-VC), JCT-VC Management”, 16 pages. |
| Sze, et al., “Simplified MVD context selection (Extension of JCTVC-E324)”, JCT-VC Meeting, Jul. 14, 2011, 4 pages. |
| Wiegand, et al., “WD3: Working Draft 3 of High-Efficiency Video Coding”, Document: JCTVC-E603; joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Mar. 2011, 160 pages. |
| Winken, et al., “Video coding technology proposal by Fraunhofer HHI”, JCT-VC Meeting; Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-TSG.16, Apr. 2010, pp. 1-44. |
| Winken, M., Description of video coding technology proposal by Fraunhofer HHI. Joint Collaborative Team on Video Coding (JCT-VC). Dresden, DE., Apr. 15-23, 2010, 44 pages. |
| Office Action dated Sep. 2, 2016 in Chinese Application 2012800398963. |
| Notice of Allowance dated Oct. 28, 2016 in U.S. Appl. No. 15/238,294. |
| Office Action dated Nov. 21, 2016 in U.S. Appl. No. 15/238,523. |
| Office Action dated Dec. 1, 2016 in U.S. Appl. No. 14/108,173. |
| Decision of Grant dated Nov. 8, 2016 in Japanese Application No. 2014/515229. |
| Decision of Grant dated Nov. 14, 2016 in Ukranian Application 2016-00952. |
| T. Nguyen, et al., “Modified binarization and coding of MVD for PIPE/CABAC”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 6th Meeting: Torino, IT, Jul. 14-22, 2011, JCTVC-F455 (version 2), URL, http://phenix.int-evry.fr/jct/doc_end_user/current_document.php?id=2930. |
| T. Nguyen, et al., “Modified binarization and coding of MVD for PIPE/CABAC”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting: Torino, IT, Jul. 14-22, 2011, JCTVC-F455 (version 3), URL, http://phenix.it-sudparis.eu/jct/doc_end_user/documents/6_Torino/wg11/JCTVC-F455-v3.zip. |
| Notice of Allowance dated Dec. 16, 2016 in U.S. Appl. No. 15/244,126. |
| Decision on Grant dated Dec. 1, 2016 issued in Russian Patent Application 2014101166. |
| Decision on Grant dated Dec. 13, 2016 issued in Ukranian Patent Application a 2016 00953. |
| Notice of Allowance dated Feb. 14, 2017 in U.S. Appl. No. 15/244,156. |
| Notice of Allowance dated Mar. 28, 2017 in U.S. Appl. No. 15/419,006. |
| Notice of Allowance dated Apr. 25, 2017 In U.S. Appl. No. 15/238,523. |
| Notice of Allowance dated May 10, 2017 in U.S. Appl. No. 15/430,826. |
| Office Action dated May 23, 2017 in Japanese Application 2016-084671. |
| Notice of Allowance dated Aug. 7, 2017 in U.S. Appl. No. 15/595,097. |
| Notice of Allowance dated Oct. 26, 2017 in U.S. Appl. No. 15/641,992. |
| Notice of Allowance dated Oct. 25, 2017 in U.S. Appl. No. 15/642,085. |
| Notice of Allowance dated Oct. 26, 2017 in U.S. Appl. No. 15/636,425. |
| Decision to Grant dated Nov. 20, 2017 in Russian Application 2016129117. |
| Marpe, Detlev, et al., “Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard”, Jul. 7, 2003, IEEE Transactions on Circuits and Systems for Video Technology, vol. 13. |
| Notice of Allowance dated Dec. 13, 2017 in U.S. Appl. No. 15/674,150. |
| Office Action dated Nov. 14, 2017 in Japanese Application No. 2016-238858. |
| Notice of Allowance dated Jan. 17, 2018 in U.S. Appl. No. 15/636,476. |
| Notice of Allowance dated Mar. 13, 2018 in U.S. Appl. No. 15/636,451. |
| Notice of Allowance dated Apr. 17, 2018 in U.S. Appl. No. 15/843,679. |
| Notice of Allowance dated Apr. 27, 2018 in U.S. Appl. No. 15/880,837. |
| Notice of Allowance dated May 14, 2018 in U.S. Appl. No. 15/880,772. |
| Notification of the First Office Action Chinese Patent Application No. 2017106944246 dated Jul. 4, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 201710694423.1 dated Jul. 10, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2017106943544 dated Aug. 31, 2018. |
| Notification of the First Office Action Chinese Patent Application No. 2017106942683 dated Sep. 4, 2018. |
| Notice of Allowance U.S. Appl. No. 16/040,764 dated Oct. 3, 2018. |
| Notice of Allowance U.S. Appl. No. 16/006,288 dated Oct. 3, 2018. |
| Notice of Allowance U.S. Appl. No. 16/037,914 dated Oct. 26, 2018. |
| Notice of Allowance U.S. Appl. No. 16/103,266 dated Oct. 26, 2018. |
| Non-final Office Action U.S. Appl. No. 15/918,105 dated Nov. 9, 2018. |
| First Office Action Chinese Patent Application No. 201710694799 dated Dec. 29, 2018. |
| Notice of Acceptance of Patent Application Australian Patent Application No. 2017210534 dated Feb. 4, 2019. |
| Notice of Acceptance of Patent Application Australian Patent Application No. 2019200328 dated Feb. 20, 2019. |
| Office Action Philippines Patent Application No. 1/2018/500353 dated Feb. 15, 2019. |
| Office Action Philippines Patent Application No. 1/2018/500355 dated Feb. 15, 2019. |
| Office Action Philippines Patent Application No. 1/2018/500356 dated Feb. 15, 2019. |
| Petition for Inter Partes Review—Inter Partes Review No. 2019-00659 U.S. Pat. No. 9,768,804 dated Feb. 11, 2019. |
| Advanced Video Coding Standard, International Telecommunication Union Recommendation H.264, 9.3.1.1 (5th Ed. Mar. 2010) (“AVC”). |
| Working Draft of High Efficiency Video Coding (HEVC), Joint Collaborative Team on Video Coding (JCT-VC), Doc. 503 (Jan. 2011) (“Draft HEVC”). |
| European Computer Manufacturers Association Standard No. 43: 8-bit coded character set structure and rules (Dec. 1991) (“ECMA”). |
| S. Van Leuven et al., A low-complexity closed-loop H.264/AVC to quality-scalable SVC transcoder, 2011 17th International Conference on Digital Signal Processing (DSP) Corfu, 2011, pp. 1-6 (Aug. 2011). |
| Summary sheet of Seung-Seok Lee et al., High Speed Decoding of Entropy Codes in H.264/AVC Based on Symbol Prediction, Key Engineering Materials (KEM), vol. 321-323. |
| Notification of Reasons for Refusal Japanese Patent Application No. 2018-070521 dated Mar. 19, 2019. |
| Extended European Search Report EP Application No. 18203401.7 dated Mar. 19, 2019. |
| Decision to Grant a Patent Korean Patent Application No. 10-2018-7000824 dated Mar. 26, 2019. |
| Notice of Allowance U.S. Appl. No. 15/918,105 dated Mar. 26, 2019. |
| Notice of Allowance U.S. Appl. No. 16/259,738 dated Mar. 27, 2019. |
| Notice of Allowance U.S. Appl. No. 16/259,815 dated Mar. 28, 2019. |
| Notice of Allowance U.S. Appl. No. 16/238,013 dated May 2, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500329 dated May 10, 2019. |
| Decision to Grant Patent Japanese Patent Application No. 2018-070521 dated Jun. 25, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500351 dated Jun. 26, 2019. |
| Office Action Chinese Patent Application No. 201710478537.2 dated Jul. 15, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500355 dated Jun. 26, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500356 dated Jul. 1, 2019. |
| Decision to Grant Russian Patent Application No. 2018100106 dated Jun. 28, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500352 dated Jul. 1, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500348 dated Jul. 1, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500349 dated Jul. 1, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500350 dated Jul. 1, 2019. |
| Notice of Allowance Philippines Application No. 1/2018/500353 dated Jul. 1, 2019. |
| First Office Action Chinese Patent Application No. 201710477825.6 dated Jul. 31, 2019. |
| First Office Action Chinese Patent Application No. 201710694930.5 dated Jul. 29, 2019. |
| Communication EP Application No. 12728084.0 dated Jul. 29, 2019. |
| Bin Guo et al., “A High Speed CABAC Algorithm Based on Probability Estimation Update”, Fourth International Conference on Image and Graphics, 2007 IEEE, pp. 195-199. |
| First Office Action Chinese Patent Application No. 201710477936.7 dated Jul. 31, 2019. |
| First Office Action Chinese Patent Application No. 201710695327.9 dated Jul. 29, 2019. |
| Office Action Japanese Patent Application No. 2018-121555 dated Jul. 30, 2019. |
| Tung Nguyen, et al., A Complexity Scalable Entropy Coding Scheme for Video Compression, 2012 Picture Coding Symposium, USA, IEEE, May 7, 2012, pp. 421-424. |
| Liwei Guo et al., CE1 B3: 8-bit Linear Initialization for CABAC, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 8th Meeting: San Jose, Feb. 1-10, 2012, [JCTVC-H0535], ITU-T, Jan. 2012, pp. 1-7. |
| Liwei Guo et al., “Non-Cei: 8 bit Initialization for CABAC”, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 7th Meeting: Geneva Nov. 21-30, 2011 [JCTVC-G837], ITU-T Nov. 2011, pp. 1-6. |
| First Office Action Chinese Patent Application No. 201710694391.5 dated Aug. 2, 2019. |
| First Office Action Chinese Patent Application No. 201710491640.0 dated Aug. 5, 2019. |
| First Office Action Chinese Patent Application No. 201710477937.1 dated Aug. 5, 2019. |
| First Office Action Chinese Patent Application No. 201710477823.7 dated Aug. 2, 2019. |
| Office Action dated Aug. 14, 2019 in Chinese Application 201710694392.X. |
| Office Action dated Aug. 14, 2019 in Chinese Application 201710694395.3. |
| Office Action dated Aug. 19, 2019 in Chinese Application 201710694312.0. |
| Office Action dated Aug. 22, 2019 in Chinese Application 201710977462.2. |
| Decision to Grant dated Aug. 28, 2019 in Korean Application 10-2018-7021221. |
| Office Action dated Aug. 30, 2019 in Chinese Application 201710694292.7. |
| Notice of Allowance dated Oct. 31, 2019 in U.S. Appl. No. 16/454,387. |
| Office Action dated Oct. 22, 2019 in Korean Patent Application 10-2019-7018337. |
| Notice of Allowance dated Oct. 24, 2019 in U.S. Appl. No. 16/453,525. |
| Office Action dated Oct. 31, 2019 in Israeli Patent Application 265626. |
| Office Action dated Nov. 19, 2019 in Japanese Application 2018-216486. |
| Office Action dated Nov. 25, 2019 in Philippine Application 1-2019-500790. |
| Office Action dated Dec. 4, 2019 in Philippine Application 1-2018-500354. |
| Notice of Issuance dated Jan. 6, 2020 in Chinese Application 201710694799.2. |
| Office Action dated Dec. 31, 2019 in Chinese Application 201710478537.2. |
| Office Action dated Nov. 14, 2019 in Indonesian Application P-00 2014 00229. |
| Notice of Issuance dated Feb. 3, 2020 in Chinese Application 201710694930.5. |
| Notice of Allowance dated Feb. 5, 2020 in U.S. Appl. No. 16/693,886. |
| Office Action dated Jan. 29, 2020 in Korean Application 10-2019-7035422. |
| Office Action dated Jan. 30, 2020 in Korean Application 10-2017-7034815. |
| Arild Fuldseth, “Tiles,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 5th Meeting: Geneva, CH, Mar. 16-23, 2011. |
| C. Andrew Segall et al., “Spatial Scalability Within the H.264/AVC Scalable Video Coding Extension,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 17, No. 9, Sep. 2007. |
| Notice of Issuance dated Feb. 3, 2020 in Chinese Application 201710695327.9. (No New Refs). |
| Notice of Issuance dated Feb. 7, 2020 in Chinese Application 201710477825.6. (No New Refs). |
| Office Action dated Feb. 6, 2020 in Chinese Application 201710477936.7. (No New Refs). |
| Notice of Issuance dated Apr. 22, 2020 in Chinese Application 201710694292.7. |
| Notice of Issuance dated Apr. 22, 2020 in Chinese Application 201710962381.5. |
| Office Action dated May 26, 2020 in European Application 20155692.5. |
| Office Action dated May 19, 2020 in Japanese Application 2018-121555. |
| Office Action dated Jun. 3, 2020 in Chinese Application 201710965903.7. |
| Office Action dated Jun. 15, 2020 in Chinese Application 201710694392.X. |
| Office Action dated Jun. 25, 2020 in European Application 12728084.0. |
| Hisao Sasai et al., “Parallel Context Processing for Significance map using block-based context updates”, 5. JCT-VC Meeting; Mar. 16, 2011-Mar. 23, 2011; Geneva; (Joint Collaborative Team on Video Goding of 180/IEC JTC1/SC29/WG11 and ITU-T SG.16 ), No. JCTVC-E226 Mar. 20, 2011(Mar. 20, 2011), XP030227697, Retrieved from the Internet: URL:http://phenix.int-evry. fr/jct/doc_end_user/documents/5_Geneva/wg 11I JCTVC-E226-v2.zipDraft_JCTVC-E226r1 .doc [retrieved on Mar. 20, 2011]. |
| Decision to Grant dated Jun. 28, 2020 in Korean Application 10-2019-7018337. |
| Notice of Allowance dated Jun. 16, 2020 in Chinese Application 201710477937.1. |
| Office Action dated May 13, 2020 in Indonesian Application P-00 2018 000 16. |
| Notice of Issuance dated Jul. 6, 2020 in Chinese Application 201710694395.3. |
| Office Action dated Jun. 29, 2020 in Korean Application 10-2020-7015415. |
| Examination Report dated Jul. 8, 2020 in Australian Application 2019203279. |
| Office Action issued in corresponding Korean Patent Application 10-2020-7034609 dated Mar. 22, 2021, with English translation. |
| Office Action issued in corresponding Russian Patent Application No. 2018120845 dated Apr. 5, 2021. |
| Notice of Acceptance issued in corresponding Australian Patent Application No. 2019203792 dated Apr. 14, 2021. |
| Office Action issued in corresponding Ukranian Patent Application No. a 2017 03792 dated May 25, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-00044 dated Jun. 30, 2021. |
| Decision to Grant issued in corresponding Russian Patent Application No. 2019127048 dated Jul. 6, 2021, with English translation. |
| Notification of Oral Proceedings issued in corresponding Chinese Patent Application No. ZL. 201710694391.5 dated Jul. 27, 2021. |
| Notification of Oral Proceedings issued in corresponding Chinese Patent Application No. ZL. 201710694424.6 dated Jul. 27, 2021. |
| Notification of Oral Proceedings issued in corresponding Chinese Patent Application No. ZL. 201710694312.0 dated Jul. 27, 2021. |
| Office Action issued in corresponding U.S. Appl. No. 17/232,811 dated Jan. 20, 2022. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 16/867,149 dated Nov. 4, 2021. |
| EPO Search Report issued in corresponding European Patent Application 21189232.8 dated Dec. 1, 2021. |
| Office Action issued in corresponding Vietnamese Patent Application 1-2017-02458 dated Nov. 29, 2021 with English translation. |
| Notification of Reasons of Refusal issued in corresponding Japanese Patent Application 2020-178469 dated Nov. 24, 2021 with English translation. |
| Notice of Substantive Examination with issued in corresponding Vietnamese Patent Application 1-2017-02455 dated Nov. 29, 2021 with English translation. |
| Notice of Substantive Examination with issued in corresponding Vietnamese Patent Application 1-2017-02456 dated Nov. 29, 2021 with English translation. |
| Notice of Substantive Examination issued in corresponding Vietnamese Patent Application 1-2017-02459 dated Nov. 29, 2021 with English translation. |
| Office Action issued in corresponding Australian Patent Application 2021209284 dated Nov. 4, 2021. |
| Decision to Grant issued in corresponding Brazilian Patent Application BR 12 2020 024986-2 dated Dec. 16, 2021. |
| Decision to Grant issued in corresponding Brazilian Patent Application BR 12 2021 000264-9 dated Dec. 28, 2021. |
| Notice of Allowance issued in corresponding Russian Patent Application No. 2018120845 dated Sep. 1, 2021. |
| Office Action issued in corresponding Russian Patent Application No. 2021125982 dated Oct. 7, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-01453 dated Oct. 29, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-01454 dated Oct. 29, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-01457 dated Oct. 29, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-01456 dated Oct. 29, 2021, with English translation. |
| Notice of Allowance issued in corresponding Vietnamese Patent Application No. 1-2019-01455 dated Oct. 29, 2021, with English translation. |
| Notice of Allowance issued in corresponding Israeli Patent Application No. 283649 dated Nov. 28, 2021. |
| Office Action issued in corresponding Indian Patent Application No. 201938011774 dated Jan. 24, 2022. |
| Office Action (Technical Report) issued in corresponding Brazilian Patent Application No. BR 11 2013 0323333-7 dated Dec. 14, 2021. |
| Office Action issued in corresponding Korean Patent Application No. 10-2020-7034609 dated Jan. 14, 2022. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910008 dated Jan. 21, 2022. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910006 dated Jan. 21, 2022. |
| Office Action issued in corresponding Russian Patent Application No. 2021131724 dated Jan. 31, 2022. |
| Office Action issued in corresponding Israeli Patent Application No. 290229 dated Jan. 31, 2022. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910014 dated Feb. 22, 2022, with English translation. |
| Office Action issued in corresponding Brazilian Patent Application No. B 11 2013 032332-9 dated Jan. 7, 2022, with English translation. |
| Office Action issued in corresponding Israeli Patent Application No. 252388 dated Mar. 30, 2022, with English summary. |
| Office Action issued in corresponding Mexican Patent Application No. Mx/a/2019/004403 dated Mar. 11, 2022. |
| Office Action issued in corresponding Russian Patent Application No. 2021125982 dated Mar. 25, 2022, with English translation. |
| Office Action issued in corresponding Australian Patent Application No. 2021201291 dated Apr. 4, 2022. |
| Decision to Grant issued in corresponding Brazilian Patent Application No. BR 11 2013 032333-7 dated May 5, 2022. |
| Invitation to Pay Granting Fees issued in corresponding Vietnamese Patent Application No. 1-2017-02459 dated May 10, 2022. |
| Invitation to Pay Granting Fees issued in corresponding Vietnamese Patent Application No. 1-2017-02455 dated May 10, 2022. |
| Invitation to Pay Granting Fees issued in corresponding Vietnamese Patent Application No. 1-2017-02458 dated May 10, 2022. |
| Invitation to Pay Granting Fees issued in corresponding Vietnamese Patent Application No. 1-2017-02456 dated May 10, 2022. |
| Office Action (Notice of Acceptance) issued in corresponding Australian Patent Application No. 2021209284 dated Jun. 9, 2022. |
| Decision to Grant with Search Report issued in corresponding ARIPO Patent Application No. AP/P/2021/012994 dated Jun. 20, 2022. |
| Office Action (Notice before Examination) issued in corresponding Israeli Patent Application 294454 dated Jul. 3, 2022. |
| Office Action (Decision to Grant) issued in corresponding Japanese Patent Application No. 2021-065563 dated May 23, 2022, with English translation. |
| Decision to Grant issued in corresponding Korean Patent Application 10-2020-7034609 dated May 24, 2022, with English translation. |
| Decision on Grant issued in corresponding Russian Patent Application 2021131724 dated May 20, 2022, with English translation. |
| Office Action (Notice of Allowance) issued in corresponding Brazilian Patent Application BR 11 2013 032332-9 dated May 19, 2022. |
| Extended European Search Report issued in corresponding European Patent Application 21211399.7 dated Jun. 24, 2022. |
| Notice of Allowance issued in corresponding U.S. Appl. No. 17/232,811 dated Jun. 7, 2022. |
| Office Action issued in corresponding Japanese Patent Application 2020-178469 dated Jun. 21, 2022, with English translation. |
| Office Action (Notice of Allowance) issued in corresponding Israeli Patent Application 290229 dated Aug. 1, 2022. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910010 dated Aug. 2, 2022, with English translation. |
| Office Action issued in corresponding Mexican Patent Application MX/a/2019/004403 dated Jul. 19, 2022. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910002 dated Aug. 2, 2022, with English translation. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910017 dated Aug. 2, 2022, with English translation. |
| Office Action issued in corresponding Indonesian Patent Application No. P00201910012 dated Aug. 9, 2022, with English translation. |
| Communication of a notice of opposition issued in corresponding European Patent Application No. 18152613.8 dated Sep. 9, 2022. |
| Bross, B., et al., “High efficiency video coding (HEVC) text specification draft 6”, San Jose, Feb. 1-10, 2012, Document JCTVC-H 1003. |
| Sullivan, G., et al., “Meeting report of the ninth meeting of the Joint Collaborative Team Video Coding (JCT-VC)”, 9. JCT-VC Meeting, Geneva, Apr. 27-May 7, 2012, Document JCTVC-I_Notes_d2. |
| Bross, B., et al., “High efficiency video coding (HEVC) text specification draft 7”, 9. JCT-VC Meeting, Geneva, Apr. 27-May 7, 2012, Document JCTVC-I1003_d4. |
| Bross, B., et al., “WD4: Working Draft 4 of High-Efficiency Video Coding”, 6. JCT-VC Meeting, Torino, Jul. 14-22, 2011, Document JCTVC-F803_d6. |
| Bross, B., et al., “WD5: Working Draft 5 of High-Efficiency Video Coding”, 7. JCT-VC Meeting, Geneva, Nov. 21-30, 2011, Document JCTVC-G1103_d9. |
| ISO/IEC—Coding of Moving Pictures and Audio, “Draft Requirements and discussion on the scalable enhancement of HEVC”, Geneva, Nov. 2011, ISO/IEC JTC1/SC29/WG11 M22556. |
| Kirchhoffer, H., et al., “CE1: Report of test results related to PIPE-based Unified Entropy Coding”, 7. JCT-VC Meeting, Geneva, Nov. 21-30, 2011, Document JCTVC-G633. |
| U.S. Appl. No. 61/497,794. |
| U.S. Appl. No. 61/508,506. |
| Sze, V., et al., “Joint Algorithm-Architecture Optimization of CABAC”, 5. JCT-VC Meeting, Geneva, Mar. 16-23, 2011, Document JCTVC-E324. |
| Schwarz, H., et al., “CABAC and Slices”, 4. JCT-VC Meeting, Klagenfurt, Jul. 22-26, 2002, Document JVT-D020r1. |
| Richardson, I.E., “The H.264 Advanced Video Compression Standard”, 2nd Edition, Wiley 2010. |
| Hang, H.-M., et al., “Towards the Next Video Standard: High Efficiency Video Coding”, Proceedings of the 2nd APSIPA Annual Summit and Conference, pp. 609-618, Biopolis, Singapore, Dec. 14-17, 2010. |
| Bross, B., et al., “WD4: Working Draft 4 of High-Efficiency Video Coding”, 6. JCT-VC Meeting, Torino, Jul. 14-22, 2011, Document JCTVC-F803_d6_8-bit-lnit_only-cleanup_r1. |
| Wiegand, T., et al., “WD2: Working Draft 2 of High-Efficiency Video Coding”, 4. JCT-VC Meeting, Daegu, Jan. 20-28, 2011, Document JCTVC-D503. |
| Office Action issued in corresponding Indonesian Patent Application P00201910020 dated Aug. 29, 2022, with English translation. |
| Office Action issued in corresponding Indonesian Patent Application P-00 2020 02804 dated Aug. 29, 2022, with English translation. |
| Office Action issued in corresponding Indonesian Patent Application P-00 2020 02805 dated Aug. 29, 2022, with English translation. |
| Office Action issued in corresponding European Patent Application 21189232.8 dated Sep. 12, 2022. |
| Office Action issued in corresponding Australian Patent Application 2021201291 dated Sep. 8, 2022. |
| Office Action issued in corresponding Russian Patent Application 2022123771 dated Sep. 23, 2022, with English translation. |
| Office Action issued in corresponding Australian Patent Application 2022235513 dated Sep. 30, 2022. |
| Number | Date | Country | |
|---|---|---|---|
| 20200169733 A1 | May 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61508506 | Jul 2011 | US | |
| 61497794 | Jun 2011 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16454387 | Jun 2019 | US |
| Child | 16778048 | US | |
| Parent | 16259815 | Jan 2019 | US |
| Child | 16454387 | US | |
| Parent | 16103266 | Aug 2018 | US |
| Child | 16259815 | US | |
| Parent | 15880772 | Jan 2018 | US |
| Child | 16103266 | US | |
| Parent | 15641992 | Jul 2017 | US |
| Child | 15880772 | US | |
| Parent | 15238523 | Aug 2016 | US |
| Child | 15641992 | US | |
| Parent | 14108108 | Dec 2013 | US |
| Child | 15238523 | US | |
| Parent | PCT/EP2012/061613 | Jun 2012 | US |
| Child | 14108108 | US |
