Encoder, decoder and corresponding method of deblocking filter adaptation

By setting boundary strengths for coding units and applying deblocking filters based on CIIP conditions, the method addresses block artifacts and enhances compression efficiency in video coding, improving image quality and memory usage.

JP7592968B2Active Publication Date: 2024-12-03HUAWEI TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
JP2023149321
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2019-01-17
Filing Date
2023-09-14
Publication Date
2024-12-03
Estimated Expiration
2040-01-16

AI Technical Summary

Technical Problem

Existing video coding technologies face challenges in achieving high compression ratios with minimal image quality sacrifice, particularly in handling block artifacts caused by combined inter/intra prediction (CIIP) in video coding units.

Method used

The method involves determining the boundary strength of coding units based on combined inter/intra prediction (CIIP) by setting specific values for boundaries between coding units and sub-coding units, and applying deblocking filters accordingly to mitigate block artifacts.

Benefits of technology

This approach enhances video quality by effectively reducing block artifacts and improving compression efficiency in video coding, particularly for coding units using CIIP, while optimizing memory usage in deblocking filter implementations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007592968000003
    Figure 0007592968000003
  • Figure 0007592968000004
    Figure 0007592968000004
  • Figure 0007592968000005
    Figure 0007592968000005
Patent Text Reader

Abstract

To provide an encoder, a decoder, and a corresponding method of deblocking filter adaptation.SOLUTION: A coding method including decoding or encoding includes the steps of: determining whether a current coding unit is predicted by applying combined inter / intra prediction (CIIP); and setting a boundary strength of a boundary of the current coding unit to a first value when determining that the current coding unit is predicted by applying the CIIP.SELECTED DRAWING: None
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] [CROSS REFERENCE TO RELATED APPLICATIONS]

[0002] This application claims priority to U.S. Provisional Application No. 62 / 793,840, filed in the U.S. Patent and Trademark Office on January 17, 2019, the entire disclosure of which is incorporated herein by reference.

[0003] TECHNICAL FIELD Embodiments of the present application relate generally to the field of image processing, and more specifically to an encoder, a decoder, and a corresponding method of deblocking filter adaptation. [Background technology]

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

[0005] The amount of video data required to render even a relatively short video can be substantial, resulting in problems when streaming or otherwise communicating the data over communication networks with limited bandwidth capacity. Thus, video data is generally compressed before being communicated over modern telecommunication networks. The size of the video can also be an issue when the video is stored on a storage device, since memory resources can be limited. Video compression devices often use software and / or hardware at the source to reduce the amount of data required to represent a digital video image by coding the video data before transmitting or storing it. The compressed data is then received at the destination by a video decompression device, which decodes the video data. With limited network resources and an ever-increasing demand for higher video quality, improved compression and decompression techniques are desirable that improve compression ratios with little or no sacrifice in image quality. Summary of the Invention

[0006] Embodiments of the present application provide an apparatus, an encoding method and a decoding method as set forth in the independent claims.

[0007] 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.

[0008] One embodiment of the present disclosure is a method of coding, where the coding includes decoding or encoding, including determining whether a current coding unit is predicted by applying Combined Inter / Intra Prediction (CIIP) and setting a boundary strength of a boundary of the current coding unit to a first value if the current coding unit is predicted by applying CIIP.

[0009] The first value may be in the range of 1 to 2. In particular, the first value may be 2. Alternatively, the first value may be 1. In the latter case, the method may further comprise incrementing the first value by 1 if it is determined that one of the following conditions is true:

[0010] At least one of the current coding unit and the neighboring coding units adjacent to the border of the current coding unit has non-zero transform coefficients.

[0011] · The absolute difference between the motion vectors used for prediction of the current coding unit and the neighboring coding unit is greater than or equal to one integer sample.

[0012] The current coding unit and neighboring coding units are predicted based on different reference pictures.

[0013] · The number of motion vectors used for prediction of the current coding unit and the neighboring coding units is different.

[0014] The method may further include determining, if the boundary of the current coding unit is a horizontal edge, whether neighboring coding units adjacent to the boundary of the current coding unit are in different coding tree units (CTUs).

[0015] The method may further include setting a boundary strength of the sub-coding unit boundary to a second value, where the current coding unit includes at least two sub-coding units and the sub-coding unit boundary is a boundary between at least two sub-coding units. The second value may in particular be 1. If the sub-coding unit boundary is an edge of a transform unit, the second value may be equal to the first value. If the sub-coding unit boundary is not an edge of a transform unit, the second value may be different from the first value.

[0016] In the above embodiment, the method may further include determining whether a boundary of the current coding unit is aligned with an 8x8 grid, and setting a boundary strength of the boundary of the current coding unit to 0 if it is determined that the boundary of the current coding unit is not aligned with the 8x8 grid.

[0017] The method may further include determining whether a boundary of the sub-coding unit is aligned with the sub-grid, where the sub-grid is a 4x4 grid or an 8x8 grid, and setting a boundary strength of the boundary of the sub-coding unit to 0 if it is determined that the boundary of the sub-coding unit is not aligned with the sub-grid.

[0018] In the above embodiment, the method may further include performing deblocking on a boundary for the luma component if a boundary strength of the boundary is greater than 0. The method may further include performing deblocking on a boundary for the chroma components if a boundary strength of the boundary is greater than 1.

[0019] In the above embodiments, if the current coding unit is predicted by applying CIIP, the current coding unit may be considered as a coding unit with intra prediction when performing deblocking.

[0020] Another embodiment of the present disclosure is an encoder comprising a processing circuit for performing a method according to any one of the above embodiments.

[0021] Another embodiment of the present disclosure is a decoder comprising processing circuitry for performing a method according to any one of the above embodiments.

[0022] Another embodiment of the present disclosure is a computer program product comprising instructions, which when executed by a computer, cause the computer to perform the method according to any one of the above embodiments.

[0023] Another embodiment of the present disclosure is a decoder, comprising one or more processors and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, the instructions, when executed by the one or more processors, configuring the decoder to perform a method according to any one of the above embodiments.

[0024] Another embodiment of the present disclosure is an encoder comprising one or more processors and a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, the instructions, when executed by the one or more processors, configuring a decoder to perform a method according to any one of the above embodiments.

[0025] The present disclosure further provides the following aspects, numbered from 1.

[0026] According to a first aspect, the present disclosure relates to a method for coding, where coding includes decoding or encoding, the method including: determining whether a current coding unit (or coding block) is predicted by applying combined inter / intra prediction, and if the current coding unit is predicted by applying combined inter / intra prediction, setting a boundary strength (Bs) of a boundary of the current coding unit to a first value, and setting a boundary strength (Bs) of a boundary of a sub-coding unit (or sub-block, or sub-partition) to a second value, where the current coding unit includes at least two sub-coding units, and the boundary of the sub-coding unit is a boundary between at least two sub-coding units.

[0027] The first value may be 2. The second value may be 1. The first value may be the same as or different from the second value. The first value may be the same as the second value if the sub-coding unit boundary is a transform unit boundary (or edge). The first value may be different from the second value if the sub-coding unit boundary is not a transform unit boundary (or edge).

[0028] The method may further include performing deblocking for a luma component if the value of Bs is greater than 0 or performing deblocking for a chroma component if the value of Bs is greater than 1, the value of Bs being one of a first value or a second value.

[0029] If the current coding unit (or block) is predicted by applying a combination of inter / intra prediction, the current coding unit may be considered a unit with intra prediction when performing deblocking.

[0030] According to a second aspect, the present disclosure relates to an encoder comprising a processing circuit for performing any one of the methods according to the first aspect.

[0031] According to a third aspect, the present disclosure relates to a decoder comprising processing circuitry for performing any one of the methods according to the first aspect.

[0032] According to a fourth aspect, the present disclosure relates to a computer program product comprising program code for performing any one of the methods according to the first aspect.

[0033] According to a fifth aspect, the present disclosure relates to a decoder 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 any one of the methods according to the first aspect.

[0034] According to a sixth aspect, the present disclosure relates to an encoder comprising one or more processors and a non-transitory computer-readable storage medium coupled to the processors and storing programming executed by the processors, the programming, when executed by the processors, configuring the encoder to perform any one of the methods according to the first aspect.

[0035] According to a seventh aspect, the present disclosure relates to a method of coding, where coding includes decoding or encoding, the method includes determining whether at least one of two blocks is a block with CIIP (or MH) prediction, the two blocks including a first block (block Q) and a second block (block P), the two blocks being associated with a boundary, setting a boundary strength (Bs) of the boundary to a first value when at least one of the two blocks is a block with CIIP prediction, and setting the boundary strength (Bs) of the boundary to a second value when neither of the two blocks is a block with CIIP prediction.

[0036] The method according to the seventh aspect of the present disclosure may be performed by an apparatus according to the eighth aspect of the present disclosure. Further features and implementation forms of the apparatus according to the eighth aspect of the present disclosure correspond to the features and implementation forms of the method according to the seventh aspect of the present disclosure.

[0037] According to a ninth aspect, the present disclosure 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 seventh aspect.

[0038] According to a tenth aspect, the present disclosure 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 seventh aspect.

[0039] According to an eleventh aspect, a computer-readable storage medium is proposed having stored thereon instructions which, when executed, cause one or more processors to configure to code video data, the instructions causing the one or more processors to perform a method according to the seventh aspect or any possible embodiment of the seventh aspect.

[0040] According to a twelfth aspect, the present disclosure 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 seventh aspect or any possible embodiment of the seventh aspect.

[0041] 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 description of the drawings]

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

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

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

[0045] [Diagram 2] FIG. 1 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the present invention.

[0046] [Diagram 3] FIG. 2 is a block diagram illustrating an example structure of a video decoder configured to implement multiple embodiments of the present invention.

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

[0048] [Diagram 5] FIG. 11 is a block diagram showing another example of an encoding device or a decoding device.

[0049] [Figure 6] 1 is an illustration of an example sub-block boundary of a coding unit.

[0050] [Figure 7] 4 is another diagram illustrating example sub-block boundaries of a coding unit.

[0051] [Figure 8] FIG. 2 illustrates division of a coding unit into four transform units.

[0052] [Figure 9] FIG. 2 illustrates the division of a CIIP block into multiple transform units.

[0053] [Figure 10]13 illustrates an example of application of a deblocking filter to samples of a sub-partition.

[0054] [Figure 11] FIG. 13 is a diagram showing adjacent blocks at a boundary.

[0055] [Figure 12] 13 is a flow chart illustrating derivation of boundary strength of a boundary according to an embodiment of the present disclosure.

[0056] [Figure 13] 1 is a flow chart illustrating the derivation of boundary strength of a boundary according to the prior art;

[0057] [Figure 14] 11 is a flow chart illustrating derivation of a boundary strength of a boundary according to another embodiment of the present disclosure.

[0058] [Figure 15] 13 is a flow chart illustrating derivation of a boundary strength of a boundary according to yet another embodiment of the present disclosure.

[0059] [Figure 16] A diagram showing sub-block edges within a coding unit in relation to an 8x8 sample grid starting from the top-left sample of the CU.

[0060] [Figure 17] A diagram illustrating sub-block edges within a coding unit in the context of an 8x8 sample grid that does not start at the top-left sample of the CU.

[0061] [Figure 18] A diagram illustrating sub-block edges within a coding unit in the context of a 4x4 sample grid.

[0062] In the following, unless expressly specified otherwise, identical reference signs refer to identical features or at least functionally equivalent features. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0063] In the following description, reference is made to the accompanying figures which form a part of this disclosure and which show, by way of illustration, certain 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 depicted in the figures. 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.

[0064] 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 particular method steps are described, the corresponding device may include one or more units, e.g., functional units, that perform one or more of the described method steps (e.g., one unit that performs the one or more steps, or multiple units that each perform one or more of the multiple steps), even if such one or more units are not explicitly described or illustrated in the figure. 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 step that performs the function of such one or more units (e.g., one step that performs the function of such one or more units, or multiple steps that each perform the function of such one or more units), even if such one or more steps are not explicitly described or illustrated in the figure. Furthermore, it is understood that features of various exemplary embodiments and / or aspects described herein may be combined with each other, unless otherwise specified.

[0065] Video coding typically refers to the processing of a series of images forming a video or a video sequence. In the field of video coding, instead of the term "image", the terms "frame" or "image" are sometimes used synonymously. Video coding (or, in general, coding) includes two parts: video encoding and video decoding. Video encoding is performed on the source side and typically involves processing the original video image (e.g., by compression) 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. The embodiments referring to "coding" of a video image (or, in general, an image) shall be understood to relate to "encoding" or "decoding" of the video image or the respective video sequence. The combination of the encoding and decoding parts is also called a codec (coding and decoding).

[0066] 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 no transmission or other data loss occurs 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. The video image cannot be completely reconstructed at the decoder, i.e. the quality of the reconstructed video image is low or poor compared to the quality of the original video image.

[0067] 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 usually partitioned into a set of non-overlapping blocks, and coding is usually performed at the block level. That is, an encoder usually processes, i.e., encodes, a video at the block (video block) level, for example, by generating a predictive block using spatial (intra-picture) and / or temporal (inter-picture) prediction, subtracting the predictive block from a current block (a block being / to be processed) to obtain a residual block, and transforming the residual block in the transform domain and quantizing the residual block to reduce (compress) the amount of data to be transmitted, while a decoder applies the reverse process compared to the encoder to the coded or compressed block to reconstruct the current block for representation. Furthermore, the encoder repeats the decoder processing loop so that both generate the same predictions (e.g., intra-prediction and inter-prediction) and / or reconstructions to process, i.e., code, subsequent blocks. In the following, embodiments of a video coding system 10, a video encoder 20, and a video decoder 30 will be described with reference to FIGS.

[0068] 1A is a schematic block diagram illustrating an example coding system 10 that may utilize techniques of the present application, such as video coding system 10 (or coding system 10 for short). 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.

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

[0070] The source device 12 comprises an encoder 20 and may further, namely, optionally comprise an image source 16 , a pre-processor (or pre-processing unit) 18 , for example an image pre-processor 18 , and a communication interface or unit 22 .

[0071] Image source 16 may comprise or be any type of image capture device, e.g., a camera for capturing real-world images, and / or any type of image generation device, e.g., a computer graphics processor for generating computer animated images, or any type of other device for obtaining and / or providing real-world images, computer-generated images (e.g., screen content, virtual reality (VR) images), and / or any combination thereof (e.g., augmented reality (AR) images). Image source may be any type of memory or storage device that stores any of the above-mentioned images.

[0072] To distinguish between the pre-processor 18 and the processing performed by the pre-processing unit 18 , the image or image data 17 may also be referred to as raw image or raw image data 17 .

[0073] The pre-processor 18 may be 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., from RGB to YCbCr), color correction, or noise removal. It can be understood that the pre-processing unit 18 may be an optional component.

[0074] Video encoder 20 may be configured to receive pre-processed image data 19 and provide encoded image data 21 (described in further detail below, e.g., with reference to FIG. 2).

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

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

[0077] The communications interface 28 of the destination device 14 may be 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 such as an encoded image data storage device, and to provide the encoded image data 21 to a decoder 30.

[0078] Communications interface 22 and communications interface 28 may be configured to transmit or receive (13) encoded image data 21 or encoded data via a direct communications link between source device 12 and destination device 14, 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 type of combination thereof.

[0079] The communications interface 22 may be configured to process the encoded image data 21 for transmission over a communications link or network in an appropriate format, for example by packaging it into packets and / or using any type of transmission coding or processing.

[0080] Communications interface 28, which is one counterpart of communications interface 22, may be configured to receive the transmitted data and process the transmitted data using any type of corresponding transmission decoding or processing and / or unpackaging to obtain encoded image data 21.

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

[0082] The decoder 30 may be 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).

[0083] The post-processor 32 of the destination device 14 may be 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 any one or more of color format conversion (e.g., from YCbCr to RGB), color correction, cropping or resampling, or any other processing, e.g., to prepare the decoded image data 31 for display, e.g., on a display device 34.

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

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

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

[0087] The encoder 20 (e.g., video encoder 20) or the decoder 30 (e.g., video decoder 30), or both the encoder 20 and the 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 circuits, hardware, dedicated to video coding, or any combination thereof. The encoder 20 may be implemented via processing circuitry 46 to embody various modules described with respect to the encoder 20 of FIG. 2 and / or any other encoder system or subsystem described herein. The decoder 30 may be implemented via processing circuitry 46 to embody various modules described with respect to the 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. Where these techniques are implemented partially in software, as shown in Figure 5, a device may store instructions for the software on a suitable non-transitory computer-readable storage medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure. Video encoder 20 and video decoder 30 may be integrated into a single device, for example, as part of a combined encoder / decoder (codec), as shown in Figure 1B.

[0088] 1B includes processing circuitry implementing both video encoder 20 and video decoder 30. Additionally, one or more imaging devices 41, such as a camera for capturing real-world images, an antenna 42, one or more memory stores 44, one or more processors 43, and / or a display device 45, such as display device 34 described above, may be provided as part of video coding system 40.

[0089] Source device 12 and destination device 14 may include 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 a content delivery server), a broadcast receiving device, or a broadcast transmitting device, and may use no operating system or any type of operating system. In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices.

[0090] In some cases, the video coding system 10 shown in FIG. 1A is merely an example, and the techniques of the present application may be applied to video coding systems (e.g., video encoding or video decoding) that do not necessarily include any data communication between the encoding device and the decoding device. In other examples, data may be retrieved from local memory, streamed over a network, etc. A video encoding device may encode data and store it in memory, and / or a video decoding device may retrieve data from memory and decode it. 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 data from memory and decode it.

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

[0092] [Encoder and encoding method]

[0093] 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 an 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 (line) buffer 216, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy coding unit 270, and an output 272 (or an 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 as shown in FIG. 2 may also be referred to as a hybrid video encoder, or a video encoder related to a hybrid video codec.

[0094] The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, and the mode selection unit 260 may be considered to form 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 (line) 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 considered to form a backward signal path of the video encoder 20, which 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 may also be considered to form a “built-in decoder” of the video encoder 20.

[0095] [Image & Image Segmentation (Image & Block)]

[0096] The encoder 20 may be configured to receive, for example, via an input 201, an image 17 (or image data 17), for example an image of a sequence 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 refers to the image 17. The image 17 may also be called the current image or the image to be coded (especially in video coding, which distinguishes the current image from other images, for example previously encoded and / or decoded images of the same video sequence, i.e. a video sequence which also includes the current image).

[0097] A (digital) image is or may be considered as a two-dimensional array or matrix of samples with intensity values. The samples in the array may also be called pixels (a shortened form of 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 usually employed for color representation; that is, an image may be represented as or contain three sample arrays. In an RBG format or color space, an image contains corresponding red, green and blue sample arrays. However, in video coding, each pixel is usually represented in a luminance and chrominance format or color space, e.g., YCbCr, which contains 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 the brightness or gray level intensity (e.g., as in a grayscale image), and the two chrominance (or chroma for short) components Cb and Cr represent the chromaticity or color information components. Consequently, 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 may be converted or transformed into YCbCr format, or vice versa. This process is also known as color transformation or conversion. If the image is monochrome, the image may include only a luminance sample array. Consequently, an image may be, for example, an array of luma samples in 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.

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

[0099] 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.

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

[0101] An embodiment of the video encoder 20 as shown in FIG. 2 may be configured to code the image 17 block-by-block, eg, encoding and prediction are performed for each block 203.

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

[0103] An embodiment of video encoder 20 as shown in FIG. 2 may further be configured to partition and / or encode an image by 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 and / or encoded using one or more tile groups (typically non-overlapping), where each tile group may include one or more blocks (e.g., CTUs) or one or more tiles, where each tile may be rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., full or partial blocks.

[0104] [Residual calculation]

[0105] The residual calculation unit 204 may be configured to calculate the residual block 205 (also referred to as 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 sample values ​​of the prediction block 265 sample-by-sample (pixel-by-pixel) from sample values ​​of the image block 203 to obtain the residual block 205 in the sample domain.

[0106] [conversion]

[0107] 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, which may also be referred to as transform residual coefficients, represent the residual block 205 in the transform domain.

[0108] The transform processing unit 206 may be configured to apply an integer approximation of a DCT / DST, such as a transform specified in H.265 / HEVC. Compared to an orthogonal DCT transform, such an integer approximation is typically scaled by a certain factor. In order to respect the norm of the residual block processed in the forward transform and inverse transform, a further scaling factor is applied as part of the transform process. The scaling factor is typically selected based on certain constraints, such as a scaling factor that is a power of two of the shift operation, a bit depth of the transform coefficients, a trade-off between accuracy and implementation cost, and the like. For example, a certain scaling factor may be specified for the inverse transform, e.g., by the inverse transform processing unit 212 (and the 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.

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

[0110] [Quantization]

[0111] 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.

[0112] In the quantization process, the bit depth associated with some or all of the transform coefficients 207 may be reduced. For example, during quantization, an n-bit transform coefficient may be truncated to an m-bit transform coefficient, where n is greater than m. The degree of quantization may be modified 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 a finer quantization, and a larger quantization step size corresponds to a coarser quantization. The applicable quantization step sizes may be indicated by a quantization parameter (QP). The quantization parameter may be, for example, an index of 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 include division by the quantization step size, and corresponding and / or inverse dequantization, e.g., by the inverse quantization unit 210, may include multiplication by the quantization step size. Some standards, e.g., HEVC, embodiments may be configured to use a quantization parameter to determine the quantization step size. In general, the quantization step size may be calculated based on the quantization parameter using a fixed-point approximation of an equation that includes a division. An additional scaling factor may be introduced in the quantization and dequantization to restore the norm of the residual block, which may be modified due to the scaling used in the fixed-point approximation of the quantization step size and quantization parameter equations. In one exemplary implementation, the scaling of the inverse transform and the 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 the loss increases as the quantization step size increases.

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

[0114] [Dequantization]

[0115] 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, which may also be referred to as dequantized residual coefficients 211, correspond to the transform coefficients 207, although they are typically not identical to the transform coefficients due to losses due to quantization.

[0116] [Inverse Transformation]

[0117] The inverse transform processing unit 212 is configured to apply an inverse transform of the transform applied by the transform processing unit 206, for example 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.

[0118] [Reconfigure]

[0119] The reconstruction unit 214 (e.g., an adder or analog adder 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 the sample values ​​of the reconstructed residual block 213 and the sample values ​​of the prediction block 265 sample by sample, to obtain a reconstructed block 215 in the sample domain.

[0120] [filtering]

[0121] The loop filter unit 220 (or "loop filter" 220 for short) is configured to filter the reconstructed block 215 to obtain a filtered block 221, or in general, to filter the reconstructed samples to obtain filtered samples. The loop filter unit may be configured to smooth pixel transitions or otherwise improve video quality. The loop filter unit 220 may include one or more loop filters, such as a deblocking filter, a sample adaptive offset (SAO) filter, or one or more other filters, e.g., a bilateral filter, an adaptive loop filter (ALF), a sharpening, smoothing filter, or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is illustrated in FIG. 2 as an in-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 reconstructed block 221.

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

[0123] [Decoded image buffer]

[0124] The decoded picture buffer (DPB) 230 may be a memory that stores reference pictures, or generally reference image data, 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 DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (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 further be 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, e.g., 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) for inter prediction. The decoded picture buffer (DPB) 230 may be configured to store one or more unfiltered reconstructed blocks 215, for example in the case where the reconstructed 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 these reconstructed blocks or samples.

[0125] [Mode Selection (Segmentation & Prediction)]

[0126] The mode selection unit 260 comprises 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, e.g., an original block 203 (current block 203 of current image 17), and reconstructed image data, e.g., filtered and / or unfiltered reconstructed samples or blocks of the same (current) image and / or from one or more previously decoded images, e.g., from the decoded image buffer 230 or other buffers (e.g., line buffer 216). The reconstructed image data is used as reference image data for prediction, e.g., inter prediction or intra prediction, to obtain a prediction block 265 or a predictor 265. In particular, a reference sample 217 from the line buffer 216 may be used by the intra prediction unit 254.

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

[0128] An embodiment 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, i.e., the smallest residual (smallest residual means compression more suitable for transmission or storage) or the smallest signaling overhead (smallest signaling overhead means compression more suitable for transmission or storage), or takes into account both, or a 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. Terms such as "best," "minimum," "optimum," etc. in this context do not necessarily refer to a general "best," "minimum," "optimum," etc., but may also refer to the achievement of a termination or selection criterion, such as a value exceeding or falling below a threshold or other constraint that reduces complexity and processing time, which may lead to a "suboptimal selection."

[0129] That is, the partitioning unit 262 may be configured to partition the block 203 into smaller block partitions or sub-blocks (which also form blocks) using, for example, quad-tree partitioning (QT), binary-tree partitioning (BT), or ternary-tree partitioning (TT), or any combination thereof, and to perform prediction on each of these block partitions or sub-blocks, where the mode selection includes selecting a tree structure of the partitioned block 203, and a prediction mode is applied to each of these block partitions or sub-blocks.

[0130] The partitioning (eg, by partitioning unit 262) and prediction processes (by inter prediction unit 244 and intra prediction unit 254) performed by the exemplary video encoder 20 are described in more detail below.

[0131] [Partitioning]

[0132] The partitioning unit 262 may partition (or split) the current block 203 into smaller partitions, e.g., smaller blocks of square or rectangular size. These smaller blocks (sometimes also called sub-blocks) may be further partitioned into even smaller partitions. This is also called tree partitioning or hierarchical tree partitioning, e.g., a root block at root tree level 0 (hierarchical level 0, depth 0) may be partitioned recursively, e.g., into two or more blocks at the next lower tree level, e.g., nodes at tree level 1 (hierarchical level 1, depth 1), which may 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 is terminated, e.g., because a termination criterion is met, e.g., a maximum tree depth or a minimum block size is reached. Blocks that are not further partitioned are also called leaf blocks or leaf nodes of the tree. A tree that uses a partitioning into two partitions is called a binary tree (BT), a tree that uses a partitioning into three partitions is called a ternary tree (TT), and a tree that uses a partitioning into four partitions is called a quad tree (QT).

[0133] As mentioned above, the term "block" as used herein may be 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), or 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).

[0134] For example, a coding tree unit (CTU) may be or include a CTB of luma samples and two corresponding CTBs of chroma samples for an image having three sample arrays, or a CTB of samples of an image coded using three separate color planes and syntax structures used for coding monochrome images or samples. Correspondingly, a coding tree block (CTB) may be an N×N block of samples for some value N, such that the division of components into CTBs is partitioning. A coding unit (CU) may be or include a coding block of luma samples and two corresponding coding blocks of chroma samples for an image having three sample arrays, or a coding block of samples of an image coded using three separate color planes and syntax structures used for coding monochrome images or samples.

[0135] Accordingly, a coding block (CB) may be an M×N block of samples for some values ​​M and N, such that the division of the CTB into coding blocks is a partition.

[0136] For example, in some embodiments according to HEVC, a coding tree unit (CTU) may be divided into CUs by using a quadtree structure, which is denoted 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 may be further divided into one, two, or four PUs according to the partition type of the PU. Within one PU, the same prediction process is applied, and related information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the partition type of the PU, the CU may be partitioned into transform units (TUs) according to another quadtree structure similar to the coding tree of the CU.

[0137] For example, in an embodiment according to the latest video coding standard currently under development, called Versatile Video Coding (VVC), a combined quad-tree and binary tree (QTBT) partitioning is used, for example, for coding block partitioning. In the QTBT block structure, the shape of a CU can be either square or rectangular. For example, a coding tree unit (CTU) is first partitioned with a quad-tree structure. The quad-tree leaf nodes are further partitioned with a binary tree or a ternary or triple tree structure. The leaf nodes of the partitioning tree are called coding units (CUs), and their partitions are used for prediction and transformation processes without any further partitioning. This means that CUs, PUs, and TUs have the same block size in the QTBT coding block structure. In parallel, multiple partitions, for example, ternary tree partitions, may be used with the QTBT block structure.

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

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

[0140] [Intra prediction]

[0141] The set of intra prediction modes may include 35 different intra prediction modes, e.g., omnidirectional modes such as DC (or mean) mode and planar mode, or directional modes, e.g., as defined in HEVC, or may include 67 different intra prediction modes, e.g., omnidirectional modes such as DC (or mean) mode and planar mode, or directional modes, e.g., as defined for VVC.

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

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

[0144] [Inter prediction]

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

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

[0147] The inter prediction unit 244 may include 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 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, e.g., reconstructed blocks of one or more previously decoded images 231, for motion estimation. By way of example, a video sequence may include the current image and the previously decoded image 231, or, i.e., the current image and the previously decoded image 231 may be part of or form a series of images forming a video sequence.

[0148] The encoder 20 may be configured to select a reference block from a plurality of reference blocks of the same or different ones of the plurality of previously decoded 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 as an inter prediction parameter to the motion estimation unit, which offset is also called a motion vector (MV).

[0149] The motion compensation unit may be configured to obtain, e.g., receive, inter prediction parameters, and may be configured to 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 include fetching or generating a prediction block based on a motion / block vector determined by motion estimation, and possibly performing interpolation to sub-pixel accuracy. Interpolation filtering may generate additional pixel samples from known pixel samples, which may increase the number of prediction block candidates that can be used to code the image block. Upon receiving the motion vector of 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 multiple reference image lists.

[0150] The motion compensation unit may generate syntax elements associated with blocks and video slices that are used by video decoder 30 in decoding image blocks of the video slices. 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 generated or used.

[0151] [Entropy coding]

[0152] The 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 partitioning entropy (PIPE) coding, or another entropy encoding method or technique), or bypass (no compression), to the quantized coefficients 209, inter-prediction parameters, intra-prediction parameters, loop filter parameters, and / or other syntax elements to obtain encoded image data 21, which may be output, for example, via an output 272 in the form of an encoded bitstream 21, so that, for example, the video decoder 30 may receive and use the parameters for decoding. The encoded bitstream 21 may be transmitted to the video decoder 30 or stored in a memory for later transmission or retrieval by the video decoder 30. Other structural variations of the video encoder 20 may also be used to encode the video stream. For example, a non-transform-based encoder 20 may directly quantize the residual signal for a particular block or frame without using the transform processing unit 206. In another implementation, the encoder 20 may have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.

[0153] [Decoder and decoding method]

[0154] 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), e.g., encoded by encoder 20, to obtain a decoded image 331. The encoded image data or bitstream includes information for decoding the encoded image data, e.g., data representing image blocks and associated syntax elements of an encoded video slice (and / or tile group or tile).

[0155] In the example of Figure 3, the 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., an analog adder 314), a (line) buffer 316, a loop filter 320, a decoded picture buffer (DPB) 330, a mode application unit 360, an inter prediction unit 344, and an intra prediction unit 354.

[0156] Inter prediction unit 344 may be or may include a motion compensation unit. Video decoder 30, in some examples, may perform a generally inverse decoding path relative to the encoding path described with respect to video encoder 20 of FIG.

[0157] As described with respect to encoder 20, inverse quantization unit 210, inverse transform processing unit 212, reconstruction unit 214, (line) buffer 216, loop filter 220, decoded picture buffer (DPB) 230, inter prediction unit 244, and intra prediction unit 254 are also considered to form a “built-in decoder” of video encoder 20. Consequently, inverse quantization unit 310 may be identical in function to inverse quantization unit 210, inverse transform processing unit 312 may be identical in function to inverse transform processing unit 212, reconstruction unit 314 may be identical in function to reconstruction unit 214, (line) buffer 316 may be identical in function to (line) buffer 216 that provides reference samples 317 to intra prediction unit 354, loop filter 320 may be identical in function to loop filter 220, and decoded picture buffer 330 may be identical in function to decoded picture buffer 230. Accordingly, the descriptions provided for the respective units and functions of the video encoder 20 apply mutatis mutandis to the respective units and functions of the video decoder 30.

[0158] [Entropy Decoding]

[0159] The entropy decoding unit 304 is configured to analyze the bitstream 21 (or, in general, the coded image data 21) and, for example, perform entropy decoding on the coded image data 21 to obtain, for example, the quantized coefficients 309 and / or the decoded coding parameters 366, for example, any or all of the inter prediction parameters (e.g., reference image index and motion vectors), intra prediction parameters (e.g., intra prediction mode or index), 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 as described with respect to the entropy encoding unit 270 of the encoder 20. The entropy decoding unit 304 may further be configured to provide the inter prediction parameters, intra prediction parameters, and / or other syntax elements to the mode selection unit 360 and other parameters to other units of the decoder 30. The video decoder 30 may receive syntax elements at a video slice level and / or a 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.

[0160] [Dequantization]

[0161] Inverse quantization unit 310 may be configured to receive a quantization parameter (QP) (or information related to inverse quantization, in general) and quantized coefficients from encoded image data 21 (e.g., by parsing and / or decoding, e.g., in entropy decoding unit 304), and 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 include 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.

[0162] [Inverse Transformation]

[0163] The inverse transform processing unit 312 may be configured to receive the dequantized coefficients 311, also referred to as transform coefficients 311, and apply a transform to the dequantized coefficients 311 to obtain a reconstructed residual block 313 in the sample domain. The reconstructed residual block 313 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 analyzing and / or decoding in the entropy decoding unit 304) to determine the transform to be applied to the dequantized coefficients 311.

[0164] [Reconfigure]

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

[0166] [filtering]

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

[0168] [Decoded image buffer]

[0169] The decoded video block 321 of the image is 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 or respective display.

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

[0171] [prediction]

[0172] 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 intra prediction unit 254, performing a partitioning or partitioning decision and a prediction based on partitioning parameters and / or prediction parameters or respective information received from the encoded image data 21 (e.g., by analyzing and / or decoding in the entropy decoding unit 304). The mode selection unit 360 may be configured to perform prediction (intra prediction or inter prediction) for each block based on the reconstructed image, block, or respective sample (filtered or unfiltered) to obtain a prediction block 365. Furthermore, a reference sample 317 from the line buffer 316 may be used by the intra prediction unit 354.

[0173] If the video slice or picture is coded as an intra-coded (I) slice, the intra prediction unit 354 of the mode selection unit 360 is configured to generate a prediction 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 picture. If the video slice or picture 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 selection unit 360 is configured to generate a prediction 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, a prediction block may be generated from one of multiple reference pictures in one of multiple reference picture lists. The video decoder 30 may construct the reference picture lists, List 0 and List 1, based on the reference pictures stored in the DPB 330 using a default construction technique. The same or similar techniques may be applied to or with embodiments that use tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or as an alternative to slices (e.g., video slices), e.g., video may be coded using I, P, or B tile groups and / or tiles.

[0174] Mode selection unit 360 is configured to determine prediction information for video / image blocks of a current video slice by analyzing motion vectors and other syntax elements, and to use the prediction information to generate a predictive block for a current video block being decoded. For example, mode selection unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra prediction or inter prediction) to be used to code video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), construction information regarding one or more of the reference image lists for the slice, a motion vector for each inter coded video block of the slice, an inter prediction state 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 approaches may be applied to or with embodiments that use tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or as an alternative to slices (e.g., video slices), e.g., video may be coded using I, P, or B tile groups and / or tiles.

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

[0176] An embodiment of the video decoder 30 as shown in FIG. 3 may be configured to partition and / or decode an image by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), and an image may be partitioned into one or more tile groups (usually non-overlapping) and decoded using one or more tile groups, and each tile group may include one or more blocks (e.g., CTUs) or one or more tiles, and each tile may be rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., full or partial blocks. Other variations of the video decoder 30 may be used to decode the encoded image data 21. For example, the decoder 30 may generate an output video stream without using a loop filtering unit 320. For example, a non-transform-based decoder 30 may directly inverse quantize a residual signal without using an 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.

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

[0178] It should be noted that further operations may be applied to the derived motion vectors of the current block (including but not limited to control point motion vectors in affine mode, sub-block motion vectors in affine mode, planar mode, ATMVP mode, and temporal motion vectors, etc.). For example, the value of the motion vector is restricted to a predefined range according to its representation bit number. If the representation bit number of the motion vector is bitDepth, its range is -2^(bitDepth-1) to 2^(bitDepth-1)-1, where "^" means exponentiation. For example, if bitDepth is set equal to 16, its range is -32768 to 32767, and if bitDepth is set equal to 18, its range is -131072 to 131071. For example, the value of the derived motion vector (e.g., MV of four 4x4 sub-blocks in one 8x8 block) is restricted such that the maximum difference between the integer parts of the MV of the four 4x4 sub-blocks does not exceed N pixels, e.g., does not exceed 1 pixel.

[0179] In the following description, two methods are provided for constraining motion vectors according to bitDepth.

[0180] Method 1: Remove the overflow MSB (most significant bit) using the following calculation.

[0181] ux=(mvx+2 bitDepth )%2 bitDepth (1)

[0182] mvx=(ux>=2 bitDepth-1 )?(ux-2 bitDepth ):ux (2)

[0183] uy=(mvy+2 bitDepth )%2 bitDepth (3)

[0184] mvy=(uy>=2 bitDepth-1 )?(uy-2 bitDepth ):uy (4)

[0185] Here, mvx is the horizontal component of the motion vector of the image block or sub-block, mvy is the vertical component of the motion vector of the image block or sub-block, and ux and uy denote the respective intermediate values.

[0186] For example, if the value of mvx is −32769, then after applying equation (1) and equation (2), the resulting value is 32767. In computer systems, decimal numbers are stored as two's complement numbers.

[0187] The two's complement of -32769 is 1, 0111, 1111, 1111, 1111 (17 bits). The MSBs are then discarded, so the resulting two's complement numbers are 0111, 1111, 1111, 1111 (decimal 32767), which is the same as the output by applying equations (1) and (2).

[0188] ux=(mvpx+mvdx+2 bitDepth )%2 bitDepth (5)

[0189] mvx=(ux>=2 bitDepth-1 )?(ux-2 bitDepth ):ux (6)

[0190] uy=(mvpy+mvdy+2 bitDepth )%2 bitDepth (7)

[0191] mvy=(uy>=2 bitDepth-1 )?(uy-2 bitDepth ):uy (8)

[0192] As shown in equations (5) through (8), these operations may be applied during the summation of the motion vector predictor mvp and the motion vector difference mvd.

[0193] Method 2: Remove the overflow MSB by clipping the value.

[0194] vx=Clip3(-2 bitDepth-1,2 bitDepth-1 -1,vx)

[0195] vy=Clip3(-2 bitDepth-1 ,2 bitDepth-1 -1,vy)

[0196] where vx is the horizontal component of the motion vector of the image block or sub-block, vy is the vertical component of the motion vector of the image block or sub-block, x, y, and z correspond to the three input values ​​of the MV clipping process respectively, and the definition of the function Clip3 is as follows:

[0197]

number

[0198] 4 is a schematic diagram of a video coding device 400 according to an embodiment of the present disclosure. The video coding device 400 is suitable for implementing the disclosed embodiments as described below. 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.

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

[0200] The processor 430 may be implemented in hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGA, ASIC, and DSP. The processor 430 may be in communication with the ingress port 410, the receiving unit 420, the transmitting unit 440, the egress port 450, and the memory 460. The processor 430 may include a coding module 470. The coding module 470 implements the embodiments disclosed above and below. For example, the coding module 470 may implement, process, prepare, or provide 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 transformation of the video coding device 400 into different states. Alternatively, the coding module 470 may be implemented as instructions stored in the memory 460 and executed by the processor 430.

[0201] Memory 460 may comprise one or more disks, tape drives, and solid state drives, and may be used to store programs when the programs are selected for execution, and as an overflow data storage device 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).

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

[0203] The processor 502 in the device 500 may be a central processing unit. Alternatively, the processor 502 may be any other type of device or devices now existing or later developed that can manipulate or process information. Although the disclosed implementations may be implemented with a single processor as shown, e.g., processor 502, advantages of speed and efficiency may be realized using more than one processor.

[0204] In some implementations, the memory 504 in the apparatus 500 may be a read only memory (ROM) device or a random access memory (RAM) device. Any other suitable type of storage device may be used as the memory 504. The memory 504 may include code and data 506 that is accessed by the processor 502 using a bus 512. The memory 504 may further include an operating system 508 and application programs 510, which include at least one program that enables the processor 502 to perform the methods described herein.

[0205] For example, application programs 510 may include application 1 through application N, which further include a video coding application that performs the methods described herein.

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

[0207] Although depicted here as a single bus, the bus 512 of device 500 may be comprised of multiple buses. Additionally, secondary storage 514 may be directly coupled to the other components of device 500 or may be accessed over a network, and may comprise a single integrated unit, such as a memory card, or multiple units, such as multiple memory cards.

[0208] Additionally, the apparatus 500 may include an image sensing device 520 and / or a sound sensing device 522. Thus, the apparatus 500 may be implemented in a wide variety of configurations.

[0209] [Combined Inter / Intra Prediction (CIIP)]

[0210] Traditionally, coding units are either intra predicted (using reference samples in the same picture) or inter predicted (using reference samples in other pictures). In combined inter / intra prediction, these two prediction techniques are combined. Hence, it is sometimes called multiple hypothesis (MH) prediction. When combined inter / intra prediction is enabled, the intra-predicted and inter-predicted samples are applied with weights, so that the final prediction is derived as a weighted average of the predicted samples.

[0211] A flag, namely the CIIP flag, is used to indicate when a block is coded with combined inter / intra prediction.

[0212] A block coded with CIIP may be further divided into several sub-blocks, as shown in Figures 6 and 7. In one example, the sub-blocks are derived by dividing the block into horizontal sub-blocks, i.e., vertically, each sub-block is the same width as the original block but only ¼ the height of the original block.

[0213] In one example, the sub-blocks are derived by dividing a block into vertical sub-blocks, i.e., horizontally, where each sub-block is the same height as the original block but only 1 / 4 the width of the original block.

[0214] CIIP may cause block artifacts because CIIP contains the result of intra prediction, which usually has more residual signal. Block artifacts occur not only at the boundaries of CIIP blocks, but also at sub-block edges within CIIP blocks, such as vertical sub-block edges A, B, and C in FIG. 6. Horizontal sub-block edges can be identified accordingly. To remove block artifacts, the sub-block edges within the CIIP block may be unblocked, as shown in FIG. 7.

[0215] Although block artifacts can occur both at CIIP block boundaries and at sub-block edges within CIIP blocks, the distortion caused by these two boundaries may be different and different boundary strengths may be required.

[0216] Sub-block edges may result from the CIIP itself. For example, if the intra prediction mode of a CIIP block is a horizontal mode, then vertical partitioning as shown in Figure 6 is applied, resulting in three sub-block edges.

[0217] However, sub-block edges can also result from TU (transform unit) size limitations. In VTM3.0 (Versatile Video Coding Test Model 3.0), the maximum TU size is 64x64 samples. If a CU (coding unit) is 128x128 samples, it is split into four TUs as shown in Figure 8, resulting in four TU boundaries. As a result, the transform is applied with a granularity of 64x64. The TU boundaries shown as dashed lines need to be deblocked.

[0218] Furthermore, when certain coding tools (e.g., sub-block transform) are applied, TU edges may occur within a CU processed by CIIP prediction, such as shown in Figure 9. A coding unit coded with CIIP may be further divided into multiple transform units. Thus, the TU boundaries highlighted as dashed lines in Figure 9 represent the internal TU edges within the CIIP unit. These internal TU edges within the CIIP unit also need to be deblocked.

[0219] In the remainder of the description, the following terminology is used:

[0220] CIIP block: Coding block predicted by applying CIIP

[0221] Intra Block: A coding block predicted by applying intra prediction instead of CIIP.

[0222] Inter-block: A coding block predicted by applying inter-prediction instead of CIIP.

[0223] [Deblocking Filter and Boundary Strength]

[0224] Video coding schemes such as HEVC and VVC are designed around the successful principle of block-based hybrid video coding. Using this principle, an image is first partitioned into blocks, and then each block is predicted by using intra-image or inter-image prediction. These blocks are coded with respect to neighboring blocks to approximate the original signal with a certain degree of similarity. Since only the coded blocks approximate the original signal, discontinuities may occur at the boundaries of the predicted and transformed blocks due to differences between the approximations. These discontinuities are attenuated by the deblocking filter. Figure 10 shows an example of the application of the deblocking filter to the samples of a subpartition. If the size of the subpartition is smaller than 8 samples orthogonal to the deblocking direction, a weak filer is used that uses only 3 samples in the decision process and modifies one sample.

[0225] The decision of whether to filter a block boundary uses bitstream information such as prediction mode and motion vectors. In some coding conditions, the probability of creating strong block artifacts increases, which is represented by a so-called boundary strength (Bs or BS) variable that is assigned to all block boundaries and determined as in Table 1.

[0226] [Table 1]

[0227] Deblocking is applied only to block boundaries where Bs is greater than 0 for the luma component and greater than 1 for the chroma components. Higher values ​​of Bs allow stronger filtering by using higher clipping parameter values. The derivation of Bs reflects the probability that the strongest block artifacts will appear at intra-predicted block boundaries.

[0228] Usually, the two adjacent blocks of a boundary are labeled P and Q, as shown in Figure 11. This figure depicts the case of a vertical boundary. If a horizontal boundary is considered, Figure 11 should be rotated 90 degrees clockwise, with P being the top block and Q being the bottom block.

[0229] [Constructing a list of most likely modes]

[0230] Most Probable Mode (MPM) lists are used in intra-mode coding to improve coding efficiency. Due to the large number of intra-modes (e.g., 35 in HEVC and 67 in VVC), the intra-mode of the current block is not directly signaled. Instead, the most probable mode list of the current block is built based on the intra-prediction modes of its neighboring blocks. Since the intra-mode of the current block is related to its neighbors, the MPM list usually provides a good prediction, as its name (most probable mode list) suggests. Hence, the intra-mode of the current block is more likely to be in that MPM list. Thus, to derive the intra-mode of the current block, only the index of the MPM list is signaled. Compared to the total number of intra-modes, the length of the MPM list is much shorter (e.g., a 3-MPM list is used in HEVC and a 6-MPM list is used in VVC). Thus, fewer bits are required for coding the intra-mode. A flag (mpm_flag) is used to indicate whether the intra-mode of the current block belongs to that MPM list. If it is true, the MPM list can be used to index the intra mode of the current block. Otherwise, the intra mode is directly signaled using a binarized code. In both VVC and HEVC, the MPM list is built based on its left and top neighbors. If the left and top neighbors of the current block are not available for prediction, a default mode list is used.

[0231] [Motion Vector Prediction]

[0232] Motion vector prediction is a technique used in coding of motion data. A motion vector typically has two components, x and y, which refer to the horizontal and vertical motion, respectively. The motion vector of a current block is typically correlated with the motion vectors of neighboring blocks in the current or previously coded image, because neighboring blocks are more likely to correspond to the same moving object with similar motion, and the object motion is less likely to change suddenly over time.

[0233] As a result, using the motion vectors of neighboring blocks as predictors reduces the size of the signaled motion vector difference. Motion vector predictors (MVPs) are typically derived from already decoded motion vectors from spatially and / or temporally neighboring blocks in the co-located image.

[0234] If a block is determined to be predicted by applying CIIP, its final predicted samples are based partly on intra-predicted samples. Since intra-prediction is also included, the residual coefficients and transform coefficients are generally larger compared to inter-blocks (mvd, merge, skip). Therefore, when these multiple hypothesis (MH or MHIntra) blocks, i.e., CIIP blocks, are adjacent to other blocks, there will be more breaks across the boundary. In HEVC and VVC, if one of the two adjacent blocks of a boundary is intra-predicted, a strong deblocking filter is applied to this boundary, and the parameter of boundary strength (BS) is set to 2 (strongest).

[0235] However, VTM3.0 does not take into account potential block artifacts due to blocks predicted by CIIP. The boundary strength derivation still considers blocks with CIIP as inter-blocks. Under certain circumstances, such processing techniques may result in poor subjective and objective quality.

[0236] The embodiments of the present disclosure provide several alternatives for incorporating CIIP blocks to improve the deblocking filter, where the derivation of the boundary strength of a particular boundary is influenced by the CIIP block.

[0237] The Versatile Video Coding Reference (Draft 3) is defined as VVC Draft 3.0 and can be found via the following link:

[0238] http: / / phenix.it-sudparis.eu / jvet / doc_end_user / documents / 12_Macao / wg11 / JVET-L1001-v3.zip.

[0239] Embodiment 1:

[0240] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be determined as follows:

[0241] 12, if at least one of the P block and the Q block is a block with CIIP (MHIntra Prediction), the boundary strength parameter of this boundary is set to a first value. For example, the first value may be equal to 2.

[0242] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block and the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0243] If neither P nor Q blocks are predicted by applying CIIP, and if both P and Q blocks are predicted by applying inter prediction, the boundary strength is determined to be less than 2. The exact value of the boundary strength is determined following further conditional evaluation. The derivation of the boundary strength for this boundary is shown in Figure 12 and follows the specifications in Table 1.

[0244] More specifically, if at least one of the P block and the Q block has non-zero transform coefficients, the boundary strength is determined to be equal to 1. Similarly, if different reference pictures are used in the inter prediction of the P block and the Q block or the number of motion vectors of the P block and the Q block are different, the boundary strength is determined to be equal to 1. Furthermore, if the absolute difference between the motion vectors of the P block and the Q block is greater than or equal to one integer luma sample for at least one of the horizontal and vertical components of the motion vector, the boundary strength is determined to be equal to 1.

[0245] For comparison, the method defined in the VVC or ITU-H.265 video coding standard is shown in Fig. 13. The determination of the boundary strength according to the present embodiment, when neither P nor Q blocks are predicted by applying CIIP, corresponds to the known method of Fig. 13.

[0246] · The pixel samples contained in the P and Q blocks are filtered by applying a deblocking filter according to the boundary strength determined as described above.

[0247] Embodiment 2:

[0248] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks) as shown in FIG. 14, the boundary strength may alternatively be derived as follows:

[0249] If at least one of the P block and the Q block is a block with intra prediction, the boundary strength is set to 2.

[0250] Otherwise, if at least one of the P block and the Q block is a block with CIIP (MHIntra prediction), the boundary strength of this boundary is set to a first value, for example 1.

[0251] Otherwise, if at least one of the P block and the Q block has non-zero transform coefficients, then the boundary strength of this boundary is set to a second value, for example 1. The first value and the second value may be different.

[0252] Otherwise, if the absolute difference between the motion vectors belonging to the P block and the Q block is greater than or equal to one integer luma sample, the boundary strength of this boundary is set to a second value, e.g., 1.

[0253] Otherwise, if the motion predictions of the neighboring blocks refer to different reference pictures or have a different number of motion vectors, the boundary strength of this boundary is set to a second value, e.g. 1.

[0254] Otherwise, the border strength for this border is set to 0.

[0255] · The pixel samples contained in the P and Q blocks are filtered by applying a deblocking filter according to the determined boundary strength.

[0256] Embodiment 3:

[0257] As shown in FIG. 15, in the case of a boundary having two sides (the spatially adjacent blocks on each side are denoted as P block and Q block), the boundary strength of the boundary may alternatively be set as follows:

[0258] If at least one of the P and Q blocks is predicted by applying intra prediction and not by applying CIIP, the boundary strength is set equal to 2. Possibilities include that the P block is predicted by multiple hypotheses (MH or MHIntra), i.e. intra prediction and not CIIP prediction, and the Q block is predicted by any prediction function, and vice versa.

[0259] If the P block and the Q block are predicted by applying inter prediction or CIIP (possibilities include that the P block is an inter block and the Q block is an inter block, or alternatively, that the P block is an inter block and the Q block is a CIIP block, or alternatively, that the P block is a CIIP block and the Q block is an inter block, or alternatively, that the P block is a CIIP block and the Q block is a CIIP block), the following may apply:

[0260] If at least one of the P and Q blocks has non-zero transform coefficients, then the boundary strength parameter of the boundary is set equal to one.

[0261] Otherwise (if the P and Q blocks do not have non-zero transform coefficients), the boundary strength of this boundary is set equal to 1 if the P and Q blocks are predicted based on different reference pictures or the number of motion vectors used in the prediction of blocks P and Q are not equal.

[0262] Otherwise (if the P and Q blocks have no non-zero transform coefficients, and the P and Q blocks are predicted based on the same reference picture, and the number of motion vectors used in the prediction of the P and Q blocks is the same), if the absolute difference between the motion vectors used in the prediction of the P and Q blocks is greater than or equal to one integer luma sample, then the boundary strength of this boundary is set equal to 1.

[0263] Otherwise (if all three conditions above evaluate to false), the boundary strength of this boundary is set equal to 0.

[0264] Next, if at least one of the P block and the Q block is a block with CIIP, the boundary strength is modified as follows:

[0265] If the boundary strength is not equal to the first predefined value (in one example, the first predefined value is equal to 2), the boundary strength is incremented by a second predefined value (in one example, the second predefined value is equal to 1).

[0266] · The pixel samples contained in the P and Q blocks are filtered by applying a deblocking filter according to the determined boundary strength.

[0267] Embodiment 4:

[0268] For a boundary with two sides (P and Q as described in the VVC draft 3.0 referenced above), the boundary strength may be derived as follows:

[0269] If this boundary is a horizontal boundary and P and Q belong to different CTUs, then:

[0270] If block Q is a block with CIIP, the boundary strength is set to 2.

[0271] Otherwise, the boundary strength is derived as defined in the VVC draft 3.0 referenced above and as shown in FIG. 13.

[0272] Otherwise:

[0273] If at least one of the P and Q blocks is a block with CIIP, the boundary strength of this boundary is set to 2.

[0274] · Otherwise, derive the boundary strength for this boundary as defined in VVC draft 3.0 referenced above and as shown in Figure 13.

[0275] Embodiment 5:

[0276] In the case of a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be determined according to this embodiment as follows:

[0277] If at least one of the P or Q blocks is predicted by applying intra prediction rather than applying CIIP, the boundary strength is set equal to 2. Possibilities include P blocks being predicted by intra prediction rather than multiple hypothesis (CIIP) prediction and Q blocks being predicted by any prediction function, and vice versa.

[0278] If the P block and the Q block are predicted by applying inter prediction or CIIP (possibilities include that the P block is an inter block and the Q block is an inter block, or alternatively, that the P block is an inter block and the Q block is a CIIP block, or alternatively, that the P block is a CIIP block and the Q block is an inter block, or alternatively, that the P block is a CIIP block and the Q block is a CIIP block), the following may apply:

[0279] If the boundary is a horizontal boundary and P and Q are located in two different CTUs, then:

[0280] · If a Q-block (Q-block is denoted as the block located below the P-block) is predicted by applying CIIP, the boundary strength of the boundary is set equal to one.

[0281] Otherwise (if the Q block is not predicted by applying CIIP), the boundary strength of the boundary is set equal to 1 if at least one of the neighboring blocks P and Q has non-zero transform coefficients.

[0282] Otherwise, the boundary strength of the boundary is set equal to 1 if the absolute difference between the motion vectors used for predicting the P and Q blocks is greater than or equal to one integer luma sample.

[0283] Otherwise, the boundary strength of the boundary is set equal to 1 if the motion compensated prediction of the neighboring blocks P and Q is performed based on different reference pictures or if the number of motion vectors used in the prediction of blocks P and Q is unequal. The order of these last two conditions may be reversed as shown in FIG. 13.

[0284] Otherwise, the border strength of the border is set equal to 0.

[0285] Otherwise (if the boundary is a vertical boundary or if blocks P and Q are contained within the same CTU):

[0286] · If at least one of the P and Q blocks is predicted by applying CIIP, the boundary strength of the boundary is set equal to 1.

[0287] Otherwise, if at least one of the neighboring blocks P and Q has non-zero transform coefficients, then the boundary strength of that boundary is set equal to 1.

[0288] Otherwise, the boundary strength of the boundary is set equal to 1 if the absolute difference between the motion vectors used for predicting block P and block Q is greater than or equal to one integer luma sample.

[0289] Otherwise, the boundary strength of the boundary is set equal to 1 if the motion compensated prediction of the neighboring blocks P and Q is performed based on different reference pictures or if the number of motion vectors used in the prediction of blocks P and Q is unequal. The order of these last two conditions may be reversed as shown in FIG. 13.

[0290] Otherwise, the border strength for this border is set equal to 0.

[0291] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0292] Advantages of the embodiment:

[0293] The deblocking filtering of the blocks predicted by the application of the multiple hypothesis prediction, ie CIIP, is applied with a deblocking filter of medium strength (boundary strength equal to 1).

[0294] When a block is predicted by applying CIIP, a first prediction is obtained by applying inter prediction, and a second prediction is obtained by applying intra prediction, which are later combined. Since the final prediction includes a part of intra prediction, there may be block artifacts at the boundary of the block predicted by CIIP. To alleviate this problem, according to the present invention, the boundary strength is set to 1 to ensure filtering of the block edge predicted by applying CIIP.

[0295] Furthermore, the present disclosure reduces the required line memory as follows: Line memory is defined as the memory required to store line information corresponding to the top CTU row that is required during processing of the adjacent bottom CTU row. For example, to filter the horizontal boundary between two CTU rows, the prediction mode information (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) of the top CTU row needs to be stored in the line memory. Since there are three possible states (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) to describe the prediction mode of a block, the line memory requirement can be defined as 2 bits per block.

[0296] However, according to the present disclosure, if a block (a P block in this embodiment) belongs to the top CTU row, the deblocking operation only requires information about whether the block is predicted by inter-prediction or intra-prediction (hence, only two states can be stored using one bit per block).

[0297] The reasons are as follows:

[0298] If the boundary between the P block and the Q block is a horizontal boundary, and if the Q block and the P block belong to two different CTUs (in all embodiments, the Q block is a block at the bottom relative to the P block), the information of whether the P block is predicted by applying CIIP is not used in determining the boundary strength. Because intra prediction and CIIP are mutually exclusive, it is sufficient to determine whether the P block is predicted by intra prediction to check the first condition of the above embodiment 5. Therefore, there is no need to store information of whether the P block is predicted by applying CIIP.

[0299] With the help of the disclosure in hardware implementation, the prediction mode of the P block can be temporarily changed to inter prediction (if the P block is predicted by CIIP), and the boundary strength determination can be performed according to the changed prediction mode. After that (after the boundary strength determination), the prediction mode can be changed back to CIIP. Note that the hardware implementation is not limited to the method described in this specification (changing the prediction mode of the P block at the CTU boundary). According to the present disclosure, this is only presented as an example to illustrate that the information of whether the P block is predicted by CIIP or not is not necessary for the boundary strength determination (at the horizontal CTU boundary).

[0300] Thus, in accordance with the present disclosure, the required line memory is reduced from 2 bits per block to 1 bit per block. Note that the amount of line memory that needs to be implemented in hardware is proportional to the image width and inversely proportional to the minimum block width.

[0301] Embodiment 6:

[0302] In the case of a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be determined according to this embodiment as follows:

[0303] First, determine the boundary strength of the boundary according to the method defined in the above-referenced VVC Draft 3.0 or ITU-H.265 video coding standard as shown in FIG.

[0304] If the boundary is a horizontal boundary and P and Q are located in two different CTUs, then:

[0305] If block Q is predicted by applying CIIP, the boundary strength is modified as follows:

[0306] If the boundary strength is not equal to 2, the boundary strength is incremented by 1.

[0307] Otherwise (if the boundary is a vertical boundary or if blocks P and Q are contained within the same CTU):

[0308] If at least one of block P or block Q is predicted by applying CIIP, the boundary strength of the boundary is adjusted as follows:

[0309] If the boundary strength is not equal to 2, the boundary strength is incremented by 1.

[0310] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0311] Embodiment 7:

[0312] This embodiment represents a modification of the fourth embodiment.

[0313] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this embodiment as follows:

[0314] If the boundary is a horizontal boundary and blocks P and Q are located in different CTUs, then:

[0315] · If a Q-block (Q-block is denoted as the block located below the P-block) is predicted by applying CIIP, the boundary strength is set equal to 2.

[0316] · If the Q block is not predicted by applying CIIP and if at least one of the P or Q blocks is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0317] If block Q is not predicted by applying CIIP and if both blocks P and Q are predicted by applying inter prediction, then the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to a further conditional evaluation such as the one shown in FIG.

[0318] Otherwise (if the boundary is a vertical boundary or if blocks P and Q are contained within the same CTU):

[0319] · If at least one of the P or Q blocks is predicted by application of CIIP, the boundary strength of the boundary is set equal to 2.

[0320] If both P and Q blocks are not predicted by applying CIIP, and if at least one of P or Q blocks is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0321] If both P and Q blocks are not predicted by applying CIIP, and if both P and Q blocks are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to further conditional evaluations, such as the one shown in FIG.

[0322] · The pixel samples contained in the P and Q blocks are filtered by applying a deblocking filter according to the determined boundary strength.

[0323] Advantages of the embodiment:

[0324] The deblocking filtering of the blocks predicted by applying the multiple hypothesis (CIIP) prediction is performed with a deblocking filter of medium strength (boundary strength equal to 1).

[0325] When a block is predicted by applying CIIP, a first prediction is obtained by applying inter prediction, and a second prediction is obtained by applying intra prediction, which are later combined. Since the final prediction includes a part of intra prediction, there may be block artifacts at the boundary of the block predicted by CIIP. To alleviate this problem, according to the present disclosure, the boundary strength is set to 2 to ensure filtering of the block edge predicted by applying CIIP.

[0326] Furthermore, the present disclosure reduces the required line memory as follows: Line memory is defined as the memory required to store line information corresponding to the top CTU row that is required during processing of the adjacent bottom CTU row. For example, to filter the horizontal boundary between two CTU rows, the prediction mode information (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) of the top CTU row needs to be stored in the line memory. Since there are three possible states (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) to describe the prediction mode of a block, the line memory requirement can be defined as 2 bits per block.

[0327] However, according to the present disclosure, if a block (a P block in this embodiment) belongs to the top CTU row, the deblocking operation only requires information about whether the block is predicted by inter-prediction or intra-prediction (hence, only two states can be stored using one bit per block).

[0328] The reasons are as follows:

[0329] If the boundary between the P block and the Q block is a horizontal boundary, and if the Q block and the P block belong to two different CTUs (in all embodiments, the Q block is the block at the bottom relative to the P block), the information of whether the P block is predicted by applying CIIP is not used in determining the boundary strength. Therefore, there is no need to store it. Since intra prediction and CIIP are mutually exclusive, it is sufficient to determine whether the P block is predicted by intra prediction to check the first condition in the above embodiment 7.

[0330] With the help of the disclosure in hardware implementation, the prediction mode of the P block can be temporarily changed to inter prediction (if the P block is predicted by CIIP), and the boundary strength determination can be performed according to the changed prediction mode. After that (after the boundary strength determination), the prediction mode can be changed back to CIIP. Note that the hardware implementation is not limited to the method described herein (changing the prediction mode of the P block at the CTU boundary). According to the present disclosure, this is merely presented as an example to illustrate that the information of whether the P block is predicted by CIIP or not is not necessary for the boundary strength determination (at the horizontal CTU boundary).

[0331] Thus, with the present invention, the required line memory is reduced from 2 bits per block to 1 bit per block. Note that the total line memory that needs to be implemented in hardware is proportional to the image width and inversely proportional to the minimum block width.

[0332] Embodiment 8:

[0333] This embodiment represents a modification of the sixth embodiment.

[0334] In the case of a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be determined according to this embodiment as follows:

[0335] If at least one of the P and Q blocks is predicted by applying intra prediction and not by applying CIIP, the boundary strength is set equal to 2. Possibilities include P block being predicted by intra prediction and not by multiple hypothesis prediction (CIIP) and Q block being predicted by any prediction function, and vice versa.

[0336] If the P block and the Q block are predicted by applying inter prediction or CIIP (possibilities include that the P block is an inter block and the Q block is an inter block, or alternatively, that the P block is an inter block and the Q block is a CIIP block, or alternatively, that the P block is a CIIP block and the Q block is an inter block, or alternatively, that the P block is a CIIP block and the Q block is a CIIP block), the following may apply:

[0337] If at least one of block P and block Q has non-zero transform coefficients, the boundary strength of the boundary is set equal to 1.

[0338] Otherwise (blocks P and Q do not have non-zero transform coefficients), if the absolute difference between the motion vectors used for the prediction of blocks P and Q is greater than or equal to one integer luma sample, then the boundary strength of this boundary is set equal to 1.

[0339] Otherwise (if blocks P and Q have no non-zero transform coefficients and the absolute difference between the motion vectors is smaller than one integer luma sample), the boundary strength of this boundary is set equal to 1 if blocks P and Q are predicted based on different reference pictures or the number of motion vectors used in the prediction of blocks P and Q is unequal. The order of these last two conditions may be reversed as shown in Figure 13.

[0340] Otherwise (if all of the above three conditions evaluate to false), the boundary strength of this boundary is set equal to 0.

[0341] If the boundary is a horizontal boundary and P and Q are located in two different CTUs, then:

[0342] If block Q is predicted by applying CIIP, the determined boundary strength is modified as follows:

[0343] If the boundary strength is not equal to 2, the boundary strength is incremented by 1.

[0344] If the boundary is a vertical boundary or if blocks P and Q are contained within the same CTU:

[0345] If at least one of block P and block Q is predicted by applying CIIP, the boundary strength of the boundary is adjusted as follows:

[0346] If the boundary strength is not equal to 2, the boundary strength is incremented by 1.

[0347] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0348] Advantages of the embodiment:

[0349] The deblocking filtering of the blocks predicted by the application of the multiple hypothesis prediction, ie the CIIP, is performed with a deblocking filter of medium strength (boundary strength equal to 1).

[0350] When a block is predicted by applying CIIP, a first prediction is obtained by applying inter prediction, and a second prediction is obtained by applying intra prediction, which are later combined. Since the final prediction includes a part of intra prediction, there may be block artifacts at the boundary of the block predicted by CIIP. To alleviate this problem, the boundary strength is increased by 1 according to the present disclosure to ensure filtering of the block edge predicted by applying CIIP.

[0351] Furthermore, the present disclosure reduces the required line memory as follows: Line memory is defined as the memory required to store line information corresponding to the top CTU row that is required during processing of the adjacent bottom CTU row. For example, to filter the horizontal boundary between two CTU rows, the prediction mode information (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) of the top CTU row needs to be stored in the line memory. Since there are three possible states (intra prediction / inter prediction / multiple hypothesis (CIIP) prediction) to describe the prediction mode of a block, the line memory requirement can be defined as 2 bits per block.

[0352] However, according to the present disclosure, if a block (a P block in this embodiment) belongs to the top CTU row, the deblocking operation only requires information about whether the block is predicted by inter-prediction or intra-prediction (hence, only two states can be stored using one bit per block).

[0353] The reasons are as follows:

[0354] If the boundary between the P block and the Q block is a horizontal boundary, and if the P block and the Q block belong to two different CTUs (in all embodiments, the Q block is a block at the bottom relative to the P block), the information of whether the P block is predicted by applying CIIP is not used in determining the boundary strength. Therefore, there is no need to store it. Since intra prediction and CIIP are mutually exclusive, it is sufficient to determine whether the P block is predicted by intra prediction to check the first condition in the above embodiment 8.

[0355] With the help of the disclosure in hardware implementation, the prediction mode of the P block can be temporarily changed to inter prediction (if the P block is predicted by CIIP), and the boundary strength determination can be performed according to the changed prediction mode. After that (after the boundary strength determination), the prediction mode can be changed back to CIIP. Note that the hardware implementation is not limited to the method described herein (changing the prediction mode of the P block at the CTU boundary). According to the present disclosure, this is merely presented as an example to illustrate that the information of whether the P block is predicted by CIIP or not is not necessary for the boundary strength determination (at the horizontal CTU boundary).

[0356] Thus, in accordance with the present disclosure, the required line memory is reduced from 2 bits per block to 1 bit per block. Note that the amount of line memory that needs to be implemented in hardware is proportional to the image width and inversely proportional to the minimum block width.

[0357] It should be noted that according to all the above embodiments, when a block is predicted by applying CIIP, a first prediction is obtained by applying inter prediction and a second prediction is obtained by applying intra prediction, which are later combined.

[0358] The above embodiments show that CIIP blocks are considered as intra blocks to different degrees when running the deblocking filter. In embodiments 1, 2 and 3, three different strategies are used to adjust the boundary strength of the boundary.

[0359] In embodiment 1, the CIIP block is considered to be a completely intra block, so the conditions for setting Bs to 2 are the same as in Table 1.

[0360] In the second embodiment, the distortion caused by CIIP blocks is considered not to be as high as that caused by intra blocks, so Bs is considered to be 1 if a CIIP block is detected at the boundary.

[0361] In embodiment 3, if a CIIP block is considered to be a partially intra block and at least one neighboring block at the boundary is a CIIP block, Bs is increased by 1. If Bs is already 2 using the conventional derivation strategy of FIG. 13, Bs is not changed.

[0362] Figure 11 shows the derivation of Bs in VVC Draft 3.0 as referenced above. Figures 12, 14, and 15 depict the changes to the derivation of Bs in embodiments 1, 2, and 3, respectively.

[0363] It is worth noting that in the case of embodiments 1 and 2, not only the potential distortion but also the processing logic is reduced. In embodiments 1 and 2, as long as the P block or Q block is a CIIP block, the latency of the condition check is reduced because the check of the coefficients and motion vectors is not required.

[0364] Embodiments 4, 5 and 6 are modifications of embodiments 1, 2 and 3, respectively, in which line buffer memory is taken into account. The main change to embodiments 1, 2 and 3 is that when P and Q blocks are placed in different CTUs and the edge is horizontal, the check of CIIP blocks is performed asymmetrically, i.e., the blocks on the P side (i.e., above) are not checked, and only the blocks on the Q side (i.e., below) are checked. In this way, no additional line buffer memory is allocated to store the CIIP flags of the blocks on the P side that are placed in another CTU.

[0365] In addition to the above six embodiments, one further feature of the CIIP block may be that the CIIP block does not need to be consistently considered as an intra block. In one example, when searching for a motion vector predictor for a current block, if its neighboring blocks are CIIP blocks, the motion vectors of these CIIP blocks can be considered as motion vector predictors. In this case, the inter prediction information of the CIIP block is used, so the CIIP block is no longer considered as an intra block. In another example, when building an MPM list of intra blocks, the neighboring CIIP blocks of the current block can be considered as not containing intra information. Thus, when checking whether these CIIP blocks can be used for building the MPM list of the current block, they are labeled as unavailable. Note that the CIIP blocks referred to in this paragraph are not limited to only the CIIP blocks used to determine the Bs value of the deblocking filter.

[0366] In addition to the above six embodiments, one further feature of the CIIP block may be that the MH block is consistently considered as an intra block. In one example, when searching for the motion vector predictor of the current block, if its neighboring blocks are CIIP blocks, the motion vectors of these CIIP blocks are excluded from the motion vector predictor. In this case, the CIIP block is considered as an intra block because the inter prediction information of the CIIP block is not used. In another example, when building the MPM list of intra blocks, the neighboring CIIP blocks of the current block can be considered as containing intra information. Therefore, when checking whether these CIIP blocks can be used for building the MPM list of the current block, they are labeled as available. Note that the CIIP blocks referred to in this paragraph are not limited to only the CIIP blocks used to determine the Bs value of the deblocking filter.

[0367] Embodiment 9:

[0368] In one example, the boundary strength (Bs) of a CIIP block boundary may be set to a value of 2, while the boundary strength of a sub-block boundary within the CIIP block may be set to a value of 1. If a sub-block boundary is not aligned with an 8x8 sample grid, the boundary strength of such edge may be set to a value of 0. An 8x8 grid is shown in Figure 16 or Figure 17. Figure 16 shows an 8x8 sample grid that starts from the top left sample of a CU, and Figure 17 shows an 8x8 sample grid that does not start from the top left sample of a CU.

[0369] In another example, the boundary strength of an edge may be determined as follows.

[0370] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this example as follows:

[0371] If the boundary is a horizontal boundary and blocks P and Q are located in different CTUs, then:

[0372] · If a Q-block (Q-block is denoted as the block located below the P-block) is predicted by applying CIIP, the boundary strength is set equal to 2.

[0373] · If the Q block is not predicted by applying CIIP and if at least one of the P or Q blocks is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0374] If the Q block is not predicted by applying CIIP and if both the P block and the Q block are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to further conditional evaluations such as the one shown in FIG.

[0375] Otherwise (if P and Q correspond to two sub-blocks in a CIIP block, i.e., the target boundary is a sub-block boundary in the CIIP block):

[0376] If the sub-block border is aligned with an 8x8 grid, set the border strength to a value of 1.

[0377] Otherwise (if the sub-block border is not aligned with an 8x8 grid) set the border strength to value 0.

[0378] Otherwise (if the boundary is a vertical boundary or if blocks P and Q are contained in the same CTU and P and Q are not in the same CIIP block):

[0379] If at least one of block P or block Q is predicted by applying CIIP, the boundary strength parameter of the boundary is set equal to 2.

[0380] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0381] If neither P nor Q block is predicted by applying CIIP, and if both blocks P and Q are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to a further conditional evaluation, such as the one shown in FIG.

[0382] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0383] In another example, the boundary strength (Bs) of a CIIP block boundary may be set to a value of 2, while the boundary strength of a sub-block boundary within the CIIP block may be set to a value of 1. If a sub-block boundary is not aligned with a 4×4 sample grid, the boundary strength of such an edge may be set to a value of 0. A 4×4 grid is shown in Figure 18.

[0384] In another example, the boundary strength of an edge may be determined as follows.

[0385] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this example as follows:

[0386] If the boundary is a horizontal boundary and blocks P and Q are located in different CTUs, then:

[0387] · If a Q-block (Q-block is denoted as the block located below the P-block) is predicted by applying CIIP, the boundary strength is set equal to 2.

[0388] · If the Q block is not predicted by applying CIIP and if at least one of the P or Q blocks is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0389] If the Q block is not predicted by applying CIIP and if both the P and Q blocks are predicted by applying inter prediction, then the boundary strength is determined to be smaller than 2. The exact value of the boundary strength is determined according to further conditional evaluations such as the one shown in FIG.

[0390] Otherwise (P and Q correspond to two sub-blocks in a CIIP block, i.e. the target boundary is a sub-block boundary in the CIIP block):

[0391] If the sub-block border is aligned with a 4x4 grid, set the border strength to a value of 1.

[0392] Otherwise (if the sub-block border is not aligned with a 4x4 grid) set the border strength to value 0.

[0393] Otherwise (if the boundary is a vertical boundary or if the P and Q blocks are contained within the same CTU and P and Q are not within the same CIIP block):

[0394] · If at least one of the P or Q blocks is predicted by application of CIIP, the boundary strength of the boundary is set equal to 2.

[0395] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0396] If neither P nor Q blocks are predicted by applying CIIP, and if both P and Q blocks are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength is determined according to further conditional evaluations such as the one shown in FIG. 13.

[0397] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0398] Embodiment 10 (without line buffer constraints):

[0399] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this embodiment as follows:

[0400] If at least one of block P or block Q is predicted by applying CIIP, and block P and block Q are not in the same CIIP block, the boundary strength of the boundary is set equal to 2.

[0401] If both block P and block Q are predicted by applying CIIP, and block P and block Q are in the same CIIP block, then:

[0402] If the sub-block border is aligned with the 8x8 grid, the border strength is set to value 1.

[0403] Otherwise (if the sub-block border is not aligned with an 8x8 grid) the border strength is set to value 0.

[0404] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0405] If neither the P block nor the Q block is predicted by applying CIIP, and if both the P block and the Q block are predicted by applying inter prediction, then the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to further conditional evaluations such as the one shown in FIG.

[0406] The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0407] Embodiment 11 (no line buffer constraints, CIIP alignment with 8x8 grid):

[0408] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this embodiment as follows:

[0409] If at least one of block P or block Q is predicted by applying CIIP, and block P and block Q are not in the same CIIP block, and the boundary is aligned with an 8x8 grid, then the boundary strength of the boundary is set equal to 2.

[0410] If both block P and block Q are predicted by applying CIIP, and block P and block Q are in the same CIIP block, then:

[0411] If the sub-block border is aligned with an 8x8 grid, set the border strength to a value of 1.

[0412] Otherwise (if the sub-block border is not aligned with an 8x8 grid) set the border strength to value 0.

[0413] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0414] If neither the P block nor the Q block is predicted by applying CIIP, and if both the P block and the Q block are predicted by applying inter prediction, then the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to further conditional evaluations such as the one shown in FIG.

[0415] · The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0416] Embodiment 12 (no line buffer constraints, TU size constraints, 8x8 grid alignment even for CIIP boundaries):

[0417] In one example, the boundary strength (Bs) of a CIIP block boundary may be set to a value of 2, while the boundary strength of a sub-block boundary within a CIIP block may be set to a value of 1, except for sub-blocks due to TU size limitations (as shown in FIG. 8). If a boundary is a TU boundary and its adjacent P and Q blocks belong to the same CIIP block, the boundary strength of the boundary is set to 2. If a sub-block boundary or a CIIP block boundary (the CIIP block size may be smaller than 8×8) is not aligned with the 8×8 sample grid, the boundary strength of such an edge may be set to a value of 0. An 8×8 grid is shown in FIG. 16 or FIG. 17. FIG. 16 shows an 8×8 sample grid starting from the top-left sample of a CU, and FIG. 17 shows an 8×8 sample grid not starting from the top-left sample of a CU.

[0418] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this example as follows:

[0419] If at least one of block P or block Q is predicted by applying CIIP, and block P and block Q are not in the same CIIP block, and the boundary is aligned with an 8x8 grid, then the boundary strength of the boundary is set equal to 2.

[0420] If both block P and block Q are predicted by applying CIIP, and block P and block Q are in the same CIIP block, then:

[0421] If the sub-block borders are aligned with an 8x8 grid, set the border strength to value 2 when the size of at least one of sub-block P or sub-block Q is equal to the maximum allowed TU size.

[0422] If the sub-block borders are aligned with an 8x8 grid, set the border strength to value 1 when the size of neither sub-block P nor sub-block Q is equal to the maximum allowed TU size.

[0423] Otherwise (if the sub-block border is not aligned with an 8x8 grid) set the border strength to value 0.

[0424] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0425] If neither the P block nor the Q block is predicted by applying CIIP, and if both the P block and the Q block are predicted by applying inter prediction, then the boundary strength is determined to be smaller than 2. The exact value of the boundary strength may be determined according to further conditional evaluations such as the one shown in FIG.

[0426] The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0427] Embodiment 13 (no line buffer constraints, TU size constraints, 8x8 grid alignment only on CIIP sub-block boundaries):

[0428] In one example, the boundary strength (Bs) of a CIIP block boundary may be set to a value of 2, while the boundary strength of a sub-block boundary within the CIIP block may be set to a value of 1, except for sub-blocks due to TU size limitations (as shown in FIG. 8). If a boundary is a TU boundary and its adjacent P and Q blocks belong to the same CIIP block, the boundary strength of the boundary is set to 2. If a boundary of a sub-block of a CIIP block is not aligned with an 8×8 sample grid, the boundary strength of such an edge may be set to a value of 0. An 8×8 grid is shown in FIG. 16 or FIG. 17. FIG. 16 shows an 8×8 sample grid starting from the top-left sample of a CU, and FIG. 17 shows an 8×8 sample grid not starting from the top-left sample of a CU.

[0429] For a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks), the boundary strength may be derived according to this example as follows:

[0430] If at least one of block P or block Q is predicted by applying a CIIP, and block P and block Q are not in the same CIIP, the boundary strength of the boundary is set equal to 2.

[0431] If both block P and block Q are predicted by applying CIIP, and block P and block Q are in the same CIIP block, then:

[0432] If the sub-block borders are aligned with an 8x8 grid, set the border strength to value 2 when the size of at least one of sub-block P or sub-block Q is equal to the maximum allowed TU size.

[0433] If the sub-block borders are aligned with an 8x8 grid, set the border strength to value 1 when the size of neither sub-block P nor sub-block Q is equal to the maximum allowed TU size.

[0434] Otherwise (if the sub-block border is not aligned with an 8x8 grid) set the border strength to value 0.

[0435] · If neither the P block nor the Q block is predicted by applying CIIP, and if at least one of the P block or the Q block is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0436] If neither P nor Q blocks are predicted by applying CIIP, and if both P and Q blocks are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength is determined according to further conditional evaluations such as the one shown in FIG. 13.

[0437] The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0438] Embodiment 14 (TU transform edge, 8x8 grid alignment only for CIIP sub-blocks):

[0439] In one example, the boundary strength (Bs) of a CIIP block boundary or a transform unit boundary may be set to a value of 2, while the boundary strength of a sub-block boundary within a CIIP block may be set to a value of 1. If a sub-block boundary or a transform unit boundary or a CIIP block boundary is not aligned with an 8x8 sample grid, the boundary strength of such an edge may be set to a value of 0. For example, the 8x8 grid may be as shown in Figure 16 or Figure 17. Figure 16 shows an 8x8 sample grid that starts from the top-left sample of a CU, and Figure 17 shows an 8x8 sample grid that does not start from the top-left sample of a CU.

[0440] In the case of a boundary having two sides (the spatially adjacent blocks on each side are denoted as P and Q blocks, and the boundary is aligned with an 8x8 grid), the boundary strength may be derived according to this embodiment as follows:

[0441] If at least one of the P or Q blocks is predicted by applying intra prediction, the boundary strength is determined to be equal to 2.

[0442] Otherwise, if at least one of block P or block Q is predicted by applying CIIP and block P and block Q are not in the same CIIP block, then the boundary strength parameter of the boundary is set equal to 2.

[0443] Otherwise, if both blocks P and Q are predicted by applying CIIP and blocks P and Q are within the same CIIP block, i.e., sub-block boundary, then:

[0444] If the sub-block border is aligned with the transform unit, set the border strength of the sub-block border to the value 2.

[0445] Otherwise, set the boundary strength of the sub-block boundary to the value 1.

[0446] If neither P nor Q blocks are predicted by applying CIIP, and if both P and Q blocks are predicted by applying inter prediction, the boundary strength is determined to be smaller than 2. The exact value of the boundary strength is determined according to further conditional evaluations such as the one shown in FIG. 13.

[0447] The pixel samples contained in blocks P and Q are filtered by applying a deblocking filter according to the determined boundary strength.

[0448] Embodiment 15:

[0449] In another example, the process of determining boundary strength according to the present disclosure may be described as follows in pseudocode language such as that used in the above-referenced VVC Draft 3.0:

[0450] Inputs to this process:

[0451] Image sample array recPicture

[0452] Location (xCb, yCb) that specifies the top-left sample of the current coding block relative to the top-left sample of the current image

[0453] - Variable nCbW that specifies the width of the current coding block

[0454] - Variable nCbH that specifies the height of the current coding block

[0455] The variable edgeType specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered.

[0456] Two-dimensional (nCbW) x (nCbH) array edgeFlag

[0457] The output of this process is a two-dimensional (nCbW) x (nCbH) array bS that specifies the boundary filtering strengths.

[0458] Variables xD i , yD j , xN, and yN are derived as follows:

[0459] If edgeType is equal to EDGE_VER, then xD i is set equal to (i<<3) and yD j is set equal to (j<<2), xN is set equal to Max(0,(nCbW / 8)-1), and yN is set equal to (nCbH / 4)-1.

[0460] Otherwise (edgeType is equal to EDGE_HOR), xD i is set equal to (i<<2) and yD j is set equal to (j<<3), xN is set equal to (nCbW / 4)-1, and yN is set equal to Max(0,(nCbH / 8)-1).

[0461] xD for i=0..xN i , and yD for j=0..yN j If , the following applies:

[0462] edgeFlag[xD i ][yD j If ] is equal to 0, then the variable bS[xD i ][yD j ] is set equal to 0.

[0463] Otherwise the following applies:

[0464] The sample value p0 and the sample value q0 are derived as follows:

[0465] If edgeType is equal to EDGE_VER, p0 is recPicture[xCb+xD i -1][yCb+yDj ] and q0 is set equal to recPicture[xCb+xD i ][yCb+yD j ].

[0466] Otherwise (edgeType is equal to EDGE_HOR), p0 is recPicture[xCb+xD i ][yCb+yD j -1], and q0 is set equal to recPicture[xCb+xD i ][yCb+yD j ].

[0467] Variable bS[xD i ][yD j ] is derived as follows:

[0468] If sample p0 or sample q0 is within a coding block of a coding unit coded in intra prediction mode, then bS[xD i ][yD j ] is set equal to 2.

[0469] Otherwise, if the block edge is also a transform block edge and ciip_flag of sample p0 or sample q0 is equal to 1, then bS[xDi][yDj] is set equal to 2.

[0470] Otherwise, if ciip_flag of sample p0 or sample q0 is equal to 1, then bS[xDi][yDj] is set equal to 1.

[0471] Otherwise, if the block edge is also a transform block edge and sample p0 or sample q0 is in a transform block that contains one or more non-zero transform coefficient levels, then bS[xD i ][yD j ] is set equal to 1.

[0472] Otherwise, bS[xD i ][yD j ] is set equal to 1.

[0473] · For the prediction of the coding sub-block containing sample p0 a different reference picture or a different number of motion vectors is used than for the prediction of the coding sub-block containing sample q0.

[0474] NOTE 1: The decision of whether the reference pictures used for two coding sub-blocks are the same or different is based solely on which pictures are referenced, regardless of whether prediction is performed using an index into reference picture list 0 or an index into reference picture list 1, and regardless of whether the index positions in the reference picture lists are different.

[0475] NOTE 2: The number of motion vectors used for prediction of the coding sub-block with the top-left sample cover (xSb, ySb) is equal to PredFlagL0[xSb][ySb]+PredFlagL1[xSb][ySb].

[0476] One motion vector is used for the prediction of the coding sub-block containing sample p0 and one motion vector is used for the prediction of the coding sub-block containing sample q0, and the absolute difference between the horizontal or vertical components of the used motion vectors is greater than or equal to 4 in units of 1 / 4 luma samples.

[0477] For the prediction of the coding sub-block containing sample p0, two motion vectors and two different reference pictures are used, for the prediction of the coding sub-block containing sample q0, two motion vectors relative to the same two reference pictures are used, and the absolute difference between the horizontal or vertical components of the two motion vectors used in the prediction of the two coding sub-blocks relative to the same reference picture is greater than or equal to 4 in units of 1 / 4 luma samples.

[0478] For the prediction of the coding sub-block containing sample p0, two motion vectors relative to the same reference picture are used and for the prediction of the coding sub-block containing sample q0, two motion vectors relative to the same reference picture are used and both of the following conditions are true:

[0479] The absolute difference between the horizontal or vertical components of the motion vectors of list 0 used in the prediction of the two coding subblocks is greater than or equal to 4 in units of 1 / 4 luma samples, OR the absolute difference between the horizontal or vertical components of the motion vectors of list 1 used in the prediction of the two coding subblocks is greater than or equal to 4 in units of 1 / 4 luma samples.

[0480] the absolute difference between the horizontal or vertical components of the motion vector of list 0 used in the prediction of the coding sub-block containing sample p0 and the motion vector of list 1 used in the prediction of the coding sub-block containing sample q0 is greater than or equal to 4 in units of 1 / 4 luma samples, or the absolute difference between the horizontal or vertical components of the motion vector of list 1 used in the prediction of the coding sub-block containing sample p0 and the motion vector of list 0 used in the prediction of the coding sub-block containing sample q0 is greater than or equal to 4 in units of 1 / 4 luma samples.

[0481] Otherwise, the variable bS[xD i ][yD j ] is set equal to 0.

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

[0483] For example, embodiments of the encoder 20 and the decoder 30, and functions described herein with reference to 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.

[0484] Computer-readable media may include computer-readable storage media, which correspond to tangible media, such as data storage media, or communication media, which include any medium that facilitates transfer of a computer program from one place to another, for example according to a communications protocol. Thus, computer-readable media may generally correspond to (1) non-transitory tangible computer-readable storage media, or (2) a communication medium, 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 obtain instructions, code, and / or data structures for implementing the techniques described in this disclosure. A computer program product may include a computer-readable medium.

[0485] 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. Also, any connection is strictly 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 in the definition of media. However, 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 cover non-transitory tangible storage media. Disk and disc as used herein include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs, where a disk typically reproduces data magnetically and a disc reproduces data optically with a laser. Combinations of the above should also be included within the scope of computer-readable media.

[0486] 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 circuits or discrete logic circuitry. Consequently, 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. Also, these techniques may be fully implemented in one or more circuits or logic elements.

[0487] 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., chipsets). This disclosure describes various components, modules, or units to highlight functional aspects of devices configured to perform the disclosed techniques, but does not necessarily require realization by different hardware units. Rather, as described above, the various units may be combined into a codec hardware unit or may be provided by a collection of interoperable hardware units including one or more processors as described above, along with suitable software and / or firmware. [Other possible items] (Item 1) A method of coding, said coding comprising decoding or encoding, said method comprising the steps of: determining whether the current coding unit is predicted by applying combined inter / intra prediction (CIIP); setting a boundary strength of a boundary of the current coding unit to a first value when it is determined that the current coding unit is predicted by applying CIIP; A method comprising: (Item 2) 2. The method according to claim 1, wherein the first value is in the range of 1 to 2. (Item 3) 3. The method according to item 1 or 2, wherein the first value is 2. (Item 4) 3. The method according to item 1 or 2, wherein the first value is 1. (Item 5) At least one of the current coding unit and a neighboring coding unit adjacent to the boundary of the current coding unit has non-zero transform coefficients. an absolute difference between motion vectors used for predicting the current coding unit and the neighboring coding unit is greater than or equal to one integer sample; the current coding unit and the neighboring coding units are predicted based on different reference pictures; a number of motion vectors used in prediction of the current coding unit and the neighboring coding unit are different; incrementing the first value by one when it is determined that one of the following conditions is satisfied: 5. The method of claim 4, further comprising: (Item 6) determining whether a neighboring coding unit adjacent to the boundary of the current coding unit is in a different coding tree unit (CTU) if the boundary of the current coding unit is a horizontal edge; 6. The method according to any one of items 1 to 5, further comprising: (Item 7) setting a boundary strength of a boundary of a sub-coding unit to a second value, the current coding unit including at least two sub-coding units, the boundary of the sub-coding unit being a boundary between the at least two sub-coding units. 7. The method according to any one of items 1 to 6, further comprising: (Item 8) 8. The method according to claim 7, wherein the second value is 1. (Item 9) 9. The method according to claim 7 or 8, wherein the second value is equal to the first value if the boundary of the sub-coding unit is an edge of a transform unit. (Item 10) 9. The method according to claim 7 or 8, wherein the second value is different from the first value if the boundary of the sub-coding unit is not an edge of a transform unit. (Item 11) determining whether the boundary of the current coding unit is aligned with an 8x8 grid; setting the boundary strength of the boundary of the current coding unit to 0 if the boundary of the current coding unit is determined to be not aligned with the 8x8 grid. 11. The method according to any one of items 1 to 10, further comprising: (Item 12) determining whether the boundary of the sub-coding unit is aligned with a sub-grid, the sub-grid being a 4x4 grid or an 8x8 grid; setting the boundary strength of the boundary of the sub-coding unit to 0 if it is determined that the boundary of the sub-coding unit is not aligned with the sub-grid; 11. The method according to any one of items 7 to 10, further comprising: (Item 13) performing deblocking for a boundary for a luma component if the boundary strength of the boundary is greater than 0. 13. The method according to any one of items 1 to 12, further comprising: (Item 14) performing deblocking for the boundary for the chroma components if the boundary strength of the boundary is greater than 1. 14. The method according to any one of items 1 to 13, further comprising: (Item 15) 15. The method according to any one of items 1 to 14, wherein if the current coding unit is predicted by applying CIIP, the current coding unit is considered as a coding unit with intra prediction when performing deblocking. (Item 16) 16. An encoder (20) comprising processing circuitry for carrying out the method according to any one of items 1 to 15. (Item 17) 16. A decoder (30) comprising processing circuitry for carrying out the method according to any one of items 1 to 15. (Item 18) 16. A computer program product comprising instructions, which when executed by a computer, cause the computer to carry out the method according to any one of items 1 to 15. (Item 19) A decoder (30), one or more processors; a non-transitory computer-readable storage medium coupled to said one or more processors and storing instructions for execution by said one or more processors, said instructions, when executed by said one or more processors, configuring said decoder to perform the method according to any one of items 1 to 15; A decoder comprising: (Item 20) An encoder (20), one or more processors; a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, the instructions, when executed by the one or more processors, configuring the encoder to perform the method of any one of items 1 to 15; An encoder comprising:

Claims

1. A method of coding, said coding comprising decoding or encoding, said method comprising: determining whether the current coding unit is predicted by applying combined inter / intra prediction (CIIP); setting a boundary strength of a boundary of the current coding unit to a first value when it is determined that the current coding unit is predicted by applying CIIP; if it is determined that the current coding unit is not predicted by application of the CIIP, determining whether the boundary of the current coding unit is an edge of a transform block and the transform block includes one or more non-zero transform coefficient levels; setting the boundary strength of the boundary of the current coding unit to a second value if it is determined that the boundary of the current coding unit is an edge of a transform block and the transform block includes one or more non-zero transform coefficient levels; Equipped with the first value is different from the second value; The method comprises: determining whether the boundary of the current coding unit is a horizontal edge and whether neighboring coding units adjacent to the boundary of the current coding unit are in different coding tree units (CTUs); if the boundary of the current coding unit is not a horizontal edge and the neighboring coding unit is not in the different CTU, and if the boundary of the current coding unit is a vertical boundary, setting the boundary strength of the boundary to the second value if at least one of the current coding unit and the neighboring coding unit is predicted by application of the CIIP; Further comprising: determining whether the current coding unit is predicted by applying the CIIP, A method comprising: determining whether the current coding unit is predicted by application of the CIIP if the boundary of the current coding unit is a horizontal edge and the neighboring coding unit is in the different CTU.

2. The step of determining whether the current coding unit is predicted by applying CIIP includes the step of determining whether at least one of the current coding block P and the neighboring coding block Q is predicted by applying Combined Inter / Intra Prediction (CIIP), the current coding block P being a sample p 0 and the adjacent coding block Q includes sample q 0 Including, The method of claim 1 , wherein the step of setting a boundary strength of a boundary of the current coding unit to a first value comprises setting a boundary strength of a boundary between the current coding block P and the neighboring coding block Q to 2.

3. The method comprises: Both the current coding block P and the neighboring coding block Q are not predicted by applying CIIP, the boundary is also a transform block edge, and the sample p 0 or q 0 setting the boundary strength of the boundary to 1 if The method of claim 2 further comprising:

4. The method of claim 1 , wherein the second value is one.

5. The method of claim 1 or 4, wherein the first value is two.

6. A method of coding, the coding including decoding or encoding, the method comprising: determining whether the current coding unit is predicted by applying combined inter / intra prediction (CIIP); setting a boundary strength of a boundary of the current coding unit to a first value when it is determined that the current coding unit is predicted by applying CIIP; if it is determined that the current coding unit is not predicted by application of the CIIP, determining whether the boundary of the current coding unit is an edge of a transform block and the transform block includes one or more non-zero transform coefficient levels; setting the boundary strength of the boundary of the current coding unit to a second value if it is determined that the boundary of the current coding unit is an edge of a transform block and the transform block includes one or more non-zero transform coefficient levels; Equipped with the first value is different from the second value; the first value is 1; The method comprises: At least one of the current coding unit and a neighboring coding unit adjacent to the boundary of the current coding unit has non-zero transform coefficients. an absolute difference between motion vectors used to predict the current coding unit and the neighboring coding unit is greater than or equal to one integer sample; the current coding unit and the neighboring coding unit are predicted based on different reference pictures; the number of motion vectors used in prediction of the current coding unit and the neighboring coding unit is different; incrementing the first value by one if it is determined that one of the following conditions is satisfied: The method further comprises:

7. determining whether the boundary of the current coding unit is aligned with an 8x8 grid; setting the boundary strength of the boundary of the current coding unit to 0 if it is determined that the boundary of the current coding unit is not aligned with the 8x8 grid. The method of claim 1 or 4, further comprising:

8. performing deblocking for a boundary for a luma component if the boundary strength of the boundary is greater than 0. The method of claim 1 or 4, further comprising:

9. performing deblocking for the boundary for the chroma components if the boundary strength of the boundary is greater than 1. The method of claim 1 or 4, further comprising:

10. The method of claim 1 or 4, wherein if the current coding unit is predicted by applying CIIP, then the current coding unit is considered as a coding unit with intra prediction when performing deblocking.

11. An encoder comprising processing circuitry for carrying out the method according to any one of claims 1 to 10.

12. A decoder comprising processing circuitry for carrying out the method according to any one of claims 1 to 10.

13. A program for causing a computer to execute the method according to any one of claims 1 to 10.

14. A decoder comprising: one or more processors; a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, the instructions, when executed by the one or more processors, configuring the decoder to perform the method of any one of claims 1 to 10; A decoder comprising:

15. 1. An encoder comprising: one or more processors; a non-transitory computer-readable storage medium coupled to the one or more processors and storing instructions for execution by the one or more processors, the instructions, when executed by the one or more processors, configuring the encoder to perform the method of any one of claims 1 to 10; An encoder comprising:

16. a non-transitory memory storage device configured to store video data in the form of a bitstream; A video decoder configured to perform the method according to any one of claims 1 to 10.

1. A video data decoding device comprising: