Encoder, decoder and corresponding methods for simplifying indication picture header
By indicating whether the current image is an I image in the image head of the video code stream, avoiding indicating inter prediction design syntax elements during the I image, the problem of low video data transmission and storage efficiency in the prior art is solved, and more efficient is achieved data transmission and storage.
Patent Information
- Application Number
- CN202410896788.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2019-10-10
- Filing Date
- 2020-10-10
- Publication Date
- 2024-11-22
AI Technical Summary
In video data transmission and storage, the prior art is difficult to effectively simplify the indication image header, resulting in low data transmission and storage efficiency, especially in the case of limited bandwidth networks and limited storage resources.
By indicating whether the current image is an I image in the image header of the code stream, when it is an I image, the syntax elements of the inter prediction design are not indicated in the image header, reducing the indication overhead.
The image header of intra-frame images is simplified, the overhead of data transmission and storage is reduced, and the transmission and storage efficiency of video data is improved.
Smart Images

Figure CN119011876A_ABST
Abstract
Description
[0001] This application is a divisional application. The application number of the original application is 202080069479.8, and the original application date is October 10, 2020. The entire contents of the original application are incorporated into this application by reference. Technical Field
[0002] Embodiments of the present application (invention) relate generally to the field of image processing, and more particularly to a simplified indication image header. Background Art
[0003] Video coding (video encoding and decoding) is widely used in digital video applications such as broadcast digital television, video transmission over the Internet and mobile networks, real-time conversation applications such as video chat, video conferencing, DVD and Blu-ray discs, video content acquisition and editing systems, and security applications in camcorders.
[0004] Even in the case of shorter videos, a large amount of video data needs to be described, which can cause difficulties when the data is to be transmitted or otherwise transferred across a communication network with limited bandwidth capacity. Therefore, video data is often compressed before being transmitted across modern telecommunication networks. The size of the video can also be an issue when storing the video in a storage device, as memory resources may be limited. Video compression devices typically use software and / or hardware on the source side to encode the video data before transmission or storage, thereby reducing the amount of data required to represent the digital video image. A video decompression device that decodes the video data then receives the compressed data at the destination side. With limited network resources and a growing demand for higher video quality, there is a need to simplify the header that indicates the image. Summary of the invention
[0005] The embodiments of the present application provide the encoding and decoding methods and devices described in the independent claims.
[0006] The above and other objects are achieved by the subject matter claimed in the independent claims. Other implementations are apparent from the dependent claims, the description and the drawings.
[0007] According to a first aspect, the present invention relates to a decoding method implemented by a decoding device, wherein the method comprises parsing a code stream to obtain a flag from a picture header of the code stream, wherein the flag indicates whether a current picture is an I picture.
[0008] When the flag indicates that the current image is an I image, the syntax elements designed for inter-frame prediction are inferred as default values; or, when the flag indicates that the current image is a P image or a B image, the syntax elements designed for inter-frame prediction are obtained from the image header.
[0009] The syntax elements designed for inter prediction include one or more of the following elements: pic_log2_diff_min_qt_min_cb_inter_slice, pic_max_mtt_hierarchy_depth_inter_slice, pic_log2_diff_max_bt_min_qt_inter_slice, pic_log2_diff_max_tt_min_qt_inter_slice, pic_cu_qp_delta_subdiv_inter_slice, pic_cu_chroma_qp_offset_subdiv_inter_slice, pic_temporal_mvp_enabled_flag, mvd_l1_zero_flag, pic_fpel_mmvd_enabled_flag, or pic_disable_bdof_dmvr_flag.
[0010] According to a second aspect, the present invention relates to a decoding method implemented by an encoding device. The method comprises determining whether a current picture is an I picture;
[0011] A code stream is sent to a decoding device, wherein a picture header of the code stream includes a flag indicating whether the current picture is an I picture; when the current picture is an I picture, a syntax element designed for inter-frame prediction is not indicated in the picture header; or when the current picture is a P picture or a B picture, a syntax element designed for inter-frame prediction is indicated in the picture header.
[0012] The method provided in the first aspect of the present invention may be executed by the apparatus provided in the third aspect of the present invention. Other features and implementations of the method provided in the third aspect of the present invention correspond to the features and implementations of the apparatus provided in the first aspect of the present invention.
[0013] The method provided in the second aspect of the present invention may be performed by the device provided in the fourth aspect of the present invention. Other features and implementations of the method provided in the fourth aspect of the present invention correspond to the features and implementations of the device provided in the second aspect of the present invention.
[0014] According to a fifth aspect, the present invention relates to an apparatus for decoding a video stream, the apparatus comprising a processor and a memory, wherein the memory stores instructions, and the instructions enable the processor to execute the method according to the first aspect.
[0015] According to a sixth aspect, the present invention relates to an apparatus for encoding a video stream, the apparatus comprising a processor and a memory, wherein the memory stores instructions, and the instructions enable the processor to execute the method according to the second aspect.
[0016] According to a seventh aspect, a computer-readable storage medium storing instructions is provided, wherein the instructions, when executed, cause one or more processors to decode video data. The instructions cause the one or more processors to perform the method provided by the first aspect or the second aspect or any possible embodiment of the first aspect or the second aspect.
[0017] According to an eighth aspect, the present invention relates to a computer program, comprising a program code, wherein the program code is used to execute the method provided by the first aspect or the second aspect or any possible embodiment of the first aspect or the second aspect when executed in a computer.
[0018] As described above, by indicating whether the current image is an I image in the image header of the code stream, when the current image is an I image, the syntax element designed for inter-frame prediction is not indicated in the image header. Therefore, the embodiment can simplify the image header indicating all intra-frame images (i.e., I images). Accordingly, the indication overhead is reduced.
[0019] One or more embodiments will be described in detail in the drawings and the following description. Other features, objects, and advantages will be apparent from the description, drawings, and claims. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] The following is a detailed description of the embodiments of the present invention in conjunction with the accompanying drawings. In the accompanying drawings:
[0021] Figure 1A A block diagram of an example of a video decoding system for implementing an embodiment of the present invention;
[0022] Figure 1B is a block diagram of another example of a video decoding system for implementing an embodiment of the present invention;
[0023] Figure 2 A block diagram of an example of a video encoder for implementing an embodiment of the present invention;
[0024] Figure 3 is a block diagram of an exemplary structure of a video decoder for implementing an embodiment of the present invention;
[0025] Figure 4 A block diagram of an example of an encoding device or a decoding device;
[0026] Figure 5 A block diagram of another example of an encoding device or a decoding device;
[0027] Figure 6 is an example of the syntax of the picture parameter set RBSP;
[0028] Figure 7is an example of the syntax of the picture parameter set RBSP;
[0029] Figure 8 is an example of adaptive parameter set syntax;
[0030] Fig. 9 is an example of a generic strip header syntax;
[0031] Fig.10a is an example of a coding tree unit syntax structure;
[0032] Fig.10b is an example of image header syntax;
[0033] Fig.11 is another example of a generic strip header syntax;
[0034] Fig.12 A flowchart 1200 showing a method implemented by an encoding device;
[0035] Fig.13 A flowchart 1300 showing a method implemented by a decoding device;
[0036] Fig.14 shows the configuration of the encoding device;
[0037] Fig.15 shows the configuration of a decoding device;
[0038] Fig.16 is a block diagram of an exemplary structure of a content provision system 3100 for implementing a content distribution service;
[0039] Fig.17 A block diagram of the structure of an example of a terminal device.
[0040] In the following, unless explicitly stated otherwise, identical reference signs refer to identical or at least functionally equivalent features. DETAILED DESCRIPTION
[0041] In the following description, reference is made to the accompanying drawings that form part of the present invention and that illustrate specific aspects of embodiments of the present invention or in which specific aspects of embodiments of the present invention may be used by way of illustration. It is understood that embodiments of the present invention may be used in other aspects and may include structural changes or logical changes not described in the accompanying drawings. Therefore, the following detailed description should not be understood in a restrictive sense, and the scope of the present invention is defined by the appended claims.
[0042] It is understood that the disclosure related to the described method is also applicable to the corresponding device or system for performing the method, and vice versa. For example, if one or more specific method steps are described, the corresponding device may include one or more units (e.g., functional units) to perform the described one or more method steps (e.g., one unit performs one or more steps, or multiple units each perform one or more steps in multiple steps), even if such one or more units are not explicitly described or shown in the drawings. On the other hand, for example, if a specific device is described according to one or more units (e.g., functional units), the corresponding method may include a step to perform the function of one or more units (e.g., one step performs the function of one or more units, or multiple steps each perform the function of one or more units in multiple units), even if such one or more units are not explicitly described or shown in the drawings. In addition, it is understood that, unless otherwise explicitly stated, the features of the various exemplary embodiments and / or aspects described herein may be combined with each other.
[0043] Video decoding generally refers to the processing of a sequence of images that constitute a video or video sequence. In the field of video decoding, the terms "frame" and "picture / image" can be used as synonyms. Video decoding (or generally decoding) includes two parts: video encoding and video decoding. Video encoding is performed on the source side and generally includes processing (for example, by compression) the original video image to reduce the amount of data required to represent the video image (thereby achieving more efficient storage and / or transmission). Video decoding is performed on the destination side and generally includes inverse processing relative to the encoder to reconstruct the video image. The "decoding" of the video image (or generally the image) involved in the embodiment should be understood as the "encoding" or "decoding" of the video image or the corresponding video sequence. The encoding part and the decoding part are also collectively referred to as codec (encoding and decoding, CODEC).
[0044] In the case of lossless video decoding, the original video image can be reconstructed, that is, the reconstructed video image has the same quality as the original video image (assuming that there is no transmission loss or other data loss during storage or transmission). In the case of lossy video decoding, further compression is performed by quantization, etc. to reduce the amount of data representing the video image, and the decoder side cannot completely reconstruct the video image, that is, the quality of the reconstructed video image is lower or worse than the quality of the original video image.
[0045] Several video coding standards belong to the group of "lossy hybrid video codecs" (i.e., combining spatial prediction and temporal prediction in the sample domain with 2D transform coding in the transform domain for quantization). Each image in a video sequence is usually divided into a set of non-overlapping blocks, which are usually decoded at the block level. In other words, on the encoder side, the video is usually processed (i.e., encoded) at the block (video block) level, for example, a prediction block is generated by spatial (intra-frame) prediction and / or temporal (inter-frame) prediction; the prediction block is subtracted from the current block (currently processed / to be processed block) to obtain a residual block; the residual block is transformed in the transform domain and quantized to reduce the amount of data to be sent (compressed), while on the decoder side, the coded or compressed block is processed inversely with respect to the encoder to reconstruct the current block for representation. In addition, the encoder and decoder processing steps are the same, so that the encoder and decoder perform the same prediction (e.g., intra-frame prediction and inter-frame prediction) and / or reconstruction to process (i.e., decode) subsequent blocks.
[0046] In the following embodiment of the video decoding system 10, the video encoder 20 and the video decoder 30 are based on Figures 1A to 3 Give a description.
[0047] Figure 1A 1 is a schematic block diagram of an exemplary decoding system 10, for example, a video decoding system 10 (or simply a decoding system 10) that can utilize the techniques of the present application. The video encoder 20 (or simply an encoder 20) and the video decoder 30 (or simply a decoder 30) in the video decoding system 10 are examples of devices that can be used to perform various techniques according to various examples described in the present application.
[0048] like Figure 1A As shown, the decoding system 10 includes a source device 12 for providing the encoded image data 21 to a destination device 14 or the like for decoding the encoded image data 13 .
[0049] The source device 12 includes an encoder 20 , and may additionally (ie, optionally) include an image source 16 , a pre-processor (or pre-processing unit) 18 (eg, image pre-processor 18 ), and a communication interface or communication unit 22 .
[0050] The image source 16 may include or may be any type of image capture device, such as a camera for capturing real-world images; and / or any type of image generation device, such as a computer graphics processor for generating computer-animated images; or any type of other device for acquiring and / or providing real-world images, computer-generated images (e.g., screen content, virtual reality (VR) images), and / or any combination thereof (e.g., augmented reality (AR) images). The image source may be any type of memory (memory / storage) that stores any of the above images.
[0051] In order to distinguish the pre-processor 18 and the processing performed by the pre-processing unit 18 , the image or image data 17 may also be referred to as a raw image or raw image data 17 .
[0052] The preprocessor 18 is used to receive (raw) image data 17 and perform preprocessing on the image data 17 to obtain a preprocessed image 19 or preprocessed image data 19. The preprocessing performed by the preprocessor 18 may include trimming, color format conversion (e.g., from RGB to YCbCr), color adjustment or denoising, etc. It can be understood that the preprocessing unit 18 may be an optional component.
[0053] The video encoder 20 is used to receive the pre-processed image data 19 and provide the encoded image data 21 (hereinafter referred to as Figure 2 etc. are described in further detail).
[0054] The communication interface 22 in the source device 12 can be used to receive the encoded image data 21 and send the encoded image data 21 (or data obtained after further processing of the encoded image data 21) to another device (for example, the destination device 14) or any other device through the communication channel 13 for storage or direct reconstruction.
[0055] Destination device 14 includes a decoder 30 (eg, video decoder 30 ) and may additionally (ie, optionally) include a communication interface or communication unit 28 , a post-processor 32 (or post-processing unit 32 ), and a display device 34 .
[0056] The communication interface 28 in the destination device 14 is used to receive the encoded image data 21 (or data obtained after further processing of the encoded image data 21) directly from the source device 12 or from any other source such as a storage device (such as an encoded image data storage device), and provide the encoded image data 21 to the decoder 30.
[0057] Communication interface 22 and communication interface 28 can be used to send or receive encoded image data 21 or encoded data 13 via a direct communication link (e.g., a direct wired or wireless connection) between source device 12 and destination device 14 or via any type of network (e.g., a wired network, a wireless network, or any combination thereof, or any type of private and public network, or any type of combination thereof).
[0058] For example, the communication interface 22 may be used to encapsulate the encoded image data 21 into a suitable format (eg, data packets), and / or process the encoded image data by any type of transmission coding or processing for transmission over a communication link or communication network.
[0059] For example, the communication interface 28 corresponding to the communication interface 22 may be used to receive the transmission data and process the transmission data by any type of corresponding transmission decoding or processing and / or decapsulation to obtain the encoded image data 21 .
[0060] Both the communication interface 22 and the communication interface 28 can be configured as Figure 1A The unidirectional communication interface represented by the arrow of the communication channel 13 pointing from the source device 12 to the destination device 14 may be configured as a bidirectional communication interface and may be used to send and receive messages, etc. to establish a connection, confirm and exchange any other information related to the communication link and / or data transmission (e.g., encoded image data transmission), etc.
[0061] The decoder 30 is used to receive the encoded image data 21 and provide decoded image data 31 or decoded image 31 (hereinafter referred to as Figure 3 or Figure 5 etc. are described in further detail).
[0062] The post-processor 32 of the destination device 14 is used to post-process the decoded image data 31 (also referred to as reconstructed image data) (e.g., decoded image 31) to obtain post-processed image data 33 (e.g., post-processed image 33). For example, the post-processing performed by the post-processing unit 32 may include color format conversion (e.g., from YCbCr to RGB), color matching, cropping or resampling, or any other processing, for example, for providing the decoded image data 31 for display by a display device 34 or the like.
[0063] The display device 34 in the destination device 14 is used to receive the post-processed image data 33 to display the image to a user or viewer, etc. The display device 34 can be or include any type of display for displaying the reconstructed image, such as an integrated or external display screen or display. For example, the display can include a liquid crystal display (LCD), an organic light emitting diode (OLED) display, a plasma display, a projector, a micro LED display, a liquid crystal on silicon (LCoS), a digital light processor (DLP), or any other type of display.
[0064] although Figure 1A The source device 12 and the destination device 14 are described as separate devices, but the device embodiments may also include two devices or two functions, namely the source device 12 or the corresponding functions and the destination device 14 or the corresponding functions. In these embodiments, the source device 12 or the corresponding functions and the destination device 14 or the corresponding functions may be implemented using the same hardware and / or software or using separate hardware and / or software or any combination thereof.
[0065] According to the description, Figure 1A The presence and (exact) division of different units or functions in the source device 12 and / or destination device 14 shown may vary depending on the actual device and application, as will be apparent to the skilled person.
[0066] The encoder 20 (eg, video encoder 20) or the decoder 30 (eg, video decoder 30), or both the encoder 20 and the decoder 30 may be configured as follows: Figure 1B The processing circuit shown is implemented, for example, one or more microprocessors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), discrete logic, hardware, video decoding dedicated processors or any combination thereof. Encoder 20 can be implemented by processing circuit 46 to embody the combination of Figure 2 The various modules discussed in the encoder 20 and / or any other encoder system or subsystem described herein. The decoder 30 may be implemented by the processing circuit 46 to embody the combination of Figure 3The processing circuitry may be used to perform the various operations described below. Figure 5 As shown, if the technology is partially implemented in software, the device can store the instructions of the software in a suitable non-transitory computer-readable storage medium, and can use one or more processors to execute the instructions in hardware to perform the technology of the present invention. One of the video encoder 20 and the video decoder 30 can be integrated into a single device as part of a combined codec (encoder / decoder, CODEC), such as Figure 1B shown.
[0067] Source device 12 and destination device 14 may include any of a variety of devices, including any type of handheld or fixed device, such as a notebook or laptop computer, a mobile phone, a smart phone, a tablet / tabletcomputer, a camera, a desktop computer, a set-top box, a television, a display device, a digital media player, a video game console, a video streaming device (such as a content service server or a content distribution server), a broadcast receiver device, a broadcast transmitter device, etc., and may not use or use any type of operating system. In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Therefore, source device 12 and destination device 14 may be wireless communication devices.
[0068] In some cases, Figure 1A The video decoding system 10 shown is merely exemplary, and the techniques in the present application can be applied to video decoding settings (e.g., video encoding or video decoding) that do not necessarily include any data communication between the encoding device and the decoding device. In other examples, data is retrieved from a local memory, transmitted over a network, and so on. The video encoding device can encode the data and store the data in a memory, and / or the video decoding device can retrieve the data from the memory and decode the data. In some examples, the encoding and decoding are performed by devices that do not communicate with each other but only encode the data to the memory and / or retrieve the data from the memory and decode the data.
[0069] For ease of description, this document describes embodiments of the present invention with reference to high-efficiency video coding (HEVC) or versatile video coding (VVC) (next generation video coding standard) reference software developed by the ITU-T video coding experts group (VCEG) and the ISO / IEC motion picture experts group (MPEG) video coding joint collaboration team (JCT-VC) (next generation video coding standard). Those skilled in the art understand that embodiments of the present invention are not limited to HEVC or VVC.
[0070] Encoders and encoding methods
[0071] Figure 2 FIG. 2 is a schematic block diagram of an exemplary video encoder 20 for implementing the technology of the present application. Figure 2 In the example of , the video encoder 20 includes an input terminal 201 (or an input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210 and an inverse transform processing unit 212, a reconstruction unit 214, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy coding unit 270 and an output terminal 272 (or an output interface 272). The mode selection unit 260 may include an inter-frame prediction unit 244, an intra-frame prediction unit 254 and a segmentation unit 262. The inter-frame prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). Figure 2 The illustrated video encoder 20 may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.
[0072] The residual calculation unit 204, the transform processing unit 206, the quantization unit 208 and the mode selection unit 260 may constitute a forward signal path of the encoder 20, and the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, the inter-frame prediction unit 244 and the intra-frame prediction unit 254 may constitute a backward signal path of the video encoder 20, wherein the backward signal path of the video encoder 20 corresponds to the decoder (see Figure 3The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter-frame prediction unit 244 and the intra-frame prediction unit 254 also constitute the “built-in decoder” of the video encoder 20.
[0073] Images and image segmentation (images and blocks)
[0074] The encoder 20 may be configured to receive an image 17 (or image data 17), such as an image in a sequence of images forming a video or a video sequence, via an input 201 or the like. The received image or image data may also be a pre-processed image 19 (or pre-processed image data 19). For simplicity, the following description uses image 17. Image 17 may also be referred to as a current image or an image to be encoded (particularly in video decoding to distinguish the current image from other images (e.g., previously encoded images and / or decoded images) in the same video sequence (i.e., a video sequence that also includes the current image)).
[0075] A (digital) image is or can be considered as a two-dimensional array or matrix of samples with intensity values. The samples in the array can also be called pixels (pixel / pel) (short for picture elements). The number of samples in the horizontal and vertical directions (or axes) of the array or image defines the size and / or resolution of the image. Three color components are usually used to represent colors, that is, the image can be represented as or include three sample arrays. In the RGB format or color space, the image includes corresponding red, green and blue sample arrays. However, in video decoding, each pixel is usually represented by a brightness and chrominance format or in a color space, for example, YCbCr, including a brightness component represented by Y (sometimes also represented by L) and two chrominance components represented by Cb and Cr. The brightness (luminance, abbreviated as luma) component Y represents the brightness or grayscale intensity (for example, in a grayscale image), while the two chrominance (chroma, abbreviated as chroma) components Cb and Cr represent the chrominance or color information components. Accordingly, an image in YCbCr format includes a luma sample array of luma sample values (Y) and two chroma sample arrays of chroma values (Cb and Cr). An image in RGB format can be converted or transformed into YCbCr format and vice versa, a process also referred to as color conversion or color transformation. If the image is black and white, the image may include only a luma sample array. Accordingly, for example, an image may be a luma sample array in black and white format or a luma sample array and two corresponding chroma sample arrays in 4:2:0, 4:2:2 and 4:4:4 color formats.
[0076] An embodiment of the video encoder 20 may include an image segmentation unit ( Figure 2 ), for partitioning the image 17 into a plurality of (usually non-overlapping) image blocks 203. These blocks may also be referred to as root blocks, macroblocks (H.264 / AVC), or coding tree blocks (CTB) or coding tree units (CTU) (H.265 / HEVC and VVC). The image partitioning unit may be used to use the same block size for all images in a video sequence and a corresponding grid of defined block sizes, or to vary the block size between images or subsets or groups of images, and to partition each image into corresponding blocks.
[0077] In other embodiments, the video encoder may be configured to directly receive the block 203 in the image 17, for example, one, several or all blocks constituting the image 17. The image block 203 may also be referred to as a current image block or an image block to be encoded.
[0078] Similar to the image 17, the image block 203 is also or can be regarded as a two-dimensional array or matrix of samples with intensity values (sample values), but the size of the image block 203 is smaller than that of the image 17. In other words, the block 203 may include one sample array (e.g., a luminance array in the case of the black and white image 17 or a luminance array or a chrominance array in the case of a color image) or three sample arrays (e.g., one luminance array and two chrominance arrays in the case of the color image 17) or any other number and / or type of arrays according to the color format adopted. The number of samples in the horizontal direction and the vertical direction (or axis) of the block 203 defines the size of the block 203. Accordingly, the block may be, for example, an M×N (M columns×N rows) sample array, or an M×N transform coefficient array, etc.
[0079] Figure 2 The illustrated embodiment of the video encoder 20 may be used to encode the image 17 block by block, for example, by encoding and predicting the block 203 .
[0080] Figure 2 The illustrated embodiment of the video encoder 20 may also be used to partition and / or encode an image using slices (also referred to as video slices), wherein an image may be partitioned or encoded using one or more slices (typically non-overlapping), and each slice may include one or more blocks (e.g., CTUs).
[0081] Figure 2The illustrated embodiment of the video encoder 20 may also be used to segment and / or encode an image using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), wherein one or more tile groups (usually non-overlapping) may be used to segment or encode an image, each tile group may include one or more blocks (e.g., CTUs) or one or more tiles, etc., wherein each tile may be in a rectangular or other shape, and may include one or more blocks (e.g., CTUs), such as complete or partial blocks.
[0082] Residual calculation
[0083] The residual calculation unit 204 can be used to calculate the residual block 205 (also referred to as residual 205) based on the image block 203 and the prediction block 265 (more details of the prediction block 265 are provided later), for example, by subtracting the sample value of the prediction block 265 from the sample value of the image block 203 sample by sample (pixel by pixel) to obtain the residual block 205 in the sample domain.
[0084] Transform
[0085] The transform processing unit 206 may be used to perform discrete cosine transform (DCT) or discrete sine transform (DST) on the sample values of the residual block 205 to obtain transform coefficients 207 in the transform domain. The transform coefficients 207 may also be called transform residual coefficients, representing the residual block 205 in the transform domain.
[0086] The transform processing unit 206 can be used to apply an integer approximation of a DCT / DST (e.g., a transform specified for H.265 / HEVC). Compared to an orthogonal DCT transform, this integer approximation is typically scaled by a factor. In order to maintain the norm of the residual block processed by the forward transform and the inverse transform, other scaling factors are applied as part of the transform process. The scaling factor is typically selected based on certain constraints, such as whether the scaling factor is a power of 2 for the shift operation, the bit depth of the transform coefficients, a trade-off between precision and implementation cost, etc. For example, a specific scaling factor is specified for the inverse transform by the inverse transform processing unit 212, etc. (and on the video decoder 30 side, the corresponding inverse transform by the inverse transform processing unit 312, etc.); accordingly, a corresponding scaling factor can be specified for the forward transform by the transform processing unit 206, etc. on the encoder 20 side.
[0087] Embodiments of the video encoder 20 (and accordingly, the transform processing unit 206) may be configured to encode or compress output transform parameters (e.g., one or more transform types) directly or via an entropy coding unit 270, such that, for example, the video decoder 30 may receive and use the transform parameters for decoding.
[0088] Quantification
[0089] The quantization unit 208 may be configured to quantize the transform coefficients 207 by applying scalar quantization or vector quantization, etc., to obtain quantized coefficients 209 . The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209 .
[0090] The quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be rounded down to an m-bit transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a quantization parameter (QP). For example, for scalar quantization, different degrees of scaling may be applied to achieve finer or coarser quantization. A smaller quantization step size corresponds to a finer quantization, while a larger quantization step size corresponds to a coarser quantization. A suitable quantization step size may be represented by a quantization parameter (QP). For example, a quantization parameter may be an index of a predefined set of suitable quantization step sizes. For example, a smaller quantization parameter may correspond to fine quantization (a smaller quantization step size), a larger quantization parameter may correspond to coarse quantization (a larger quantization step size), and vice versa. Quantization may include dividing by a quantization step size, while corresponding dequantization and / or corresponding inverse dequantization performed by the inverse quantization unit 210 or the like may include multiplying by a quantization step size. Embodiments according to some standards such as HEVC may use a quantization parameter to determine a quantization step size. Typically, a quantization step size may be calculated using a fixed-point approximation of an equation including division according to a quantization parameter. Other scaling factors may be introduced for quantization and dequantization to recover the norm of the residual block that may be modified by the scaling used in the fixed-point approximation of the equations for the quantization step size and the quantization parameter. In one exemplary implementation, the scaling of the inverse transform and dequantization may be combined. Alternatively, a custom quantization table may be used and signaled from the encoder to the decoder in the bitstream, etc. Quantization is a lossy operation, where the larger the quantization step size, the greater the loss.
[0091] In an embodiment, the video encoder 20 (correspondingly, the quantization unit 208) can be used to output a quantization parameter (QP), for example, directly output or output after being encoded by the entropy coding unit 270, so that, for example, the video decoder 30 can receive and use the quantization parameter for decoding.
[0092] Dequantization
[0093] The inverse quantization unit 210 is used to perform inverse quantization of the quantization unit 208 on the quantized coefficients to obtain dequantized coefficients 211, for example, according to or using the same quantization step size as the quantization unit 208, and perform an inverse quantization scheme of the quantization scheme performed by the quantization unit 208. The dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211, corresponding to the transform coefficients 207, but due to the loss caused by quantization, the dequantized coefficients 211 are usually different from the transform coefficients.
[0094] Inverse Transform
[0095] The inverse transform processing unit 212 is used to perform an inverse transform of the transform performed by the transform processing unit 206, such as an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST), to obtain a reconstructed residual block 213 (or a corresponding dequantized coefficient 213) in the sample domain. The reconstructed residual block 213 may also be referred to as a transform block 213.
[0096] reconstruction
[0097] The reconstruction unit 214 (e.g., adder or summer 214) is used to add the transform block 213 (i.e., the reconstructed residual block 213) to the prediction block 265 by adding the sample values of the reconstructed residual block 213 and the sample values of the prediction block 265 sample by sample to obtain the reconstructed block 215 in the sample domain.
[0098] Filtering
[0099] The loop filter unit 220 (or simply "loop filter" 220) is used to filter the reconstructed block 215 to obtain a filtered block 221, or is generally used to filter the reconstructed samples to obtain filtered samples. For example, the loop filter unit is used to smooth pixel transitions or improve video quality. The loop filter unit 220 may include one or more loop filters, such as a deblocking filter, a sample-adaptive offset (SAO) filter, or one or more other filters, such as a bilateral filter, an adaptive loop filter (ALF), a sharpening or smoothing filter, a collaborative filter, or any combination thereof. Although the loop filter unit 220 is Figure 2 2 is shown as an in-loop filter, but in other configurations, the loop filter unit 220 may be implemented as a post-loop filter. The filtered block 221 may also be referred to as a filtered reconstruction block 221.
[0100] In an embodiment, the video encoder 20 (correspondingly, the loop filter unit 220) can be used to output loop filter parameters (e.g., sample adaptive offset information), for example, directly output or output after encoding by the entropy coding unit 270, so that, for example, the decoder 30 can receive and use the same loop filter parameters or the corresponding loop filter for decoding.
[0101] Decode image buffer
[0102] The decoded picture buffer (DPB) 230 may be a memory that stores reference images or generally stores reference image data for use by the video encoder 20 when encoding video data. The DPB 230 may be formed by any of a variety of memory devices, such as a dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM) or other types of memory devices. The decoded picture buffer (DPB) 230 may be used to store one or more filtered blocks 221. The decoded picture buffer 230 may also be used to store other previously filtered blocks (e.g., previously filtered reconstructed blocks 221) in the same current image or in different images (e.g., previously reconstructed images), and may provide previously fully reconstructed (i.e., decoded) images (and corresponding reference blocks and samples) and / or partially reconstructed current images (and corresponding reference blocks and samples) for inter-frame prediction, etc. If the reconstructed block 215 is not filtered by the loop filter unit 220, the decoded picture buffer (DPB) 230 can also be used to store one or more unfiltered reconstructed blocks 215, or generally store unfiltered reconstructed samples, or reconstructed blocks or reconstructed samples without any other processing.
[0103] Mode selection (segmentation and prediction)
[0104] The mode selection unit 260 includes a segmentation unit 262, an inter-frame prediction unit 244, and an intra-frame prediction unit 254, and is used to receive or obtain original image data such as the original block 203 (the current block 203 in the current image 17) and reconstructed image data (such as filtered and / or unfiltered reconstructed samples or blocks in the same (current) image and / or one or more previously decoded images) from the decoded image buffer 230 or other buffers (such as line buffers, not shown in the figure). The reconstructed image data is used as reference image data required for prediction such as inter-frame prediction or intra-frame prediction to obtain a prediction block 265 or a prediction value 265.
[0105] The mode selection unit 260 can be used to determine or select a partitioning mode for the current block prediction mode (including non-partitioning) and determine or select a prediction mode (for example, an intra-frame prediction mode or an inter-frame prediction mode), generate a corresponding prediction block 265, calculate the residual block 205 and reconstruct the reconstruction block 215.
[0106] In an embodiment, the mode selection unit 260 can be used to select a segmentation method and a prediction mode (for example, selected from prediction modes supported or available by the mode selection unit 260), wherein the prediction mode provides the best match or minimum residual (minimum residual means better compression in transmission or storage), or provides minimum indication overhead (minimum indication overhead means better compression in transmission or storage), or considers or balances both of the above. The mode selection unit 260 can be used to determine the segmentation and prediction mode according to rate distortion optimization (RDO), that is, to select the prediction mode that provides the minimum rate distortion. The terms "best", "minimum", "optimal", etc. in this document do not necessarily mean "best", "minimum", "optimal", etc. in general, but may also refer to situations where termination or selection criteria are met, such as values exceeding or below a threshold or other constraints may result in a "suboptimal selection", but will reduce complexity and reduce processing time.
[0107] In other words, the partitioning unit 262 can be used to partition the block 203 into smaller block partitions or sub-blocks (forming blocks again) in the following manner: for example, by iteratively using quad-tree (quad-tree, QT) partitioning, binary-tree (binary-tree, BT) partitioning or triple-tree (triple-tree, TT) partitioning or any combination thereof, and for example, performing prediction on each of the block partitions or sub-blocks, wherein the mode selection includes selecting the tree structure of the partition block 203 and selecting the prediction mode used for each of the block partitions or sub-blocks.
[0108] The segmentation (eg, performed by segmentation unit 260) and prediction processes (performed by inter-prediction unit 244 and intra-prediction unit 254) performed by video encoder 20 will be described in detail below.
[0109] segmentation
[0110] The segmentation unit 262 may segment (or divide) the current block 203 into smaller segments, such as smaller blocks of square or rectangular size. These smaller blocks (also referred to as sub-blocks) may be further segmented into even smaller segments. This is also referred to as tree segmentation or hierarchical tree segmentation, wherein a root block, such as root tree level 0 (hierarchical level 0, depth 0), may be recursively segmented, such as into blocks of two or more next lower tree levels, such as nodes of tree level 1 (hierarchical level 1, depth 1). These blocks may be segmented again into blocks of two or more next lower levels, such as tree level 2 (hierarchical level 2, depth 2), and so on, until the segmentation ends, such as because an end criterion is met (e.g., a maximum tree depth or a minimum block size is reached). Blocks that are not further segmented are also referred to as leaf blocks or leaf nodes of the tree. A tree segmented into two segments is referred to as a binary-tree (BT), a tree segmented into three segments is referred to as a ternary-tree (TT), and a tree segmented into four segments is referred to as a quad-tree (QT).
[0111] As mentioned above, the term "block" as used herein may be a portion of an image, specifically a square or rectangular portion. For example, with reference to HEVC and VVC, a block may be or may correspond to a coding tree unit (CTU), a coding unit (CU), a prediction unit (PU), and a transform unit (TU) and / or a corresponding block, such as a coding tree block (CTB), a coding block (CB), a transform block (TB), or a prediction block (PB).
[0112] For example, a coding tree unit (CTU) may be or may include a CTB of luma samples in an image with three sample arrays, two corresponding CTBs of chroma samples in the image, or a CTB of samples in a black and white image or an image decoded using three separate color planes and syntax structures. These syntax structures are used to decode the samples. Correspondingly, a coding tree block (CTB) may be an N×N block of samples, where N may be set to a certain value, so that the component is divided into multiple CTBs, which is a partition. A coding unit (CU) may be or may include a coding block of luma samples in an image with three sample arrays, two corresponding coding blocks of chroma samples, or a coding block of samples in a black and white image or an image decoded using three separate color planes and syntax structures. These syntax structures are used to decode the above samples. Correspondingly, a coding block (CB) may be an M×N block of samples, where M and N may be set to a certain value, so that a CTB is divided into multiple coding blocks, which is a partitioning method.
[0113] In an embodiment, for example, according to HEVC, a coding tree unit (CTU) can be divided into multiple CUs by a quadtree structure represented as a coding tree. It is decided at the CU level whether to use inter-frame (temporal) prediction or intra-frame (spatial) prediction to decode the image area. Each CU can be further divided into one, two or four PUs according to the PU partition type. The same prediction process is applied within a PU, and relevant information is sent to the decoder in units of PUs. After the prediction process is performed according to the PU partition type to obtain the residual block, the CU can be divided into transform units (TUs) according to another quadtree structure similar to the coding tree for the CU.
[0114] In an embodiment, for example, according to the latest video coding standard currently under development called universal video coding (VVC), quad-tree and binary-tree (QTBT) segmentation is used to segment the coding block. In the QTBT block structure, the CU can be square or rectangular. For example, the coding tree unit (CTU) is first segmented by a quadtree structure. The quadtree leaf nodes are further segmented by a binary tree or quadtree (or ternary tree) structure. The segmented leaf nodes are called coding units (CUs), which are used for prediction and transform processing without any further segmentation. That is, in the QTBT coding block structure, the block sizes of CU, PU, and TU are the same. At the same time, multiple segmentations such as ternary tree segmentation can be used in combination with the QTBT block structure.
[0115] In one example, mode selection unit 260 in video encoder 20 may be used to perform any combination of the segmentation techniques described herein.
[0116] As described above, the video encoder 20 is used to determine or select the best or optimal prediction mode from a (eg, predetermined) prediction mode set. The prediction mode set may include intra-frame prediction mode and / or inter-frame prediction mode, etc.
[0117] Intra-frame prediction
[0118] The intra-frame prediction mode set may include 35 different intra-frame prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in HEVC, or may include 67 different intra-frame prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in VVC.
[0119] The intra prediction unit 254 is configured to generate an intra prediction block 265 using reconstructed samples of neighboring blocks in the same current image according to an intra prediction mode in the intra prediction mode set.
[0120] The intra-frame prediction unit 254 (or generally the mode selection unit 260) is also used to output intra-frame prediction parameters (or generally information representing the selected intra-frame prediction mode of the block) to the entropy coding unit 270 in the form of syntax elements 266 to be included in the encoded image data 21, so that, for example, the video decoder 30 can receive and use the prediction parameters for decoding.
[0121] Inter prediction
[0122] The set of (possible) inter-frame prediction modes is based on the available reference image (i.e., for example, the at least partially decoded image stored in the DPB 230 as mentioned above) and other inter-frame prediction parameters, for example, based on whether the entire reference image is used or only a part of the reference image is used (e.g., a search window area around the area of the current block) to search for the best matching reference block, and / or for example, based on whether pixel interpolation is performed, such as half / half-pixel interpolation and / or quarter-pixel interpolation.
[0123] In addition to the above-mentioned prediction modes, skip mode and / or direct mode may also be applied.
[0124] The inter-frame prediction unit 244 may include a motion estimation (ME) unit and a motion compensation (MC) unit (both are not included in the Figure 2 ). The motion estimation unit may be configured to receive or acquire an image block 203 (a current image block 203 in a current image 17) and a decoded image 231, or at least one or more previous reconstructed blocks (e.g., reconstructed blocks in one or more other / different previous decoded images 231) for motion estimation. For example, a video sequence may include a current image and a previous decoded image 231, or in other words, the current image and the previous decoded image 231 may be part of or constitute a series of images, which constitute a video sequence.
[0125] For example, the encoder 20 may be configured to select a reference block from a plurality of reference blocks of the same or different images in a plurality of other images, and provide the reference image (or reference image index) and / or the offset (spatial offset) between the position (x coordinate, y coordinate) of the reference block and the position of the current block as an inter-frame prediction parameter to the motion estimation unit. This offset is also referred to as a motion vector (MV).
[0126] The motion compensation unit is used to obtain (e.g., receive) inter-frame prediction parameters, and perform inter-frame prediction based on or using the inter-frame prediction parameters to obtain an inter-frame prediction block 265. The motion compensation performed by the motion compensation unit may include extracting or generating a prediction block based on a motion / block vector determined by motion estimation, and may also include performing interpolation on sub-pixel precision. Interpolation filtering can generate samples of other pixels based on samples of known pixels, thereby potentially increasing the number of candidate prediction blocks that can be used to decode the image block. When receiving the motion vector of the PU corresponding to the current image block, the motion compensation unit can locate the prediction block pointed to by the motion vector in one of the reference image lists.
[0127] The motion compensation unit may also generate syntax elements associated with blocks and video slices for use by the video decoder 30 when decoding image blocks of the video slices. In addition to or as an alternative to slices and corresponding syntax elements, partition groups and / or partitions and corresponding syntax elements may also be generated or used.
[0128] Entropy Coding
[0129] The entropy coding unit 270 is used to apply or not apply an entropy coding algorithm or scheme (e.g., a variable length coding (VLC) scheme, a context adaptive VLC (CAVLC) scheme, an arithmetic coding scheme, binarization, context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or other entropy coding methods or techniques) to (uncompressed) quantization coefficients 209, inter-frame prediction parameters, intra-frame prediction parameters, loop filter parameters and / or other syntax elements to obtain coded image data 21 that can be output through an output terminal 272 in the form of a coded bitstream 21, etc., so that, for example, the video decoder 30 can receive and use these parameters for decoding. The coded bitstream 21 can be sent to the video decoder 30, or it can be stored in a memory and sent or retrieved by the video decoder 30 later.
[0130] The video stream may be encoded using other receiving forms of the video encoder 20. For example, a non-transform based encoder 20 may directly quantize the residual signal of certain blocks or frames without the transform processing unit 206. In another implementation, the encoder 20 may have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.
[0131] Decoder and decoding method
[0132] Figure 3An example of a video decoder 30 for implementing the technology of the present application is shown. The video decoder 30 is used to receive the encoded image data 21 (e.g., the encoded code stream 21) encoded by the encoder 20, and obtain a decoded image 331. The encoded image data or code stream includes information for decoding the encoded image data, such as data representing image blocks of encoded video slices (and / or partition groups or partitions) and related syntax elements.
[0133] exist Figure 3 In the example of , decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g., a summer 314), a loop filter 320, a decoded picture buffer (DPB) 330, a mode application unit 360, an inter-frame prediction unit 344, and an intra-frame prediction unit 354. Inter-frame prediction unit 344 may be or include a motion compensation unit. In some examples, video decoder 30 may perform substantially the same operations as for Figure 2 The encoding pass described in the video encoder 100 is the inverse of the decoding pass.
[0134] As described with reference to the encoder 20, the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 344, and the intra prediction unit 354 are also referred to as the "built-in decoder" constituting the video encoder 20. Accordingly, the inverse quantization unit 310 may be functionally identical to the inverse quantization unit 110, the inverse transform processing unit 312 may be functionally identical to the inverse transform processing unit 212, the reconstruction unit 314 may be functionally identical to the reconstruction unit 214, the loop filter 320 may be functionally identical to the loop filter 220, and the decoded picture buffer 330 may be functionally identical to the decoded picture buffer 230. Therefore, the explanation of the corresponding units and functions of the video encoder 20 applies accordingly to the corresponding units and functions of the video decoder 30.
[0135] Entropy decoding
[0136] The entropy decoding unit 304 is used to parse the code stream 21 (or generally the encoded image data 21) and perform entropy decoding on the encoded image data 21 to obtain the quantization coefficients 309 and / or the decoded encoding parameters ( Figure 3The entropy decoding unit 304 may be used to apply a decoding algorithm or scheme corresponding to the coding scheme described for the entropy coding unit 270 in the encoder 20. The entropy decoding unit 304 may also be used to provide the inter-frame prediction parameters, intra-frame prediction parameters and / or other syntax elements to the mode application unit 360, and to provide other parameters to other units of the decoder 30. The video decoder 30 may receive syntax elements at the video slice level and / or the video block level. In addition to or as an alternative to the slices and the corresponding syntax elements, block groups and / or blocks and corresponding syntax elements may also be received and / or used.
[0137] Dequantization
[0138] The inverse quantization unit 310 may be configured to receive a quantization parameter (QP) (or generally information related to inverse quantization) and a quantization coefficient from the encoded image data 21 (e.g., parsed and / or decoded by the entropy decoding unit 304, etc.), and inverse quantize the decoded quantization coefficient 309 according to the quantization parameters to obtain a dequantized coefficient 311. The dequantized coefficient 311 may also be referred to as a transform coefficient 311. The inverse quantization process may include determining a degree of quantization using a quantization parameter determined by the video encoder 20 for each video block in a video slice (or partition or group of partitions), and also determining a degree of inverse quantization that needs to be performed.
[0139] Inverse Transform
[0140] The inverse transform processing unit 312 can be used to receive the dequantized coefficients 311 (also called transform coefficients 311) and transform the dequantized coefficients 311 to obtain a reconstructed residual block 213 in the sample domain. The reconstructed residual block 213 can also be called a transform block 313. The transform can be an inverse transform, such as an inverse DCT, an inverse DST, an inverse integer transform, or a conceptually similar inverse transform process. The inverse transform processing unit 312 can also be used to receive transform parameters or corresponding information from the encoded image data 21 (e.g., parsed and / or decoded by the entropy decoding unit 304, etc.) to determine the transform to be performed on the dequantized coefficients 311.
[0141] reconstruction
[0142] The reconstruction unit 314 (eg, an adder or summer 314 ) may be configured to add the reconstructed residual block 313 to the prediction block 365 to obtain the reconstructed block 315 in the sample domain, eg, by adding sample values of the reconstructed residual block 313 to sample values of the prediction block 365 .
[0143] Filtering
[0144] The loop filter unit 320 (in the decoding loop or after) is used to filter the reconstructed block 315 to obtain a filtered block 321, for example, to smooth pixel transitions or otherwise improve video quality. The loop filter unit 320 may include one or more loop filters, such as a deblocking filter, a sample-adaptive offset (SAO) filter, or one or more other filters, such as a bilateral filter, an adaptive loop filter (ALF), a sharpening or smoothing filter, a collaborative filter, or any combination thereof. Although the loop filter unit 320 is in Figure 3 3. Although shown as an in-loop filter in FIG. 3, in other configurations, the loop filter unit 320 may be implemented as a post-loop filter.
[0145] Decode image buffer
[0146] The decoded video blocks 321 of the pictures are then stored in a decoded picture buffer 330 which stores decoded pictures 331 as reference pictures for subsequent motion compensation of other pictures and / or for output to a display, respectively.
[0147] The decoder 30 is used to output the decoded image 311 through an output terminal 312, etc., for display to a user or for viewing by the user.
[0148] predict
[0149] The function of the inter-frame prediction unit 344 can be the same as the inter-frame prediction unit 244 (specifically the motion compensation unit), and the intra-frame prediction unit 354 can be the same as the inter-frame prediction unit 254 in function, and performs division or segmentation and performs prediction according to the segmentation and / or prediction parameters or corresponding information received from the encoded image data 21 (for example, parsed and / or decoded by the entropy decoding unit 304, etc.). The mode application unit 360 can be used to perform prediction (intra-frame prediction or inter-frame prediction) on each block according to the reconstructed image, block or corresponding sample (filtered or unfiltered), and obtain a prediction block 365.
[0150] When the video slice is decoded as an intra-coded (I) slice, the intra-prediction unit 354 in the mode application unit 360 is used to generate a prediction block 365 for the image block of the current video slice based on the indicated intra-prediction mode and data from a previously decoded block of the current image. When the video image is decoded as an inter-coded (i.e., B or P) slice, the inter-prediction unit 344 (e.g., motion compensation unit) of the mode application unit 360 is used to generate the prediction block 365 for the video block of the current video slice based on the motion vector and other syntax elements received from the entropy decoding unit 304. For inter-prediction, these prediction blocks can be generated based on one of the reference pictures in one of the reference picture lists. The video decoder 30 can construct the reference frame lists: List 0 and List 1 using a default construction technique based on the reference pictures stored in the DPB 330. The same or similar processes may be applied to or by embodiments that use partition groups (e.g., video partition groups) and / or partitions (e.g., video partitions) in addition to or as an alternative to slices (e.g., video slices), for example, video may be decoded using I, P, or B partition groups and / or partitions.
[0151] The mode application unit 360 is used to determine prediction information for video blocks of the current video slice by parsing motion vectors or related information and other syntax elements, and use the prediction information to generate a prediction block for the current video block being decoded. For example, the mode application unit 360 uses some of the received syntax elements to determine the prediction mode (e.g., intra prediction or inter prediction) for decoding the video blocks of the video slice, the inter prediction slice type (e.g., B slice, P slice, or GPB slice), the construction information of one or more reference picture lists for the slice, the motion vector for each inter-coded video block of the slice, the inter prediction state for each inter-coded video block of the slice, and other information to decode the video blocks in the current video slice. In addition to slices (e.g., video slices) or as an alternative to slices, the same or similar process can be applied to or by embodiments using block groups (e.g., video block groups) and / or blocks (e.g., video blocks), for example, I, P or B block groups and / or blocks can be used to decode video.
[0152] Figure 3 An embodiment of the video decoder 30 shown in FIG. 1 may be used to partition and / or decode an image using slices (also referred to as video slices), wherein an image may be partitioned or decoded using one or more slices (typically non-overlapping) and each slice may include one or more blocks (e.g., CTUs).
[0153] In an embodiment, Figure 3The video decoder 30 shown may be used to segment and / or decode an image using block groups (also referred to as video block groups) and / or blocks (also referred to as video blocks). An image may be segmented into one or more block groups (usually non-overlapping) or decoded using one or more block groups (usually non-overlapping); each block group may include one or more blocks (e.g., CTU) or one or more blocks, etc.; each block may be rectangular, etc., and may include one or more complete or partial blocks (e.g., CTU), etc.
[0154] Other forms of video decoders 30 may be used to decode the encoded image data 21. For example, the decoder 30 may generate an output video stream without the loop filter unit 320. For example, a non-transform based decoder 30 may directly inverse quantize the residual signal without the inverse transform processing unit 312 for certain blocks or frames. In another implementation, the video decoder 30 may have the inverse quantization unit 310 and the inverse transform processing unit 312 combined into a single unit.
[0155] It should be understood that the processing result of the current step can be further processed in the encoder 20 and the decoder 30 and then output to the next step. For example, after interpolation filtering, motion vector derivation or loop filtering, the processing result of interpolation filtering, motion vector derivation or loop filtering can be further operated, such as clipping or shifting.
[0156] It should be noted that the derived motion vector of the current block (including but not limited to the control point motion vector of the affine mode, the sub-block motion vector of the affine mode, the plane mode, the ATMVP mode, the temporal motion vector, etc.) can be further operated. For example, the value of the motion vector is limited to a predefined range according to the representation bit of the motion vector. If the representation bit of the motion vector is bitDepth, the range is –2^(bitDepth–1) to 2^(bitDepth–1)–1, where “^” represents a power. For example, if bitDepth is set to 16, the range is –32768 to 32767; if bitDepth is set to 18, the range is –131072 to 131071. For example, the derived motion vector (e.g., the MV of 4 4×4 sub-blocks in an 8×8 block) is limited so that the maximum difference between the integer parts of the 4 4×4 sub-block MVs does not exceed N pixels, for example, not more than 1 pixel. Two methods of limiting motion vectors according to bitDepth are provided here.
[0157] Method 1: Remove the most significant bit (MSB) of the overflow by smoothing
[0158] ux= (mvx+2 bitDepth ) % 2 bitDepth (1)
[0159] mvx = (ux >= 2 bitDepth–1 ) ? (ux – 2 bitDepth ) : ux (2)
[0160] uy= (mvy+2 bitDepth ) % 2 bitDepth (3)
[0161] mvy = (uy >= 2 bitDepth–1 ) ? (uy–2 bitDepth ):uy (4)
[0162] Among them, mvx is the horizontal component of the motion vector of an image block or sub-block, mvy is the vertical component of the motion vector of an image block or sub-block, and ux and uy are intermediate values.
[0163] For example, if the value of mvx is –32769, the value obtained by using formulas (1) and (2) is 32767. In computer systems, decimal numbers are stored in the form of two's complement. The two's complement of –32769 is 1,0111,1111,1111,1111 (17 bits), and if the MSB is discarded, the two's complement obtained is 0111,1111,1111,1111 (the decimal number is 32767), which is the same as the output result obtained by using formulas (1) and (2).
[0164] ux= (mvpx + mvdx +2 bitDepth ) % 2 bitDepth (5)
[0165] mvx = (ux >= 2 bitDepth–1 ) ? (ux – 2 bitDepth ) : ux (6)
[0166] uy= (mvpy + mvdy +2 bitDepth ) % 2 bitDepth (7)
[0167] mvy = (uy >= 2 bitDepth–1 ) ? (uy–2 bitDepth ):uy (8)
[0168] These operations can be performed in the process of summing mvp and mvd, as shown in equations (5) to (8).
[0169] Method 2: Clip the value to remove the overflowed MSB
[0170] vx=Clip3(–2 bitDepth–1 ,2 bitDepth–1 –1,vx)
[0171] vy=Clip3(–2 bitDepth–1 ,2 bitDepth–1 –1,vy)
[0172] Where vx is the horizontal component of the motion vector of the image block or sub-block; vy is the vertical component of the motion vector of the image block or sub-block; x, y and z correspond to the three input values of the MV clipping process respectively. The function Clip3 is defined as follows:
[0173]
[0174] Figure 4 Schematic diagram of a video decoding device 400 provided in an embodiment of the present invention. The video decoding device 400 is suitable for implementing the disclosed embodiments described herein. In one embodiment, the video decoding device 400 may be a decoder (e.g. Figure 1A A video decoder 30) or an encoder (such as Figure 1A video encoder 20).
[0175] The video decoding device 400 includes: an input port 410 (or input port 410) and a receiving unit (Rx) 420 for receiving data; a processor, a logic unit or a central processing unit (CPU) 430 for processing data; a transmitting unit (Tx) 440 and an output port 450 (or output port 450) for transmitting data; and a memory 460 for storing data. The video decoding device 400 may also include an optical-to-electrical (OE) component and an electrical-to-optical (EO) component coupled to the input port 410, the receiving unit 420, the transmitting unit 440 and the output port 450 for inputting and outputting optical signals or electrical signals.
[0176] The processor 430 is implemented by hardware and software. The processor 430 can be implemented as one or more CPU chips, cores (e.g., multi-core processors), FPGAs, ASICs, and DSPs. The processor 430 communicates with the input port 410, the receiving unit 420, the sending unit 440, the output port 450, and the memory 460. The processor 430 includes a decoding module 470. The decoding module 470 implements the disclosed embodiments described above. For example, the decoding module 470 performs, processes, prepares, or provides various decoding operations. Therefore, the inclusion of the decoding module 470 significantly improves the function of the video decoding device 400 and realizes the conversion of different states of the video decoding device 400. Alternatively, the decoding module 470 is implemented by instructions stored in the memory 460 and executed by the processor 430.
[0177] The memory 460 includes one or more disks, tape drives, and solid-state hard disks, and can be used as an overflow data storage device for storing such programs when such programs are selected for execution, and for storing instructions and data read during program execution. For example, the memory 460 can be volatile and / or non-volatile, and can be a read-only memory (ROM), a random access memory (RAM), a ternary content-addressable memory (TCAM), and / or a static random-access memory (SRAM).
[0178] Figure 5 A simplified block diagram of an apparatus 500 is provided for an exemplary embodiment, and the apparatus 500 may be used as Figure 1A Either or both of the source device 12 and the destination device 14 in .
[0179] The processor 502 in the apparatus 500 may be a central processing unit. Alternatively, the processor 502 may be any other type of device or devices that are currently available or will be developed in the future and are capable of manipulating or processing information. Although the disclosed implementations may be implemented using a single processor such as the processor 502 shown in the figure, using more than one processor may improve speed and efficiency.
[0180] In one implementation, the memory 504 in the apparatus 500 may be a read only memory (ROM) device or a random access memory (RAM) device. Any other suitable type of storage device may be used as the memory 504. The memory 504 may include code and data 506 accessed by the processor 502 via a bus 512. The memory 504 may also include an operating system 508 and an application 510, wherein the application 510 includes at least one program that supports the processor 502 to perform the methods described herein. For example, the application 510 may include applications 1 to N, and may also include a video decoding application that performs the methods described herein.
[0181] The apparatus 500 may also include one or more output devices, such as a display 518. In one example, the display 518 may be a touch-sensitive display that combines a display with a touch-sensitive element that can be used to sense touch input. The display 518 may be coupled to the processor 502 via the bus 512.
[0182] Although the bus 512 of the device 500 is described herein as a single bus, the bus 512 may include multiple buses. In addition, the auxiliary memory 514 may be directly coupled to other components of the device 500 or may be accessed through a network, and may include a single integrated unit (e.g., one memory card) or multiple units (e.g., multiple memory cards). Therefore, the device 500 may be implemented in a variety of configurations.
[0183] Parameter Set
[0184] Parameter sets in state-of-the-art codecs are fundamentally similar and have the same basic design goals, namely rate efficiency, error resilience, and providing a system layer interface. Parameter sets in HEVC (H.265) have a hierarchical structure, including video parameter sets (VPS), sequence parameter sets (SPS), and picture parameter sets (PPS), which are similar to their counterparts in AVC and VVC. Each slice references a single active PPS, SPS, and VPS to access information for decoding the slice. The PPS contains information applicable to all slices in a picture, so all slices in a picture must reference the same PPS. Strips in different pictures can also reference the same PPS. Similarly, the SPS contains information applicable to all pictures in the same coded video sequence.
[0185] Although the PPS may be different for individual pictures, it is common for many or all pictures in a coded video sequence to reference the same PPS. Reusing parameter sets is efficient in terms of bitrate because it avoids having to send shared information multiple times. It is also loss robust because it allows the parameter set content to be carried by some more reliable external communication link or repeated frequently in the codestream to ensure that the parameter set content is not lost.
[0186] In HEVC, to identify the active parameter sets at each level of the parameter set type hierarchy for a given slice, each slice header contains a PPS identifier that refers to a specific PPS. The identifier in the PPS is an identifier that refers to a specific SPS. In turn, the identifier in the SPS is an identifier that refers to a specific VPS.
[0187] A parameter set is activated when it is referenced by the current coded slice to be decoded. All active parameter sets must be available to the decoder when they are first referenced. Parameter sets can be sent in-band or out-of-band and can be sent repeatedly.
[0188] Parameter sets may be received in any order.
[0189] These parameter set features provide increased error resilience by overcoming some network loss of the parameter set. Additionally, using parameter sets enables decoding of a single slice even when another slice in the same picture suffers from network loss, compared to the case where a picture header containing the same information is present in a subset of picture slices.
[0190] Picture Parameter Set (PPS)
[0191] The PPS contains parameters that may vary for different pictures in the same coded video sequence. However, multiple pictures may reference the same PPS, even if the pictures have different slice coding types (I, P, and B). Including these parameters in the picture parameter set instead of in the slice header can improve bit rate efficiency and provide error resilience while transmitting the PPS more reliably.
[0192] The PPS contains a PPS identifier and an index to the reference SPS. The remaining parameters describe the decoding tools used in the slices that reference the PPS. Decoding tools can be enabled or disabled, including blocking, weighted prediction, symbol data hiding, temporal motion vector prediction, etc. The decoding tool parameters indicated in the PPS include the number of reference indices, the initial quantization parameter (QP), and the chroma QP offset. Decoding tool parameters can also be indicated in the PPS, such as deblocking filter control, blocking configuration, and scaling list data. Figure 6 and Figure 7An exemplary PPS provided by the Joint Video Experts Team (JVET) of ITU-TSG 16 WP 3 and ISO / IEC JTC 1 / SC 29 / WG11, Generic Video Coding (Draft 6) document (available at http: / / phenix.it-sudparis.eu / jvet / , document number: Document: JVET-O2001-vE) is described.
[0193] exist Figure 7 , a portion of the PPS is described. In this figure, the syntax element constant_slice_header_params_enabled_flag (constant_slice_header_params_enabled_flag) indicates whether constant parameters are present in the PPS. When the value of constant_slice_header_params_enabled_flag is equal to 1, other syntax elements such as pps_temporal_mvp_enabled_idc (730) are included in the PPS. pps_temporal_mvp_enabled_idc is a syntax element that may be present in the PPS, controls the application of temporal motion vector prediction, and indicates the following information:
[0194] If the value of the syntax element is 1, temporal MV prediction is disabled in slices referencing this PPS.
[0195] If the value of the syntax element is 2, temporal MV prediction is enabled in slices that reference this PPS.
[0196] If the value of the syntax element is 0, a second syntax element is included in the slice header to control the application of temporal MV prediction for the slice. According to the prior art (JVET-O2001-vE), pps_temporal_mvp_enabled_idc equal to 0 indicates that the syntax element slice_temporal_mvp_enabled_flag is present in the slice header of the slice, where the slice_type of the slice referencing the PPS is not equal to 1. pps_temporal_mvp_enabled_idc equal to 1 or 2 indicates that slice_temporal_mvp_enabled_flag is not present in the slice header of the slice referencing the PPS. pps_temporal_mvp_enabled_idc equal to 3 is reserved for future use by ITU-T|ISO / IEC.
[0197] exist Figure 7, another example is described, which is dep_quant_enabled_flag (720). pps_dep_quant_enabled_idc equal to 0 indicates that the syntax element dep_quant_enabled_flag is present in the slice header of the slice that references the PPS. pps_dep_quant_enabled_idc equal to 1 or 2 indicates that the syntax element dep_quant_enabled_flag is not present in the slice header of the slice that references the PPS. pps_dep_quant_enabled_idc equal to 3 is reserved for future use by ITU-T|ISO / IEC. When dep_quant_enabled_flag controls the application of dependent quantization for a slice, a value of 0 corresponds to disabling dependent quantization and a value of 1 corresponds to enabling dependent quantization. When pps_dep_quant_enabled_idc is not equal to 0, dep_quant_enabled_flag is not included in the slice header, but its value is inferred to be equal to pps_dep_quant_enabled_idc–1.
[0198] Figure 7 It is described that when constant_slice_header_params_enabled_flag is true, the syntax elements are included in the PPS. When constant_slice_header_params_enabled_flag is true, the syntax elements indicate that the default values included in the PPS have the following common properties:
[0199] Each syntax element in the PPS has a corresponding syntax element in the slice header. For example, pps_dep_quant_enabled_idc is a syntax element in the PPS, and dep_quant_enabled_flag is a corresponding syntax element in the slice header.
[0200] If the value of the syntax element in the PPS is zero, the corresponding syntax element in the slice header exists in the slice header (included in the slice header). Otherwise, the slice header syntax element does not exist in the slice header.
[0201] If the value of the syntax element in the PPS is different from zero, the value of the corresponding slice header syntax element is inferred from the value of the syntax element in the PPS. For example, if the value of pps_dep_quant_enabled_idc is equal to 1, the value of dep_quant_enabled_idc is inferred to be pps_dep_quant_enabled_idc−1=0.
[0202] In VVC and HEVC, partitions (slices, blocks, sub-pictures, bricks, etc.) of the same video picture must refer to the same picture parameter set. This is a requirement of the coding standard because the PPS may include parameters that apply to the entire picture. For example, the syntax elements included in brackets (610) describe how to split a picture into multiple block partitions as follows:
[0203] ·tile_cols_width_minus1 indicates the width of each tile when the image is evenly divided into tiles, in CTB.
[0204] ·tile_rows_height_minus1 indicates the height of each tile when the image is evenly divided into tiles, in CTB.
[0205] ·num_tile_columns_minus1 indicates the number of tile columns in the image.
[0206] num_tile_rows_minus1 indicates the number of tile rows in the image.
[0207] The picture that refers to the PPS is divided into multiple block partitions, which are represented according to the syntax elements above. If two slices of the same picture refer to 2 different PPSs, it may cause conflicting situations because each PPS may represent a different type of picture block partition. Therefore, it is forbidden for 2 slices (or generally 2 partitions of a picture) to refer to 2 different PPSs.
[0208] In VVC, various image partitioning mechanisms are defined, which are called slices, blocks, bricks and sub-images. In this application, image partition is a general term that refers to any of the slices, blocks, bricks or sub-images. Image partition usually refers to a part of a frame that is decoded independently of other parts of the same image.
[0209] Adaptive parameter set
[0210] In state-of-the-art video codecs, the bitstream consists of a series of data units called network abstraction layer (NAL) units. Some NAL units contain parameter sets that carry high-level information about the entire coded video sequence or a subset of pictures in it. Other NAL units carry coded samples in the form of slices belonging to one of the different picture types. Adaptation parameter sets (APS) are parameter sets used to encapsulate ALF filter control data (e.g., filter coefficients).
[0211] Figure 8The adaptive parameter set provided by the Generic Video Coding (Draft 6) document of the joint video experts team (JVET) of ITU-T SG 16WP 3 and ISO / IEC JTC 1 / SC 29 / WG 11 (available at http: / / phenix.it-sudparis.eu / jvet / , document number: Document: JVET-O2001-vE) is exemplified.
[0212] Strip Head
[0213] The slice segment header contains an index to the reference PPS. The slice segment header contains data identifying the starting address of the slice. Some parameters are only included in the first slice segment of the slice, including the slice type (I, P, or B), image output flags, etc. If tools are enabled in the SPS or PPS, including enabling SAO for luma and chroma separately, enabling deblocking filter operations for slices, and using initial slice quantization parameter (QP) values, the presence of some decoding tool parameters is indicated in the slice header. Deblocking filter parameters can be present in the slice segment header or PPS.
[0214] Coding strip
[0215] Each coded slice usually consists of a slice header followed by slice data. The slice header carries control information of the slice, and the slice data carries coded samples. Fig. 9 and Fig.11 The stripe header provided by document JVET-O2001-vE is illustrated. In addition, Fig.10a A coding tree unit syntax structure as a part of slice data is illustrated.
[0216] Each stripe is independent of the other stripes because the information carried in the stripe is encoded and not based on data from other stripes in the same image.
[0217] Image Header
[0218] A picture header (PH) is a syntax structure that includes syntax elements that apply to all slices in a coded picture. Fig.10b Illustrated in document JVET-P1006 ( http: / / phenix.it-sudparis.eu / jvet / doc_ end_user / documents / 16_Geneva / wg11 / JVET-P1006-v2.zip) provided by the picture header. For example, pic_temporal_mvp_enabled_flag indicates whether the temporal motion vector prediction value can be used for inter prediction of all slices associated with the picture header. If pic_temporal_mvp_enabled_flag is equal to 0, the syntax elements of the slices associated with the picture header shall be constrained so that the temporal motion vector prediction value is not used when decoding the slice. Otherwise (pic_temporal_mvp_enabled_flag is equal to 1), the temporal motion vector prediction value can be used for decoding the slices associated with the picture header. Fig.10b As an example of the picture header structure, pic_temporal_mvp_enabled_flag is highlighted.
[0219] The picture header is designed for all picture types, i.e., I-pictures, P-pictures, and B-pictures. An I-picture contains only intra-prediction blocks, whereas a P-picture or a B-picture contains inter-prediction blocks. The difference between a P-picture and a B-picture is that a B-picture can contain inter-prediction blocks using bidirectional prediction, whereas in a P-picture, only unidirectional inter-prediction can be used. It should be noted that intra-prediction blocks may also exist in a P-picture or a B-picture.
[0220] In the picture header, there are quite a few syntax elements that apply only to inter-frame prediction, i.e. only to P-pictures and B-pictures. These elements are not required for I-pictures.
[0221] The embodiment of the present invention proposes to introduce a flag indicating whether the current picture is an I picture. When the current picture is an I picture, all syntax elements designed for inter-frame prediction will not be indicated in the picture header, but will be inferred as default values.
[0222] In one example, the proposed flag is named ph_all_intra_flag. The use of this flag is as follows.
[0223]
[0224]
[0225]
[0226] partition_constraints_override_flag equal to 1 indicates that the partition constraint parameters are present in the picture header. partition_constraints_override_flag equal to 0 indicates that the partition constraint parameters are not present in the picture header. When partition_constraints_override_flag is not present, its value is inferred to be equal to 0.
[0227] pic_log2_diff_min_qt_min_cb_intra_slice_luma represents the difference between the logarithm of the minimum size of the first luma sample with base 2 and the logarithm of the minimum coding block size of the second luma sample with base 2 in the slice with slice_type associated with the picture header being equal to 2(I), wherein the first luma sample is the luma sample of the luma leaf block obtained by quadtreeing the CTU, and the second luma sample is the luma sample of the luma CU. The value of pic_log2_diff_min_qt_min_cb_intra_slice_luma shall be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY, inclusive. When pic_log2_diff_min_qt_min_cb_luma is not present, its value is inferred to be equal to sps_log2_diff_min_qt_min_cb_intra_slice_luma.
[0228] pic_log2_diff_min_qt_min_cb_inter_slice represents the difference between the logarithm to base 2 of the minimum size of a luma leaf block expressed in luma samples and the logarithm to base 2 of the minimum luma coding block size expressed in luma samples of luma coding units (CUs) quadtree partitioned from the coding tree unit (CTU) in slices where slice_type associated with the picture header is equal to 0 (B) or 1 (P). The value of pic_log2_diff_min_qt_min_cb_inter_slice shall be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY, inclusive. When pic_log2_diff_min_qt_min_cb_luma is not present, its value is inferred to be equal to sps_log2_diff_min_qt_min_cb_inter_slice.
[0229] pic_max_mtt_hierarchy_depth_inter_slice indicates the maximum hierarchical depth of coding units resulting from multi-type tree partitioning of quadleaves in slices where slice_type associated with the picture header is equal to 0 (B) or 1 (P). The value of pic_max_mtt_hierarchy_depth_inter_slice shall be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY, inclusive. When pic_max_mtt_hierarchy_depth_inter_slice is not present, its value is inferred to be equal to sps_max_mtt_hierarchy_depth_inter_slice.
[0230] pic_max_mtt_hierarchy_depth_intra_slice_luma represents the maximum hierarchical depth of coding units resulting from multi-type tree partitioning of quadleaf leaves in slices with slice_type associated with the picture header equal to 2(I). The value of pic_max_mtt_hierarchy_depth_intra_slice_luma shall be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY, inclusive. When pic_max_mtt_hierarchy_depth_intra_slice_luma is not present, its value is inferred to be equal to sps_max_mtt_hierarchy_depth_intra_slice_luma.
[0231] pic_log2_diff_max_bt_min_qt_intra_slice_luma represents the difference between the logarithm of the maximum size (width or height) of the first luma sample and the logarithm of the minimum size (width or height) of the second luma sample in the slice with slice_type associated with the picture header being equal to 2 (I), wherein the first luma sample is a luma sample of a luma coding block that can be divided using binary tree partitioning, and the second luma sample is a luma sample of a luma leaf block obtained by quadtree partitioning the CTU. The value of pic_log2_diff_max_bt_min_qt_intra_slice_luma should be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeIntraY, inclusive. When pic_log2_diff_max_bt_min_qt_intra_slice_luma is not present, its value is inferred to be equal to sps_log2_diff_max_bt_min_qt_intra_slice_luma.
[0232] pic_log2_diff_max_tt_min_qt_intra_slice_luma represents the difference between the logarithm of the maximum size (width or height) of the first luma sample with base 2 and the logarithm of the minimum size (width or height) of the second luma sample with base 2 in the slice with slice_type associated with the picture header being equal to 2(I), wherein the first luma sample is a luma sample of a luma coding block that can be partitioned using ternary tree partitioning, and the second luma sample is a luma sample of a luma leaf block obtained by quadtree partitioning the CTU. The value of pic_log2_diff_max_tt_min_qt_intra_slice_luma shall be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeIntraY, inclusive. When pic_log2_diff_max_tt_min_qt_intra_slice_luma is not present, its value is inferred to be equal to sps_log2_diff_max_tt_min_qt_intra_slice_luma.
[0233] pic_log2_diff_max_bt_min_qt_inter_slice represents the difference between the logarithm to base 2 of the maximum size (width or height) of a luma coding block that can be partitioned by binary tree partitioning, expressed in luma samples, and the logarithm to base 2 of the minimum size (width or height) of a luma leaf block that is quadtree partitioned from a CTU, in slices where slice_type associated with the picture header is equal to 0 (B) or 1 (P). The value of pic_log2_diff_max_bt_min_qt_inter_slice shall be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeInterY, inclusive. When pic_log2_diff_max_bt_min_qt_inter_slice is not present, its value is inferred to be equal to sps_log2_diff_max_bt_min_qt_inter_slice.
[0234] pic_log2_diff_max_tt_min_qt_inter_slice represents the difference between the logarithm to base 2 of the maximum size (width or height) of a luma coding block that can be divided by ternary tree partitioning, expressed in luma samples, and the logarithm to base 2 of the minimum size (width or height) of a luma leaf block that is quadtree partitioned from a CTU, in slices where slice_type associated with the picture header is equal to 0 (B) or 1 (P). The value of pic_log2_diff_max_tt_min_qt_inter_slice shall be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeInterY, inclusive. When pic_log2_diff_max_tt_min_qt_inter_slice is not present, its value is inferred to be equal to sps_log2_diff_max_tt_min_qt_inter_slice.
[0235] pic_log2_diff_min_qt_min_cb_intra_slice_chroma represents the difference between the logarithm of the minimum size of the first luma sample with base 2 and the logarithm of the minimum coding block size of the second luma sample with base 2 in the slice with slice_type associated with the picture header being equal to 2(I), wherein the first luma sample is the luma sample of the chroma leaf block obtained by quadtree partitioning the chroma CTU with treeType equal to DUAL_TREE_CHROMA, and the second luma sample is the luma sample of the chroma CU with treeType equal to DUAL_TREE_CHROMA. The value of pic_log2_diff_min_qt_min_cb_intra_slice_chroma should be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY (inclusive). When pic_log2_diff_min_qt_min_cb_intra_slice_chroma is not present, its value is inferred to be equal to sps_log2_diff_min_qt_min_cb_intra_slice_chroma.
[0236] pic_max_mtt_hierarchy_depth_intra_slice_chroma represents the maximum hierarchy depth of chroma coding units resulting from multi-type tree partitioning of the leaves of the chroma quadtree with treeType equal to DUAL_TREE_CHROMA in slices with slice_type equal to 2(I) associated with the picture header. The value of pic_max_mtt_hierarchy_depth_intra_slice_chroma shall be in the range of 0 to CtbLog2SizeY–MinCbLog2SizeY, inclusive. When pic_max_mtt_hierarchy_depth_intra_slice_chroma is not present, its value is inferred to be equal to sps_max_mtt_hierarchy_depth_intra_slice_chroma.
[0237] pic_log2_diff_max_bt_min_qt_intra_slice_chroma represents the difference between the logarithm of the maximum size (width or height) of the first luma sample and the logarithm of the minimum size (width or height) of the second luma sample in the slice with slice_type equal to 2 (I) associated with the picture header, where the first luma sample is a luma sample of a chroma coding block that can be partitioned using binary tree partitioning and the second luma sample is a luma sample of a chroma leaf block obtained by quadtree partitioning of a chroma CTU with treeType equal to DUAL_TREE_CHROMA. The value of pic_log2_diff_max_bt_min_qt_intra_slice_chroma shall be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeIntraC, inclusive. When pic_log2_diff_max_bt_min_qt_intra_slice_chroma is not present, its value is inferred to be equal to sps_log2_diff_max_bt_min_qt_intra_slice_chroma.
[0238] pic_log2_diff_max_tt_min_qt_intra_slice_chroma represents the difference between the logarithm of the maximum size (width or height) of the first luma sample and the logarithm of the minimum size (width or height) of the second luma sample in the slice with slice_type equal to 2 (I) associated with the picture header, where the first luma sample is a luma sample of a chroma coding block that can be partitioned using ternary tree partitioning and the second luma sample is a luma sample of a chroma leaf block obtained by quadtree partitioning of a chroma CTU with treeType equal to DUAL_TREE_CHROMA. The value of pic_log2_diff_max_tt_min_qt_intra_slice_chroma shall be in the range of 0 to CtbLog2SizeY–MinQtLog2SizeIntraC, inclusive. When pic_log2_diff_max_tt_min_qt_intra_slice_chroma is not present, its value is inferred to be equal to sps_log2_diff_max_tt_min_qt_intra_slice_chroma.
[0239] pic_cu_qp_delta_subdiv_intra_slice represents the maximum cbSubdiv value for coding units that pass cu_qp_delta_abs and cu_qp_delta_sign_flag in intra slices. The value of pic_cu_qp_delta_subdiv_intra_slice shall be in the range of 0 to 2*(CtbLog2SizeY–MinQtLog2SizeIntraY+pic_max_mtt_hierarchy_depth_intra_slice_luma), inclusive.
[0240] When pic_cu_qp_delta_subdiv_intra_slice is not present, its value is inferred to be equal to 0.
[0241] pic_cu_qp_delta_subdiv_inter_slice indicates the maximum cbSubdiv value for coding units that pass cu_qp_delta_abs and cu_qp_delta_sign_flag in inter slices. The value of pic_cu_qp_delta_subdiv_inter_slice shall be in the range of 0 to 2*(CtbLog2SizeY–MinQtLog2SizeInterY+pic_max_mtt_hierarchy_depth_inter_slice), inclusive.
[0242] When pic_cu_qp_delta_subdiv_inter_slice is not present, its value is inferred to be equal to 0.
[0243] pic_cu_chroma_qp_offset_subdiv_intra_slice represents the maximum cbSubdiv value for coding units that pass cu_chroma_qp_offset_flag in intra slices. The value of pic_cu_chroma_qp_offset_subdiv_intra_slice shall be in the range of 0 to 2*(CtbLog2SizeY–MinQtLog2SizeIntraY+pic_max_mtt_hierarchy_depth_intra_slice_luma), inclusive.
[0244] When pic_cu_chroma_qp_offset_subdiv_intra_slice is not present, its value is inferred to be equal to 0.
[0245] pic_cu_chroma_qp_offset_subdiv_inter_slice indicates the maximum cbSubdiv value for coding units that pass cu_chroma_qp_offset_flag in inter slices. The value of pic_cu_chroma_qp_offset_subdiv_inter_slice shall be in the range of 0 to 2*(CtbLog2SizeY–MinQtLog2SizeInterY+pic_max_mtt_hierarchy_depth_inter_slice), inclusive.
[0246] When pic_cu_chroma_qp_offset_subdiv_inter_slice is not present, its value is inferred to be equal to 0.
[0247] pic_temporal_mvp_enabled_flag indicates whether the temporal motion vector prediction value can be used for inter prediction of the slice associated with the picture header. If pic_temporal_mvp_enabled_flag is equal to 0, the syntax elements of the slice associated with the picture header shall be constrained so that the temporal motion vector prediction value is not used when decoding the slice. Otherwise (pic_temporal_mvp_enabled_flag is equal to 1), the temporal motion vector prediction value can be used to decode the slice associated with the picture header.
[0248] When pic_temporal_mvp_enabled_flag is not present, the following applies:
[0249] – If sps_temporal_mvp_enabled_flag is equal to 0, the value of pic_temporal_mvp_enabled_flag is inferred to be equal to 0.
[0250] – Otherwise (sps_temporal_mvp_enabled_flag is equal to 1), the value of pic_temporal_mvp_enabled_flag is inferred to be equal to pps_temporal_mvp_enabled_idc–1.
[0251] mvd_l1_zero_flag equal to 1 indicates that the syntax structure mvd_coding(x0,y0,1) is not parsed, and MvdL1[x0][y0][compIdx] and MvdL1[x0][y0][cpIdx][compIdx] are set to 0, where compIdx = 0..1 and cpIdx = 0..2. mvd_l1_zero_flag equal to 0 indicates that the syntax structure mvd_coding(x0,y0,1) is parsed. When mvd_l1_zero_flag is not present, its value is inferred to be equal to pps_mvd_l1_zero_idc–1.
[0252] pic_six_minus_max_num_merge_cand represents 6 minus the maximum number of merged motion vector prediction (MVP) candidates supported in the slice associated with the picture header. The maximum number of merged MVP candidates MaxNumMergeCand is derived as follows:
[0253] MaxNumMergeCand = 6 – picsix_minus_max_num_merge_cand (7-111)
[0254] The value of MaxNumMergeCand shall be in the range 1 to 6, inclusive. When pic_six_minus_max_num_merge_cand is not present, its value is inferred to be equal to pps_six_minus_max_num_merge_cand_plus1–1.
[0255] pic_five_minus_max_num_subblock_merge_cand represents 5 minus the maximum number of sub-block based merged motion vector prediction (MVP) candidates supported in the slice.
[0256] When pic_five_minus_max_num_subblock_merge_cand does not exist, the following applies:
[0257] – If sps_affine_enabled_flag is equal to 0, the value of pic_five_minus_max_num_subblock_merge_cand is inferred to be equal to 5 – (sps_sbtmvp_enabled_flag && pic_temporal_mvp_enabled_flag).
[0258] – Otherwise (sps_affine_enabled_flag is equal to 1), the value of pic_five_minus_max_num_subblock_merge_cand is inferred to be equal to pps_five_minus_max_num_subblock_merge_cand_plus1–1.
[0259] The maximum number of sub-block-based fusion MVP candidates MaxNumSubblockMergeCand is derived as follows:
[0260] MaxNumSubblockMergeCand = 5 – pic_five_minus_max_num_subblock_merge_cand (7-112)
[0261] The value of MaxNumSubblockMergeCand should be in the range of 0 to 5 (inclusive).
[0262] pic_fpel_mmvd_enabled_flag equal to 1 indicates that the blending mode with motion vector difference uses integer sample precision in the slices associated with the picture header. pic_fpel_mmvd_enabled_flag equal to 0 indicates that the blending mode with motion vector difference can use fractional sample precision in the slices associated with the picture header. When pic_fpel_mmvd_enabled_flag is not present, its value is inferred to be equal to 0.
[0263] pic_disable_bdof_dmvr_flag equal to 1 indicates that bidirectional optical flow inter prediction and inter bidirectional prediction based on decoder motion vector correction are not enabled in the slices associated with the picture header. pic_disable_bdof_dmvr_flag equal to 0 indicates that bidirectional optical flow inter prediction or inter bidirectional prediction based on decoder motion vector correction may or may not be enabled in the slices associated with the picture header. When pic_disable_bdof_dmvr_flag is not present, its value is inferred to be equal to 0.
[0264] pic_max_num_merge_cand_minus_max_num_triangle_cand represents MaxNumMergeCand minus the maximum number of triangle merge mode candidates supported in the slice associated with the picture header.
[0265] When pic_max_num_merge_cand_minus_max_num_triangle_cand is not present, sps_triangle_enabled_flag is equal to 1, and MaxNumMergeCand is greater than or equal to 2, pic_max_num_merge_cand_minus_max_num_triangle_cand is inferred to be equal to pps_max_num_merge_cand_minus_max_num_triangle_cand_plus1–1.
[0266] The maximum number of triangle fusion mode candidates MaxNumTriangleMergeCand is derived as follows:
[0267] MaxNumTriangleMergeCand=
[0268] MaxNumMergeCand–
[0269] pic_max_num_merge_cand_minus_max_num_triangle_cand(7-113)
[0270] When pic_max_num_merge_cand_minus_max_num_triangle_cand is present, the value of MaxNumTriangleMergeCand shall be in the range of 2 to MaxNumMergeCand, inclusive.
[0271] When pic_max_num_merge_cand_minus_max_num_triangle_cand does not exist and (sps_triangle_enabled_flag is equal to 0 or MaxNumMergeCand is less than 2), MaxNumTriangleMergeCand is set equal to 0.
[0272] When MaxNumTriangleMergeCand is equal to 0, the strip associated with the picture header may not use triangle merging mode.
[0273] pic_six_minus_max_num_ibc_merge_cand represents 6 minus the maximum number of IBC merge block vector prediction (BVP) candidates supported in the slice associated with the picture header. The maximum number of IBC merge BVP candidates MaxNumIbcMergeCand is derived as follows:
[0274] MaxNumIbcMergeCand = 6 – pic_six_minus_max_num_ibc_merge_cand (7-114)
[0275] The value of MaxNumIbcMergeCand should be in the range of 1 to 6 (inclusive).
[0276] It should be noted that the ph_all_intra_flag flag can be indicated at any position before the first position where it controls the inter-frame prediction related syntax element (i.e., pic_log2_diff_min_qt_min_cb_inter_slice). It should be noted that at one or more positions, the ph_all_intra_flag can be deleted (i.e., only a subset of the syntax elements of the embodiment of the present invention is controlled). In another example, the use of this flag is as follows.
[0277]
[0278]
[0279] Specifically, the following coding device implementation methods and embodiments are provided. The coding device may be Figure 1A The video encoder 20, or Figure 2 Encoder 20.
[0280] According to embodiment 1200 (see Fig.12 ), in step 1201, the device determines whether the current image is an I image.
[0281] Since an I picture only contains intra-frame prediction blocks, it is not necessary to indicate the syntax elements designed for inter-frame prediction in the picture header of the code stream. Therefore, when the current picture is an I picture, the syntax elements designed for inter-frame prediction are not indicated in the picture header. In step 1203, the device sends the code stream to a decoding device, wherein the picture header of the code stream includes a flag for indicating whether the current picture is an I picture. In this case, the flag indicates that the current picture is an I picture. The syntax elements designed for inter-frame prediction are not indicated in the picture header. When the current picture is an I picture, the syntax elements designed for inter-frame prediction are inferred to be default values.
[0282] When the current image is not an I image, that is, when the current image is a P image or a B image, in step 1205, the device obtains syntax elements designed for inter-frame prediction. As described above, the syntax elements designed for inter prediction include one or more of the following elements: pic_log2_diff_min_qt_min_cb_inter_slice, pic_max_mtt_hierarchy_depth_inter_slice, pic_log2_diff_max_bt_min_qt_inter_slice, pic_log2_diff_max_tt_min_qt_inter_slice, pic_cu_qp_delta_subdiv_inter_slice, pic_cu_chroma_qp_offset_subdiv_inter_slice, pic_temporal_mvp_enabled_flag, mvd_l1_zero_flag, pic_fpel_mmvd_enabled_flag, or pic_disable_bdof_dmvr_flag.
[0283] In step 1207, the device sends the code stream to the decoding device. The picture header of the code stream includes not only a flag for indicating whether the current picture is an I picture, but also a syntax element designed for inter-frame prediction. In this case, the flag indicates that the current picture is not an I picture.
[0284] For example, the flag is named ph_all_intra_flag. The ph_all_intra_flag flag can be indicated at any position before the first position of the syntax element designed for inter prediction. The use of this flag is as described above.
[0285] The following decoding device implementation methods and embodiments are provided. The decoding device may be Figure 1A The video decoder 30, or Figure 3 Decoder 30. According to embodiment 1300 (see Fig.13 ), the device receives a code stream and parses the code stream in step 1301 to obtain a flag from an image header of the code stream, wherein the flag indicates whether the current image is an I image.
[0286] For example, the flag is named ph_all_intra_flag. The ph_all_intra_flag flag can be indicated at any position before the first position of the syntax element designed for inter prediction. The use of this flag is as described above.
[0287] In step 1303, the device determines whether the current picture is an I picture according to the flag.
[0288] When the current picture is an I picture, the syntax elements designed for inter-frame prediction are not indicated in the picture header, and in step 1305, the syntax elements designed for inter-frame prediction are inferred as default values.
[0289] When the current image is not an I image, that is, when the current image is a P image or a B image, in step 1307, the device obtains syntax elements designed for inter-frame prediction from the image header of the code stream. As described above, the syntax elements designed for inter prediction include one or more of the following elements: pic_log2_diff_min_qt_min_cb_inter_slice, pic_max_mtt_hierarchy_depth_inter_slice, pic_log2_diff_max_bt_min_qt_inter_slice, pic_log2_diff_max_tt_min_qt_inter_slice, pic_cu_qp_delta_subdiv_inter_slice, pic_cu_chroma_qp_offset_subdiv_inter_slice, pic_temporal_mvp_enabled_flag, mvd_l1_zero_flag, pic_fpel_mmvd_enabled_flag, or pic_disable_bdof_dmvr_flag.
[0290] Fig.14 An embodiment of a device 1400 is shown. The device 1400 may be Figure 1A The video encoder 20, or Figure 2 The encoder 20. The device 1400 can be used to implement the embodiment 1200 and other embodiments described above.
[0291] The device 1400 of the present invention comprises a determining unit 1401, an acquiring unit 1402 and an indicating unit 1403. The determining unit 1401 is used to determine whether the current picture is an I picture.
[0292] The acquisition unit 1402 is used to acquire syntax elements designed for inter-frame prediction when the current picture is not an I picture (that is, a P picture or a B picture). As described above, the syntax elements designed for inter prediction include one or more of the following elements: pic_log2_diff_min_qt_min_cb_inter_slice, pic_max_mtt_hierarchy_depth_inter_slice, pic_log2_diff_max_bt_min_qt_inter_slice, pic_log2_diff_max_tt_min_qt_inter_slice, pic_cu_qp_delta_subdiv_inter_slice, pic_cu_chroma_qp_offset_subdiv_inter_slice, pic_temporal_mvp_enabled_flag, mvd_l1_zero_flag, pic_fpel_mmvd_enabled_flag, or pic_disable_bdof_dmvr_flag.
[0293] When the current picture is an I picture, syntax elements designed for inter prediction are inferred as default values.
[0294] The indicating unit 1403 is used to send a code stream to a decoding device, wherein the picture header of the code stream includes a flag for indicating whether the current picture is an I picture.
[0295] The picture header of the code stream also includes syntax elements designed for inter-frame prediction when the current picture is not an I picture. Since an I picture only contains intra-frame prediction blocks, it is not necessary to indicate syntax elements designed for inter-frame prediction in the picture header of the code stream.
[0296] For example, the flag is named ph_all_intra_flag. The ph_all_intra_flag flag can be indicated at any position before the first position of the syntax element designed for inter prediction. The use of this flag is as described above.
[0297] Fig.15 An embodiment of a device 1500 is shown. The device 1500 may be Figure 1A The video decoder 30, or Figure 3 The decoder 30. The device 1500 can be used to implement the embodiment 1300 and other embodiments described above.
[0298] The device 1500 includes an acquisition unit 1501 and a determination unit 1502. The acquisition unit 1501 is used to parse a code stream and acquire a flag from a picture header of the code stream, wherein the flag indicates whether the current picture is an I picture. For example, the flag is named ph_all_intra_flag.
[0299] The determination unit 1502 is used to determine whether the current picture is an I picture according to the flag.
[0300] The acquisition unit 1501 is further configured to acquire the syntax elements designed for inter-frame prediction from the picture header when the flag indicates that the current picture is not an I picture (i.e., a P picture or a B picture). When the current picture is an I picture, the syntax elements designed for inter-frame prediction are not indicated in the picture header, and the syntax elements designed for inter-frame prediction are inferred as default values.
[0301] In addition, the following examples are provided herein.
[0302] Embodiment 1. A decoding method implemented by a decoding device, comprising:
[0303] Parse the code stream;
[0304] A flag is obtained from a picture header of the code stream, wherein the flag indicates whether the current picture is an I picture.
[0305] Embodiment 2. The method according to embodiment 1, wherein, when the current image is an I image, the syntax elements designed for inter-frame prediction are inferred as default values.
[0306] Embodiment 3. The method according to embodiment 1 or 2, wherein the flag is carried in the picture header PBSP syntax.
[0307] Embodiment 4. The method according to any one of embodiments 1 to 3, wherein the flag is named ph_all_intra_flag.
[0308] Embodiment 5. The method according to embodiment 4, wherein the use of the mark is as follows:
[0309]
[0310]
[0311] Embodiment 6. The method according to embodiment 4 or 5, wherein the use of the mark is as follows:
[0312]
[0313] Embodiment 7. The method according to any one of embodiments 4 to 6, wherein the use of the mark is as follows:
[0314]
[0315] Embodiment 8. The method according to any one of embodiments 4 to 7, wherein the use of the mark is as follows:
[0316]
[0317]
[0318] Embodiment 9. A method according to any one of embodiments 1 to 8, wherein an I picture contains only intra-frame prediction blocks, and a P picture or a B picture contains inter-frame prediction blocks.
[0319] Embodiment 10. A decoding method implemented by an encoding device, comprising:
[0320] Indicating a flag to a picture header of a code stream, wherein the flag indicates whether the current picture is an I picture;
[0321] The code stream is sent.
[0322] Embodiment 11. The method according to embodiment 10, wherein, when the current image is an I image, all syntax elements designed for inter-frame prediction are not indicated in the image header.
[0323] Embodiment 12. The method according to embodiment 10 or 11, wherein, when the current image is an I image, the syntax elements designed for inter-frame prediction are inferred as default values.
[0324] Embodiment 13. The method according to any one of embodiments 10 to 12, wherein the flag is indicated in a picture header PBSP syntax.
[0325] Embodiment 14. The method according to any one of embodiments 10 to 13, wherein the flag is named ph_all_intra_flag.
[0326] Embodiment 15. The method according to embodiment 14, wherein the ph_all_intra_flag flag can be indicated at any position before the first position of the syntax element related to controlling inter-frame prediction.
[0327] Embodiment 16. The method according to embodiment 14 or 15, wherein the use of the mark is as follows:
[0328]
[0329]
[0330] Embodiment 17. The method according to any one of embodiments 14 to 16, wherein the use of the mark is as follows:
[0331]
[0332] Embodiment 18. The method according to any one of embodiments 14 to 17, wherein the use of the mark is as follows:
[0333]
[0334] Embodiment 19. The method according to any one of embodiments 14 to 18, wherein the use of the mark is as follows:
[0335]
[0336]
[0337] As described above, by indicating whether the current image is an I image in the image header of the code stream, when the current image is an I image, the syntax element designed for inter-frame prediction is not indicated in the image header. Therefore, the embodiment can simplify the image header indicating all intra-frame images (i.e., I images). Accordingly, the indication overhead is reduced.
[0338] The term "obtaining" may refer to receiving (e.g., explicitly receiving corresponding parameters from another entity / device or module within the same device, e.g., for a decoder, receiving by parsing a bitstream) and / or deriving (e.g., may also be referred to as implicitly receiving, e.g., for a decoder, by parsing other information / parameters from a bitstream and deriving corresponding information or parameters from such other information / parameters).
[0339] The following explains the application of the encoding method and the decoding method shown in the above embodiments and the system using these applications.
[0340] Fig.16 31 is a block diagram of a content supply system 3100 for implementing a content distribution service. The content supply system 3100 includes a capture device 3102, a terminal device 3106, and optionally a display 3126. The capture device 3102 communicates with the terminal device 3106 via a communication link 3104. The communication link may include the communication channel 13 described above. The communication link 3104 includes, but is not limited to, Wi-Fi, Ethernet, wired, wireless (3G / 4G / 5G), USB, or any combination thereof.
[0341] Capture device 3102 is used to generate data, and data can be encoded by the coding method shown in the above embodiment. Alternatively, capture device 3102 can distribute data to a streaming media server (not shown in the figure), which encodes data and sends encoded data to terminal device 3106. Capture device 3102 includes but is not limited to a camera, a smart phone or a tablet computer, a computer or a notebook computer, a video conferencing system, a PDA, a vehicle-mounted device or any combination thereof. For example, capture device 3102 may include the above-mentioned source device 12. When data includes video, the video encoder 20 included in capture device 3102 can actually perform video encoding processing. When data includes audio (that is, sound), the audio encoder included in capture device 3102 can actually perform audio encoding processing. For some actual scenes, capture device 3102 distributes encoded video data and encoded audio data by multiplexing encoded video data and encoded audio data together. For other actual scenes, for example, in a video conferencing system, encoded audio data and encoded video data are not multiplexed. The capture device 3102 distributes the encoded audio data and the encoded video data to the terminal device 3106, respectively.
[0342] In the content supply system 3100, the terminal device 310 receives and regenerates the encoded data. The terminal device 3106 may be a device with data receiving and recovery capabilities, such as a smart phone or tablet computer 3108, a computer or laptop computer 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a television 3114, a set top box (STB) 3116, a video conferencing system 3118, a video surveillance system 3120, a personal digital assistant (PDA) 3122, a vehicle-mounted device 3124, or a combination of any of the above devices capable of decoding the above-mentioned encoded data. For example, the terminal device 3106 may include the destination device 14 described above. When the encoded data includes video, the video decoder 30 included in the terminal device prioritizes video decoding. When the encoded data includes audio, the audio decoder included in the terminal device prioritizes audio decoding processing.
[0343] For a terminal device with a display, such as a smartphone or tablet 3108, a computer or laptop 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a television 3114, a personal digital assistant (PDA) 3122, or a vehicle-mounted device 3124, the terminal device can feed the decoded data to its display. For a terminal device without a display, such as an STB 3116, a video conferencing system 3118, or a video surveillance system 3120, an external display 3126 is connected therein to receive and display the decoded data.
[0344] When each device in the system performs encoding or decoding, the image encoding device or the image decoding device as shown in the above-mentioned embodiments can be used.
[0345] Fig.17 31 is a schematic diagram of an example structure of a terminal device 3106. After the terminal device 3106 receives the stream from the capture device 3102, the protocol processing unit 3202 analyzes the transmission protocol of the stream. The protocol includes but is not limited to real-time streaming protocol (RTSP), hypertext transfer protocol (HTTP), HTTP live streaming protocol (HLS), MPEG-DASH, real-time transport protocol (RTP), real-time messaging protocol (RTMP), or any combination thereof.
[0346] After the protocol processing unit 3202 processes the stream, a stream file is generated. The file is output to the demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into encoded audio data and encoded video data. As mentioned above, in other actual scenes, for example, in a video conferencing system, the encoded audio data and the encoded video data are not multiplexed. In this case, the encoded data is not sent to the video decoder 3206 and the audio decoder 3208 by the demultiplexing unit 3204.
[0347] Through the demultiplexing process, a video elementary stream (ES), an audio ES, and optional subtitles are generated. The video decoder 3206, including the video decoder 30 explained in the above embodiment, decodes the video ES to generate a video frame by the decoding method shown in the above embodiment, and sends the data to the synchronization unit 3212. The audio decoder 3208 decodes the audio ES to generate an audio frame, and sends the data to the synchronization unit 3212. Alternatively, the video frame can be stored in a buffer ( Fig.17 Similarly, the audio frames may be stored in a buffer (not shown) before being fed to the synchronization unit 3212. Fig.17 (not shown).
[0348] The synchronization unit 3212 synchronizes the video frames and the audio frames and provides the video / audio to the video / audio display 3214. For example, the synchronization unit 3212 synchronizes the presentation of the video information and the audio information. The information may be coded in the syntax using timestamps related to the presentation of the coded audio and visual data and timestamps related to the transmission of the data stream itself.
[0349] If subtitles are included in the stream, the subtitle decoder 3210 decodes the subtitles, synchronizes the subtitles with the video frames and the audio frames, and provides the video / audio / subtitles to the video / audio / subtitle display 3216.
[0350] The present invention is not limited to the above-mentioned system, and the image encoding device or the image decoding device in the above-mentioned embodiments may be included in other systems such as automobile systems.
[0351] Mathematical operators
[0352] The mathematical operators used in this application are similar to those used in the C programming language. However, the results of integer division and arithmetic shift operations are more precisely defined, and other operations such as exponentiation and real-valued division are defined. Numbering and counting conventions generally start at 0, for example, "first" is equivalent to the 0th, "second" is equivalent to the 1st, and so on.
[0353] Arithmetic operators
[0354] Arithmetic operators are defined as follows:
[0355] + Addition
[0356] – Subtraction (as a two-argument operator) or negation (as a unary prefix operator)
[0357] * Multiplication operations, including matrix multiplication
[0358] xy Exponentiation. Expresses x raised to the power of y. In context, this may be used as a superscript rather than as a power.
[0359] / truncates zero to 1. / truncates the result to 1. For example, 7 / 4 and –7 / –4 are truncated to 1, and –7 / 4 and 7 / –4 are truncated to
[0360] ÷ is used to represent division in mathematical equations without truncation or rounding.
[0361] Used to represent division in mathematical equations without truncation or rounding.
[0362] It is used to calculate the sum of f(i), where i takes all integer values between x and y (inclusive).
[0363] x%y modulus operation. The remainder when x is divided by y, where both x and y must be integers and x>=0 and y>0.
[0364] Logical operators
[0365] Logical operators are defined as follows:
[0366] x&&y Boolean logic "AND" operation of x and y
[0367] x||y Boolean logical "OR" operation of x and y
[0368] ! Boolean logic "not" operation
[0369] x? y:z If x is true (TRUE) or not equal to 0, it returns the value of y, otherwise it returns the value of z.
[0370] Relational operators
[0371] The relational operators are defined as follows:
[0372] > Greater than
[0373] >= greater than or equal to
[0374] < less than
[0375] <= less than or equal to
[0376] == is equal to
[0377] ! = Not equal to
[0378] When a relational operator is applied to a syntax element or variable that has been assigned the value "na" (not applicable), the value "na" is considered a different value for the syntax element or variable. The value "na" is considered not equal to any other value.
[0379] Bitwise operator
[0380] The bitwise operators are defined as follows:
[0381] & Bitwise AND operation. When operating on integer arguments, the two's complement representation of the integer value is operated on. When operating on binary arguments, if it contains fewer bits than the other argument, the shorter argument is extended by adding more significant bits equal to 0.
[0382] | Bitwise OR operation. When operating on integer arguments, the two's complement representation of the integer value is operated on. When operating on binary arguments, if it contains fewer bits than the other argument, the shorter argument is extended by adding more significant bits equal to 0.
[0383] ^ Bitwise XOR operation. When operating on integer arguments, the two's complement representation of the integer value is operated on. When operating on binary arguments, if it contains fewer bits than the other argument, the shorter argument is extended by adding more significant bits equal to 0.
[0384] x >> y The two's complement integer representation of x is arithmetically shifted right by y binary digits. This function is only defined when y is a non-negative integer value. The value of the bit shifted into the most significant bit (MSB) due to the right shift is equal to the MSB of x before the shift operation. x << y The two's complement integer representation of x is arithmetically shifted left by y binary digits. This function is only defined when y is a non-negative integer value. The value of the bit shifted into the least significant bit (LSB) due to the left shift is equal to 0.
[0385] Assignment operator
[0386] The arithmetic operators are defined as follows:
[0387] = Assignment operator
[0388] ++ Increment, i.e., x++ is equivalent to x = x + 1; when used in an array index, it is equal to the value of the variable before the increment operation.
[0389] –– Decrement, i.e., x–– is equal to x = x - 1; when used in an array index, it is equal to the value of the variable before the decrement operation.
[0390] += Increase by a specified amount, i.e., x += 3 is equivalent to x = x + 3, and x += (-3) is equivalent to x = x + (-3).
[0391] –= Decrease by a specified amount, i.e., x -= 3 is equivalent to x = x - 3, and x -= (-3) is equivalent to x = x - (-3).
[0392] Range Symbols
[0393] The following symbols are used to indicate ranges of values:
[0394] x=y..zx takes integer values from y to z (including y and z), where x, y and z are integers and z is greater than y.
[0395] Mathematical functions
[0396] The mathematical function is defined as follows:
[0397]
[0398] Asin(x) trigonometric inverse sine function, operates on parameter x, x is between –1.0 and 1.0 (inclusive), and the output value is between –π÷2 and
[0399] The range is π÷2 (inclusive), and the unit is radians.
[0400] Atan(x) is the trigonometric inverse tangent function that operates on the parameter x and produces an output value in the range of –π÷2 to π÷2 (inclusive) in radians.
[0401]
[0402] Ceil(x) is the smallest integer greater than or equal to x.
[0403] Clip1 Y (x)=Clip3(0,(1< <BitDepth Y )–1,x)
[0404] Clip1 C (x)=Clip3(0,(1< <BitDepth C )–1,x)
[0405]
[0406] Cos(x) is the trigonometric cosine function, which operates on the parameter x in radians.
[0407] Floor(x) is the largest integer less than or equal to x.
[0408]
[0409] Ln(x) is the natural logarithm of x (logarithm with base e, where e is the base constant of natural logarithms 2.718 281828...).
[0410] Log2(x) is the base 2 logarithm of x.
[0411] Log10(x) is the base 10 logarithm of x.
[0412]
[0413]
[0414] Round(x)=Sign(x)*Floor(Abs(x)+0.5)
[0415]
[0416] Sin(x) trigonometric sine function, operates on parameter x, in radians.
[0417]
[0418] Swap(x,y)=(y,x)
[0419] Tan(x) is the trigonometric tangent function, which operates on the parameter x in radians.
[0420] Operation priority order
[0421] When parentheses are not used to explicitly indicate precedence in an expression, the following rules apply:
[0422] – Operations with higher priority are evaluated before any operations with lower priority.
[0423] – Operations of the same priority are evaluated from left to right.
[0424] The following table describes the priority of operations from highest to lowest. The higher the position in the table, the higher the priority.
[0425] For operators that are also used in the C programming language, the order of precedence used in this specification is the same as the order of precedence used in the C programming language.
[0426] Table: Operation priority is sorted from highest (top of table) to lowest (bottom of table)
[0427]
[0428] Text description of the logical operation
[0429] In the text, statements for logical operations are described in mathematical form as follows:
[0430] if(condition 0)
[0431] statement 0
[0432] else if(condition 1)
[0433] statement 1 ...
[0435] else / *Instructions for remaining conditions* /
[0436] statement
[0437] It can be described in the following way:
[0438] ...as follows / ...as follows:
[0439] – If condition 0 then statement 0
[0440] – Else If Condition 1 Then Statement 1
[0441] …
[0442] –
[0443] – Otherwise (informative explanation of the remaining conditions), then statement n
[0444] Each "if ... else, if ... else, ..." statement in the text starts with "... as follows" or "... the following applies" followed by "if ...". The last condition of "if ... else, if ... else, ..." is always "otherwise, ...". Intermediate "if ... else, if ... else, ..." statements can be identified by matching "... as follows" or "... the following applies" with the ending "otherwise, ...".
[0445] In the text, statements for logical operations are described in mathematical form as follows:
[0446] if(condition 0a&&condition 0b)
[0447] statement 0
[0448] else if(condition 1a||condition 1b)
[0449] statement 1 ...
[0451] else
[0452] statement
[0453] It can be described in the following way:
[0454] ...as follows / ...as follows:
[0455] – Statement 0 if all of the following conditions are met:
[0456] –Condition 0a
[0457] – Condition 0b
[0458] – Otherwise, if one or more of the following conditions are met, then statement 1:
[0459] –Condition 1a
[0460] – Condition 1b
[0461] …
[0462] –
[0463] – Otherwise, statement n
[0464] In the text, statements for logical operations are described in mathematical form as follows:
[0465] if(condition 0)
[0466] statement 0
[0467] if(condition 1)
[0468] statement 1
[0469] It can be described in the following way:
[0470] When condition 0, statement 0
[0471] When condition 1, statement 1
[0472] Although the embodiments of the present invention are mainly described in terms of video decoding, it should be noted that the embodiments of the decoding system 10, the encoder 20 and the decoder 30 (respectively, the system 10) and other embodiments described herein can also be used for still image processing or decoding, that is, processing or decoding a single image in video decoding that is independent of any previous or consecutive images. Typically, if the image processing decoding is limited to a single image 17, only the inter-frame prediction unit 244 (encoder) and 344 (decoder) are not available. All other functions (also referred to as tools or techniques) of the video encoder 20 and the video decoder 30 can also be used for still image processing, such as residual calculation 204 / 304, transformation 206, quantization 208, inverse quantization 210 / 310, (inverse) transformation 212 / 312, segmentation 262 / 362, intra-frame prediction 254 / 354 and / or loop filtering 220 / 320, entropy coding 270 and entropy decoding 304.
[0473] Embodiments of encoders 20, decoders 30, etc., and the functions described herein related to encoders 20, decoders 30, etc. may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the various functions may be stored as one or more instructions or codes in a computer-readable medium or transmitted via a communication medium, and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media corresponding to tangible media (e.g., data storage media), or communication media including any medium that facilitates the transfer of computer programs from one place to another (e.g., according to a communication protocol). In this manner, computer-readable media may generally correspond to (1) non-transitory tangible computer-readable storage media, or (2) communication media such as signals or carrier waves. Data storage media may be any available media accessed by one or more computers or one or more processors to retrieve instructions, codes, and / or data structures for implementing the techniques described in the present invention. A computer program product may include a computer-readable medium.
[0474] As an example and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage devices, flash memory or any other medium that can be used to store the required program code in the form of instructions or data structures and can be accessed by a computer. In addition, any connection can be appropriately referred to as a computer-readable medium. For example, if a coaxial cable, optical fiber cable, twisted pair, digital subscriber line (DSL) or wireless technologies such as infrared, radio and microwave are used to transmit instructions from a website, server or other remote source, then the coaxial cable, optical fiber cable, twisted pair, DSL or wireless technologies such as infrared, radio and microwave are included in the definition of the medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carriers, signals or other transient media, but rather involve non-transient tangible storage media. Disks and optical disks used herein include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks and Blu-ray discs, where disks usually reproduce data magnetically, while optical discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer-readable media.
[0475] Instructions may be executed by one or more processors such as one or more digital signal processors (DSPs), general-purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Accordingly, the term "processor" as used herein may refer to any of the above structures or any other structure suitable for implementing the techniques described herein. In addition, in some aspects, the various functions described herein may be provided in dedicated hardware and / or software modules for encoding and decoding, or incorporated in a combined codec. Moreover, these techniques may be fully implemented in one or more circuits or logic elements.
[0476] The technology of the present invention can be implemented in a variety of devices or apparatuses, including wireless mobile phones, integrated circuits (ICs) or a group of ICs (e.g., chipsets). The present invention describes various components, modules, or units to emphasize the functional aspects of the devices used to perform the disclosed technology, but it is not necessarily required to be implemented by different hardware units. In fact, as described above, the various units can be combined in a codec hardware unit in combination with appropriate software and / or firmware, or provided by a collection of interoperable hardware units (including one or more processors as described above).
Claims
1. A coding method, characterized in that: include: Encoding a first flag into a picture header of a code stream, wherein the first flag is used to indicate that the current picture includes only an I-type slice or the first flag is used to indicate that the current picture includes one or more B-type slices or P-type slices; When the first flag indicates that the current picture includes one or more B-type slices or P-type slices, a syntax element designed for inter-frame prediction is encoded into the picture header.
2. The method according to claim 1, characterized in that When the first flag indicates that the current image includes one or more B-type slices or P-type slices, and when the second flag indicates that a partition constraint parameter exists in the image header, the syntax element designed for inter-frame prediction is encoded into the image header, and the second flag is partition_constraints_override_flag.
3. The method according to claim 1 or 2, characterized in that: When the first flag is used to indicate that the current picture includes only I-type slices, the syntax elements designed for inter-frame prediction are not in the picture header, and the syntax elements designed for inter-frame prediction are inferred to be equal to the values of corresponding syntax elements in the sequence parameter set SPS.
4. The method according to any one of claims 1 to 3, characterized in that The syntax elements designed for inter-frame prediction include pic_log2_diff_min_qt_min_cb_inter_slice, Wherein, pic_log2_diff_min_qt_min_cb_inter_slice represents the difference between the logarithm of the minimum size of a luma leaf block expressed in luma samples and the logarithm of the minimum luma coding block size of luma coding units (CUs) expressed in luma samples in a slice of slice type P or B associated with the picture header, wherein the luma leaf block is obtained by quadtree partitioning a coding tree unit (CTU); or When pic_log2_diff_min_qt_min_cb_inter_slice does not exist in the codestream, the value of pic_log2_diff_min_qt_min_cb_luma is inferred to be equal to sps_log2_diff_min_qt_min_cb_inter_slice.
5. The method according to any one of claims 1 to 4, characterized in that The syntax elements designed for inter-frame prediction also include pic_max_mtt_hierarchy_depth_inter_slice, Wherein, pic_max_mtt_hierarchy_depth_inter_slice represents the maximum hierarchical depth of a coding unit obtained by performing multi-type tree partitioning on a quad leaf in a slice type of the current image that is a B type or a P type slice; or When pic_max_mtt_hierarchy_depth_inter_slice does not exist in the codestream, the value of pic_max_mtt_hierarchy_depth_inter_slice is inferred to be equal to sps_max_mtt_hierarchy_depth_inter_slice.
6. The method according to claim 5, characterized in that When pic_max_mtt_hierarchy_depth_inter_slice is not equal to 0, the syntax elements designed for inter prediction also include pic_log2_diff_max_bt_min_qt_inter_slice, Wherein, pic_log2_diff_max_bt_min_qt_inter_slice represents the difference between the logarithm of the maximum size (width or height) of the luma coding block that can be divided by binary tree partitioning represented by luma samples with a base of 2 and the logarithm of the minimum size (width or height) of the luma leaf block represented by luma samples with a base of 2 in the slice type of the current image of type B or type P, wherein the luma leaf block is obtained by quadtree partitioning the CTU; or When pic_log2_diff_max_bt_min_qt_inter_slice does not exist in the codestream, the value of pic_log2_diff_max_bt_min_qt_inter_slice is inferred to be equal to sps_log2_diff_max_bt_min_qt_inter_slice.
7. The method according to claim 5 or 6, characterized in that: When pic_max_mtt_hierarchy_depth_inter_slice is not equal to 0, the syntax elements designed for inter-frame prediction also include pic_log2_diff_max_tt_min_qt_inter_slice, Wherein, pic_log2_diff_max_tt_min_qt_inter_slice represents the difference between the logarithm of the maximum size (width or height) of the luminance coding block that can be divided by ternary tree partitioning represented by luminance samples with a base of 2 and the logarithm of the minimum size (width or height) of the luminance leaf block represented by luminance samples with a base of 2 in the slice type of the current image of B type or P type, wherein the luminance leaf block is obtained by quadtree partitioning of the CTU; or When pic_log2_diff_max_tt_min_qt_inter_slice does not exist in the codestream, the value of pic_log2_diff_max_tt_min_qt_inter_slice is inferred to be equal to sps_log2_diff_max_tt_min_qt_inter_slice.
8. The method according to any one of claims 1 to 7, characterized in that The syntax elements designed for inter-frame prediction also include pic_cu_qp_delta_subdiv_inter_slice, where pic_cu_qp_delta_subdiv_inter_slice represents the maximum cbSubdiv value for coding units that pass cu_qp_delta_abs and cu_qp_delta_sign_flag in inter slices; or When pic_cu_qp_delta_subdiv_inter_slice does not exist in the code stream, the value of pic_cu_qp_delta_subdiv_inter_slice is inferred to be equal to 0.
9. The method according to any one of claims 1 to 8, characterized in that The syntax elements designed for inter-frame prediction also include pic_cu_chroma_qp_offset_subdiv_inter_slice, where pic_cu_chroma_qp_offset_subdiv_inter_slice represents the maximum cbSubdiv value of the coding unit that passes cu_chroma_qp_offset_flag in the inter slice; or When pic_cu_chroma_qp_offset_subdiv_inter_slice does not exist in the code stream, the value of pic_cu_chroma_qp_offset_subdiv_inter_slice is inferred to be equal to 0.
10. The method according to any one of claims 1 to 9, characterized in that The syntax elements designed for inter-frame prediction also include pic_temporal_mvp_enabled_flag, Among them, pic_temporal_mvp_enabled_flag indicates whether the temporal motion vector prediction value can be used for inter-frame prediction of the slice associated with the picture header; if pic_temporal_mvp_enabled_flag is equal to 1, it means that the temporal motion vector prediction value can be used for inter-frame prediction of the slice associated with the picture header; if pic_temporal_mvp_enabled_flag is equal to 0, it means that the temporal motion vector prediction value cannot be used for inter-frame prediction of the slice associated with the picture header.
11. A computer program product, characterized in that The method comprises a program code for executing the method according to any one of claims 1 to 10.
12. An encoder, characterized in that: include: one or more processors; A non-transitory computer-readable storage medium is coupled to the processor and stores a program executed by the processor, wherein when the processor executes the program, the program causes the encoder to perform the method according to any one of claims 1 to 10.
13. A coding device, characterized in that: include: an encoding unit, configured to encode a first flag into a picture header of a code stream, wherein the first flag is used to indicate that the current picture includes only an I-type slice or the first flag is used to indicate that the current picture includes one or more B-type slices or P-type slices; The encoding unit is further configured to encode syntax elements designed for inter-frame prediction into the picture header when the first flag indicates that the current picture includes one or more B-type slices or P-type slices.
14. The device according to claim 13, characterized in that When the first flag indicates that the current image includes one or more B-type slices or P-type slices, and when the second flag indicates that a partition constraint parameter exists in the image header, the syntax element designed for inter-frame prediction is encoded into the image header, and the second flag is partition_constraints_override_flag.
15. The device according to claim 13 or 14, characterized in that When the first flag is used to indicate that the current picture includes only I-type slices, the syntax elements designed for inter-frame prediction are not in the picture header, and the syntax elements designed for inter-frame prediction are inferred to be equal to the values of corresponding syntax elements in the sequence parameter set SPS.
16. The device according to any one of claims 13 to 15, characterized in that The syntax elements designed for inter-frame prediction include pic_log2_diff_min_qt_min_cb_inter_slice, Wherein, pic_log2_diff_min_qt_min_cb_inter_slice represents the difference between the logarithm of the minimum size of a luma leaf block expressed in luma samples and the logarithm of the minimum luma coding block size of luma coding units (CUs) expressed in luma samples in a slice of slice type P or B associated with the picture header, wherein the luma leaf block is obtained by quadtree partitioning a coding tree unit (CTU); or When pic_log2_diff_min_qt_min_cb_inter_slice does not exist in the codestream, the value of pic_log2_diff_min_qt_min_cb_luma is inferred to be equal to sps_log2_diff_min_qt_min_cb_inter_slice.
17. The device according to any one of claims 13 to 16, characterized in that The syntax elements designed for inter-frame prediction also include pic_max_mtt_hierarchy_depth_inter_slice, Wherein, pic_max_mtt_hierarchy_depth_inter_slice represents the maximum hierarchical depth of a coding unit obtained by performing multi-type tree partitioning on a quad leaf in a slice type of the current image that is a B type or a P type slice; or When pic_max_mtt_hierarchy_depth_inter_slice does not exist in the codestream, the value of pic_max_mtt_hierarchy_depth_inter_slice is inferred to be equal to sps_max_mtt_hierarchy_depth_inter_slice.
18. The device according to claim 17, characterized in that When pic_max_mtt_hierarchy_depth_inter_slice is not equal to 0, the syntax elements designed for inter prediction also include pic_log2_diff_max_bt_min_qt_inter_slice, Wherein, pic_log2_diff_max_bt_min_qt_inter_slice represents the difference between the logarithm of the maximum size (width or height) of the luma coding block that can be divided by binary tree partitioning represented by luma samples with a base of 2 and the logarithm of the minimum size (width or height) of the luma leaf block represented by luma samples with a base of 2 in the slice type of the current image of type B or type P, wherein the luma leaf block is obtained by quadtree partitioning the CTU; or When pic_log2_diff_max_bt_min_qt_inter_slice does not exist in the codestream, the value of pic_log2_diff_max_bt_min_qt_inter_slice is inferred to be equal to sps_log2_diff_max_bt_min_qt_inter_slice.
19. The device according to claim 17 or 18, characterized in that When pic_max_mtt_hierarchy_depth_inter_slice is not equal to 0, the syntax elements designed for inter-frame prediction also include pic_log2_diff_max_tt_min_qt_inter_slice, Wherein, pic_log2_diff_max_tt_min_qt_inter_slice represents the difference between the logarithm of the maximum size (width or height) of the luminance coding block that can be divided by ternary tree partitioning represented by luminance samples with a base of 2 and the logarithm of the minimum size (width or height) of the luminance leaf block represented by luminance samples with a base of 2 in the slice type of the current image of B type or P type, wherein the luminance leaf block is obtained by quadtree partitioning of the CTU; or When pic_log2_diff_max_tt_min_qt_inter_slice does not exist in the codestream, the value of pic_log2_diff_max_tt_min_qt_inter_slice is inferred to be equal to sps_log2_diff_max_tt_min_qt_inter_slice.
20. The device according to any one of claims 13 to 19, characterized in that The syntax elements designed for inter-frame prediction also include pic_cu_qp_delta_subdiv_inter_slice, where pic_cu_qp_delta_subdiv_inter_slice represents the maximum cbSubdiv value for coding units that pass cu_qp_delta_abs and cu_qp_delta_sign_flag in inter slices; or When pic_cu_qp_delta_subdiv_inter_slice does not exist in the code stream, the value of pic_cu_qp_delta_subdiv_inter_slice is inferred to be equal to 0.
21. The device according to any one of claims 13 to 20, characterized in that The syntax elements designed for inter-frame prediction also include pic_cu_chroma_qp_offset_subdiv_inter_slice, where pic_cu_chroma_qp_offset_subdiv_inter_slice represents the maximum cbSubdiv value of the coding unit that passes cu_chroma_qp_offset_flag in the inter slice; or When pic_cu_chroma_qp_offset_subdiv_inter_slice does not exist in the codestream, the value of pic_cu_chroma_qp_offset_subdiv_inter_slice is inferred to be equal to 0.
22. The device according to any one of claims 13 to 21, characterized in that The syntax elements designed for inter-frame prediction also include pic_temporal_mvp_enabled_flag, where pic_temporal_mvp_enabled_flag indicates whether the temporal motion vector prediction value can be used for the current image; if pic_temporal_mvp_enabled_flag is equal to 1, it indicates that the temporal motion vector prediction value can be used for inter-frame prediction of the slice associated with the picture header; if pic_temporal_mvp_enabled_flag is equal to 0, it indicates that the temporal motion vector prediction value cannot be used for inter-frame prediction of the slice associated with the picture header.
23. A readable storage medium, characterized in that: The readable storage medium includes a program code, and when the program code is executed on a computer or a processor, the computer or the processor executes the method according to any one of claims 1 to 10.
