Method and device for probability calculation for context-based adaptive binary arithmetic coding

The use of weighted multi-hypothesis probability estimation with adaptive weights in CABAC addresses the limitations of fixed adaptation parameters in VVC, enhancing compression efficiency by adapting to the unique statistical properties of video bitstreams.

JP2024545108AActive Publication Date: 2024-12-05BEIJING DAJIA INTERNET INFORMATION TECH CO LTD

Patent Information

Application Number
JP2024534131
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2021-12-29
Filing Date
2022-12-29
Publication Date
2024-12-05
Estimated Expiration
2042-12-29

AI Technical Summary

Technical Problem

Existing video coding standards like VVC have limitations in the accuracy of probability estimation in context-based adaptive binary arithmetic coding (CABAC), which can lead to suboptimal compression efficiency due to fixed adaptation parameters and initial context probability settings that do not adapt well to varying statistical properties of video bitstreams.

Method used

Implementing a method for video encoding and decoding that uses weighted multi-hypothesis probability estimation (MHP-AW) with adaptive weights to improve the accuracy of probability estimation in CABAC, allowing for flexible adaptation to different contexts and incorporating inheritance of context states from previously encoded slices.

Benefits of technology

Enhances the accuracy of probability estimation in CABAC, leading to improved compression efficiency and better adaptation to varying statistical properties of video bitstreams, thereby optimizing video coding performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024545108000001_ABST
    Figure 2024545108000001_ABST
Patent Text Reader

Abstract

A method, an apparatus, and a non-transitory computer-readable storage medium for video decoding and encoding are provided. In one method for video decoding, a binary arithmetic decoder may obtain a multiple hypothesis probability of a binary symbol of a given context model of the binary arithmetic decoder according to an adaptive weight, the multiple hypothesis probability indicating a probability that the binary symbol is equal to a binary value, the binary symbol being from a plurality of binary symbols associated with the context model. Furthermore, the decoder may decode the binary symbol according to the multiple hypothesis probability.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application is based on and claims priority to U.S. Provisional Application No. 63 / 294,692, entitled "Methods and Devices on Probability Calculation for Context-Based Adaptive Binary Arithmetic Coding," filed on December 29, 2021, which is incorporated by reference in its entirety for all purposes.

[0002] The present disclosure relates to video encoding and compression, and more particularly, but not limited to, methods and apparatus for improving the accuracy of probability estimation modules for context-based adaptive binary arithmetic coding (CABAC), an entropy coding method used in modern video codecs. [Background technology]

[0003] Various video encoding techniques may be used to compress video data. Video encoding is performed according to one or more video encoding standards. For example, video encoding standards include Versatile Video Coding (VVC), High Efficiency Video Coding (H.265 / HEVC), Advanced Video Coding (H.264 / AVC), Moving Picture Expert Group (MPEG) coding, and the like. Video encoding generally utilizes prediction methods (e.g., inter-prediction, intra-prediction, and the like) that exploit redundancy present in a video image or sequence. An important goal of video encoding techniques is to compress video data into a format that uses a lower bitrate while avoiding or minimizing degradation of video quality.

[0004] The first version of the VVC standard was finalized in July 2020, offering approximately 50% bitrate savings or comparable perceptual quality compared to the previous generation video coding standard HEVC. The VVC standard offers significant coding improvements over previous standards, but there is evidence that better coding efficiency can be achieved with additional coding tools. Recently, the Joint Video Exploration Team (JVET), in cooperation with ITU-T VECG and ISO / IEC MPEG, has begun exploring advanced techniques that can enable significant gains in coding efficiency beyond VVC. In April 2021, one software code base, called the Enhanced Compression Model (ECM), was established for future video coding exploration work. The ECM reference software is based on the VVC Test Model (VTM) developed for VVC by JVET, with several existing modules (e.g., intra / inter prediction, transform, in-loop filter, etc.) further extended and / or improved. In the future, any new coding tools that go beyond the VVC standard will need to be integrated into the ECM platform and tested using the JVET common test conditions (CTC). Summary of the Invention [Problem to be solved by the invention]

[0005] This disclosure provides example techniques for improving the accuracy of a probability estimation module for CABAC. [Means for solving the problem]

[0006] According to a first aspect of the present disclosure, there is provided a method for video decoding, the method comprising: Binary Arithmetic Decoder of the binary arithmetic decoder according to the adaptive weights. Context Model (context model) Binary Symbolsa multi-hypothesis probability of determining the probability that the binary symbol is equal to the binary value; Binary Symbols The decoder further includes a multi-hypothesis decoder that can generate a multi-hypothesis probability matrix of the binary symbols associated with the context model. Binary Symbols The decoder may also encode Binary Symbols can be decoded.

[0007] According to a second aspect of the present disclosure, there is provided a method for video encoding, the method comprising: Binary Arithmetic Encoder is adjusted according to the adaptive weights. Context Model From multiple binary symbols Binary Symbols A multiple hypothesis probability of Binary Symbols In addition, the encoder may further include a multiple hypothesis probability calculator that calculates a probability of the binary value being equal to the multiple hypothesis probability. Binary Symbols may be encoded as:

[0008] According to a third aspect of the present disclosure, a method for video decoding is provided, the method including: a decoder selecting one or more slices that are encoded before a current slice; slice and obtaining an initial context state of the one or more context models of the current slice by inheriting a context state of the one or more context models of the current slice, and decoding a binary symbol associated with the one or more context models in the current slice according to the initial context state.

[0009] According to a fourth aspect of the present disclosure, a method for video encoding is provided, the method including: an encoder selecting one or more slices that are encoded before a current slice; and decoding the one or more slices that are encoded before the current slice. slicedetermining an initial context state of the one or more context models of the current slice by inheriting a context state of the one or more context models from the current slice; and encoding a binary symbol associated with the one or more context models of the current slice according to the initial context state.

[0010] According to a fifth aspect of the present disclosure, there is provided an apparatus for video decoding, the apparatus including: one or more processors; and a memory coupled to the one or more processors and configured to store instructions executable by the one or more processors, the one or more processors configured, upon execution of the instructions, to perform a method according to the first or third aspect.

[0011] According to a sixth aspect of the present disclosure, there is provided an apparatus for video encoding, the apparatus including: one or more processors; and a memory coupled to the one or more processors and configured to store instructions executable by the one or more processors, the one or more processors configured, upon execution of the instructions, to perform a method according to the second or fourth aspect.

[0012] According to a seventh aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium for storing computer-executable instructions which, when executed by one or more computer processors, cause the one or more computer processors to receive a bitstream and perform a method according to the first or third aspect based on the bitstream.

[0013] According to an eighth aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium for storing computer-executable instructions that, when executed by one or more computer processors, cause the one or more computer processors to perform a method according to the second or fourth aspect to encode a current video block into a bitstream and transmit the bitstream.

[0014] A more particular description of examples of the present disclosure will be made with reference to certain examples that are illustrated in the accompanying drawings, in which the examples will be described and explained with additional specificity and detail, taking into consideration that these drawings illustrate only some examples and therefore are not to be considered limiting in scope, and in which: [Brief description of the drawings]

[0015] [Figure 1A] FIG. 1 is a block diagram illustrating a system for encoding and decoding video blocks according to some examples of the present disclosure. [Figure 1B] 1 is a block diagram of an encoder according to some examples of this disclosure. [Fig. 1C-1F] A block diagram illustrating how a frame is recursively divided into multiple video blocks of different sizes and shapes in accordance with some examples of this disclosure. [Diagram 2] 1 is a block diagram of a decoder according to some examples of this disclosure. [Figure 3A] A diagram showing block division in a multi-type tree structure according to some examples of the present disclosure. [Figure 3B] A diagram showing block division in a multi-type tree structure according to some examples of the present disclosure. [Figure 3C] A diagram showing block division in a multi-type tree structure according to some examples of the present disclosure. [Figure 3D] A diagram showing block division in a multi-type tree structure according to some examples of the present disclosure. [Figure 3E] A diagram showing block division in a multi-type tree structure according to some examples of the present disclosure. [Figure 4] FIG. 1 illustrates a computing environment coupled with a user interface according to some examples of the present disclosure. [Diagram 5] 1 is a flowchart illustrating a method for video decoding according to some examples of this disclosure. [Figure 6] 6 is a flowchart illustrating a method for video encoding that corresponds to the method for video decoding shown in FIG. 5 according to some examples of this disclosure. [Figure 7] 1 is a flowchart illustrating a method for video decoding according to some examples of this disclosure. [Figure 8] 8 is a flowchart illustrating a method for video encoding that corresponds to the method for video decoding shown in FIG. 7 according to some examples of this disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0016] Reference will now be made in detail to specific implementations, examples of which are illustrated in the accompanying drawings. In the following detailed description, numerous non-limiting specific details are set forth to aid in understanding the subject matter presented herein. However, it will be apparent to one skilled in the art that various alternatives may be used. For example, it will be apparent to one skilled in the art that the subject matter presented herein may be implemented in many types of electronic devices having digital video capabilities.

[0017] The terms used in this disclosure are employed only for the purpose of describing certain embodiments, and are not intended to limit the disclosure. In this disclosure and the appended claims, the singular forms "a / an", "said" and "the" are intended to include the plural forms, unless otherwise clearly indicated throughout this disclosure. The term "and / or" used in this disclosure is also understood to refer to and include one or any or all possible combinations of the associated listed items.

[0018] References throughout this specification to "one embodiment," "an embodiment," "an example," "some embodiments," "some examples," or similar language mean that a particular feature, structure, or characteristic described is included in at least one embodiment or example. A feature, structure, element, or characteristic described in connection with one or some embodiments is applicable to other embodiments, unless expressly stated otherwise.

[0019] Throughout this disclosure, terms such as "first," "second," "third," etc. are all used solely as nomenclature to refer to related elements, e.g., devices, components, compositions, steps, etc., without implying any spatial or chronological order, unless otherwise specified. For example, a "first device" and a "second device" may refer to two separately formed devices or two parts, components or operating states of the same device, and may be arbitrarily named.

[0020] The terms "module," "sub-module," "circuit," "sub-circuit," "circuitry," "sub-circuitry," "unit," or "sub-unit" may include memory (shared, dedicated, or group) that stores code or instructions that can be executed by one or more processors. A module may include one or more circuits that may or may not contain stored code or instructions. A module or circuit may include one or more components that are directly or indirectly connected. These components may or may not be physically attached or located adjacent to each other.

[0021] As used herein, the terms "if" or "when" may be understood to mean "upon" or "in response to," depending on the context. These terms, when they appear in a claim, may not indicate that the associated limitation or feature is conditional or optional. For example, a method may include steps: i) when or if condition X exists, function or action X' is performed; and ii) when or if condition Y exists, function or action Y' is performed. The method may be implemented with both the ability to perform function or action X' and the ability to perform function or action Y'. Thus, functions X' and Y' may both be performed at different times during multiple executions of the method.

[0022] A unit or module may be implemented purely by software, purely by hardware, or by a combination of hardware and software. In a purely software implementation, for example, a unit or module may include functionally related code blocks or software components that are directly or indirectly linked together to perform a particular function.

[0023] 1A is a block diagram illustrating an example system 10 for encoding and decoding video blocks in parallel, according to some implementations of the present disclosure. As shown in FIG. 1A, system 10 includes a source device 12 that generates and encodes video data to be subsequently decoded by a destination device 14. Source device 12 and destination device 14 may include any of a wide variety of electronic devices, including desktop or laptop computers, tablet computers, smart phones, set-top boxes, digital televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, and the like. In some implementations, source device 12 and destination device 14 are equipped with wireless communication capabilities.

[0024] In some implementations, destination device 14 may receive the encoded video data to be decoded via link 16. Link 16 may include any type of communication medium or device capable of moving the encoded video data from source device 12 to destination device 14. In one example, link 16 may include a communication medium to enable source device 12 to transmit the encoded video data directly to destination device 14 in real time. The encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to destination device 14. The communication medium may include any wireless or wired communication medium, such as, for example, the radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as, for example, a local area network, a wide area network, or a global network, such as, for example, the Internet. The communication medium may include routers, switches, base stations, or any other equipment that may be useful in facilitating communication from source device 12 to destination device 14.

[0025] In some other implementations, the encoded video data may be transmitted from the output interface 22 to the storage device 32. The encoded video data in the storage device 32 may then be accessed by the destination device 14 via the input interface 28. The storage device 32 may include any of a variety of distributed or locally accessed data storage media, such as a hard drive, a Blu-ray disc, a digital versatile disc (DVD), a compact disc read-only memory (CD-ROM), a flash memory, a volatile or non-volatile memory, or any other suitable digital storage medium for storing the encoded video data. In a further example, the storage device 32 may correspond to a file server or other intermediate storage device that may hold the encoded video data generated by the source device 12. The destination device 14 may access the stored video data from the storage device 32 by streaming or downloading. The file server may be any type of computer capable of storing the encoded video data and transmitting the encoded video data to the destination device 14. Exemplary file servers include web servers (e.g., for websites), file transfer protocol (FTP) servers, network attached storage (NAS) devices, or local disk drives. Destination device 14 may access the encoded video data over any standard data connection suitable for accessing the encoded video data stored in a file server, including a wireless channel (e.g., a Wireless Fidelity (Wi-Fi) connection), a wired connection (e.g., a Digital Subscriber Line (DSL), cable modem, etc.), or a combination of both. Transmission of the encoded video data from storage device 32 may be a streaming transmission, a download transmission, or a combination of both.

[0026] As shown in FIG. 1A, source device 12 includes video source 18, video encoder 20, and output interface 22. Video source 18 may include sources such as, for example, a video capture device of a video camera, a video archive containing captured video, a video feed interface for receiving video from a video content provider, and / or a computer graphics system for generating computer graphics data as source video, or a combination of such sources. As an example, if video source 18 is a video camera of a security surveillance system, source device 12 and destination device 14 may form a camera phone or video phone. However, the implementations described in this application may be applicable to video encoding in general and may be applied to wireless and / or wired applications.

[0027] Captured, pre-captured, or computer-generated video may be encoded by video encoder 20. The encoded video data may be transmitted directly to destination device 14 via output interface 22 of source device 12. The encoded video data may also (or alternatively) be stored in storage device 32 for later access by destination device 14 or other devices for decoding and / or playback. Output interface 22 may further include a modem and / or a transmitter.

[0028] Destination device 14 includes an input interface 28, a video decoder 30, and a display device 34. Input interface 28 may include a receiver and / or modem to receive encoded video data over link 16. The encoded video data communicated over link 16 or provided on storage device 32 may include various syntax elements generated by video encoder 20 for use by video decoder 30 in decoding the video data. Such syntax elements may be included within the encoded video data transmitted over a communications medium, stored on a storage medium, or stored on a file server.

[0029] In some implementations, destination device 14 may include a display device 34, which may be an integrated display device, as well as an external display device configured to communicate with destination device 14. Display device 34 displays the decoded video data to a user and may include any of a variety of display devices, such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or other types of display devices.

[0030] Video encoder 20 and video decoder 30 may operate according to a proprietary or industry standard, e.g., VVC, HEVC, MPEG-4, Part 10, AVC, or extensions of such standards. It should be understood that the present application is not limited to a particular video encoding / decoding standard and may be applicable to other video encoding / decoding standards. It is generally contemplated that video encoder 20 of source device 12 may be configured to encode video data according to any of these current or future standards. Similarly, it is generally contemplated that video decoder 30 of destination device 14 may be configured to decode video data according to any of these current or future standards.

[0031] Each of the video encoder 20 and the video decoder 30 may be implemented as any of a variety of suitable encoder and / or decoder circuits, 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. If implemented partially in software, an electronic device may store instructions of the software on a suitable non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the video encoding / decoding operations disclosed in this disclosure. Each of the video encoder 20 and the video decoder 30 may be included in one or more encoders or decoders, any of which may be integrated into the respective device as part of a combined encoder / decoder (CODEC).

[0032] Similar to HEVC, VVC is built on a block-based hybrid video coding framework. FIG. 1B is a block diagram illustrating a block-based video encoder according to some implementations of the present disclosure. In the encoder 100, the input video signal is processed by blocks called coding units (CUs). The encoder 100 may be the video encoder 20 shown in FIG. 1A. In VTM-1.0, a CU can be up to 128x128 pixels. However, unlike HEVC, which splits blocks based on quadtrees only, in VVC, one coding tree unit (CTU) is split into CUs based on quadtrees / binarytrees / tertiles to adapt to different local characteristics. Furthermore, the concept of multiple split unit types in HEVC is eliminated, i.e., the separation of CUs, prediction units (PUs), and transform units (TUs) no longer exists in VVC, and instead, each CU is always used as the basic unit for both prediction and transformation without further splitting. In the multi-type tree structure, a CTU is first divided into a quadtree structure, and then each quadtree leaf node can be further divided into a binary tree structure and a ternary tree structure.

[0033] 3A-3E are schematic diagrams illustrating multi-type tree splitting modes according to some implementations of the present disclosure, each showing five split types including 4-way split (FIG. 3A), 2-way vertical split (FIG. 3B), 2-way horizontal split (FIG. 3C), 3-way vertical split (FIG. 3D), and 3-way horizontal split (FIG. 3E).

[0034] For each given video block, spatial prediction and / or temporal prediction may be performed. Spatial prediction (or "intra prediction") predicts the current video block using pixels from samples of already coded neighboring blocks (these are called reference samples) in the same video picture / slice. Spatial prediction reduces spatial redundancy inherent in the video signal. Temporal prediction (also called "inter prediction" or "motion compensated prediction") predicts the current video block using reconstructed pixels from already coded video pictures. Temporal prediction reduces temporal redundancy inherent in the video signal. The temporal prediction signal for a given CU is typically signaled by one or more motion vectors (MVs), which indicate the amount and direction of motion between the current CU and its temporal references. Also, if multiple reference pictures are supported, one reference picture index is additionally sent, which is used to identify which reference picture in the reference picture store the temporal prediction signal is for.

[0035] After spatial prediction and / or temporal prediction, an intra / inter mode decision circuit 121 in the encoder 100 chooses the best prediction mode, for example based on a rate-distortion optimization method. A block predictor 120 is then subtracted from the current video block, and the resulting prediction residual is decorrelated using the transform circuit 102 and the quantization circuit 104. The resulting quantized residual coefficients are inverse quantized by the inverse quantization circuit 116 and inverse transformed by the inverse transform circuit 118 to form a reconstructed residual, which is then added back to the prediction block to form a reconstructed signal for the CU. Additionally, in-loop filtering 115, such as a deblocking filter, sample adaptive offset (SAO), and / or an adaptive in-loop filter (ALF), may be applied to the reconstructed CU, which is then placed into a reference picture store in a picture buffer 117 and used to encode future video blocks. To form the output video bitstream 114, the coding mode (inter or intra), prediction mode information, motion information, and quantized residual coefficients are all sent to the entropy coding unit 106 to be further compressed and packed to form the bitstream.

[0036] For example, a deblocking filter is available in AVC, HEVC, as well as the latest version of VVC. HEVC defines an additional in-loop filter called SAO to further improve coding efficiency. Yet another in-loop filter called ALF is being actively researched for the latest version of the VVC standard and has a good chance of being included in the final standard.

[0037] These in-loop filter operations are optional. Performing these operations helps improve coding efficiency and visual quality. They can also be turned off as a decision made by the encoder 100 to save computational complexity.

[0038] Note that intra prediction is usually based on unfiltered reconstructed pixels, while inter prediction is based on filtered reconstructed pixels if these filter options are turned on by the encoder 100.

[0039] FIG. 2 is a block diagram illustrating a block-based video decoder 200 that may be used in conjunction with many video coding standards. The decoder 200 is similar to the reconstruction-related portion present in the encoder 100 of FIG. 1B. The block-based video decoder 200 may be the video decoder 30 shown in FIG. 1A. In the decoder 200, an incoming video bitstream 201 is first decoded by entropy decoding 202 to derive quantized coefficient levels and prediction-related information. The quantized coefficient levels are then processed by inverse quantization 204 and inverse transform 206 to obtain a reconstructed prediction residual. A block prediction mechanism implemented in an intra / inter mode selector 212 is configured to perform either intra prediction 208 or motion compensation 210 based on the decoded prediction information. A set of unfiltered reconstructed pixels is obtained by summing the reconstructed prediction residual from the inverse transform 206 using a summer 214 with the prediction output generated by the block prediction mechanism.

[0040] The reconstructed blocks may further pass through an in-loop filter 209 and then be stored in a picture buffer 213, which acts as a reference picture store. The reconstructed video in the picture buffer 213 may be sent to drive a display device and may also be used to predict future video blocks. In the situation where the in-loop filter 209 is turned on, a filtering operation is performed on these reconstructed pixels to derive the final reconstructed video output 222.

[0041] In the current VVC and AVS3 standards, the motion information of the current coding block is either copied from spatial or temporal neighboring blocks specified by the merge candidate index, or obtained by explicit signaling of motion estimation. The focus of this disclosure is to improve the accuracy of motion vectors in affine merge mode by improving the derivation method of affine merge candidates. To facilitate the description of this disclosure, the existing affine merge mode design in the VVC standard is used as an example to explain the proposed idea. Although the existing affine mode design in the VVC standard is used as an example throughout this disclosure, it should be noted that for those skilled in the art of modern video coding technology, the proposed technology may also be applied to affine motion prediction modes of different designs, or other coding tools with the same or similar design ideas.

[0042] In a typical video encoding process, a video sequence typically contains an ordered set of frames or pictures. Each frame may contain three sample arrays, denoted as SL, SCb, and SCr. SL is a two-dimensional array of luma samples. SCb is a two-dimensional array of Cb chroma samples. SCr is a two-dimensional array of Cr chroma samples. In another example, a frame may be monochrome and therefore contain only one two-dimensional array of luma samples.

[0043] As shown in FIG. 1C, video encoder 20 (or more specifically, a partitioning unit in a prediction processing unit of video encoder 20) generates an encoded representation of a frame by first partitioning the frame into a set of CTUs. A video frame may include an integer number of CTUs arranged consecutively from left to right and top to bottom in raster scan order. Each CTU is the largest logical coding unit, and the width and height of the CTUs are signaled by video encoder 20 in the sequence parameter set such that all CTUs in a video sequence have the same size, which is one of 128×128, 64×64, 32×32, and 16×16. However, it should be noted that the present application is not necessarily limited to a particular size. As shown in FIG. 1D, each CTU may include one CTB of luma samples, two corresponding coding tree blocks of chroma samples, and syntax elements used to code the samples of the coding tree blocks. The syntax elements describe the properties of various types of units of blocks of coded pixels and how a video sequence may be reconstructed at video decoder 30, including inter or intra prediction, intra prediction mode, motion vectors, and other parameters. For monochrome pictures or pictures with three separate color planes, a CTU may contain a single coding tree block and syntax elements used to code samples for that coding tree block. A coding tree block may be a block of N by N samples.

[0044] To achieve better performance, video encoder 20 may recursively perform tree partitioning, such as binary tree partitioning, ternary tree partitioning, quad tree partitioning, or a combination thereof, on the coding tree blocks of the CTU to partition the CTU into smaller CUs. As shown in FIG. 1E, 64×64 CTU 400 is first partitioned into four smaller CUs, each with a block size of 32×32. Of the four smaller CUs, CU 410 and CU 420 are each partitioned into four CUs with a block size of 16×16. The two 16×16 CUs 430 and 440 are each further partitioned into four CUs with a block size of 8×8. FIG. 1F illustrates a quad tree data structure illustrating the final result of the partitioning process of CTU 400 illustrated in FIG. 1E, where each leaf node of the quad tree corresponds to one CU of a respective size ranging from 32×32 to 8×8. Similar to the CTU shown in FIG. 1D, each CU may include two corresponding coding blocks of luma samples and chroma samples of the same size frame, as well as syntax elements used to code the samples of the coding block. In a monochrome picture or a picture with three separate color planes, a CU may include a single coding block and syntax structures used to code the samples of the coding block. It should be noted that the quadtree partitioning shown in FIG. 1E-FIG. 1F is for illustrative purposes only, and one CTU may be partitioned into CUs based on quadtree / ternary tree / binary tree partitioning to adapt to various local characteristics. In a multi-type tree structure, one CTU is partitioned by a quadtree structure, and each quadtree leaf CU can be further partitioned by binary tree structure and ternary tree structure. As shown in FIG. 3A-FIG. 3E, there are five possible partition types of a coding block with width W and height H, namely, 4-partition, horizontal 2-partition, vertical 2-partition, horizontal 3-partition, and vertical 3-partition.

[0045] In some implementations, video encoder 20 may further divide the coding blocks of a CU into one or more M×N PBs. A PB is a rectangular (square or non-square) block of samples to which the same inter or intra prediction is applied. A PU of a CU may include a PB of luma samples and two corresponding PBs of chroma samples and syntax elements used to predict the PB. In a monochrome picture or a picture with three separate color planes, a PU may include a single PB and syntax structures used to predict that PB. Video encoder 20 may generate predictive luma, Cb, and Cr blocks for the luma, Cb, and Cr PBs of each PU of a CU.

[0046] Video encoder 20 may use intra prediction or inter prediction to generate the predictive blocks of a PU. If video encoder 20 uses intra prediction to generate the predictive blocks of a PU, video encoder 20 may generate the predictive blocks of the PU based on decoded samples of a frame associated with the PU. If video encoder 20 uses inter prediction to generate the predictive blocks of a PU, video encoder 20 may generate the predictive blocks of the PU based on decoded samples of one or more frames other than the frame associated with the PU.

[0047] After video encoder 20 generates the predictive luma, Cb, and Cr blocks for one or more PUs of a CU, video encoder 20 may generate a luma residual block for the CU by subtracting the predictive luma block of the CU from its original luma coding block, where each sample in the luma residual block of the CU indicates a difference between a luma sample in one of the predictive luma blocks of the CU and a corresponding sample in the original luma coding block of the CU. Similarly, video encoder 20 may generate a Cb residual block and a Cr residual block for the CU, where each sample in the Cb residual block of the CU indicates a difference between a Cb sample in one of the predictive Cb blocks of the CU and a corresponding sample in the original Cb coding block of the CU, and each sample in the Cr residual block of the CU indicates a difference between a Cr sample in one of the predictive Cr blocks of the CU and a corresponding sample in the original Cr coding block of the CU.

[0048] Further, as shown in FIG. 1E, video encoder 20 may use quadtree partitioning to decompose the luma, Cb, and Cr residual blocks of a CU into one or more luma, Cb, and Cr transform blocks, respectively. A transform block is a rectangular (square or non-square) block of samples to which the same transform is applied. A TU of a CU may include a transform block of luma samples and two corresponding transform blocks of chroma samples and syntax elements used to transform the transform block samples. Thus, each TU of a CU may be associated with a luma transform block, a Cb transform block, and a Cr transform block. In some examples, the luma transform block associated with a TU may be a sub-block of the luma residual block of the CU. The Cb transform block may be a sub-block of the Cb residual block of the CU. The Cr transform block may be a sub-block of the Cr residual block of the CU. In a monochrome picture or a picture with three separate color planes, a TU may include a single transform block and syntax structures used to transform samples of that transform block.

[0049] Video encoder 20 may apply one or more transforms to a luma transform block of the TU to generate a luma coefficient block of the TU. The coefficient block may be a two-dimensional array of transform coefficients. The transform coefficients may be scalar quantities. Video encoder 20 may apply one or more transforms to a Cb transform block of the TU to generate a Cb coefficient block of the TU. Video encoder 20 may apply one or more transforms to a Cr transform block of the TU to generate a Cr coefficient block of the TU.

[0050] After generating a coefficient block (e.g., a luma coefficient block, a Cb coefficient block, or a Cr coefficient block), the video encoder 20 may quantize the coefficient block. Quantization generally refers to a process in which transform coefficients are quantized to minimize the amount of data used to represent the transform coefficients to achieve further compression. After the video encoder 20 quantizes the coefficient block, the video encoder 20 may entropy code syntax elements indicating the quantized transform coefficients. For example, the video encoder 20 may perform CABAC on the syntax elements indicating the quantized transform coefficients. Finally, the video encoder 20 may output a bitstream including a sequence of bits forming a representation of the encoded frame and associated data, which may be stored in the storage device 32 or transmitted to the destination device 14.

[0051] After receiving the bitstream generated by video encoder 20, video decoder 30 may parse the bitstream to obtain syntax elements from the bitstream. Video decoder 30 may reconstruct a frame of video data based at least in part on the syntax elements obtained from the bitstream. The process of reconstructing video data is generally reciprocal to the encoding process performed by video encoder 20. For example, video decoder 30 may perform an inverse transform on coefficient blocks associated with TUs of the current CU to reconstruct residual blocks associated with TUs of the current CU. Also, video decoder 30 may reconstruct coding blocks of the current CU by adding samples of predictive blocks of PUs of the current CU to corresponding samples of transform blocks of TUs of the current CU. After reconstructing the coding blocks for each CU of the frame, video decoder 30 may reconstruct the frame.

[0052] As mentioned above, video coding mainly uses two modes to achieve video compression: intraframe prediction (or intra prediction) and interframe prediction (or inter prediction). It should be noted that IBC can be considered as intraframe prediction or a third mode. Between the two modes, interframe prediction contributes more to coding efficiency than intraframe prediction because it uses motion vectors to predict a current video block from a reference video block.

[0053] However, as video data capture technology improves day by day and video block sizes become finer to preserve the details of the video data, the amount of data required to represent the motion vectors of the current frame also increases significantly. One way to overcome this challenge is to benefit from the fact that a group of neighboring CUs in both spatial and temporal domains not only have similar video data for prediction, but also the motion vectors between these neighboring CUs are similar. Therefore, the motion information of spatially neighboring CUs and / or temporally co-located CUs can be used as an approximation of the motion information (e.g., motion vector) of the current CU by examining their spatial and temporal correlations, which is also called the "Motion Vector Predictor (MVP)" of the current CU.

[0054] As described above in connection with FIG. 1B, instead of encoding the actual motion vector of the current CU determined by the motion estimation unit into the video bitstream, the motion vector predictor of the current CU is subtracted from the actual motion vector of the current CU to generate a Motion Vector Difference (MVD) of the current CU. In this way, it is not necessary to encode the motion vector determined by the motion estimation unit for each CU of a frame into the video bitstream, and the amount of data used to represent the motion information in the video bitstream can be significantly reduced.

[0055] Similar to the process of choosing a predictive block in a reference frame during inter-frame prediction of a codeblock, a motion vector candidate list (also known as a "merge list") for the current CU needs to be constructed using potential candidate motion vectors associated with CUs in the spatial neighborhood and / or temporally co-located CUs of the current CU, and then a set of rules needs to be chosen by both the video encoder 20 and the video decoder 30 for selecting one member from the motion vector candidate list as the motion vector predictor for the current CU. By doing so, the motion vector candidate list itself does not need to be transmitted from the video encoder 20 to the video decoder 30, and the index of the selected motion vector predictor in the motion vector candidate list is sufficient for the video encoder 20 and the video decoder 30 to use the same motion vector predictor in the motion vector candidate list to encode and decode the current CU.

[0056] The main objective of this disclosure is to increase the efficiency of CABAC techniques used in hybrid video coding frameworks. Specifically, several improvements are proposed to increase the accuracy of the probability estimation of sequences of binary symbols (aka bins for short) of syntax elements generated when compressing a video signal. In the following, a detailed analysis of existing CABAC techniques applied in modern video coding standards such as AVC, HEVC, and VVC is first provided. Then, several deficiencies / limitations of existing CABAC designs are discussed. Afterwards, a method is proposed to improve CABAC efficiency through increasing the accuracy of the probability estimation.

[0057] Probability Estimation Techniques for CABAC in AVC and HEVC CABAC was originally introduced in the H.264 / AVC standard as one of two supported entropy coding schemes. In CABAC, the arithmetic coding consists of two modules: codeword mapping (also known as binarization) and probability estimation. In the process of codeword mapping, syntax elements are mapped to a sequence of bins. The mapping is realized by a so-called binarizer, which converts syntax elements into groups of bins based on various binarization schemes. In practice, various binarization schemes such as fixed-length codes, unary codes, truncated unary codes, and k-th order exponential-Golomb codes can be applied to such conversion. The purpose of the probability estimation module is to determine the likelihood that a bin has a value of 1 or 0. In AVC, the bin probabilities are calculated based on an exponential aging model, in which the probability that a current bin is equal to 1 or 0 depends on the values ​​of the previous bins that have been coded. Moreover, according to general data statistics, the influence of the bins immediately preceding a current bin is usually larger than that of the bins coded much earlier. Considering this, CABAC introduces one parameter α that controls the number of coded bins N used to estimate the probability of the current bin, i.e., N=1 / α. This parameter translates into an adaptation rate at which the probability is updated with an increasing number of coded bins. Specifically, using the adaptation parameter α, the probability that a bin is the least probable symbol (LPS) is calculated recursively as follows: p(t+1)=p(t)·(1-α)+x(t)·α (1) where p(t) is the probability of the LPS symbol at instant t, p(t+1) is the updated probability of the LPS symbol at instant t+1, and x(t) is equal to 1 if the current bin is the LPS symbol, and equal to 0 if the current bin is the most probable symbol (MPS). In the AVC and HEVC CABAC engines, this probability is updated independently for each syntax element with a fixed value of α≈1 / 19.69 according to (1), i.e., when estimating the probability of one current bin, approximately 19.69 coded bins are considered. Furthermore, to avoid multiplication during probability estimation, the probability p(t) in equation (1), which is real and ranges from 0 to 1, is quantized to a set of fixed probability states. For example, in both AVC and HEVC, the probability has a precision of 7 bits, which corresponds to 128 probability states.

[0058] In AVC and HEVC, a video bitstream typically consists of one or more independently decodable slices. At the beginning of each slice, the probabilities of all contexts are initialized to some predefined value. In theory, if the statistical properties of one given context are known, then it is possible to estimate the probability distribution of the contexts by a uniform distribution (i.e., p init = 0.5) should be used to initialize the probabilities of the contexts. However, it has been found to be beneficial to provide each context with some appropriate initial probability values ​​(which may not be equal probabilities) to make the probability of one context quickly catch up to its corresponding statistical distribution. Specifically, in AVC and HEVC, given the initial QP of one slice, SliceQPY, the initial probability state of one context, InitProbState, is calculated as follows: m=SlopeIdx·5-45 n=(OffsetIdx<<3)-16 InitProbState=Clip3(1,127,(m·SliceQP Y )>>4+n) (2) Here, SlopeIdx and OffsetIdx (both in the range of 0 to 15) are two initialization parameters, which are predefined and stored as a look-up table (LUT) to calculate the initial probability of one context. As shown in equation (2), the initial probability state is modeled by a linear function of slice QP with slope equal to (m>>4) and offset equal to n.

[0059] Probability Estimation Technique of CABAC in VVC The probability estimation module applied in VVC is kept almost the same as that in AVC and HEVC, except for the following important differences: first, VVC keeps two probability estimates per context, each with its own probability adaptation rate α in equation (1). The final probability actually used for arithmetic coding is the average of the two estimates; second, in VVC, multiple probability LUTs are predefined and used to initialize the probabilities of different contexts of one slice. Meanwhile, similar to AVC and HEVC, the initial estimates of the probabilities are constructed based on one linear model with the slice QP as input. However, in VVC, the derived values ​​represent the actual probability values, while in AVC / HEVC, they represent the indexes of the probability states.

[0060] Multiple hypothesis probability estimation It is clear that using one fixed adaptation parameter for all syntax elements may not be optimal due to their different statistical properties. On the other hand, some scientific studies have found that using multiple probability estimators can achieve higher estimation accuracy compared to a single estimator. Therefore, one multi-hypothesis probability estimation scheme is applied in the CABAC design of VVC, in which two different adaptation parameters α0 and α1 corresponding to low and high rates of probability adaptation are utilized. In this way, using two adaptation parameters, two different probabilities can be calculated for each bin, which are then averaged to generate the final probability of the bin, i.e., p0(t+1)=p0(t)·(1-α0)+x(t)·α0 p1(t+1)=p1(t)·(1-α1)+x(t)·α1 p(t+1)=(p0(t+1)+p1(t+1)) / 2 (3) where α0 and α1 are two adaptive parameters associated with two probability hypotheses. In VVC, the values ​​of α0 and α1 are selected independently for each context using a training algorithm designed to jointly optimize the adaptive parameters as well as the initial probabilities. Specifically, according to the current design, each context is allowed to choose α0 from one predefined set of values ​​{1 / 4, 1 / 8, 1 / 16, 1 / 32} and α1 from another predefined set of values ​​{1 / 32, 1 / 64, 1 / 128, 1 / 256, 1 / 512}.

[0061] Initial probability calculation Similar to AVC / HEVC, the CABAC process in VVC also invokes one QP-dependent probability initialization process at the beginning of each slice. However, compared to AVC / HEVC, which initializes the states of one probability state machine, the actual values ​​of the initial probabilities are directly derived as follows:

number

number

number

[0062] Problem statement Compared with the CABAC design of AVC / HEVC, the probability estimation scheme of VVC can capture the true statistical distribution of each context bin more accurately, leading to improved CABAC efficiency. However, the design can still be further improved. Specifically, this disclosure identifies the following deficiencies that exist in the current probability estimation of the CABAC process of VVC:

[0063] First, as discussed above, in VVC, a multi-hypothesis based probability estimation scheme is applied, where two probability estimators (one with a fast adaptation rate and the other with a slow adaptation rate) estimate the probability of the bins of each context model. Moreover, in existing designs, the probability of one bin is just a simple average of the two probability estimators. Considering that the fixed weights may not be flexible enough to adapt to various data statistics in different contexts, such designs are suboptimal.

[0064] On the other hand, according to the existing VVC design, the probabilities of all contexts in one slice are initialized based on three sets of pre-determined initial context values ​​for different slice types (i.e., I, B, and P slices). Among them, the set of initial context values ​​for I slice type is allowed to be used only for I slices, and the set of initial context values ​​for B and P slices is allowed to be used for either B or P slices. The bins of each video bitstream usually exhibit very different statistical properties from each other due to their inherent characteristics. Therefore, using only three fixed sets of initial context values ​​seems far from optimal to provide an efficient starting point for the probability estimator to quickly capture the true probability distribution of each context. On the other hand, due to the strong temporal correlation within one video sequence, the probability statistics of contexts from slices coded before the current slice may be able to provide more accurate estimates for initializing the probabilities of contexts in the current slice.

[0065] In this disclosure, methods are proposed to solve the problems / deficiencies of existing probability estimation schemes in VVC. Specifically, the following methods are proposed to further improve the probability estimation accuracy while considering compatibility with hardware codec implementation.

[0066] First, a binary arithmetic coding with weighted multiple hypothesis probability updates is proposed to improve the accuracy of probability estimation. Specifically, instead of using a simple average, the final probability used to code one bin of each context is calculated as one weighted combination of two probability estimators p0 and p1 associated with that context. Furthermore, several initialization methods are proposed to indicate the initial weight parameters of the contexts at the beginning of one slice.

[0067] Secondly, an improved initialization scheme is proposed for initializing the state parameters of the context of an inter-coded slice. Specifically, in addition to using the existing fixed context initialization table, the proposed scheme allows the state parameters of the context in one inter-coded slice (e.g., two probability estimators, an adaptation rate, and a weight coefficient of the combination of the two probability estimators) to be initialized to be copied from the corresponding state parameters of a coded slice.

[0068] Multiple hypothesis probability estimation using adaptive weights. In VVC, a multi-hypothesis probability estimation is applied, and the final probability when encoding each bin of one context is calculated as the average of two probability estimators. Considering the inherent statistical properties of different video bitstreams, it is obvious that such a scheme (i.e., using equal weights (i.e., 0.5)) may not always be flexible enough to capture the true symbol statistics when combining two probability estimators of one context. Therefore, in this section, we propose a multi-hypothesis probability estimation with adaptive weights (MHP-AW) scheme to further improve the probability estimation accuracy of VVC. Specifically, similar to the CABAC design of VVC, two separate probability estimators p0 and p1 are kept for each context and updated based on their own adaptation rates α0 and α1. However, instead of using a fixed average, multiple weight parameters are introduced in the proposed scheme, and the final probability p used for binary arithmetic coding of one context is derived based on a weighted combination of the two probability estimators. In detail, the proposed probability estimation can be formulated as follows: p0(t+1)=p0(t)·(1-α0)+x(t)·α0 p1(t+1)=p1(t)·(1-α1)+x(t)·α1 p(t+1)=(1-ω)·p0(t)+ω·p1(t) (5) where ω is the weight used to combine the two probability estimates, and its value is taken from the range [0,1]. In equation (5), the weight ω represents a real value, which needs to be quantized to an integer for hardware / software codec implementation. In practice, various methods can be applied to convert the value of ω to an integer. For example, to approximate the actual weight value, a quantization step q step A uniform quantizer using ω=ω int ·q step(6) Here, ω int are integer weight values. Furthermore, the quantization step, which is also a real value, can be approximated as a single right shift operation of M bits as follows: ω=ω int ·q step =ω int >>M (7)

[0069] As shown in Equation (7), the proposed MHP-AW scheme is implemented in hardware / software with an integer weight value ω int Additional memory is required to store the set of weights M, M = 1, M = 2 ...

[0070] Similar to the probability and adaptation rate, in the proposed MHP-AW scheme, the weights ω intOne initial value of needs to be provided per context at the beginning of one slice. In the following, various schemes are proposed for the initialization of MHP-AW weights. In the first method, it is proposed to define several different predefined tables, each table containing a set of weight initialization values ​​for all contexts in one slice. Before encoding / decoding one slice, one predefined table may be selected and the corresponding MHP-AW weights are initialized based on the corresponding weight values ​​of the table. For example, in one embodiment, several slice type dependent initial weight tables may be derived, e.g., three sets of weight initialization tables specifically designed for I, P and B slices. In this way, for one slice, the video encoder may select one from the three predefined tables to initialize the MHP-AW weights to better adapt to the symbol statistics in the slice. If such a scheme is applied, one additional syntax element sh_cabac_weight_init_idx may be signaled per slice, which indicates which initial weight table is selected for that slice, as shown in Table 1 below,

[0071] [Table 1] Here, the syntax pps_cabac_weight_init_present_flag is one control flag signaled in the Picture Parameter Set (PPS) indicating whether it is allowed to select a different initial weight table per slice. If this flag is enabled, another syntax sh_cabac_weight_init_idx is further signaled at slice level to indicate the selected initial weight table. In another embodiment, it is proposed to only allow the MHP-AW weights of I slices to be initialized by the initial weight table associated with the I slice type, and the MHP-AW weights of P and B slices to be initialized from one of the predefined weight initialization tables. Specifically, it is proposed to only allow one P (or B) slice to be initialized with the initial weight table of the B (or P) slice type in addition to the initial weight table associated with the slice type of the current slice. Correspondingly, in such a case, only one flag needs to be signaled per slice for the initial table selection of the MHP-AW weights of P / B slices, as shown in Table 2 below.

[0072] [Table 2] When the flag sh_cabac_weight_init_flag is equal to 0, it means that the initial weight table corresponding to the slice type of the current slice is used to initialize the MHP-AW weight value of the slice, and when the flag is equal to 1, it means that if the current slice is a B slice, the initial weight table corresponding to the P slice type is used to initialize the MHP-AW weight value of the slice, and if the current slice is a P slice, the initial weight table corresponding to the B slice type is used to initialize the MHP-AW weight value of the slice.

[0073] Furthermore, in another embodiment of the present disclosure, it is proposed to extend the existing CABAC initialization table to include MHP-AW weights corresponding to each context. Specifically, after such modification, each element of one CABAC initialization table includes three different categories of information, including: 1) initial probability value; 2) adaptation rate used to initialize the probability and adaptation speed of two probability hypotheses; and 3) MHP-AW weight used to combine the two hypotheses when updating the probability of each context. Similar to the existing VVC design, when such a scheme is applied, multiple CABAC initialization tables may be pre-determined, and syntax elements may be signaled from the encoder to the decoder to inform which initialization table is selected for each slice to initialize the two probabilities, two adaptation rates, and corresponding values ​​of the combining weights associated with each slice. In one particular embodiment, it is proposed to reuse the existing CABAC initialization syntax elements, namely, pps_cabac_init_present_flag and sh_cabac_init_flag, to indicate the selection of the CABAC initialization table in a slice. When such a method is applied, the CABAC states (i.e., probabilities, adaptation rates, and combining weights) of an I slice are only allowed to be initialized by an I slice type initialization table, and the CABAC states of a P (or B) slice are allowed to be initialized by a B (or P) slice type initialization table. In another embodiment, it is proposed to predetermine several (>3) CABAC tables and allow the CABAC states of one slice to be arbitrarily initialized from one of the predefined tables.

[0074] In all the above methods, a fixed value is used to initialize the MHP-AW weights of a context when encoding one slice, which may not be accurate enough to provide reliable probability estimation for arithmetic coding. To solve such problems, it is proposed to give the encoder the flexibility to calculate the optimal MHP-AW weights for each slice and signal the corresponding optimal MHP-AW weights to the decoder.

[0075] In one embodiment, it is proposed to directly signal the weight value of each context element. For example, one flag may be signaled first to indicate whether the MHP-AW weights of the contexts in the slice are initialized with one fixed initialization table or not. If the flag is equal to 1, another syntax element may be signaled to inform the decoder which weight initialization table is applied to the current slice, otherwise, i.e., if the flag is equal to 0, the MHP-AW weights of the contexts in the slice are initialized by values ​​parsed from the bitstream. In practice, various binarization methods may be applied to generate the codewords of the MHP-AW weight values, such as, for example, fixed-length codes, unary codes, k-th order exponential-Golomb codes, etc.

[0076] In another embodiment, one adaptive signaling method is proposed. Specifically, at the beginning of each slice, the scheme first transmits a binary map weightMap[] from the encoder to the decoder, where each element indicates whether the corresponding context uses the initialized weight value from the selected default initialization weight table or not. If the i-th weightMap[] map entry is equal to 0, this means that the MHP-AW weight of the i-th context of the current slice is initialized by the corresponding value in the selected initialization weight table. If the i-th weightMap[] map entry is equal to 1, this means that the MHP-AW weight of the i-th context of the current slice is initialized by the initial value indicated in the bitstream. Various methods can be applied to encode the map weightMap[]. In one example, it is proposed to use run-length encoding to encode the binary values ​​of the map, and one "run" value is transmitted to indicate the number of consecutive 0s (or 1s) before encountering one 1 (or 0).

[0077] Inheriting initial CABAC states from previously coded slices As discussed above, symbols of the same context in different video bitstreams usually exhibit quite different statistical characteristics. We assume that the probability state is fixed in a predefined CABAC table and cannot adapt to the unique features of various slices. If the predefined initial table deviates from the true symbol statistics of the video bitstream, the coding efficiency may decrease. To improve the CABAC efficiency, an improved CABAC initialization scheme is proposed to initialize the context from the context state after encoding / decoding one previous slice. There can be various ways to identify the previous slice for CABAC initialization.

[0078] In one embodiment, it is proposed to maintain output context states of the N coded slices. When one current slice is coded, the video encoder selects the best one from the N coded slices and signals an index to the decoder to initialize the context of the current slice from the corresponding context state of the selected coded slice (indicated by the signaled index value).

[0079] In other embodiments, instead of directly signaling the selected coded slice in the bitstream, some implicit decoder-side selection schemes may be applied to select the corresponding coded slice for context initialization of the current slice, including:

[0080] Rule #1: It is proposed to directly select the slice that is coded immediately before the slice according to the coding order.

[0081] Rule #2: It is suggested to select the already coded slice that is closest to the current slice in order and has the same slice type.

[0082] Rule #3: It is proposed to select the already coded slice that is closest to the current slice according to the order and has the smallest QP difference with the current slice.

[0083] Rule #4: It is proposed to select the already coded slice that is closest in order to the current slice and has the same temporal layer as the current slice.

[0084] Although the above implicit selection rules are proposed separately, they may be combined and applied together in the proposed initial CABAC state inheritance scheme. In one particular example, it is proposed to combine rules #2, #3, and #4 together. Specifically, based on such a combination, the encoder / decoder may select a previously coded slice of the same slice type that is closest to the current slice according to the coding order and has the smallest QP difference with the current slice. If no such previously coded slice exists, one of the existing predefined CABAC initialization tables may be applied to initialize the context state of the current slice.

[0085] Furthermore, in the proposed inheritance-based context initialization scheme, the inherited context state may include various categories of state information, e.g., probability values, adaptation rates, and combining weights (if the proposed MHP-AW scheme is applied). In one embodiment of the present disclosure, it is proposed to inherit only one state information from the selected coded slice, and other state information of the current slice is initialized using an existing predefined CABAC initialization table. In another embodiment, it is proposed to inherit only two state information from the selected coded slice. In yet another embodiment, it is proposed to inherit all state information of the current slice from the corresponding context state of the selected coded slice.

[0086] The above inheritance-based CABAC initialization can improve the efficiency of context initialization, but it may introduce parse dependencies between different slices, since the entropy coding of one current slice cannot be invoked until the entropy coding of its reference slice (i.e., the selected coded slice) is completely finished.

[0087] To provide better control of entropy coding efficiency and parallelism, an adaptive CABAC initialization scheme is proposed, where the context state of a current slice can be initialized in one of two ways: 1) using one of the predefined CABAC initialization tables, or 2) by the resulting context state of a previously coded slice. Specifically, in the proposed scheme, a binary flag is first signaled at the beginning of a slice. If the flag is equal to zero, this means that the context of the current slice is initialized by one of the existing predefined CABAC initialization tables, e.g., indicated by the syntax element sh_cabac_init_flag. If the flag is equal to one, this means that the inheritance-based context initialization method is applied and the initialization context value is set to the context state output from the selected slice coded before the current slice.

[0088] 4 illustrates a computing environment (or computing device) 410 coupled with a user interface 460. The computing environment 410 may be part of a data processing server. In some embodiments, the computing device 410 may perform any of the various methods or processes (e.g., encoding / decoding methods or processes) previously described in accordance with various examples of the present disclosure. The computing environment 410 may include a processor 420, a memory 440, and an I / O interface 450.

[0089] The processor 420 typically controls the overall operation of the computing environment 410, such as operations associated with display, data acquisition, data communication, and image processing. The processor 420 may include one or more processors for executing instructions for performing all or a portion of the steps in the methods described above. Additionally, the processor 420 may include one or more modules that facilitate interaction between the processor 420 and other components. The processor may be a central processing unit (CPU), a microprocessor, a single chip machine, a GPU, or the like.

[0090] The memory 440 is configured to store various types of data to support the operation of the computing environment 410. The memory 440 may include predefined software 442. Examples of such data include instructions for any application or method run on the computing environment 410, video data sets, image data, etc. The memory 440 may be implemented using any type of volatile or non-volatile memory device, or combination thereof, such as, for example, static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk, or optical disk.

[0091] The I / O interface 450 provides an interface between the processor 420 and a peripheral interface module, such as a keyboard, a click wheel, buttons, etc. These buttons may include, but are not limited to, a home button, a start scan button, and a stop scan button. The I / O interface 450 may be coupled to an encoder and a decoder.

[0092] In some embodiments, a non-transitory computer readable storage medium is also provided that includes a number of programs executable by the processor 420 in the computing environment 410, e.g., contained in the memory 440, for performing the methods described above. For example, the non-transitory computer readable storage medium can be a ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.

[0093] A non-transitory computer-readable storage medium has stored thereon a plurality of programs executed by a computing device having one or more processors, the plurality of programs, when executed by the one or more processors, causing the computing device to perform the method for motion prediction described above.

[0094] In some embodiments, the computing environment 410 may be implemented using one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), graphical processing units (GPUs), controllers, microcontrollers, microprocessors, or other electronic components for performing the methods described above.

[0095] FIG. 5 is a flowchart illustrating a method for video decoding according to an example of this disclosure.

[0096] In step 501, the processor 420 may, at a binary arithmetic decoder side, obtain a multiple hypothesis probability of a binary symbol of a given context model of the binary arithmetic decoder according to an adaptive weight, where the multiple hypothesis probability indicates a probability that the binary symbol is equal to a binary value, and the binary symbol is from a plurality of binary symbols associated with the context model.

[0097] For example, the adaptive weight can be the weight ω in equation (5), which is used to combine the two probability estimates, and whose value is taken from the range [0,1]. In equation (5), the weight ω represents a single real value, which needs to be quantized to an integer for hardware / software codec implementation. In practice, various methods can be applied to convert its value to an integer. Thus, the multiple hypothesis probability is the combination of the two probability estimates using the adaptive weight ω.

[0098] In some examples, the processor 420 may obtain a first probability of one binary symbol according to the first adaptive parameter and a second probability of one binary symbol according to the second adaptive parameter. Further, the processor 420 may obtain a multiple hypothesis probability according to the adaptive weights, the first probability, and the second probability. For example, the first probability may be p0(t+1) in equation (5), and the second probability may be p1(t+1) in equation (5).

[0099] In some examples, the processor 420 may obtain the adaptive weights according to the context model from a set of pre-defined integer weight values ​​in a weight initialization table.

[0100] As discussed in the section "Multiple Hypothesis Probability Estimation with Adaptive Weights", it is proposed to select optimal weights for each context from one predefined set. For example, it is proposed to use the predefined sets of integer weight values ​​{0, 3, 6, 10, 13, 16, 19, 22, 26, 29, 32}, {0, 6, 11, 16, 21, 26, 32}, or {0, 8, 12, 16, 20, 24, 32}.

[0101] In some examples, the decoder may obtain a weight initialization table for each slice type, and in response to determining that the current slice is a first slice type, select a weight initialization table according to the first slice type, the first slice type including an I type, a P type, or a B type, and obtain adaptive weights according to the selected weight initialization table.

[0102] In some examples, in response to determining that the control syntax element is enabled, processor 420 may obtain, at the slice level, an adaptive weight syntax element for each slice that indicates a weight initialization table selected for each slice according to the slice type of each slice.

[0103] In some examples, processor 420 may obtain a first weight initialization table for each I slice, a second weight initialization table for each P slice, and a third weight initialization table for each B slice. Further, processor 420 may select the first weight initialization table in response to determining that the current slice is an I slice, and select the second weight initialization table or the third weight initialization table in response to determining that the current slice is a P slice or a B slice, and obtain adaptive weights according to the selected weight initialization table, which is shown in Table 2. The selected weight initialization table may be one of the first weight initialization table, the second weight initialization table, or the third weight initialization table.

[0104] In step 502, the processor 420 may decode a binary symbol according to multiple hypothesis probabilities.

[0105] FIG. 6 is a flow chart illustrating a method for video encoding that corresponds to the method for video decoding shown in FIG.

[0106] In step 601, the processor 420 may determine, at the binary arithmetic decoder side, a multiple hypothesis probability of a binary symbol of a given context model of the binary arithmetic decoder according to an adaptive weight, where the multiple hypothesis probability indicates a probability that the binary symbol is equal to a binary value, and the binary symbol is from a plurality of binary symbols associated with the context model. For example, the encoder may obtain a multiple hypothesis probability of a binary symbol of a given context model of the binary arithmetic decoder according to an adaptive weight.

[0107] For example, the adaptive weight can be the weight ω in equation (5), which is used to combine the two probability estimates, and its value is taken from the range [0,1]. In equation (5), the weight ω represents a real value, which needs to be quantized to an integer for hardware / software codec implementation. In practice, various methods can be applied to convert the value of the adaptive weight to an integer. Thus, the multiple hypothesis probability is the combination of the two probability estimates using the adaptive weight ω.

[0108] In some examples, the processor 420 may determine a first probability of one binary symbol according to the first adaptive parameter and a second probability of one binary symbol according to the second adaptive parameter. Further, the processor 420 may determine a multiple hypothesis probability according to the adaptive weights, the first probability, and the second probability. For example, the first probability may be p0(t+1) in equation (5), and the second probability may be p1(t+1) in equation (5).

[0109] In some examples, the processor 420 may determine the adaptive weights according to the context model from a set of pre-defined integer weight values ​​in a weight initialization table.

[0110] As discussed in the section "Multiple Hypothesis Probability Estimation with Adaptive Weights", it is proposed to select optimal weights for each context from one predefined set. For example, it is proposed to use the predefined sets of integer weight values ​​{0, 3, 6, 10, 13, 16, 19, 22, 26, 29, 32}, {0, 6, 11, 16, 21, 26, 32}, or {0, 8, 12, 16, 20, 24, 32}.

[0111] In some examples, the decoder may determine a weight initialization table for each slice type, and in response to determining that the current slice is a first slice type, select a weight initialization table according to the first slice type, the first slice type including an I type, a P type, or a B type, and obtain adaptive weights according to the selected weight initialization table.

[0112] In some examples, in response to determining that the control syntax element is enabled, processor 420 may determine, at the slice level, an adaptive weight syntax element for each slice indicating a weight initialization table selected for each slice according to the slice type of each slice.

[0113] In some examples, processor 420 may determine a first weight initialization table for each I slice, a second weight initialization table for each P slice, and a third weight initialization table for each B slice. Further, processor 420 may select the first weight initialization table in response to determining that the current slice is an I slice, and select the second weight initialization table or the third weight initialization table in response to determining that the current slice is a P slice or a B slice, and determine the adaptive weights according to the selected weight initialization table, which is shown in Table 2. The selected weight initialization table may be one of the first weight initialization table, the second weight initialization table, or the third weight initialization table.

[0114] In step 602, the processor 420 may encode a binary symbol according to multiple hypothesis probabilities. For example, the encoder may encode a binary symbol according to multiple hypothesis probabilities.

[0115] FIG. 7 is a flowchart illustrating a method for video decoding according to an example of this disclosure.

[0116] In step 701, the processor 420 may select, at the decoder side, one or more slices that were coded before the current slice.

[0117] For example, as discussed in the "Inheritance of Initial CABAC State from a Previously Coded Slice" section, the one or more slices may be N previously coded slices. When a current slice is coded, the video encoder selects the best one from the N previously coded slices and signals an index to the decoder to initialize the context of the current slice from the corresponding context state of the selected previously coded slice (indicated by the signaled index value).

[0118] In some examples, the one or more slices may include a slice that was encoded immediately before the current slice.

[0119] In some examples, one or more slices may include an uncoded slice immediately preceding the current slice, where the slice satisfies at least one of the following conditions: the slice has the same slice type as the current slice, the slice has a minimum quantization parameter (QP) difference from the current slice, or the slice has the same temporal layer as the current slice.

[0120] For example, some implicit decoder-side selection scheme may be applied to select a corresponding encoded slice for context initialization of the current slice, following rule #1, rule #2, rule #3, rule #4, or any combination of these rules.

[0121] In step 702, the processor 420 may obtain an initial context state of one or more context models of the current slice by inheriting a context state of one or more context models of a slice coded before the current slice.

[0122] By inheriting the context state, one or more context models of the current slice use the context state of one or more context models of one previously coded slice (i.e., one slice coded before the current slice) as the initial context state.

[0123] In some examples, the one or more initial context states may include at least one of a probability value, an adaptation rate, or an adaptation weight parameter.

[0124] For example, the inherited context state may include various categories of state information, e.g., probability values, adaptation rates, and combining weights (if the proposed MHP-AW scheme is applied). In one embodiment of the present disclosure, it is proposed to inherit only one state information from the selected coded slice, and other state information of the current slice is initialized using an existing predefined CABAC initialization table. In another embodiment, it is proposed to inherit only two state information from the selected coded slice. In yet another embodiment, it is proposed to inherit all state information of the current slice from the corresponding context state of the selected coded slice.

[0125] In some examples, the processor 420 may obtain at least one second initial context state for a current slice according to one or more existing context-based adaptive binary arithmetic coding (CABAC) initialization tables, the current slice including the initial context state and the at least one second initial context state. Further, the processor 420 may decode binary symbols in the current slice according to the initial context state and the at least one second initial context state.

[0126] In step 703, the processor 420 may decode binary symbols associated with one or more context models in the current slice according to the initial context state.

[0127] FIG. 8 is a flow chart illustrating a method for video encoding that corresponds to the method for video decoding shown in FIG.

[0128] In step 801, the processor 420 may select, at the encoder side, one or more slices that have been coded before the current slice.

[0129] For example, as discussed in the "Inheritance of Initial CABAC State from a Previously Coded Slice" section, the one or more slices may be N previously coded slices. When a current slice is coded, the video encoder selects the best one from the N previously coded slices and signals an index to the decoder to initialize the context of the current slice from the corresponding context state of the selected previously coded slice (indicated by the signaled index value).

[0130] In some examples, the one or more slices may include a slice that was encoded immediately before the current slice.

[0131] In some examples, the one or more slices may include an uncoded slice immediately preceding the current slice, where the slice satisfies at least one of the following conditions: the slice has the same slice type as the current slice, the slice has a minimum quantization parameter (QP) difference from the current slice, or the slice has the same temporal layer as the current slice.

[0132] For example, some implicit selection scheme may be applied to select a corresponding coded slice for context initialization of the current slice according to rule #1, rule #2, rule #3, rule #4, or any combination of these rules.

[0133] In step 802, the processor 420 may determine an initial context state of one or more context models of the current slice by inheriting a context state of one or more context models of a slice coded before the current slice.

[0134] By inheriting the context state, one or more context models of the current slice use the context state of one or more context models of one previously coded slice (i.e., one slice coded before the current slice) as the initial context state.

[0135] In some examples, the one or more initial context states may include at least one of a probability value, an adaptation rate, or an adaptation weight parameter.

[0136] For example, the inherited context state may include various categories of state information, e.g., probability values, adaptation rates, and combining weights (if the proposed MHP-AW scheme is applied). In one embodiment of the present disclosure, it is proposed to inherit only one state information from the selected coded slice, and other state information of the current slice is initialized using an existing predefined CABAC initialization table. In another embodiment, it is proposed to inherit only two state information from the selected coded slice. In yet another embodiment, it is proposed to inherit all state information of the current slice from the corresponding context state of the selected coded slice.

[0137] In step 803, the processor 420 may encode binary symbols associated with one or more context models in the current slice according to the initial context state.

[0138] In some examples, the processor 420 may determine at least one second initial context state for a current slice according to one or more existing context-based adaptive binary arithmetic coding (CABAC) initialization tables, the current slice including the initial context state and the at least one second initial context state. Further, the processor 420 may encode binary symbols in the current slice according to the initial context state and the at least one second initial context state.

[0139] In some examples, an apparatus for video encoding is provided that includes a processor 420 and a memory 440 configured to store instructions executable by the processor, the processor being configured to, upon execution of the instructions, perform any of the methods described above.

[0140] In some other examples, a non-transitory computer-readable storage medium having instructions stored thereon is provided. When the instructions are executed by the processor 420, the instructions cause the processor to perform any of the methods set forth in this disclosure. In one example, a number of programs may be executed by the processor 420 in the computing environment 410 to receive (e.g., from the video encoder 20 of FIG. 2) a bitstream or datastream including encoded video information (e.g., video blocks representing encoded video frames and / or one or more associated syntax elements, etc.) and to perform the above-described decoding method according to the received bitstream or datastream. In other examples, a number of programs may be executed by the processor 420 in the computing environment 410 to perform the above-described encoding method to encode the video information (e.g., video blocks representing video frames and / or one or more associated syntax elements, etc.) into a bitstream or datastream and to transmit the bitstream or datastream (e.g., to the video decoder 30 of FIG. 3). Alternatively, the non-transitory computer-readable storage medium may store a bitstream or datastream including encoded video information (e.g., video blocks representing encoded video frames and / or one or more associated syntax elements, etc.) generated by an encoder (e.g., video encoder 20 of FIG. 2) using, for example, the encoding method described above, for use by a decoder (e.g., video decoder 30 of FIG. 3) in decoding video data. The non-transitory computer-readable storage medium may be, for example, a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0141] Other examples of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the present disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure in accordance with the general principles of the present disclosure, including departures from the present disclosure that are within known or customary practice in the art. It is intended that the specification and examples be considered merely illustrative.

[0142] It will be understood that the present disclosure is not limited to the precise examples described above and shown in the accompanying drawings, and that various modifications and changes can be made without departing from the scope of the present disclosure.

Claims

1. 1. A method for video decoding, comprising: obtaining, by a binary arithmetic decoder, a multi-hypothesis probability of a binary symbol of a given context model of the binary arithmetic decoder according to an adaptive weight, the multi-hypothesis probability indicating a probability that the binary symbol is equal to a binary value, the binary symbol being from a plurality of binary symbols associated with the context model; decoding, by said decoder, said one binary symbol according to said multiple hypothesis probabilities; A method comprising:

2. obtaining, by the decoder, a first probability of the one binary symbol according to a first adaptation parameter; obtaining, by the decoder, a second probability of the one binary symbol according to a second adaptation parameter; obtaining, by the decoder, the multiple hypothesis probabilities according to the adaptive weights, the first probability, and the second probability; The method of claim 1 further comprising:

3. obtaining, by the decoder, the adaptive weights according to the context model from a set of predetermined integer weight values ​​in a weight initialization table. The method of claim 1 further comprising:

4. Obtaining, by the decoder, a weight initialization table for each slice type; in response to determining that a current slice is a first slice type, selecting, by the decoder, the weight initialization table according to the first slice type, the first slice type comprising an I-type, a P-type, or a B-type; obtaining, by the decoder, the adaptive weights according to the selected weight initialization table; The method of claim 1 further comprising:

5. Obtaining, by the decoder, a control syntax element in a picture parameter set (PPS) indicating whether to select a weight initialization table for each slice. The method of claim 4 further comprising:

6. deriving, by the decoder, at a slice level, an adaptive weight syntax element for each slice indicating a weight initialization table selected for each slice according to a slice type of each slice in response to determining that the control syntax element is enabled. The method of claim 5 further comprising:

7. obtaining, by the decoder, a first weight initialization table for each I slice, a second weight initialization table for each P slice, and a third weight initialization table for each B slice; selecting, by the decoder, the first weight initialization table in response to determining that the current slice is an I slice; selecting, by the decoder, the second weight initialization table or the third weight initialization table in response to determining that the current slice is a P slice or a B slice; obtaining, by the decoder, the adaptive weights according to the selected weight initialization table; The method of claim 1 further comprising:

8. In response to determining that the current slice is not an I slice, obtaining, by the decoder, a control syntax element in a picture parameter set (PPS) indicating whether to select a weight initialization table for each slice; obtaining, by the decoder, an adaptive weight syntax element for each non-I slice indicating a weight initialization table selected from the second weight initialization table and the third weight initialization table at a slice level in response to determining that the control syntax element is enabled; The method of claim 7 further comprising:

9. 1. A method for video encoding, comprising: determining, by a binary arithmetic coder, a multiple hypothesis probability of a binary symbol from a plurality of binary symbols of a given context model of the binary arithmetic coder according to an adaptive weight, the multiple hypothesis probability indicating a probability that the binary symbol is equal to a binary value; encoding, by the encoder, the one binary symbol according to the multiple hypothesis probabilities; A method comprising:

10. determining, by the encoder, a first probability of the one binary symbol according to a first adaptation parameter; determining, by the encoder, a second probability of the one binary symbol according to a second adaptation parameter; determining, by the encoder, the multiple hypothesis probabilities according to the adaptive weights, the first probability, and the second probability; The method of claim 9 further comprising:

11. predetermining, by the encoder, the adaptive weights as weight values ​​according to a set of predetermined integer weight values ​​in a weight initialization table; The method of claim 9 further comprising:

12. determining, by the encoder, a weight initialization table for each slice type; in response to determining that a current slice is a first slice type, selecting, by the encoder, the weight initialization table according to the first slice type, the first slice type comprising an I-type, a P-type, or a B-type; determining, by the encoder, the adaptive weights according to the selected weight initialization table; The method of claim 9 further comprising:

13. signaling, by the encoder, a control syntax element in a picture parameter set (PPS) for indicating whether or not to select a weight initialization table for each slice; The method of claim 12 further comprising:

14. signaling, by the encoder, at a slice level, an adaptive weight syntax element for each slice to indicate a selected weight initialization table for each slice in response to determining that the control syntax element is enabled. The method of claim 13 further comprising:

15. determining, by the encoder, a first weight initialization table for each I slice, a second weight initialization table for each P slice, and a third weight initialization table for each B slice; selecting, by the encoder, the first weight initialization table in response to determining that the current slice is an I slice; selecting, by the encoder, the second weight initialization table or the third weight initialization table in response to determining that the current slice is a P slice or a B slice; determining, by the encoder, the adaptive weights according to the selected weight initialization table; The method of claim 9 further comprising:

16. signaling, by the encoder, a control syntax element in a picture parameter set (PPS) to indicate whether to select a weight initialization table for each slice in response to determining that the current slice is not an I slice; signaling, by the encoder, at a slice level, an adaptive weight syntax element for each non-I slice to indicate a weight initialization table selected from the second weight initialization table and the third weight initialization table in response to determining that the control syntax element is enabled; The method of claim 15 further comprising:

17. 1. A method for video decoding, comprising: selecting, by a decoder, one or more slices that were coded before a current slice; obtaining, by the decoder, an initial context state of one or more context models of the current slice by inheriting a context state of one or more context models of a slice encoded before the current slice; decoding, by the decoder, binary symbols associated with the one or more context models in the current slice according to the initial context state; A method comprising:

18. The method of claim 17 , wherein the one or more slices comprises a slice that was coded immediately before the current slice.

19. The one or more slices include a non-encoded slice immediately before the current slice, the slice comprising: the condition that the slice has the same slice type as the current slice; the slice has the smallest quantization parameter (QP) difference with the current slice; or the condition that the slice has the same temporal layer as the current slice; The method according to claim 7 , wherein at least one of the following is satisfied:

20. The method of claim 17 , wherein the one or more initial context states include at least one of the following parameters: a probability value, an adaptation rate, or an adaptation weight.

21. obtaining, by the decoder, at least one second initial context state for the current slice according to one or more existing context-based adaptive binary arithmetic coding (CABAC) initialization tables, the current slice including the initial context state and the at least one second initial context state; decoding, by the decoder, the binary symbols in the current slice according to the initial context state and the at least one second initial context state; 20. The method of claim 17, further comprising:

22. 1. A method for video encoding, comprising: selecting, by an encoder, one or more slices that have been encoded before a current slice; determining an initial context state of the one or more context models of the current slice by inheriting a context state of the one or more context models from a slice coded before the current slice by the encoder; encoding, by the encoder, binary symbols associated with the one or more context models of the current slice according to the initial context state; A method comprising:

23. The method of claim 22 , wherein the one or more slices comprises a slice that was encoded immediately before the current slice.

24. The one or more slices include a non-encoded slice immediately before the current slice, the slice comprising: the condition that the slice has the same slice type as the current slice; the slice has the smallest quantization parameter (QP) difference with the current slice; or the condition that the slice has the same temporal layer as the current slice; 23. The method of claim 22, wherein at least one of the following is satisfied:

25. 23. The method of claim 22, wherein the one or more initial context states include at least one of the following parameters: a probability value, an adaptation rate, or an adaptation weight.

26. determining, by the encoder, at least one second initial context state of the current slice according to one or more existing context-based adaptive binary arithmetic coding (CABAC) initialization tables, the current slice including the initial context state and the at least one second initial context state; encoding, by the encoder, the binary symbols in the current slice according to the initial context state and the at least one second initial context state; 23. The method of claim 22, further comprising:

27. 1. An apparatus for video decoding, comprising: one or more processors; a memory coupled to the one or more processors and configured to store instructions executable by the one or more processors; Equipped with Apparatus, wherein the one or more processors are configured to, upon execution of the instructions, perform the method of any one of claims 1 to 8 and 17 to 21.

28. 1. An apparatus for video encoding, comprising: one or more processors; a memory coupled to the one or more processors and configured to store instructions executable by the one or more processors; Equipped with Apparatus, wherein the one or more processors are configured to, upon execution of the instructions, perform a method according to any one of claims 9 to 16 and 22 to 26.

29. A non-transitory computer-readable storage medium for storing computer-executable instructions that, when executed by one or more computer processors, cause the one or more computer processors to receive a bitstream and perform a method according to any one of claims 1 to 8 and 17 to 21 based on the bitstream.

30. A non-transitory computer-readable storage medium for storing computer-executable instructions that, when executed by one or more computer processors, cause the one or more computer processors to perform a method as recited in any of claims 9 to 16 and 22 to 26, to encode a current video block into a bitstream and to transmit the bitstream.

Citation Information

Patent Citations

  • Architecture flexible binary arithmetic coding system

    US20180192053A1

  • Adaptive Multi-Hypothesis Context-Adaptive Binary Arithmetic Coding (MCABAC)

    US20200344480A1

  • Arithmetic Encoders, Arithmetic Decoders, Video Encoder, Video Decoder, Methods for Encoding, Methods for Decoding and Computer Program

    US20210126650A1

  • Specifying Slice Chunks Of A Slice Within A Tile

    US20210258613A1

Cited By

  • Inherited context initialization in CABAC

    JP2025513128A

  • Inherited context initialization in CABAC

    JP7872344B2