Low-Complexity History Use for Rice Parameter Derivation in High-Bit-Depth Video Coding

JP2023552980A5Active Publication Date: 2024-11-19QUALCOMM INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
JP2023533331
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2021-12-09
Filing Date
2021-12-10
Publication Date
2024-11-19
Estimated Expiration
2041-12-10

AI Technical Summary

Technical Problem

Existing video coding techniques face challenges in efficiently encoding and decoding high bit-depth video data due to insufficient neighboring transform coefficients, particularly in small transform units, leading to inaccurate Rician parameter derivation and reduced compression efficiency.

Method used

The use of historical Rician parameter values, combined with local neighborhood analysis, to derive Rician parameters when neighboring transform coefficients are unavailable, improving accuracy and efficiency in high bit-depth video coding.

Benefits of technology

Enhances the accuracy and efficiency of Rician parameter derivation, particularly in small transform units, thereby improving the compression efficiency of high bit-depth video coding.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

Techniques for processing video data using history-based Rice parameter derivation are described herein. For example, the process may include obtaining a transform block including a plurality of samples. One or more parameters (e.g., Rice parameters) for the plurality of samples may be determined by analyzing a local neighborhood of a current sample among the plurality of samples and determining that a number of neighboring transform coefficients of the current sample is less than a threshold amount. Historical parameter values ​​(e.g., historical Rice parameter values) determined from one or more previously decoded transform blocks may be obtained, and parameters (e.g., Rice parameters) for the current sample may be determined based at least in part on the historical parameter values. The current sample may be decoded based on the determined parameters of the current sample.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001]

[0001] This application relates to video coding (e.g., video encoding and / or video decoding). For example, aspects of this application relate to systems and techniques for improving the parameter derivation (e.g., rice parameter derivation) of regular residual coding (RRC) in high bit-depth coding. These systems and techniques are applicable to new extensions of the Versatile Video Coding (VVC) standard, among other standards and their extensions.

Background Art

[0002]

[0002] Many devices and systems enable video data to be processed and output for consumption. Digital video data includes large amounts of data to meet the demands of consumers and video providers. For example, consumers of video data desire the highest quality video with high fidelity, resolution, frame rate, etc. As a result, the large amounts of video data required to meet these demands impose a burden on communication networks and devices that process and store video data.

[0003]

[0003] Various video coding techniques can be used to compress video data. Video coding is performed according to one or more video coding standards. For example, video coding standards include, in particular, General-Purpose Video Coding (VVC), High Efficiency Video Coding (HEVC), Advanced Video Coding (AVC), MPEG-2 Part 2 coding (MPEG stands for Moving Picture Experts Group), and proprietary video codecs / formats such as AOMedia Video 1 (AV1) developed by the Alliance for Open Media. Video coding generally utilizes predictive methods (e.g., inter-prediction, intra-prediction, etc.) that take advantage of redundancy present in video images or sequences. The goal of video coding techniques is to compress video data into a format that uses a lower bitrate while avoiding or minimizing degradation of video quality. As video services are constantly evolving and more readily available, coding techniques with better coding efficiency are needed. [Overview of the Initiative]

[0004]

[0004] In some examples, systems and techniques for parameter derivation (e.g., Rice parameter derivation) based at least in part on historical parameter information (e.g., historical Rice parameter information) are described. According to at least one exemplary example, a method for decoding video data is provided. The method includes: obtaining a transform block; determining one or more parameters for the multiple samples by at least in part on analyzing the local neighborhood of the current sample among the multiple samples; determining that the number of neighbor transform coefficients of the current sample is less than a threshold amount, based at least in part on the analysis of the local neighborhood; obtaining historical parameter values ​​determined from one or more previously decoded transform blocks; determining the parameters of the current sample, based at least in part on the historical parameter values; and decoding the current sample based on the determined parameters of the current sample.

[0005]

[0005] In another example, a device for decoding video data is provided, the device comprising a memory and one or more processors coupled to the memory (for example, implemented in a circuit). The one or more processors are configured to and can perform: acquire a transform block, the transform block comprising a plurality of samples; determine one or more parameters for the plurality of samples by at least partly analyzing the local neighborhood of the current sample among the plurality of samples; determine that the number of neighbor transform coefficients of the current sample is less than a threshold amount, at least based on the analysis of the local neighborhood; acquire historical parameter values ​​determined from one or more previously decoded transform blocks; determine the parameters of the current sample, at least based on the historical parameter values; and decode the current sample based on the determined parameters of the current sample.

[0006]

[0006] In another example, a non-temporary computer-readable medium storing instructions is provided, and when the instructions are executed by one or more processors, the instructions cause one or more processors to: obtain a transform block; the transform block includes a plurality of samples; determine one or more parameters for the plurality of samples by at least partly analyzing the local neighborhood of the current sample among the plurality of samples; determine that the number of neighbor transform coefficients of the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood; obtain historical parameter values ​​determined from one or more previously decoded transform blocks; determine the parameters of the current sample, at least partly based on the historical parameter values; and decode the current sample based on the determined parameters of the current sample.

[0007]

[0007] In another example, an apparatus is provided which includes means for obtaining a transformation block, the transformation block comprising a plurality of samples; means for determining one or more parameters for the plurality of samples, at least in part by analyzing the local neighborhood of the current sample among the plurality of samples; means for determining, at least in part based on the analysis of the local neighborhood, that the number of neighbor transformation coefficients of the current sample is less than a threshold amount; means for obtaining historical parameter values ​​determined from one or more previously decoded transformation blocks; means for determining the parameters of the current sample, at least in part based on the historical parameter values; and means for decoding the current sample based on the determined parameters of the current sample.

[0008]

[0008] In another example, a method for encoding video data is provided, the method comprising: obtaining a transform block; determining one or more parameters for a plurality of samples by at least partly analyzing the local neighborhood of the current sample among the plurality of samples; determining that the number of neighbor transform coefficients for the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood; obtaining historical parameter values ​​determined from one or more previously encoded transform blocks; determining the parameters of the current sample, at least partly based on the historical parameter values; and generating a bitstream based on the determined parameters of the current sample.

[0009]

[0009] In another example, an apparatus for encoding video data is provided, the apparatus comprising a memory and one or more processors coupled to the memory (for example, implemented in a circuit). The one or more processors are configured to and can do the following: acquire a transform block, the transform block comprises a plurality of samples; determine one or more parameters for the plurality of samples by at least partly analyzing the local neighborhood of the current sample among the plurality of samples; determine that the number of neighbor transform coefficients of the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood; acquire historical parameter values ​​determined from one or more previously encoded transform blocks; determine the parameters of the current sample, at least partly based on the historical parameter values; and generate a bitstream based on the determined parameters of the current sample.

[0010]

[0010] In another example, a non-temporary computer-readable medium storing instructions is provided, and when the instructions are executed by one or more processors, the one or more processors are instructed to: obtain a transform block; determine one or more parameters for a plurality of samples by at least partly analyzing the local neighborhood of the current sample among the plurality of samples; determine that the number of neighbor transform coefficients of the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood; obtain historical parameter values ​​determined from one or more previously decoded transform blocks; determine the parameters of the current sample, at least partly based on the historical parameter values; and generate a bitstream based on the determined parameters of the current sample.

[0011]

[0011] In another example, an apparatus is provided which includes means for obtaining a transformation block, the transformation block comprising a plurality of samples; means for determining one or more parameters for the plurality of samples, at least in part by analyzing the local neighborhood of the current sample among the plurality of samples; means for determining, at least in part based on the analysis of the local neighborhood, that the number of neighbor transformation coefficients of the current sample is less than a threshold amount; means for obtaining historical parameter values ​​determined from one or more previously encoded transformation blocks; means for determining the parameters of the current sample, at least in part based on the historical parameter values; and means for generating a bitstream based on the determined parameters of the current sample.

[0012]

[0012] In some embodiments, one or more parameters for multiple samples include one or more rice parameters, the historical parameter values ​​are historical rice parameter values, and the parameters determined for the current sample are the rice parameters for the current sample. In some embodiments, existing historical parameter values ​​are existing historical rice parameter values.

[0013]

[0013] In some embodiments, the methods, apparatus, and computer-readable media described above further comprise determining the parameters of the current sample based on a first integer multiple of the historical parameter values, at least in part on the determination that the number of neighbor conversion coefficients is 0.

[0014]

[0014] In some embodiments, determining the parameters of the current sample involves providing a first integer multiple of the historical parameter value as input to a lookup table that maps between the input and the parameter.

[0015]

[0015] In some embodiments, the first integer multiple and the threshold amount are the same value.

[0016]

[0016] In some embodiments, the methods, apparatus, and computer-readable media described above further comprise determining the parameters of the current sample based on a second integer multiple of the historical parameter value and the sum of the neighboring conversion coefficients, at least in part on the determination that the number of neighboring conversion coefficients is greater than zero.

[0017]

[0017] In some embodiments, determining the parameters of the current sample involves providing the sum of neighbor transformation coefficients and a second integer multiple of the summed historical parameter values ​​as input to a lookup table that maps between the input and the parameters.

[0018]

[0018] In some embodiments, the second integer multiple is smaller than the first integer multiple.

[0019]

[0019] In some embodiments, determining that the number of neighboring conversion coefficients is less than a threshold amount is at least in part based on identifying one or more unavailable neighboring conversion coefficients for the current sample.

[0020]

[0020] In some embodiments, the methods, apparatus, and computer-readable media described above further include: obtaining the location of the current sample in the conversion block; comparing the location of the current sample with one or more of the width and height of the conversion block; and identifying one or more unavailable neighboring conversion coefficients based at least in part on the comparison.

[0021]

[0021] In some embodiments, one or more unavailable neighbor conversion coefficients are associated with locations outside the conversion block.

[0022]

[0022] In some embodiments, determining that the number of neighboring conversion coefficients is less than a threshold amount comprises determining that the horizontal component of the current sample location is within a first distance of the width of the conversion block; and determining that the vertical component of the current sample location is within a second distance of the height of the conversion block.

[0023]

[0023] In some embodiments, multiple samples are associated with a conversion block sample type, which includes a lumens sample or a chromatic sample.

[0024]

[0024] In some embodiments, the transformation block sample type is the same as the sample type associated with one or more previously decoded transformation blocks, from which the history parameter value is determined.

[0025]

[0025] In some embodiments, the history parameter value is determined at least in part on a first non-zero decoded transformation coefficient obtained from each of one or more previously decoded transformation blocks.

[0026]

[0026] In some aspects, the methods, apparatuses, and computer-readable media described above further comprise determining a binary code length of each first non-zero decoded transform coefficient obtained from each of one or more previously decoded transform blocks.

[0027]

[0027] In some aspects, a history parameter value is determined as an exponentially weighted moving average of the binary code lengths determined for the first non-zero decoded transform coefficients of each of one or more previously decoded transform blocks.

[0028]

[0028] In some aspects, decoding a current sample based on a determined parameter for the current sample comprises decoding a syntactic element indicative of the current sample based on the determined parameter.

[0029]

[0029] In some aspects, decoding a current sample based on a determined parameter comprises decoding a Golomb-Rice code using the determined parameter.

[0030]

[0030] In another example, a method of decoding video data is provided, the method comprising: obtaining a transform block; determining one or more non-zero decoded transform coefficients based at least in part on an analysis of the transform block; determining a history update value for the transform block based at least in part on at least a portion of the one or more non-zero decoded transform coefficients; updating an existing history parameter value at least in part by combining the history update value of the transform block with the existing history parameter value, wherein the existing history parameter value is based at least in part on a series of non-zero decoded transform coefficients determined from a series of previously analyzed transform blocks; and decoding at least one sample of the transform block based on the existing history parameter value or the updated existing history parameter value.

[0031]

[0031] In another example, a device for decoding video data is provided, the device comprising a memory and one or more processors coupled to the memory (for example, implemented in a circuit). One or more processors are configured to: acquire a transform block; determine one or more non-zero decoded transform coefficients based at least in part on an analysis of the transform block; determine a history update value of the transform block based at least in part on one or more non-zero decoded transform coefficients; update an existing history parameter value by at least in part on combining the history update value of the transform block with an existing history parameter value, the existing history parameter value being at least in part on a set of non-zero decoded transform coefficients determined from a set of previously analyzed transform blocks; and decode at least one sample of the transform block based on the existing history parameter value or the updated existing history parameter value.

[0032]

[0032] In another example, a non-temporary computer-readable medium storing instructions is provided, and when the instructions are executed by one or more processors, one or more processors are instructed to: acquire a translation block; determine one or more non-zero decoded translation coefficients based at least in part on an analysis of the translation block; determine a history update value for the translation block based at least in part on one or more non-zero decoded translation coefficients; update an existing history parameter value by at least in part on combining the history update value for the translation block with an existing history parameter value, the existing history parameter value being at least in part on a series of non-zero decoded translation coefficients determined from a series of previously analyzed translation blocks; and decode at least one sample of the translation block based on the existing history parameter value or the updated existing history parameter value.

[0033]

[0033] In another example, an apparatus is provided which includes means for obtaining a transformation block; means for determining one or more non-zero decoded transformation coefficients based at least in part on an analysis of the transformation block; means for determining a historical update value of the transformation block based at least a portion of one or more non-zero decoded transformation coefficients; means for updating an existing historical parameter value by at least in part on combining the historical update value of the transformation block with an existing historical parameter value; means for decoding at least one sample of the transformation block based on an existing historical parameter value or an updated existing historical parameter value, the existing historical parameter value being at least in part on a series of non-zero decoded transformation coefficients determined from a series of previously analyzed transformation blocks.

[0034]

[0034] In another example, a method is provided for encoding video data, the method comprising: obtaining a transformation block; determining one or more non-zero coded transformation coefficients based at least in part on an analysis of the transformation block; determining a history update value for the transformation block based at least in part on one or more non-zero coded transformation coefficients; updating an existing history parameter value by at least in part on combining the history update value for the transformation block with an existing history parameter value; and generating a bitstream based on the existing history parameter value or the updated existing history parameter value, wherein the existing history parameter value is at least in part on a set of non-zero coded transformation coefficients determined from a set of previously analyzed transformation blocks.

[0035]

[0035] In another example, an apparatus for encoding video data is provided, the apparatus comprising a memory and one or more processors coupled to the memory (for example, implemented in a circuit). One or more processors are configured to: acquire a transformation block; determine one or more non-zero coded transformation coefficients based at least in part on an analysis of the transformation block; determine a history update value for the transformation block based at least in part on one or more non-zero coded transformation coefficients; update an existing history parameter value by at least in part on combining the history update value for the transformation block with an existing history parameter value, and generate a bitstream based on the existing history parameter value or the updated existing history parameter value, the existing history parameter value being at least in part on a set of non-zero coded transformation coefficients determined from a set of previously analyzed transformation blocks.

[0036]

[0036] In another example, a non-temporary computer-readable medium storing instructions is provided, and when the instructions are executed by one or more processors, one or more processors are caused to: acquire a translation block; determine one or more non-zero decoded translation coefficients based at least in part on an analysis of the translation block; determine a history update value for the translation block based at least in part on one or more non-zero decoded translation coefficients; update an existing history parameter value by at least in part on combining the history update value for the translation block with an existing history parameter value, and generate a bitstream based on the existing history parameter value or the updated existing history parameter value, the existing history parameter value being at least in part on a set of non-zero decoded translation coefficients determined from a set of previously analyzed translation blocks.

[0037]

[0037] In another example, an apparatus is provided which includes: means for obtaining a transformation block; means for determining one or more non-zero coded transformation coefficients based at least in part on an analysis of the transformation block; means for determining a history update value of the transformation block based at least a portion of one or more non-zero coded transformation coefficients; means for updating an existing history parameter value at least in part by combining the history update value of the transformation block with an existing history parameter value; and means for generating a bitstream based on an existing history parameter value or an updated existing history parameter value, wherein the existing history parameter value is at least in part on a set of non-zero coded transformation coefficients determined from a set of previously analyzed transformation blocks.

[0038]

[0038] In some embodiments, combining the history update values ​​of a transformation block with existing history parameter values ​​comprises averaging the history update values ​​of a transformation block with existing history parameter values.

[0039]

[0039] In some embodiments, combining the historical update values ​​of a transformation block with existing historical parameter values ​​comprises determining an exponentially weighted moving average between the historical update values ​​of the transformation block and the existing historical parameter values.

[0040]

[0040] In some embodiments, the methods, apparatus, and computer-readable media described above further comprise assigning a first weight to the historical update values ​​of the conversion block and a second weight to the existing historical parameter values, wherein determining the exponentially weighted moving average is at least in part based on the first and second weights.

[0041]

[0041] In some embodiments, the history update value of the transformation block is determined based on a first non-zero decoded transformation coefficient determined in the analysis of the transformation block.

[0042]

[0042] In some embodiments, the first non-zero decoded transformation coefficient is determined based on the run scan order of the transformation blocks in the reverse direction.

[0043]

[0043] In some embodiments, the history update value of the conversion block is determined at least in part by determining the binary code length of the first non-zero decoded conversion coefficient.

[0044]

[0044] In some embodiments, a transformation block and a previously analyzed transformation block are associated with a first slice, and existing historical parameter values ​​are iteratively updated based on sequential historical update values ​​determined for sequentially analyzed transformation blocks associated with the same slice.

[0045]

[0045] In some embodiments, the methods, apparatus, and computer-readable media described above further comprise initializing existing historical parameter values ​​to predetermined values, wherein the initialization is performed prior to analyzing the first transformation block of the first slice and determining the historical update values ​​of the first transformation block.

[0046]

[0046] In some embodiments, the history update value of the transformation block is determined based on all of the non-zero decoded transformation coefficients of the transformation block.

[0047]

[0047] In some embodiments, the history update value is determined at least in part by averaging all of the non-zero decoded conversion coefficients of the conversion block.

[0048]

[0048] In some embodiments, decoding at least one sample of a transformation block comprises decoding a syntax element indicating at least one sample based on an existing history parameter value or an updated existing history parameter value.

[0049]

[0049] In some embodiments, decoding at least one sample of the transformation block comprises decoding the Golombrice code using existing or updated existing historical parameter values.

[0050]

[0050] In some embodiments, the device may be or be part of a mobile device (e.g., a mobile phone or so-called "smartphone", or other mobile device), a personal computer, a laptop computer, an Extended Reality (XR) device (e.g., a virtual reality (VR) device, an augmented reality (AR) device, or a mixed reality (MR) device), an Internet of Things (IoT) device, a vehicle or a vehicle computing component or system, a smart wearable device, a server computer, a camera (e.g., a digital camera, an Internet Protocol (IP) camera, etc.), a multi-camera system, a robotics device or system, an aerial device or system, or other device. In some embodiments, the device may include one or more cameras for capturing one or more images. In some embodiments, the device may include a display for displaying one or more images, notifications, and / or other displayable data. In some embodiments, the device described above may include one or more sensors.

[0051]

[0051] This summary is not intended to identify any important or essential features of the claimed subject matter, nor is it intended to be used separately to determine the scope of the claimed subject matter. The subject matter should be understood by referring to the entire specification of this patent, any or all of the drawings, and the appropriate portion of each claim.

[0052]

[0052] The above will become clearer with reference to the following specification, claims, and accompanying drawings, along with other features and embodiments.

[0053]

[0053] Exemplary embodiments of this application will be described in detail below with reference to the following figures. [Brief explanation of the drawing]

[0054] [Figure 1]

[0054] A block diagram showing an example of an encoding device and a decoding device, based on several examples. [Figure 2]

[0055] A diagram showing an example of a Rice derivation template that displays the neighboring coefficients of the current coefficient, using several examples. [Figure 3]

[0056] A diagram illustrating various transformation units (TUs) overlaid on an exemplary Rice derivation template, using several examples. [Figure 4]

[0057] A figure illustrating examples of various classifications applied to samples of a transformation unit, at least partially based on the interaction between the Rice derivation template and the spatial location of the sample, using several examples. [Figure 5]

[0058] A diagram illustrating an example of updating the history of a history counter to determine the history of a historical rice parameter value, using several examples. [Figure 6]

[0059] A flowchart illustrating an example of the process for deriving the Rice parameter, using several examples. [Figure 7]

[0060] A flowchart illustrating another example of the process for deriving the Rice parameter, using several examples. [Figure 8]

[0061] A block diagram illustrating an exemplary video encoding device with several examples. [Figure 9]

[0062] A block diagram illustrating an exemplary video decoding device, using several examples. [Modes for carrying out the invention]

[0055]

[0063] Several aspects and embodiments of this disclosure are provided below. As will be apparent to those skilled in the art, some of these aspects and embodiments may be applied independently, and some may be applied in combination. For illustrative purposes, specific details are provided in the following description to provide a complete understanding of the embodiments of this application. However, it will be apparent that various embodiments may be practiced without these specific details. The figures and description are not limiting.

[0056]

[0064] The following description provides only exemplary embodiments and does not limit the scope, applicability, or configuration of the disclosure. Rather, the following description of exemplary embodiments provides a description that enables the implementation of the exemplary embodiments to those skilled in the art. It should be understood that various modifications can be made to the function and configuration of the elements without departing from the spirit and scope of this application, as described in the appended claims.

[0057]

[0065] Digital video data can contain massive amounts of data, especially as the demand for high-quality video data continues to grow. For example, video data consumers generally desire increasingly higher quality video with higher fidelity, resolution, and frame rates. However, the large amounts of video data required to meet such demands can place a significant burden on communication networks and the devices that process and store the video data.

[0058]

[0066] Video coding devices implement video compression techniques for efficiently encoding and decoding video data. Video compression techniques may include applying different prediction modes, including spatial prediction (e.g., intra-frame prediction or intra-prediction), temporal prediction (e.g., inter-frame prediction or inter-prediction), inter-layer prediction (across different layers of video data), and / or other prediction techniques, to reduce or eliminate redundancy inherent in the video sequence. A video encoder can divide each picture in the original video sequence into rectangular regions called video blocks or coding units (described in more detail below). These video blocks may be encoded using a specific prediction mode.

[0059]

[0067] A video block can be divided in one or more ways into one or more groups of smaller blocks. A block may include a coding tree block, a prediction block, a transformation block, and / or other suitable blocks. Generally, references to a “block” can refer to such a video block (e.g., a coding tree block, a coding block, a prediction block, a transformation block, or other suitable block or subblock, as understood by those skilled in the art). Furthermore, each of these blocks may also be interchangeably referred to herein as a “unit” (e.g., a coding tree unit (CTU), a coding unit, a prediction unit (PU), a transformation unit (TU), etc.). In some cases, a unit may represent a coding logic unit encoded in a bitstream, and a block may represent a portion of a video frame buffer that the process is targeting.

[0060]

[0068] In interprediction mode, the video encoder can search for a block similar to the one being encoded in a frame (or picture) at a different time location, called a reference frame or reference picture. The video encoder may limit its search to a spatial displacement from the block to be encoded. The best match may be identified using a two-dimensional (2D) motion vector that includes horizontal and vertical displacement components. In intraprediction mode, the video encoder may use spatial prediction techniques to form a predicted block based on data from previously encoded adjacent blocks within the same picture.

[0061]

[0069] A video encoder can determine a prediction error. For example, the prediction may be determined as the difference between the pixel value in the encoded block and the predicted pixel value in the block. The prediction error is sometimes called the residual. The video encoder may also apply a transformation (e.g., a discrete cosine transform (DCT) or another suitable transformation) to the prediction error to generate transformation coefficients. After the transformation, the video encoder may quantize the transformation coefficients. The quantized transformation coefficients and motion vectors can be represented using syntax elements and, together with control information, form a coded representation of the video sequence. In some cases, the video encoder may entropy encode the quantized transformation coefficients and / or syntax elements, thereby further reducing the number of bits required for their representation.

[0062]

[0070] After entropy decoding and inverse quantization of the received bitstream, the video decoder may use the syntax elements and control information described above to construct prediction data (e.g., prediction blocks) for decoding the current frame. For example, the video decoder may add the prediction blocks to the compressed prediction error. The video decoder may determine the compressed prediction error by weighting the transformation basis function using quantized coefficients. The difference between the reconstructed frame and the original frame is called the reconstruction error.

[0063]

[0071] Video coding may be performed in accordance with a specific video coding standard. Examples of video coding standards include, but are not limited to, ITU-T H.261, ISO / IEC MPEG-1 Visual, ITU-T H.262 or ISO / IEC MPEG-2 Visual, ITU-T H.263, ISO / IEC MPEG-4 Visual, Advanced Video Coding (AVC) or ITU-T H.264, including Scalable Video Coding (SVC) and Multiview Video Coding (MVC) extensions, High Efficiency Video Coding (HEVC) or ITU-T H.265, General Purpose Video Coding (VVC) or ITU-T H.266 and its extensions, VP9, ​​Alliance of Open Media (AOMedia) Video 1 (AV1), and Essential Video Coding (EVC).

[0064]

[0072] As described above, a video encoder may entropy encode quantized transformation coefficients and / or syntax elements to generate a bitstream. A video decoder can entropy decode the bitstream using an inverse entropy coding process. In some examples, rice coding with rice parameters may be used to perform entropy coding (e.g., entropy coding and / or decoding). In current VVC standards, the rice parameters for typical residual coding (RRC) may be derived based on a template (also called a rice parameter derivation template) for determining (e.g., calculating, computed, etc.) the sum of neighboring transformation coefficients, and a lookup table that maps different possible sums to specific rice parameter values. In this technique, the determined sum from the rice parameter derivation template is used as an index to the lookup table of rice parameter values. In one exemplary example, the rice parameter derivation template may be applied on a grid of samples (e.g., an 8x8 sample grid). In some cases, the grid can represent transformed blocks (TB) or transformed units (TU) obtained from larger frames or slices of video data. To determine the rice parameter of the current transformed coefficient, a video encoder or decoder can use a template to identify one or more neighboring transformed coefficients. A rice parameter derivation template may be used to identify several neighboring coefficients (e.g., five neighboring coefficients) for a given current coefficient. The video encoder or decoder can then determine the sum of the absolute values ​​of the neighboring transformed coefficients identified based on the template.

[0065]

[0073] Template-based methods for Rice parameter derivation (e.g., template-based Rice parameter derivation by VVC section 9.3.3.2 (e.g., unmodified equation 1517), and the various modifications described below (e.g., modifications of equation 1517) can, in some examples, take advantage of the fact that decoding is performed in a reverse path, starting from the end of a block and proceeding toward its DC. Based on reverse-path decoding performed for each block (e.g., TU or TB), such Rice parameter derivation techniques can take advantage of one or more transformation coefficients that are decoded earlier in the current TU.

[0066]

[0074] In some cases (for example, with high-bit-depth coding), due to the high proportion of small-sized TUs or TBs (e.g., having a size of 4x4) for which the conversion coefficients are coded using the Golomb-Rice method, it is not possible to perform an accurate Rice derivation for some conversion coefficients, such as those appearing at the very beginning of TU decoding. For example, the amount of non-zero neighbor conversion coefficients available to perform a template-based Rice parameter derivation for those coefficients appearing at the beginning of TU decoding (based on a template-based Rice parameter derivation using some predetermined number of neighbor conversion coefficients, such as 5) may be insufficient.

[0067]

[0075] As will be described in more detail herein, systems, apparatus, methods, and computer-readable media (collectively referred to as “Systems and Techniques”) for improving parameter derivation (e.g., Rice parameter derivation) are described herein. Such systems and techniques may be used for ordinary residual coding (RRC) in high-bit-depth coding and / or for other video coding. According to some embodiments, systems and techniques may include performing Rice parameter derivation in the presence of one or more unavailable neighbor transformation coefficients. For example, a video encoder and / or video decoder may determine that one or more neighbor transformation coefficients specified by the Rice derivation template are unavailable for the current sample of the current TU (e.g., in the case of a decoder, the currently decoded sample of the currently decoded TU). Unavailable neighbor transformation coefficients may be transformation coefficients that do not lie within the same TU as the currently decoded coefficient. For example, unavailable neighbor transformation coefficients may be determined to exist when the Rice derivation template spans one or more borders or edges of the currently decoded TU.

[0068]

[0076] Rather than ignoring unavailable neighbor transformation coefficients or setting them equal to 0, the systems and techniques described herein can provide historical rice parameter values ​​to be used in place of unavailable neighbor transformation coefficients when performing template and lookup table-based rice derivation. In some examples, historical rice parameter values ​​may be determined (e.g., calculated, computed, etc.) by maintaining one or more historical counters that accumulate one or more first decoded non-zero transformation coefficients obtained from previously decoded TUs. For example, previously decoded TUs and the currently decoded TU may be associated with the same frame, block, slice, or other segment of video data and one or more historical counters maintained over the duration of a larger unit to which the currently decoded TU belongs. The one or more historical counters may maintain a running sum of first non-zero decoded transformation coefficients from earlier TUs, from which an arithmetic mean can be determined each time a historical rice parameter value is queried or used to perform rice derivation by the systems and techniques described herein. In some examples, one or more historical counters can implement a weighted average or exponentially weighted moving average for historical rice parameter values, as will be explained in more detail below.

[0069]

[0077] Further details regarding the system and techniques will be explained with reference to the diagrams.

[0070]

[0078] Figure 1 is a block diagram showing an example of a system 100 including an encoding device 104 and a decoding device 112. The encoding device 104 may be part of a source device, and the decoding device 112 may be part of a receiving device. The source device and / or receiving device may include electronic devices such as mobile or fixed telephone handsets (e.g., smartphones, cellular phones, etc.), desktop computers, laptop or notebook computers, tablet computers, set-top boxes, televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, Internet Protocol (IP) cameras, or any other suitable electronic devices. In some examples, the source device and receiving device may include one or more wireless transceivers for wireless communication. The coding techniques described herein are applicable to video coding in a variety of multimedia applications, including (e.g., streaming video transmission over the Internet), television broadcasting or transmission, encoding of digital video for storage on a data storage medium, decoding of digital video stored on a data storage medium, or other applications. The term coding as used herein may refer to encoding and / or decoding. In some cases, system 100 can support one-way or two-way video transmission to support applications such as video conferencing, video streaming, video playback, video broadcasting, games, and / or video telephony.

[0071]

[0079] The encoding device 104 (or encoder) may be used to encode video data using a video coding standard, format, codec, or protocol to generate an encoded video bitstream. Examples of video coding standards and formats / codecs include ITU-T H.261, ISO / IEC MPEG-1 Visual, ITU-T H.262 or ISO / IEC MPEG-2 Visual, ITU-T H.263, ISO / IEC MPEG-4 Visual, ITU-T H.264 (also known as ISO / IEC MPEG-4 AVC), High Efficiency Video Coding (HEVC) or ITU-T H.265, and General Purpose Video Coding (VVC) or ITU-T H.266. Various extensions to HEVC exist to address multi-layer video coding, including range and screen content coding extensions, 3D video coding (3D-HEVC), and multi-view extensions (MV-HEVC) and scalable extensions (SHVC). HEVC and its extensions were developed by the ITU-T Video Coding Expert Group (VCEG) and the ISO / IEC Motion Picture Expert Group (MPEG) Joint Collaboration Team on Video Coding (JCT-VC) and Joint Collaboration Team on 3D Video Coding Extensions Development (JCT-3V). VP9, ​​AOMedia Video 1 (AV1) developed by the Alliance for Open Media (AOMedia), and Essential Video Coding (EVC) are other video coding standards to which the techniques described herein may be applied.

[0072]

[0080] The systems and techniques described herein may be applied to any existing video codec (e.g., VVC, HEVC, AVC, or other suitable existing video codecs) and / or may be efficient coding tools for any video coding standards under development and / or future video coding standards. For example, the examples described herein may be implemented using video codecs such as VVC, HEVC, AVC, and / or extensions thereof. However, the techniques and systems described herein may also be applicable to other coding standards, codecs, or formats, such as MPEG, JPEG (or other coding standards for still images), VP9, ​​AV1, their extensions, or other suitable coding standards that are already available, not yet available, or have not yet been developed. For example, in some examples, the encoding device 104 and / or the decoding device 112 may operate according to a proprietary video codec / format, such as AV1, extensions of AVI, and / or successor versions of AV1 (e.g., AV2), or other proprietary formats or industry standards. Therefore, while the techniques and systems described herein may be described with reference to specific video coding standards, those skilled in the art will understand that the descriptions should not be interpreted as applying only to those specific standards.

[0073]

[0081] Referring to Figure 1, the video source 102 may provide video data to the encoding device 104. The video source 102 may be part of a source device or part of a device other than a source device. The video source 102 may include a video capture device (e.g., a video camera, camera phone, videophone, etc.), a video archive containing stored video, a video server or content provider providing video data, a video feed interface receiving video from a video server or content provider, a computer graphics system for generating computer graphics video data, a combination of such sources, or any other suitable video source.

[0074]

[0082] The video data from video source 102 may include one or more input pictures or frames. A picture or frame is, in some cases, a still image that is part of the video. In some examples, the data from video source 102 may be a still image that is not part of the video. In HEVC, VVC, and other video coding specifications, a video sequence may include a set of pictures. A picture may include three sample arrays, denoted as SL, SCb, and SCr. SL is a two-dimensional array of lumar samples, SCb is a two-dimensional array of Cb chrominance samples, and SCr is a two-dimensional array of Cr chrominance samples. Chrominance samples are sometimes referred to herein as "chroma" samples. A pixel can refer to all three components (lumar and chroma samples) at a given location in the array of pictures. In other cases, a picture may be monochrome and contain only an array of lumar samples, in which case the terms pixel and sample may be used interchangeably. With regard to the exemplary techniques described herein, where individual samples are referred to for illustrative purposes, the same techniques may be applied to pixels (for example, all three sample components for a given location in an array of pictures). With regard to the exemplary techniques described herein, where pixels (for example, all three sample components for a given location in an array of pictures) are referred to for illustrative purposes, the same techniques may be applied to individual samples.

[0075]

[0083] The encoder engine 106 (or encoder) of the encoding device 104 encodes video data to generate an encoded video bitstream. In some examples, an encoded video bitstream (or “video bitstream” or “bitstream”) is a series of one or more encoded video sequences. An encoded video sequence (CVS) consists of a series of AUs, beginning with an access unit (AU) in the base layer having a random access point picture with certain properties, and continuing to the next AU in the base layer having a random access point picture with certain properties, without including the next AU. For example, some properties of the random access point picture that starts the CVS may include a RASL flag equal to 1 (e.g., NoRaslOutputFlag). In other cases, a random access point picture (with a RASL flag equal to 0) does not start a CVS. An access unit (AU) includes one or more encoded pictures and control information corresponding to the encoded pictures that share the same output time. The encoded slices of the pictures are encapsulated at the bitstream level in data units called network abstraction layer (NAL) units. For example, an HEVC video bitstream may contain one or more CVSs, each containing a NAL unit. Each NAL unit has a NAL unit header. In one example, the header is 1 byte in H.264 / AVC and 2 bytes in HEVC (except for multi-layer extensions). The syntax elements in the NAL unit header take the specified bits and are therefore visible to all types of system and transport layers, particularly transport streams, real-time transport (RTP) protocols, and file formats.

[0076]

[0084] Two classes of NAL units exist in the HEVC standard: Video Coding Layer (VCL) NAL units and non-VCL NAL units. A VCL NAL unit contains one slice or slice segment (as described below) of coded picture data, while a non-VCL NAL unit contains control information related to one or more coded pictures. In some cases, NAL units are sometimes referred to as packets. An HEVC AU includes VCL NAL units containing coded picture data and non-VCL NAL units corresponding to the coded picture data (if any).

[0077]

[0085] A NAL unit may contain a sequence of bits that form a coded representation of video data, such as a coded representation of a picture in a video (e.g., an encoded video bitstream, a CVS of the bitstream, etc.). The encoder engine 106 generates a coded representation of a picture by dividing each picture into multiple slices. Each slice is independent of other slices so that the information in the slice is coded without dependence on data from other slices within the same picture. A slice contains one or more slice segments containing independent slice segments and one or more dependent slice segments that depend on the previous slice segment, if present. A slice is divided into coding tree blocks (CTBs) of lumar samples and chromar samples. The CTB of a lumar sample and one or more CTBs of a chromar sample, along with the syntax for the sample, are called coding tree units (CTUs). A CTU is sometimes called a “tree block” or “largest coding unit” (LCU). A CTU is the basic processing unit for HEVC coding. A CTU can be split into multiple coding units (CUs) of varying sizes. The CU contains lumens and chromacortic sample arrays called coding blocks (CBs).

[0078]

[0086] The lumar and chroma CBs can be further split into prediction blocks (PBs). A PB is a block of samples of a lumar or chroma component that uses the same motion parameters for inter-prediction or intra-block copy prediction (when available or enabled for use). The lumar PB and one or more chroma PBs, along with their associated syntax, form a prediction unit (PU). For inter-prediction, a set of motion parameters (e.g., one or more motion vectors, reference indices, etc.) is signaled in the bitstream for each PU and used for inter-prediction of the lumar PB and one or more chroma PBs. The motion parameters are sometimes called motion information. The CBs can also be divided into one or more transformation blocks (TBs). A TB represents a square block of samples of a color component to which a residual transformation (e.g., in some cases, the same 2D transformation) is applied to code the prediction residual signal. A transformation unit (TU) represents the TBs of the lumar and chroma samples and their corresponding syntax elements.

[0079]

[0087] The size of a CU corresponds to the size of the coding mode and can be square in shape. For example, the size of a CU can be 8×8 samples, 16×16 samples, 32×32 samples, 64×64 samples, or any other suitable size up to the size of the corresponding CTU. The phrase "N×N" is used herein to refer to the pixel dimensions of a video block with respect to its vertical and horizontal dimensions (e.g., 8 pixels × 8 pixels). Pixels in a block can be arranged in rows and columns. In some examples, a block may not have the same number of pixels horizontally as it does vertically. Syntax data associated with a CU may, for example, represent a division of the CU into one or more PUs. The division mode may differ between intra-predictive mode coding and inter-predictive mode coding of the CU. PUs may be divided so that their shape is non-square. Syntax data associated with a CU may also represent a division of the CU into one or more TUs following a CTU. TUs may be square or non-square in shape.

[0080]

[0088] According to the HEVC standard, the conversion can be performed using conversion units (TUs). TUs can differ in different CUs. TUs can be sized based on the size of PUs within a given CU. TUs can be the same size as or smaller than PUs. In some examples, residual samples corresponding to CUs can be subdivided into smaller units using a quad-tree structure known as a residual quad-tree (RQT). Leaf nodes in the RQT can correspond to TUs. Pixel difference values ​​associated with TUs can be transformed to generate conversion coefficients. These conversion coefficients can be quantized by the encoder engine 106.

[0081]

[0089] Once the video data picture is divided into CUs, the encoder engine 106 predicts each PU using a prediction mode. The prediction unit or prediction block is subtracted from the original video data to obtain the residual (described below). For each CU, the prediction mode may be signaled in the bitstream using syntax data. The prediction mode may include intra-prediction (or in-picture prediction) or inter-prediction (or inter-picture prediction). Intra-prediction utilizes correlations between spatially adjacent samples within a picture. For example, using intra-prediction, each PU is predicted from adjacent image data within the same picture using, for example, a DC prediction to find the mean value about the PU, a plane prediction to fit a flat surface to the PU, a direction prediction to extrapolate from adjacent data, or any other suitable type of prediction. Inter-prediction uses temporal correlations between pictures to derive motion-compensated predictions about blocks of image samples. For example, using inter-prediction, each PU is predicted using motion-compensated predictions from image data in one or more reference pictures (before or after the current picture in the output order). The decision of whether to use cross-picture prediction or intra-picture prediction to code a picture area can be made, for example, at the CU level.

[0082]

[0090] The encoder engine 106 and the decoder engine 116 (described in more detail below) may be configured to operate according to VVC. According to VVC, a video coder (such as the encoder engine 106 and / or decoder engine 116) divides a picture into multiple coding tree units (CTUs) (where the CTB of a lumen sample and one or more CTBs of a chroma sample, along with the syntax for the sample, are called CTUs). The video coder may divide the CTUs according to a tree structure, such as a quad-tree binary tree (QTBT) structure or a multi-type tree (MTT) structure. The QTBT structure eliminates the concept of multiple division types, such as the distinction between CU, PU, ​​and TU in HEVC. The QTBT structure includes two levels, a first level divided according to quad-tree division and a second level divided according to binary tree division. The root node of the QTBT structure corresponds to a CTU. The leaf nodes of the binary tree correspond to coding units (CUs).

[0083]

[0091] In an MTT partitioning structure, blocks can be partitioned using quad-tree partitions, binary-tree partitions, and one or more types of triple-tree partitions. A triple-tree partition is a partition in which a block is split into three subblocks. In some examples, a triple-tree partition divides a block into three subblocks without splitting the original block through a center. The partitioning types in an MTT (e.g., quad-tree, binary-tree, and triple-tree) can be symmetrical or asymmetrical.

[0084]

[0092] When operating according to the AV1 codec, the encoding device 104 and decoding device 112 may be configured to code video data in blocks. In AV1, the largest coding block that can be processed is called the superblock. In AV1, the superblock can be either 128×128 lumasamps or 64×64 lumasamps. However, in successor video coding formats (e.g., AV2), the superblock may be defined by a different (e.g., larger) lumasamp size. In some examples, the superblock is the top level of a block quad tree. The encoding device 104 may further subdivide the superblock into smaller coding blocks. The encoding device 104 may subdivide the superblock and other coding blocks into smaller blocks using square or non-square divisions. Non-square blocks may include N / 2×N, N×N / 2, N / 4×N, and N×N / 4 blocks. The encoding device 104 and decoding device 112 may perform separate prediction and transformation processes for each coding block.

[0085]

[0093] AV1 also defines tiles of video data. A tile is a rectangular array of superblocks that can be coded independently of other tiles. That is, the encoding device 104 and the decoding device 112 can encode and decode coding blocks within a tile, respectively, without using video data from other tiles. However, the encoding device 104 and the decoding device 112 can perform filtering across tile boundaries. Tiles can be uniform or non-uniform in size. Tile-based coding can enable parallel processing and / or multithreading for encoder and decoder implementations.

[0086]

[0094] In some examples, the encoding device 104 and the decoding device 112 may use a single QTBT or MTT structure to represent the luminance component and the chrominance component, respectively; in other examples, the video coder may use two or more QTBT or MTT structures, such as one QTBT or MTT structure for the luminance component and another QTBT or MTT structure for both chrominance components (or two QTBT and / or MTT structures for each chrominance component).

[0087]

[0095] The encoding device 104 and the decoding device 112 may be configured to use a quad-tree partition, QTBT partition, MTT partition, or other partition structure that conforms to HEVC.

[0088]

[0096] In some examples, one or more slices of a picture are assigned a slice type. Slice types include I-slices, P-slices, and B-slices. An I-slice (intra-frame, independently decodeable) is a slice of a picture that is coded only by intra-prediction, and therefore, an I-slice is independently decodeable because it only requires data within the frame to predict any prediction unit or prediction block in the slice. A P-slice (unidirectionally predicted frame) is a slice of a picture that can be coded using intra-prediction and unidirectional inter-prediction. Each prediction unit or prediction block within a P-slice is coded using either intra-prediction or inter-prediction. When inter-prediction is applied, the prediction unit or prediction block is predicted by only one reference picture, and therefore, the reference sample is from only one reference region in a frame. A B-slice (bidirectionally predicted frame) is a slice of a picture that can be coded using intra-prediction and inter-prediction (e.g., either bidirectional or single-prediction). A prediction unit or prediction block of a B slice can be predicted bidirectionally from two reference pictures, where each picture derives one reference region, and the sample sets of the two reference regions are weighted (for example, with equal or different weights) to generate the prediction signal for the bidirectionally predicted block. As described above, a slice of one picture is coded independently. In some cases, a picture may be coded as just one slice.

[0089]

[0097] As described above, in-picture prediction utilizes correlations between spatially adjacent samples within a picture. There are multiple intra-prediction modes (also called "intra-modes"). In some examples, intra-prediction for a rumablock includes 35 modes, including a planar mode, a DC mode, and 33 angular modes (e.g., a diagonal intra-prediction mode and angular modes adjacent to the diagonal intra-prediction mode). The 35 modes of intra-prediction are indexed as shown in Table 1 below. In other examples, more intra-modes may be defined that include prediction angles not yet represented by the 33 angular modes. In other examples, the prediction angles associated with the angular modes may differ from those used in HEVC.

[0090] [Table 1]

[0091]

[0098] Picture-to-picture prediction uses time correlation between pictures to derive motion-compensated predictions for blocks of image samples. Using a translational motion model, the position of a block in a previously decoded picture (reference picture) is indicated by a motion vector (Δx, Δy), where Δx specifies the horizontal displacement of the reference block relative to the current block position, and Δy specifies its vertical displacement. In some cases, the motion vector (Δx, Δy) can be integer sample precision (also called integer precision), in which case the motion vector points to an integer Pell grid (or integer pixel sampling grid) of the reference frame. In some cases, the motion vector (Δx, Δy) can be fractional sample precision (also called fractional Pell precision or non-integer precision) to more accurately capture the movement of the underlying object without being limited to an integer Pell grid of the reference frame. The precision of the motion vector can be expressed by the quantization level of the motion vector. For example, the quantization level can be integer precision (e.g., 1 pixel) or fractional Pell precision (e.g., 1 / 4 pixel, 1 / 2 pixel, or other subpixel values). When the corresponding motion vector has fractional sample precision, interpolation is applied to the reference picture to derive the prediction signal. For example, samples available at integer positions may be filtered (e.g., using one or more interpolation filters) to estimate values ​​at fractional positions. The previously decoded reference picture is indicated by its reference index (refIdx) in the reference picture list. The motion vector and reference index are sometimes called motion parameters. Two types of picture-to-picture predictions can be performed, including single and bi-prediction.

[0092]

[0099] In the case of interpretation using biprediction (also called bidirectional interpretation), two sets of motion parameters (Δx0, y0, refIdx0, and Δx1, y1, refIdx1) are used to generate two motion-compensated predictions (from the same reference picture, or possibly different reference pictures). For example, in biprediction, each prediction block uses two motion-compensated prediction signals to generate a B-prediction unit. The two motion-compensated predictions are combined to obtain the final motion-compensated prediction. For example, the two motion-compensated predictions may be combined by averaging. In another example, weighted prediction may be used, in which case different weights may be applied to each motion-compensated prediction. The reference pictures that may be used in biprediction are stored in two separate lists, shown as List 0 and List 1. The motion parameters may be derived in the encoder using a motion estimation process.

[0093]

[0100] In interpretation using single prediction (also called unidirectional interpretation), one set of motion parameters (Δx0, y0, refIdx0) is used to generate motion-compensated predictions from a reference picture. For example, in single prediction, each prediction block uses at most one motion-compensated prediction signal to generate a P-prediction unit.

[0094]

[0101] A PU may include data related to the prediction process (e.g., motion parameters or other preferred data). For example, when a PU is encoded using intra-prediction, the PU may include data representing the intra-prediction mode for the PU. As another example, when a PU is encoded using inter-prediction, the PU may include data defining the motion vector for the PU. The data defining the motion vector for the PU may represent, for example, the horizontal component (Δx) of the motion vector, the vertical component (Δy) of the motion vector, the resolution of the motion vector (e.g., integer precision, 1 / 4 pixel precision, or 1 / 8 pixel precision), the reference picture pointed to by the motion vector, the reference index, a list of reference pictures for the motion vector (e.g., list 0, list 1, or list C), or any combination thereof.

[0095]

[0102] AV1 includes two common techniques for encoding and decoding coding blocks of video data. The two common techniques are intra-prediction (e.g., in-frame prediction or spatial prediction) and inter-prediction (e.g., inter-frame prediction or temporal prediction). In the context of AV1, when predicting a block of the current frame of video data using the intra-prediction mode, the encoding device 104 and decoding device 112 do not use video data from other frames of the video data. In most intra-prediction modes, the video encoding device 104 encodes the block of the current frame based on the difference between the sample value in the current block and the predicted value generated from a reference sample in the same frame. The video encoding device 104 determines the predicted value generated from the reference sample based on the intra-prediction mode.

[0096]

[0103] After performing predictions using intra-prediction and / or inter-prediction, the encoding device 104 can perform transformations and quantization. For example, after prediction, the encoder engine 106 may compute residual values ​​corresponding to the PU. The residual values ​​may consist of pixel difference values ​​between the current block (PU) of pixels being coded and the prediction block used to predict the current block (e.g., the predicted version of the current block). For example, after generating a prediction block (e.g., emitting an inter-prediction or intra-prediction), the encoder engine 106 may generate a residual block by subtracting the prediction block generated by the prediction unit from the current block. The residual block contains a set of pixel difference values ​​that quantify the difference between the pixel values ​​of the current block and the pixel values ​​of the prediction block. In some examples, the residual block may be represented in a two-dimensional block format (e.g., a two-dimensional matrix or array of pixel values). In such examples, the residual block is a two-dimensional representation of the pixel values.

[0097]

[0104] Any residual data that may remain after the prediction is performed is transformed using block transforms which may be based on discrete cosine transforms, discrete sine transforms, integer transforms, wavelet transforms, other suitable transform functions, or any combination thereof. In some cases, one or more block transforms (e.g., sizes 32×32, 16×16, 8×8, 4×4, or other suitable sizes) may be applied to the residual data in each CU. In some embodiments, TUs may be used for the transformation and quantization processes implemented by the encoder engine 106. A given CU having one or more PUs may also include one or more TUs. As will be described in more detail below, the residual values ​​may be transformed into transformation coefficients using block transforms and may be quantized and scanned using TUs to generate serial transformation coefficients for entropy coding.

[0098]

[0105] In some embodiments, after intra-predictive coding or inter-predictive coding of the CU using the PU, the encoder engine 106 may compute residual data for the TU of the CU. The PU may comprise pixel data in the spatial domain (or pixel domain). The TU may comprise coefficients in the transformation domain after the application of block transformations. As described above, the residual data may correspond to pixel difference values ​​between the pixels of the unencoded picture and the predicted values ​​corresponding to the PU. The encoder engine 106 may form a TU containing the residual data for the CU and transform the TU to generate transformation coefficients for the CU.

[0099]

[0106] The encoder engine 106 may perform quantization of the conversion coefficients. Quantization provides further compression by quantizing the conversion coefficients to reduce the amount of data used to represent the coefficients. For example, quantization may reduce the bit depth associated with some or all of the coefficients. In one example, a coefficient with an n-bit value may be truncated to an m-bit value during quantization, where n is greater than m.

[0100]

[0107] Once quantization is performed, the coded video bitstream includes quantized transformation coefficients, prediction information (e.g., prediction mode, motion vector, block vector, etc.), piecewise information, and any other suitable data such as other syntax data. Different elements of the coded video bitstream can be entropy coded by the encoder engine 106. In some examples, the encoder engine 106 may utilize a predefined scan order to scan the quantization transformation coefficients to generate a serialized vector that can be entropy coded. In some examples, the encoder engine 106 may perform adaptive scanning. After scanning the quantization transformation coefficients to form a vector (e.g., a one-dimensional vector), the encoder engine 106 may entropy coded the vector. For example, the encoder engine 106 may use context-adaptive variable-length coding, context-adaptive binary arithmetic coding, syntax-based context-adaptive binary arithmetic coding, probability interval piecewise entropy coding, or another preferred entropy coding technique.

[0101]

[0108] The output 110 of the encoding device 104 may send NAL units constituting encoded video bitstream data to the decoding device 112 of the receiving device via the communication link 120. The input 114 of the decoding device 112 may receive the NAL units. The communication link 120 may include a channel provided by a wireless network, a wired network, or a combination of a wired network and a wireless network. The wireless network may include any wireless interface or combination of wireless interfaces, and may include any suitable wireless network (e.g., the Internet or other wide area networks, packet-based networks, WiFi®, radio frequency (RF), UWB, WiFi-Direct, cellular, Long-Term Evolution (LTE®), WiMAX®, etc.). The wired network may include any wired interface (e.g., fiber, Ethernet®, power line Ethernet, Ethernet over coaxial cable, digital signal line (DSL), etc.). The wired and / or wireless network may be implemented using various devices such as base stations, routers, access points, bridges, gateways, switches, etc. Encoded video bitstream data can be modulated according to communication standards such as wireless communication protocols and transmitted to a receiving device.

[0102]

[0109] In some examples, the encoding device 104 may store the encoded video bitstream data in the storage device 108. The output 110 may retrieve the encoded video bitstream data from the encoder engine 106 or from the storage device 108. The storage device 108 may include any of a variety of distributed or locally accessed data storage media. For example, the storage device 108 may include a hard drive, a storage disk, flash memory, volatile or non-volatile memory, or any other suitable digital storage medium for storing the encoded video data. The storage device 108 may also include a decoded picture buffer (DPB) for storing a reference picture for use in interpretation. In further examples, the storage device 108 may correspond to a file server or another intermediate storage device that can store the encoded video generated by the source device. In such cases, the receiving device, including the decoding device 112, can access the stored video data from the storage device via streaming or download. The file server may be any type of server capable of storing encoded video data and transmitting that encoded video data to the receiving device. An exemplary file server may include a web server (for a website, for example), an FTP server, a network-attached storage (NAS) device, or a local disk drive. The receiving device may access encoded video data through any standard data connection, including an internet connection, and may include a wireless channel (e.g., a Wi-Fi® connection), a wired connection (e.g., a DSL, cable modem, etc.), or a combination of both, which is suitable for accessing encoded video data stored on the file server. Transmission of encoded video data from storage device 108 may be streaming transmission, download transmission, or a combination thereof.

[0103]

[0110] The input 114 of the decoding device 112 may receive encoded video bitstream data and provide the video bitstream data to the decoder engine 116 or to the storage device 118 for later use by the decoder engine 116. For example, the storage device 118 may include a DPB for storing a reference picture for use in interpretation. A receiving device including the decoding device 112 may receive encoded video data to be decoded via the storage device 108. The encoded video data may be modulated according to a communication standard such as a wireless communication protocol and transmitted to the receiving device. The communication medium for the transmitted encoded video data may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful to enable communication from the source device to the receiving device.

[0104]

[0111] The decoder engine 116 may decode the encoded video bitstream data by entropy decoding (for example, using an entropy decoder) and extracting elements of one or more encoded video sequences that make up the encoded video data. The decoder engine 116 may rescale the encoded video bitstream data and perform an inverse transform on the encoded video bitstream data. The residual data is passed to the prediction stage of the decoder engine 116. The decoder engine 116 predicts blocks of pixels (for example, PUs). In some examples, the predictions are added to the output of the inverse transform (residual data).

[0105]

[0112] The decoding device 112 may output the decoded video to the video destination device 122, which may include a display or other output device for displaying the decoded video data to the content consumer. In some embodiments, the video destination device 122 may be part of a receiving device that includes the decoding device 112. In some embodiments, the video destination device 122 may be part of a separate device other than the receiving device.

[0106]

[0113] In some examples, the video encoding device 104 and / or the video decoding device 112 may be integrated with an audio encoding device and an audio decoding device, respectively. The video encoding device 104 and / or the video decoding device 112 may also include other hardware or software necessary to implement the coding techniques described above, such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combination thereof. The video encoding device 104 and the video decoding device 112 may be integrated as part of a composite encoder / decoder (codec) in each device. An example of specific details of the encoding device 104 is described below with reference to Figure 8. An example of specific details of the decoding device 112 is described below with reference to Figure 9.

[0107]

[0114] The exemplary system shown in Figure 1 is one exemplary example that may be used herein. The techniques for processing video data using the techniques described herein can be implemented by any digital video coding and / or decoding device. Generally, the techniques of the Disclosure are implemented by video coding devices or video decoding devices, but the techniques can also be implemented by a composite video encoder / decoder commonly referred to as a “codec”. Furthermore, the techniques of the Disclosure can also be implemented by a video preprocessor. Source devices and receiving devices are merely examples of coding devices such that the source device generates coded video data to be transmitted to the receiving device. In some examples, the source device and receiving device may operate substantially symmetrically such that each device includes a video coding component and a video decoding component. Thus, exemplary systems may support one-way or two-way video transmission between video devices for, for example, video streaming, video playback, video broadcasting, or video telephony.

[0108]

[0115] Extensions to the HEVC standard include a multi-view video coding extension called MV-HEVC and a scalable video coding extension called SHVC. Both the MV-HEVC and SHVC extensions share the concept of layered coding, where different layers are included in the encoded video bitstream. Each layer in the coded video sequence is addressed by a unique layer identifier (ID). Layer IDs may be present in the header of a NAL unit to identify the layer associated with that NAL unit. In MV-HEVC, different layers can represent different views of the same scene in the video bitstream. SHVC provides different scalable layers that represent the video bitstream at different spatial resolutions (or picture resolutions) or different reconstruction fidelity. A scalable layer may include a base layer (with layer ID=0) and one or more enhancement layers (with layer IDs=1, 2, ..., n). The base layer may conform to the profile of the first version of HEVC and represent the lowest available layer in the bitstream. An enhancement layer has increased spatial resolution, temporal resolution, or frame rate, and / or reconstruction fidelity (or quality) compared to the base layer. Enhancement layers are organized hierarchically and may depend on (or not depend on) lower layers. In some examples, different layers may be coded using a single standard codec (e.g., all layers are coded using HEVC, SHVC, or another coding standard). In some examples, different layers may be coded using multiple standard codecs. For example, the base layer may be coded using AVC, while one or more enhancement layers may be coded using the SHVC extension and / or MV-HEVC extension to the HEVC standard.

[0109]

[0116] Generally, a layer contains a set of VCL NAL units and a corresponding set of non-VCL NAL units. NAL units are assigned a specific layer ID value. Layers can be hierarchical in the sense that one layer may depend on a lower layer. A layer set refers to a set of layers represented within a self-contained bitstream, meaning that a layer within a layer set may depend on other layers in the layer set during the decoding process, but does not depend on any other layer for decoding. Thus, layers within a layer set can form independent bitstreams that can represent video content. A set of layers within a layer set may be obtained from another bitstream through the operation of a sub-bitstream extraction process. A layer set may correspond to a set of layers that will be decoded when the decoder is desired to operate according to certain parameters.

[0110]

[0117] As previously described, an HEVC bitstream includes a group of NAL units, which include VCL NAL units and non-VCL NAL units. VCL NAL units contain coded picture data that forms the coded video bitstream. For example, the sequence of bits that make up the coded video bitstream resides within the VCL NAL unit. Non-VCL NAL units may contain parameter sets with high-level information related to the coded video bitstream, in addition to other information. For example, a parameter set may include a video parameter set (VPS), a sequence parameter set (SPS), and a picture parameter set (PPS). Examples of parameter set goals include bitrate efficiency, error resilience, and providing a system layer interface. Each slice refers to a single active PPS, SPS, and VPS to access information that the decoding device 112 can use to decode that slice. An ID including a VPS identifier (ID), an SPS ID, and a PPS ID may be coded for each parameter set. The SPS includes the SPS ID and the VPS ID. The PPS includes a PPS ID and an SPS ID. Each slice header includes a PPS ID. The IDs can be used to identify the active parameter set for a given slice.

[0111]

[0118] The PPS contains information that applies to all slices in a given picture. In some examples, all slices in a picture point to the same PPS. Slices in different pictures may also point to the same PPS. The SPS contains information that applies to all pictures in the same coded video sequence (CVS) or bitstream. As previously described, a coded video sequence is a series of AUs (AUs) that begin with a random access point picture with certain properties in the base layer (as described above) (e.g., an instantaneous decode reference (IDR) picture or a broken link access (BLA) picture, or any other suitable random access point picture) and continue until the next access unit (AU) in the base layer that has a random access point picture with certain properties, without including the next AU (or the end of the bitstream). The information in the SPS may not change from picture to picture within the coded video sequence. Pictures in a coded video sequence may use the same SPS. The VPS contains information that applies to all layers in a coded video sequence or bitstream. The VPS includes a syntax structure with syntax elements that apply to the entire coded video sequence. In some embodiments, the VPS, SPS, or PPS may be transmitted in-band along with the coded bitstream. In some embodiments, the VPS, SPS, or PPS may be transmitted out-of-band in a separate transmission from the NAL unit containing the coded video data.

[0112]

[0119] In this disclosure, the term “signaling” may generally refer to “signaling” certain information, such as syntax elements. The term “signaling” may generally refer to the communication of values ​​about syntax elements and / or other data used to decode encoded video data. For example, video encoding device 104 may signal values ​​about syntax elements in a bitstream. Generally, signaling refers to generating values ​​in a bitstream. As described above, video source 102 may transport the bitstream to video destination device 122, either substantially in real time or not in real time, as may occur when storing syntax elements in storage device 108 for later retrieval by video destination device 122.

[0113]

[0120] A video bitstream may also contain Supplemental Enhancement Information (SEI) messages. For example, an SEI NAL unit may be part of a video bitstream. In some cases, SEI messages may contain information that is not required by the decoding process. For example, information in an SEI message may not be essential for a decoder to decode the video picture in the bitstream, but the decoder may use that information to improve the display or processing of the picture (e.g., the decoded output). Information in an SEI message may be embedded metadata. In one exemplary example, information in an SEI message may be used by a decoder-side entity to improve the readability of the content. In some cases, some example standards may specify the presence of such SEI messages in a bitstream (e.g., in addition to many other examples, frame packing SEI messages are carried for every frame of the video, carrying frame packing SEI messages for frame-compatible planar stereoscopic 3DTV video formats, processing recovery point SEI messages, and the use of pan scan scan rectangle SEI messages in DVB) so that quality improvements may be brought to all devices conforming to the example standard.

[0114]

[0121] As described above, the encoding device 104 can entropy encode the quantized transformation coefficients and / or syntax elements to generate a bitstream. The decoding device 112 can receive the bitstream and entropy decode it. In some examples, the encoding device 104 and / or the decoding device 112 can utilize rice coding with rice parameters to perform entropy coding (e.g., entropy coding and / or decoding). According to the current VVC standard, the rice parameters for typical residual coding (RRC) can be derived based on a template for calculating the sum of neighboring transformation coefficients and a lookup table that maps various possible sums to specific rice parameter values. In this method, the sum calculated from the template is used as an index to the lookup table of rice parameter values. An exemplary template is shown in Figure 2, which is described below. An example of a lookup table of rice parameter values ​​is provided in Table 1 below.

[0115]

[0122] Figure 2 shows an example of a template for Rice parameter derivation. In the example in Figure 2, the template is shown as being applied to an 8x8 grid of samples, but a larger or smaller number of samples (and a larger or smaller grid) may be used. In some cases, the 8x8 grid may represent a transform block or transform unit (TU) taken from a larger frame or slice of video data. As shown in the figure, to determine the Rice parameter of the current transform coefficient (e.g., shaded with solid black fills), the video coder can first use the template to identify one or more neighboring transform coefficients (e.g., lightly shaded with diagonal line fills). As shown in Figure 2, the Rice parameter derivation template identifies five neighboring coefficients for a given current coefficient, but a larger or smaller number of neighboring coefficients and / or neighboring coefficients in different patterns and arrangements may be used.

[0116]

[0123] The video coder can then determine the sum of the absolute values ​​of the neighbor transformation coefficients identified based on a template (e.g., locSumAbs). In some examples, the obtained sum of the neighbor transformation coefficients may be provided directly as an index to a lookup table in Table 1 to obtain the Rice parameter values ​​of the current coefficients. In one example, locSumAbs may be normalized (e.g., via subtraction and clipping operations) as follows before being provided as an index to Table 1:

[0117]

number

[0118]

[0124] As mentioned above, the rice parameter can be derived using the value of locSumAbs as an index to a lookup table. An example of a lookup table mapping between locSumAbs values ​​and rice parameter values ​​(e.g., cRiceParam) is provided in Table 1 below.

[0119] [Table 2]

[0120]

[0125] As shown in Table 1, in some examples, the range of values ​​for the Rice parameter may be constrained to 0 to 3, including the endpoints. Since the raw locSumAbs value is normalized to be between 0 and 31 (for example, via the exemplary normalization operation provided above), Table 1 can be used to derive the Rice parameter values ​​for all possible values ​​of locSumAbs that can be output by the normalization operation.

[0121]

[0126] The Rice parameter derivation process given by section 9.3.3.2 of the VVC specification is reproduced below for reference.

[0122] [Table 3]

[0123] [Table 4]

[0124]

[0127] In some cases, the rice parameter derivation in VVC9.3.3.2 may be modified, for example, for the high-bit-depth extension of VVC, based on the observation that high-bit-depth video data may normally be subject to performance and / or efficiency limitations under the unmodified rice parameter derivation process of VVC9.3.3.2. A modified rice parameter derivation may therefore be used to address one or more of these limitations at various input bit depths of video, and thus improve the compression efficiency of the coding design. For example, in some cases, a modified rice parameter derivation may include scaling or normalizing locSumAbs to handle the increased bit depth and / or increased dynamic range of the conversion coefficients. As previously described, scaling and normalization may be performed before using locSumAbs to derive the rice parameters. In some cases, a modified Equation 1517 of the VVC specification may be used.

[0125]

[0128] A first example of the modified Equation 1517 for rice parameter derivation is provided below, annotated to show the modification to VVC9.3.3.2. The amount of the scaling factor applied may depend on the input bit depth, a predefined operation bit depth (e.g., 10), the local activity of the conversion coefficients, and / or the block size or syntax elements signaled in the bitstream. locSumAbs may then be clipped to a specific range using the existing clipping mechanism in VVC, for example, clipping locSumAbs to between 0 and 31. The normalized and clipped locSumAbs may then be used to derive rice parameter values ​​using a predefined lookup table, for example, the current lookup table in VVC, Table 128 (the same as Table 1 above). The rice parameter values ​​from the lookup table may then be modified by adding an offset to extend the dynamic range of the rice parameter range. The following is an example modification of Section 9.3.3.2 of the VVC specification using the exemplary techniques described above (additions are underlined text (" addition (As shown in '').

[0126] [Table 5]

[0127] In some examples, additional variables a, b, and c may be defined as follows: Variable a may be an integer value, e.g., a=4, or some other power of 2; Variable b may specify the bit depth of the operation, e.g., b=10; and Variable c may be set to equal to the calculated value shift introduced above in the modified formula 1517, or derived from the calculated shift value.

[0128]

[0129] A second example of the modified Equation 1517 for rice parameter derivation is provided below, and is again annotated to show the modifications made to VVC9.3.3.2. In this second example of the modified Equation 1517, locSumAbs can be scaled and / or normalized only when locSumAbs is greater than or equal to the threshold T. In such an example, the rice parameter derivation process given by VVC9.3.3.2 can be modified accordingly as follows (additions are underlined text (" addition (As shown in '').

[0129] [Table 6]

[0130]

[0130] In some examples, the threshold T is a predefined threshold. In one exemplary example, the threshold T may be set to equal to 32. In some examples, one or more values ​​of variables a, b, and c may be signaled through the bitstream. In addition or alternatively, one or more values ​​of variables a, b, and c may be set in accordance with or derived from one or more of the bit depth, local statistics (e.g., the minimum / maximum or mean of the transformation coefficient values ​​in the current block), the decoded transformation or block size, and / or syntax elements signaled in the bitstream. In some cases, one or more values ​​of variables a, b, and c used in the second modification of Equation 1517 above may be the same as or similar to the corresponding values ​​of one or more variables a, b, and c used in the first modification of Equation 1517 discussed earlier.

[0131]

[0131] The template-based method for Rice parameter derivation under VVC9.3.3.2 (e.g., the unmodified Equation 1517) and the various modification examples described above (e.g., the first and second modifications of Equation 1517) can, in some examples, take advantage of the fact that decoding is performed in a reverse path, starting from the end of a block and proceeding toward its DC. Based on reverse-path decoding performed per block or TU, these previously described methods for Rice parameter derivation can take advantage of one or more transformation coefficients that are decoded earlier in the current TU.

[0132]

[0132] In VVC development, several statistical assumptions were made suggesting that non-zero conversion coefficients (e.g., context-coded) could be used to provide accurate Rice parameter derivation using the Golomb-Rice method. Further statistical assumptions during VVC development suggested that these non-zero conversion coefficients were available to the decoder before the decoder began conversion coefficient decoding. Such assumptions appear to hold for the Common Test Condition (CTC) coding used in VVC development.

[0133]

[0133] However, in some cases (for example, in the case of high-bit-depth coding), if there is a high proportion of small-sized TUs (e.g., having a size of 4x4) with transformation coefficients coded using the Golomb-Rice method, it is observed that accurate Rice derivation cannot be performed for transformation coefficients that appear precisely at the beginning of TU decoding. In particular, the amount of non-zero neighbor transformation coefficients available to perform template-based Rice parameter derivation for those coefficients that appear at the beginning of TU decoding may be insufficient (recall that template-based Rice parameter derivation uses some predetermined number of neighbor transformation coefficients, such as 5).

[0134]

[0134] As described above, this specification describes systems and techniques for improving parameter derivation (e.g., Rice parameter derivation) in video coding. These systems and techniques may be implemented by the encoding device 104, the decoding device 112, both the encoding device 104 and the decoding device 112, and / or other devices. In some cases, the encoding device 104 and / or the decoding device 112 may use one or more historical Rice parameter values ​​for Rice parameter derivation when an insufficient number of neighbor conversion coefficients are available. For example, the number of neighbor conversion coefficients may be smaller than a predefined amount necessary to fully utilize template-based lookup table techniques for Rice parameter derivation (e.g., techniques used in VVC and / or other video coding standards). Rather than ignoring unavailable neighbor conversion coefficients or setting them equal to 0, the systems and techniques described herein can provide historical Rice parameter values ​​to be used in place of unavailable neighbor conversion coefficients when implementing template and lookup table-based Rice derivation. In some cases, the systems and techniques described herein may be used in the context of high-bit-depth coding, where the shortcomings of existing rice parameter derivation techniques based on lookup tables may be encountered more frequently than usual.

[0135]

[0135] Figure 3 shows a different exemplary scenario in which the template support area (consisting of at least five neighboring transform coefficients 312, 314, 315, 316, and 318 associated with the current coefficient 302) extends outside the coded transform block or TU, thus resulting in a low-accuracy Rice parameter derivation. As shown in Figure 3, an 8x8 sample grid 300 is shown overlaid with the boundaries of three different transform blocks 320, 330, and 340 (e.g., TUs). All three of the transform blocks 320, 330, and 340 contain the current coefficient 302, which represents the sample or coefficient in which the transform block (e.g., TU) decoding and / or Rice parameter derivation is currently being performed. However, the location of the current coefficient 302 within the transform blocks 320, 330, and 340 is such that one or more of the five neighboring transform coefficients defined by the Rice derivation template are located outside the transform block (e.g., TU) (e.g., beyond its boundary).

[0136]

[0136] As previously discussed, decoding can be performed in a reverse pass across constituent samples within a transform block (or TU), such as starting from the lower right sample of the transform block. For example, the lower right sample of transform block 320 is the current coefficient 302, and therefore the current coefficient 302 is the first sample to be decoded for transform block 320. In the case of transform blocks 330 and 340, the current coefficient 302 is not the lower right sample, but the current coefficient 302 remains among the first few samples to be decoded in a reverse pass. In general, it can be observed that the geometry of the Rice derivation template may not be entirely contained within the boundaries or borders of the transform block (e.g., TU) due to samples located near the lower and / or right-hand edges of the transform block. Thus, in some cases, the first samples to be decoded in a reverse pass cannot fully utilize the template-based methods for Rice parameter derivation described above.

[0137]

[0137] In some cases, neighboring conversion coefficients located outside the template support area or outside the current conversion block (e.g., the current TU) may be treated as having a value of 0 in order to determine (e.g., calculate, compute, etc.) the absolute sum locSumAbs. For example, neighboring conversion coefficients 312, 314, 315, and 318 are all located outside the conversion block 340 (e.g., the TU), and only neighboring conversion coefficient 316 is inside the conversion block 340. In such cases, proceeding with the rice parameter derivation based only on conversion coefficient 316 may result in a less accurate rice parameter derivation. For some conversion blocks (e.g., conversion block 320), when all neighboring conversion coefficients defined by the template are located outside the conversion block, it may not be possible to derive the rice parameter using the template and lookup table techniques specified in VVC and other video coding standards.

[0138]

[0138] Accordingly, the systems and techniques described herein can be used to improve the accuracy of rice parameter derivation, at least in part, by determining (e.g., calculating, computation, etc.) and maintaining one or more historical values ​​of the optimal rice parameter. In some cases, the historical value of the optimal rice parameter can be determined from transformation coefficients that were decoded or encoded earlier (e.g., transformation coefficients outside the current transformation block that were decoded or encoded at some earlier time in the reverse pass). In some examples, one or more historical values ​​of the optimal rice parameter can be used as historical parameter values ​​determined from one or more previously encoded transformation blocks, where the historical parameter values ​​are used to determine the parameters (e.g., rice parameters) of the current sample. In some examples, the historical parameter values ​​can include one or more historical rice parameter values ​​and historical transformation coefficient values, where the historical transformation coefficient values ​​are determined from one or more previously encoded transformation blocks. In some cases, the historical parameter values ​​can be historical transformation coefficient values. In some examples, the historical parameter values ​​can be offset values ​​that can be derived externally. When a history parameter value is an offset value, the offset value may be determined at least in part based on one or more transformation coefficient values ​​determined from a previously encoded transformation block, and / or may be a predetermined offset value.

[0139]

[0139] In some examples, when one or more neighbor transformation coefficients provided by the Rice derivation template are located outside the current transformation block, one or more historical Rice parameter values ​​may be used when determining (e.g., calculating, compute, etc.) the absolute sum locSumAbs. For example, instead of treating unavailable neighbor transformation coefficients as having a value of 0, unavailable neighbor transformation coefficients may instead be assigned a historical Rice parameter value. In the context of Figure 3 and the example of transformation block 340, the unavailable neighbor transformation coefficients are 312, 314, 315, and 318. Therefore, in the example of transformation block 340, all four unavailable neighbor transformation coefficients 312, 314, 315, and 318 may be assigned a historical Rice parameter value. In some cases, the same historical Rice parameter value may be assigned to all unavailable neighbor transformation coefficients, although the historical Rice parameter value may also be modified or adjusted based on information and characteristics specific to each of the unavailable neighbor transformation coefficients.

[0140]

[0140] In some examples, the absolute sum locSumAbs may be calculated using a combination of historical Rice parameter values ​​and the values ​​of the available neighboring transformation coefficients. This may be called the partially unavailable case, where not all, but some of the neighboring transformation coefficients given by the Rice derivation template are located outside the current transformation block (e.g., TU). In the context of transformation block 340, the absolute sum locSumAbs may therefore be calculated as the sum of the absolute values ​​of the available transformation coefficients 316 and four historical Rice parameter values ​​obtained or otherwise determined for four unavailable transformation coefficients 312, 314, 315, and 318. As described above, the four historical Rice parameter values ​​may be the same or may be specifically determined for a given transformation coefficient among the unavailable transformation coefficients.

[0141]

[0141] The absolute sum locSumAbs may be calculated using only historical Rice parameter values, either as an addition or alternative. This can be called the case where all of the neighboring transformation coefficients given by the Rice derivation template are located outside the current transformation block and are completely unavailable. For example, referring to transformation block 320, we find that all five of the neighboring transformation coefficients 312, 314, 315, 316, and 318 are unavailable with respect to the current coefficient 302 of transformation block 320. Accordingly, in this completely unavailable case, the absolute sum locSumAbs may be calculated as the sum of the five historical Rice parameter values ​​obtained or otherwise determined for the five unavailable transformation coefficients. As mentioned above, the five historical Rice parameter values ​​may be the same or may be specifically determined for a given transformation coefficient among the unavailable transformation coefficients.

[0142]

[0142] In some examples, the systems and techniques disclosed herein (for example, implemented by encoding device 104 and / or decoding device 112) can classify the spatial location of the decoded coefficients within a transform block (e.g., TU) based on the expected (or estimated) accuracy of a template-based Rice derivation method for the coefficients. One exemplary example of classification based on the expected accuracy of a template-based Rice derivation is shown in Figure 4. In some cases, the 8×8 sample grid shown in Figure 4 may be the same as or similar to the 8×8 sample grid discussed above with respect to Figure 3. Similarly, the relative locations of the five neighboring transform coefficients with respect to the current coefficient may be the same in Figure 4 as in Figure 3, for example, both figures utilize the same exemplary Rice derivation template.

[0143]

[0143] The classification of the expected accuracy of a template-based Rice derivation can be based at least in part on the observation that the Rice derivation template identifies the positions of neighboring coefficients relative to the positions of current coefficients in a consistent manner (e.g., the same template is used each time a Rice parameter derivation is performed). Thus, given the positions of current coefficients within a transformation block (e.g., TU) and the shape of the Rice derivation template, the number of neighboring transformation coefficients that fall outside the boundary of the TU can be determined in advance. This number of unavailable neighboring transformation coefficients can then be used to predict or estimate the accuracy of the Rice parameter derivation that should result from the template-based method. In some examples, the number of unavailable neighboring transformation coefficients and / or the expected accuracy of the Rice derivation can further determine how historical Rice parameter values ​​are used (e.g., whether the systems and techniques of this disclosure are applied when they are partially unavailable or when they are completely unavailable).

[0144]

[0144] In the example in Figure 4, an 8x8 grid of sample 400 is shown. The sample grid 400 may be a transformation unit (TU) or coded block and is divided into four non-overlapping regions 410, 420, 430, and 440. As shown in the figure, each region may be assigned a different classification (e.g., C1, C2, C3, C4) according to the expected accuracy of the Rice parameter derivation. In other words, the expected accuracy of the Rice parameter derivation is the same for all samples within each region, but not necessarily the same for samples located in different regions.

[0145]

[0145] Samples (and associated transformation coefficients) whose spatial position lies within the first region 410 are shown as class C1. Samples with the C1 classification may be samples that are expected to have accurate Rice parameter derivations (e.g., greater than the precision threshold) using a template-based method. According to such an example, the Rice parameter derivation of the C1 coefficients may be determined (e.g., by video encoding device 104 and / or video decoding device 112) as follows:

[0146]

number

[0147] Here, template_based_method() may be provided as a template-based rice parameter derivation as defined in section 9.3.3.2 of VVC (reproduced above). In some examples, template_based_method() may be implemented using one or more of the possible modifications to VVC9.3.3.2, also described above.

[0148]

[0146] Samples (and associated transformation coefficients) whose spatial location lies within the fourth region 440 are shown as class C4. Samples with the C4 classification may be samples that are expected to have an inaccurate Rice parameter derivation (e.g., less than the precision threshold or zero precision) using one or more of the template-based methods described earlier herein. In one exemplary example, the video coding device 104 and / or the video decoding device 112 may instead use a history-based derivation method to obtain an accurate Rice parameter derivation (e.g., by using one or more history estimates of the best Rice parameters derived from the history of previously decoded coefficients). According to such an example, the video coding device 104 and / or the video decoding device 112 may determine the Rice parameter derivation of the C4 coefficient as follows:

[0149]

number

[0150]

[0147] Samples (and associated transformation coefficients) whose spatial location lies within the second region 420 are shown as class C2. Samples and transformation coefficients whose spatial location lies within the third region are shown as class C3. Samples with a C2 or C3 classification may be samples that are expected to have a reduced accuracy rice parameter derivation (e.g., less than an accuracy threshold) using one or more of the template-based methods or modifications thereof previously described herein. In one exemplary example, the accuracy of the rice parameter derivation of C2 and C3 coefficients may be improved by combining a template-based method, e.g., template_based_method(), with a history-based derivation method, e.g., history_based_method(). According to such an example, the video encoding device 104 and / or the video decoding device 112 may derive the rice parameters of C2 and / or C3 coefficients as follows:

[0151]

number

[0152]

[0148] In some examples, classification can be based on a run of the scan order in reverse, for example, assigning N first decoded coefficients to C4 and the remaining coefficients to C1 (recall that the reverse scan order starts with the bottom right sample, which should be located in C4 here).

[0153]

[0149] In some cases, the video encoding device 104 and / or the video decoding device 112 may use one or more subsets of the defined classes described above. For example, in some cases, the template-based method may have an insufficient quantity of neighboring coefficient values ​​to derive the rice parameter of the current coefficient located within the C4 region 440, so only the decoded coefficients of the C4 class may use historical rice information. The C1 class does not use historical rice information to perform the rice parameter derivation of the current coefficient located within the C1 region 410. This is because, for any possible location with C1, all neighboring coefficients defined by the rice template are still contained within the entire TU400. Thus, in some examples, support for the C1 class may be extended to include one or more of the C2 region 420, the C3 region 430, and / or the entire TU400, in each of which historical information is not used for rice derivation.

[0154]

[0150] In order to utilize the techniques described herein, the video coding device 104 and / or the video decoding device 112 may apply different techniques for aggregation of local and historical information to derive a rice parameter, e.g., ricePar. In some examples, the video coding device 104 and / or the video decoding device 112 may determine (e.g., calculate, compute, etc.) a weighted average based on rice information obtained from neighbor conversion coefficients (e.g., riceParTemplate by a template-based method) and historical rice parameter information (e.g., riceParHistory by a history-based method). For example, the video coding device 104 and / or the video decoding device 112 may determine a weighted average based on rice information obtained from neighbor conversion coefficients and historical rice parameter information using the following formula:

[0155]

number

[0156]

[0151] In some cases, one or more of the weights w1 and w2 of the weighted average may depend on the spatial location of the corresponding coefficients in the TU currently being decoded. In some examples, the weighted average may be an exponentially weighted moving average.

[0157]

[0152] Figure 5 shows an example of determining historical rice parameter information and / or historical rice parameter values ​​based on previously decoded TUs. A series of TUs are shown in grid 500. The lower right TU 510 is the TU currently being decoded (for example, here the historical rice parameter information may be used to derive the rice parameters for individual samples of the currently decoded TU). The remaining TUs 551-557 are previously decoded TUs, from which historical rice parameter information can be calculated. The previously decoded TUs 551-557 are labeled with the time step from which each TU was decoded, for example, TU 551 was decoded 1 step ago, TU 552 was decoded 2 steps ago, TU 553 was decoded 3 steps ago, and so on.

[0158]

[0153] For each given TU among the previously decoded TUs 551 to 557, the first non-zero conversion coefficient decoded for that given TU is accumulated in the history counter 520. In some examples, the value accumulated in the history counter 520 may be the magnitude of the first non-zero conversion coefficient itself, the magnitude of the decoded Rice parameter of the first non-zero conversion coefficient, and / or the binary code length (e.g., in bits) of the coefficient or Rice parameter as described above. As shown in the figure, the history counter 520 may apply a weight w to each accumulated value R to implement a weighted sum, for example. From the weighted sum, a weighted average and / or exponentially weighted moving average may be calculated for the history Rice parameter value. In some cases, the weight w may be set to equal 1, in which case the history counter 520 implements a sum, and an arithmetic mean may be calculated for the history Rice parameter value.

[0159]

[0154] In some examples, the video encoding device 104 and / or the video decoding device 112 can determine the weight w based on the spatial location of a first non-zero conversion coefficient in one of the previously decoded TU551-557 which is used to obtain the value R. The spatial location can correspond to one of the classifications C1-C4 discussed above with respect to Figure 4. The weight w can be a value between 0 and 1, and / or an integer value such as 1, 2, 3, etc.

[0160]

[0155] A value R extracted from the first non-zero conversion coefficient of each previously decoded TU551-557 is used as an update to the history counter 520 and may be called a history update or history update value. The cumulative history update counter maintained by the history counter 520 therefore represents the cumulative history sum (weighted sum if w is not equal to 1) over the entire series of previously decoded TU551-557. In some examples, the history counter 520 may be initialized to 0 or another starting value at the beginning of a CTU and / or slice, each of which may contain multiple TUs.

[0161]

[0156] Based on the cumulative historical values ​​in the history counter 520, the optimal historical rice parameter value may be used in the current TU510 to perform the history-based rice derivation described herein. For example, as mentioned above, an arithmetic mean or exponentially weighted moving average may be obtained from (or calculated based on one or more values ​​obtained from the history counter 520) and used as the historical rice parameter value. In Figure 5, connector arrows indicate that the historical rice parameter value from the history counter 520 flows from the output of the history counter 520 to these two areas of the current TU510, so that the historical rice parameter value from the history counter 520 may be used to derive the rice parameter for a sample located at either the lower edge or the right edge of the current TU510. The reason for this is that, in some cases, the lower and right edges of a given TU (for example, the current TU510) contain individual sample locations that are most likely to have one or more unavailable neighbor transformation coefficients defined by the Rice derivation template (see classifications C2, C3, and C4 in Figure 4, for example, located on the lower and right edges of TU400).

[0162]

[0157] Provided below is an example of a technique that may be used by the video encoding device 104 and / or the video decoding device 112 for aggregation of local neighbor coefficient information (e.g., obtained within the current TU based on a Rice derivation template) and historical Rice parameter information (e.g., obtained from previously decoded TUs 551-557 via the history counter 520). As previously stated, historical Rice parameter values ​​may be used in template-based Rice derivation when local information of neighbor transformation coefficients is unavailable or only partially available. Below is a pseudocode example of how a template-based Rice derivation technique may be extended to also provide a history-based Rice derivation. Additions to existing template-based methods are indicated by the underlined text (" additionIt is shown by ")". The term histCoef defines an estimated historical conversion coefficient, which has been accumulated in the past, for example, or is expressed for a historical Rice parameter value such as histCoef = 1 << histRiceParam. The terms M and N are estimated weight values, for example, integer values, and in some examples, they can be equal to 2 and 3 respectively.

[0163] [Number]

[0164]

[0158] The systems and techniques described in this specification can apply various techniques to perform history updates. In some examples, the video encoding device 104 and / or the video decoding device 112 can implement the historical parameters for Rice derivation as a counter (for example, the history counter 520). In some cases, the video encoding device 104 and / or the video decoding device 112 can utilize a moving average value storage for the decoded conversion coefficients (such as the previously decoded TUs 551 - 557) and / or their corresponding Rice parameters. In some examples, rather than using the actual values of the decoded conversion coefficients or Rice parameters, the video encoding device 104 and / or the video decoding device 112 can determine (for example, calculate, compute, etc.) the length of the binary codeword required to represent the decoded conversion coefficient or the corresponding Rice parameter based on, for example, the following formula.

[0165] [Number]

[0166]

[0159] In one example, for each class identified by the index riceClass, the video encoding device 104 and / or video decoding device 112 may calculate a separate history and store it in the counter StatCoeff[riceClass] so that different history rice parameter values ​​are available depending on the location of unavailable neighboring transformation coefficients for the current TU. In some cases, during TU decoding, each decoded transformation coefficient, defined to be included in the history update, may be represented through a binary code length estimate (e.g., codeLength above). The binary code length estimate may be used in the history update as indicated by the optimal history rice parameter value.

[0167]

[0160] For each previously decoded TU551-557, the number of conversion factors that should be included in the history update for that TU may be given by NUM_HISTORY_UPDATE. In some examples, NUM_HISTORY_UPDATE is set to equal 1, and only the first non-zero conversion factor from each previously decoded TU is used. However, NUM_HISTORY_UPDATE may also be set to a value such as 2 or 3, in which case the first two or first three non-zero conversion factors should be used for each previously decoded TU, respectively.

[0168]

[0161] The number of decoded conversion coefficients (e.g., equal to NUM_HISTORY_UPDATE) may be used to update historical observations maintained in one or more history counters. In some examples, historical observations may be stored and maintained by history counters such as history counter 520. Separate counters may be used in the history update process, such that one counter (e.g., collectStatCoeff) maintains the cumulative sum of code lengths and another counter (e.g., counterCollectStatCoeff) maintains the cumulative sum of the number of coefficients or separate entries provided to the history update process.

[0169]

number

[0170]

[0162] After the number of NUM_HISTORY_UPDATE samples defined for the history update of the current class and / or current TU has been parsed as described above, the global history counter StatCoeff may be updated through a linear model (e.g., a weighted moving average or an exponentially weighted moving average) as follows:

[0171]

number

[0172]

[0163] In some examples, the parameters of the linear model described above may be chosen as derivatives of two to the power of one, in order to enable more efficient implementation of low-complexity multiplication and / or division operations.

[0173]

[0164] In some examples, NUM_HISTORY_UPDATE may be set to equal to 1, meaning that only the first non-zero conversion coefficients are parsed from each previously decoded TU and used to update the history counter for determining the optimal history rice parameters. In this case, the above formula for numCollected is simplified to numCollected=0 (or the original formula above may be retained to account for cases where no conversion coefficients were collected for a given previously decoded TU, even though NUM_HISTORY_UPDATE was specified to be equal to 1).

[0174]

[0165] Continuing the above example, NUM_HISTORY_UPDATE is set to equal to 1 and numCollected is set to equal to 0, and then the second expression can be simplified as averageRiceInTU=collectStatCoeff. In other words, when only a single conversion coefficient has been collected for each TU (for example, the first non-zero conversion coefficient has been collected), the value averageRiceInTU is the same as the collected value collectStatCoeff for that TU.

[0175]

[0166] In some examples, weights w3 and w4 may both be set to equal 1, for example, thereby dropping them out of the third expression above for StatCoeff[i][compID]. When both weight values ​​are set to 1, the StatCoeff update value is then calculated as the average of just received historical update values ​​and previous StatCoeff values ​​from just before the most recent historical update value was received. In some examples, NUM_HISTORY_UPDATE, w3, and w4 may each be set to equal 1.

[0176]

[0167] In some examples, the history counter may be maintained through a single CTU that is normatively reset at the beginning of a specific region of the decoded picture, such as a full picture, slice, tile, group of CTUs, or group of CTUs. At the beginning of each new region to be decoded, the history counter may be reset to 0 or otherwise initialized to some predetermined starting value.

[0177]

[0168] In examples where the history counter is initialized with a default value at the start of each new region, in some cases the default value may be compiled and provided to the decoder as side information, signaled through or using the coded bitstream (e.g., at the slice level), provided through a special update signaling mechanism, and / or derived on the decoder side from bit depth, quantization parameters, or other syntax elements.

[0178]

[0169] In some examples, one or more aspects of the historical update process for rice parameter derivation described herein (e.g., update rate, moving average parameters or weights) may be generated depending on one or more of the block size, block dimension ratio, coding mode (e.g., intra-prediction or inter-prediction), slice type, and / or signaled syntax elements related to decoding.

[0179]

[0170] Figure 6 is a flowchart showing an example of a process 600 for processing image and / or video data. In block 602, the process 600 may include obtaining a transform block, which contains multiple samples. In some examples, the transform block may be a coded or decoded transform block. In some examples, the transform block may be a transform unit (TU). In some cases, the transform block may be the same as or similar to one or more of the transform blocks 320, 330, and 340 shown in Figure 3.

[0180]

[0171] In block 604, process 600 includes determining one or more parameters (e.g., Rice parameters) for a plurality of samples, at least in part by analyzing the local neighborhood of the current sample among the plurality of samples. In some cases, block 604 may include scanning transformation blocks, which may include analyzing the local neighborhood of the current sample among the plurality of samples. In some examples, the local neighborhood of the current sample may be located within the same transformation block as the current sample. For example, the local neighborhood may be given by the boundaries of three transformation blocks 320, 300, and 340, shown in Figure 3 for the current sample 302.

[0181]

[0172] In some cases, analyzing a local neighborhood can be done by comparing the local neighborhood to a template support area. The template support area can be obtained as a parameter derivation template, such as a rice parameter derivation template (used, for example, to perform a template and lookup table-based rice parameter derivation). In some embodiments, one or more parameters (e.g., rice parameters) can be determined in the context of high-bit-depth coding, which may encounter the shortcomings of existing rice parameter derivation techniques based on lookup tables more than usual.

[0182]

[0173] In block 606, process 600 includes determining that the number of neighbor transformation coefficients for the current sample is less than a threshold amount. The determination may be based at least in part on a local neighborhood analysis (for example, as described above with respect to block 604). In some examples, the threshold amount may be the same as the number of neighbor transformation coefficients included in a parameter derivation template (for example, a Rice parameter derivation template).

[0183]

[0174] In one exemplary example, the threshold amount may be equal to 5, which is the number of neighbor transformation coefficients included in the exemplary template for rice parameter derivation shown in Figure 2. In some examples, the threshold amount may be greater than or less than 5, and the rice parameter derivation template may include a number of neighbor coefficients greater than or less than those shown in Figure 2.

[0184]

[0175] In some cases, the determination that the number of neighboring transformation coefficients for the current sample is less than a threshold amount can be used to determine that the template support area extends outside the boundaries of the transformation block. For example, if the number of neighboring transformation coefficients available for the current sample is less than a threshold number of transformation coefficients included in the parameter derivation template (e.g., the Rice parameter derivation template), it can be determined that the template support area extends at least partially outside the boundaries of the transformation block (for example, transformation block 340 is shown in Figure 3 as having only one available neighboring transformation coefficient 316 within its boundaries). In some cases, if the number of neighboring transformation coefficients available for the current sample is zero, it can be determined that the template support area extends entirely outside the boundaries of the transformation block (for example, transformation block 320 is shown in Figure 3 as having zero available neighboring transformation coefficients within its boundaries).

[0185]

[0176] In block 608, process 600 includes obtaining a history parameter value (e.g., a history Rice parameter value) determined from one or more previously decoded transformation blocks. In some examples, the history parameter value may be obtained in response to a determination in block 606 that the number of available neighboring transformation coefficients in a transformation block is less than a threshold number of transformation coefficients included in the Rice derivation template. In some cases, the history parameter value (e.g., a history Rice parameter value) may be determined dynamically in block 608. In some examples, the history parameter value (e.g., a history Rice parameter value) may be obtained or retrieved from a history counter (e.g., a history counter 520 shown in Figure 5) that maintains a weighted sum by accumulating values ​​determined for previously decoded transformation blocks or TUs.

[0186]

[0177] In some examples, the historical parameter value (e.g., the historical rice parameter value) may be determined from one or more previously decoded transformation blocks by applying a weight w to each cumulative value R using a historical counter in order to implement a weighted sum. In some cases, the weighted sum may be used to calculate a weighted average and / or exponentially weighted moving average, which may then be used as the historical parameter value (e.g., the historical rice parameter value) obtained in block 608. In some cases, the weight w may be determined at least in part on the spatial location of a first non-zero transformation coefficient in a given previously decoded transformation block. In some embodiments, the spatial location used to determine the weight w may correspond to one of the classifications C1 to C4 as shown in Figure 4. In some embodiments, the weight w may be a value between 0 and 1, and / or an integer value. In some examples, history parameter values ​​(e.g., history rice parameter values) may be calculated by updating a history counter until the end of the CTU or slice is reached, at which point the history counter (and history rice parameter values) may be initialized to 0 or some other starting value, and the history update process is repeated.

[0187]

[0178] In block 610, process 600 includes determining the parameters of the current sample (e.g., the Rice parameter). Process 600 can determine the parameter (e.g., the Rice parameter) at least in part on the historical parameter value (e.g., the historical Rice parameter value) obtained in block 608, as described above. In some examples, the historical parameter value (e.g., the historical Rice parameter value) may be used to swap each unavailable neighbor transformation coefficient when a template-based parameter derivation method (e.g., a template-based Rice parameter derivation method) is used. When the template-based neighbor transformation coefficient is only partially unavailable, the Rice parameter may be determined on the sum of the available neighbor transformation coefficients and N times the historical parameter value (e.g., the historical Rice parameter value), where N is equal to the number of unavailable neighbor transformation coefficients (which may be determined in block 604, for example).

[0188]

[0179] In block 612, process 600 includes decoding the current sample based on determined parameters of the current sample. For example, as described herein, process 600 may perform entropy decoding (for example, using the entropy decoding unit 80 described below with respect to Figure 9) to decode the current sample based on the parameters. In one example, decoding device 112 can decode the current sample at least in part by decoding syntax elements that represent the current sample based on determined parameters. In another example, decoding device 112 can decode the current sample at least in part by decoding the Golombrice code using the determined parameters.

[0189]

[0180] Figure 7 is a flowchart of an example of a process 700 for processing image and / or video data. In block 702, the process 700 may include obtaining a transform block. In some examples, the transform block may be a coded or decoded transform block. In some examples, the transform block may be a transform unit (TU). In some cases, the transform block may be the same as or similar to one or more of the transform blocks 320, 330, and 340 shown in Figure 3.

[0190]

[0181] In block 704, process 700 may include determining one or more non-zero decoded transformation coefficients based at least in part on the analysis of the transformation block. In some cases, the analysis of the transformation block may be performed by scanning the transformation block. For example, scanning the transformation block may be performed in reverse scanning order (for example, here the reverse scanning order starts from the lower right sample of the transformation block or TU). Scanning may continue until the location of at least the first non-zero decoded transformation coefficient is identified. If two or more non-zero decoded transformation coefficients are to be determined, scanning may continue until a predetermined amount of non-zero decoded transformation coefficients is determined. In some examples, when a non-zero decoded transformation coefficient is encountered during the scanning process, the non-zero value may be stored in a buffer or counter.

[0191]

[0182] In block 706, process 700 may include determining a history update value for a transformation block based on at least a portion of one or more non-zero decoded transformation coefficients. In one exemplary example, the history update value may be determined from a first non-zero transformation coefficient obtained when analyzing (e.g., scanning) the transformation block in block 704. In some cases, the history update value for a given transformation block may be equal to the value of a first non-zero decoded transformation coefficient obtained when scanning the given transformation block. In some examples, the history update value for a transformation block is determined based on all of the non-zero decoded transformation coefficients of the transformation block. In some cases, the history update value is determined at least in part by averaging all of the non-zero decoded transformation coefficients of the transformation block.

[0192]

[0183] In some examples, the history update value may be stored in a history counter (for example, the history counter 520 shown in Figure 5) which maintains a weighted sum by accumulating the history update values ​​determined for previously decoded transformation blocks.

[0193]

[0184] In block 708, process 700 may include updating existing historical parameter values ​​by combining the historical update values ​​of the transformation block with existing historical parameter values ​​(e.g., existing historical rice parameter values). In some embodiments, combining the historical update values ​​of the transformation block with existing historical parameter values ​​may include averaging the historical update values ​​of the transformation block with existing historical parameter values. In some cases, existing historical parameter values ​​are existing historical rice parameter values.

[0194]

[0185] In some embodiments, combining the historical update values ​​of a transformation block with existing historical parameter values ​​may include determining an exponentially weighted moving average between the historical update values ​​of the transformation block and the existing historical parameter values. In some cases, the process 700 may include assigning a first weight to the historical update values ​​of the transformation block and a second weight to the existing historical parameter values. In such cases, determining the exponentially weighted moving average may be at least partially based on the first and second weights.

[0195]

[0186] In some embodiments, the history update value of a transformation block is determined based on a first non-zero decoded transformation coefficient determined in the analysis of the transformation block. In some cases, the first non-zero decoded transformation coefficient is determined based on the run scan order of the transformation block in the reverse direction. In some cases, the history update value of a transformation block is determined at least in part by determining the binary code length of the first non-zero decoded transformation coefficient.

[0196]

[0187] In some embodiments, a transformation block and a previously analyzed transformation block are associated with a first slice. In some cases, existing historical parameter values ​​are iteratively updated based on sequential historical update values ​​determined for sequentially analyzed transformation blocks associated with the same slice. In some examples, process 700 includes initializing existing historical parameter values ​​to predetermined values. Initialization is performed before analyzing the first transformation block of the first slice and determining the historical update values ​​for the first transformation block.

[0197]

[0188] For example, existing historical parameter values ​​(e.g., existing historical Rice parameter values) may be at least partially based on a set of non-zero decoded transformation coefficients determined from a set of previously analyzed (e.g., previously scanned) transformation blocks. In some examples, existing historical parameter values ​​(e.g., existing historical Rice parameter values) may be determined from one or more previously decoded transformation blocks by applying weights w to each cumulative value R using a historical counter, for example, to implement or determine a weighted sum.

[0198]

[0189] In some cases, a weighted sum may be used to calculate a weighted average and / or an exponentially weighted moving average. In one exemplary example, the weight w may be set to equal 1 for each cumulative value. In some cases, the weight w may be determined at least in part on the spatial location of a first non-zero transformation coefficient in a given previously decoded transformation block. In some embodiments, the spatial location used to determine the weight w may correspond to one of the classifications C1 to C4 as shown in Figure 4. In some embodiments, the weight w may be a value between 0 and 1 and / or an integer value. In some examples, the history rice parameter value may be calculated by updating a history counter until the end of the CTU or slice is reached, at which time the history counter (and history rice parameter value) may be initialized to 0 or some other starting value, and the history update process is repeated.

[0199]

[0190] In block 710, process 700 includes decoding at least one sample of the transformation block based on existing historical parameter values ​​or updated existing historical parameter values. For example, as described herein, process 700 may perform entropy decoding (for example, using the entropy decoding unit 80 described below with respect to Figure 9) to decode the current sample based on existing historical parameter values ​​or updated existing historical parameter values. In one example, decoding device 112 can decode the current sample at least in part by decoding syntax elements that indicate at least one sample based on existing historical parameter values ​​or updated existing historical parameter values. In another example, decoding device 112 can decode the current sample at least in part by decoding the Golombrice code using existing historical parameter values ​​or updated existing historical parameter values.

[0200]

[0191] In some embodiments, the process of encoding video data may include obtaining a transformation block containing multiple samples. The process may include determining one or more parameters for the multiple samples, at least in part by analyzing the local neighborhood of the current sample among the multiple samples. The process may further include determining, at least in part based on the analysis of the local neighborhood, that the number of neighbor transformation coefficients for the current sample is less than a threshold amount. In some cases, the process may determine that the number of neighbor transformation coefficients is less than a threshold amount, at least in part based on identifying one or more unavailable neighbor transformation coefficients for the current sample. In such cases, one or more unavailable neighbor transformation coefficients may be associated with a location outside the transformation block. In some examples, the process may include obtaining the location of the current sample within the transformation block, comparing the location of the current sample to the width of the transformation block, the height of the transformation block, or the width and height of the transformation block, and identifying one or more unavailable neighbor transformation coefficients, at least in part based on the comparison. In some cases, in order to determine that the number of neighboring transformation coefficients is less than a threshold amount, the process may include determining that the horizontal component of the current sample location is within a first distance of the width of the transformation block, and determining that the vertical component of the current sample location is within a second distance of the height of the transformation block.

[0201]

[0192] The process of encoding video data may further include obtaining historical parameter values ​​determined from one or more previously encoded transformation blocks. The process of encoding video data may further include determining the parameters of the current sample based at least in part on the historical parameter values. In some examples, one or more parameters for multiple samples include one or more RICE parameters, the historical parameter values ​​are historical RICE parameter values, and the parameters determined for the current sample are RICE parameters for the current sample.

[0202]

[0193] In some examples, the process of encoding video data may include determining the parameters of the current sample based on a first integer multiple of the historical parameter value, at least in part on the determination that the number of neighbor transformation coefficients is 0. In some embodiments, the process may determine the parameters of the current sample at least in part on providing a first integer multiple of the historical parameter value as input to a lookup table that maps between the input and the parameter. In some cases, the first integer multiple and the threshold amount are the same value. In some embodiments, the process may include determining the parameters of the current sample based on a second integer multiple of the historical parameter value and the sum of the neighbor transformation coefficients, at least in part on the determination that the number of neighbor transformation coefficients is greater than 0. In such embodiments, the second integer multiple is less than the first integer multiple. Furthermore, in such embodiments, the process may determine the parameters of the current sample at least in part on providing the sum of the neighbor transformation coefficients and a second integer multiple of the summed historical parameter value as input to a lookup table that maps between the input and the parameter.

[0203]

[0194] In some cases, multiple samples are associated with a transformation block sample type. For example, a transformation block sample type can include lumens or chromens. In some cases, the transformation block sample type is the same as the sample type associated with one or more previously decoded transformation blocks, from which the history parameter values ​​are determined.

[0204]

[0195] In some embodiments, the history parameter value is determined at least in part on a first non-zero decoded transformation coefficient obtained from each of one or more previously coded transformation blocks. In some examples, the process may include determining the binary code length of each first non-zero decoded transformation coefficient obtained from each of one or more previously coded transformation blocks. In some cases, the history parameter value is determined as an exponentially weighted moving average of the binary code lengths determined for each of the first non-zero coded transformation coefficients of one or more previously coded transformation blocks.

[0205]

[0196] The process may further include generating a bitstream based on the determined parameters of the current sample. For example, the coding device 104 (for example, using the entropy coding unit 56) may generate a bitstream based on the determined parameters (for example, the Rice parameters).

[0206]

[0197] In some examples, a process for encoding video data is provided. The process may include obtaining a transformation block. The process may further include determining one or more non-zero coded transformation coefficients based at least in part on an analysis of the transformation block. The process may also include determining a historical update value for the transformation block based at least in part on one or more non-zero coded transformation coefficients.

[0207]

[0198] The process of encoding video data may include determining the historical update value of a transform block based on a first non-zero coded transform coefficient determined in the analysis of the transform block. In some examples, the process may include determining the first non-zero coded transform coefficient based on the run scan order of the transform block in the reverse direction. In some cases, the process may include determining the historical update value of a transform block by at least partly determining the binary code length of the first non-zero coded transform coefficient. In some cases, the process may include determining the historical update value of a transform block based on all of the non-zero coded transform coefficients of the transform block. In some examples, the process may include determining the historical update value by at least partly averaging all of the non-zero coded transform coefficients of the transform block.

[0208]

[0199] The process of encoding video data may further include updating existing historical parameter values ​​by at least part by combining (for example, averaging or otherwise combining) the historical update values ​​of the transformation blocks with existing historical parameter values. In some embodiments, the existing historical parameter values ​​are existing historical Rice parameter values. The existing historical parameter values ​​are at least partly based on a set of non-zero coded transformation coefficients determined from a set of previously analyzed transformation blocks. In some embodiments, in order to update the existing historical parameter values, the process may include determining an exponentially weighted moving average between the historical update values ​​of the transformation blocks and the existing historical parameter values. For example, in some cases, the process may include assigning a first weight to the historical update values ​​of the transformation blocks and a second weight to the existing historical parameter values, and determining an exponentially weighted moving average based at least partly on the first and second weights.

[0209]

[0200] In some embodiments, a transformation block and a previously analyzed transformation block are associated with a first slice. The process may further include iteratively updating existing historical parameter values ​​based on sequential historical update values ​​determined for sequentially analyzed transformation blocks associated with the same slice. In some cases, the process may include initializing existing historical parameter values ​​to predetermined values. In some examples, the process may perform initialization before analyzing the first transformation block of the first slice and determining the historical update values ​​for the first transformation block.

[0210]

[0201] The process of encoding video data may further include generating a bitstream based on existing historical parameter values ​​or updated existing historical parameter values. For example, encoding device 104 (for example, using entropy encoding unit 56) may generate a bitstream based on determined parameters (for example, Rice parameters).

[0211]

[0202] In some implementations, the processes (or methods) described herein may be carried out by a computing device or apparatus, such as the system 100 shown in Figure 1. For example, the process may be carried out by an encoding device 104 shown in Figures 1 and 8, by another video source-side device or video transmission device, by a decoding device 112 shown in Figures 1 and 9, and / or by another client-side device, such as a player device, display, or any other client-side device. In some cases, the computing device or apparatus may include a processor, microprocessor, microcomputer, or other components of a device configured to perform the steps of the process described herein. In some examples, the computing device or apparatus may include a camera configured to capture video data (e.g., a video sequence) containing video frames. In some examples, the camera or other capture device that captures the video data is separate from the computing device, in which case the computing device receives or acquires the captured video data. The computing device may further include a network interface configured to communicate the video data. The network interface may be configured to communicate Internet Protocol (IP) based data or other types of data. In some examples, a computing device or apparatus may include a display for showing output video content, such as a sample picture of a video bitstream.

[0212]

[0203] A process may be described in relation to a logical flowchart, and its operation represents a sequence of operations that can be performed in hardware, computer instructions, or a combination thereof. In the context of computer instructions, operation represents a computer executable instruction stored in one or more computer-readable storage media that, when executed by one or more processors, performs the described operation. Generally, computer executable instructions include routines, programs, objects, components, data structures, etc., that perform a particular function or implement a particular data type. The order in which operations are described is not to be interpreted as limiting, and any number of described operations may be combined in any order and / or in parallel to implement a process.

[0213]

[0204] Furthermore, the process may be carried out under the control of one or more computer systems consisting of executable instructions, and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) that is executed collectively on one or more processors, by hardware or in combination thereof. As described above, the code may be stored in a computer-readable or machine-readable storage medium in the form of a computer program having multiple instructions that can be executed by one or more processors. The computer-readable or machine-readable storage medium may be non-temporary.

[0214]

[0205] The coding techniques described herein may be implemented in exemplary video coding and decoding systems (e.g., System 100). In some examples, the system includes a source device that provides coded video data to be later decoded by a destination device. In particular, the source device provides the video data to the destination device via a computer-readable medium. The source device and destination device may comprise any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets such as so-called "smart" phones, so-called "smart" pads, televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, and the like. In some cases, the source device and destination device may be equipped for wireless communication.

[0215]

[0206] The destination device may receive encoded video data to be decoded via a computer-readable medium. The computer-readable medium may comprise any type of medium or device capable of moving encoded video data from the source device to the destination device. For example, the computer-readable medium may comprise a communication medium that enables the source device to transmit encoded video data directly to the destination device in real time. The encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device. The communication medium may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network, a wide area network, or a global network such as the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful in enabling communication from the source device to the destination device.

[0216]

[0207] In some examples, encoded data may be output to a storage device through an output interface. Similarly, encoded data may be accessed from a storage device through an input interface. The storage device may include any of a variety of distributed or locally accessed data storage media, such as a hard drive, Blu-ray® disc, DVD, CD-ROM, flash memory, volatile or non-volatile memory, or any other suitable digital storage medium for storing encoded video data. In further examples, the storage device may correspond to a file server or another intermediate storage device capable of storing encoded video generated by the source device. The destination device may access the stored video data from the storage device via streaming or download. The file server may be any type of server capable of storing encoded video data and transmitting that encoded video data to the destination device. Exemplary file servers include a web server (for example, for a website), an FTP server, a network-attached storage (NAS) device, or a local disk drive. The destination device may access the encoded video data through any standard data connection, including an internet connection. This may include wireless channels (e.g., Wi-Fi connection), wired connections (e.g., DSL, cable modem, etc.), or a combination of both, which are suitable for accessing encoded video data stored on a file server. Transmission of encoded video data from the storage device may be streaming transmission, download transmission, or a combination thereof.

[0217]

[0208] The techniques of the present disclosure are not necessarily limited to wireless applications or configurations. The techniques may be applied to video coding supporting any of a variety of multimedia applications, such as over-the-air television broadcasting, cable television transmission, satellite television transmission, internet streaming video transmission such as Dynamic Adaptive Streaming over HTTP (DASH), digital video encoded on a data storage medium, decoding of digital video stored on a data storage medium, or other applications. In some examples, the system may be configured to support one-way or two-way video transmission to support applications such as video streaming, video playback, video broadcasting, and / or video telephony.

[0218]

[0209] In one example, the source device includes a video source, a video encoder, and an output interface. The destination device may include an input interface, a video decoder, and a display device. The video encoder of the source device may be configured to apply the techniques disclosed herein. In other examples, the source device and destination device may include other components or arrangements. For example, the source device may receive video data from an external video source, such as an external camera. Similarly, the destination device may interface with an external display device rather than including an integrated display device.

[0219]

[0210] The exemplary system described above is merely an example. Techniques for processing video data in parallel can be implemented by any digital video coding and / or decoding device. Generally, the techniques of the Disclosure are implemented by video coding devices, but the techniques can also be implemented by video encoders / decoders, commonly referred to as “codecs”. Furthermore, the techniques of the Disclosure can also be implemented by video preprocessors. Source devices and destination devices are merely examples of coding devices, such that the source device generates coded video data to send to the destination device. In some examples, the source devices and destination devices may operate substantially symmetrically, such that each device includes a video coding component and a video decoding component. Thus, the exemplary system can support one-way or two-way video transmission between video devices for, for example, video streaming, video playback, video broadcasting, or video telephony.

[0220]

[0211] The video source may include a video capture device such as a video camera, a video archive containing previously captured video, and / or a video feed interface for receiving video from a video content provider. As a further alternative, the video source may generate computer graphics-based data as source video, or a combination of live video, archived video, and computer-generated video. In some cases, when the video source is a video camera, the source device and the destination device may form a so-called cameraphone or videophone. However, as stated above, the techniques described herein may generally be applicable to video coding and may be applicable to wireless and / or wired applications. In each case, the captured video, pre-captured video, or computer-generated video may be encoded by a video encoder. The encoded video information may then be output onto a computer-readable medium by an output interface.

[0221]

[0212] As stated above, computer-readable media may include temporary media such as wireless broadcast or wired network transmission, or storage media (i.e., non-temporary storage media) such as hard disks, flash drives, compact discs, digital video discs, Blu-ray discs, or other computer-readable media. In some examples, a network server (not shown) may receive encoded video data from a source device, for example, via a network transmission, and provide that encoded video data to a destination device. Similarly, a computing device in a media manufacturing facility, such as a disc stamping machine, may receive encoded video data from a source device and produce a disc containing that encoded video data. Thus, it can be understood that computer-readable media may include one or more computer-readable media in various forms in various examples.

[0222]

[0213] The input interface of the destination device receives information from a computer-readable medium. The information on the computer-readable medium may include syntax information, which includes syntax elements that describe the characteristics and / or processing of blocks and other coded units, such as picture groups (GOPs), defined by the video encoder and used by the video decoder. The display device displays the decoded video data to the user and may comprise any of various display devices, such as a cathode ray tube (CRT), liquid crystal display (LCD), plasma display, organic light-emitting diode (OLED) display, or another type of display device. Various embodiments of this application have been described.

[0223]

[0214] Specific details of the encoding device 104 and the decoding device 112 are shown in Figures 8 and 9, respectively. Figure 8 is a block diagram showing an exemplary encoding device 104 that may implement one or more of the techniques described herein. The encoding device 104 may, for example, generate syntax structures described herein (e.g., VPS, SPS, PPS, or syntax structures of other syntax elements). The encoding device 104 may perform intra-predictive coding and inter-predictive coding of video blocks in a video slice. As previously described, intra-coding relies at least in part on spatial prediction to reduce or eliminate spatial redundancy in a given video frame or picture. Inter-coding relies at least in part on temporal prediction to reduce or eliminate temporal redundancy in adjacent frames or surrounding frames of a video sequence. Intra-mode (I-mode) may refer to any of several spatial-based compression modes. Inter-mode, such as unidirectional prediction (P-mode) or bidirectional prediction (B-mode), may refer to any of several temporal-based compression modes.

[0224]

[0215] The encoding device 104 includes a partitioning unit 35, a prediction processing unit 41, a filter unit 63, a picture memory 64, an adder 50, a transformation processing unit 52, a quantization unit 54, and an entropy encoding unit 56. The prediction processing unit 41 includes a motion estimation unit 42, a motion compensation unit 44, and an intra-prediction processing unit 46. For video block reconstruction, the encoding device 104 also includes an inverse quantization unit 58, an inverse transformation processing unit 60, and an adder 62. The filter unit 63 is to represent one or more loop filters, such as a deblocking filter, an adaptive loop filter (ALF), and a sample-adaptive offset (SAO) filter. In Figure 8, the filter unit 63 is shown as an in-loop filter, but in other configurations, the filter unit 63 may be implemented as a post-loop filter. The post-processing device 57 may perform additional processing on the encoded video data generated by the encoding device 104. In some cases, the techniques of this disclosure may be implemented by the encoding device 104. However, in other cases, one or more of the techniques of this disclosure may be implemented by the post-processing device 57.

[0225]

[0216] As shown in Figure 8, the encoding device 104 receives video data, and the partitioning unit 35 partitions the data into video blocks. Partitioning may also include partitioning into slices, slice segments, tiles, or other larger units, as well as video block partitioning, according to, for example, a quad-tree structure of LCUs and CUs. The encoding device 104 generally represents the components that encode the video blocks within the video slice to be encoded. A slice may be divided into multiple video blocks (and possibly into sets of video blocks called tiles). The prediction processing unit 41 may select one of several possible coding modes for the current video block, such as one of several intra-predictive coding modes or one of several inter-predictive coding modes, based on error results (e.g., coding rate and distortion level). The prediction processing unit 41 may provide the resulting intra-coded or inter-coded block to the adder 50 to generate residual block data and to the adder 62 to reconstruct the encoded block for use as a reference picture.

[0226]

[0217] The intra-prediction processing unit 46 within the prediction processing unit 41 may perform intra-prediction coding of the current video block for one or more adjacent blocks in the same frame or slice as the current block to be coded, in order to perform spatial compression. The motion estimation unit 42 and motion compensation unit 44 within the prediction processing unit 41 perform inter-prediction coding of the current video block for one or more predicted blocks in one or more reference pictures, in order to perform temporal compression.

[0227]

[0218] The motion estimation unit 42 may be configured to determine an interpretation mode for a video slice according to a predetermined pattern for the video sequence. The predetermined pattern may designate the video slices in the sequence as P slices, B slices, or GPB slices. The motion estimation unit 42 and the motion compensation unit 44 may be highly integrated but are shown separately for conceptual purposes. The motion estimation performed by the motion estimation unit 42 is a process that generates motion vectors that estimate the motion of a video block. The motion vectors may, for example, show the displacement of the prediction unit (PU) of the current video frame or video block in a picture relative to the prediction block in a reference picture.

[0228]

[0219] A prediction block is a block that is found to be a perfect match for the PU of the video block to be coded, with respect to the pixel difference which can be determined by the absolute difference sum (SAD), squared difference sum (SSD), or other difference metric. In some examples, the encoding device 104 may calculate values ​​for sub-integer pixel positions of a reference picture stored in the picture memory 64. For example, the encoding device 104 may interpolate values ​​for quarter-pixel, eighth-pixel, or other fractional pixel positions of the reference picture. Thus, the motion estimation unit 42 may perform motion search on full-pixel and fractional-pixel positions and output motion vectors with fractional-pixel precision.

[0229]

[0220] The motion estimation unit 42 calculates a motion vector for the PU of a video block in an intercoded slice by comparing the position of the PU with the position of a predicted block in a reference picture. The reference picture may be selected from a first reference picture list (list 0) or a second reference picture list (list 1), each of which identifies one or more reference pictures stored in the picture memory 64. The motion estimation unit 42 sends the calculated motion vector to the entropy coding unit 56 and the motion compensation unit 44.

[0230]

[0221] Motion compensation performed by the motion compensation unit 44 may involve fetching or generating predicted blocks based on motion vectors determined by motion estimation, and possibly performing interpolation to sub-pixel precision. Upon receiving motion vectors for the current video block's PU, the motion compensation unit 44 may identify the location of the predicted block that the motion vectors point to in the reference picture list. The encoding device 104 forms a residual video block by subtracting the pixel values ​​of the predicted block from the pixel values ​​of the current video block being coded to form a pixel difference value. The pixel difference value forms the residual data for the block and may include both lumern difference and chromern difference components. The adder 50 represents one or more components that perform this subtraction operation. The motion compensation unit 44 may also generate syntax elements related to the video block and video slice for use by the decoding device 112 when decoding the video block of the video slice.

[0231]

[0222] The intra-prediction processing unit 46 may intra-predict the current block as an alternative to the inter-prediction performed by the motion estimation unit 42 and the motion compensation unit 44, as described above. In particular, the intra-prediction processing unit 46 may determine which intra-prediction mode should be used to encode the current block. In some examples, the intra-prediction processing unit 46 may encode the current block using various intra-prediction modes, for example, during separate encoding passes, and the intra-prediction processing unit 46 may select an appropriate intra-prediction mode from the tested modes. For example, the intra-prediction processing unit 46 may use rate-distortion analysis to calculate rate-distortion values ​​for various tested intra-prediction modes and select the intra-prediction mode with the best rate-distortion characteristics among the tested modes. Rate-distortion analysis generally determines the amount of distortion (or error) between the encoded block and the original unencoded block encoded to produce the encoded block, as well as the bit rate (i.e., number of bits) used to produce the encoded block. The intra-prediction processing unit 46 can calculate a ratio from the strain and rate for various coded blocks in order to determine which intra-prediction mode exhibits the best rate strain value for a block.

[0232]

[0223] In any case, after selecting an intra-prediction mode for a block, the intra-prediction processing unit 46 may provide the entropy coding unit 56 with information indicating the selected intra-prediction mode for the block. The entropy coding unit 56 may encode the information indicating the selected intra-prediction mode. The coding device 104 may include in the transmitted bitstream configuration data definitions of coding contexts for various blocks, as well as instructions for the most probable intra-prediction mode, intra-prediction mode index table, and modified intra-prediction mode index table to be used for each context. The bitstream configuration data may include multiple intra-prediction mode index tables and multiple modified intra-prediction mode index tables (also called codeword mapping tables).

[0233]

[0224] After the prediction processing unit 41 generates a prediction block for the current video block via either interpretation or intraprediction, the encoding device 104 forms a residual video block by subtracting the prediction block from the current video block. The residual video data in the residual block is contained in one or more TUs and can be applied to the transformation processing unit 52. The transformation processing unit 52 transforms the residual video data into residual transformation coefficients using a transformation such as a discrete cosine transform (DCT) or a conceptually similar transformation. The transformation processing unit 52 may transform the residual video data from the pixel domain to a transformation domain such as the frequency domain.

[0234]

[0225] The conversion processing unit 52 may send the obtained conversion coefficients to the quantization unit 54. The quantization unit 54 quantizes the conversion coefficients to further reduce the bit rate. The quantization process may reduce the bit depth associated with some or all of the coefficients. The degree of quantization can be modified by adjusting the quantization parameters. In some examples, the quantization unit 54 may then perform a scan of the matrix containing the quantized conversion coefficients. Alternatively, the entropy coding unit 56 may perform the scan.

[0235]

[0226] After quantization, the entropy coding unit 56 entropy codes the quantization conversion coefficients. For example, the entropy coding unit 56 may perform context-adaptive variable-length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval piece entropy (PIPE) coding, or another entropy coding technique. After entropy coding by the entropy coding unit 56, the coded bitstream may be sent to the decoding device 112, or the decoding device 112 may archive it for later transmission or retrieval. The entropy coding unit 56 may also entropy code the motion vector and other syntax elements for the current video slice being coded.

[0236]

[0227] The inverse quantization unit 58 and the inverse transformation processing unit 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual block in the pixel region for later use as a reference block of the reference picture. The motion compensation unit 44 may calculate a reference block by adding the residual block to one of the prediction blocks of the reference pictures in the reference picture list. The motion compensation unit 44 may also apply one or more interpolation filters to the reconstructed residual block to calculate sub-integer pixel values ​​for use in motion estimation. The adder 62 adds the reconstructed residual block to the motion-compensated prediction block generated by the motion compensation unit 44 to generate a reference block for storage in the picture memory 64. The reference block may be used as a reference block by the motion estimation unit 42 and the motion compensation unit 44 to interpret blocks in subsequent video frames or pictures.

[0237]

[0228] Thus, the encoding device 104 in Figure 8 represents an example of a video encoder configured to perform the techniques described herein. For example, the encoding device 104 may perform any of the techniques described herein, including the processes described herein. In some cases, some of the techniques of this disclosure may also be implemented by a post-processing device 57.

[0238]

[0229] Figure 9 is a block diagram of an exemplary decoding device 112. The decoding device 112 includes an entropy decoding unit 80, a prediction processing unit 81, an inverse quantization unit 86, an inverse transformation processing unit 88, an adder 90, a filter unit 91, and a picture memory 92. The prediction processing unit 81 includes a motion compensation unit 82 and an intra-prediction processing unit 84. In some examples, the decoding device 112 may perform a decoding path that is generally the reverse of the encoding path described with respect to the encoding device 104 from Figure 8.

[0239]

[0230] During the decoding process, the decoding device 112 receives an encoded video bitstream sent by the encoding device 104, which represents the video blocks of the encoded video slice and the associated syntax elements. In some embodiments, the decoding device 112 may receive the encoded video bitstream from the encoding device 104. In some embodiments, the decoding device 112 may receive the encoded video bitstream from a network entity 79, such as a server, a media-aware network element (MANE), a video editor / splicer, or other such device configured to implement one or more of the techniques described above. The network entity 79 may or may not include the encoding device 104. Some of the techniques described herein may be implemented by the network entity 79 before it sends the encoded video bitstream to the decoding device 112. In some video decoding systems, the network entity 79 and the decoding device 112 may be parts of a separate device, but in other cases, the functions described with respect to the network entity 79 may be implemented by the same device comprising the decoding device 112.

[0240]

[0231] The entropy decoding unit 80 of the decoding device 112 entropy-decodes the bitstream to generate quantization coefficients, motion vectors, and other syntax elements. The entropy decoding unit 80 transfers the motion vectors and other syntax elements to the prediction processing unit 81. The decoding device 112 may receive syntax elements at the video slice level and / or video block level. The entropy decoding unit 80 may process and parse both fixed-length and variable-length syntax elements in multiple parameter sets, such as VPS, SPS, and PPS.

[0241]

[0232] When a video slice is coded as an intra-coded (I) slice, the intra-prediction processing unit 84 of the prediction processing unit 81 may generate prediction data for the video block of the current video slice based on the signaled intra-prediction mode and data from blocks decoded before the current frame or picture. When a video frame is coded as an intercoded (i.e., B, P, or GPB) slice, the motion compensation unit 82 of the prediction processing unit 81 generates prediction blocks for the video block of the current video slice based on motion vectors and other syntax elements received from the entropy decoding unit 80. Prediction blocks may be generated from one of the reference pictures in the reference picture list. The decoding device 112 may construct a reference frame list, i.e., list 0 and list 1, using default construction techniques based on the reference pictures stored in the picture memory 92.

[0242]

[0233] The motion compensation unit 82 determines prediction information for the video block of the current video slice by parsing motion vectors and other syntax elements, and uses that prediction information to generate a prediction block for the current video block being decoded. For example, the motion compensation unit 82 may use one or more syntax elements in the parameter set to determine the prediction mode used to code the video block of the video slice (e.g., intra or interpredict), the interpredict slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more reference picture lists for the slice, motion vectors for each intercoded video block of the slice, the interpredict status for each intercoded video block of the slice, and other information for decoding the video block in the current video slice.

[0243]

[0234] The motion compensation unit 82 may also perform interpolation based on an interpolation filter. The motion compensation unit 82 may use the interpolation filter used by the encoding device 104 during the encoding of the video block to calculate interpolation values ​​for the sub-integer pixels of the reference block. In this case, the motion compensation unit 82 may determine the interpolation filter used by the encoding device 104 from the received syntax elements and use that interpolation filter to generate the predicted block.

[0244]

[0235] The inverse quantization unit 86 inversely quantizes, i.e., dequantizes, the quantization transformation coefficients provided in the bitstream and decoded by the entropy decoding unit 80. The inverse quantization process may include the use of quantization parameters calculated by the encoding device 104 for each video block in the video slice to determine the degree of quantization and, similarly, the degree of inverse quantization to be applied. The inverse transformation processing unit 88 applies an inverse transformation (e.g., an inverse DCT or other preferred inverse transformation), an inverse integer transformation, or a conceptually similar inverse transformation process to the transformation coefficients to generate residual blocks in the pixel region.

[0245]

[0236] After the motion compensation unit 82 generates a predicted block for the current video block based on the motion vector and other syntax elements, the decoding device 112 forms a decoded video block by adding the residual block from the inverse processing unit 88 with the corresponding predicted block generated by the motion compensation unit 82. The adder 90 represents one or more components that perform this addition operation. Loop filters (either in or after the coding loop) may also be used, if desired, to smooth pixel transitions or otherwise improve video quality. The filter unit 91 shall represent one or more loop filters, such as a deblocking filter, an adaptive loop filter (ALF), and a sample-adaptive offset (SAO) filter. In Figure 9, the filter unit 91 is shown as an in-loop filter, but in other configurations, the filter unit 91 may be implemented as a post-loop filter. The decoded video block in a given frame or picture is then stored in the picture memory 92, which stores a reference picture to be used for subsequent motion compensation. The picture memory 92 also stores the decoded video for later presentation on a display device, such as the video destination device 122 shown in Figure 1.

[0246]

[0237] Thus, the decoding device 112 in Figure 9 represents an example of a video decoder configured to perform the techniques described herein. For example, the decoding device 112 may perform any of the techniques described herein, including the processes described herein.

[0247]

[0238] As used herein, the term “computer-readable medium” includes, but is not limited to, portable or non-portable storage devices, optical storage devices, and a variety of other media capable of storing, containing, or carrying (one or more) instructions and / or data. Computer-readable medium may include non-temporary media on which data can be stored, and it does not include carrier waves and / or temporary electronic signals that propagate wirelessly or through wired connections. Examples of non-temporary media include, but is not limited to, magnetic disks or magnetic tapes, optical storage media such as compact discs (CDs) or digital multipurpose discs (DVDs), flash memory, memory, or memory devices. Computer-readable medium may store code and / or machine-executable instructions on which procedures, functions, subprograms, programs, routines, subroutines, modules, software packages, classes, or any combination of instructions, data structures, or program statements may be stored. Code segments may be coupled to other code segments or hardware circuits by passing and / or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc., may be passed, forwarded, or transmitted via any preferred means, including memory sharing, message passing, token passing, network transmission, etc.

[0248]

[0239] In some embodiments, computer-readable storage devices, media, and memory may include cable signals or wireless signals, such as bitstreams. However, as stated, non-transient computer-readable storage media explicitly exclude media such as energy, carrier signals, electromagnetic waves, and the signals themselves.

[0249]

[0240] Specific details are provided in the above description in order to provide a complete understanding of the embodiments and examples provided herein. However, those skilled in the art will understand that embodiments may be practiced without these specific details. For the sake of clarity of description, in some cases the art may be presented as including individual functional blocks, which include devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software. Additional components other than those shown in the figures and / or described herein may be used. For example, circuits, systems, networks, processes, and other components may be shown as components in the form of block diagrams in order not to obscure the embodiments with unnecessary details. In other cases, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary details in order to avoid obscuring the embodiments.

[0250]

[0241] Individual embodiments may be described above as processes or methods depicted as flowcharts, flow diagrams, data flow diagrams, structural diagrams, or block diagrams. While flowcharts may describe operations as sequential processes, many operations may be performed in parallel or simultaneously. Furthermore, the order of operations may be rearranged. When its operations are completed, the process terminates, but it may have additional steps not shown in the diagram. A process may correspond to a method, function, procedure, subroutine, subprogram, etc. When a process corresponds to a function, its termination may correspond to the function returning to a calling function or main function.

[0251]

[0242] The processes and methods described above may be implemented using computer-executable instructions that are stored or otherwise available from a computer-readable medium. Such instructions may include instructions and data that cause, for example, a general-purpose computer, a dedicated computer, or a processing device to perform a certain function or a group of functions, or otherwise configure it to perform them. The portion of computer resources used may be accessible over a network. Computer-executable instructions may include, for example, binaries, intermediate format instructions such as assembly language, firmware, source code, etc. Examples of computer-readable media that may be used to store instructions, information used, and / or information created during the methods described above include magnetic or optical disks, flash memory, USB devices with non-volatile memory, networked storage devices, etc.

[0252]

[0243] Devices implementing the processes and methods described herein may include hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof, and may take any of a variety of form factors. When implemented in software, firmware, middleware, or microcode, program code or code segments (e.g., computer program products) for performing the required tasks may be stored in a computer-readable or machine-readable medium. The processor may perform the required tasks. Typical examples of form factors include laptops, smartphones, mobile phones, tablet devices or other small form factor personal computers, personal digital assistants, rack-mount devices, and standalone devices. The functions described herein may also be embodied in peripherals or add-in cards. Such functions may also, as a further example, be implemented on a circuit board between different chips or different processes running in a single device.

[0253]

[0244] Instructions, a medium for transmitting such instructions, computing resources for executing them, and other structures for supporting such computing resources are exemplary means for providing the functionality described in this disclosure.

[0254]

[0245] While the above description has described aspects of this application with reference to specific embodiments thereof, those skilled in the art will recognize that this application is not limited thereto. Although exemplary embodiments of this application are described in detail herein, it should be understood that, except as limited by the prior art, the inventive concept may be embodied and employed in various ways, and the appended claims should be interpreted to include such variations. The various features and aspects of the applications described above may be used individually or together. Furthermore, the embodiments may be used in any number of environments and applications other than those described herein without departing from the broader spirit and scope of this specification. Accordingly, this specification and the drawings should be considered illustrative and not restrictive. For illustrative purposes, the methods have been described in a specific order. It should be understood that in alternative embodiments, the methods may be carried out in an order different from that described.

[0255]

[0246] Those skilled in the art will understand that the symbols or terms used herein for less than ("<") and greater than (">") may be replaced, without departing from the scope of this specification, with the symbols for less than or equal to ("≦") and greater than or equal to ("≧").

[0256]

[0247] When a component is described as being "configured to" perform a certain operation, such configuration may be achieved, for example, by designing an electronic circuit or other hardware to perform the operation, by programming a programmable electronic circuit (e.g., a microprocessor or other suitable electronic circuit) to perform the operation, or by any combination thereof.

[0257]

[0248] The phrase “combined” means any component that is physically connected to another component, either directly or indirectly, and / or any component that communicates with another component, either directly or indirectly (for example, connected to another component via a wired or wireless connection and / or other preferred communication interface).

[0258]

[0249] Claim language or other language that states “at least one of” a set and / or “one or more” of a set indicates that one member of a set or multiple members of a set (in any combination) satisfy the claim. For example, claim language that states “at least one of A and B” means A, B, or A and B. In another example, claim language that states “at least one of A, B, and C” means A, B, C, or A and B, or A and C, or B and C, or A and B and C. The language “at least one of” a set and / or “one or more” of a set does not limit the set to the items listed in the set. For example, claim language that states “at least one of A and B” may mean A, B, or A and B, and may also include items not listed in the set A and B.

[0259]

[0250] Various exemplary logic blocks, modules, circuits, and algorithmic steps described in relation to the embodiments disclosed herein may be implemented as electronic hardware, computer software, firmware, or a combination thereof. To clearly demonstrate this hardware- and software compatibility, various exemplary components, blocks, modules, circuits, and steps have generally been described above in terms of their function. Whether such function is implemented as hardware or as software depends on the specific application and the design constraints imposed on the overall system. A person skilled in the art may implement the described function in various ways for each specific application, but such a decision on implementation should not be construed as resulting in a departure from the scope of this application.

[0260]

[0251] The techniques described herein may also be implemented in electronic hardware, computer software, firmware, or any combination thereof. Such techniques may be implemented in any of a variety of devices, such as general-purpose computers, wireless communication device handsets, or integrated circuit devices having multiple applications, including applications in wireless communication device handsets and other devices. Features described as modules or components may be implemented together in an integrated logic device, or separately as individual but interoperable logic devices. When implemented in software, the techniques may be realized by a computer-readable data storage medium having program code that, when executed, at least partially performs one or more of the methods described above. The computer-readable data storage medium may form part of a computer program product, which may include packaging materials. The computer-readable medium may comprise memory or data storage media such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), electrically erasable programmable read-only memory (EEPROM®), FLASH® memory, magnetic or optical data storage media, etc. This technique may, as an addition or alternative, be at least partially implemented by a computer-readable communication medium, such as a propagating signal or radio wave, that carries or communicates program code in the form of instructions or data structures and can be accessed, read, and / or executed by a computer.

[0261]

[0252] The program code may be executed by a processor which may include one or more processors, such as one or more digital signal processors (DSPs), general-purpose microprocessors, application-specific integrated circuits (ASICs), field-programmable logic arrays (FPGAs), or other equivalent integrated circuits or discrete logic circuits. Such a processor may be configured to implement any of the techniques described herein. A general-purpose processor may be a microprocessor, but alternatively, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors working in conjunction with a DSP core, or any other such configuration. Thus, the term “processor” as used herein may refer to any of the above structures, any combination thereof, or any other structure or device suitable for implementing the techniques described herein. In addition, in some embodiments, the functions described herein may be provided in dedicated software or hardware modules configured for encoding and decoding, or incorporated into a combined video encoder-decoder (CODEC).

[0262]

[0253] Exemplary examples of this disclosure include:

[0263]

[0254] Embodiment 1: A method for decoding video data, the method comprising: obtaining a transformation block; determining one or more parameters for a plurality of samples by at least partly analyzing the local neighborhood of the current sample among a plurality of samples in which the transformation block includes a plurality of samples; determining that the number of neighbor transformation coefficients of the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood; obtaining historical parameter values ​​determined from one or more previously decoded transformation blocks; determining the parameters of the current sample, at least partly based on the historical parameter values; and decoding the current sample based on the determined parameters of the current sample.

[0264]

[0255] Embodiment 2: The method of Embodiment 1, further comprising determining the parameters of the current sample based on a first integer multiple of the historical parameter value, at least in part on the determination that the number of neighboring conversion coefficients is 0.

[0265]

[0256] Embodiment 3: The method of Embodiment 2, wherein determining the parameters of the current sample is provided as input to a lookup table that maps between inputs and parameters, which is a first integer multiple of the historical parameter values.

[0266]

[0257] Embodiment 4: The method of Embodiment 2 or 3, wherein the first integer multiple and the threshold amount are the same value.

[0267]

[0258] Embodiment 5: Any method of Embodiments 2 to 4, further comprising determining the parameters of the current sample based on a second integer multiple of the historical parameter value and the sum of the neighboring transformation coefficients, at least in part on the determination that the number of neighboring transformation coefficients is greater than 0.

[0268] Aspect 6: The method of Aspect 5, wherein determining the parameters of the current sample comprises providing, as an input to a look-up table that maps between the input and the parameters, the sum of the neighboring transformation coefficients and a second integer multiple of the summed historical parameter values.

[0269] Aspect 7: The method of Aspect 6, wherein the second integer multiple is smaller than the first integer multiple.

[0270] Aspect 8: The method according to any one of Aspects 1 to 7, wherein determining that the number of neighboring transformation coefficients is smaller than a threshold amount is at least partially based on identifying one or more unavailable neighboring transformation coefficients for the current sample.

[0271] Aspect 9: The method of Aspect 8, further comprising obtaining the location of the current sample within the transformation block, comparing the location of the current sample with one or more of the width and height of the transformation block, and identifying one or more unavailable neighboring transformation coefficients based at least in part on the comparison.

[0272] Aspect 10: The method of Aspect 9, wherein one or more unavailable neighboring transformation coefficients are associated with locations outside the transformation block.

[0273] Aspect 11: The method according to either of Aspects 9 or 10, wherein determining that the number of neighboring transformation coefficients is smaller than a threshold amount comprises determining that a horizontal component of the location of the current sample is within a first distance of the width of the transformation block and determining that a vertical component of the location of the current sample is within a second distance of the height of the transformation block.

[0274] Aspect 12: The method according to any one of Aspects 1 to 11, wherein a plurality of samples are associated with a transformation block sample type, and the transformation block sample type includes a luma sample or a chroma sample.

[0275]

[0266] Embodiment 13: The method of Embodiment 12, wherein the transformation block sample type is the same as the sample type associated with one or more previously decoded transformation blocks, from which the history parameter value is determined.

[0276]

[0267] Embodiment 14: Any method of Embodiments 1 to 13, wherein the history parameter value is determined at least in part on a first non-zero decoded transformation coefficient obtained from each of one or more previously decoded transformation blocks.

[0277]

[0268] Embodiment 15: The method of Embodiment 14, further comprising determining the binary code length of each first non-zero decoded transformation coefficient obtained from each of one or more previously decoded transformation blocks.

[0278]

[0269] Embodiment 16: The method of Embodiment 15, wherein the historical parameter value is determined as an exponentially weighted moving average of the binary code lengths determined for each of the first non-zero decoded conversion coefficients of one or more previously decoded conversion blocks.

[0279]

[0270] Embodiment 17: Any method of Embodiments 1 to 16, wherein one or more parameters for multiple samples include one or more rice parameters, the historical parameter value is the historical rice parameter value, and the parameter determined for the current sample is the rice parameter for the current sample.

[0280]

[0271] Embodiment 18: A method of any one of embodiments 1 to 17, wherein decoding the current sample based on determined parameters of the current sample comprises decoding syntax elements that represent the current sample based on determined parameters.

[0281]

[0272] Embodiment 19: Any method of Embodiments 1 to 18, comprising decoding the current sample based on determined parameters, or decoding the Goromrice code using determined parameters.

[0282]

[0273] Embodiment 20: A method for decoding video data, the method comprising: obtaining a transformation block; determining one or more non-zero decoded transformation coefficients based at least in part on an analysis of the transformation block; determining a history update value of the transformation block based at least a portion of one or more non-zero decoded transformation coefficients; updating an existing history parameter value at least in part by combining the history update value of the transformation block with an existing history parameter value; and decoding at least one sample of the transformation block based on an existing history parameter value or an updated existing history parameter value, where the existing history parameter value is at least in part on a series of non-zero decoded transformation coefficients determined from a series of previously analyzed transformation blocks.

[0283]

[0274] Embodiment 21: The method of Embodiment 20, wherein the history update value of the conversion block is combined with an existing history parameter value, and the history update value of the conversion block is averaged with the existing history parameter value.

[0284]

[0275] Embodiment 22: A method of any one embodiment of 20 or 21, wherein combining the historical update value of a transformation block with an existing historical parameter value determines an exponentially weighted moving average between the historical update value of a transformation block and the existing historical parameter value.

[0285]

[0276] Embodiment 23: The method of Embodiment 22, further comprising assigning a first weight to the historical update values ​​of a transformation block and a second weight to existing historical parameter values, wherein determining the exponentially weighted moving average is at least partially based on the first weight and the second weight.

[0286]

[0277] Embodiment 24: Any method of Embodiments 20 to 23, wherein the history update value of the transformation block is determined based on a first non-zero decoded transformation coefficient determined in the analysis of the transformation block.

[0287] Aspect 25: The method of Aspect 24, in which the first non-zero decoded transform coefficient is determined based on the run-scanning order of the inverse transform block.

[0288] Aspect 26: The method of either Aspect 24 or 25, in which the history update value of the transform block is determined at least in part by determining the binary code length of the first non-zero decoded transform coefficient.

[0289] Aspect 27: The method of any one of Aspects 20 to 26, in which the transform block and the previously analyzed transform block are associated with the first slice, and the existing history parameter value is iteratively updated based on the continuous history update values determined for the continuously analyzed transform blocks associated with the same slice.

[0290] Aspect 28: The method of Aspect 27, further comprising initializing the existing history parameter value to a predetermined value, where the initialization is performed before analyzing the first transform block of the first slice and determining the history update value of the first transform block.

[0291] Aspect 29: The method of any one of Aspects 20 to 28, in which the history update value of the transform block is determined based on all of the non-zero decoded transform coefficients of the transform block.

[0292] Aspect 30: The method of Aspect 29, in which the history update value is determined at least in part by averaging all of the non-zero decoded transform coefficients of the transform block.

[0293] Aspect 31: The method of any one of Aspects 20 to 30, in which the existing history parameter value is the existing history Rice parameter value.

[0294]

[0285] Embodiment 32: Any method of Embodiments 20 to 31, wherein decoding at least one sample of a transformation block comprises decoding a syntax element indicating at least one sample based on an existing history parameter value or an updated existing history parameter value.

[0295]

[0286] Embodiment 33: Any method of Embodiments 20 to 32, wherein decoding at least one sample of a conversion block comprises decoding a Golombrice code using an existing history parameter value or an updated existing history parameter value.

[0296]

[0287] Embodiment 34: An apparatus for decoding video data, comprising at least one memory and at least one processor coupled to the at least one memory, wherein the at least one processor is configured to acquire a transformation block, determine one or more parameters for a plurality of samples by at least partly analyzing the local neighborhood of the current sample among a plurality of samples in which the transformation block includes a plurality of samples, determine that the number of neighbor transformation coefficients of the current sample is less than a threshold amount, at least partly based on the analysis of the local neighborhood, acquire historical parameter values ​​determined from one or more previously decoded transformation blocks, determine the parameters of the current sample at least partly based on the historical parameter values, and decode the current sample based on the determined parameters of the current sample.

[0297]

[0288] Embodiment 35: The apparatus of Embodiment 34, wherein at least one processor is configured to determine the parameters of the current sample based on a first integer multiple of the history parameter value, at least in part on the determination that the number of neighbor conversion coefficients is 0.

[0298]

[0289] Embodiment 36: The apparatus of Embodiment 35, wherein at least one processor is configured to provide a first integer multiple of a historical parameter value as input to a lookup table that maps inputs to parameters, in order to determine the parameters of the current sample.

[0299]

[0290] Embodiment 37: The apparatus of either Embodiment 35 or 36, wherein the first integer multiple and the threshold amount are the same value.

[0300]

[0291] Embodiment 38: An apparatus of any of embodiments 35 to 37, wherein at least one processor is configured to determine the parameters of the current sample based on a second integer multiple of the history parameter value and the sum of the neighboring conversion coefficients, at least in part on the determination that the number of neighboring conversion coefficients is greater than zero.

[0301]

[0292] Embodiment 39: The apparatus of Embodiment 38, wherein at least one processor is configured to provide the sum of neighbor conversion coefficients and a second integer multiple of the summed historical parameter value as input to a lookup table that maps between inputs and parameters, in order to determine the parameters of the current sample.

[0302]

[0293] Embodiment 40: The apparatus of Embodiment 39, wherein the second integer multiple is smaller than the first integer multiple.

[0303]

[0294] Embodiment 41: An apparatus of any of embodiments 34 to 40, wherein at least one processor is configured to determine that the number of neighbor conversion coefficients is less than a threshold amount, at least in part on having identified one or more unavailable neighbor conversion coefficients for the current sample.

[0304]

[0295] Embodiment 42: The apparatus of Embodiment 41, wherein at least one processor is configured to obtain the location of the current sample in a conversion block, compare the location of the current sample with one or more of the width and height of the conversion block, and identify one or more unavailable neighbor conversion coefficients based at least in part on the comparison.

[0305]

[0296] Embodiment 43: The apparatus of Embodiment 42, wherein one or more unavailable neighbor conversion coefficients are associated with locations outside the conversion block.

[0306]

[0297] Embodiment 44: An apparatus of any embodiment 42 or 43, wherein at least one processor is configured to determine that the horizontal component of the current sample location is within a first distance of the width of the conversion block and that the vertical component of the current sample location is within a second distance of the height of the conversion block, in order to determine that the number of neighbor conversion coefficients is less than a threshold amount.

[0307]

[0298] Embodiment 45: An apparatus according to any of Embodiments 34 to 44, wherein multiple samples are associated with a conversion block sample type, and the conversion block sample type includes a lumens sample or a chromatic sample.

[0308]

[0299] Embodiment 46: The apparatus of Embodiment 45, wherein the conversion block sample type is the same as the sample type associated with one or more previously decoded conversion blocks, from which the history parameter value is determined.

[0309]

[0300] Embodiment 47: An apparatus of any of embodiments 34 to 46, wherein at least one processor is configured to determine a history parameter value at least in part on a first non-zero decoded conversion coefficient obtained from each of one or more previously decoded conversion blocks.

[0310]

[0301] Embodiment 48: The apparatus of Embodiment 47, wherein at least one processor is configured to determine the binary code length of each first non-zero decoded conversion coefficient obtained from each of one or more previously decoded conversion blocks.

[0311]

[0302] Embodiment 49: The apparatus of Embodiment 48, wherein at least one processor is configured to determine a history parameter value as an exponentially weighted moving average of binary code lengths determined for each of the first non-zero decoded conversion coefficients of one or more previously decoded conversion blocks.

[0312]

[0303] Embodiment 50: An apparatus according to any of Embodiments 34 to 49, wherein one or more parameters for multiple samples include one or more rice parameters, the historical parameter value is the historical rice parameter value, and the parameter determined for the current sample is the rice parameter for the current sample.

[0313]

[0304] Embodiment 50: An apparatus according to any one of Embodiments 34 to 50, comprising decoding the current sample based on determined parameters of the current sample, or decoding syntax elements that represent the current sample based on determined parameters.

[0314]

[0305] Embodiment 50: An apparatus according to any of Embodiments 34 to 51, comprising decoding the current sample based on determined parameters and decoding the Gorom Rice Code using determined parameters.

[0315]

[0306] Embodiment 51: An apparatus for decoding video data, comprising at least one memory and at least one processor coupled to the at least one memory, wherein the at least one processor is configured to acquire a conversion block, determine one or more non-zero decoded conversion coefficients based at least in part on an analysis of the conversion block, determine a history update value for the conversion block based at least a portion of the one or more non-zero decoded conversion coefficients, update an existing history parameter value by at least part by combining the history update value for the conversion block with an existing history parameter value, and the existing history parameter value is at least partly based on a series of non-zero decoded conversion coefficients determined from a series of previously analyzed conversion blocks.

[0316]

[0307] Embodiment 52: The apparatus of Embodiment 51, wherein at least one processor is configured to average the history update values ​​of a conversion block with existing history parameter values ​​in order to combine the history update values ​​of a conversion block with existing history parameter values.

[0317]

[0308] Embodiment 53: The apparatus of any one embodiment 51 or 52, wherein at least one processor is configured to determine an exponentially weighted moving average between the historical update value of a conversion block and the existing historical parameter value in order to combine the historical update value of a conversion block with an existing historical parameter value.

[0318]

[0309] Embodiment 54: The apparatus of Embodiment 53, wherein at least one processor is configured to assign a first weight to the historical update values ​​of a conversion block and a second weight to the existing historical parameter values, and to determine an exponentially weighted moving average based at least in part on the first and second weights.

[0319]

[0310] Embodiment 55: The apparatus of any one of embodiments 51 to 54, wherein at least one processor is configured to determine a history update value of a conversion block based on a first non-zero decoded conversion coefficient determined in the analysis of the conversion block.

[0320]

[0311] Embodiment 56: The apparatus of Embodiment 55, wherein at least one processor is configured to determine a first non-zero decoded conversion coefficient based on the run scan order of the conversion blocks in the reverse direction.

[0321]

[0312] Embodiment 57: An apparatus of any embodiment 55 or 56, wherein at least one processor is configured to determine the history update value of a conversion block, at least in part by determining the binary code length of a first non-zero decoded conversion coefficient.

[0322]

[0313] Embodiment 58: An apparatus of any of embodiments 51 to 57, wherein a transformation block and a previously analyzed transformation block are associated with a first slice, and at least one processor is configured to iteratively update existing historical parameter values ​​based on a series of historical update values ​​determined for a series of transformation blocks to be analyzed and associated with the same slice.

[0323]

[0314] Embodiment 59: The apparatus of Embodiment 58, wherein at least one processor is configured to initialize existing history parameter values ​​to predetermined values, wherein the initialization is performed before analyzing a first transformation block of a first slice and determining the history update values ​​of the first transformation block.

[0324]

[0315] Embodiment 60: An apparatus according to any of embodiments 51 to 59, wherein at least one processor is configured to determine the history update value of a conversion block based on all of the non-zero decoded conversion coefficients of the conversion block.

[0325]

[0316] Embodiment 61: The apparatus of Embodiment 60, wherein at least one processor is configured to determine the history update value at least in part by averaging all of the non-zero decoded conversion coefficients of the conversion block.

[0326]

[0317] Embodiment 62: An apparatus according to any of Embodiments 51 to 61, wherein the existing historical parameter value is the existing historical rice parameter value.

[0327]

[0318] Embodiment 63: An apparatus of any of embodiments 51 to 62, wherein decoding at least one sample of a conversion block comprises decoding a syntax element indicating at least one sample based on an existing history parameter value or an updated existing history parameter value.

[0328]

[0319] Embodiment 64: An apparatus according to any of embodiments 51 to 63, wherein decoding at least one sample of a conversion block comprises decoding a Golombrice code using an existing history parameter value or an updated existing history parameter value.

[0329]

[0320] Aspect 65: A non-temporary computer-readable storage medium that stores instructions causing one or more processors to perform any of the operations of aspects 1 to 64 when executed by one or more processors.

[0330]

[0321] Embodiment 66: An apparatus comprising means for performing any of the operations of Embodiments 1 to 64.

[0331]

[0322] Embodiment 67: A method for processing video data, the method comprising: obtaining a plurality of coefficients associated with a block of video data; determining the classification of the spatial position of a coefficient among the plurality of coefficients based on the estimated accuracy of a template-based derivation technique for deriving the rice parameters of the coefficients; determining the rice parameters of the coefficients based on the classification; and generating a bitstream based on the determined parameters of the current sample.

[0332]

[0323] Embodiment 68: The method of Embodiment 67, further comprising determining the rice parameter using a template-based derivation technique based on the fact that the estimated accuracy is greater than an accuracy threshold.

[0333]

[0324] Embodiment 69: The method of Embodiment 67, further comprising determining the Rice parameter using a history-based derivation technique based on the fact that the estimated accuracy is less than an accuracy threshold.

[0334]

[0325] Embodiment 70: The method of Embodiment 67, further comprising determining the rice parameter using a function based on the fact that the estimated accuracy is less than an accuracy threshold, wherein the function is based on a template-based derivation technique and a history-based derivation technique.

[0335]

[0326] Embodiment 71: The method of Embodiment 70, wherein the function includes a weighted average.

[0336]

[0327] Embodiment 72: The method of Embodiment 70, wherein a function is incorporated into a template-based derivation technique.

[0337]

[0328] Embodiment 73: Any one of embodiments 67 to 72, wherein the classification is determined based on the run of the scan order in the reverse direction.

[0338]

[0329] Embodiment 74: Any one of embodiments 67 to 73, further comprising generating an encoded video bitstream containing a plurality of coefficients.

[0339]

[0330] Embodiment 75: Any one of embodiments 67 to 73, further comprising obtaining a plurality of coefficients from an encoded video bitstream.

[0340]

[0331] Embodiment 76: An apparatus comprising a memory configured to store video data and a processor, wherein the processor is configured to acquire a plurality of coefficients associated with blocks of video data, determine the classification of the spatial position of a coefficient among the plurality of coefficients based on the estimated accuracy of a template-based derivation technique for deriving the rice parameters of the coefficients, determine the rice parameters of the coefficients based on the classification, and generate a bitstream based on the determined parameters of the current sample.

[0341]

[0332] Embodiment 77: The apparatus of Embodiment 76, further comprising determining the Rice parameter using a template-based derivation technique based on the fact that the estimated accuracy is greater than the accuracy threshold.

[0342]

[0333] Embodiment 78: The apparatus of Embodiment 76, further comprising determining the Rice parameter using a history-based derivation technique based on the fact that the estimated accuracy is less than an accuracy threshold.

[0343]

[0334] Embodiment 79: The apparatus of Embodiment 76, further comprising determining the Rice parameter using a function based on the fact that the estimated accuracy is less than an accuracy threshold, wherein the function is based on a template-based derivation technique and a history-based derivation technique.

[0344]

[0335] Embodiment 80: The apparatus of Embodiment 79, wherein the function includes a weighted average.

[0345]

[0336] Embodiment 81: The apparatus of Embodiment 79, wherein a function is incorporated into a template-based derivation technique.

[0346]

[0337] Embodiment 82: Any one of embodiments 76 to 81, wherein the classification is determined based on runs in the reverse scanning order.

[0347]

[0338] Embodiment 83: Any one of embodiments 76 to 82 further comprising generating an encoded video bitstream containing a plurality of coefficients.

[0348]

[0339] Embodiment 84: Any one of embodiments 76 to 82, further comprising obtaining a plurality of coefficients from an encoded video bitstream.

[0349]

[0340] Embodiment 85: The apparatus of Embodiment 68, wherein the apparatus includes an encoder.

[0350]

[0341] Embodiment 86: The apparatus of Embodiment 68, wherein the apparatus includes a decoder.

[0351]

[0342] Embodiment 87: Any one of Embodiments 68 to 78, wherein the device is a mobile device.

[0352]

[0343] Embodiment 88: Any one of Embodiments 68 to 79, wherein the device is an extended reality device.

[0353]

[0344] Embodiment 89: Any one of embodiments 68 to 80, further comprising a display configured to display video data.

[0354]

[0345] Embodiment 90: Any one of embodiments 68 to 81, further comprising a camera configured to capture one or more pictures.

[0355]

[0346] Aspect 91: A computer-readable medium storing instructions that, when executed by a processor, perform any of the methods of aspects 67 to 90.

[0356]

[0347] Embodiment 92: An apparatus comprising means for performing any of the operations of Embodiments 67 to 90.

[0357]

[0348] Embodiment 93: A method for encoding video data, the method comprising: obtaining a transform block; determining one or more parameters for a plurality of samples, at least in part by analyzing the local neighborhood of the current sample among a plurality of samples, wherein the transform block includes a plurality of samples; determining, at least in part based on the local neighborhood analysis, that the number of neighbor transform coefficients of the current sample is less than a threshold amount; obtaining historical parameter values ​​determined from one or more previously encoded transform blocks; determining the parameters of the current sample, at least in part based on the historical parameter values; and generating a bitstream based on existing historical parameter values ​​or updated existing historical parameter values.

[0358]

[0349] Embodiment 94: The method of Embodiment 93, further comprising determining the parameters of the current sample based on a first integer multiple of the historical parameter value, at least in part on the determination that the number of neighboring conversion coefficients is 0.

[0359]

[0350] Embodiment 95: The method of Embodiment 94, wherein determining the parameters of the current sample is further comprising providing a first integer multiple of a historical parameter value as input to a lookup table that maps between inputs and parameters, wherein the first integer multiple and a threshold amount are the same value.

[0360]

[0351] Embodiment 96: The method of Embodiment 94, further comprising determining the parameters of the current sample based on a second integer multiple of the history parameter value and the sum of the neighboring conversion coefficients, at least in part on the determination that the number of neighboring conversion coefficients is greater than 0, wherein the second integer multiple is less than the first integer multiple.

[0361]

[0352] Embodiment 97: The method of Embodiment 96, wherein determining the parameters of the current sample is provided as input to a lookup table mapping between the input and the parameters, the sum of neighbor transformation coefficients and a second integer multiple of the summed historical parameter values.

[0362]

[0353] Embodiment 98: A method of any of embodiments 93 to 97, wherein determining that the number of neighbor conversion coefficients is less than a threshold amount is at least in part based on identifying one or more unavailable neighbor conversion coefficients for the current sample, and one or more unavailable neighbor conversion coefficients are associated with a location outside the conversion block.

[0363]

[0354] Embodiment 99: The method of Embodiment 98, further comprising obtaining the location of the current sample in the transformation block, comparing the location of the current sample with one or more of the width and height of the transformation block, and identifying one or more unavailable neighbor transformation coefficients based at least in part on the comparison.

[0364]

[0355] Embodiment 100: The method of Embodiment 99, wherein determining that the number of neighboring conversion coefficients is less than a threshold amount comprises determining that the horizontal component of the current sample location is within a first distance of the width of the conversion block, and determining that the vertical component of the current sample location is within a second distance of the height of the conversion block.

[0365]

[0356] Embodiment 101: Any method of Embodiments 93 to 100, wherein a plurality of samples are associated with a conversion block sample type, the conversion block sample type includes a lumen sample or a chroma sample, and the conversion block sample type is the same as the sample type associated with one or more previously decoded conversion blocks from which the history parameter values ​​are determined.

[0366]

[0357] Embodiment 102: Any method of Embodiments 93 to 101, wherein the history parameter value is determined at least in part on a first non-zero decoded transformation coefficient obtained from each of one or more previously coded transformation blocks.

[0367]

[0358] Embodiment 103: The method of Embodiment 102, further comprising determining the binary code length of each first non-zero coded conversion coefficient obtained from each of one or more previously coded conversion blocks, wherein the history parameter value is determined as an exponentially weighted moving average of the binary code lengths determined for each of the first non-zero coded conversion coefficients of one or more previously coded conversion blocks.

[0368]

[0359] Embodiment 104: Any method of Embodiments 93 to 103, wherein one or more parameters for multiple samples include one or more rice parameters, the historical parameter value is the historical rice parameter value, and the parameter determined for the current sample is the rice parameter for the current sample.

[0369]

[0360] Embodiment 105: Apparatus for encoding video data, comprising at least one memory and at least one processor coupled to the at least one memory, wherein the at least one processor is configured to acquire a transformation block, determine one or more non-zero coded transformation coefficients based at least in part on an analysis of the transformation block, determine a history update value for the transformation block based at least a portion of the one or more non-zero coded transformation coefficients, update an existing history parameter value by at least in part averaging the history update value for the transformation block with existing history parameter values, and generate a bitstream based on existing history parameter values ​​or updated existing history parameter values, wherein the existing history parameter values ​​are at least in part on a set of non-zero coded transformation coefficients determined from a set of previously analyzed transformation blocks.

[0370]

[0361] Embodiment 106: The apparatus of Embodiment 105, wherein at least one processor is configured to determine an exponentially weighted moving average between the historically updated value of a conversion block and the existing historically updated value in order to update an existing historically significant parameter value.

[0371]

[0362] Embodiment 107: The apparatus of Embodiment 106, wherein at least one processor is configured to assign a first weight to the historical update values ​​of a conversion block and a second weight to existing historical parameter values, and to determine an exponentially weighted moving average based at least in part on the first and second weights.

[0372]

[0363] Embodiment 108: Any apparatus of Embodiments 105 to 107, wherein at least one processor is configured to determine a history update value of a conversion block based on a first non-zero coded conversion coefficient determined in the analysis of the conversion block.

[0373]

[0364] Embodiment 109: The apparatus of Embodiment 108, wherein at least one processor is configured to determine a first non-zero coded conversion coefficient based on the run scan order of the reverse conversion blocks.

[0374]

[0365] Embodiment 110: The apparatus of Embodiment 108, wherein at least one processor is configured to determine the history update value of a conversion block, at least in part by determining the binary code length of a first non-zero coded conversion coefficient.

[0375]

[0366] Embodiment 111: An apparatus of any of embodiments 105 to 110, wherein a transformation block and a previously analyzed transformation block are associated with a first slice, and at least one processor is configured to iteratively update existing historical parameter values ​​based on a series of historical update values ​​determined for a series of transformation blocks to be analyzed that are associated with the same slice.

[0376]

[0367] Embodiment 112: The apparatus of Embodiment 111, wherein at least one processor is configured to initialize existing history parameter values ​​to predetermined values, wherein the initialization is performed before analyzing a first transformation block of a first slice and determining the history update values ​​of the first transformation block.

[0377]

[0368] Embodiment 113: An apparatus of any of embodiments 105 to 112, wherein at least one processor is configured to determine the history update value of a conversion block based on all of the non-zero coded conversion coefficients of the conversion block.

[0378]

[0369] Embodiment 114: The apparatus of Embodiment 113, wherein at least one processor is configured to determine the history update value at least in part by averaging all of the non-zero coded conversion coefficients of the conversion block.

[0379]

[0370] Embodiment 115: An apparatus according to any of Embodiments 105 to 114, wherein the existing historical parameter value is the existing historical rice parameter value.

[0380]

[0371] Aspect 116: A non-temporary computer-readable storage medium that stores instructions causing one or more processors to perform any of the operations of aspects 93 to 115 when executed by one or more processors.

[0381]

[0372] Embodiment 117: An apparatus comprising means for performing any of the operations of Embodiments 93 to 115.

Claims

1. 1. A method for decoding video data, comprising the steps of: Obtaining a transform block, the transform block including a plurality of samples; determining one or more parameters for the plurality of samples at least in part by analyzing a local neighborhood of a current sample of the plurality of samples, wherein the one or more parameters for the plurality of samples include one or more Rice parameters. determining, based on the analysis of the local neighborhood, that a number of neighboring transform coefficients of the current sample is less than a threshold amount; obtaining historical Rice parameter values ​​determined from one or more previously decoded transformation blocks; determining a Rice parameter for the current sample based on the historical Rice parameter values; decoding the current sample based on the determined Rice parameter of the current sample; A method comprising:

2. determining the parameter for the current sample based on a first integer multiple of the historical parameter value based on a determination that the number of neighboring transform coefficients is zero; The method of claim 1 further comprising:

3. 3. The method of claim 2, wherein determining the parameter of the current sample comprises providing the first integer multiple of the historical parameter value as an input to a lookup table that maps between inputs and parameters.

4. The method of claim 2 , wherein the first integer multiple and the threshold amount are the same value.

5. determining the parameter for the current sample based on a second integer multiple of the historical parameter value and a sum of the neighboring transform coefficients based at least in part on a determination that the number of neighboring transform coefficients is greater than zero; and optionally further comprising: Determining the parameter of the current sample comprises providing the second integer multiple of the historical parameter value summed with the sum of the neighboring transform coefficients as an input to a lookup table that maps between inputs and parameters; and optionally The method of claim 2 , wherein the second integer multiple is less than the first integer multiple.

6. The method of claim 1 , wherein determining that the number of neighboring transform coefficients is less than the threshold amount is based at least in part on identifying one or more unavailable neighboring transform coefficients for the current sample.

7. obtaining a location of the current sample within the transform block; comparing the location of the current sample to one or more of a width of the transform block and a height of the transform block; identifying the one or more unavailable neighboring transform coefficients based at least in part on the comparison; and The method of claim 6 further comprising:

8. The method of claim 7 , wherein the one or more unavailable neighboring transform coefficients are associated with locations outside the transform block.

9. Determining that the number of neighboring transform coefficients is less than the threshold amount includes: determining that a horizontal component of the location of the current sample is within a first distance of the width of the transform block; determining that a vertical component of the location of the current sample is within a second distance of the height of the transform block; The method of claim 7 comprising:

10. the plurality of samples are associated with a transform block sample type, the transform block sample type comprising a luma sample or a chroma sample; and optionally The method of claim 1 , wherein the transform block sample type is the same as a sample type associated with the one or more previously decoded transform blocks from which the historical parameter values ​​are determined.

11. The history parameter value is determined based at least in part on a first non-zero decoded transform coefficient obtained from each of the one or more previously decoded transform blocks, and optionally determining a binary code length of each first non-zero decoded transform coefficient obtained from each of the one or more previously decoded transform blocks; and optionally 2. The method of claim 1 , wherein the history parameter value is determined as an exponentially weighted moving average of the binary code lengths determined for the first non-zero decoded transform coefficient of each of the one or more previously decoded transform blocks.

12. 2. The method of claim 1, wherein decoding the current sample based on the determined parameters of the current sample comprises decoding a syntax element indicating the current sample based on the determined parameters or a Golomb-Rice code using the determined parameters.

13. 1. An apparatus for decoding video data, comprising: At least one memory; at least one processor coupled to the at least one memory, the at least one processor comprising: Obtaining a transform block, the transform block comprising a plurality of samples; determining one or more parameters for the plurality of samples at least in part by analyzing a local neighborhood of a current sample of the plurality of samples, wherein the one or more parameters for the plurality of samples include one or more Rice parameters. determining, based on the analysis of the local neighborhood, that a number of neighboring transform coefficients of the current sample is less than a threshold amount; obtaining historical Rice parameter values ​​determined from one or more previously decoded transformation blocks; determining a Rice parameter for the current sample based on the historical Rice parameter values; decoding the current sample based on the determined Rice parameter of the current sample; An apparatus configured to:

14. The apparatus of claim 13, wherein the at least one processor is further configured to perform a method according to any one of claims 1 to 12.

15. A non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform a method according to any one of claims 1 to 12.