Method, apparatus and computer program

Abstract

To provide a method and a program for improving coding efficiency and for chroma-coded block flag (CBF) signaling.SOLUTION: A coding method implemented by a decoding device includes steps of obtaining a current transform unit from a bitstream, obtaining a first flag specifying whether a first chroma transform block associated with the transform unit includes at least one transform coefficient level not equal to 0, obtaining a second flag specifying whether a second chroma transform block includes at least one transform coefficient level not equal to 0, obtaining a third flag specifying whether a transform tree structure is present, and using a first value of the first flag, a second value of the second flag, and a third value of the third flag to derive a fourth value of a fourth flag specifying whether a luma transform block includes at least one transform coefficient level not equal to 0.SELECTED DRAWING: Figure 7

Description

[Technical Field]

[0001] [CROSS-REFERENCE TO RELATED APPLICATIONS] This patent application claims priority to U.S. Provisional Patent Application No. US62 / 812,282, filed March 1, 2019, U.S. Provisional Patent Application No. US62 / 817,498, filed March 12, 2019, U.S. Provisional Patent Application No. US62 / 825,005, filed March 27, 2019, and International Patent Application No. PCT / EP2019 / 064224, filed May 31, 2019.

[0002] FIELD OF THE INVENTION

[0002] Embodiments of the present disclosure relate generally to the field of image processing, and more particularly to transform flag signaling. CBF flags are disclosed that can be presented in syntax elements of a transform tree or transform unit and signaled relative to each other and other available syntax elements. [Background technology]

[0003] Video coding (video encoding and decoding) is used in a wide range of digital video applications, such as broadcast digital TV, video transmission over the Internet and mobile networks, or real-time interactive applications such as video chat, video conferencing, DVD and Blu-ray discs, video content acquisition and editing systems, and camcorders in security applications.

[0004] The amount of video data required to render even a relatively short video can be substantial, which can result in difficulties when the data is to be streamed or otherwise communicated over communication networks with limited bandwidth capacity. Therefore, video data is typically compressed before being communicated over modern telecommunications networks. Video size can also be an issue when the video is stored on a storage device, as memory resources may be limited. Video compression devices often use software and / or hardware at the source to code the video data before transmission or storage, thereby reducing the amount of data needed to represent a digital video image. The compressed data is then received at the destination by a video decompression device, which decodes the video data. In light of limited network resources and the ever-increasing demand for high video quality, improved compression and decompression techniques are desired that improve compression ratios with little to no sacrifice in image quality. Summary of the Invention

[0005] Embodiments of the present disclosure provide apparatus and methods for encoding and decoding according to the independent claims.

[0006] These and other objects are achieved by the subject matter of the independent claims. Further implementation forms emerge from the dependent claims, the description and the figures.

[0007] The method according to the first aspect of the invention can be performed by an apparatus according to the third aspect of the invention. Further features and embodiments of the method according to the third aspect of the invention correspond to the features and embodiments of the apparatus according to the first aspect of the invention.

[0008] The method according to the fourth aspect of the invention can be performed by the apparatus according to the second aspect of the invention. Further features and embodiments of the method according to the fourth aspect of the invention correspond to the features and embodiments of the apparatus according to the second aspect of the invention.

[0009] According to a fifth aspect, the invention relates to an apparatus for decoding a video stream, comprising a processor and a memory, the memory storing instructions for causing the processor to carry out the method according to the first aspect.

[0010] According to a sixth aspect, the present invention relates to an apparatus for encoding a video stream, comprising a processor and a memory, the memory storing instructions for causing the processor to carry out the method according to the second aspect.

[0011] According to a seventh aspect, there is proposed a computer-readable storage medium having stored thereon instructions that, when executed, cause one or more processors configured to encode video data, the instructions causing the one or more processors to perform a method according to the first aspect or the second aspect, or any possible embodiment of the first aspect or the second aspect.

[0012] According to an eighth aspect, the present invention relates to a computer program comprising a program code for performing, when the computer program is run on a computer, the method according to the first aspect or the second aspect or any possible embodiment of the first aspect or the second aspect.

[0013] More particularly, the present disclosure provides a video coding method implemented by a decoding device or an encoding device, the method comprising: obtaining a bitstream, the bitstream comprises a transform unit syntax; obtaining values ​​of at least two chroma CBF flags (chroma coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit according to the transform unit syntax, wherein one chroma CBF flag of the at least two chroma CBF flags specifies whether a corresponding block has residual in a corresponding color plane; deriving a value of a luma CBF flag based on at least a value of a coding unit CBF flag, a value of a cu_cbf flag, and values ​​of at least the two chroma CBF flags; A method comprising:

[0014] Therefore, the embodiment of the present disclosure improves coding efficiency and proposes a unified mechanism for CBF flag signaling. Therefore, a unified mechanism for CBF flag signaling is proposed.

[0015] Furthermore, the relationship between the CBF flag and the sub-transform unit partitioning tool can remove redundancy in the bitstream.

[0016] In the above-described method, the value of the luma CBF flag may be further derived based on the position of the current sub-transform unit within the current transform unit.

[0017] In the above-described method, the transform unit syntax may include at least two chroma CBF flags, and obtaining values ​​of the at least two chroma CBF flags in accordance with the transform unit syntax may include obtaining values ​​of the at least two chroma CBF flags from the transform unit syntax.

[0018] In the above defined method, the luma CBF flag may be the tu_cbf_luma flag.

[0019] In the above defined method, in the transformation unit syntax, the syntactic elements of the transformation unit are: may be signaled across blocks, or may be signaled to multiple sub-transform units obtained by inter-block sub-block transform (SBT); or It may be signaled to meet the maximum transform unit size constraint.

[0020] In the methods defined above, the current transform unit or current sub-transform unit may include two chroma CBF flags, one for each chroma plane.

[0021] In the method defined above, the value of the luma CBF flag may be derived based on the value of the cu_cbf flag and the values ​​of the two chroma CBF flags corresponding to the current transform unit.

[0022] In the method defined above, if the current transform unit is not split into sub-transform units, the cu_cbf flag may be signaled in the bitstream, the value of the cu_cbf flag may be equal to 1, the value of the tu_cbf_cb flag may be 0, the value of the tu_cbf_cr flag may be 0, and then the value of the tu_cbf_luma flag of the current transform unit may be derived to 1.

[0023] In the method defined above, the conversion unit syntax table corresponding to the conversion unit syntax may be signaled according to the following table: [Table 1]

[0024] In the above-described method, a conversion unit syntax table corresponding to the conversion unit syntax may be signaled according to the following table: [Table 2]

[0025] In the above-described method, if the current transform unit is divided by sub-block transform (SBT), the value of the tu_cbf_luma flag of the sub-transform unit that allows a non-zero CBF flag may be derived according to the following conditions: It is derived that the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current sub-transform unit is 1.

[0026] In the above-described method, a conversion unit syntax table corresponding to the conversion unit syntax may be signaled according to the following table: [Table 3]

[0027] In the above-described method, a conversion unit syntax table corresponding to the conversion unit syntax may be signaled according to the following table: [Table 4]

[0028] In the above-described method, a transform tree syntax table corresponding to a transform unit syntax may be signaled according to the following table: [Table 5] Here, the coding unit syntax table corresponding to the transform tree syntax table may be signaled according to the following table: [Table 6]

[0029] In the above method, treeType may be equal to SINGLE_TREE.

[0030] In the above-described method, the luma CBF flag may be a tu_cbf_luma flag, and if a value for tu_cbf_luma[x0][y0] does not exist, the value for tu_cbf_luma[x0][y0] may be derived according to the following condition: [Table 7]

[0031] In the above-described method, the luma CBF flag may be a tu_cbf_luma flag, and if a value for tu_cbf_luma[x0][y0] does not exist, the value for tu_cbf_luma[x0][y0] may be derived according to the following condition: [Table 8]

[0032] In the above-described method, tu_cbf_luma[x0][y0] equal to 1 may specify that the luma transform block contains one or more transform coefficient levels not equal to 0, and the array index x0, y0 may specify the position (x0, y0) of the top-left luma sample of the considered transform block relative to the top-left luma sample of the image, and the transform coefficient level may be an integer quantity representing a value associated with a particular two-dimensional frequency index in the decoding process before scaling for calculation of the transform coefficient value.

[0033] The present disclosure further provides an encoder including processing circuitry for performing the above-described method.

[0034] The present disclosure further provides a decoder including processing circuitry for performing the above-described method.

[0035] The present disclosure further provides a computer program product comprising program code for performing the above-described method.

[0036] The present disclosure further provides a decoder or encoder comprising one or more processors and a non-transitory computer-readable storage medium coupled to the processors and storing programming for execution by the processors, the programming, when executed by the processors, configuring the decoder to perform the methods described above.

[0037] The present disclosure further provides an encoder, comprising: an acquisition unit configured to acquire a bitstream, the bitstream including a transform unit syntax, the acquisition unit configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma-coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit, one chroma CBF flag of the at least two chroma CBF flags specifying whether a corresponding block has a residual in a corresponding color plane, and a derivation unit configured to derive a value of a luma CBF flag based on at least a value of a coding unit CBF flag, a value of a cu_cbf flag, and the values ​​of the at least two chroma CBF flags.

[0038] The present disclosure further provides a decoder, comprising: an acquisition unit configured to acquire a bitstream, the bitstream including a transform unit syntax, the acquisition unit configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma-coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit, one chroma CBF flag of the at least two chroma CBF flags specifying whether a corresponding block has a residual in a corresponding color plane, and a derivation unit configured to derive a value of a luma CBF flag based on at least a value of a coding unit CBF flag, a value of a cu_cbf flag, and the values ​​of the at least two chroma CBF flags.

[0039] In the decoder described above, the value of the luma CBF flag may be further derived based on the position of the current sub-transform unit within the current transform unit.

[0040] In the above-mentioned decoder, the transform unit syntax may include at least two chroma CBF flags, and the step of obtaining values ​​of the at least two chroma CBF flags in accordance with the transform unit syntax includes the step of obtaining values ​​of the at least two chroma CBF flags from the transform unit syntax.

[0041] In the decoder described above, the luma CBF flag may be the tu_cbf_luma flag.

[0042] In the decoder described above, in the transform unit syntax, the syntax elements of the transform unit are: may be signaled across blocks, or may be signaled to multiple sub-transform units obtained by inter-block sub-block transform (SBT); or It may be signaled to meet the maximum transform unit size constraint.

[0043] In the decoder described above, the current transform unit or current sub-transform unit may contain two chroma CBF flags, one for each chroma plane.

[0044] In the decoder described above, the value of the luma CBF flag may be derived based on the value of the cu_cbf flag and the values ​​of the two chroma CBF flags corresponding to the current transform unit.

[0045] In the above-mentioned decoder, if the current transform unit is not split into sub-transform units, the cu_cbf flag is signaled in the bitstream, the value of the cu_cbf flag is equal to 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit may be derived to 1.

[0046] In the decoder described above, the transform unit syntax table corresponding to the transform unit syntax may be signaled according to the following table: [Table 9]

[0047] In the decoder described above, the transform unit syntax table corresponding to the transform unit syntax may be signaled according to the following table: [Table 10]

[0048] In the decoder described above, if the current transform unit is divided by sub-block transform (SBT), the value of the tu_cbf_luma flag of the sub-transform unit that allows a non-zero CBF flag may be derived according to the following conditions: It is derived that the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current sub-transform unit is 1.

[0049] In the decoder described above, the transform unit syntax table corresponding to the transform unit syntax may be signaled according to the following table: [Table 11]

[0050] In the decoder described above, the transform unit syntax table corresponding to the transform unit syntax may be signaled according to the following table: [Table 12]

[0051] In the decoder described above, the transform tree syntax table corresponding to the transform unit syntax may be signaled according to the following table: [Table 13] Here, the coding unit syntax table corresponding to the transform tree syntax table may be signaled according to the following table: [Table 14]

[0052] In the decoder described above, treeType may be equal to SINGLE_TREE.

[0053] In the decoder described above, the luma CBF flag may be the tu_cbf_luma flag, and if the value of tu_cbf_luma[x0][y0] does not exist, the value of tu_cbf_luma[x0][y0] may be derived according to the following condition: [Table 15]

[0054] In the decoder described above, the luma CBF flag may be the tu_cbf_luma flag, and if the value of tu_cbf_luma[x0][y0] does not exist, the value of tu_cbf_luma[x0][y0] may be derived according to the following condition: [Table 16]

[0055] In the above-mentioned decoder, tu_cbf_luma[x0][y0] equal to 1 may specify that the luma transform block contains one or more transform coefficient levels not equal to 0, and the array index x0, y0 may specify the position (x0, y0) of the top-left luma sample of the considered transform block relative to the top-left luma sample of the image, and the transform coefficient level may be an integer quantity representing a value associated with a particular two-dimensional frequency index in the decoding process before scaling for calculation of the transform coefficient value.

[0056] The details of one or more embodiments are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will become apparent from the description, drawings, and claims. [Brief explanation of the drawings]

[0057] In the following, embodiments of the invention will be explained in more detail with reference to the accompanying figures and drawings.

[0058] [Figure 1A] 1 is a block diagram illustrating an example of a video coding system configured to implement embodiments of the present invention.

[0059] [Figure 1B] 2 is a block diagram illustrating another example of a video coding system configured to implement embodiments of the present invention.

[0060] [Figure 2] 1 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the present invention;

[0061] [Figure 3] 2 is a block diagram illustrating an exemplary structure of a video decoder configured to implement embodiments of the present invention.

[0062] [Figure 4] 1 is a block diagram illustrating an example of an encoding device or a decoding device.

[0063] [Figure 5] FIG. 10 is a block diagram illustrating another example of an encoding device or a decoding device.

[0064] [Figure 6] 1 is a block diagram illustrating one embodiment of a method for signaling a CBF flag.

[0065] [Figure 7] FIG. 2 is a flowchart of a coding method implemented by a decoding device or an encoding device according to the present disclosure.

[0066] [Figure 8] FIG. 1 is a diagram illustrating an example of an encoder according to the present disclosure.

[0067] [Figure 9] FIG. 2 is a schematic diagram illustrating an example of a decoder according to the present disclosure.

[0068] [Figure 10] FIG. 7 is a block diagram similar to FIG.

[0069] Hereinafter, unless expressly specified otherwise, the same reference signs refer to the same or at least functionally equivalent features. DETAILED DESCRIPTION OF THE INVENTION

[0070] In the following description, reference is made to the accompanying drawings, which form a part of this disclosure and which show, by way of example, specific aspects of embodiments of the invention or in which embodiments of the invention may be used. It is understood that embodiments of the invention may be used in other ways and may include structural or logical changes not shown in the drawings. Therefore, the following detailed description is not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims.

[0071] For example, it is understood that disclosure related to a described method may also apply to a corresponding device or system configured to perform the method, and vice versa. For example, when one or more of the steps of a particular method 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 performing the one or more steps, or multiple units each performing one or more of the steps), even if such one or more units are not explicitly described or shown in the drawings. On the other hand, for example, when a particular apparatus is described based on one or more units, e.g., functional units, the corresponding method may include one or more steps (e.g., one step performing the function of one or more units, or multiple steps each performing the function of one or more of the multiple units), to perform the function of the one or more units, even if such step is not explicitly described or shown in the drawings. Furthermore, it is understood that features of various exemplary embodiments and / or aspects described herein may be combined with each other, unless otherwise specifically noted.

[0072] Video coding typically refers to the processing of a series of images that form a video or a video sequence. Instead of the term "image," the terms "frame" or "image" are sometimes used as synonyms in the field of video coding. Video coding (or coding in general) includes two parts: video encoding and video decoding. Video encoding is performed on the source side and typically involves processing (e.g., by compression) the original video image to reduce the amount of data required to represent the video image (for more efficient storage and / or transmission). Video decoding is performed on the destination side and typically involves the reverse process compared to the encoder to reconstruct the video image. Embodiments that refer to "coding" a video image (or images in general) shall be understood to relate to "encoding" or "decoding" the video image or the respective video sequence. The combination of the encoding and decoding parts is also referred to as a codec (coding and decoding).

[0073] In the case of lossless video coding, the original video image can be reconstructed, i.e. the reconstructed video image is of the same quality as the original video image (assuming there is no transmission or other data loss during storage or transmission). In the case of lossy video coding, further compression, e.g. by quantization, is performed to reduce the amount of data representing the video image, but this cannot be perfectly reconstructed at the decoder, i.e. the quality of the reconstructed video image is reduced or degraded compared to the quality of the original video image.

[0074] Some video coding standards belong to the group of "lossy hybrid video codecs" (i.e., they combine spatial and temporal prediction in the sample domain with 2D transform coding to apply quantization in the transform domain). Each image of a video sequence is typically partitioned into a set of non-overlapping blocks, and coding is typically performed at the block level. In other words, at the encoder, video is typically processed, i.e., encoded, at the block (video block) level, for example, by generating a predictive block using spatial (intra-picture) prediction and / or temporal (inter-picture) prediction, subtracting the predictive block from a current block (the block currently being / to be processed) to obtain a residual block, transforming the residual block, and quantizing the residual block in the transform domain to reduce (compress) the amount of data to be transmitted; while at the decoder, in order to reconstruct the current block for representation, an inverse process is applied to the encoded or compressed block compared to the encoder. Furthermore, as the encoder repeats the decoder's processing loop, both will generate the same predictions (e.g., intra- and inter-predictions) and / or reconstructions for processing, i.e., coding, of subsequent blocks.

[0075] Hereinafter, embodiments of a video coding system 10, a video encoder 20, and a video decoder 30 will be described with reference to FIGS.

[0076] 1A is a schematic block diagram illustrating an example coding system 10, e.g., video coding system 10 (or coding system 10 for short), that may use the techniques of the present application. A video encoder 20 (or encoder 20 for short) and a video decoder 30 (or decoder 30 for short) of video coding system 10 represent examples of devices that may be configured to perform techniques in accordance with various examples described herein.

[0077] As shown in FIG. 1A, coding system 10 includes a source device 12 configured to provide (13) encoded image data 21 to, for example, a destination device 14 for decoding the encoded image data.

[0078] The source device 12 comprises an encoder 20 and may additionally, i.e. optionally, comprise an image source 16 , a preprocessor (or preprocessing unit) 18 , for example an image preprocessor 18 , and a communication interface or unit 22 .

[0079] Image source 16 may include or be any type of image capture device, e.g., a camera that captures real-world images, and / or any type of image generation device, e.g., a computer graphics processor that generates computer-animated images, or any type of other device that acquires and / or provides 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). Image source may be any type of memory or storage that stores any of the images described above.

[0080] To distinguish from the preprocessor 18 and the processing performed by the preprocessing unit 18 , the image or image data 17 may also be referred to as raw image or raw image data 17 .

[0081] The pre-processor 18 is configured to receive the (raw) image data 17 and perform pre-processing on the image data 17 to obtain a pre-processed image 19 or pre-processed image data 19. The pre-processing performed by the pre-processor 18 may include, for example, cropping, color format conversion (e.g., RGB to YCbCr), color correction, or noise removal. It will be understood that the pre-processing unit 18 may be an optional component.

[0082] Video encoder 20 is configured to receive pre-processed image data 19 and provide encoded image data 21 (further details are described below, eg, with reference to FIG. 2).

[0083] The communication interface 22 of the source device 12 may be configured to receive the encoded image data 21 via the communication channel 13 and to transmit the encoded image data 21 (or any further processed version thereof) to another device, such as the destination device 14 or any other device, for storage or direct reconstruction.

[0084] The destination device 14 comprises a decoder 30 (e.g., a video decoder 30), and may additionally, i.e. optionally, comprise a communication interface or communication unit 28, a post-processor 32 (or post-processing unit 32), and a display device 34.

[0085] The communications interface 28 of the destination device 14 is configured to receive the encoded image data 21 (or any further processed version thereof), for example directly from the source device 12 or from any other source, for example a storage device, for example an encoded image data storage device, and to provide the encoded image data 21 to a decoder 30.

[0086] The communication interface 22 and the communication interface 28 may be configured to transmit or receive (13) the encoded image data 21 or encoded data between the source device 12 and the destination device 14 via a direct communication link, e.g., a direct wired or wireless connection, or via any type of network, e.g., a wired or wireless network or any combination thereof, or any type of private and public network or any combination thereof.

[0087] The communications interface 22 may be configured, for example, to package the encoded image data 21 into a suitable format, for example into packets, and / or to process the encoded image data using any type of transmission encoding or processing for transmission over a communications link or network.

[0088] The communication interface 28, which is the counterpart of the communication interface 22, may be configured, for example, to receive the transmitted data and process the transmitted data using any type of corresponding transmission decoding or processing and / or depackaging to obtain the encoded image data 21.

[0089] Both communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces, as indicated by the arrows of communication channel 13 pointing from source device 12 to destination device 14 in FIG. 1A, or as bidirectional communication interfaces, e.g., configured to send and receive messages, e.g., establish connections, and confirm and exchange communication links and / or any other information related to data transmission, e.g., encoded image data transmission.

[0090] The decoder 30 is configured to receive the encoded image data 21 and provide decoded image data 31 or a decoded image 31 (further details are described below, for example, with reference to Figure 3 or Figure 5).

[0091] The post-processor 32 of the destination device 14 is configured to post-process the decoded image data 31 (also referred to as reconstructed image data), e.g., the decoded image 31, to obtain post-processed image data 33, e.g., the post-processed image 33. The post-processing performed by the post-processing unit 32 may include, for example, color format conversion (e.g., from YCbCr to RGB), color correction, cropping or resampling, or any other processing, for example, to prepare the decoded image data 31 for display by, e.g., a display device 34.

[0092] A display device 34 of destination device 14 is configured to receive the post-processed image data 33 for displaying the image, for example, to a user or viewer. Display device 34 may be or include any type of display for presenting the reconstructed image, for example, an integrated or external display or monitor. The display may include, for example, 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.

[0093] 1A depicts source device 12 and destination device 14 as separate devices, an embodiment of the device may include both or both of their functionality, i.e., source device 12 or corresponding functionality and destination device 14 or corresponding functionality. In such an embodiment, source device 12 or corresponding functionality and destination device 14 or corresponding functionality may be implemented using the same hardware and / or software, or by separate hardware and / or software, or any combination thereof.

[0094] As will be apparent to those skilled in the art based on this description, the presence and (exact) division of functions of different units or functions within source device 12 and / or destination device 14, as shown in FIG. 1A, may vary depending on the actual device and application.

[0095] Encoder 20 (e.g., video encoder 20) or decoder 30 (e.g., video decoder 30), or both encoder 20 and decoder 30, may be implemented via processing circuitry as shown in FIG. 1B, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, hardware, dedicated to video coding, or any combination thereof. Encoder 20 may be implemented via processing circuitry 46 to embody various modules described in connection with encoder 20 of FIG. 2 and / or any other encoder system or subsystem described herein. Decoder 30 may be implemented via processing circuitry 46 to embody various modules described in connection with decoder 30 of FIG. 3 and / or any other decoder system or subsystem described herein. The processing circuitry may be configured to perform various operations as described below. If the techniques are implemented partially in software, as shown in FIG. 5, a device may store instructions for the software on a suitable non-transitory computer-readable storage medium and execute the instructions using one or more processors in hardware to implement the techniques of this disclosure. Either video encoder 20 and video decoder 30 may be integrated as part of a combined encoder / decoder (codec) within a single device, for example, as shown in FIG. 1B.

[0096] Source device 12 and destination device 14 may comprise any of a wide range of devices, including any type of handheld or stationary device, such as a notebook or laptop computer, a mobile phone, a smartphone, a tablet or tablet computer, a camera, a desktop computer, a set-top box, a television, a display device, a digital media player, a video gaming console, a video streaming device (such as a content service server or content distribution server), a broadcast receiver device, a broadcast transmitter device, etc., and may use no operating system or any type of operating system. In some cases, source device 12 and destination device 14 may be capable of wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices.

[0097] 1A is merely an example, and the techniques herein may be applied to video coding settings (e.g., video encoding or video decoding) that do not necessarily include any data communication between an encoding device and a decoding device. In other examples, data may be retrieved from local memory, streamed over a network, etc. A video encoding device may encode and store data in memory, and / or a video decoding device may decode and retrieve data from memory. In some examples, encoding and decoding are performed by devices that do not communicate with each other but simply encode data to memory and / or retrieve and decode data from memory.

[0098] For ease of explanation, embodiments of the present invention are described herein with reference to reference software for High Efficiency Video Coding (HEVC) or Versatile Video Coding (VVC), which are next-generation video coding standards developed by the ITU-T Video Coding Experts Group (VCEG) and the ISO / IEC Moving Picture Experts Group (MPEG) Joint Working Team on Video Coding (JCT-VC). Those skilled in the art will understand that embodiments of the present invention are not limited to HEVC or VVC.

[0099] [Encoder and encoding method]

[0100] FIG. 2 shows a schematic block diagram of an exemplary video encoder 20 configured to implement the techniques of the present application. In the example of FIG. 2, the video encoder 20 includes an input 201 (or input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, 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 encoding unit 270, and an output 272 (or output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254, and a partitioning unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). The video encoder 20 shown in FIG. 2 may also be referred to as a hybrid video encoder or a video encoder using a hybrid video codec.

[0101] The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, and the mode selection unit 260 may be referred to as forming a forward signal path of the encoder 20, while 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 prediction unit 244, and the intra prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20. The backward signal path of the video encoder 20 corresponds to the signal path of a decoder (see video decoder 30 of FIG. 3). 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 244, and the intra prediction unit 254 are also referred to as forming a “built-in decoder” of the video encoder 20.

[0102] [Image and Image Segmentation (Image and Block)]

[0103] Encoder 20 may be configured to receive, for example, via input 201, an image 17 (or image data 17), e.g., an image of a series of images forming a video or a video sequence. The received image or image data may be a preprocessed image 19 (or preprocessed image data 19). For simplicity, the following description will refer to image 17. Image 17 may also be referred to as a current image or a picture to be coded (particularly in video coding, to distinguish the current image from other images, e.g., previously encoded and / or decoded images of the same video sequence, i.e., a video sequence that also includes the current image).

[0104] A (digital) image is or can be considered as a two-dimensional array or matrix of intensity-valued samples. The samples in the array may also be called pixels (short for picture element) or pels. 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 typically used to represent color; i.e., an image may be represented by or include three sample arrays. In an RBG format or color space, an image includes corresponding red, green, and blue sample arrays. However, in video coding, each pixel is typically represented in a luminance and chrominance format or color space, such as YCbCr, which includes a luminance component denoted Y (although L may be used instead) and two chrominance components denoted Cb and Cr. The luminance (or luma for short) component Y represents brightness or gray level intensity (e.g., as in a grayscale image), while the two chrominance (or chroma for short) components Cb and Cr represent chromaticity or color information components. Thus, an image in YCbCr format includes a luminance sample array of luminance sample values ​​(Y) and two chrominance sample arrays of chrominance values ​​(Cb and Cr). An image in RGB format can be converted or transformed to YCbCr format, or vice versa; this process is also known as color conversion or translation. If the image is monochrome, the image may include only a luminance sample array. Thus, an image may be, for example, an array of luma samples in a monochrome format, or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color formats.

[0105] An embodiment of video encoder 20 may comprise an image partitioning unit (not shown in FIG. 2 ) configured to partition image 17 into multiple (typically non-overlapping) image blocks 203. These blocks may also be referred to as root blocks, macroblocks (H.264 / AVC) or coding tree blocks (CTBs) or coding tree units (CTUs) (H.265 / HEVC and VVC). The image partitioning unit may be configured to partition each image into corresponding blocks using the same block size for all images of a video sequence and the corresponding grid defining the block size, or to vary the block size among images or subsets or groups of images.

[0106] In a further embodiment, the video encoder may be configured to directly receive blocks 203 of image 17, e.g., one, some, or all of the blocks forming image 17. Image blocks 203 may also be referred to as current image blocks or image blocks to be coded.

[0107] Similar to image 17, image block 203 here is or can be considered to be a two-dimensional array or matrix of samples having intensity values ​​(sample values), although with smaller dimensions than image 17. In other words, block 203 may comprise, for example, one sample array (e.g., a luma array in the case of a monochromatic image 17, or a luma or chroma array in the case of a color image), or three sample arrays (e.g., a luma and two chroma arrays in the case of a color image 17), or any other number and / or type of array depending on the applied color format. The number of samples in the horizontal and vertical directions (or axes) of block 203 defines the size of block 203. Thus, a block may be, for example, an M×N (M columns by N rows) array of samples, or an M×N array of transform coefficients.

[0108] The embodiment of video encoder 20 shown in FIG. 2 may be configured to encode image 17 block by block, eg, encoding and prediction is performed block by block 203 .

[0109] An embodiment of video encoder 20 such as that shown in FIG. 2 may be further configured to partition and / or encode images using slices (also referred to as video slices), where an image may be partitioned into or encoded using one or more slices (typically non-overlapping), each of which may comprise one or more blocks (e.g., CTUs).

[0110] 2 may be further configured to partition and / or encode an image using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where an image may be partitioned into or encoded using one or more (typically non-overlapping) tile groups, each of which may comprise, for example, one or more blocks (e.g., CTUs) or one or more tiles. Each tile may be, for example, rectangular in shape and may comprise one or more blocks (e.g., CTUs), e.g., full or fractional blocks.

[0111] [Residual calculation]

[0112] The residual calculation unit 204 may be configured to calculate the residual block 205 (also referred to as the residual 205) based on the image block 203 and the prediction block 265 (further details regarding the prediction block 265 are provided later), for example, by subtracting the sample values ​​of the prediction block 265 from the sample values ​​of the image block 203 on a sample-by-sample (pixel-by-pixel) basis to obtain the residual block 205 in the sample domain.

[0113] [conversion]

[0114] The transform processing unit 206 may be configured to apply a transform, such as a discrete cosine transform (DCT) or a discrete sine transform (DST), to the sample values ​​of the residual block 205 to obtain transform coefficients 207 in a transform domain. The transform coefficients 207 may also be referred to as transform residual coefficients and may represent the residual block 205 in the transform domain.

[0115] The transform processing unit 206 may be configured to apply an integer approximation of a DCT / DST, such as the transform specified in H.265 / HEVC. Compared to an orthogonal DCT transform, such an integer approximation is typically scaled by a specific factor. To preserve the norm of the residual blocks processed by the forward and inverse transforms, an additional scaling factor is applied as part of the transform process. The scaling factor is typically selected based on specific constraints, such as a scaling factor that is a power of two with respect to shift operations, a bit depth of the transform coefficients, a trade-off between accuracy and implementation cost, etc. For example, a specific scaling factor may be specified for the inverse transform, e.g., by the inverse transform processing unit 212 (and a corresponding inverse transform, e.g., by the inverse transform processing unit 312 in the video decoder 30), and a corresponding scaling factor for the forward transform, e.g., by the transform processing unit 206 in the encoder 20, may be specified accordingly.

[0116] An embodiment of video encoder 20 (respectively transform processing unit 206) may be configured to encode or compress and then output transform parameters, e.g., one or more types of transform, e.g., directly or via entropy encoding unit 270, so that, for example, video decoder 30 may receive and use the transform parameters for decoding.

[0117] [Quantization]

[0118] The quantization unit 208 may be configured to quantize the transform coefficients 207, for example, by applying scalar quantization or vector quantization, to obtain quantized coefficients 209. The quantized coefficients 209 may also be referred to as quantized transform coefficients 209 or quantized residual coefficients 209.

[0119] 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 to an m-bit transform coefficient during quantization, where n is greater than m. The degree of quantization may be changed by adjusting a quantization parameter (QP). For example, in the case of scalar quantization, different scaling may be applied to achieve finer or coarser quantization. A smaller quantization step size corresponds to finer quantization, while a larger quantization step size corresponds to coarser quantization. The applicable quantization step size may be indicated by the quantization parameter (QP). The quantization parameter may, for example, be an index into a predefined set of applicable quantization step sizes. For example, a small quantization parameter may correspond to fine quantization (small quantization step size) and a large quantization parameter may correspond to coarse quantization (large quantization step size), or vice versa. Quantization may involve division by a quantization step size, and corresponding and / or inverse dequantization, e.g., by the inverse quantization unit 210, may involve multiplication by the quantization step size. Embodiments according to some standards, e.g., HEVC, may be configured to use a quantization parameter to determine the quantization step size. Generally, the quantization step size may be calculated based on the quantization parameter using a fixed-point approximation of an equation involving division. To recover the norm of the residual block, an additional scaling factor may be introduced in the quantization and dequantization, which may change due to the scaling used in the fixed-point approximation of the quantization step size and quantization parameter equations. In one example implementation, the scaling of the inverse transform and dequantization may be combined. Alternatively, customized quantization tables may be used and signaled, e.g., in the bitstream, from the encoder to the decoder. Quantization is a lossy operation, and loss increases with increasing quantization step size.

[0120] An embodiment of video encoder 20 (respectively quantization unit 208) may be configured to encode and then output a quantization parameter (QP), e.g., directly or via entropy encoding unit 270, so that, for example, video decoder 30 may receive and apply the quantization parameter for decoding.

[0121] [Dequantization]

[0122] Inverse quantization unit 210 is configured to apply the inverse quantization of quantization unit 208 to the quantized coefficients, e.g., by applying the inverse of the quantization scheme applied by quantization unit 208 based on or using the same quantization step size as quantization unit 208, to obtain dequantized coefficients 211. The dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211 and correspond to the transform coefficients 207, although they are typically not identical to the transform coefficients due to loss due to quantization.

[0123] [Inverse Transformation]

[0124] The inverse transform processing unit 212 is configured to apply an inverse transform of the transform applied by the transform processing unit 206, such as an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST) or other inverse transform, to obtain a reconstructed residual block 213 (or corresponding dequantized coefficients 213) in the sample domain. The reconstructed residual block 213 may also be referred to as a transform block 213.

[0125] [Reconfiguration]

[0126] The reconstruction unit 214 (e.g., an adder or summator 214) is configured to add the transform block 213 (i.e., the reconstructed residual block 213) to the prediction block 265, for example, by adding, sample by sample, the sample values ​​of the reconstructed residual block 213 and the sample values ​​of the prediction block 265, to obtain the reconstructed block 215 in the sample domain.

[0127] [filtering]

[0128] The loop filter unit 220 (or “loop filter” 220 for short) is configured to filter the reconstruction block 215 to obtain a filtered block 221, or generally, to filter the reconstructed samples to obtain filtered samples. The loop filter unit is configured, for example, to smooth pixel transitions or otherwise improve video quality. The loop filter unit 220 may comprise 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 filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is shown in FIG. 2 as being within the loop filter, 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.

[0129] An embodiment of video encoder 20 (respectively loop filter unit 220) may be configured to encode and then output loop filter parameters (such as sample adaptive offset information), e.g., directly or via entropy encoding unit 270, so that, for example, decoder 30 may receive and apply the same loop filter parameters or respective loop filters for decoding.

[0130] [Decoded image buffer]

[0131] The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or reference image data in general, for encoding video data by the video encoder 20. The DPB 230 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous dynamic random access memory (SDRAM), magnetoresistive random access memory (MRAM), resistive random access memory (RRAM), or other types of memory devices. The decoded picture buffer (DPB) 230 may be configured to store one or more filtered blocks 221. The decoded picture buffer 230 may be further configured to store other previously filtered blocks, e.g., previously reconstructed and filtered blocks 221, of the same current picture or a different picture, e.g., a previously reconstructed picture, to provide a previously reconstructed, i.e., decoded, complete picture (and corresponding reference blocks and samples) and / or a partially reconstructed current picture (and corresponding reference blocks and samples), e.g., for inter-prediction. The decoded picture buffer (DPB) 230 may be configured to store, for example, one or more unfiltered reconstruction blocks 215 if the reconstruction blocks 215 have not been filtered by the loop filter unit 220, or in general, unfiltered reconstructed samples, or any other further processed version of the reconstruction blocks or samples.

[0132] Mode Selection (Segmentation and Prediction)

[0133] The mode selection unit 260 includes a partitioning unit 262, an inter prediction unit 244, and an intra prediction unit 254, and is configured to receive or obtain original image data, such as the original block 203 (the current block 203 of the current image 17), and reconstructed image data, such as filtered and / or unfiltered reconstructed samples or blocks of the same (current) image and / or from one or more previously decoded images, such as from the decoded image buffer 230 or other buffers (e.g., line buffers, not shown). The reconstructed image data is used as reference image data for prediction, such as inter prediction or intra prediction, to obtain a prediction block 265 or predictor 265.

[0134] The mode selection unit 260 may be configured to determine or select a partitioning and prediction mode (e.g., intra or inter prediction mode) for the current block prediction mode (not including partitioning) and generate a corresponding prediction block 265, which is used for calculating the residual block 205 and for reconstructing the reconstruction block 215.

[0135] Embodiments of the mode selection unit 260 may be configured to select a partitioning and prediction mode (e.g., from those supported by or available to the mode selection unit 260) that provides the best match, or in other words, the smallest residual (smallest residual means better compression for transmission or storage), or the smallest signaling overhead (smallest signaling overhead means better compression for transmission or storage), or a consideration or balance of both. The mode selection unit 260 may be configured to determine the partitioning and prediction mode based on rate-distortion optimization (RDO), i.e., to select the prediction mode that provides the smallest rate-distortion. In this context, terms such as “best,” “minimum,” “optimum,” etc., do not necessarily refer to the overall “best,” “minimum,” “optimum,” etc., but may refer to the achievement of a termination or selection criterion, such as a value exceeding or falling below a threshold or other constraint, potentially leading to a “less-than-optimal selection” but reducing complexity and processing time.

[0136] In other words, the partitioning unit 262 may be configured to partition the block 203 into smaller block partitions or sub-blocks (again forming blocks), for example, using quad tree partitioning (QT), binary tree partitioning (BT), or triple tree partitioning (TT), or any combination thereof, and to perform prediction for each of the block partitions or sub-blocks, for example, wherein the mode selection includes selecting a tree structure of the partitioned block 203, and a prediction mode is applied to each of the block partitions or sub-blocks.

[0137] The partitioning (eg, by partitioning unit 260) and prediction processes (by inter-prediction unit 244 and intra-prediction unit 254) performed by example video encoder 20 are described in more detail below.

[0138] [Partitioning]

[0139] The partitioning unit 262 may partition (or divide) the current block 203 into smaller partitions, e.g., square- or rectangular-sized smaller blocks. These smaller blocks (which may also be referred to as sub-blocks) may be further partitioned into even smaller partitions. This is also referred to as tree partitioning or hierarchical tree partitioning, where a root block, e.g., at root tree level 0 (hierarchical level 0, depth 0), may be recursively partitioned, e.g., into two or more blocks at a node at the next lower tree level, e.g., tree level 1 (hierarchical level 1, depth 1), which may then be partitioned again into two or more blocks at the next lower level, e.g., tree level 2 (hierarchical level 2, depth 2), and so on, until the partitioning terminates, e.g., because a termination criterion is met, e.g., because a maximum tree depth or a minimum block size is reached. Blocks that are not further partitioned are also referred to as leaf blocks or leaf nodes of the tree. A tree that uses partitioning into two partitions is called a binary tree (BT), a tree that uses partitioning into three partitions is called a ternary tree (TT), and a tree that uses partitioning into four partitions is called a quad tree (QT).

[0140] As mentioned above, the term "block" as used herein may refer to a portion of an image, particularly a square or rectangular portion. For example, with reference to HEVC and VVC, a block may be or 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).

[0141] For example, a coding tree unit (CTU) may be or include a CTB of luma samples for an image having a three-sample array, two corresponding CTBs of chroma samples, or a CTB of a monochrome image or a sample of an image coded using three separate color planes and a syntax structure used to code the samples. Correspondingly, a coding tree block (CTB) may be an N×N block of samples for some value of N, such that the division of components into CTBs is a partition. A coding unit (CU) may be or include a coding block of luma samples, two corresponding coding blocks of chroma samples for an image having a three-sample array, or a coding block of samples of a monochrome image or an image coded using three separate color planes and a syntax structure used to code the samples. Correspondingly, a coding block (CB) may be an M×N block of samples for some values ​​of M and N, such that the division of CTBs into coding blocks is a partition.

[0142] For example, in an embodiment according to HEVC, a coding tree unit (CTU) may be divided into CUs by using a quad-tree structure represented as a coding tree. The decision of whether to code an image area using inter-image (temporal) prediction or intra-image (spatial) prediction is made at the CU level. Each CU can be further divided into one, two, or four PUs according to the PU's partition type. Within one PU, the same prediction process is applied, and related information is transmitted to the decoder on a PU-by-PU basis. After obtaining residual blocks by applying a prediction process based on the PU's partition type, the CU can be partitioned into transform units (TUs) according to another quad-tree structure similar to the CU's coding tree.

[0143] For example, in an embodiment according to the latest video coding standard currently under development, referred to as Versatile Video Coding (VVC), a combined quad-tree and binary-tree (QTBT) partitioning is used to partition coding blocks. In the QTBT block structure, a CU can have either a square or a rectangular shape. For example, a coding tree unit (CTU) is first partitioned using a quad-tree structure. The quad-tree leaf nodes are further partitioned using a binary tree or a ternary (or triple) tree structure. The leaf nodes of the partitioning tree are called coding units (CUs), and their segmentation is used for prediction and transform processing without any further partitioning. That is, CUs, PUs, and TUs have the same block size in the QTBT coding block structure. In parallel, multiple partitioning methods, such as triple-tree partitioning, may also be used with the QTBT block structure.

[0144] In one example, mode select unit 260 of video encoder 20 may be configured to perform any combination of the partitioning techniques described herein.

[0145] As described above, video encoder 20 is configured to determine or select a best or optimal prediction mode from a (e.g., predetermined) set of prediction modes, which may include, for example, intra-prediction modes and / or inter-prediction modes.

[0146] [Intra prediction]

[0147] The set of intra prediction modes may include 35 different intra prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes, for example, as defined in HEVC, or may include 67 different intra prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes, for example, as defined in VVC.

[0148] The intra prediction unit 254 is configured to generate an intra prediction block 265 according to an intra prediction mode from a set of intra prediction modes using reconstructed samples of neighboring blocks of the same current image.

[0149] The intra prediction unit 254 (or generally the mode selection unit 260) is further configured to output intra prediction parameters (or generally information indicating the intra prediction mode selected for the block) to the entropy encoding unit 270 in the form of syntax element 266 to be included in the encoded image data 21, so that, for example, the video decoder 30 may receive and use the prediction parameters for decoding.

[0150] [Inter Prediction]

[0151] The set of inter prediction modes (or possible inter prediction modes) depends on the available reference images (i.e., previous, at least partially decoded images, e.g., stored in DBP 230) and other inter prediction parameters, such as whether the entire reference image or only a portion of the reference image, e.g., a search window area around the area of ​​the current block, was used to search for the best matching reference block, and / or whether pixel interpolation, e.g., half / semi-pel and / or quarter-pel interpolation, was applied.

[0152] In addition to the above prediction modes, skip mode and / or direct mode may also be applied.

[0153] The inter prediction unit 244 may comprise a motion estimation (ME) unit and a motion compensation (MC) unit (both not shown in FIG. 2). The motion estimation unit may be configured to receive or obtain, for motion prediction, the image block 203 (the current image block 203 of the current image 17) and the decoded image 231, or at least one or more previously reconstructed blocks, such as reconstructed blocks of one or more other / different previously decoded images 231. For example, a video sequence may include the current image and the previously decoded image 231, or in other words, the current image and the previously decoded image 231 may be part of or form a series of images that form a video sequence.

[0154] The encoder 20 may be configured to, for example, select a reference block from multiple reference blocks of the same or different images among multiple other images, and provide the reference image (or reference image index) and / or an offset (spatial offset) between the position (x, y coordinates) of the reference block and the position of the current block to the motion estimation unit as an inter-prediction parameter. This offset is also referred to as a motion vector (MV).

[0155] The motion compensation unit is configured to obtain, e.g., receive, inter prediction parameters and perform inter prediction based on or using the inter prediction parameters to obtain an inter prediction block 265. The motion compensation performed by the motion compensation unit may involve fetching or generating a prediction block based on motion / block vectors determined by motion prediction, possibly performing interpolation up to sub-pixel accuracy. Interpolation filtering may generate additional pixel samples from known pixel samples, thus potentially increasing the number of candidate prediction blocks that can be used to code the image block. Upon receiving a motion vector for the PU of the current image block, the motion compensation unit may locate the prediction block to which the motion vector points in one of the reference image lists.

[0156] The motion compensation unit may generate syntax elements associated with blocks and video slices for use by video decoder 30 in decoding the image blocks of the video slices. In addition to, or instead of, slices and their respective syntax elements, the motion compensation unit may generate or use tile groups and / or tiles and their respective syntax elements.

[0157] [Entropy Coding]

[0158] Entropy encoding unit 270 is configured to, for example, apply an entropy encoding algorithm or scheme (e.g., a variable length coding (VLC) scheme, a context-adaptive VLC scheme (CAVLC), an arithmetic coding scheme, binarization, context-adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioned entropy (PIPE) coding, or another entropy encoding method or technique), or bypass (no compression), to quantization coefficients 209, inter-prediction parameters, intra-prediction parameters, loop filter parameters, and / or other syntax elements to obtain encoded image data 21 that can be output via output 272, for example, in the form of encoded bitstream 21, so that, for example, video decoder 30 may receive and use the parameters for decoding. Encoded bitstream 21 may be transmitted to video decoder 30 or stored in memory for later transmission or retrieval by video decoder 30.

[0159] Other structural variations of the video encoder 20 can be used to encode the video stream. For example, a non-transform-based encoder 20 can quantize the residual signal directly without using the transform processing unit 206 for a particular block or frame. In another implementation, the encoder 20 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.

[0160] [Decoder and decoding method]

[0161] 3 shows an example of a video decoder 30 configured to implement the techniques of the present application. The video decoder 30 is configured to receive encoded image data 21 (e.g., encoded bitstream 21), for example, encoded by encoder 20, to obtain a decoded image 331. The encoded image data or bitstream includes information for decoding the encoded image data, for example, data representing image blocks and associated syntax elements of an encoded video slice (and / or tile group or tile).

[0162] 3, 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., summer 314), a loop filter 320, a decoded picture buffer (DBP) 330, a mode application unit 360, an inter prediction unit 344, and an intra prediction unit 354. Inter prediction unit 344 may be or include a motion compensation unit. Video decoder 30, in some examples, may perform a decoding pass that is generally inverse to the encoding pass described with respect to video encoder 100 of FIG. 2.

[0163] As described with respect to encoder 20, inverse quantization unit 210, inverse transform processing unit 212, reconstruction unit 214, loop filter 220, decoded picture buffer (DPB) 230, inter prediction unit 344, and intra prediction unit 354 are also referred to as forming a “built-in decoder” of video encoder 20. Accordingly, inverse quantization unit 310 may be functionally identical to inverse quantization unit 110, inverse transform processing unit 312 may be functionally identical to inverse transform processing unit 212, reconstruction unit 314 may be functionally identical to reconstruction unit 214, loop filter 320 may be functionally identical to loop filter 220, and decoded picture buffer 330 may be functionally identical to decoded picture buffer 230. Accordingly, the descriptions provided for the respective units and functions of video encoder 20 correspondingly apply to the respective units and functions of video decoder 30.

[0164] [Entropy Decoding]

[0165] The entropy decoding unit 304 is configured to parse the bitstream 21 (or generally the encoded image data 21) and, e.g., perform entropy decoding on the encoded image data 21 to obtain, e.g., quantization coefficients 309 and / or decoded coding parameters (not shown in FIG. 3 ), e.g., any or all of inter-prediction parameters (e.g., reference image indices and motion vectors), intra-prediction parameters (e.g., intra-prediction modes or indices), transform parameters, quantization parameters, loop filter parameters, and / or other syntax elements. The entropy decoding unit 304 may be configured to apply a decoding algorithm or scheme corresponding to the encoding scheme described with respect to the entropy encoding unit 270 of the encoder 20. The entropy decoding unit 304 may be further configured to provide the inter-prediction parameters, intra-prediction parameters, and / or other syntax elements to the mode application unit 360 and other parameters to other units of the decoder 30. The video decoder 30 may receive syntax elements at the video slice level and / or at the video block level. In addition to or as an alternative to slices and their respective syntax elements, tile groups and / or tiles and their respective syntax elements may be received and / or used.

[0166] [Dequantization]

[0167] Inverse quantization unit 310 may be configured to receive a quantization parameter (QP) (or information generally related to inverse quantization) and quantized coefficients from encoded image data 21 (e.g., by parsing and / or decoding, e.g., by entropy decoding unit 304), and to apply inverse quantization to the decoded quantized coefficients 309 based on the quantization parameter to obtain dequantized coefficients 311, which may also be referred to as transform coefficients 311. The inverse quantization process may involve use of a quantization parameter determined by video encoder 20 for each video block within a video slice (or tile or tile group) to determine the degree of quantization, and similarly, the degree of inverse quantization to be applied.

[0168] [Inverse Transformation]

[0169] The inverse transform processing unit 312 may be configured to receive the dequantized coefficients 311, also referred to as transform coefficients 311, and to apply a transform to the dequantized coefficients 311 to obtain the reconstructed residual block 213 in the sample domain. The reconstructed residual block 213 may also be referred to as a transform block 313. The transform may be an inverse transform, e.g., an inverse DCT, an inverse DST, an inverse integer transform, or a conceptually similar inverse transform process. The inverse transform processing unit 312 may further be configured to receive transform parameters or corresponding information from the encoded image data 21 (e.g., by parsing and / or decoding, e.g., by the entropy decoding unit 304) and determine a transform to be applied to the dequantized coefficients 311.

[0170] [Reconfiguration]

[0171] The reconstruction unit 314 (e.g., an adder or summator 314) may be configured to add the reconstructed residual block 313 to the prediction block 365, for example, by adding the sample values ​​of the reconstructed residual block 313 and the sample values ​​of the prediction block 365, to obtain the reconstructed block 315 in the sample domain.

[0172] [filtering]

[0173] Loop filter unit 320 (either within the coding loop or after the coding loop) is configured to filter reconstructed block 315 to obtain filtered block 321, e.g., to smooth pixel transitions or otherwise improve video quality. Loop filter unit 320 may comprise one or more loop filters, such as a deblocking filter, a sample adaptive offset (SAO) filter, or one or more other filters, e.g., a bilateral filter, an adaptive loop filter (ALF), a sharpening filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although loop filter unit 320 is shown in FIG. 3 as being within the loop filter, in other configurations, loop filter unit 320 may be implemented as a post-loop filter.

[0174] [Decoded image buffer]

[0175] The decoded video blocks 321 of the image are then stored in a decoded image buffer 330, which stores the decoded image 331 as a reference image for subsequent motion compensation of other images and / or for output display, respectively.

[0176] The decoder 30 is arranged to output the decoded image 311, for example via an output 312, for presentation or viewing to a user.

[0177] [prediction]

[0178] The inter prediction unit 344 may be identical to the inter prediction unit 244 (in particular, the motion compensation unit), and the intra prediction unit 354 may be functionally identical to the inter prediction unit 254, and performs the division or partitioning decision and prediction based on the partitioning and / or prediction parameters or respective information received (e.g., by parsing and / or decoding by the entropy decoding unit 304) from the encoded image data 21. The mode application unit 360 may be configured to perform prediction (intra or inter prediction) for each block based on the reconstructed image, block, or respective samples (filtered or unfiltered) to obtain a prediction block 365.

[0179] If the video slice is coded as an intra-coded (I) slice, the intra prediction unit 354 of the mode application unit 360 is configured to generate a predictive block 365 for an image block of the current video slice based on the signaled intra prediction mode and data from previously decoded blocks of the current image. If the video image is coded as an inter-coded (i.e., B or P) slice, the inter prediction unit 344 (e.g., a motion compensation unit) of the mode application unit 360 is configured to generate a predictive block 365 for a video block of the current video slice based on the motion vector and other syntax elements received from the entropy decoding unit 304. In inter prediction, the predictive block may be generated from one of multiple reference images included in one of multiple reference image lists. The video decoder 30 may construct the reference frame lists, List 0 and List 1, based on the reference images stored in the DPB 330 using a default construction technique. The same or similar may apply to or depending on the embodiment that uses tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or instead of slices (e.g., video slices), e.g., video may be coded using I, P or B tile groups and / or tiles.

[0180] Mode application unit 360 is configured to determine prediction information for video blocks of the current video slice by parsing motion vectors or related information and other syntax elements, and uses the prediction information to generate predictive blocks for the current video block being decoded. For example, mode application unit 360 uses some of the received syntax elements to determine the prediction mode (e.g., intra or inter prediction) used to code the video blocks of the video slice, the inter-prediction slice type (e.g., B slice, P slice, or GPB slice), configuration information regarding one or more of the reference image lists for the slice, the motion vector for each inter-encoded video block of the slice, the inter-prediction status for each inter-coded video block of the slice, and other information for decoding video blocks in the current video slice. The same or similar may apply for or depending on embodiments that use tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or instead of slices (e.g., video slices); e.g., video may be coded using I, P, or B tile groups and / or tiles.

[0181] An embodiment of the video decoder 30 as shown in FIG. 3 may further be configured to partition and / or decode an image using slices (also referred to as video slices), where an image may be partitioned into or decoded using one or more slices (typically non-overlapping), each of which may comprise one or more blocks (e.g., CTUs).

[0182] 3 may be configured to partition and / or decode images using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where an image may be partitioned into or decoded using one or more (typically non-overlapping) tile groups, each of which may comprise, for example, one or more blocks (e.g., CTUs) or one or more tiles. Each tile may be, for example, rectangular in shape and may comprise one or more blocks (e.g., CTUs), e.g., full or fractional blocks.

[0183] Other variations of the video decoder 30 may be used to decode the encoded image data 21. For example, the decoder 30 may generate the output video stream without using the loop filtering unit 320. For example, a non-transform-based decoder 30 may directly inverse quantize the residual signal without using the inverse transform processing unit 312 for a particular block or frame. 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.

[0184] It should be understood that in the encoder 20 and the decoder 30, the processing result of the current step may be further processed and then output to the next step. For example, after interpolation filtering, motion vector derivation or loop filtering, further operations such as clipping or shifting may be performed on the processing result of the interpolation filtering, motion vector derivation or loop filtering.

[0185] 4 is a schematic diagram of a video coding device 400 according to one embodiment of the present disclosure. The video coding device 400 is suitable for implementing the disclosed embodiments described herein. In an embodiment, the video coding device 400 may be a decoder, such as the video decoder 30 of FIG. 1A, or an encoder, such as the video encoder 20 of FIG. 1A.

[0186] The video coding device 400 comprises an ingress port 410 (or input port 410) and a receiver unit (Rx) 420 for receiving data, a processor, logic unit, or central processing unit (CPU) 430 for processing the data, a transmitter unit (Tx) 440 and an egress port 450 (or output port 450) for transmitting the data, and a memory 460 for storing the data. The video coding device 400 may comprise optical / electrical (OE) and electrical / optical (EO) components coupled to the ingress port 410, the receiver unit 420, the transmitter unit 440, and the egress port 450 for inputting or outputting optical or electrical signals.

[0187] The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., multi-core processors), FPGAs, ASICs, and DSPs. The processor 430 communicates with the ingress port 410, the receiver unit 420, the transmitter unit 440, the egress port 450, and the memory 460. The processor 430 includes a coding module 470. The coding module 470 implements the above-disclosed embodiments. For example, the coding module 470 implements, processes, prepares, or provides various coding operations. Thus, the inclusion of the coding module 470 provides a significant improvement in the functionality of the video coding device 400 and results in the transformation of the video coding device 400 into different states. Alternatively, the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430.

[0188] Memory 460 may comprise one or more disks, tape drives, and solid state drives, and may be used as an overflow data storage device for storing programs when selected for execution, as well as for storing instructions and data read during execution of the programs. Memory 460 may be, for example, volatile and / or non-volatile, and may be read-only memory (ROM), random access memory (RAM), ternary content addressable memory (TCAM), and / or static random access memory (SRAM).

[0189] FIG. 5 is a schematic block diagram of an apparatus 500 that may be used as either or both of the source device 12 and the destination device 14 according to FIG. 1 according to an exemplary embodiment.

[0190] Processor 502 in apparatus 500 may be a central processing unit. Alternatively, processor 502 may be any other type of device or devices now existing or later developed capable of manipulating or processing information. While the disclosed implementations may be practiced using a single processor as shown, such as processor 502, advantages in speed and efficiency may be achieved using one or more processors.

[0191] The memory 504 in the apparatus 500, in one implementation, 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 comprise code and data 506 accessed by the processor 502 using a bus 512. The memory 504 may further comprise an operating system 508 and application programs 510, the application programs 510 including at least one program that enables the processor 502 to perform the methods described herein. For example, the application programs 510 may include applications 1-N, which further include a video coding application that performs the methods described herein.

[0192] 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 operable to detect touch input. The display 518 may be coupled to the processor 502 via the bus 512.

[0193] Although depicted herein as a single bus, bus 512 of device 500 may be comprised of multiple buses. Additionally, secondary storage 514 may be directly coupled to other components of device 500 or may be accessible over a network, and may include a single integrated unit such as a memory card or multiple units such as multiple memory cards. Accordingly, device 500 may be implemented in a wide variety of configurations.

[0194] Modern video codecs typically include various transform unit partitioning methods, such as sub-block transforms of inter-blocks, intra-block partitioning coding modes, and transform unit partitioning, which meet the maximum transform size constraints. Alternatively, transform units can be directly coded without further partitioning. In subsequent steps, each transform unit or sub-transform unit contains a set of CBF flags, which specify whether each color component contains the residual for the current block. It's worth noting that the CBF flags have some redundancy, allowing for specific characteristics of each specific transform unit partitioning.

[0195] In the embodiment of the present invention, a general unified scheme for redundancy elimination in CBF flag signaling is proposed.

[0196] In the present disclosure, in the first embodiment, if transform unit splitting is not used, tu_cbf_luma can be derived from the cu_cbf flag if the cu_cbf flag is set to 1 and the two chroma flags of the current TU are set to 0. In this case, tu_cbf_luma is set equal to 1 and is not signaled. Otherwise, the signaling of tu_cbf_luma is performed in the normal manner. In the present disclosure, when the cu_cbf flag is equal to 1, it specifies that a transform_tree syntax structure is present in the current coding unit, and when the cu_cbf flag is equal to 0, it specifies that a transform_tree syntax structure is not present in the current coding unit.

[0197] In a second embodiment, when a transform unit is split into two sub-transform units by SBT, one of which contains a residual controlled by the tu_cbf_luma, tu_cbf_cb, and tu_cbf_cr flags, tu_cbf_luma can be derived from the cu_cbf flag according to the following rules: If the cu_cbf flag is set to 1 and the two chroma flags of the current TU are set to 0, then tu_cbf_luma is set equal to 1 and is not signaled. Otherwise, the signaling of tu_cbf_luma is performed in the usual manner.

[0198] In a third embodiment, when a transform unit is split by sub-transform units to meet the maximum transform unit size restriction, the luma cbf flag of the last sub-transform unit of the transform unit is derived according to the following condition: If the cu_cbf flag is 1, and tu_cbf_luma, tu_cbf_cb, and tu_cbf_cr of all previously encoded sub-transform units in the current transform unit are all 0, and tu_cbf_cb, tu_cbf_cr of the current sub-transform unit are 0, then tu_cbf_luma is set equal to 1 and is not signaled. Otherwise, the signaling of tu_cbf_luma is performed in the usual manner.

[0199] In the embodiment of the present disclosure, a unified mechanism for CBF flag signaling is proposed to improve coding efficiency. Therefore, a unified mechanism for CBF flag signaling is proposed.

[0200] The relationship between the CBF flags and the sub-transform unit partitioning tool allows for the removal of redundancies in the bitstream.

[0201] In other words, the embodiments of the present disclosure propose modifications aimed at removing some inconsistencies in CBF flag signaling between VVC4 specification and VTM4.0.1 SW. In a first aspect, we propose removing hierarchical chroma CBF signaling based on transform unit depth, which is not presented in this specification, from VTM SW and including the missing luma CBF flag derivation methods for normal TUs and SBT TUs based on the chroma CBF flags presented in SW in this specification. In a second aspect, we propose building on the first aspect and assuming a unified design of all existing luma CBF flag derivation methods.

[0202] There are four possible TUs represented in VVC4. 1.Normal TU is equal to CU size (no division), 2. SBT TU division, 3. Partitioning of ISP TUs, 4. Partitioning TUs by limiting the maximum transform size.

[0203] The table below illustrates the possibilities. [Table 17] [Table 18]

[0204] It will be noted that according to Tables 1 and 2, both luma and chroma CBF signaling are performed independently of each other and there is no hierarchical dependency on the chroma CBF flags.

[0205] From a SW perspective, VTM 4.0.1 includes both of the above aspects.

[0206] The hierarchical chroma CBF signaling method has been tested with VTM4.0.1 and demonstrates a non-negligible impact on coding efficiency. However, supporting this feature requires additional non-trivial logic both in the SW and in this document.

[0207] In one embodiment, we propose to remove the SW's hierarchical chroma CBF signaling method and include it in the spec's luma CBF derivation.

[0208] The table below shows the modified syntax table. [Table 19]

[0209] In another embodiment, we propose to apply a similar method to derive the luma CBF for TUs that have been split to satisfy the maximum TU restriction. This integration can share the existing mechanism for final luma CBF derivation for ISPs. The table below shows the proposed changes: [Table 20]

[0210] In the embodiments of the present invention, it is possible to improve coding efficiency, simplify the description, and propose a unified mechanism for CBF flag signaling. Therefore, a unified mechanism for CBF flag signaling is proposed.

[0211] The relationship between the CBF flags and the sub-transform unit partitioning tool allows for the removal of redundancies in the bitstream.

[0212] In other words, there are four possibilities for how TU is expressed in VVC4. 1.Normal TU is equal to CU size (no division), 2. SBT TU division, 3. Partitioning of ISP TUs, 4. Partitioning TUs by limiting the maximum transform size.

[0213] The table below illustrates the possibilities. [Table 21] [Table 22]

[0214] It will be noted that according to Tables 1 and 2, both luma and chroma CBF signaling are performed independently of each other and there is no hierarchical dependency on the chroma CBF flags.

[0215] From a SW perspective, VTM 4.0.1 includes both of the above aspects.

[0216] The hierarchical chroma CBF signaling method has been tested with VTM4.0.1 and demonstrates a non-negligible impact on coding efficiency. However, supporting this feature requires additional non-trivial logic both in the SW and in this document.

[0217] In one embodiment, we propose to remove the SW's hierarchical chroma CBF signaling method and include it in the spec's luma CBF derivation.

[0218] The table below shows the modified syntax table. [Table 23]

[0219] In this embodiment, the tu_cbf_luma[x0][y0] flag derivation method is performed in 1) the normal case when a TU is equal to a CU, and 2) the case of an SBT of a sub-TU that includes a CBF flag. The derivation process is performed based on the block type (CuPredMode[x0][y0]) and the values ​​of the Cb and Cr CBF flags (tu_cbf_cb[x0][y0] and tu_cbf_cr[x0][y0]) that have already been transmitted in the bitstream before tu_cbf_luma[x0][y0]. Note that this derivation technique does not apply to TUs that are divided into sub-TUs to satisfy the maximum transform unit size restriction.

[0220] The embodiments of the present invention can improve coding efficiency, simplify the description, and propose a unified mechanism for CBF flag signaling.

[0221] The relationship between the CBF flags and the sub-transform unit partitioning tool allows for the removal of redundancies in the bitstream.

[0222] In yet another embodiment, in relation to the previous embodiment, it is proposed to remove the hierarchical chroma CBF signaling method in SW and include the derivation of luma CBF in the specification.

[0223] The following table shows the modified syntax table of the conversion unit syntax, i.e. the conversion unit syntax is signaled according to the table below: [Table 24]

[0224] In this embodiment, the tu_cbf_luma[x0][y0] flag derivation method is performed in 1) the normal case when a TU is equal to a CU, and 2) the case of an SBT of a sub-TU that includes a CBF flag. The derivation process is performed based on the block type (CuPredMode[x0][y0]) and the values ​​of the Cb and Cr CBF flags (tu_cbf_cb[x0][y0] and tu_cbf_cr[x0][y0]) that have already been transmitted in the bitstream before tu_cbf_luma[x0][y0]. Note that this derivation technique does not apply to TUs that are divided into sub-TUs to satisfy the maximum transform unit size restriction.

[0225] This embodiment, like other embodiments of the present invention, can improve coding efficiency, simplify the specification, and propose a unified mechanism for CBF flag signaling.

[0226] Furthermore, in this embodiment, the relationship between the CBF flag and the sub-transformation unit partitioning tool can remove redundancy in the bitstream.

[0227] Figure 6 is a block diagram illustrating one embodiment of a method for signaling CBF flags. Figure 6 illustrates a case where a normal TU is equal to the CU size and is vertically divided into two sub-TUs: sub-TU0 and sub-TU1 by SBT partitioning. Here, according to the SBT design, only one sub-TU may have non-zero tu_cbf_cb, tu_cbf_cr, and tu_cbf_luma flags. In the example of Figure 6, sub-TU0 may have non-zero tu_cbf_cb, tu_cbf_cr, and tu_cbf_luma flags. Assuming that the cu_cbf flag of the entire coding unit is equal to 1 and both tu_cbf_cb and tu_cbf_cr of sub-TU0 are signaled to 0, the value of tu_cbf_luma can be derived to 1 without explicit signaling.

[0228] This is further illustrated in FIG. 10, where TU equals CU, with no partitioning and with pipeline partitioning.

[0229] 7 is a flowchart illustrating steps of a video coding method implemented by a decoding device or encoding device according to the present disclosure. In FIG. 7, the method includes step 1601, which defines obtaining a bitstream, where the bitstream includes a transform unit syntax. For step 1601, the transform unit syntax includes at least two chroma CBF flags (chroma-coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit, where one of the at least two chroma CBF flags specifies whether a block has residual in a corresponding color plane. FIG. 7 further illustrates step 1602, which derives a value for the luma CBF flag. The derivation of the luma CBF flag in step 1602 is based on one or any combination of the coding unit CBF flag, the value of the cu_cbf flag, and the values ​​of at least two chroma CBF flags, and / or the position of the current sub-transform unit within the current transform unit, and / or the values ​​of the luma CBF flag and the chroma CBF flag corresponding to a sub-transform unit within the current transform unit that precedes the current sub-transform unit. In this disclosure, a block having a residual means that the block contains at least one transform coefficient whose value is not zero.

[0230] FIG. 8 illustrates an encoder 20 according to the present disclosure. In FIG. 8, the encoder 20 includes an acquisition unit 2001 configured to acquire a bitstream, where the bitstream includes a transform unit syntax. The acquisition unit 2001 is configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma-coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit, where one chroma CBF flag of the at least two chroma CBF flags specifies whether the corresponding block has a residual in a corresponding color plane. The encoder 20 further includes a derivation unit 2003 configured to derive a value of the luma CBF flag based on at least the following: a value of the coding unit CBF flag, a value of the cu_cbf flag, and values ​​of the at least two chroma CBF flags. It should be understood that one or more acquisition units may be used.

[0231] FIG. 9 illustrates a decoder 30 according to the present disclosure. In FIG. 9, the decoder 30 includes an acquisition unit 3001 configured to acquire a bitstream, where the bitstream includes a transform unit syntax. The acquisition unit 3001 is configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma-coded block flags) for a chroma block corresponding to a current transform unit or a current sub-transform unit within the current transform unit, where one chroma CBF flag of the at least two chroma CBF flags specifies whether the corresponding block has a residual in a corresponding color plane. The decoder 30 further includes a derivation unit 3003 configured to derive a value of the luma CBF flag based on at least the following: the value of the coding unit CBF flag, the value of the cu_cbf flag, and the values ​​of the at least two chroma CBF flags. It should be understood that one or more acquisition units may be used.

[0232] [Mathematical Operators]

[0233] The mathematical operators used in this application are similar to those used in the C programming language, but the results of integer division and arithmetic shift operations are more precisely defined, and additional operations such as exponentiation and real division are also defined. For example, "the first" is number 0, "the second" is number 1, and so on, generally starting from 0.

[0234] [Arithmetic Operators]

[0235] The following arithmetic operators are defined: [Table 25]

[0236] [Logical Operators]

[0237] The following logical operators are defined: [Table 26]

[0238] Relational operators

[0239] The relational operators are defined as follows: [Table 27]

[0240] 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 treated as the distinct value of that syntax element or variable. The value "na" is considered unequal to any other value.

[0241] [Bitwise Operators]

[0242] The following bitwise operators are defined as follows: [Table 28]

[0243] [Assignment operator]

[0244] The following arithmetic operators are defined: [Table 29]

[0245] [Range notation]

[0246] To specify a range of values, use the following notation: [Table 30]

[0247] [Mathematical Functions]

[0248] The following mathematical functions are defined: [Table 31]

[0249] [Operation order priority]

[0250] If you do not explicitly specify precedence within an expression using parentheses, the following rules apply: -Operations with higher precedence are evaluated before operations with lower precedence. -Operations of equal precedence are evaluated in order from left to right.

[0251] The table below shows the precedence of operations from highest to lowest, with higher rankings in the table indicating higher precedence.

[0252] For operators that are also used in the C programming language, the precedence used herein is the same as that used in the C programming language. [Table 32] The precedence of the operations is from highest (top of the table) to lowest (bottom of the table).

[0253] [Text description of logical operations]

[0254] In this text, descriptions of logical operations of the following form will be described mathematically: [Table 33]

[0255] In this text, each "If....Otherwise, if...Otherwise,..." statement begins with "...as follows" or "...the following applies" and is immediately followed by "If...". The final condition in an "If .... Otherwise, if ... Otherwise,..." is always "Otherwise, ...". Alternating "If ....Otherwise, if ... Otherwise,..." statements can be identified by matching the "... as follows" or "... the following applies" with the final "Otherwise,...".

[0256] In this text, descriptions of logical operations of the following form will be written mathematically: [Table 34]

[0257] In this text, descriptions of logical operations of the following form will be written mathematically: [Table 35]

[0258] Although embodiments of the present invention are described primarily in terms of video coding, it should be noted that embodiments of coding system 10, encoder 20, and decoder 30 (and correspondingly, system 10) described herein, as well as other embodiments, may be configured for still image processing or coding, i.e., processing or coding of individual images independent of any previous or subsequent images, as in video coding. Generally, when image processing coding is limited to a single image 17, only inter-prediction units 244 (encoder) and 344 (decoder) may not be available. All other functions (also referred to as tools or techniques) of video encoder 20 and video decoder 30 may equally be used for still image processing, e.g., residual calculation 204 / 304, transform 206, quantization 208, inverse quantization 210 / 310, (inverse) transform 212 / 312, partitioning 262 / 362, intra prediction 254 / 354, and / or loop filtering 220, 320, as well as entropy coding 270 and entropy decoding 304.

[0259] Embodiments of, for example, the encoder 20 and the decoder 30, and functions described herein with reference to, for example, the encoder 20 and the decoder 30, may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over a communication medium as one or more instructions or code and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which correspond to tangible media such as data storage media, or communication media, including any medium that facilitates transfer of a computer program from one place to another, for example, according to a communication protocol. Thus, computer-readable media may generally correspond to (1) non-transitory tangible computer-readable storage media or (2) communication media, such as a signal or carrier wave. Data storage media may be any available medium that can be accessed by one or more computers or one or more processors to retrieve instructions, code, and / or data structures for implementing the techniques described in this disclosure. A computer program product may include a computer-readable medium.

[0260] By way of example, and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Additionally, any connection is properly referred to as a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included within the definition of medium. In contrast, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but instead refer to non-transitory tangible storage media. As used herein, disk and disc include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where typically, disks reproduce data magnetically and discs reproduce data optically using a laser. Combinations of the above should also be included within the scope of computer-readable media.

[0261] The 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 circuitry. Accordingly, the term "processor," as used herein, may refer to any of the foregoing structures or any other structure suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided in dedicated hardware and / or software modules configured for encoding and decoding, or incorporated into a combined codec. Additionally, the techniques may be implemented entirely in one or more circuit or logic elements.

[0262] The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC), or a set of ICs (e.g., a chipset). While various components, modules, or units are described in this disclosure to highlight functional aspects of devices configured to perform the disclosed techniques, implementation by different hardware units is not necessarily required. Rather, the various units may be combined into a codec hardware unit, as described above, in conjunction with suitable software and / or firmware, or may be provided by a collection of interoperating hardware units including one or more processors, as described above.

[0263] The present disclosure discloses the following 13 aspects.

[0264] A first aspect provides a coding method to be implemented by a decoding device or an encoding device, the method comprising: obtaining a bitstream, the bitstream including transform unit syntax (as an example, the transform unit syntax elements are coded for an entire block, or for multiple sub-transform units obtained by SBT (sub-block transform of inter-block), or coded to meet a maximum transform unit size restriction); The syntax includes at least two CBF flags for chroma blocks (as an example, the syntax for a transform unit corresponds to either a transform unit or a sub-transform unit including two chroma CBF flags: tu_cbf_cb and tu_cbf_cb (one flag for each chroma plane)), where the chroma CBF flags specify whether a particular block has residual in the corresponding color plane. The method further includes a step of deriving a value of the luma CBF flag tu_cbf_luma based on one or any combination of the value of the cu_cbf flag, the values ​​of two chroma CBF flags corresponding to the current transform unit or sub-transform unit, the position of the sub-transform unit within the transform unit, and the values ​​of the luma CBF flag and chroma CBF flag corresponding to the previous sub-transform unit within the current transform unit.

[0265] A second aspect provides a method of the first aspect, wherein a value of a luma CBF flag (e.g., a tu_cbf_luma flag) is derived based on a value of a cu_cbf flag and values ​​of two chroma CBF flags corresponding to the current transform unit.

[0266] A third aspect provides the method of the second aspect, wherein the current transform unit is not divided into sub-transform units, the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1.

[0267] A fourth aspect provides the method of the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 36]

[0268] A fifth aspect provides a method according to the first or second aspect, wherein when a current transform unit is divided by SBT, values ​​of the tu_cbf_luma flags of sub-transform units that allow a non-zero CBF flag are derived according to the following conditions: - If the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1.

[0269] A sixth aspect provides a method according to any one of the first to fifth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 37]

[0270] A seventh aspect provides the method of the first or second aspect, wherein when a current transform unit is split by sub-transform units to satisfy a maximum transform unit size restriction, a value of the tu_cbf_luma flag for a last sub-transform unit of the transform unit is derived according to the following condition: -If the value of the cu_cbf flag is 1, the values ​​of the tu_cbf_luma flag, tu_cbf_cb flag, and tu_cbf_cr flag of all sub-transform units previously coded in the current transform unit are 0, the value of the tu_cbf_cb flag of the current sub-transform unit is 0, and the value of the tu_cbf_cr flag of the current sub-transform unit is 0, the value of the tu_cbf_luma flag is derived to be 1.

[0271] An eighth aspect provides the method of any one of the first to seventh aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 38]

[0272] A ninth aspect provides the method of any one of the first to eighth aspects, wherein the coding unit syntax table and the transform tree syntax table are signaled according to the following table: [Table 39] [Table 40]

[0273] A tenth aspect provides an encoder (20) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0274] In an eleventh aspect, there is provided a decoder (30) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0275] A twelfth aspect provides a computer program product comprising program code for carrying out a method according to any one of the first to ninth aspects.

[0276] A thirteenth aspect provides a decoder or encoder, one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the decoder to perform a method according to any one of the first to ninth aspects; and Equipped with.

[0277] The present disclosure also includes the following 13 aspects.

[0278] A first aspect provides a coding method to be implemented by a decoding device or an encoding device, the method comprising: obtaining a bitstream, the bitstream including transform unit syntax (as an example, the transform unit syntax elements are coded for an entire block, or for multiple sub-transform units obtained by SBT (sub-block transform of inter-block), or coded to meet a maximum transform unit size restriction); The syntax includes at least two CBF flags for chroma blocks (as an example, the syntax for a transform unit corresponds to either a transform unit or a sub-transform unit including two chroma CBF flags: tu_cbf_cb and tu_cbf_cb (one flag for each chroma plane)), where the chroma CBF flags specify whether a particular block has residual in the corresponding color plane. The method further includes a step of deriving a value of the luma CBF flag tu_cbf_luma based on one or any combination of the value of the cu_cbf flag, the values ​​of two chroma CBF flags corresponding to the current transform unit or sub-transform unit, the position of the sub-transform unit within the transform unit, and the values ​​of the luma CBF flag and chroma CBF flag corresponding to the previous sub-transform unit within the current transform unit.

[0279] A second aspect provides a method of the first aspect, wherein a value of a luma CBF flag (e.g., a tu_cbf_luma flag) is derived based on a value of a cu_cbf flag and values ​​of two chroma CBF flags corresponding to the current transform unit.

[0280] A third aspect provides the method of the second aspect, wherein the current transform unit is not divided into sub-transform units, the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1.

[0281] A fourth aspect provides the method of the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 41]

[0282] A fifth aspect provides a method according to the first or second aspect, wherein when a current transform unit is divided by SBT, values ​​of the tu_cbf_luma flags of sub-transform units that allow a non-zero CBF flag are derived according to the following conditions: - If the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1.

[0283] A sixth aspect provides a method according to any one of the first to fifth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 42]

[0284] A seventh aspect provides the method of the first or second aspect, wherein when a current transform unit is split by sub-transform units to satisfy a maximum transform unit size restriction, a value of the tu_cbf_luma flag for a last sub-transform unit of the transform unit is derived according to the following condition: -If the value of the cu_cbf flag is 1, the values ​​of the tu_cbf_luma flag, tu_cbf_cb flag, and tu_cbf_cr flag of all sub-transform units previously coded in the current transform unit are 0, the value of the tu_cbf_cb flag of the current sub-transform unit is 0, and the value of the tu_cbf_cr flag of the current sub-transform unit is 0, the value of the tu_cbf_luma flag is derived to be 1.

[0285] An eighth aspect provides the method of any one of the first to seventh aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 43]

[0286] A ninth aspect provides the method of any one of the first to eighth aspects, wherein the coding unit syntax table and the transform tree syntax table are signaled according to the following table: [Table 44] [Table 45]

[0287] A tenth aspect provides an encoder (20) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0288] In an eleventh aspect, there is provided a decoder (30) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0289] A twelfth aspect provides a computer program product comprising program code for carrying out a method according to any one of the first to ninth aspects.

[0290] A thirteenth aspect provides a decoder or encoder, one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the decoder to perform a method according to any one of the first to ninth aspects; and Equipped with.

[0291] The present disclosure also includes the following 13 aspects.

[0292] A first aspect provides a coding method to be implemented by a decoding device or an encoding device, the method comprising: obtaining a bitstream, the bitstream including transform unit syntax (as an example, the transform unit syntax elements are coded for an entire block, or for multiple sub-transform units obtained by SBT (sub-block transform of inter-block), or coded to meet a maximum transform unit size restriction); The syntax includes at least two CBF flags for chroma blocks (as an example, the syntax for a transform unit corresponds to either a transform unit or a sub-transform unit including two chroma CBF flags: tu_cbf_cb and tu_cbf_cb (one flag for each chroma plane)), where the chroma CBF flags specify whether a particular block has residual in the corresponding color plane. The method further includes a step of deriving a value of the luma CBF flag tu_cbf_luma based on one or any combination of the value of the cu_cbf flag, the values ​​of two chroma CBF flags corresponding to the current transform unit or sub-transform unit, the position of the sub-transform unit within the transform unit, and the values ​​of the luma CBF flag and chroma CBF flag corresponding to the previous sub-transform unit within the current transform unit.

[0293] A second aspect provides a method of the first aspect, wherein a value of a luma CBF flag (e.g., a tu_cbf_luma flag) is derived based on a value of a cu_cbf flag and values ​​of two chroma CBF flags corresponding to the current transform unit.

[0294] A third aspect provides a method of the second aspect, wherein if the current transform unit is not split into sub-transform units, a cu_cbf flag is signaled in the bitstream, the value of the cu_cbf flag is equal to 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1.

[0295] A fourth aspect provides the method of the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 46]

[0296] A fifth aspect provides a method according to the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 47]

[0297] A sixth aspect provides the method of the first or second aspect, wherein when the current transform unit is divided by SBT, values ​​of the tu_cbf_luma flags of sub-transform units that allow a non-zero CBF flag are derived according to the following conditions: - The value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, then the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1.

[0298] A seventh aspect provides the method of any one of the first to sixth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 48]

[0299] An eighth aspect provides the method of any one of the first to sixth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 49]

[0300] A ninth aspect provides the method of any one of the first to eighth aspects, wherein the coding unit syntax table and the transform tree syntax table are signaled according to the following table: [Table 50] [Table 51]

[0301] A tenth aspect provides an encoder (20) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0302] In an eleventh aspect, there is provided a decoder (30) comprising processing circuitry for performing a method according to any one of the first to ninth aspects.

[0303] A twelfth aspect provides a computer program product comprising program code for carrying out a method according to any one of the first to ninth aspects.

[0304] A thirteenth aspect provides a decoder or encoder, one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the decoder to perform a method according to any one of the first to ninth aspects; and Equipped with.

[0305] The present disclosure further includes the following 14 aspects.

[0306] A first aspect provides a coding method to be implemented by a decoding device or an encoding device, the method comprising: obtaining a bitstream, the bitstream including transform unit syntax (as an example, the transform unit syntax elements are coded for an entire block, or for multiple sub-transform units obtained by SBT (sub-block transform of inter-block), or coded to meet a maximum transform unit size restriction); The syntax includes at least two CBF flags for chroma blocks (as an example, the syntax for a transform unit corresponds to either a transform unit or a sub-transform unit including two chroma CBF flags: tu_cbf_cb and tu_cbf_cb (one flag for each chroma plane)), where the chroma CBF flags specify whether a particular block has residual in the corresponding color plane. The method further includes a step of deriving a value of the luma CBF flag tu_cbf_luma based on one or any combination of the value of the cu_cbf flag, the values ​​of two chroma CBF flags corresponding to the current transform unit or sub-transform unit, the position of the sub-transform unit within the transform unit, and the values ​​of the luma CBF flag and chroma CBF flag corresponding to the previous sub-transform unit within the current transform unit.

[0307] A second aspect provides a method of the first aspect, wherein a value of a luma CBF flag (e.g., a tu_cbf_luma flag) is derived based on a value of a cu_cbf flag and values ​​of two chroma CBF flags corresponding to the current transform unit.

[0308] A third aspect provides a method of the second aspect, wherein if the current transform unit is not split into sub-transform units, a cu_cbf flag is signaled in the bitstream, the value of the cu_cbf flag is equal to 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1.

[0309] A fourth aspect provides the method of the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 52]

[0310] A fifth aspect provides a method according to the third aspect, wherein the conversion unit syntax table is signaled according to the following table: [Table 53]

[0311] A sixth aspect provides a method according to the first or second aspect, wherein when a current transform unit is divided by SBT, a value of a tu_cbf_luma flag of a sub-transform unit that allows a non-zero CBF flag is derived according to the following condition: - If the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1.

[0312] A seventh aspect provides the method of any one of the first to sixth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 54]

[0313] An eighth aspect provides the method of the first to sixth aspects, wherein the conversion unit syntax table is signaled according to the following table: [Table 55]

[0314] A ninth aspect provides the method of any one of the first to eighth aspects, wherein the coding unit syntax table and the transform tree syntax table are signaled according to the following table: [Table 56] [Table 57]

[0315] A tenth aspect is the method of any one of the first to ninth aspects, wherein if a value for tu_cbf_luma[x0][y0] does not exist, and the value for tu_cbf_luma[x0][y0] is derived according to the following conditions: [Table 58]

[0316] In an eleventh aspect, there is provided an encoder (20) comprising processing circuitry for performing a method according to any one of the first to tenth aspects.

[0317] A twelfth aspect provides a decoder (30) comprising processing circuitry for performing a method according to any one of the first to tenth aspects.

[0318] A thirteenth aspect provides a computer program product comprising program code for carrying out a method according to any one of the first to tenth aspects.

[0319] A fourteenth aspect provides a decoder or encoder, one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring the decoder to perform a method according to any one of the first to tenth aspects; and Equipped with. [Other possible items] [Item 1] A video coding method implemented by a decoding device or an encoding device, comprising: obtaining a bitstream, the bitstream comprising a transform unit syntax; obtaining values ​​of at least two chroma CBF flags (chroma coded block flags) for chroma blocks corresponding to a current transform unit or a current sub-transform unit within the current transform unit according to the transform unit syntax, wherein one chroma CBF flag of the at least two chroma CBF flags specifies whether a corresponding block has residual in a corresponding color plane; deriving a value of a luma CBF flag based at least on a value of a coding unit CBF flag, a value of a cu_cbf flag, and values ​​of at least the two chroma CBF flags; A method comprising: [Item 2] Item 10. The method of item 1, wherein the value of the luma CBF flag is further derived based on a position of the current sub-transform unit within the current transform unit. [Item 3] The transform unit syntax comprises at least two chroma CBF flags, and the step of obtaining values ​​of the at least two chroma CBF flags according to the transform unit syntax includes: 3. The method of claim 1, further comprising obtaining values ​​of at least two chroma CBF flags from the transform unit syntax. [Item 4] 4. The method of any one of items 1 to 3, wherein the luma CBF flag is a tu_cbf_luma flag. [Item 5] In the transformation unit syntax, the syntax elements of a transformation unit are: signaled to the entire block, or signaled to multiple sub-transform units obtained by inter-block sub-block transform (SBT), or Signaled to meet maximum transform unit size restrictions 5. The method according to any one of items 1 to 4. [Item 6] The current transform unit or the current sub-transform unit contains two chroma CBF flags, one for each chroma plane. 6. The method according to any one of items 1 to 5. [Item 7] 7. The method of any one of items 1 to 6, wherein if the current transform unit is not split into sub-transform units, the cu_cbf flag is signaled in the bitstream, the value of the cu_cbf flag is equal to 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1. [Item 8] a conversion unit syntax table corresponding to the conversion unit syntax, [Table 59] 8. The method of any one of items 1 to 7, wherein the signaling is performed according to [Item 9] a conversion unit syntax table corresponding to the conversion unit syntax, [Table 60] 8. The method of any one of items 1 to 7, wherein the signaling is performed according to [Item 10] If the current transform unit is divided by the sub-block transform (SBT), the value of the tu_cbf_luma flag of the sub-transform unit that allows a non-zero CBF flag is derived according to the following condition: If the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1. 7. The method according to any one of items 1 to 6. [Item 11] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 61] 11. The method of any one of items 1 to 7 and 10, wherein the signaling is performed according to [Item 12] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 62] 11. The method of any one of items 1 to 7 and 10, wherein the signaling is performed according to [Item 13] A transform tree syntax table corresponding to the transform unit syntax is signaled according to the following table: [Table 63] A coding unit syntax table corresponding to the transform tree syntax table is signaled in the following table: [Table 64] 11. The method according to any one of items 1 to 7 and 10. [Item 14] 14. The method of any one of items 8, 9 and 11 to 13, wherein treeType is equal to SINGLE_TREE. [Item 15] If the luma CBF flag is a tu_cbf_luma flag and there is no value for tu_cbf_luma[x0][y0], the value of tu_cbf_luma[x0][y0] is [Table 65] 15. The method according to any one of items 1 to 14, wherein the method is derived according to [Item 16] If the luma CBF flag is a tu_cbf_luma flag and there is no value for tu_cbf_luma[x0][y0], the value of tu_cbf_luma[x0][y0] is [Table 66] 15. The method according to any one of items 1 to 14, wherein the method is derived according to [Item 17] 17. A method according to any one of items 1 to 16, wherein tu_cbf_luma[x0][y0] equal to 1 specifies that the luma transform block contains one or more transform coefficient levels not equal to 0, and the array indices x0, y0 specify the position (x0, y0) of the top left luma sample of the considered transform block relative to the top left luma sample of the image, and the transform coefficient level is an integer quantity representing a value associated with a particular two-dimensional frequency index in the decoding process before scaling for calculation of the transform coefficient value. [Item 18] 18. An encoder comprising processing circuitry for performing the method according to any one of items 1 to 17. [Item 19] 18. A decoder comprising processing circuitry for performing the method of any one of items 1 to 17. [Item 20] 18. A program for causing a computer to carry out the method according to any one of items 1 to 17. [Item 21] one or more processors; a non-transitory computer-readable storage medium coupled to the processor and storing programming for execution by the processor, the programming, when executed by the processor, configuring a decoder to perform the method of any one of items 1 to 17; and A decoder or encoder comprising: [Item 22] an acquisition unit configured to acquire a bitstream, the bitstream including a transform unit syntax, the acquisition unit configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma coded block flags) for chroma blocks corresponding to a current transform unit or a current sub-transform unit within the current transform unit, wherein one chroma CBF flag of the at least two chroma CBF flags specifies whether a corresponding block has a residual in a corresponding color plane; a derivation unit configured to derive a value of a luma CBF flag based at least on a value of a coding unit CBF flag, a value of a cu_cbf flag, and values ​​of the at least two chroma CBF flags; An encoder comprising: [Item 23] an acquisition unit configured to acquire a bitstream, the bitstream including a transform unit syntax, the acquisition unit configured to acquire, according to the transform unit syntax, values ​​of at least two chroma CBF flags (chroma coded block flags) for chroma blocks corresponding to a current transform unit or a current sub-transform unit within the current transform unit, wherein one chroma CBF flag of the at least two chroma CBF flags specifies whether a corresponding block has a residual in a corresponding color plane; a derivation unit configured to derive a value of a luma CBF flag based at least on a value of a coding unit CBF flag, a value of a cu_cbf flag, and values ​​of the at least two chroma CBF flags; A decoder comprising: [Item 24] 24. The decoder of claim 23, wherein the value of the luma CBF flag is further derived based on a position of the current sub-transform unit within the current transform unit. [Item 25] The transform unit syntax comprises at least two chroma CBF flags, and the step of obtaining values ​​of the at least two chroma CBF flags according to the transform unit syntax includes: 25. The decoder of claim 23 or 24, comprising obtaining values ​​of at least two chroma CBF flags from the transform unit syntax. [Item 26] 26. The decoder of any one of items 23 to 25, wherein the luma CBF flag is a tu_cbf_luma flag. [Item 27] In the transformation unit syntax, the syntax elements of a transformation unit are: signaled to the entire block, or signaled to multiple sub-transform units obtained by inter-block sub-block transform (SBT), or Signaled to meet maximum transform unit size restrictions 27. A decoder according to any one of items 23 to 26. [Item 28] The transform unit or the sub-transform unit contains two chroma CBF flags, one for each chroma plane. 28. A decoder according to any one of items 23 to 27. [Item 29] 29. The decoder of any one of items 23 to 28, wherein the value of the luma CBF flag is derived based on the value of the cu_cbf flag and the values ​​of the two chroma CBF flags corresponding to the current transform unit. [Item 30] 30. A decoder according to any one of items 23 to 29, wherein if the current transform unit is not split into sub-transform units, the cu_cbf flag is signaled in the bitstream, the value of the cu_cbf flag is equal to 1, the value of the tu_cbf_cb flag is 0, the value of the tu_cbf_cr flag is 0, and then the value of the tu_cbf_luma flag of the current transform unit is derived to 1. [Item 31] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 67] 31. A decoder according to any one of items 23 to 30, signaled according to [Item 32] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 68] 31. A decoder according to any one of items 23 to 30, signaled according to [Item 33] If the current transform unit is divided by the sub-block transform (SBT), the value of the tu_cbf_luma flag of the sub-transform unit that allows a non-zero CBF flag is derived according to the following condition: If the value of the cu_cbf flag is 1, the value of the tu_cbf_cb flag is 0, and the value of the tu_cbf_cr flag is 0, the value of the tu_cbf_luma flag of the current sub-transform unit is derived to be 1. 30. A decoder according to any one of items 23 to 29. [Item 34] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 69] 34. The decoder of any one of items 23 to 30 and 33, signaled according to [Item 35] A conversion unit syntax table corresponding to the conversion unit syntax is [Table 70] 34. The decoder of any one of items 23 to 30 and 33, signaled according to [Item 36] A transform tree syntax table corresponding to the transform unit syntax is signaled according to the following table: [Table 71] A coding unit syntax table corresponding to the transform tree syntax table is signaled in the following table: [Table 72] Item 34. A decoder according to any one of items 23 to 30 and 33. [Item 37] 37. The decoder of any one of items 31, 32 and 34 to 36, wherein treeType is equal to SINGLE_TREE. [Item 38] If the luma CBF flag is a tu_cbf_luma flag and there is no value for tu_cbf_luma[x0][y0], the value of tu_cbf_luma[x0][y0] is [Table 73] 38. A decoder according to any one of items 23 to 37, derived according to [Item 39] If the luma CBF flag is the tu_cbf_luma flag and there is no value for tu_cbf_luma[x0][y0], the value of tu_cbf_luma[x0][y0] satisfies the following condition: [Table 74] 39. A decoder according to any one of items 23 to 38, derived according to [Item 40] 39. A decoder according to any one of items 23 to 39, wherein tu_cbf_luma[x0][y0] equal to 1 specifies that the luma transform block contains one or more transform coefficient levels not equal to 0, and the array indexes x0, y0 specify the position (x0, y0) of the top-left luma sample of the considered transform block relative to the top-left luma sample of the image, and the transform coefficient level is an integer quantity representing a value associated with a particular two-dimensional frequency index in the decoding process before scaling for calculation of the transform coefficient value.

Claims

1. obtaining a current transform unit or a current sub-transform unit within the current transform unit, wherein a first chroma transform block and a second chroma transform block are associated with the current transform unit or the current sub-transform unit; performing a first test to determine whether the first chroma transform block includes at least one transform coefficient level not equal to zero; obtaining a first value of a first flag based on a first result of the first determination, the first flag specifying whether the first chroma transform block includes at least one transform coefficient level not equal to zero; performing a second test to determine whether the second chroma transform block includes at least one transform coefficient level not equal to zero; obtaining a second value of a second flag based on a second result of the second determination, the second flag specifying whether the second chroma transform block includes at least one transform coefficient level not equal to zero; signaling the first value of the first flag and the second value of the second flag in a transform unit syntax; obtaining a third value of a third flag specifying whether a transformation tree structure exists; signaling the third value of the third flag in a coding unit syntax, the first value of the first flag, the second value of the second flag, and the third value of the third flag are used to derive a fourth value of a fourth flag that specifies whether a luma transform block includes at least one transform coefficient level not equal to 0; Equipped with method.

2. The method of claim 1 , wherein the fourth value of the fourth flag is further derived based on a position of the current sub-transform unit within the current transform unit.

3. In the transformation unit syntax, the elements of the transformation unit syntax are: signaled to the entire block, or signaled to multiple sub-transform units obtained by inter-block sub-block transform (SBT); or Signaled to meet maximum transform unit size restrictions The method of claim 1.

4. The method of claim 1 , wherein the first value of the first flag, when equal to one, specifies that the first chroma transform block includes at least one transform coefficient level not equal to zero.

5. The method of claim 1 , wherein the second value of the second flag, when equal to one, specifies that the second chroma transform block includes at least one transform coefficient level not equal to zero.

6. The method of claim 1 , wherein the fourth value of the fourth flag, when equal to 1, specifies that the luma transform block includes at least one transform coefficient level not equal to 0.

7. The method of claim 1 , wherein the third value of the third flag, when equal to 1, specifies that the transform tree structure exists.

8. 1. An apparatus comprising: at least one processor; one or more memories coupled to the at least one processor storing programming for execution by the at least one processor to cause the device to perform the method of any one of claims 1 to 7; Equipped with Device.

9. A method for generating a bitstream, comprising: obtaining a current transform unit or a current sub-transform unit within the current transform unit, wherein a first chroma transform block and a second chroma transform block are associated with the current transform unit or the current sub-transform unit; performing a first test to determine whether the first chroma transform block includes at least one transform coefficient level not equal to zero; obtaining a first value of a first flag based on a first result of the first determination, the first flag specifying whether the first chroma transform block includes at least one transform coefficient level not equal to zero; performing a second test to determine whether the second chroma transform block includes at least one transform coefficient level not equal to zero; obtaining a second value of a second flag based on a second result of the second determination, the second flag specifying whether the second chroma transform block includes at least one transform coefficient level not equal to zero; signaling the first value of the first flag and the second value of the second flag in a transform unit syntax; obtaining a third value of a third flag specifying whether a transformation tree structure exists; signaling the third value of the third flag in a coding unit syntax, the first value of the first flag, the second value of the second flag, and the third value of the third flag are used to derive a fourth value of a fourth flag that specifies whether a luma transform block includes at least one transform coefficient level not equal to 0; obtaining a bitstream having the transform unit syntax and the coding unit syntax; A method comprising:

10. A computer program arranged to cause a computer to carry out the method according to any one of claims 1 to 7.

Images