Video encoding and decoding method and device
By setting the maximum number of context-encoded binary bits and using BDPCM technology, the video encoding and decoding process is optimized, and the problems of low encoding speed and large memory size are solved, and efficient video encoding and decoding is achieved.
Patent Information
- Application Number
- CN202411184897.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2019-12-11
- Filing Date
- 2019-12-20
- Publication Date
- 2024-12-06
AI Technical Summary
When existing video encoding and decoding, there are problems such as low encoding speed, large memory size, and high context model maintenance costs when handling video encoding and decoding. Especially in the process of efficient video encoding and decoding, it is difficult to effectively manage the number of context-encoded binary bits.
By setting the maximum number of context-encoded binary bits and encoding uncontext-encoded encoding bits based on the equal probability model, limiting the number of context-encoded bits for each region or subregion, combining block differential pulse coding modulation (BDPCM) and deregulation The use of block filters optimizes the video encoding and decoding process.
Improves encoding speed, reduces the required memory size, and reduces the maintenance cost of context models, and improves the efficiency and performance of video encoding and codec.
Smart Images

Figure CN119094777A_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims the benefit of priority to U.S. Patent Application No. 16 / 710,889, filed on December 11, 2019, entitled "METHOD AND APPARATUS FOR VIDEO CODING," which claims the benefit of priority to U.S. Provisional Application No. 62 / 785,056, filed on December 26, 2018, entitled "CONSTRAINTS FOR CONTEXT MODELING AND DEBLOCKING FILTER IN BLOCK DIFFERENTIAL PULSE-CODE MODULATION." The entire disclosure of the prior application is incorporated herein by reference in its entirety. Technical Field
[0003] The present application relates to the field of video processing technology, and in particular to a method and device for video encoding and decoding. Background Art
[0004] The background description provided herein is for the purpose of generally presenting the background of the present disclosure. To the extent described in this background section, the work of the presently named inventors and aspects of the description that may not otherwise be qualified as prior art at the time of filing are neither explicitly nor implicitly admitted as prior art against the present disclosure.
[0005] Video encoding and decoding can be performed using inter-picture prediction with motion compensation. An uncompressed digital video may include a series of pictures, each with spatial dimensions of, for example, 1920×1080 luma samples and associated chroma samples. The series of pictures may have a fixed or variable picture rate (also informally referred to as a frame rate), for example, 60 pictures per second or 60 Hz. Uncompressed video has significant bit rate requirements, for example, 1080p60 4:2:0 video with 8 bits per sample (1920×1080 luma sample resolution at 60 Hz frame rate) requires a bandwidth of nearly 1.5 Gbit / s. One hour of such video requires more than 600 GB of storage space.
[0006] The purpose of video coding is to reduce the redundancy of the input video signal through compression. Compression can help reduce the bandwidth requirements and storage space requirements mentioned above, in some cases by two or more orders of magnitude. Lossless compression or lossy compression or a combination of lossless and lossy compression can be used. Lossless compression refers to a technique that can reconstruct an exact copy of the original signal from the compressed original signal. When lossy compression is used, the reconstructed signal may be different from the original signal, but the distortion between the original signal and the reconstructed signal is small enough that the reconstructed signal can be used for the target application. Lossy compression has been widely used in video. The amount of distortion tolerated depends on the application. For example, users of certain consumer streaming applications may tolerate higher distortion than users of TV distribution applications. Higher allowable / tolerable distortion can produce higher compression ratios.
[0007] Video encoders and decoders may utilize techniques in several general categories including, for example, motion compensation, transforms, quantization, and entropy coding.
[0008] Video codec techniques may include intra-coding techniques. In intra-coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, pictures are spatially subdivided into sample blocks. When all sample blocks are encoded in intra-frame mode, the picture may be an intra-picture. Intra-pictures and their derivatives (e.g., independent decoder refresh pictures) may be used to reset decoder states, and may therefore be used as encoded video bitstreams, or as the first picture in a video session, or as a still image. Samples of intra-blocks may be subjected to transformation, and transform coefficients may be quantized before entropy coding. Intra-frame prediction is a technique that may minimize sample values in a pre-transform domain. In some cases, the smaller the DC value after transformation, and the smaller the AC coefficient, the fewer bits are required to represent the block after entropy coding at a given quantization step size.
[0009] Traditional intra-frame coding, such as known from, for example, MPEG-2 generation coding techniques, does not use intra-frame prediction. However, some newer video compression techniques include techniques that attempt to exploit metadata and / or surrounding sample data obtained during encoding / decoding of, for example, spatially adjacent and preceding data blocks in decoding order. Such techniques are hereinafter referred to as "intra-frame prediction" techniques. Note that, in at least some cases, intra-frame prediction uses only reference data from the current picture being reconstructed, and does not use reference data from reference pictures.
[0010] There can be many different forms of intra-frame prediction. When more than one such technique can be used in a given video coding technique, the techniques used can be encoded in intra-frame prediction mode. In some cases, a mode can have sub-modes and / or parameters, and these sub-modes and / or parameters can be encoded separately or included in the mode codeword. Which codeword is used for a given mode / sub-mode / parameter combination affects the efficiency gain of encoding through intra-frame prediction, and therefore can affect the entropy coding technique used to convert the codeword into a bitstream.
[0011] Certain modes of intra prediction were introduced by H.264, refined in H.265, and further refined in newer coding techniques such as the joint exploration model (JEM), next-generation video coding (VVC), and the benchmark set (BMS). The predictor block can be formed using neighboring sample values belonging to samples that are already available. Sample values of neighboring samples are copied into the predictor block according to the direction. A reference to the direction used can be encoded in the bitstream, or it can itself be predicted.
[0012] Motion compensation may be a lossy compression technique and may involve the following technique: after spatial movement in the direction indicated by a motion vector (hereinafter referred to as MV), a block of sample data from a previously reconstructed picture or a portion thereof (i.e., using a reference picture) is used to predict a newly reconstructed picture or a portion thereof. In some cases, the reference picture may be the same as the picture currently being reconstructed. MV may have two dimensions, X and Y, or three dimensions, where the third dimension indicates the reference picture in use (the third dimension may be indirectly a time dimension).
[0013] In some video compression techniques, an MV that can be used for a region of sample data can be predicted based on other MVs, for example, a prediction can be obtained based on an MV related to another region of sample data that is spatially adjacent to the region being reconstructed and is earlier in the decoding order. This can significantly reduce the amount of data required to encode the MV, thereby eliminating redundancy and improving the compression rate. For example, since there is a statistical probability when encoding an input video signal derived from a camera (called natural video), that a larger area than the area applicable to a single MV moves in a similar direction, and in some cases a similar motion vector derived from the MV of the adjacent area can be used to predict the single MV, MV prediction can work effectively. The above makes the MV sought for a given area similar or identical to the MV predicted from the surrounding MVs, so that after entropy coding, the MV can be represented using fewer binary bits than when the MV is directly encoded. In some cases, MV prediction can be an example of lossless compression of a signal (i.e., MV) derived from an original signal (i.e., a sample stream). In other cases, MV prediction itself can be lossy, because there may be rounding errors in calculating the predicted value based on several surrounding MVs when performing MV prediction.
[0014] Various MV prediction mechanisms are described in H.265 / HEVC (ITU-T Recommendation H.265, “High Efficiency Video Coding”, December 2016).
[0015] Reference Figure 1 , the current block (101) includes samples that have been discovered by the encoder during the motion search process, which can be predicted based on previous blocks of the same size that have been spatially offset. In addition, the MV can be derived from one or more metadata associated with the reference picture instead of encoding the MV directly, for example, using the MV associated with any of the five surrounding samples denoted A0, A1 and B0, B1, B2 (corresponding to 102 to 106 respectively), and the MV is derived from the metadata of the nearest reference picture (in decoding order). In H.265, MV prediction can use neighboring blocks or prediction values of the same reference picture.
[0016] During video decoding, there are typically a large number of context coded bits (e.g., bits associated with at least one context model), which may reduce the throughput of an entropy encoder or decoder during syntax encoding, and a large number of context coded bits may become a burden for certain decoders (e.g., certain hardware decoders). Summary of the invention
[0017] Aspects of the present disclosure provide a method and apparatus for video encoding and decoding.
[0018] In an embodiment, a method for video encoding and decoding is provided. In the method, a bitstream is received, the bitstream including coded bits of binary bits of a syntax element. The syntax element corresponds to a residual of a region of a transform skip block in a coded picture. Context modeling is performed to determine a context model for each binary bit of the syntax element for the region. The number of binary bits of the syntax element that are context-coded does not exceed the maximum number of context-coded binary bits set for the region. Based on the determined context model, the coded bits of the binary bits of the syntax element are decoded.
[0019] In an embodiment, the number of binary bits of the context-coded syntax element is less than or equal to the total number of binary bits of the syntax element for the region of the transform skip block.
[0020] In an embodiment, the maximum number of context coding bins for a region of a transform skip block is set to B×A, where B is a positive number and A is the number of quantized residuals in the region.
[0021] In an embodiment, based on an equal probability model, a remaining total number of coded bits of bins of syntax elements for a region of a transform skip block, which are not context coded, are decoded.
[0022] In an embodiment, B is an integer.
[0023] In an embodiment, B is a decimal.
[0024] In an implementation, B is set according to A.
[0025] In an embodiment, the transform skip block includes the area, and A is equal to W×H of the transform skip block, where W is the width of the transform skip block and H is the height of the transform skip block.
[0026] In an embodiment, the transform skip block is divided into multiple regions including the region, and the maximum number of context coding binary bits of each region in the multiple regions is set to B×A, where B is a positive number and A is the number of quantized residuals in each region in the multiple regions.
[0027] In an embodiment, a method for video encoding and decoding is provided. In the method, a coded video bitstream is received. An indicator is received. The indicator indicates whether a current block and at least one of a neighboring block of the coded video bitstream are encoded using block differential pulse code modulation (BDPCM). The current block is adjacent to the neighboring block. When at least one of the current block and the neighboring block is indicated as being encoded using BDPCM, a boundary strength to be applied to a boundary between a current subblock in the current block and a neighboring subblock in a neighboring block is determined, and based on the determined boundary strength, a deblocking filter is used to deblock the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block.
[0028] In an embodiment, the neighboring sub-blocks are not coded using BDPCM.
[0029] In an embodiment, when the neighboring sub-blocks are encoded using BDPCM, the boundary strength of the deblocking filter is determined to be 1 or 2.
[0030] In an embodiment, when the current subblock and the neighboring subblock are encoded using BDPCM, if the difference in quantization parameters between the current subblock and the neighboring subblock is greater than a threshold, the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block is deblocked.
[0031] In an embodiment, when the current subblock and the neighboring subblock are encoded using BDPCM, the current subblock and the neighboring subblock are encoded using different BDPCM prediction modes, and the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block is deblocked.
[0032] In an embodiment, when the current subblock and the neighboring subblock are encoded using BDPCM, if at least one of the current subblock and the neighboring subblock has a non-zero coefficient, the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block is deblocked.
[0033] Aspects of the present disclosure also provide a video encoding and decoding device, the device comprising:
[0034] A receiving module, configured to receive a bitstream, the bitstream comprising coded bits of binary bits of a syntax element, the syntax element corresponding to a residual of a region of a transform skip block in a coded picture;
[0035] A context modeling module, configured to perform context modeling to determine a context model for each binary bit of the grammatical element of the region, wherein the number of binary bits of the grammatical element context-coded does not exceed a maximum number of context-coded binary bits set for the region;
[0036] A decoding module is used to decode the coded bits of the binary bits of the syntax element based on the determined context model.
[0037] Aspects of the present disclosure also provide a video encoding and decoding device, the device comprising:
[0038] A receiving module, used for receiving a coded video bit stream;
[0039] The receiving module is further configured to receive an indicator, wherein the indicator indicates whether to use block differential pulse code modulation (BDPCM) to encode at least one of a current block and a neighboring block of the encoded video bit stream, wherein the current block is adjacent to the neighboring block;
[0040] a deblocking module for determining a boundary strength to be applied to a boundary between a current subblock in the current block and a neighboring subblock in the neighboring block when at least one of the current block and the neighboring block is indicated to be encoded using BDPCM, and deblocking the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block using a deblocking filter according to the boundary strength.
[0041] Aspects of the present disclosure also provide a computer device, including: a processor and a memory;
[0042] The memory is used to store computer programs;
[0043] The processor is used to execute the above-mentioned video encoding and decoding method according to the computer program.
[0044] Aspects of the present disclosure also provide a non-transitory computer-readable storage medium storing instructions that, when executed by a computer, cause the computer to perform any of the above methods.
[0045] The method for video encoding and decoding provided in the embodiment of the present application improves the encoding speed by setting the maximum number of context encoding binary bits, and can also reduce the required memory size and the cost of maintaining the context model. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] Additional features, properties, and various advantages of the disclosed subject matter will become more apparent from the following detailed description and accompanying drawings, in which:
[0047] Figure 1 is a schematic diagram of the current block and its surrounding spatial merging candidates in an example;
[0048] Figure 2 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment;
[0049] Figure 3 is an illustration of a simplified block diagram of a communication system according to an embodiment;
[0050] Figure 4 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment;
[0051] Figure 5 is a schematic diagram of a simplified block diagram of an encoder according to an embodiment;
[0052] Figure 6 A block diagram showing an encoder according to another embodiment;
[0053] Figure 7 A block diagram showing a decoder according to another embodiment;
[0054] Figure 8 A flowchart illustrating an exemplary process for determining a boundary strength value according to an embodiment of the present disclosure;
[0055] Fig. 9A shows an example of a block differential pulse code modulation (BDPCM) coded block according to an embodiment;
[0056] Fig. 9B shows an example of a BDPCM-encoded block according to an embodiment;
[0057] Fig. 10A An exemplary entropy encoder based on context-adaptive binary arithmetic coding (CABAC) according to an embodiment is shown;
[0058] Fig. 10B An exemplary CABAC-based entropy decoder according to an embodiment is shown;
[0059] Fig.11 An exemplary CABAC-based entropy encoding process according to an embodiment is shown;
[0060] Fig.12 An exemplary CABAC-based entropy decoding process according to an embodiment is shown;
[0061] Fig.13 A flow chart outlining an entropy decoding process according to an embodiment is shown;
[0062] Fig.14 A flow chart outlining a deblocking filtering process according to an embodiment is shown;
[0063] Fig.15 is a schematic diagram of a computer system according to an embodiment. DETAILED DESCRIPTION
[0064] I. Video Encoders and Decoders
[0065] Figure 2 A simplified block diagram of a communication system (200) according to an embodiment of the present disclosure is shown. The communication system (200) includes a plurality of terminal devices that can communicate with each other via, for example, a network (250). For example, the communication system (200) includes a first terminal device (210) and a second terminal device (220) interconnected via the network (250). Figure 2 In the example of , a first terminal device (210) and a second terminal device (220) perform unidirectional data transmission. For example, the first terminal device (210) can encode video data (e.g., a video picture stream collected by the terminal device (210)) for transmission to another terminal device (220) via a network (250). The encoded video data can be transmitted in the form of one or more encoded video bitstreams. The second terminal device (220) can receive the encoded video data from the network (250), decode the encoded video data to recover the video data, and display the video picture based on the recovered video data. Unidirectional data transmission is more common in applications such as media services.
[0066] In another example, the communication system (200) includes a third terminal device (230) and a fourth terminal device (240) for bidirectional transmission of encoded video data, and the bidirectional transmission can occur, for example, during a video conference. For bidirectional data transmission, in the example, each of the terminal devices (230) and (240) can encode video data (e.g., a video picture stream collected by the terminal device) for transmission to the other terminal device of the third terminal device (230) and the fourth terminal device (240) via a network (250). Each of the third terminal device (230) and the fourth terminal device (240) can also receive the encoded video data transmitted by the other terminal device of the third terminal device (230) and the fourth terminal device (240), and can decode the encoded video data to restore the video data, and can display the video picture on an accessible display device based on the restored video data.
[0067] exist Figure 2In the example of, the first terminal device (210), the second terminal device (220), the third terminal device (230) and the fourth terminal device (240) can be a server, a personal computer and a smart phone, but the principles of the present disclosure may not be limited thereto. The embodiments of the present disclosure may be applicable to laptop computers, tablet computers, media players and / or dedicated video conferencing equipment. The network (250) represents any number of networks that transmit encoded video data between the first terminal device (210), the second terminal device (220), the third terminal device (230) and the fourth terminal device (240), including, for example, wired (wired) and / or wireless communication networks. The communication network (250) can exchange data in a circuit switching channel and / or a packet switching channel. Representative networks may include telecommunication networks, local area networks, wide area networks and / or the Internet. For the purpose of the present application, unless explained below, the architecture and topology of the network (250) may be irrelevant to the operation of the present disclosure.
[0068] As an example of application for the disclosed subject matter, Figure 3 The video encoder and the video decoder are shown in a streaming environment. The disclosed subject matter can be equally applicable to other video-supported applications, including, for example, video conferencing, digital TV, storage of compressed video on digital media such as compact discs (CDs), digital versatile discs (DVDs), memory sticks, etc.
[0069] The streaming system may include an acquisition subsystem (313), which may include a video source (301), such as a digital camera, which creates, for example, an uncompressed video picture stream (302). In an example, the video picture stream (302) includes samples captured by the digital camera. The video picture stream (302) is depicted as a thick line to emphasize the high data volume of the video picture stream compared to the encoded video data (304) (or the encoded video bitstream), and the video picture stream (302) can be processed by an electronic device (320), which includes a video encoder (303) coupled to the video source (301). The video encoder (303) may include hardware, software, or a combination of hardware and software to implement or implement various aspects of the disclosed subject matter as described in more detail below. Compared to the video picture stream (302), the encoded video data (304) (or the encoded video bitstream (304)) is depicted as a thin line to emphasize the lower amount of data, and the encoded video data (304) (or the encoded video bitstream (304)) can be stored on the streaming server (305) for future use. One or more streaming client subsystems, such as Figure 3A client subsystem (306) and a client subsystem (308) in a streaming server (305) can access a streaming server (305) to retrieve a copy (307) and a copy (309) of the encoded video data (304). The client subsystem (306) can include, for example, a video decoder (310) in an electronic device (330). The video decoder (310) decodes the incoming copy (307) of the encoded video data and creates an output video picture stream (311) that can be presented on a display (312) (e.g., a display screen) or another presentation device (not depicted). In some streaming systems, the encoded video data (304), the video data (307), and the video data (309) (e.g., a video bitstream) can be encoded according to certain video encoding / compression standards. Examples of these standards include the International Telecommunication Union Telecommunication Standardization Sector (ITU-T) high efficiency video coding (H.265) recommendation. In an example, the video coding standard under development is informally referred to as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of the VVC standard.
[0070] It should be noted that the electronic device (320) and the electronic device (330) may include other components (not shown). For example, the electronic device (320) may include a video decoder (not shown), and the electronic device (330) may also include a video encoder (not shown).
[0071] Figure 4 A block diagram of a video decoder (410) according to an embodiment of the present disclosure is shown. The video decoder (410) may be included in an electronic device (430). The electronic device (430) may include a receiver (431) (e.g., a receiving circuit). The video decoder (410) may be used to replace Figure 3 The video decoder (310) of the example.
[0072] The receiver (431) may receive one or more encoded video sequences to be decoded by the video decoder (410); in the same or another embodiment, one encoded video sequence is received at a time, wherein the decoding of each encoded video sequence is independent of the other encoded video sequences. The encoded video sequences may be received from a channel (401), which may be a hardware / software link to a storage device storing the encoded video data. The receiver (431) may receive the encoded video data as well as other data, such as encoded audio data and / or auxiliary data streams that may be forwarded to their respective consuming entities (not depicted), which may be forwarded to their respective consuming entities (not depicted). The receiver (431) may separate the encoded video sequence from the other data. To prevent network jitter, a buffer memory (415) may be coupled between the receiver (431) and the entropy decoder / parser (420) (hereinafter referred to as "parser (420)"). In some applications, the buffer memory (415) is part of the video decoder (410). In other applications, the buffer memory (415) may be external to the video decoder (410) (not depicted). In other cases, a buffer memory (not depicted) may be external to the video decoder (410) to prevent network jitter, and in addition, another buffer memory (415) may be configured inside the video decoder (410) to handle broadcast timing. When the receiver (431) receives data from a storage / forwarding device with sufficient bandwidth and controllability, or from an isochronous network, it may not be necessary to configure the buffer memory (415), or the buffer memory may be smaller. For use on an optimal packet network such as the Internet, a buffer memory (415) may be required, and the buffer memory (415) may be relatively large and may advantageously have an adaptive size, and may be implemented at least in part in an operating system or similar element (not depicted) external to the video decoder (410).
[0073] The video decoder (410) may include a parser (420) to generate coded video sequence reconstruction symbols (421). The categories of these symbols include: information for managing the operation of the video decoder (410), and potential information for controlling, for example, a rendering device (412) (e.g., a display screen), which is not part of the electronic device (430) but can be coupled to the electronic device (430), such as Figure 4As shown. The control information for controlling (one or more) rendering devices may be in the form of a Supplemental Enhancement Information (SEI message) or a Video Usability Information (VUI) parameter set fragment (not depicted). The parser (420) may parse / entropy decode the received encoded video sequence. The decoding of the encoded video sequence may be performed according to a video decoding technique or a video decoding standard, and may follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, etc. The parser (420) may extract a subgroup parameter set for at least one subgroup in a video decoder from the encoded video sequence based on at least one parameter corresponding to the group. The subgroup may include a Group of Pictures (GOP), a picture, a tile, a slice, a macroblock, a Coding Unit (CU), a block, a Transform Unit (TU), a Prediction Unit (PU), etc. The parser (420) may also extract information from the encoded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, etc.
[0074] The parser (420) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (415) to create symbols (421).
[0075] Video decoding may involve multiple different units according to the encoded video picture or a portion of the encoded video picture (e.g., inter-frame picture and intra-frame picture, inter-frame block and intra-frame block) and other factors. Which units are involved and how they are involved can be determined by the parser (420) based on the subgroup control information parsed from the encoded video sequence. For simplicity, such subgroup control information flow between the parser (420) and the following multiple units is not depicted.
[0076] In addition to the functional blocks already mentioned, the video decoder (410) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and may be at least partially integrated with each other. However, for the purposes of describing the disclosed subject matter, the conceptual subdivision into the following functional units is appropriate.
[0077] The first unit is a sealer / inverse transform unit (451). The sealer / inverse transform unit (451) receives quantized transform coefficients as (one or more) symbols (421) and control information from the parser (420), including which transform method to use, block size, quantization factor, quantization scaling matrix, etc. The sealer / inverse transform unit (451) can output a block including sample values, which can be input into an aggregator (455).
[0078] In some cases, the output samples of the scaler / inverse transform unit (451) may belong to an intra-coded block; that is, a block that does not use predictive information from a previously reconstructed picture, but may use predictive information from a previously reconstructed portion of the current picture. Such predictive information may be provided by an intra-prediction unit (452). In some cases, the intra-prediction unit (452) generates surrounding blocks of the same size and shape as the block being reconstructed using reconstructed information obtained from a current picture buffer (458). For example, the current picture buffer (458) buffers a partially reconstructed current picture and / or a fully reconstructed current picture. In some cases, the aggregator (455) adds the prediction information already generated by the intra-prediction unit (452) to the output sample information provided by the scaler / inverse transform unit (451) on a per-sample basis.
[0079] In other cases, the output samples of the scaler / inverse transform unit (451) may belong to an inter-frame coded and potentially motion compensated block. In this case, the motion compensated prediction unit (453) may access the reference picture memory (457) to obtain samples for prediction. After the obtained samples are motion compensated according to the symbols (421) belonging to the block, these samples may be added to the output of the scaler / inverse transform unit (451) (in this case referred to as residual samples or residual signals) by the aggregator (455) to generate output sample information. The predicted samples obtained by the motion compensated prediction unit (453) based on the address in the reference picture memory (457) may be controlled by a motion vector, and the motion vector is used by the motion compensated prediction unit (453) in the form of a symbol (421), which may have, for example, an X component, a Y component and a reference picture component. Motion compensation may also include interpolation of sample values obtained from the reference picture memory (457) when using sub-sample accurate motion vectors, motion vector prediction mechanisms, etc.
[0080] The output samples of the aggregator (455) may be employed by various loop filtering techniques in a loop filter unit (456). The video compression techniques may include in-loop filter techniques controlled by parameters included in the coded video sequence (also referred to as a coded video bitstream) and made available to the loop filter unit (456) as symbols (421) from the parser (420), but the video compression techniques may also be responsive to meta-information obtained during decoding of a coded picture or a previous (in decoding order) portion of the coded video sequence, and to previously reconstructed and loop filtered sample values.
[0081] The output of the loop filter unit (456) may be a sample stream that may be output to a rendering device (412) and may be stored in a reference picture memory (457) for future inter-picture prediction.
[0082] Once fully reconstructed, certain coded pictures may be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture is identified as a reference picture (e.g., by the parser (420)), the current picture buffer (458) may become part of the reference picture memory (457) and a new current picture buffer may be reallocated before starting reconstruction of a subsequent coded picture.
[0083] The video decoder (410) may perform decoding operations according to a predetermined video compression technique, such as in the ITU-T H.265 Recommendation standard. The encoded video sequence may conform to the syntax specified by the video compression technique or video compression standard used, in the sense that the encoded video sequence follows both the syntax of the video compression technique or video compression standard and the profile recorded in the video compression technique or video compression standard. Specifically, the profile may select certain tools from all the tools available in the video compression technique or video compression standard as the only tools available for use under the profile. For compliance, it is also required that the complexity of the encoded video sequence is within the range defined by the level of the video compression technique or video compression standard. In some cases, the level limits the maximum picture size, the maximum frame rate, the maximum reconstruction sampling rate (measured in, for example, mega samples per second), the maximum reference picture size, etc. In some cases, the limits set by the level may be further defined by the Hypothetical Reference Decoder (HRD) specification and the metadata of the HRD buffer management signaled in the encoded video sequence.
[0084] In an embodiment, a receiver (431) may receive additional (redundant) data and the encoded video. The additional data may be included as part of the encoded video sequence. The additional data may be used by the video decoder (410) to properly decode the data and / or more accurately reconstruct the original video data. The additional data may be in the form of, for example, temporal, spatial or signal-to-noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, etc.
[0085] Figure 5 A block diagram of a video encoder (503) according to an embodiment of the present disclosure is shown. The video encoder (503) is included in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., a transmission circuit). The video encoder (503) can be used to replace Figure 3 The video encoder (303) in the example.
[0086] The video encoder (503) can be used to obtain the video source (501) (not Figure 5 In one example, the video source (501) is a part of the electronic device (520) to receive video samples, and the video source (501) can capture video images to be encoded by the video encoder (503). In another example, the video source (501) is a part of the electronic device (520).
[0087] The video source (501) may provide a source video sequence in the form of a digital video sample stream to be encoded by the video encoder (503), wherein the digital video sample stream may have any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 Y CrCB, RGB, ...), and any suitable sampling structure (e.g., Y CrCb 4:2:0, Y CrCb 4:4:4). In a media service system, the video source (501) may be a storage device for storing previously prepared videos. In a video conferencing system, the video source (501) may be a camera device for collecting local image information as a video sequence. The video data may be provided as a plurality of separate pictures that are given motion when viewed sequentially. The pictures themselves may be organized as a spatial pixel array, wherein each pixel depends on the sampling structure, color space, etc. used by one or more samples. The relationship between pixels and samples may be easily understood by those skilled in the art. The following focuses on describing samples.
[0088] According to an embodiment, the video encoder (503) can encode and compress the pictures of the source video sequence into an encoded video sequence (543) in real time or according to any other time constraints required by the application. Implementing an appropriate encoding speed is a function of the controller (550). In some embodiments, the controller (550) controls other functional units as described below and is functionally coupled to the other units. For simplicity, the coupling is not depicted. The parameters set by the controller (550) may include parameters related to rate control, such as picture skipping, quantizer, lambda value of rate-distortion optimization technology, ..., picture size, picture group (Group of Pictures, GOP) layout, maximum motion vector search range, etc. The controller (550) can be configured to have other suitable functions that belong to the video encoder (503) optimized for a certain system design.
[0089] In some embodiments, the video encoder (503) is configured to operate in an encoding loop. As a simple description, in an example, the encoding loop may include a source encoder (530) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be encoded and a reference picture) and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to create sample data in a similar manner to how the (remote) decoder creates sample data (because in the video compression techniques considered in the disclosed subject matter, any compression between the symbols and the encoded video bitstream is lossless). The reconstructed sample stream (sample data) is input to a reference picture memory (534). Since the decoding of the symbol stream produces bit-accurate results independent of the decoder location (local or remote), the contents of the reference picture memory (534) are also bit-accurate between the local encoder and the remote encoder. In other words, the reference picture samples "seen" by the prediction part of the encoder are exactly the same as the sample values "seen" by the decoder when using prediction during decoding. This basic principle of reference picture synchronization (and the drift that occurs when synchronization cannot be maintained, eg due to channel errors) is also used in some related techniques.
[0090] The operation of the "local" decoder (533) can be combined with the above Figure 4 The "remote" decoder of the video decoder (410) described in detail is the same. However, additional brief reference is made to Figure 4 , when symbols are available and the entropy encoder (545) and the parser (420) are capable of losslessly encoding / decoding the symbols into an encoded video sequence, the entropy decoding portion of the video decoder (410) including the buffer memory (415) and the parser (420) may not be fully implemented in the local decoder (533).
[0091] At this point it can be observed that any decoder techniques other than parsing / entropy decoding present in the decoder must also be present in the corresponding encoder in substantially the same functional form. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder techniques can be simplified because encoder techniques are inverse to the fully described decoder techniques. A more detailed description is only required in certain areas and is provided below.
[0092] During operation, in some examples, the source encoder (530) may perform motion compensated predictive coding that predictively encodes an input picture with reference to one or more previously encoded pictures in a video sequence designated as "reference pictures." In this manner, the encoding engine (532) encodes the differences between pixel blocks of the input picture and pixel blocks of a reference picture that may be selected as a prediction reference for the input picture.
[0093] The local video decoder (533) can decode the encoded video data that can be designated as a reference picture based on the symbols created by the source encoder (530). The operation of the encoding engine (532) can facilitate a lossy process. When the encoded video data can be decoded at the video decoder ( Figure 5 When the video sequence is decoded at a remote video decoder (not shown), the reconstructed video sequence may typically be a copy of the source video sequence with some errors. The local video decoder (533) replicates the decoding process that may be performed by the video decoder on the reference picture and may cause the reconstructed reference picture to be stored in the reference picture memory (534). In this way, the video encoder (503) may store a copy of the reconstructed reference picture locally that has common content (absent transmission errors) with the reconstructed reference picture to be obtained by the remote video decoder.
[0094] The predictor (535) can perform a prediction search for the encoding engine (532). That is, for a new picture to be encoded, the predictor (535) can search the reference picture memory (534) for sample data (as a candidate reference pixel block) or certain metadata that can be used as a prediction reference corresponding to the new picture, such as a reference picture motion vector, block shape, etc. The predictor (535) can operate pixel by pixel block based on the sample block to find an appropriate prediction reference. In some cases, based on the search results obtained by the predictor (535), it can be determined that the input picture can have a prediction reference obtained from multiple reference pictures stored in the reference picture memory (534).
[0095] The controller (550) can manage the encoding operations of the source encoder (530), including, for example, setting parameters and subgroup parameters for encoding video data.
[0096] The outputs of all the above-mentioned functional units may be entropy encoded in an entropy encoder (545). The entropy encoder (545) performs lossless compression on the symbols generated by the various functional units according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc., thereby converting the symbols into a coded video sequence.
[0097] The transmitter (540) can buffer the encoded video sequence created by the entropy encoder (545) in preparation for transmission via a communication channel (560), which can be a hardware / software link to a storage device for storing the encoded video data. The transmitter 540 can combine the encoded video data from the video encoder (503) with other data to be transmitted, such as encoded audio data and / or an auxiliary data stream (source not shown).
[0098] The controller (550) may manage the operation of the video encoder (503). During encoding, the controller (550) may assign a certain coded picture type to each coded picture, which may affect the coding techniques that may be applied to the corresponding picture. For example, a picture may generally be assigned to one of the following picture types:
[0099] An intra picture (I picture) is a picture that can be encoded and decoded without using any other picture in the sequence as a prediction source. Some video codecs allow different types of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of the variations of I pictures and their corresponding applications and features.
[0100] A predictive picture (P picture), which is a picture that can be encoded and decoded using intra prediction or inter prediction, which can predict the sample values of each block using at most one motion vector and a reference index.
[0101] Bidirectional predictive pictures (B pictures), which are pictures that can be encoded and decoded using intra prediction or inter prediction, which can use up to two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.
[0102] The source picture can usually be spatially subdivided into multiple blocks of samples (for example, blocks of 4×4, 8×8, 4×8 or 16×16 samples) and encoded block by block. These blocks can be predictively encoded with reference to other (encoded) blocks, which are allocated and determined according to the encoding of the corresponding picture applied to the block. For example, blocks of I pictures can be non-predictively encoded, or blocks of I pictures can be predictively encoded (spatial prediction or intra-frame prediction) with reference to already encoded blocks of the same picture. Blocks of P pictures can be predictively encoded with reference to a previously encoded reference picture, via spatial prediction or via temporal prediction. Blocks of B pictures can be predictively encoded with reference to one or two previously encoded reference pictures, via spatial prediction or via temporal prediction.
[0103] The video encoder (503) may perform encoding operations according to a predetermined video encoding technique or video encoding standard such as ITU-T H.265 Recommendation. In the operation of the video encoder (503), the video encoder (503) may perform various compression operations, including predictive encoding operations that utilize temporal redundancy and spatial redundancy in the input video sequence. Therefore, the encoded video data may conform to the syntax specified by the video encoding technique or video encoding standard used.
[0104] In an embodiment, the transmitter (540) may transmit the additional data along with the encoded video. The source encoder (530) may include such data as part of the encoded video sequence. The additional data may include temporal / spatial / SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, etc.
[0105] Video may be captured as multiple source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often simplified to intra-prediction) exploits spatial correlations in a given picture, while inter-picture prediction exploits (temporal or other) correlations between pictures. In an example, a particular picture being encoded / decoded is divided into blocks, and the particular picture being encoded / decoded is referred to as the current picture. When a block in the current picture is similar to a reference block in a reference picture that was previously encoded in the video and is still buffered, the block in the current picture may be encoded by a vector called a motion vector. The motion vector points to a reference block in a reference picture and, in the case of using multiple reference pictures, the motion vector may have a third dimension that identifies the reference picture.
[0106] In some embodiments, bidirectional prediction techniques may be used in inter-picture prediction. According to the bidirectional prediction technique, two reference pictures are used, for example, a first reference picture and a second reference picture that are both before the current picture in the video in decoding order (but may be in the past and in the future in display order, respectively). A block in the current picture may be encoded by a first motion vector pointing to a first reference block in the first reference picture and a second motion vector pointing to a second reference block in the second reference picture. The block may be predicted by a combination of the first reference block and the second reference block.
[0107] In addition, merge mode techniques can be used in inter-picture prediction to improve coding efficiency.
[0108] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed in units of blocks. For example, according to the HEVC standard, a picture in a video picture sequence is divided into coding tree units (CTUs) for compression, and the CTUs in the picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. Typically, a CTU includes three coding tree blocks (CTBs), which are a luminance CTB and two chrominance CTBs. Each CTU can be recursively split into one or more coding units (CUs) in the form of a quadtree. For example, a 64×64 pixel CTU can be split into a 64×64 pixel CU, or 4 32×32 pixel CUs, or 16 16×16 pixel CUs. In the example, each CU is analyzed to determine a prediction type for the CU, such as an inter-prediction type or an intra-prediction type. The CU is split into one or more prediction units (PUs) based on temporal predictability and / or spatial predictability. Typically, each PU includes a luma prediction block (PB) and two chroma PBs. In an embodiment, the prediction operation in encoding (encoding / decoding) is performed in units of prediction blocks. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values (e.g., luma values), such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, etc.
[0109] Figure 6 A diagram of a video encoder (603) according to another embodiment of the present disclosure is shown. The video encoder (603) is configured to receive a processed block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures and encode the processed block into an encoded picture that is part of an encoded video sequence. In an example, the video encoder (603) is used instead of Figure 3 The video encoder (303) in the example.
[0110] In the HEVC example, the video encoder (603) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples. The video encoder (603) uses, for example, rate-distortion (RD) optimization to determine whether to use intra mode, inter mode, or bidirectional prediction mode to encode the processing block. When the processing block is to be encoded in intra mode, the video encoder (603) can use intra prediction techniques to encode the processing block into a coded picture; and when the processing block is to be encoded in inter mode or bidirectional prediction mode, the video encoder (603) can use inter prediction techniques or bidirectional prediction techniques to encode the processing block into a coded picture, respectively. In some video coding techniques, the merge mode can be an inter-picture prediction submode, which can derive a motion vector from one or more motion vector predictors without the aid of an encoded motion vector component external to the predictor. In some other video coding techniques, there can be a motion vector component applicable to the subject block. In the example, the video encoder (603) includes other components, such as a mode decision module (not shown) for determining the mode of the processing block.
[0111] exist Figure 6 In the example of FIG. 6 , the video encoder ( 603 ) includes: Figure 6 An inter-frame encoder (630), an intra-frame encoder (622), a residual calculator (623), a switch (626), a residual encoder (624), a general controller (621), and an entropy encoder (625) are shown coupled together.
[0112] The inter-frame encoder (630) is configured to: receive a sample of a current block (e.g., a processing block); compare the block with one or more reference blocks in a reference picture (e.g., blocks in a previous picture and a subsequent picture); generate inter-frame prediction information (e.g., description of redundant information according to the inter-frame coding technology, motion vectors, merge mode information); and calculate an inter-frame prediction result (e.g., a predicted block) based on the inter-frame prediction information using any suitable technology. In some examples, the reference picture is a coded reference picture obtained by decoding based on the coded video information.
[0113] The intra encoder (622) is configured to: receive samples of a current block (e.g., a processing block); compare the block with an already encoded block in the same picture in some cases; generate quantization coefficients after transformation; and in some cases also generate intra prediction information (e.g., intra prediction direction information according to one or more intra coding techniques). In an example, the intra encoder (622) can also calculate an intra prediction result (e.g., a predicted block) based on the intra prediction information and a reference block in the same picture.
[0114] The general controller (621) is configured to: determine general control data; and control other components of the video encoder (603) based on the general control data. In an example, the general controller (621) determines the mode of the block and provides a control signal to the switch (626) based on the mode. For example, when the mode is an intra-frame mode, the general controller (621) controls the switch (626) to select the intra-frame mode result for use by the residual calculator (623), and controls the entropy encoder (625) to select the intra-frame prediction information, and includes the intra-frame prediction information in the bitstream; and when the mode is not an inter-frame mode, the general controller (621) controls the switch (626) to select the inter-frame prediction result for use by the residual calculator (623), and controls the entropy encoder (625) to select the inter-frame prediction information, and includes the inter-frame prediction information in the bitstream.
[0115] The residual calculator (623) is configured to calculate a difference (residual data) between the received block and a prediction result selected from the intra encoder (622) or the inter encoder (630).
[0116] The residual encoder (624) is configured to operate based on the residual data to encode the residual data to generate transform coefficients. In an example, the residual encoder (624) is configured to convert the residual data from the spatial domain to the frequency domain and generate transform coefficients. The transform coefficients are then subjected to quantization to obtain quantized transform coefficients.
[0117] In various embodiments, the video encoder (603) further includes a residual decoder (628). The residual decoder (628) is configured to perform an inverse transform and generate decoded residual data. The decoded residual data can be used appropriately by the intra encoder (622) and the inter encoder (630). For example, the inter encoder (630) can generate a decoded block based on the decoded residual data and inter prediction information, and the intra encoder (622) can generate a decoded block based on the decoded residual data and intra prediction information. In some examples, the decoded blocks are appropriately processed to generate a decoded picture, and the decoded picture can be buffered in a memory circuit (not shown) and used as a reference picture.
[0118] The entropy encoder (625) is configured to format the bitstream to include the encoded blocks. The entropy encoder (625) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (625) is configured to include general control data, selected prediction information (e.g., intra-frame prediction information or inter-frame prediction information), residual information, and other suitable information in the bitstream. Note that in accordance with the disclosed subject matter, when the block is encoded in inter-frame mode or the merge sub-mode of the bi-prediction mode, there is no residual information.
[0119] Figure 7 A diagram showing a video decoder (710) according to another embodiment of the present disclosure. The video decoder (710) is configured to: receive a coded picture as part of a coded video sequence; and decode the coded picture to generate a reconstructed picture. In an example, the video decoder (710) is used instead of Figure 3 The video decoder (310) of the example.
[0120] exist Figure 7 In this example, the video decoder (710) includes Figure 7 An entropy decoder (771), an inter-frame decoder (780), a residual decoder (773), a reconstruction module (774) and an intra-frame decoder (772) are shown coupled together.
[0121] The entropy decoder (771) can be configured to reconstruct certain symbols from the encoded picture, which represent syntax elements constituting the encoded picture. Such symbols may include, for example, a mode for encoding the block (such as, for example, intra mode, inter mode, bidirectional prediction mode, a merged submode of inter mode and bidirectional prediction mode, or another submode); prediction information (e.g., intra prediction information or inter prediction information) that can identify certain samples or metadata for prediction by the intra decoder (772) or the inter decoder (780), respectively; residual information in the form of, for example, quantized transform coefficients, etc. In an example, when the prediction mode is the inter mode or the bidirectional prediction mode, the inter prediction information is provided to the inter decoder (780); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (772). The residual information can be subjected to inverse quantization and provided to the residual decoder (773).
[0122] The inter-frame decoder (780) is configured to: receive inter-frame prediction information; and generate an inter-frame prediction result based on the inter-frame prediction information.
[0123] The intra decoder (772) is configured to: receive intra prediction information; and generate a prediction result based on the intra prediction information.
[0124] The residual decoder (773) is configured to: perform inverse quantization to extract dequantized transform coefficients; and process the dequantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residual decoder (773) may also require certain control information to include a quantizer parameter (QP), and the information may be provided by the entropy decoder (771) (not depicted as a data path because this is only low-volume control information).
[0125] The reconstruction module (774) is configured to combine the residual output by the residual decoder (773) with the prediction result (which can be output by the inter-frame prediction module or the intra-frame prediction module) in the spatial domain to form a reconstructed block, which can be part of a reconstructed picture, which in turn can be part of a reconstructed video. It should be noted that other suitable operations such as deblocking operations can be performed to improve visual quality.
[0126] It should be noted that the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using any suitable technology. In an embodiment, the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using one or more integrated circuits. In another embodiment, the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using one or more processors that execute software instructions.
[0127] II. Derivation of Boundary Strength during Deblocking
[0128] In HEVC, deblocking filtering is performed for each CU in the same order as the decoding process. First, the vertical edges are filtered (horizontal filtering), and then the horizontal edges are filtered (vertical filtering). When it is determined that the 8×8 block boundary is to be filtered, the filtering can be applied to the 8×8 block boundaries for both the luminance component and the chrominance component. In order to reduce complexity, the 4×4 block boundaries may not be processed. Boundary strength (Bs) can be used to indicate the degree or strength of the deblocking filtering process used for the boundary. In an embodiment, the value of Bs 2 indicates strong filtering, 1 indicates weak filtering, and 0 indicates no deblocking filtering.
[0129] In an embodiment, Bs is calculated based on a 4×4 sample grid, but Bs may be remapped to an 8×8 sample grid. In an example, an 8×8 block includes four 4×4 blocks, so the boundary of an 8×8 block includes two adjacent 4×4 blocks on both sides. The maximum of the two values of Bs corresponding to the 8 pixels forming a line in the 4×4 grid may be selected as the Bs for the boundary in the 8×8 grid.
[0130] Figure 8 800 for determining a Bs value according to an embodiment of the present disclosure. Note that in other embodiments, Figure 8 The order of the steps in may be reordered or one or more steps may be omitted.
[0131] exist Figure 8 In the example, P and Q are two adjacent blocks with a boundary between P and Q. In the case of a vertical edge, P may represent a block located on the left side of the boundary, and Q may represent a block located on the right side of the boundary. In the case of a horizontal edge, P may represent a block located above the boundary, and Q may represent a block located below the boundary.
[0132] like Figure 8 As shown, the Bs value may be determined based on: a prediction mode (eg, an intra coding mode); a non-zero transform coefficient (eg, the presence of a non-zero transform coefficient); a reference picture; multiple motion vectors and motion vector differences.
[0133] At step (S810), the process (800) determines whether P or Q is encoded in an intra-frame prediction mode. When it is determined that at least one of P and Q is encoded in an intra-frame prediction mode, the process (800) determines a first value (e.g., 2) of Bs. Otherwise, the process (800) proceeds to step (S820).
[0134] At step (S820), the process (800) determines whether P or Q has a non-zero transform coefficient. When it is determined that at least one of P and Q has a non-zero transform coefficient, the process (800) determines a second value (e.g., 1) of Bs. Otherwise, the process (800) proceeds to step (S830).
[0135] At step (S830), the process (800) determines whether P and Q have different reference pictures. When it is determined that P and Q have different reference pictures, the process (800) determines a third value (e.g., 1) of Bs. Otherwise, the process (800) proceeds to step (S840).
[0136] At step (S840), the process (800) determines whether P and Q have different numbers of motion vectors. When it is determined that P and Q have different numbers of motion vectors, the process (800) determines a fourth value (e.g., 1) of Bs. Otherwise, the process (800) proceeds to step (S850).
[0137] At step (S850), the process (800) determines whether the motion vector difference between P and Q is greater than or equal to a threshold value T. When it is determined that the motion vector difference between P and Q is greater than or equal to the threshold value T, the process (800) determines a fifth value (e.g., 1) of Bs. Otherwise, the process (800) determines a sixth value (e.g., 0) of Bs. In an embodiment, the threshold value T is set to 1 pixel. In an example, the MV precision is 1 / 4 pixel, and the value of the MV difference threshold may be set to 4. In another example, the MV precision is 1 / 16, and the value of the MV difference may be set to 16.
[0138] III. Block Differential Pulse Code Modulation Mode
[0139] Block Differential Pulse-code Modulation (BDPCM) is an intra-coding tool that uses the Differential Pulse-code Modulation (DPCM) method at the block level. Whenever the CU is a CU that is intra-coded for brightness with each dimension less than or equal to 32, bdpcm_flag can be transmitted at the CU level. This flag indicates whether conventional intra-coding or DPCM is used, and the flag is encoded using a single context-based adaptive binary arithmetic coding (CABAC).
[0140] BDPCM can use the median edge detector of LOCO-I (for example, used in JPEG-LS). Specifically, for a current pixel X with pixel A as the left neighbor, pixel B as the upper neighbor, and C as the upper left neighbor, the prediction of the current pixel XP(X) is determined by the following formula:
[0141] If C ≥ max(A, B), then P(X) = min(A, B)
[0142] If C ≤ min(A, B), then P(X) = max(A, B)
[0143] Otherwise, P(X)=A+BC.
[0144] When predicting from the upper row and left column of the CU, the pixel predictor uses unfiltered reference pixels. The pixel predictor then uses the reconstructed pixels for the rest of the CU. The pixels are processed in raster scan order inside the CU. After rescaling, the prediction error can be quantized in the spatial domain in the same way as the transform skip quantizer. Each pixel can be reconstructed by adding the dequantized prediction error to the prediction. Therefore, the reconstructed pixel can be used to predict the next pixel in raster scan order. The amplitude and sign of the quantized prediction error are encoded separately. cbf_bdpcm_flag is also encoded. If cbf_bdpcm_flag is equal to 0, all amplitudes of the block are decoded to zero. If cbf_bdpcm_flag is equal to 1, all amplitudes of the block are encoded separately in raster scan order. To reduce complexity, the amplitude can be limited to at most 31 (including the endpoint values). The amplitude can be encoded using unary binarization with three contexts for the first bin, then one context for each additional bin until the 12th bin, and one context for all remaining bins. One symbol can be encoded for each zero residual in the bypass model.
[0145] To maintain coherence with conventional intra mode prediction, the first mode in the most probable mode (MPM) list for intra mode prediction is associated with the BDPCM CU (not transmitted) and can be used to generate the MPM for subsequent blocks.
[0146] At the boundary / border between two BDPCM-encoded blocks, the deblocking filter may be disabled, since none of the BDPCM-encoded blocks undergo a transform, which is usually the cause of blocking artifacts. Furthermore, BDPCM may not use any other steps than those described here. In particular, as described above, BDPCM may not perform any transform when encoding the residual.
[0147] Several tests on BDPCM have been conducted to study BDPCM's throughput improvements and interactions with other Screen Content Coding (SCC) tools.
[0148] Fig. 9A An example of a BDPCM-encoded block according to an embodiment is shown. The example shown in FIG9 is related to Test 1. Fig. 9A As shown, to increase throughput, a block may be divided diagonally into two halves (eg, stair-shaped partitioning), thereby dividing a smaller block (eg, having sizes of 4×4, 4×8, and 8×4) into two independently decodable regions.
[0149] In an embodiment, pixels from one area of the first half may not be allowed to use pixels from another area of the second half for computational prediction. If pixels from one area need to use pixels from another area for computational prediction, reference pixels need to be used instead. For example, pixels from another area may be replaced by the closest reference pixel. For example, the left neighbor may be replaced by the left reference pixel from the same row, the top neighbor may be replaced by the left reference pixel from the same column, and the upper left neighbor may be replaced by the closest reference pixel. Therefore, two areas may be processed in parallel.
[0150] Fig. 9A Also provided are exemplary throughputs for each block of different sizes. For example, for a 4×4 block with two independently decodable regions, the throughput can be 4 pixels per cycle. For a 4×8 block or an 8×4 block with two independently decodable regions, the throughput can be 5.33 pixels per cycle. For an 8×8 block without independently decodable regions, the throughput can be 4.26 pixels per cycle. For an 8×8 block without independently decodable regions, the throughput can be 4.26 pixels per cycle. For a 16×16 block without independently decodable regions, the throughput can be 8.25 pixels per cycle.
[0151] Fig. 9B An example of a BDPCM-encoded block according to an embodiment is shown. Fig. 9B The examples shown are related to Test 2. Fig. 9B In the example, a vertical predictor or a horizontal predictor may be used instead of a JPEG-LS predictor to partition the block. A vertical predictor or a horizontal predictor may be selected and signaled at the block level. The shape of the independently decodable region reflects the geometry of the predictor. Due to the shape of the horizontal predictor or the vertical predictor that uses the left pixel or the top pixel for the prediction of the current pixel, the most efficient way to process the block may be to process all pixels of a column or a row in parallel and process the columns or rows sequentially. For example, in order to increase throughput, when the predictor selected for the block is a vertical predictor, a block with a width of 4 is divided into two halves at a horizontal boundary, and when the predictor selected for the block is a horizontal predictor, a block with a height of 4 is divided into two halves at a vertical boundary. For a 4×4 block, an 8×4 block, or a 4×8 block with two independently decodable regions, the throughput may be 8 pixels per cycle. For a 4×8 block, an 8×4 block, or an 8×8 block that does not have an independently decodable region, the throughput may be 8 pixels per cycle. For a 16x16 block without independently decodable areas, the throughput may be 16 pixels per cycle.
[0152] In Test 3, according to an embodiment of the present disclosure, the BDPCM residual amplitude is limited to 28 and the amplitude is encoded using truncated unary binarization for the first 12 bins and then encoded using 2nd order exponential Golomb equiprobable bins for the rest (e.g., using encodeRemAbsEP() function).
[0153] IV. Transform Coefficient Coding
[0154] After the video signal is reduced to a series of syntax elements, entropy coding can be performed in the final stage of video encoding (or the first stage of video decoding). Entropy coding can be a lossless compression scheme that uses statistical properties to compress data so that the number of bits used to represent the data is logarithmically proportional to the probability of the data. For example, by entropy coding a set of syntax elements, the bits representing the syntax elements (called bins) can be converted into fewer bits in the bitstream (called coded bits). CABAC is a form of entropy coding. In CABAC, a context model for estimating probability provided for each bin in a bin sequence can be determined based on the context associated with each bin. Subsequently, a binary arithmetic coding process can be performed using probability estimates to encode the bin sequence into coded bits in the bitstream. In addition, the context model is updated with a new probability estimate based on the coded bins.
[0155] Fig. 10A An exemplary entropy encoder (1000A) based on CABAC according to an embodiment is shown. For example, the entropy encoder (1000A) can be Figure 5 The entropy encoder (545) in the example or Figure 6 The entropy encoder (625) in the example is implemented. The entropy encoder (1000A) may include a context modeler (1010) and a binary arithmetic encoder (1020). In the example, various types of syntax elements are provided as input to the entropy encoder (1000A). For example, the bins of binary-valued syntax elements may be directly input to the context modeler (1010), while non-binary-valued syntax elements may be binarized into a bin string before the bins in the bin string are input to the context modeler (1010).
[0156] In an example, a context modeler (1010) receives bits of a syntax element and performs a context modeling process to select a context model for each received bit. For example, bits of a binary syntax element of a transform coefficient in a transform block are received. When the current block is encoded using BDPCM for prediction, the transform block may be a transform skip block. Therefore, a context model for the bit may be determined based on, for example, the type of syntax element, the color component type of the transform component, the position of the transform coefficient, and previously processed neighboring transform coefficients. The context model may provide a probability estimate for the bit.
[0157] In an example, a set of context models may be configured for one or more types of grammatical elements. These context models may be arranged in a context model list (1002) in a memory (1001), which is stored in a Fig. 10A In the memory (1001) shown. Each entry in the context model list (1002) can represent a context model. An index can be assigned to each context model in the list, which is called a context model index or a context index. In addition, each context model may include a probability estimate or a parameter indicating a probability estimate. The probability estimate may indicate the possibility that a binary bit is 0 or 1. For example, during context modeling, the context modeler (1010) can calculate a context index for a binary bit, and accordingly, a context model can be selected from the context model list (1002) according to the context index and the context model is assigned to the binary bit.
[0158] In addition, the probability estimates in the context model list (1002) can be initialized at the beginning of the operation of the entropy encoder (1000A). After the context model in the context model list (1002) is assigned to the bin and the bin is encoded using the context model, the context model can be updated according to the value of the bin using the updated probability estimate.
[0159] In an example, a binary arithmetic encoder (1020) receives a binary bit and a context model (eg, a probability estimate) assigned to the binary bit, and performs a binary arithmetic encoding process accordingly, thereby generating coded bits, and transmitting the coded bits in a bitstream.
[0160] Fig. 10B An exemplary entropy decoder (1000B) based on CABAC according to an embodiment is shown. For example, the entropy decoder (1000B) can be Figure 4 The parser (420) in the example or Figure 7The entropy decoder (771) in the example is implemented. The entropy decoder (1000B) may include a binary arithmetic decoder (1030) and a context modeler (1040). The binary arithmetic decoder (1030) receives the encoded bits from the bit stream and performs a binary arithmetic decoding process to recover the binary bits from the encoded bits. The context modeler (1040) may operate similarly to the context modeler (1010). For example, the context modeler (1040) may select a context model from a context model list (1004) stored in a memory (1003) and provide the selected context model to the binary arithmetic decoder (1030). The context modeler (1040) may determine the context model based on the binary bits recovered from the binary arithmetic decoder (1030). For example, based on the recovered binary bits, the context modeler (1040) may know the type of syntax element of the next binary bit to be decoded and the value of the previously decoded syntax element. This information is used to determine the context model of the next binary bit to be decoded.
[0161] V. Restrictions on Multiple Context Encoded Bins
[0162] As described above, the residual associated with each pixel can be binarized into a binary bit representing the sign of the residual and a series of binary bits representing the absolute value of the residual. The absolute value can be quantized so that it is less than or equal to a given number (e.g., 31 or 28). One or more context models or equal probability (EP) models (i.e., bypass models) can be associated with each binary bit. For each residual symbol, up to 13 binary bits can be associated with one or more context models. A large number of context coding binary bits (e.g., binary bits associated with at least one context model) may reduce the throughput of an entropy encoder or entropy decoder during syntax encoding, and a large number of context coding binary bits may become a burden on certain codec implementations (e.g., certain hardware codecs). Therefore, the maximum number of context coding binary bits is set, which can not only improve the encoding speed, but also reduce the required memory size and the cost of maintaining these context models.
[0163] Thus, aspects of the present disclosure include methods for limiting the number of context-encoded bits used for entropy encoding of transform coefficients. For example, in BDPCM mode, multiple bits in the binary representation of the quantized residual can be associated with a context model. In some embodiments, one or more restrictions are imposed on the number of bits associated with the context model.
[0164] The W×H block may be virtually divided into a plurality of sub-regions. Subsets of the plurality of sub-regions may be encoded using BDPCMs in parallel with each other. In an example, each of the plurality of sub-regions may be encoded using BDPCMs in parallel with each other. The W×H block may be a transform block or a transform skip block. The maximum number of binary bits (e.g., MaxCcbs) after context encoding for each sub-region may be set to B×A, where A is the number of quantized residuals in the sub-region and B is a positive number. In the bitstream, for example, from an encoder to a decoder, B may be signaled or may not be signaled. When the number of binary bits in a sub-region does not exceed a limit (e.g., B×A), each of the binary bits in the binary bits in the sub-region may be encoded using a context model. When the number of binary bits in a sub-region exceeds the limit, a different model (e.g., an EP model) may be used to encode the remaining binary bits that are not context encoded.
[0165] In an embodiment, B is the same for the luma component and the chroma component. For example, B=2. In an embodiment, B is different for the luma component and the chroma component. For example, B=2 for the luma component and B=1 for the chroma component.
[0166] In an embodiment, B may be a decimal, such as 0.5 or 1.2. In some examples, B depends on A. A is the number of quantized residuals in the sub-region as defined above. For example, when A is less than a threshold, B may be equal to a specific value (e.g., 1). Otherwise, B may be equal to another value (e.g., 2). The threshold may be, for example, 4, 8, 16, 32, 64, 128, or 256.
[0167] In an embodiment, B may be determined based on two thresholds. For example, when A is less than a first threshold, B may be equal to a first value (e.g., 1). When A is equal to or greater than a second threshold, B may be equal to a second value (e.g., 2). As an example, the first threshold and the second threshold may be any one of the following values: 4, 8, 16, 32, 64, 128, and / or 256.
[0168] In an embodiment, B may be determined based on more than two (e.g., three) thresholds in a manner similar to that described above. For example, when A is less than a first threshold, B may be equal to a first value (e.g., 0.5). When A is equal to or greater than the first threshold and less than a second threshold, B may be equal to a second value (e.g., 1). When A is equal to or greater than a third threshold, B may be equal to a third value (e.g., 2). As an example, the first threshold, the second threshold, and the third threshold may be any one of the following values: 4, 8, 16, 32, 64, 128, and / or 256.
[0169] In an embodiment, the W×H block is not divided into sub-regions and includes only one region. The maximum number of binary bits after context coding for the region may also be set to B×A. In this case, A may be equal to W×H, B is a positive number, and the maximum number of binary bits after context coding (e.g., MaxCcbs) is equal to B×W×H. When the number of binary bits in the block does not exceed the limit (e.g., B×W×H), each of the binary bits in the binary bits in the block may be encoded using a context model. When the number of binary bits in the block exceeds the limit, a different model (e.g., an EP model) may be used to encode the remaining binary bits that are not context coded.
[0170] In an embodiment, a W×H block is divided into H sub-regions and each sub-region includes a row of W residuals. In this case, A can be equal to W, and the maximum number of context-encoded bins per row (e.g., MaxCcbs) is set equal to B×W. When the number of bins in the row does not exceed the limit (e.g., B×W), each of the bins in the row can be encoded using a context model. When the number of bins in the row exceeds the limit, a different model (e.g., an EP model) can be used to encode the remaining bins that are not associated with the context model.
[0171] In an embodiment, a W×H block is divided into W sub-regions and each sub-region includes a column of H residuals. In this case, A can be equal to H, and the maximum number of context-coded bins per column (e.g., MaxCcbs) is set equal to B×H. When the number of bins in a sub-region does not exceed the limit (e.g., B×H), each bin in the bins in the column can be encoded using a context model. When the number of bins in the column exceeds the limit, a different model (e.g., an EP model) can be used to encode the remaining bins that are not associated with a context model.
[0172] In an embodiment, any segmentation such as Fig. 9A The described stair-shaped segmentation or Fig. 9B The horizontal split / vertical split described above can generate sub-regions. In addition, more than two splits can be used in other embodiments described above.
[0173] Fig.11 An exemplary method of coefficient encoding based on the maximum number of bins after context encoding is shown. For example, the maximum number of bins after context encoding may be set based on one or more of the embodiments described above.
[0174] As described above, the bits representing the syntax elements (eg, binary bits) may be converted into fewer bits in the bitstream by entropy encoding the syntax elements. Fig.11 In the example, the quantized residual (1110) may be converted into a binary string (1120) using binary coding. For example, the converted binary string (1120) may be 1101001000111110001110101001010101010101010101011100011100010110101010110101110. The binary string (1120) may include 4 segments and may represent 2 syntax elements. The binary bits for the first syntax element are 1101001000111110001110101001010, and the binary bits for the second syntax element are 1001010101010111000111000101101010101110. An entropy encoder based on CABAC, for example Figure 5 The entropy encoder (545) in Figure 6 The entropy encoder (625) in the example may perform context modeling on the binary string based on the maximum number of binary bits after context encoding. For example, when the width W of the block and the height H of the block are both equal to 4, and the block includes only one region, A is equal to 4×4=16 and B may be set to 2. Therefore, the maximum number of binary bits after context encoding in the block is B×A=32. Therefore, Fig.11 As shown, when the number of binary bits (shown in bold and underlined fonts) after context encoding for the block does not reach 32 (as shown in the first 3 segments in the binary string), the entropy encoder is free to choose whether to use context modeling to encode the binary bits according to the BDPCM algorithm. When the maximum number of binary bits after context encoding (e.g., MaxCcbs) is reached (as shown in the fourth segment), the remaining binary bits cannot be encoded using context modeling. Alternatively, the EP model can be used to encode the binary bits. In some examples, the entropy encoder may include a counter, and the counter counts the number of binary bits after context encoding. The counter output may be initially set to 0 and may be counted from 0 to the maximum number of binary bits after context encoding. When the counter reaches the maximum number of binary bits after context encoding, context modeling may not be used to encode the remaining binary bits.
[0175] In an embodiment, when the width W of the block and the height H of the block are both equal to 8 and the block is split into 4 sub-regions of the same size, each sub-region has a size of 4×4. Therefore, A is equal to 16. In this case, B can be 2 and the maximum number of binary bits after context coding is 32. Therefore, Fig.11The described example can also be applied to this embodiment.
[0176] Fig.12 An exemplary method for decoding coefficients based on the maximum number of binary bits after context coding is shown. According to an embodiment, an entropy decoder based on CABAC may be provided. The entropy decoder may be Figure 4 The parser (420) in the example or Figure 7 The entropy decoder (771) in the example is implemented. As described above, the binary arithmetic decoder of the entropy decoder receives the encoded bits from the bit stream (1210) and performs a binary arithmetic decoding process to restore the binary bits from the encoded binary bits (1220). Similar to the entropy encoder, the entropy decoder can also determine the maximum number of binary bits after context encoding based on the size of the block or the divided sub-region. For example, when the width W of the block and the height H of the block are both equal to 4 and the block includes only one region, A is equal to 16 and B can be 2. Therefore, the maximum number of binary bits after context encoding is set to B×A=32. Therefore, if Fig.12 As shown, when the number of context-encoded bits (shown in bold and underlined font) for the block does not reach 32 (as shown in the first 3 segments in the binary string), the entropy decoder is free to choose whether to use context modeling to decode the encoded bits according to the BDPCM algorithm. When the maximum number of context-encoded bits is reached (as shown in the fourth segment), the bits cannot be decoded using context modeling. Alternatively, the EP model can be used to decode the bits. The decoded binary string (1220) can be converted into a quantized residual (1230) using a debinarization process.
[0177] VI. Application of Deblocking Filter on BDPCM Encoded Blocks
[0178] As described above, a deblocking filter may be disabled at a boundary between two BDPCM coded blocks, because, for example, neither of the two BDPCM coded blocks undergoes a transformation that causes blocking artifacts. To avoid or minimize blocking artifacts, a deblocking filter may be applied between two blocks, wherein at least one of the blocks is coded in BDPCM to avoid or minimize perceptual artifacts.
[0179] In an embodiment, the deblocking filter may be always activated or deactivated between a BDPCM-encoded block and a non-BDPCM-encoded block. In some examples, the boundary strength (Bs) is set to a fixed value between a BDPCM-encoded block and a non-BDPCM-encoded block. The fixed value may be 0, 1, or 2. For example, a value of 0 indicates that the deblocking filter is deactivated, a value of 1 indicates that a weak filter is applied, and a value of 2 indicates that a strong filter is applied.
[0180] In an embodiment, a deblocking filter may be always activated between two adjacent BDPCM-encoded blocks. Bs may be set to different values depending on the prediction mode of the two BDPCM-encoded blocks. In some examples, Bs is set to 2 when one block is encoded with horizontal BDPCM and the other block is encoded with vertical BDPCM. In other examples, Bs is set to 1 when both blocks are encoded using horizontal prediction.
[0181] In some embodiments, the deblocking filter may be conditionally activated between two adjacent BDPCM-encoded blocks. In some examples, the deblocking filter is activated only when the difference in QP between two adjacent BDPCM-encoded blocks is greater than a threshold. For example, the threshold may be 0, 1, 2, or 3.
[0182] In some examples, the deblocking filter is activated only when two BDPCM-encoded blocks have different prediction modes. For example, the deblocking filter is activated when one block is encoded in horizontal BDPCM and the other block is encoded in vertical BDPCM.
[0183] In some examples, in the boundary strength derivation between two adjacent BDPCM modes, BDPCM is not considered as an intra mode. For two adjacent BDPCM blocks, the reference check and MV check in the boundary strength derivation are skipped. For example, when applying Figure 8 When the boundary strength derivation process described in is performed and at least one of the two adjacent BDPCM coded blocks has a non-zero coefficient, Bs is set to 1 and the deblocking filter is activated. When neither of the two adjacent BDPCM coded blocks has a non-zero coefficient, Bs is set to 0 and the deblocking filter is deactivated.
[0184] VII. Exemplary Decoding Process
[0185] Fig.13A flow chart outlining an entropy decoding process (1300) according to some embodiments of the present disclosure is shown. The process can be used for entropy decoding of several types of transform coefficient syntax elements based on the maximum number of bins after context encoding disclosed herein. In various embodiments, the process (1300) can be performed by a processing circuit, such as a processing circuit in a terminal device (210), a terminal device (220), a terminal device (230), and a terminal device (240), a processing circuit that performs the functions of a video decoder (310), a processing circuit that performs the functions of a video decoder (410), etc. In some embodiments, the process (1300) is implemented as software instructions, so that when the processing circuit executes the software instructions, the processing circuit performs the process (1300). The process starts at (S1301) and proceeds to (S1310).
[0186] At (S1310), a bitstream including encoded bits may be received. The encoded bits may be encoded according to the bits of various types of syntax elements corresponding to the residual of the transform skip block in the encoded picture. For example, the various types of syntax elements may include an importance syntax element, a parity syntax element, a syntax element greater than 1, and / or a syntax element greater than 2. The importance syntax element (e.g., sig_coeff_flag) may indicate that the absolute value (absLevel) of the current transform coefficient is greater than 0. The parity syntax element (e.g., par_level_flag) may indicate the parity of absLevel. A syntax element greater than 1 (e.g., rem_abs_gt1_flag) may indicate that absLevel-1 is greater than 0. A syntax element greater than 2 (e.g., rem_abs_gt2_flag) may indicate that absLevel-4 is greater than 0. The transform skip block may indicate that the transform block is not transformed. For example, when the current block is encoded using BDPCM, the transform block is not transformed.
[0187] At (S1320), context modeling may be performed to determine a context model for each of a plurality of bins of a syntax element for a region. The number of bins of a syntax element that is context-coded may not exceed the maximum number of context-coded bins set for the region. The number of bins of a syntax element is less than or equal to the total number of bins of a syntax element for a region of a transform skip block. The maximum number of bins after context coding may be determined according to one or more of the embodiments described above. For example, the maximum number of bins after context coding for a region of a transform skip block (e.g., MaxCcbs) is set to B×A, where B is a positive number and A is the number of quantized residuals in the region. B may be a predetermined number, such as an integer or a decimal. Alternatively, B may depend on A. B may be signaled from the encoder to the decoder, and thus the decoder may also determine the maximum number of bins after context coding of B×A.
[0188] At (S1330), the coded bits of the number of bins of the syntax element may be decoded based on the determined context model. The coded bits of the remaining total number of bins of the syntax element for the region of the transform skip block may be decoded based on the EP model (i.e., the bypass model). The transform coefficient levels of the transform coefficients may be reconstructed based on the restored bins. The process (1300) proceeds to (S1399) and terminates at (S1399).
[0189] Fig.14 A flow chart outlining a deblocking filtering process (1400) according to some embodiments of the present disclosure is shown. Process (1400) may be used when at least one of a current block and a neighboring block of an encoded video bitstream is encoded using block differential pulse code modulation (BDPCM). In various embodiments, process (1400) may be performed by a processing circuit, such as a processing circuit in a terminal device (210), a terminal device (220), a terminal device (230), and a terminal device (240), a processing circuit that performs the functions of a video decoder (310), a processing circuit that performs the functions of a video decoder (410), etc. In some embodiments, process (1400) is implemented in software instructions, so that when the processing circuit executes the software instructions, the processing circuit performs process (1400). Processing starts at (S1401) and proceeds to (S1410).
[0190] At (S1410), a bitstream including encoded bits may be received.
[0191] At (S1420), an indicator may be received from the encoder. The indicator may indicate whether to use block differential pulse code modulation (BDPCM) to decode at least one of the current block and the neighboring block of the encoded video bitstream. The current block may be adjacent to the neighboring block. The current block is in the current CU, and the neighboring block may be in the same CU, or the neighboring block may be in another CU adjacent to the current CU. As described above, whenever the CU is a luma intra CU with a size less than or equal to 32, the bdpcm_flag may be transmitted at the CU level. Therefore, when the bdpcm_flag received by the decoder indicates that the CU is encoded using BDPCM, the current block is encoded using BDPCM. Therefore, at least one of the current block and the neighboring block in the CU of the received encoded video bitstream is decoded using BDPCM. Similarly, when the bdpcm_flag received by the decoder indicates that another CU is encoded using BDPCM and the neighboring block is in other CUs, the neighboring block is decoded using BDPCM. Therefore, at least one of a current block in a CU and neighboring blocks in other CUs of a received coded video bitstream is decoded using BDPCM.
[0192] At (S1430), the process (1400) determines whether at least one of the current block and the neighboring block is indicated to be encoded using BDPCM. When at least one of the current block and the neighboring block is indicated to be encoded using BDPCM, step (S1440) is performed.
[0193] At (S1440), a boundary strength (Bs) to be applied to a boundary between a current subblock in a current block and a neighboring subblock in a neighboring block may be determined.
[0194] At (S1450), a deblocking filter may be used to deblock a boundary between a current subblock in a current block and a neighboring subblock in a neighboring block according to the determined boundary strength. The deblocking filter may be applied according to one or more of the embodiments described above.
[0195] For example, when at least one of the current block and the neighboring block is indicated to be encoded using BDPCM, the deblocking filter may be always activated or deactivated between the current subblock in the current block and the neighboring subblock in the neighboring block. Bs to be applied to the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block may be determined. The current subblock in the current block and the neighboring subblock in the neighboring block may be adjacent to each other. When determining that Bs is used Figure 8 In the method described above, when at least one of the current subblock in the current block and the neighboring subblock in the neighboring block is intra-coded, Bs is determined to be a fixed value of 2. In an embodiment, Bs may be determined without using Figure 8Alternatively, Bs may be determined as a flexible value, such as 0, 1, or 2.
[0196] In an embodiment, when a neighboring sub-block in a neighboring block is also encoded using BDPCM, a deblocking filter may be always activated between the current sub-block and the neighboring sub-block.
[0197] In an embodiment, when a neighboring subblock in a neighboring block is also encoded using BDPCM, a deblocking filter may be conditionally activated between the current subblock and the neighboring subblock. The conditions may include: the difference in QP between the two subblocks; the prediction mode of the current block and the prediction mode of the neighboring block; and when the deblocking filter is activated according to Figure 8 The described method determines whether BDPCM is considered as intra mode when Bs.
[0198] The process (1400) proceeds to (S1499) and terminates at (S1499).
[0199] VIII. Apparatus for video decoding
[0200] The embodiment of the present application also provides a video decoding device, the device comprising:
[0201] A receiving module, configured to receive a bitstream, the bitstream comprising coded bits of binary bits of a syntax element, the syntax element corresponding to a residual of a region of a transform skip block in a coded picture;
[0202] A context modeling module, configured to perform context modeling to determine a context model for each binary bit of the grammatical element of the region, wherein the number of binary bits of the grammatical element context-coded does not exceed a maximum number of context-coded binary bits set for the region;
[0203] A decoding module is used to decode the coded bits of the binary bits of the syntax element based on the determined context model.
[0204] Optionally, the device further comprises:
[0205] A maximum number setting module is used to set the maximum number of context coding binary bits of the area of the transform skip block to B×A, where B is a positive number and A is the number of quantized residuals in the area.
[0206] Optionally, the decoding module is further used for:
[0207] Based on an equal probability model, a remaining total number of coded bits of bins of the syntax element for the region of the transform skip block is decoded, the remaining total number of coded bits not being context coded.
[0208] Optional, B is an integer.
[0209] Optional, B is a decimal.
[0210] Optionally, set B based on A.
[0211] Optionally, the transform skip block includes the area, and A is equal to W×H of the transform skip block, wherein W is the width of the transform skip block and H is the height of the transform skip block.
[0212] Optionally, the transform skip block is divided into a plurality of regions including the region;
[0213] The maximum number setting module is also used to set the maximum number of context coding binary bits in each of the multiple regions to B×A, where B is a positive number and A is the number of quantized residuals in each of the multiple regions.
[0214] The embodiment of the present application also provides a video decoding device, the device comprising:
[0215] A receiving module, used for receiving a coded video bit stream;
[0216] The receiving module is further configured to receive an indicator, wherein the indicator indicates whether to use block differential pulse code modulation (BDPCM) to encode at least one of a current block and a neighboring block of the encoded video bit stream, wherein the current block is adjacent to the neighboring block;
[0217] a deblocking module for determining a boundary strength to be applied to a boundary between a current subblock in the current block and a neighboring subblock in the neighboring block when at least one of the current block and the neighboring block is indicated to be encoded using BDPCM, and deblocking the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block using a deblocking filter according to the boundary strength.
[0218] Optionally, the neighboring sub-block is not encoded using BDPCM.
[0219] Optionally, when the neighboring sub-block is encoded using BDPCM, the boundary strength of the deblocking filter is determined to be 1 or 2.
[0220] Optionally, the deblocking module is specifically used for:
[0221] When the current sub-block and the neighboring sub-block are encoded using BDPCM, if the difference in quantization parameters between the current sub-block and the neighboring sub-block is greater than a threshold, the deblocking is performed on the boundary between the current sub-block in the current block and the neighboring sub-block in the neighboring block.
[0222] Optionally, the deblocking module is specifically used for:
[0223] When the current subblock and the neighboring subblock are encoded using BDPCM, the current subblock and the neighboring subblock are encoded using different BDPCM prediction modes, and the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block is deblocked.
[0224] Optionally, the deblocking module is specifically used for:
[0225] When the current subblock and the neighboring subblock are encoded using BDPCM, if at least one of the current subblock and the neighboring subblock has at least one non-zero coefficient, the deblocking is performed on the boundary between the current subblock in the current block and the neighboring subblock in the neighboring block.
[0226] VIIII. Computer System
[0227] The techniques described above may be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. Fig.15 A computer system (1500) suitable for implementing certain embodiments of the disclosed subject matter is shown.
[0228] Computer software may be encoded using any suitable machine code or computer language, which may be used through mechanisms such as assembly, compilation, and linking to create code comprising instructions that may be executed directly by one or more computer central processing units (CPU), graphics processing units (GPU), etc., or through interpretation, microcode execution, etc.
[0229] The instructions may be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smart phones, gaming devices, Internet of Things devices, and the like.
[0230] Fig.15 The components shown for the computer system (1400) are exemplary in nature and are not intended to impose any limitations on the scope of use or functionality of computer software in implementing the embodiments of the present disclosure. The configuration of components should not be interpreted as being dependent on or limited to any component or combination of components shown in the exemplary embodiment of the computer system (1500).
[0231] The computer system (1500) may include certain human-machine interface input devices. Such human-machine interface input devices may respond to input by one or more human users through, for example, tactile input (e.g., keystrokes, swipes, data glove movements), audio input (e.g., voice, clapping), visual input (e.g., gestures), olfactory input (not depicted). The human-machine interface device may also be used to capture certain media that are not necessarily directly related to human conscious input, such as audio (e.g., voice, music, ambient sounds), images (e.g., scanned images, photographic images obtained from a still image camera), and videos (e.g., two-dimensional video, three-dimensional video including stereoscopic video).
[0232] The input human-machine interface device may include one or more of the following (only one of each is depicted): keyboard (1501), mouse (1502), touchpad (1503), touch screen (1510), data gloves (not shown), joystick (1505), microphone (1506), scanner (1507), camera (1508).
[0233] The computer system (1500) may also include certain human interface output devices. Such human interface output devices may stimulate one or more senses of a human user through, for example, tactile output, sound, light, and smell / taste. Such human-machine interface output devices may include: tactile output devices (for example, tactile feedback through a touch screen (1510), a data glove (not shown), or a joystick (1505), but there may also be tactile feedback devices that are not used as input devices), audio output devices (for example: speakers (1509), headphones (not depicted)), visual output devices (for example, screens (1510), including cathode ray tube (CRT) screens, liquid crystal display (LCD) screens, plasma screens, organic light-emitting diode (OLED) screens, etc., each screen has or does not have touch screen input capabilities, each screen has or does not have tactile feedback capabilities - some of which may be able to output two-dimensional visual outputs or three or more dimensions through methods such as stereoscopic image output; virtual reality glasses (not depicted), holographic displays, and smoke generators (not depicted)) and printers (not depicted).
[0234] The computer system (1500) may also include human-accessible storage devices and their associated media, such as optical media including CD / DVD read only memory (ROM) / read write (RW) memory (1520) with CD / DVD and other media (1521), thumb drives (1522), removable hard drives or solid-state drives (1523), legacy magnetic media such as tapes and floppy disks (not depicted), dedicated ROM / application specific integrated circuit (ASIC) / programmable logic device (PLD) based devices such as security dongles (not depicted), etc.
[0235] Those skilled in the art will also appreciate that the term "computer-readable media" used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transient signals.
[0236] The computer system (1500) may also include an interface to one or more communication networks. The network may be, for example, a wireless network, a wired network, an optical network. The network may also be a local area network, a wide area network, a metropolitan area network, a vehicle industrial network, a real-time network, a delay-tolerant network, etc. Examples of networks include: a local area network such as Ethernet, a wireless local area network (LAN), a cellular network including a global system for mobile communications (GSM), the third generation (3G), the fourth generation (4G), the fifth generation (5G), long term evolution (LTE), etc., a television wired or wireless wide area digital network including cable television, satellite television, and terrestrial broadcast television, a vehicle industrial network including a controller area network (CAN) bus, etc. Some networks typically require an external network interface adapter that is attached to some universal data port or peripheral bus (1549) (e.g., a universal serial bus (USB) port of the computer system (1500)); other networks are typically integrated into the core of the computer system (1500) by attaching to a system bus as described below (e.g., an Ethernet interface to a PC computer system or a cellular network interface to a smartphone computer system). Using any of these networks, the computer system (1500) can communicate with other entities. Such communications can be one-way receive-only (e.g., broadcast television), one-way send-only (e.g., a CAN bus to some CAN bus devices), or two-way, for example, using a local area digital network or a wide area digital network to other computer systems. Certain protocols and protocol stacks can be used on each of these networks and network interfaces as described above.
[0237] The above-mentioned human-machine interface device, human-accessible storage device, and network interface may be attached to the core ( 1540 ) of the computer system ( 1500 ).
[0238] The core (1540) may include one or more central processing units (CPUs) (1541), graphics processing units (GPUs) (1542), dedicated programmable processing units in the form of field programmable gate arrays (FPGAs) (1543), hardware accelerators for certain tasks (1544), etc. These devices, along with read-only memory (ROM) (1545), random access memory (1546), internal mass storage devices such as internal non-user accessible hard drives, SSDs, etc. (1547), may be connected via a system bus (1548). In some computer systems, the system bus (1548) may be accessed in the form of one or more physical plugs to enable expansion by additional CPUs, GPUs, etc. Peripheral devices may be attached to the core's system bus (1548) directly or via a peripheral bus (1549). The architecture of the peripheral bus includes peripheral component interconnect (PCI), USB, etc.
[0239] The CPU (1541), GPU (1542), FPGA (1543) and accelerator (1544) can execute certain instructions, which can be combined to form the computer code mentioned above. The computer code can be stored in ROM (1545) or RAM (1546). Transition data can also be stored in RAM (1446), while permanent data can be stored in, for example, an internal mass storage device (1447). Fast storage and retrieval of any storage device in the memory device can be achieved by using a cache memory, which can be closely associated with one or more CPUs (1441), GPUs (1442), mass storage devices (1447), ROMs (1445), RAMs (1446), etc.
[0240] The computer readable medium may have a computer code thereon, which is used to perform various computer-implemented operations. The medium and computer code may be specially designed and constructed for the purpose of the present disclosure, or may be well known and available to those skilled in the art of computer software.
[0241] As an example and not limitation, a computer system (1500) having an architecture, in particular a core (1540), can provide functionality provided by (one or more) processors (including CPUs, GPUs, FPGAs, accelerators, etc.) executing software embodied in one or more tangible computer-readable media. Such computer-readable media can be media associated with a user-accessible mass storage device as described above, as well as certain storage devices of the core (1540) having non-transitory properties, such as a core internal mass storage device (1547) or ROM (1545). Software implementing various embodiments of the present disclosure can be stored in such a device and executed by the core (1540). Depending on specific needs, the computer-readable medium may include one or more memory devices or chips. The software can enable the core (1540) and in particular the processors therein (including CPUs, GPUs, FPGAs, etc.) to perform specific processing or specific parts of specific processing described herein, including defining data structures stored in RAM (1546) and modifying such data structures according to processing defined by the software. Additionally or alternatively, the computer system may provide functionality provided as a result of hard-wiring logic or otherwise embodied in a circuit (e.g., an accelerator (1544)) that may replace software or operate in conjunction with software to perform a specific process or a specific portion of a specific process described herein. Where appropriate, the software involved may encompass logic, and vice versa, the logic involved may also encompass software. Where appropriate, the computer-readable medium involved may encompass a circuit (e.g., an integrated circuit (IC)) storing software for execution, a circuit containing logic for execution, or both. The present disclosure encompasses any suitable combination of hardware and software.
[0242] Appendix A: Acronyms
[0243] JEM: Joint Exploration Model
[0244] VVC: Versatile Video Coding
[0245] BMS: Benchmark Setting
[0246] MV: Motion Vector
[0247] HEVC: High Efficiency Video Coding
[0248] SEI: Supplementary Enhancement Information
[0249] VUI: Video Availability Information
[0250] GOP: Group of Pictures
[0251] TU: Transform Unit
[0252] PU: prediction unit
[0253] CTU: Coding Tree Unit
[0254] CTB: Coding Tree Block
[0255] PB: prediction block
[0256] HRD: Hypothetical Reference Decoder
[0257] SNR: Signal to Noise Ratio
[0258] CPU: Central Processing Unit
[0259] GPU: Graphics Processing Unit
[0260] CRT: cathode ray tube
[0261] LCD: Liquid Crystal Display
[0262] OLED: Organic Light Emitting Diode
[0263] CD: compact disc
[0264] DVD: Digital Video Disc
[0265] ROM: Read Only Memory
[0266] RAM: Random Access Memory
[0267] ASIC: Application-Specific Integrated Circuit
[0268] PLD: Programmable Logic Device
[0269] LAN: Local Area Network
[0270] GSM: Global System for Mobile Communications
[0271] LTE: Long Term Evolution
[0272] CAMBus: Controller Area Network Bus
[0273] USB: Universal Serial Bus
[0274] PCI: Peripheral Component Interconnect
[0275] FPGA: Field Programmable Gate Array
[0276] SSD: Solid State Drive
[0277] IC: Integrated Circuit
[0278] CU: Coding Unit
[0279] DPCM: Differential Pulse Code Modulation
[0280] BDPCM: Block Differential Pulse Code Modulation
[0281] SCC: Screen Content Coding
[0282] Bs: Boundary Strength
[0283] Although the present disclosure has described several exemplary embodiments, there are changes, permutations, and various alternative equivalents that fall within the scope of the present disclosure. It will therefore be understood that those skilled in the art will be able to conceive of a variety of systems and methods that, although not explicitly shown or described herein, embody the principles of the present disclosure and therefore fall within the spirit and scope of the present disclosure.
Claims
1. A video encoding method performed in a video encoder, the method comprising: performing context modeling to determine a context model for each of a number of bits of a syntax element of a residual corresponding to a region of a transform skip block in a current picture, the number of bits of the syntax element being context coded not exceeding a maximum number of context coded bits set for the region; Based on the determined context model, the syntax element is encoded according to block differential pulse code modulation (BDPCM), wherein when the maximum number of context coded bins is reached, the remaining bins of the syntax element are encoded based on a bypass model.
2. The method according to claim 1, wherein: The number of binary bits of the context-coded syntax element is less than or equal to the total number of binary bits of the syntax element for the region of the transform skip block.
3. The method according to claim 1, wherein The maximum number of context coded bits for the region of the transform skip block is B×A, where A is the number of residuals in the region, and B is a positive number.
4. The method according to claim 3, wherein B is an integer.
5. The method according to claim 3, wherein B is a decimal.
6. The method according to claim 3, wherein When A is greater than a threshold value, B is a first value, and when A is not greater than the threshold value, B is a second value.
7. The method according to claim 3, wherein The maximum number of context coded bins for each of the multiple regions of the transform skip block is B×A.
8. A video encoding device, comprising: A processing circuit configured to perform the video encoding method according to any one of claims 1 to 7.
9. A non-transitory computer-readable storage medium storing instructions, which, when executed by a processor, cause the processor to perform the video encoding method according to any one of claims 1 to 7.
10. A method for processing a video code stream, characterized in that: The video code stream is generated according to the encoding method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Liquid storage device
US20200390005A1
