Method for filtering reconstructed video data and image encoding or decoding device

By adopting deblocking filtering technology in video encoding, the visual artifact problem at the boundary of the intra-frame subpartition in video encoding is solved, and the encoding performance and reconstruction quality are improved.

CN118984381APending Publication Date: 2024-11-19SHARP KK
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410984888.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2019-03-16
Filing Date
2020-02-19
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

Existing video encoding technology has visual artifact problems when reconstructing video data, especially at the boundaries of subpartitions within the frame, which affects encoding performance.

Method used

Deblocking filtering technology is adopted to receive the reconstructed brightness sample matrix, divide it into two or four sub-partitions according to the intra-subdivision ISP mode, and determine the maximum filter length according to the size of the sub-partition edge, and apply deblocking filter The reconstructed brightness sample matrix is ​​processed to reduce artifacts.

Benefits of technology

It effectively reduces visual artifacts in the video encoder and improves video encoding performance. Especially in the ISP encoding mode, it improves the smoothness of the sub-partition boundary, making the reconstruction quality of video data more realistic.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118984381A_ABST
    Figure CN118984381A_ABST
Patent Text Reader

Abstract

The invention provides a method for filtering reconstructed video data, an image encoding device and an image decoding device. The method comprises: receiving a matrix of reconstructed luma samples, the reconstructed luma samples being divided into two or four sub-partitions (ISPs) by an intra sub-partition (ISP) mode, with an ISP edge located between two adjacent ISPs, the two adjacent ISPs comprising a P block and a Q block adjacent to the ISP edge; determining a first maximum filter length equal to 7 when an edge of one of the P block and the Q block is perpendicular to the ISP edge and a first size of the edge of the one of the P block and the Q block is greater than or equal to 32; setting a non-zero value for the ISP edge to determine a boundary strength; and deblocking the matrix comprising the reconstructed luminance samples of the ISP edge based on the determined first maximum filter length when the boundary strength for the ISP edge is equal to 2.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application. The application number of the original application is "202080014509.5", the original application date is February 19, 2020, and the name of the original application is "System and method for applying a deblocking filter to reconstructed video data". The entire contents of the original application are incorporated into this application by reference. CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] The present application is a national phase application of international patent application PCT / JP2020 / 006624, filed on February 19, 2020, and now published as WO2020 / 171143. The present application claims the benefit and priority of U.S. Provisional Patent Application Serial No. 62 / 807703 filed on February 19, 2019, U.S. Provisional Patent Application Serial No. 62 / 810913 filed on February 26, 2019, U.S. Provisional Patent Application Serial No. 62 / 813985 filed on March 5, 2019, U.S. Provisional Patent Application Serial No. 62 / 816844 filed on March 11, 2019, U.S. Provisional Patent Application Serial No. 62 / 817348 filed on March 12, 2019, and U.S. Provisional Patent Application Serial No. 62 / 819575 filed on March 16, 2019, the contents of which are hereby fully incorporated by reference into the present application. Technical Field

[0003] The present invention relates to video coding, and more particularly, to techniques for performing deblocking of reconstructed video data. Background Art

[0004] Digital video functions can be incorporated into a wide range of devices, including digital televisions, laptop or desktop computers, tablet computers, digital recording devices, digital media players, video game devices, including cellular phones called smart phones, medical imaging devices, etc. Digital video can be encoded according to video coding standards. Video coding standards define the format of compatible bit streams that encapsulate coded video data. Compatible bit streams are data structures that can be received and decoded by video decoding devices to generate reconstructed video data. Video coding standards can be combined with video compression technology. Examples of video coding standards include ISO / IEC MPEG-4 video and ITU-T H.264 (also known as ISO / IEC MPEG-4 AVC) and high-efficiency video coding (HEVC). HEVC is described in High Efficiency Video Coding (HEVC), ITU-T H.265 in December 2016, referred to herein as ITU-T H.265, and ITU-T H.265 is incorporated by reference. ITU-T H.265 is currently being considered for expansion and improvement to develop the next generation of video coding standards. For example, the ITU-T Video Coding Experts Group (VCEG) and ISO / IEC (Moving Picture Experts Group (MPEG) (collectively referred to as the Joint Video Exploration Team (JVET)) are working to standardize video coding techniques that have compression capabilities that significantly exceed the current HEVC standard. Joint Exploration Model 7 (JEM 7), Algorithmic Description of Joint Exploration Test Model 7 (JEM 7), ISO / IEC JTC1 / SC29 / WG11 Document: July 2017, JVET-G1001, Torino, IT (incorporated herein by reference) describes coding features from a coordinated test model study conducted by JVET as potentially enhancing video coding techniques beyond the capabilities of ITU-T H.265. It should be noted that the coding features of JEM 7 are implemented in the JEM reference software. As used herein, the term JEM may refer collectively to the coding features included in the JEM 7 and the implementation of the JEM reference software. In addition, at the 10th meeting of ISO / IEC JTC1 / SC29 / WG11 held in San Diego, California from April 16 to 20, 2018, in response to the "Joint Call for Proposals on Video Compression with Capabilities beyond HEVC" jointly issued by VCEG and MPEG, the groups proposed multiple descriptions of video coding tools.Based on the multiple descriptions of the video coding tools, the initial draft text of the resulting video coding specification is described in "Generic Video Coding (Draft 1)", document JVET-J1001-v2, ISO / IEC JTC1 / SC29 / WG11, 10th meeting, San Diego, California, April 16-20, 2018, incorporated herein by reference and referred to as JVET-J1001. The next generation video coding standard currently being developed by VCEG and MPEG is known as the Versatile Video Coding (VVC) project. "Generic Video Coding (Draft 4)", document JVET-M1001-v1, ISO / IEC JTC1 / SC29 / WG11, 13th meeting, Marrakech, Massachusetts, January 9-18, 2019, incorporated herein by reference and referred to as JVET-M1001, JVET-M1001 represents the current iteration of the video coding specification draft text corresponding to the VVC project.

[0005] Video compression techniques can reduce the data requirements for storing and sending video data. Video compression techniques can reduce data requirements by exploiting the inherent redundancy in video sequences. Video compression techniques can subdivide video sequences into successively smaller parts (i.e., groups of pictures within a video sequence, pictures within a group of pictures, regions within pictures, sub-regions within regions, etc.). Intra-frame prediction coding techniques (e.g., spatial prediction techniques within pictures) and inter-frame prediction techniques (i.e., inter-picture techniques (time)) can be used to generate the difference between the video data unit to be encoded and the reference unit of the video data. The difference may be referred to as residual data. The residual data may be encoded as quantized transform coefficients. Syntax elements may associate residual data with reference coding units (e.g., intra-frame prediction mode indexes and motion information). Residual data and syntax elements may be entropy encoded. Entropy-encoded residual data and syntax elements may be included in a data structure forming a compatible bitstream. Summary of the invention

[0006] In one example, a method for filtering reconstructed video data is provided, the method comprising: receiving a matrix of reconstructed luminance samples, the reconstructed luminance samples being divided into two or four ISPs by an intra-frame sub-division area ISP mode, wherein an ISP edge is located between two adjacent ISPs, the two adjacent ISPs including a P block and a Q block adjacent to the ISP edge; when an edge of one of the P block and the Q block is perpendicular to the ISP edge, determining whether a first size of the edge of the one of the P block or the Q block is greater than or equal to 32; determining a maximum filter length based on the determination of whether the first size is greater than or equal to 32; and deblocking the matrix of the reconstructed luminance samples including the ISP edge based on the determined maximum filter length.

[0007] In one example, a device for filtering reconstructed video data is provided, the device comprising one or more processors, the one or more processors being configured to: receive a matrix of reconstructed luma samples, the reconstructed luma samples being divided into two or four ISPs by an intra-frame sub-division area ISP mode, wherein an ISP edge is located between two adjacent ISPs, the two adjacent ISPs comprising a P block and a Q block adjacent to the ISP edge; when an edge of one of the P block and the Q block is perpendicular to the ISP edge, determine whether a size of the edge of the one of the P block or the Q block is greater than or equal to 32; determine a maximum filter length based on the determination of whether the first size is greater than or equal to 32; and deblock the matrix of the reconstructed luma samples including the ISP edge based on the determined maximum filter length.

[0008] In one example, a method for filtering reconstructed video data is provided, the method comprising: receiving a matrix of reconstructed luma samples, the reconstructed luma samples being divided into two or four ISPs by an intra-frame sub-division area ISP mode, wherein an ISP edge is located between two adjacent ISPs, the two adjacent ISPs comprising a P block and a Q block adjacent to the ISP edge; determining a first maximum filter length equal to 7 for the one of the P block and the Q block when an edge of the one of the P block and the Q block is perpendicular to the ISP edge and a first size of the edge of the one of the P block and the Q block is greater than or equal to 32; setting a non-zero value for the ISP edge to determine a boundary strength; and deblocking the matrix of the reconstructed luma samples including the ISP edge based on the determined maximum filter length.

[0009] In one example, an image encoding device for filtering reconstructed video data is provided, the image encoding device comprising: at least one processor; and a storage device, the storage device being coupled to the at least one processor and storing a plurality of instructions executed by the at least one processor, wherein when the at least one processor executes the plurality of instructions, the plurality of instructions causes the at least one processor to perform the above-mentioned method for filtering reconstructed video data.

[0010] In one example, an image decoding device for filtering reconstructed video data is provided, the image decoding device comprising: at least one processor; and a storage device, the storage device being coupled to the at least one processor and storing a plurality of instructions executed by the at least one processor, wherein when the at least one processor executes the plurality of instructions, the plurality of instructions causes the at least one processor to perform the above-mentioned method for filtering reconstructed video data. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] [ Figure 1 ] Figure 1 is a conceptual diagram showing an example of a group of pictures encoded according to quadtree multi-tree partitioning according to one or more techniques of the present disclosure. [ Figure 2A ] Figure 2A is a conceptual diagram showing an example of encoding a video data block according to one or more techniques of the present disclosure. [ Figure 2B ] Figure 2B is a conceptual diagram showing an example of encoding a video data block according to one or more techniques of the present disclosure. [ Figure 3 ] Figure 3 is a conceptual diagram showing an example of a video component sampling format that may be used according to one or more techniques of this disclosure. [ Figure 4A ] Figure 4A is a conceptual diagram of a block of video data including a deblocking boundary, according to one or more techniques of this disclosure. [ Figure 4B ] Figure 4B is a conceptual diagram of a block of video data including a deblocking boundary, according to one or more techniques of this disclosure. [ Figure 5 ] Figure 5 is an example table that may be used to determine deblocking parameters in accordance with one or more techniques of this disclosure. [ Fig. 6A ] Fig. 6A is a conceptual diagram illustrating a block of video data divided into intra-frame sub-partitions, according to one or more techniques of this disclosure. [ Figure 6B ] Figure 6B is a conceptual diagram illustrating a block of video data divided into intra-frame sub-partitions, according to one or more techniques of this disclosure. [ Figure 7 ] Figure 7 is an example block diagram illustrating a system that may be configured to encode and decode video data according to one or more techniques of the present disclosure. [ Figure 8 ] Figure 8 is an example block diagram illustrating a video encoder that may be configured to encode video data in accordance with one or more techniques of this disclosure. [ Fig. 9 ] Fig. 9 1 is an example block diagram of a video decoder that may be configured to decode video data according to one or more techniques of this disclosure. [ Fig. 10A ] Fig. 10Ais a conceptual diagram showing a block of video data divided into sub-block transforms according to one or more techniques of this disclosure. [ Fig. 10B ] Fig. 10B is a conceptual diagram showing a block of video data divided into sub-block transforms according to one or more techniques of this disclosure. DETAILED DESCRIPTION

[0012] In general, the present disclosure describes various techniques for encoding video data. Specifically, the present disclosure describes techniques for performing deblocking of reconstructed video data. Specifically, the present disclosure describes techniques for performing deblocking in the case where one or more video blocks are encoded according to a coding mode within a sub-partition. In the case where one or more video blocks are encoded according to a coding mode within a sub-partition, performing deblocking according to the techniques described herein is particularly useful for reducing visual artifacts, which improves the performance of the video encoder. It should be noted that although the techniques of the present disclosure are described with respect to ITU-T H.264, ITU-T H.265, JEM, and JVET-M1001, the techniques of the present disclosure are generally applicable to video encoding. For example, the encoding techniques described herein can be incorporated into a video encoding system (including a video encoding system based on a future video encoding standard) including a video block structure, an intra-frame prediction technique, an inter-frame prediction technique, a transform technique, a filtering technique, and / or an entropy coding technique, rather than the techniques contained in ITU-T H.265, JEM, and JVET-M1001. Therefore, references to ITU-T H.264, ITU-T H.265, JEM, and / or JVET-M1001 are for illustrative purposes and should not be construed as limiting the scope of the technology described herein. In addition, it should be noted that the incorporation by reference of documents herein is for illustrative purposes and should not be construed as limiting or creating ambiguity regarding the terms used herein. For example, where an incorporated reference provides a definition of a term that is different from another incorporated reference and / or where a term is used herein, the term should be interpreted in a manner that broadly includes each corresponding definition and / or in a manner that includes each specific definition in an alternative.

[0013] In one example, a method of filtering reconstructed video data includes receiving a matrix including sample values ​​for adjacent reconstructed video blocks of a video data component, determining a boundary strength value for a boundary between adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and modifying sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0014] In one example, an apparatus for video encoding includes one or more processors configured to receive a matrix of sample values ​​comprising adjacent reconstructed video blocks for components of video data, determine a boundary strength value for a boundary between the adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and modify sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0015] In one example, a non-transitory computer-readable storage medium includes instructions stored thereon that, when executed, cause one or more processors of a device to receive a matrix of sample values ​​comprising adjacent reconstructed video blocks for components of video data, determine a boundary strength value for a boundary between the adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and modify sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0016] In one example, an apparatus includes means for receiving a matrix including sample values ​​for adjacent reconstructed video blocks of a video data component, means for determining a boundary strength value for a boundary between adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and means for modifying sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0017] The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.

[0018] Video content generally includes a video sequence consisting of a series of frames (or pictures). A series of frames may also be referred to as a group of pictures (GOP). Each video frame or picture may be divided into one or more regions. Regions may be defined according to a basic unit (e.g., a video block) and a set of rules defining regions (e.g., a region must be an integer number of video blocks arranged in a rectangle). As used herein, the term video block may generally refer to a region of a picture, or more specifically to a matrix of maximum sample values ​​that may be predictably encoded, its subdivision and / or corresponding structure. In addition, the term "current video block" may refer to a region of a picture being encoded or decoded. A video block may be defined as a matrix of sample values ​​that may be predictively encoded. It should be noted that in some cases, a pixel value may be described as a sample value comprising each component of video data, which may also be referred to as a color component (e.g., brightness (Y) and chrominance (Cb and Cr) components or red, green and blue components). It should be noted that in some cases, the terms pixel value and sample value may be used interchangeably. In addition, in some cases, a pixel or sample may be referred to as a pixel. The video sampling format (which may also be referred to as the chroma format) may define the number of chroma samples included in a video block relative to the number of luma samples included in the video block. For example, for a 4:2:0 sampling format, the sampling rate of the luma component is twice that of the chroma components in both the horizontal and vertical directions. As a result, for a video block formatted according to the 4:2:0 format, the width and height of the sample matrix for the luma component is twice the width and height of each sample matrix for the chroma components. Figure 3 is an example conceptual diagram illustrating a 16x16 video block formatted according to a 4:2:0 sample format. Figure 3 shows the relative position of chroma samples with respect to luma samples within a video block. Video blocks are usually defined in terms of the number of horizontal and vertical luma samples. Thus, Figure 3 , a 16x16 video block formatted according to the 4:2:0 sample format includes 16x16 samples of the luma component and 8x8 samples for each chroma component. For a video block formatted according to the 4:2:2 format, the width of the sample matrix of the luma component is twice the width of the sample matrix of each chroma component, but the height of the sample matrix of the luma component is equal to the height of the sample matrix of each chroma component. In addition, for a video block formatted according to the 4:4:4 format, the sample matrix for the luma component has the same width and height as the sample matrix for each chroma component.

[0019] Video blocks can be sorted within a picture according to a scanning mode (e.g., raster scanning). The video encoder can perform predictive coding on video blocks and their subdivisions. Video blocks and their subdivisions can be referred to as nodes. ITU-T H.264 specifies macroblocks including 16x16 luminance samples. That is, in ITU-T H.264, pictures are divided into macroblocks. ITU-T H.265 specifies a structure similar to a coding tree unit (CTU) (which can be referred to as a maximum coding unit (LCU)). In ITU-T H.265, pictures are divided into CTUs. In ITU-T H.265, for a picture, the CTU size can be set to include 16x16, 32x32, or 64x64 luminance samples. In ITU-T H.265, a CTU consists of a corresponding coding tree block (CTB) for each component of video data (e.g., luminance (Y) and chrominance (Cb and Cr)). It should be noted that a video with one luma component and two corresponding chroma components can be described as having two channels, a luma channel and a chroma channel. In addition, in ITU-T H.265, a CTU can be partitioned according to a quadtree (QT) partition structure, which causes the CTB of the CTU to be partitioned into coding blocks (CBs). That is, in ITU-T H.265, a CTU can be divided into quadtree leaf nodes. According to ITU-T H.265, a luma CB together with two corresponding chroma CBs and associated syntax elements is called a coding unit (CU). In ITU-T H.265, the minimum allowed size of a CB can be signaled. In ITU-T H.265, the minimum allowed size of a luma CB is 8x8 luma samples. In ITU-T H.265, a decision is made at the CU level to encode a picture area using intra prediction or inter prediction.

[0020] In ITU-T H.265, a CU is associated with a prediction unit (PU) structure rooted at the CU. In ITU-T H.265, the PU structure allows the luma and chroma CBs to be partitioned to generate corresponding reference samples. That is, in ITU-T H.265, the luma and chroma CBs can be partitioned into respective luma and chroma prediction blocks (PBs), wherein the PBs include blocks of sample values ​​to which the same prediction is applied. In ITU-T H.265, a CB can be divided into 1, 2, or 4 PBs. ITU-T H.265 supports PB sizes from 64x64 samples to 4x4 samples. In ITU-T H.265, square PBs are supported for intra prediction, where the CBs can form a PB or the CBs can be partitioned into four square PBs. In ITU-T H.265, in addition to square PBs, rectangular PBs are also supported for inter prediction, where the CBs can form PBs by halving vertically or horizontally. Furthermore, it should be noted that in ITU-T H.265, for inter prediction, four asymmetric PB partitions are supported, where a CB is divided into two PBs at one quarter of the height (top or bottom) or width (left or right) of the CB. Intra prediction data (e.g., intra prediction mode syntax element) or inter prediction data (e.g., motion data syntax element) corresponding to the PB is used to generate reference and / or prediction sample values ​​for the PB.

[0021] As described above, each video frame or picture segment may be divided into one or more regions. For example, according to ITU-T H.265, each video frame or picture segment may be divided into one or more fragments, and further divided into one or more tiles, wherein each fragment contains a sequence of CTUs (e.g., in raster scan order), and wherein the tile is a sequence of CTUs corresponding to a rectangular area of ​​the picture. It should be noted that in ITU-T H.265, a fragment is a sequence of one or more slice segments, starting with an independent fragment, and containing all subsequent subordinate slice segments (if any) before the next independent slice segment (if any) within the same access unit. A slice segment, like a fragment, is a sequence of CTUs. Therefore, in some cases, the terms fragment and slice segment can be used interchangeably to indicate a sequence of CTUs arranged in raster scan order. In addition, it should be noted that in ITU-T H.265, a tile may be composed of CTUs contained in more than one fragment, and a fragment may be composed of CTUs contained in more than one tile. However, ITU-T H.265 stipulates that one or both of the following conditions must be met: (1) all CTUs in a fragment belong to the same tile; (2) all CTUs in a tile belong to the same fragment. For JVET-M1001, a fragment needs to consist of an integer number of complete tiles, rather than just an integer number of complete CTUs. Therefore, in some video coding techniques, a fragment that includes a group of CTUs that do not form a rectangular area of ​​a picture may or may not be supported. In addition, a fragment that needs to consist of an integer number of complete tiles is called a tile group. The techniques described herein are applicable to fragments, tiles, and / or tile groups. Figure 1 An example conceptual diagram of a group of picture groups including a group of tile groups is shown. Figure 1 , Figure 3 It is shown as including two tile groups (ie, tile group 1 and tile group 2). It should be noted that in some cases, tile group 1 and tile group 2 may be categorized as fragments and / or tiles.

[0022] JEM specifies that the maximum size of a CTU is 256x256 luminance samples. JEM specifies a quadtree plus binary tree (QTBT) block structure. In JEM, the QTBT structure enables the quadtree leaf nodes to be further divided by a binary tree (BT) structure. That is, in JEM, the binary tree structure enables the quadtree leaf nodes to be recursively split vertically or horizontally. In JVET-M1001, the CTU is divided according to a quadtree plus multi-type tree (QTMT) structure. The QTMT in JVET-M1001 is similar to the QTBT in JEM. However, in JVET-M1001, in addition to indicating a binary partition, the multi-type tree can also indicate a so-called ternary (or ternary tree (TT)) partition. The ternary partition divides the block into three blocks vertically or horizontally. In the case of vertical TT partitioning, the block is split from the left edge by a quarter of its width and from the right edge by a quarter of its width; in the case of horizontal TT partitioning, a block is split from the upper edge by a quarter of its height and from the lower edge by a quarter of its height. Reference again Figure 1 , Figure 1 An example is given in which a CTU is divided into quadtree leaf nodes and the quadtree leaf nodes are further divided according to BT partitioning or TT partitioning. That is, the dashed lines in the figure represent additional binary and ternary partitions in the quadtree.

[0023] For intra-frame prediction coding, the intra-frame prediction mode can specify the position of the reference sample within the picture. In ITU-TH.265, the possible intra-frame prediction modes defined include a plane (i.e., surface fitting) prediction mode, a DC (i.e., overall horizontal level flat) prediction mode, and 33 angle prediction modes (prediction modes: 2-34). In JEM, the possible intra-frame prediction modes defined include a plane prediction mode, a DC prediction mode, and 65 angle prediction modes. It should be noted that the plane and DC prediction modes can be referred to as non-directional prediction modes, and the angle prediction mode can be referred to as a directional prediction mode. It should be noted that the techniques described herein can be generally applicable regardless of the number of possible prediction modes defined.

[0024] For inter-frame prediction coding, one or more previously decoded pictures, i.e., reference pictures, are determined, and a motion vector (MV) identifies samples in the reference picture used to generate a prediction of the current video block. For example, the current video block can be predicted using reference sample values ​​located in one or more previously encoded pictures, and a motion vector is used to indicate the position of the reference block relative to the current video block. The motion vector can describe, for example, the horizontal displacement component of the motion vector (i.e., MV x), the vertical displacement component of the motion vector (i.e., MV y), and the resolution of the motion vector (e.g., quarter-pixel precision, half-pixel precision, one-pixel precision, two-pixel precision, four-pixel precision). The previously decoded pictures may include pictures output before or after the current picture, and the previously decoded pictures may be organized into one or more reference picture lists and identified using reference picture index values. In addition, in inter-frame prediction coding, uni-prediction refers to using sample values ​​from a single reference picture to generate a prediction, and bi-prediction refers to using corresponding sample values ​​from two reference pictures to generate a prediction. That is, in uni-prediction, a single reference picture and a corresponding motion vector are used to generate a prediction of a current video block, and in bi-prediction, a first reference picture and a corresponding first motion vector and a second reference picture and a corresponding second motion vector are used to generate a prediction of a current video block. In bi-prediction, individual sample values ​​are combined (e.g., added, rounded and cut, or averaged according to weights) to generate a prediction. Pictures and their regions can be classified based on the type of prediction mode that can be used to encode their video blocks. That is, for regions with B type (e.g., B tile groups), bi-prediction, uni-prediction and intra-prediction modes can be used, for regions with P type (e.g., P tile groups), uni-prediction and intra-prediction modes can be used, and for regions with I type (e.g., I tile groups), only intra-prediction modes can be used. As described above, reference pictures are identified by reference indexes. For example, there can be a single reference picture list for P tiles, RefPicList0 for B tiles, and in addition to RefPicList0, there can also be a second independent reference picture list RefPicList1. It should be noted that for uni-prediction in B-picture groups, one of RefPicList0 or RefPicList1 can be used to generate the prediction. In addition, it should be noted that during the decoding process, when starting to decode a picture, a reference picture list is generated from previously decoded pictures stored in the decoded picture buffer (DPB).

[0025] In addition, the coding standard may support various modes of motion vector prediction. Motion vector prediction enables the value of the motion vector of the current video block to be derived based on another motion vector. For example, a set of candidate blocks with associated motion information may be derived from the spatial neighboring blocks and the temporal neighboring blocks of the current video block. In addition, the generated (or default) motion information may be used for motion vector prediction. Examples of motion vector prediction include advanced motion vector prediction (AMVP), temporal motion vector prediction (TMVP), the so-called "merge" mode, and "skip" and "direct" motion inference. In addition, other examples of motion vector prediction include advanced temporal motion vector prediction (ATMVP) and spatiotemporal motion vector prediction (STMVP). For motion vector prediction, both the video encoder and the video decoder perform the same process to derive the candidate set. Therefore, for the current video block, the same candidate set is generated during encoding and decoding. For the merge mode, all motion information associated with the selected candidate (i.e., motion vector displacement value, reference picture index, and reference picture list) is inherited as the motion information of the current video block. That is, at the video encoder, a candidate block is selected from the derived candidate set, and the index value included in the bitstream may indicate the selected candidate, thereby indicating the motion information of the current video block. For non-merge mode, the motion vector information of the selected candidate may be used as a motion vector predictor (MVP) for the motion vector of the current video block. That is, at the video encoder, a candidate block is selected from the derived candidate set, and an index value indicating the selected candidate and a delta value indicating the difference between the motion vector predictor and the motion vector of the current PB (i.e., a motion vector delta (MVD)) may be included in the bitstream. In addition, for non-merge mode, a syntax element identifying a reference picture is included in the bitstream.

[0026] As described above, intra prediction data or inter prediction data is used to generate reference sample values ​​for a block of sample values. The difference between the sample values ​​included in the current PB or another type of picture region structure and the associated reference samples (e.g., those samples generated using prediction) can be referred to as residual data. The residual data may include individual matrices of difference values ​​corresponding to each component of the video data. The residual data may be in the pixel domain. Transformations such as discrete cosine transform (DCT), discrete sine transform (DST), integer transform, wavelet transform, or conceptually similar transforms may be applied to a matrix of difference values ​​to generate transform coefficients. It should be noted that in ITU-T H.265 and JVET-M1001, CU is associated with a transform unit (TU) structure rooted at the CU level. That is, in order to generate transform coefficients, the matrix of difference values ​​may be partitioned (e.g., four 8x8 transforms may be applied to a 16x16 matrix of residual values). For each component of the video data, this subdivision of the difference may be referred to as a transform block (TB). It should be noted that in some cases, a core transform and an immediately following secondary transform (in a video encoder) may be applied to generate transform coefficients. For the video decoder, the order of transforms is reversed. It should be noted that in JVET-M1001, coding units included in a P or B block group can be encoded according to a CU skip mode, wherein when a CU skip mode is indicated, the coding units are encoded according to a subset of motion vector prediction modes, and the coding units are encoded directly from the prediction, i.e., residual data is not used to encode the video block.

[0027] The quantization process may be performed directly (e.g., in the case of palette-coded quantization) on the transform coefficients or residual sample values. Quantization approximates the transform coefficients by limiting the amplitude to a set of specified values. Quantization essentially scales the transform coefficients to change the amount of data required to represent a set of transform coefficients. Quantization may include dividing the transform coefficients (or the values ​​resulting from adding the offset values ​​to the transform coefficients) by a quantization scaling factor and any associated rounding function (e.g., rounding to the nearest integer). The quantized transform coefficients may be referred to as coefficient level values. Inverse quantization (or "dequantization") may include the multiplication of the coefficient level value by the quantization scaling factor, as well as any reciprocal rounding or offset addition operations. It should be noted that, as used herein, the term quantization process may refer to division by a scaling factor in some instances to produce a level value, and may refer to multiplication by a scaling factor in some instances to restore the transform coefficients. That is, the quantization process may refer to quantization in some cases and inverse quantization in some cases. In addition, it should be noted that although in some examples below, the quantization process is described by arithmetic operations associated with decimal representation, such description is for illustrative purposes and should not be interpreted as limiting. For example, the techniques described herein may be implemented in a device using binary operations, etc. For example, the multiplication and division operations described herein may be implemented using bit shift operations, etc.

[0028] Quantized transform coefficients and syntax elements (e.g., syntax elements indicating the coding structure of a video block) may be entropy encoded according to an entropy coding technique. The entropy coding process includes encoding the values ​​of the syntax elements using a lossless data compression algorithm. Examples of entropy coding techniques include content adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), probability interval segmentation entropy coding (PIPE), etc. The entropy-encoded quantized transform coefficients and the corresponding entropy-encoded syntax elements may form a compatible bitstream that may be used to reproduce video data at a video decoder. An entropy coding process, such as CABAC, may include performing binarization on the syntax elements. Binarization refers to the process of converting the value of a syntax element into a series of one or more bits. These bits may be referred to as an "element stream". Binarization may include one or a combination of the following coding techniques: fixed-length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-order exponential Golomb coding, and Golomb-Rice coding. For example, binarization may include representing the integer value 5 of the syntax element as 00000101 using an 8-bit fixed-length binarization technique, or representing the integer value 5 as 11110 using a unary coding binarization technique. As used herein, each of the terms fixed-length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-order exponential Golomb coding, and Golomb-Rice coding may refer to general implementations of these techniques and / or more specific implementations of these coding techniques. For example, an implementation of Golomb-Rice coding may be specifically defined according to a video coding standard. In the example of CABAC, for a particular element stream, the context provides the most likely state (MPS) value of the element stream (i.e., the MPS of the element stream is one of 0 or 1) and the probability value that the element stream is the MPS or the least likely state (LPS). For example, the context may indicate that the MPS of the element stream is 0 and the probability that the element stream is 1 is 0.3. It should be noted that the context may be determined based on the value of a previously encoded element stream, the element stream including the element stream in the current syntax element and the previously encoded syntax element. For example, the value of a syntax element associated with a neighboring video block may be used to determine the context of the current element stream.

[0029] With respect to the equations used in this article, the following arithmetic operators can be used: +Addition —Subtraction * Multiplication, including matrix multiplication X y Power. Specifies x raised to the power of y. In other contexts, such symbols are used for superscripts rather than for interpretation as powers. / Integer division, the result is truncated towards zero. For example, 7 / 4 and -7 / -4 are truncated to 1, and -7 / 4 and 7 / -4 are truncated to -1. ÷ is used to represent division in mathematical equations where no truncation or rounding is intended. Used to represent division in mathematical equations where rio truncation or rounding is intended. x%y modulo, the remainder of x divided by y, is defined only for integers x and y, where x>=0 and y>=0.

[0030] Additionally, the following logical operators can be used: x&&y Boolean logical "AND" of x and y x||y Boolean logical OR of x and y ! Boolean logic "not" x?y:z If x is TRUE or not equal to 0, it evaluates to the value of y; otherwise, it evaluates to the value of z.

[0031] Additionally, the following relational operators can be used: > Greater than >= greater than or equal to < less than <= less than or equal to == is equal to ! = Not equal to

[0032] Furthermore, the following bitwise operators can be used: &Bit-wise "and". When operating on integer arguments, the operation is performed on the two's complement representation of the integer value. When operating on a binary argument containing fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. |Bit-wise "or". When operating on integer arguments, the operation is performed on the two's complement representation of the integer value. When operating on a binary argument containing fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. ^Bit-wise "exclusive OR". When operating on integer arguments, the operation is performed on the two's complement representation of the integer value. When operating on a binary argument containing fewer bits than another argument, the shorter argument is extended by adding more significant bits equal to 0. Arithmetic right shift of the two's complement integer representation of x>>y by y binary digits. This function is defined only for non-negative integer values ​​of y. The bits shifted in as a result of the right shift have a value equal to the MSB of x before the bit shift operation. Arithmetic left shift of the two's complement integer representation of x<<yx by y binary digits. This function is defined only for non-negative integer values ​​of y. The bits shifted into the least significant bit (LSB) as a result of the left shift have a value equal to 0.

[0033] Furthermore, the following assignment operators can be used: =Assignment operator ++Increment, i.e., x++ is equal to x=x+1; when used in matrix indexing, evaluates to the value of the variable before the increment operation. --Decrement, i.e., x-equals x=x-1; when used in matrix indexing, the value of the variable is evaluated before the decrement operation. + = increase by a specified amount, i.e., x+ = 3 is equivalent to x = x + 3, and x + = (-3) is equivalent to x = x + (-3). - = decrease by a specified amount, i.e., x - = (-3) is equivalent to x = x - (-3).

[0034] Additionally, the following mathematical functions can be used: Clip1 Y (x)=Clip3(0, (1<<BitDepth Y )-1, x) Clip1C(x)=Clip3(0, (1<<BitDepth C )-1,x) floor(x) is the largest integer less than or equal to x. Log2(x) is the 2-based logarithm of x.

[0035] Figure 2A-2B FIG. 1 is an example conceptual diagram illustrating encoding of a video data block. Figure 2A As shown, a current block of video data (e.g., corresponding to a CB of a video component) is encoded by subtracting a set of prediction values ​​from the current block of video data to produce a residual, performing a transform on the residual, and quantizing the transform coefficients to produce a level value. The level value is encoded into the bitstream. Figure 2B As shown, the current block of video data is decoded by performing inverse quantization on the level value, performing an inverse transform, and adding a set of prediction values ​​to the resulting residual. Figure 2A-2B In the example of , the sample values ​​of the reconstructed block are different from the sample values ​​of the encoded current video block. In this way, the encoding can be said to be lossy. However, for a viewer of the reconstructed video, the difference in sample values ​​may be considered acceptable or imperceptible.

[0036] In addition, if Figure 2A-2BAs shown, coefficient-level values ​​are generated using a scaling factor matrix. In ITU-T H.265, a matrix of scaling factors is generated by selecting a scaling matrix and multiplying each entry in the scaling matrix by a quantization scaling factor. In ITU-T H.265, a scaling matrix is ​​selected based on a partial prediction mode and a color component, where scaling matrices of the following sizes are defined: 4x4, 8x8, 16x16, and 32x32. It should be noted that in some examples, the scaling matrix may provide the same value for each entry (i.e., all coefficients are scaled according to a single value). The value of the quantization scaling factor may be determined by a quantization parameter QP. In ITU-T H.265, for a bit depth of 8 bits, QP may take 52 values ​​from 0 to 51, and a change of 1 in QP typically corresponds to a change of about 12% in the value of the quantization scaling factor. In addition, in ITU-T H.265, a QP value for a set of transform coefficients may be derived using a predicted quantization parameter value (which may be referred to as a predicted QP value or a QP prediction value) and an optionally signaled quantization parameter delta value (which may be referred to as a QP delta value or a deltaQP value). In ITU-T H.265, a quantization parameter may be updated for each CU, and a corresponding quantization parameter may be derived for each luma and chroma channel.

[0037] As described above, quantization may be achieved by dividing the transform coefficients by a scaling factor, and may be further used to change the amount of data required to represent a group of transform coefficients. That is, increasing the scaling factor (or degree of quantization) reduces the amount of data required to represent the group coefficients. It should be noted that as the degree of quantization increases (e.g., the transform coefficients are divided by a larger scaling factor value), the amount of distortion may increase (e.g., the reconstructed video data may appear more "blocky" to the user). In some cases, block artifacts may cause block boundaries (e.g., coding blocks, transform blocks, prediction blocks, sub-blocks, etc.) of the reconstructed video data to be visually perceptible to the user. In order to reduce blocking artifacts, the reconstructed sample values ​​may be modified to minimize artifacts introduced by the video encoding process. Such modifications may generally be referred to as filtering. It should be noted that filtering may occur as part of an in-loop filtering process or a post-loop filtering process. For an in-loop filtering process, the resulting sample values ​​of the filtering process may be used for predictive video blocks (e.g., stored to a reference frame buffer for subsequent encoders at a video encoder and subsequent decoders at a video decoder). For a post-loop filtering process, the resulting sample values ​​of the filtering process are output only as part of the decoding process (e.g., not used for subsequent encoding). For example, for an in-loop filtering process, the sample values ​​generated by filtering the reconstructed block will be used for subsequent decoding (e.g., stored to a reference buffer) and will be output (e.g., output to a display). For a post-loop filtering process, the unmodified reconstructed block will be used for subsequent decoding, and the sample values ​​generated by filtering the reconstructed block will be output.

[0038] Deblocking (or deblocking), deblock filtering, performing deblocking, or applying a deblocking filter refers to the process of smoothing the boundaries of video blocks with adjacent reconstructed video blocks (i.e., making the boundaries less perceptible to a viewer). Smoothing the boundaries of adjacent reconstructed video blocks may include modifying sample values ​​contained in rows or columns adjacent to the boundaries. JVET-M1001 provides a case where a deblocking filter is applied to reconstructed sample values ​​as part of an in-loop filtering process. It should be noted that it is useful to describe the deblocking filter in general in terms of a set of filter parameters. For example, for a set of sample values ​​{a...b} contained in rows or columns, the parameters for the deblocking filter may be specified based on the following equation: The sample value y[n] that should be deblocked: in, Determine the filter length as abs(a-b+1); coeff[m] provides the filter tap values ​​(also called filter coefficients). For example, For {a...b}={0...4}, the set of tap values ​​can be {1, 2, 3, 2, 1}; x[n+m] provides the input sample values ​​corresponding to the support samples. It should be noted that the support size can be greater than or equal to the filter length. It should be noted that the set of filter tap values ​​coeff[m] may depend on n, where n may correspond to a set of positions of a row of samples being deblocked in a set, e.g., {c...d}, where the number of entries in {c..d} corresponds to the number of samples being deblocked / modified. The samples may be arranged perpendicular to the edge / boundary being deblocked.

[0039] Figure 4A-4B 1 shows sample values ​​included in video blocks P and Q having a boundary. As used herein, video blocks P and Q are used to refer to adjacent video blocks having a block boundary to which deblocking may be applied. The manner in which sample values ​​are modified may be based on a defined filter, where pi and qi represent corresponding sample values ​​in columns for vertical boundaries and sample values ​​in rows for horizontal boundaries, and pi′ and qi′ represent modified sample values. The defined filter may define samples to be modified (or filtered) and samples used to determine how to modify the samples. For example, Figure 4A In one example, sample values ​​in each of the first three columns adjacent to the deblocking boundary (shown as filtered samples) may be modified based on sample values ​​in each of the first four columns adjacent to the deblocking boundary (shown as supporting samples).

[0040] VET-M1001 defines a so-called strong filter that modifies sample values ​​in three adjacent rows or columns to a boundary, a so-called weak filter that modifies sample values ​​in rows or columns immediately adjacent to a boundary and conditionally modifies sample values ​​in the second row or column of the boundary, and a so-called chroma filter that modifies sample values ​​in rows or columns immediately adjacent to a boundary. The formulas for modifying sample values ​​based on the strong filter, weak filter, and chroma filter are provided below. Strong filter p0′=Clip3(p0-2*t C , p0+2*t C , (p2+2*p1+2*p0+2*q0+q1+4)>>3) p1′=Clip3(p1-2*t C , p1+2*t C , (p2+p1+p0+q0+2)>>2) p2′=Clip3(p2-2*t C , p2+2*t C , (2*p3+3*p2+p1+p0+q0+4)>>3) q0′=Clip3(q0-2*t C ,q0+2*t c , (p1+2*p0+2*q0+2*q1+q2+4)>>3) q1′=Clip3(q1-2*t c ,q1+2*t C , (p0+q0+q1+q2+2)>>2) q2′=Clip3(q2-2*t C ,q2+2*t C , (p0+q0+q1+3*q2+2*q3+4)>>3) Weak filter Δ=(9*(q0-p0)-3*(q1-p1)+8)>>4 -When Abs(Δ) is less than t c *10, the following sequential steps apply: The filtered sample values ​​p0′ and q0′ are specified as follows: Δ=Clip3(-t C , t c , Δ) p0′=Clip1 Y (p0+Δ) q0′=Clip1 Y (q0-Δ) where p1 and q1 are modified conditionally as follows: Δp=Clip3(-(t C >>1), t C >>1, (((p2+p0+1)>>1)-p1+Δ)>>1) Δq=Clip3(-(t C >>1), t C >>1, (((q2+q0+1)>>1)-q1-Δ)>>1) p l '=Clip Y (p1+Δ p ) q1'=Clip Y (q1+Δq) Chroma filter Δ=Clip3(-t C , t C , ((((q0-p0)<<2)+p1-q1+4)>>3)) p0′=Clip1 C (p0+Δ) q0′=Clip1C(q0-Δ)

[0041] “CE11.1.6, CE11.1.7 and Cell.lS: Joint Proposal for Long-Term Deblocking from Sony, Qualcomm, Sharp, and Ericsson” ISO / IEC JTC1 / SC29 / WG 11, 13th Meeting, 9-18 January 2019, Marrakech, MA, document JVET-M0471, referred to herein as JVET-M0471, modifies the strong filter as follows: t c D 0.2 ={3, 2, 1} p0′=Clip3(p0-t C D[0]*t C , p0+t C D[0]*t C , (p2+2*p1+2*p0+2*q0+q1+4)>>3) p1′=Clip3(p1-t C D[1]*t C , p1+t C D[1]*t C , (p2+p1+p0+q0+2)>>2) p2′=Clip3(p2-t C D[2]*t C , p2+tC D[2]*t C , (2*p3+3*p2+p1+p0+q0+4)>>3) q0′=Clip3(q0-t C D[0]*t C ,q0+t C D[0]*t C , (p1+2*p0+2*q0+2*q1+q2+4)>>3) q1′=Clip3(q1-t C D[1]*t C ,q1+t C D[1]*t C , (p0+q0+q1+q2+2)>>2) q2′=Clip3(q2-t C D[2]*t c ,q2+t C D[2]*t C , (p0+q0+q1+3*q2+2*q3+4)>>3)

[0042] Furthermore, JVET-M0471 defines the so-called luminance long filtering process as follows: The inputs to this process are: - variables maxFilterLengthP and maxFilterLengthQ, - sample values ​​pi and qi, where i = 0..maxFilterLengthP and j = 0..maxFilterLengthQ, -p i and the position of qi, (x P i ,yP i ) and (xQ j , yQ j ), where i = 0..maxFilterLengthP-1 and j = 0..maxFilterLengthQ-1, -Variable tc. The output of this process is: -Filtered sample value p i ′ and q j ′, where i=0..maxFilterLengthP-1, j=0..maxFilterLengtQ-1. The variables refMiddle, refP, and refQ are derived as follows: If maxFilterLengthP is equal to maxFilterLengthQ If maxFilterLengthP is equal to 5 refMiddle=(p4+p3+2*(p2+p1+p0+q0+q1+q2)+q3+q4+8)>>4 otherwise refMiddle=(p6-+p5-+p4+p3+p2+p1+2*(p0+q0)+q1+q2+q3+q4+q5+q6+8)>>4elseif((maxFilterLengthQ is equal to 7 and maxFilterLengthP is equal to 5))or(maxFilterLengthQ is equal to 5 and maxFilterLengthP is equal to 7) refMiddle=(p4+p3+2*(p2+p1+p0+q0+q1+q2)+q3+q4+8)>>4 else if ((maxFilterLengthQ is equal to 5 and maxFilterLengthP is equal to 3)) or (maxFilterLengthQ is equal to 3 and maxFilterLengthP is equal to 5) refMiddle=(p3+p2+p1+p0+q0+q1+q2+q3+4)>>3 Else If ((maxFilterLengthQ is equal to 7, and maxFilterLengthP is equal to 3)) refMiddle=(2*(p2+p1+p0+q0)+p0+p1+q1+q2+q3+q4+q5+q6+8)>>4 otherwise refMiddle=(p6-+p5-+p4+p3+p2+p1+2*(q2+q1+q0+p0)+q0+q1+8)>>4 refP=(pmaxFilterLengtP-+pmaxFilterLengthP-1-+1)>>1 refQ=(qmaxFilterLengtQ-+qmaxFilterLengthQ-1-+1)>>1 Variable f i and tcPD i The definition is as follows: If maxFilterLengthP is equal to 7 f 0..6={59, 50, 41, 32, 23, 14, 5} tCPD0..6={6, 5, 4, 3, 2, 1, 1} Otherwise, if maxFilterLengthP is equal to 5 f 0..4 ={58, 45, 32, 19, 6} t C PD 0..4 ={6,5,4,3,2} Otherwise f 0..2 ={53,32,11} tCPD0..2={6,4,2} Variables gi and tcQD j The definition is as follows: If maxFilterLengthQ is equal to 7 g 0..6 ={59, 50, 41, 32, 23, 14, 5} t C QD 0..6 ={6,5,4,3,2,1,1} Otherwise, if maxFilterLengthQ is equal to 5 g 0..4 ={58, 45, 32, 19, 6} t C QD 0..4 ={6,5,4,3,2} otherwise g 0..2 ={53,32,11} t C QD 0..2 ={6, 4, 2} p i ′=Clip3(p i -(tc*tcPD i )>>1, p i +(tc*tcPD i )>>1,(refMiddle*f i +refP*(64-fi)+32)>>6) q j ′=Clip3(q j -(t C *t C QD j )>>1,q j +(tc*t C QD j)>>1,(refMiddle*g j +refP*(64-g j ) +32)>>6) Where i = 0..maxFilterLengthP-1, j = 0..maxFilterLengthQ-1 When one or more of the following conditions are true, the filtered sample value pi' is replaced by the corresponding input sample value pi, where i = 0..maxFilterLengthP-1: pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xP0][yP0] is equal to 1. The cu_transquant_bypass_flag of the coding unit including the coding block containing sample p0 is equal to 1. When one or more of the following conditions are true, the filtered sample value q i ′ is the corresponding input sample value q j Replace: where j = 0..maxFilterLengthQ-1: pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xQ0][yQ0] is equal to 1. The cu_transquant_bypass_flag of the coding unit including the coding block containing sample q0 is equal to 1.

[0043] JVET-M0471 further defines the so-called chroma long filtering process: The inputs to this process are: -Variable filter length - Chroma sample values ​​pi and qi, where i = 0.. filter length, - chromaticity positions of pi and qi, (xPi, yPi) and (xQi, yQi), -Variable tc The output of this process is -Filtered sample value p i ′ and q j ′, where i=0..filterLength-1. Depending on the value of filterLength, the following applies: - If the variable filter length is equal to 3, then strong filtering is applied as follows: p0′=Clip3(p0-t C , p0+t C, (p3+p2+p1+2*p0+q0+q1+q2+4)>>3) p1′=Clip3(p1-t C , p1+t C , (2*p3+p2+2+p1+p0+q0+q1+4)>>3) p2′=Clip3(p2-t C , p2+t C , (3*p3+2*p2+p1+p0+q0+4)>>3) q0′=Clip3(q0-t C ,q0+t C , (p2+p1+p0+2+q0+q1+q2+q3+4)>>3) q1′=Clip3(q1-t C ,q1+t C , (p1+p0+q0+2*q1+q2+2*q3+4)>>3) q2′=Clip3(q2-t C ,q2+t C , (p0+q0+q1+2*q2+3*q3+4)>>3) - Otherwise, apply weak filtering as follows: Δ=Clip3(-t C , t C , ((((q0-p0)<<2)+p1-q1+4)>>3)) p0′=Clip1 C (p0+Δ) q0′=Clip1 C (q0-Δ) The filtered sample value pi′ is replaced by the corresponding input sample value pi when one or more of the following conditions are true, where i=0..filterLength-1: -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xP0*SubWidthC][yP0*SubHeightC] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the coding unit that includes the coding block containing sample p0. When one or more of the following conditions are true, the filtered sample value q i 'By the corresponding input sample value q i Instead, where i = 0..filterLength-1: -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xQ0*SubWidthC][yQ0*SubHeightC] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the coding unit that includes the coding block containing sample q0. in, According to the chroma format sampling structure specified by chroma_format_idc and disparate_color_plane_flag, in The variables SubWidthC and SubHeightC are specified in Table 1. chroma_forrnat_idc separate_colour_plane_:flag Chroma Format Sub Width C Sub-height C 0 0 monochrome 1 1 1 0 4:2:0 2 2 2 0 4:2:2 2 1 3 0 4:4:4 1 1 3 1 4:4:4 1 1 Table 1 In monochrome sampling, there is only one sample matrix, which is nominally considered to be the brightness matrix. In 4:2:0 sampling, each of the two chroma matrices has half the height and half the width of the luma array. In 4:2:2 sampling, each of the two chroma matrices has the same height and half the width of the luma array. In 4:4:4 sampling, depending on the value of separate_color_plane_flag, the following applies: - If separate_color_plane_flag is equal to 0, each of the two chrominance matrices has the same height and width as the luma matrix. Otherwise (disparate_color_plane_flag is equal to 1), the three color planes are processed separately as monochrome sampled pictures.

[0044] In the above equation, the variable tc is determined according to the decision process for the block edge as follows: The variable qP is derived as follows: qP=((Qp Q +Qp P +1)>>1)+qpOffset in, Q PQ and Q PP are set equal to the Q of the coding unit including the coding block containing samples q0,0 and p0,0, respectively. P value; and qpOffset is the determined offset value. The value of variable β' is calculated according to Figure 5The provisions in the table shown are determined based on the quantization parameter Q derived as follows: Q=Clip3(0.63,qP+(tile_group_bcta_offset_div2《1)) where tile_group_beta_offset_div2 is the value of the syntax element tile_group_beta_offset_div2 for the tile group containing sample q0,0. The variable β is derived as follows: β=β′*(1《(bD-8)) The value of variable tc' is calculated according to Figure 5 The provisions in the table shown are determined based on the quantization parameter Q derived as follows: Q=Clip3(0, 65, qP+2*(bS-1)+(tile_group_tc_offset_div2<<1)) Here, tile_group_tc_offset_div2 is the value of the syntax element tile_group_tc_offset_div2 for the tile group containing sample q0,0. The variable tc is derived as follows: t C =t C '*(1《(bD-8)) in, bD specifies the bit depth of the current component.

[0045] Further, in JVET-M1001, a boundary strength value (bS) is determined for the boundary of blocks Q and P. The value of bS is used to determine whether / how to apply deblocking (i.e., which filter) to a particular boundary. In JVET-M1001, the bS value is derived as one of 0, 1, or 2 as follows: - If sample p0 or q0 is in a coding block of a coding unit coded in intra prediction mode, bS is set equal to 2. Otherwise, if the block edge is also a transform block edge and sample p0 or q0 is in a transform block containing one or more non-zero transform coefficient levels, bS is set equal to 1. Otherwise, bS is set equal to 1 if one or more of the following conditions are true: For the prediction of the coded subblock containing sample p0, a different reference picture or a different number of motion vectors is used than for the prediction of the coded subblock containing sample q0. One motion vector is used to predict the coded subblock containing sample p0, and one motion vector is used to predict the coded subblock containing sample q0, and the absolute difference between the horizontal or vertical components of the motion vectors used is greater than or equal to 4 in units of quarter luma samples. Two motion vectors and two different reference pictures are used to predict a coding sub-block containing sample p0, two motion vectors of the same two reference pictures are used to predict a coding sub-block containing sample q0, 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 of the same reference picture is greater than or equal to 4 in units of quarter luma samples. Two motion vectors for the same reference picture are used to predict a coded subblock containing sample p0, and two motion vectors for the same reference picture are used to predict a coded subblock containing sample q0, and both of the following conditions are true: the absolute difference between the horizontal or vertical components of the list 0 motion vectors used to predict the two coded subblocks is greater than or equal to 4 in units of quarter luma samples, or the absolute difference between the horizontal or vertical components of the list 1 motion vectors used in the prediction of the two coded subblocks is greater than or equal to 4 in units of quarter luma samples. The absolute difference between the horizontal or vertical components of the list 0 motion vector used in the prediction of the coded subblock containing sample p0 and the list 1 motion vector used in the prediction of the coded subblock containing sample q0 is greater than or equal to 4 in units of quarter luma samples, or the absolute difference between the horizontal or vertical components of the list 1 motion vector used in the prediction of the coded subblock containing sample p0 and the list 0 motion vector used in the prediction of the coded subblock containing sample q0 is greater than or equal to 4 in units of quarter luma samples. Otherwise, the variable bS is set equal to 0.

[0046] As described above, intra prediction data may be used to generate reference sample values ​​for a block of sample values. In JVET-M1001, a so-called intra sub-partition (ISP) coding mode may be used for intra prediction. For the ISP coding mode in JVET-M1001, some luma intra prediction blocks (i.e., luma CBs) are further divided vertically or horizontally into two or four sub-partitions according to the block size. Fig. 6A An example of partitioning 4x8 and 8x4 blocks into two sub-partitions according to the ISP coding mode in JVET-M1001 is illustrated. Figure 6B An example of dividing a block of other cases into four sub-partitions according to the ISP coding mode in JVET-M1001 is shown. It should be noted that according to the ISP coding mode in JVET-M1001, all sub-partitions need to meet the condition of having at least 16 samples. In JVET-M1001, each sub-partition in the luma intra prediction block shares the same intra prediction mode. In addition, Figure 6A-6B The processing order of sub-partitions is shown according to JVET-M1001. That is, Figure 6A-6B , processing the sub-partitions generated by horizontal partitioning from top to bottom, and processing the sub-partitions generated by vertical partitioning from left to right. It should be noted that such a processing order may be referred to as a normal processing order, and a reverse processing order may refer to processing the sub-partitions generated by horizontal partitioning from bottom to top, and processing the sub-partitions generated by vertical partitioning from right to left.

[0047] For each subpartition in the luma intra prediction block, at the video encoder, a residual is generated according to the processing order, and at the video decoder, a reconstructed video block is generated. That is, each preceding subpartition is reconstructed before the next subpartition. Therefore, the reconstructed values ​​of each preceding subpartition will be available and used to generate predictions for subsequent subpartitions. That is, according to the normal processing order, the reference samples used to generate subpartition predictions are only located to the left and above the subpartition. In addition, it should be noted that each subpartition has a corresponding residual that is independent of the residuals of other subpartitions. That is, at the video decoder, the residual of each subpartition is generated by inverse quantization and inverse transformation of a set of level values ​​corresponding to the subpartition. Therefore, each subpartition can be said to have a corresponding transform block, and each subpartition boundary can be said to form a transform block edge.

[0048] As described above, inter-frame prediction data can be used to generate reference sample values ​​for sample value blocks. As described above, in JVET-M1001, the coding units included in the P or B tile group can be encoded according to the CU skip mode, wherein when the CU skip mode is indicated, the coding unit is encoded according to a subset of the motion vector prediction mode, and the coding unit is encoded directly from the prediction, that is. The residual data is not used to encode the video block. JVET-M1001 further stipulates that when inter-frame prediction data is used to generate reference sample values, the so-called sub-block transform (SBT) mode can be used for the residual data. The SBT mode allows the entire residual block or only a sub-part of the residual block to be used to encode the CU. In the case of using the entire residual block, the multi-frame inter-transform selection (MTS) information is further parsed to determine the transform type of the CU. In the case of using only a sub-part of the residual block, a portion of the residual block is encoded using an inferred adaptive transform, and another portion of the residual block is cleared. It should be noted that in JVET-M1001, the SBT mode is not applied to the combined inter-intra mode because almost no coding gain is achieved.

[0049] When SBT is used for an intra-CU, SBT type and SBT position information are further decoded from the bitstream to indicate the shape and position of the sub-block. In JVET-M1001, an intra-CU can be split into SBT sub-blocks by horizontal or vertical splitting. In addition, in JVET-M1001, the splitting may occur at half the height (or width) or at a quarter of the height (or width). Fig. 10A , a CB (e.g., a luma CB corresponding to a CU) is shown as being partitioned into sub-blocks SB 0 and SB 1, and for a horizontal partition h1 may be equal to H / 2 or H / 4 (or 3H / 4), and for a vertical partition w1 may be equal to W / 2 or W / 4 (or 3W / 4). The SBT location information indicates the presence of sub-block SB 0 or sub-block SB 1 using residual data. Therefore, the SBT type and SBT location information in JVET-M1001 allow eight SBT partitions, such as Fig. 10B As shown. Fig. 10B Indicates the sub-block with residual data. Note that JVET-M1001 does not allow the corresponding H / 4 or W / 4 split if there are 8 luma samples on one side of the CU.

[0050] In one example, for the luma component, sub-block SB0 or ​​sub-block SB1 may be associated with different core transforms (e.g., DCT-8 and DCT-7). Further, in one example, for the chroma component, sub-block SB0 or ​​sub-block SB1 may be associated with the same core transform (e.g., DCT-2). In addition, when one side of the residual TU is greater than 32, the corresponding transform may be set to DCT-2. Table 2 illustrates the possible transformations that may be based on the position of the sub-block (i.e., Fig. 10B ), color channels of components of the sub-block, and the size of the sub-block. It should be noted that Table 2 illustrates the general concept of horizontal (H) and vertical (V) core transforms that can be performed on sub-blocks based on the position of the sub-block, the color channels of the components of the sub-block, and the size of the sub-block and the techniques described herein are generally applicable regardless of the specific transforms performed on the sub-block based on the position of the sub-block, the color channels of the components of the sub-block, and the size of the sub-block. That is, the transforms indicated in Table 2 can be replaced with other defined transforms. Table 2

[0051] As mentioned above, in JVET-M1001, CTU is divided according to the quadtree plus multi-type tree (QTMT) structure. Fig. 10BThe size and position of the sub-blocks in the CU can be achieved by further partitioning the CU. That is, for example, the CU can be partitioned using BT partitioning, and the resulting sub-CU can have the same size as the position of the sub-block obtained by partitioning the CU using half SBT partitioning. In addition, for the resulting sub-CU, it can be indicated whether the resulting block has any residual by using a flag (e.g., cu_cbf, tu_cbf_luma, tu_cbf_cb, tu_cbf_cr). Therefore, for the case where the main residual of the block is on one side of the block, the SBT mode can be considered a syntactic shortcut.

[0052] Table 3 illustrates the instructive part of the coding unit syntax to enable ISP coding mode and SBT coding mode in JVET-M1001. Table 3

[0053] cu_skip_flag equal to 1 specifies that when decoding a P or B tile group, for the current coding unit, no more syntax elements are parsed after cu_skip_flag[x0][y0] except one or more of the following: merge plus MVD flag mmvd_flag[x0][y0], merge plus MVD index mmvd_merge_flag[x0][y0], merge plus MVD distance index mmvddistance_idx[x0][y0], merge plus MVD direction index mmvd_direction_idx[x0][y0], merge candidate index merge_idx[x0][y0], sub-block based merge flag merge_subblock_flag[x0][y0], sub-block based merge candidate index merge_subblock_idx[x0][y0], merge triangle flag merge_triangle_flag[x0][y0], and merge triangle index [x0][y0]. cu_skip_flag[x0][y0] equal to 0 specifies that the coding unit is not skipped. The matrix index x0, y0 specifies the position (x0, y0) of the top left luma sample of the coding block under consideration relative to the top left luma sample of the picture. When cu_skip_flag[x0][y0] is not present, it is inferred to be equal to 0. pred_mode_flag pred_mode_flag equal to 0 specifies that the current coding unit is encoded in inter prediction mode. pred_mode_flag equal to 1 specifies that the current coding unit is encoded in intra prediction mode. For x=x0..x0+cbWidth-1 and y=y0..y0+cbHeight-1, the variable CuPredMode[x][y] is derived as follows: - If pred_mode_flag is equal to 0, CuPredMode[x][y] is set equal to MODE_INTER. - Otherwise (pred_mode_flag is equal to 1), CuPredMode[x][y] is set equal to MODE_INTRA. When pred_mode_flag is not present, the variable CuPredMode[x][y] is inferred to be equal to MODE_INTRA, x=x0..x0+cbWidth-1 and y=y0..y0+cbHeight-1. intra_luma_ref_idx[x0][y0] specifies that for the intra prediction reference line index IntraLumaRefLineIdx[x][y] as specified in Table 4, x=x0..x0+cbWidth-1 and y=y0..y0+cbHeight-1. When intra_lurna_ref_idx[x0][y0] is not present, it may be inferred to be equal to 0. Table 4 intra_subpartitions_mode_flag[x0][y0] equal to 1 specifies that the current intra coding unit is partitioned into NumIntraSubPartitions[x0][y0] rectangular transform block subpartitions. intra_subpartitions_mode_flag[x0][y0] equal to 0 specifies that the current intra coding unit is not partitioned into rectangular transform block subpartitions. When intra_subpartitions_mode_flag[x0][y0] is not present, it is inferred to be equal to 0. intra_subpartitions_split_flag[x0][y0] specifies whether the intra subpartition split type is horizontal or vertical. When intra_subpartitions_mode_flag[x0][y0] is not present, it is inferred to be equal to 0. The variable IntraSubPartitionsSplitType specifies the partition type used for the current luma coding block, as shown in Table 5. IntraSubPartitionsSplitType is derived as follows: - If intra_subpartitions_mode_flag[x0][y0] is equal to 0, IntraSubPartitionsSplitType is set to 0. Otherwise, IntraSubPartitionsSplitType is set equal to 1+intra_subpartitions_split_flag[x0][y0]. IntraSubPartitionsSplitType Name of IntraSubPartitionsSplitType 0 ISP_NO_SPLIT 1 ISP_HOR_SPLIT 2 ISP_VER_SPLIT Table 5 The variable NumIntraSubPartitions specifies the number of transform block subpartitions that the intra luma coding block is divided into. NumIntraSubPartitions is derived as follows: -If IntraSubPartitionsSplitType is equal to ISP_NO_SPLIT, NumIntraSubPartitions is set to 1. Otherwise, NumIntraSubPartitions is set to 2 if one of the following conditions is true: -cbWidth is equal to 4, cbHeight is equal to 8, -cbWidth equals 8, cbHeight equals 4. Otherwise, NumIntraSubPartitions is set equal to 4. The syntax elements intra_luma_mpm_flag[x0][y0], iintra_luma_mpm_idx[x0][y0], and intra_luma_mpm_remainder[x0][y0] specify the intra prediction mode for luma samples. The matrix indices x0, y0 specify the position (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture. When intra_luma_mpm_tlag[x0][y0] is equal to 1, the intra prediction mode is inferred from the neighboring intra prediction coding units according to [specified derivation process]. When intra_luma_mpm_tlag[x0][y0] is not present, it is inferred to be equal to 1. intra_chroma_pred_mode[x0][y0] specifies the intra prediction mode for chroma samples. The matrix indices x0, y0 specify the position (x0, y0) of the top left luma sample of the considered coding block relative to the top left luma sample of the picture. merge_flag[x0][y0] specifies whether the inter prediction parameters of the current coding unit are inferred from the neighboring inter prediction partitions. The matrix index x0, y0 specifies the position (x0, y0) of the top left luma sample of the considered coding block relative to the top left luma sample of the picture. When merge_flag[x0][y0] does not exist, the inference is as follows: - If cu_skip_flag[x0][y0] is equal to 1, merge_flag[x0][y0] is inferred to be equal to 1. Otherwise, merge_flag[x0][y0] is inferred to be equal to 0. cu_cbf cu_cbf equal to 1 specifies that a transform_tree() syntax structure exists for the current coding unit. cu_cbf equal to 0 specifies that no transform_tree() syntax structure exists for the current coding unit. When cu_cbf does not exist, the inference is as follows: -lf cu_skip_flag[x0][y0] is equal to 1, cu_cbf is inferred to be equal to 0. Otherwise, cu_cbf is inferred to be equal to 1. cu_sbt_flag equal to 1 specifies the use of sub-block transform for the current coding unit. cu_sbt_flag equal to 0 specifies that for the current coding unit, sub-block transform is not used. When cu_sbt_flag is not present, its value is inferred to be equal to 0. Note-: When sub-block transform is used, the coding unit is split into two transform units; one transform unit has residual data and the other does not have residual data. cu_sbt_quad_flag equal to 1 specifies that for the current coding unit, the sub-block transform includes a transform unit that is 1 / 4 the size of the current coding unit. cu_sbt_quad_flag equal to 0 specifies that for the current coding unit, the sub-block transform includes a transform unit that is 1 / 2 the size of the current coding unit. When cu_sbt_quad_flag is not present, its value is inferred to be equal to 0. cu_sbt_horizontal_flag equal to 1 specifies that the current coding unit is split horizontally into 2 transform units. cu_sbt_horizontal_flag[x0][y0] equal to 0 specifies that the current coding unit is split vertically into 2 transform units. When cu_sbt_horizontal_flag is not present, its value is derived as follows: - If cu_sbt_quad_flag is equal to 1, cu_sbt_horizontal_flag is set to allowSbtHorQ. - Otherwise (cu_sbt_quad_flag is equal to 0), cu_sbt_horizontal_flag is set equal to allowSbtHorH. cu_sbt_pos_flag equal to 1 specifies that tu_cbf_luma, tu_cbf_cb, and tu_cbf_cr of the first transform unit in the current coding unit are not present in the bitstream. cu_sbt__pos_flag equal to 0 specifies that tu_cbf_luma, tu_cbf_cb, and tu_cbf_cr of the second transform unit in the current coding unit are not present in the bitstream. The variable SbtNumFourthsTb0 is derived as follows: sbtMinNumFourths=cu_sbt_quad_flag? 1:2 SbtNumFourthsTb0=cu_sbt_pos_flag? (4-sbtMinNumFourths): sbtMinNumFourths

[0054] Quantization and / or use of intra prediction can cause blocking artifacts to appear at sub-partition boundaries. Such blocking artifacts can be addressed by using a deblocking filter. However, in JVET-M 1001, ISP coding mode sub-partition boundaries are not considered deblocking boundaries, which may not be ideal. It should be noted that regarding deblocking, JVET-M 1001 provides the following derivation process of coding sub-block boundaries: The input to this process is: -Specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - variable nCbW that specifies the width of the current coding block, - variable nCbH that specifies the current coding block height, - 2D (nCb W) x (nCb H) matrix edgeFlags, - A variable edge type that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered. The output of this process is the modified two-dimensional (nCbW) x (nCbH) matrix edgeFlags. The number of coded sub-blocks numSbX in the horizontal direction and numSbY in the vertical direction are derived as follows: -If CuPredMode[xCb][yCb] == MODE_INTRA, then numSbX and numSbY are both set equal to 1. Otherwise, numSbX and numSbY are set equal to NumSbX[xCb][yCb] and NumSbY[xCb][yCb], respectively. Depending on the value of edge Type, the following applies: - If edge type equals EDGE_VER and numSbX is greater than 1, i = 1..min((nCbW / 8)-1, numSbX-1),k=0..nCbH-1, the application is as follows: edgeFlags[i*Max(8,nCbW / numSbX)][k]=1 Otherwise, if edge type is equal to EDGE_HOR and numSb Y is greater than 1, then for j=1..min((nCbH / 8)-1, numSb Y-1), k=0..nCb W-1 the following applies: edgeFlags[k][j*Max(8,nCbH / numSb Y)]=1

[0055] Figure 7 1 is an example block diagram of a system that can be configured to encode (i.e., encode and / or decode) video data according to one or more techniques of the present disclosure. System 100 represents an example of a system that uses deblocking techniques to perform video encoding according to one or more examples of the present disclosure. Figure 7 As shown, system 100 includes source device 102, communication medium 110, and target device 120. Figure 7In the example of , source device 102 may include any device configured to encode video data and send the encoded video data to communication medium 110. Target device 120 may include any device configured to receive the encoded video data via communication medium 110 and decode the encoded video data. Source device 102 and / or target device 120 may include computing devices equipped for wired and / or wireless communication, and may include set-top boxes, digital video recorders, televisions, desktop, laptop or tablet computers, game consoles, mobile devices, including, for example, "smart" phones, cellular phones, personal gaming devices, and medical imaging devices.

[0056] The communication medium 110 may include any combination of wireless and wired communication media and / or storage devices. The communication medium 110 may include coaxial cables, fiber optic cables, twisted pairs, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that can be used to facilitate communication between various devices and sites. The communication medium 110 may include one or more networks. For example, the communication medium 110 may include a device configured to access the global information network (e.g., the Internet). The network may operate according to a combination of one or more telecommunication protocols. The telecommunication protocol may include proprietary aspects and / or may include standardized telecommunication protocols. Examples of standardized telecommunication protocols include digital video broadcasting (DVB) standards, advanced television system committee (ATSC) standards, integrated services digital broadcasting (ISDB) standards, cable data service interface specifications (DOCSIS) standards, global system mobile communications (GSM) standards, code division multiple access (CDMA) standards, third generation partnership project (3GPP) standards, European Telecommunications Standards Institute (ETSI) standards, Internet protocol (IP) standards, wireless application protocol (WAP) standards, and Institute of Electrical and Electronics Engineers (IEEE) standards.

[0057] The storage device may include any type of device or storage medium capable of storing data. The storage medium may include a tangible or non-temporary computer-readable medium. The computer-readable medium may include an optical disk, a flash memory, a magnetic memory, or any other suitable digital storage medium. In some examples, the storage device or a portion thereof may be described as a non-volatile memory, and in other examples, a portion of the storage device may be described as a volatile memory. Examples of volatile memory may include random access memory (RAM), dynamic random access memory (DRAM), and static random access memory (SRAM). Examples of non-volatile memory may include a magnetic hard disk, an optical disk, a floppy disk, a flash memory, or an electrically programmable memory (EPROM) or an electrically erasable programmable memory (EEPROM). The storage device may include a memory card (e.g., a secure digital (SD) memory card), an internal / external hard disk drive, and / or an internal / external solid-state drive. Data may be stored on the storage device according to a defined file format.

[0058] Reference again Figure 7 , source device 102 includes video source 104, video encoder 106 and interface 108. Video source 104 may include any device configured to capture and / or store video data. For example, video source 104 may include a camera and a storage device operably coupled thereto. Video encoder 106 may include any device configured to receive video data and generate a compatible bitstream representing video data. A compatible bitstream may refer to a bitstream from which a video decoder can receive and reproduce video data. Aspects of a compatible bitstream may be defined according to a video coding standard. When generating a compatible bitstream, video encoder 106 may compress video data. Compression may be lossy (discernible or indiscernible) or lossless. Interface 108 may include any device configured to receive a compatible video bitstream and send and / or store the compatible video bitstream to a communication medium. Interface 108 may include a network interface card such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can send and / or receive information. In addition, interface 108 may include a computer system interface that enables a compatible video bitstream to be stored on a storage device. For example, interface 108 may include a chipset supporting Peripheral Component Interconnect (PCI) and Peripheral Component Interconnect Express (PCIe) bus protocols, proprietary bus protocols, Universal Serial Bus (USB) protocols, I2C, or any other logical and physical structure that may be used to interconnect peer devices.

[0059] Reference again Figure 7, the target device 120 includes an interface 122, a video decoder 124, and a display 126. The interface 122 may include any device configured to receive a compatible video bitstream from a communication medium. The interface 108 may include a network interface card such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can receive and / or send information. In addition, the interface 122 may include a computer system interface that enables the retrieval of a compatible video bitstream from a storage device. For example, the interface 122 may include a chipset that supports PCI and PCIe bus protocols, proprietary bus protocols, USB protocols, I 2C, or any other logical and physical structure that can be used to interconnect peer devices. The video decoder 124 may include any device configured to receive a compatible bitstream and / or its acceptable changes and reproduce video data therefrom. The display 126 may include any device configured to display video data. The display 126 may include one of a variety of display devices, such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display. The display 126 may include a high-definition display or an ultra-high-definition display. It should be noted that although in Figure 7 , video decoder 124 is described as outputting data to display 126, video decoder 124 can be configured to output video data to various types of devices and / or their subcomponents. For example, as described herein, video decoder 124 can be configured to output video data to any communication medium.

[0060] Figure 8 is an example block diagram of a video encoder 200 that can implement the techniques described herein for encoding video data. It should be noted that although the example video encoder 200 is shown as having different functional blocks, such illustration is for illustrative purposes and does not limit the video encoder 200 and / or its subcomponents to a particular hardware or software architecture. The functionality of the video encoder 200 can be implemented using any combination of hardware, firmware, and / or software implementations. In one example, the video encoder 200 can be configured to encode video data according to the techniques described herein. The video encoder 200 can perform intra-frame prediction encoding and inter-frame prediction encoding of picture regions, and therefore can be referred to as a hybrid video encoder. As shown in FIG. Figure 8 In the example shown, the video encoder 200 receives a source video block. In some examples, the source video block may include picture regions divided according to a coding structure. For example, the source video data may include a macroblock, a CTU, a CB, a sub-division thereof, and / or another equivalent coding unit. In some examples, the video encoder 200 may be configured to perform additional sub-division of the source video block. It should be noted that some of the techniques described herein may be generally applicable to video coding regardless of how the source video data is partitioned before and / or during encoding. Figure 8 In the example of , the video encoder 200 includes an adder 202, a transform coefficient generator 204, a coefficient quantization unit 206, an inverse quantization / transform processing unit 208, an adder 210, an intra-frame prediction processing unit 212, an inter-frame prediction processing unit 214, a filter unit 216 and an entropy coding unit 218.

[0061] like Figure 8 As shown, the video encoder 200 receives a source video block and outputs a bitstream. The video encoder 200 can generate residual data by subtracting a predicted video block from a source video block. Adder 202 represents a component configured to perform the subtraction operation. In one example, the subtraction of the video block occurs in the pixel domain. The transform coefficient generator 204 applies a transform (e.g., a discrete cosine transform (DCT), a discrete sine transform (DST), or a conceptually similar transform) to a residual block or its subdivision (e.g., four 8x8 transforms can be applied to a 16x16 matrix of residual values) to generate a residual transform coefficient set. The transform coefficient generator 204 can be configured to perform any and all combinations of transforms included in the discrete triangular transform family. The transform coefficient generator 204 can output the transform coefficients to a coefficient quantization unit 206. The coefficient quantization unit 206 can be configured to perform quantization of the transform coefficients. As described above, the degree of quantization can be modified by adjusting the quantization parameter. The coefficient quantization unit 206 may be further configured to determine a quantization parameter (QP) and output QP data (e.g., data for determining a quantization group size and / or a delta QP value), which may be used by a video decoder to reconstruct the quantization parameter to perform inverse quantization during video decoding. It should be noted that in other examples, one or more additional or alternative parameters may be used to determine the quantization level (e.g., a scaling factor). The techniques described herein may be generally applicable to determining a quantization level for a transform coefficient corresponding to a component of video data based on a quantization level for a transform coefficient corresponding to another component of the video data.

[0062] like Figure 8 As shown, the quantized transform coefficients are output to the inverse quantization / transform processing unit 208. The inverse quantization / transform processing unit 208 may be configured to apply inverse quantization and inverse transformation to generate reconstructed residual data. Figure 8 As shown, at adder 210, the reconstructed residual data can be added to the predicted video block. In this way, the coded video block can be reconstructed, and the resulting reconstructed video block can be used to evaluate the coding quality of a given prediction, transformation and / or quantization. Video encoder 200 can be configured to perform multiple encoding processes (e.g., performing encoding while changing one or more of the prediction, transformation parameters and quantization parameters). The distortion rate of the bitstream or other system parameters can be optimized based on the evaluation of the reconstructed video block. In addition, the reconstructed video block can be stored and used as a reference for predicting subsequent blocks.

[0063] As described above, the video block may be encoded using an intra prediction mode. The intra prediction processing unit 212 may be configured to select an intra prediction mode for the current video block. The intra prediction processing unit 212 may be configured to use an ISP encoding mode, which may be used for intra prediction. In one example, the ISP encoding mode may be based on the ISP encoding mode described above with respect to JVET-M1001. In addition, according to the techniques of this article, the intra prediction processing unit 212 may be configured so that certain block sizes may not allow certain sub-partitions if the minimum transform dimension does not support the sub-partition dimension. In addition, another consideration for not allowing sub-partitions for certain block sizes may be that if the sub-partitions and their corresponding transform sizes are small (e.g., 2x2, 1x16 transforms), the throughput may be adversely affected. For example, if the current block size is 4x16 (luminance samples), partitioning into 4 sub-partitions of 1x16 may not be allowed. The intra prediction processing unit 212 may be configured to evaluate a frame and / or a region thereof and determine an intra prediction mode for encoding the current block. As Figure 8 As shown, intra-prediction processing unit 212 outputs intra-prediction data (eg, syntax elements) to entropy encoding unit 218 and transform coefficient generator 204 .

[0064] Reference again Figure 8 , the inter-frame prediction processing unit 214 may be configured to perform inter-frame prediction coding on the current video block. The inter-frame prediction processing unit 214 may be configured to receive the source video block and calculate the motion information of the PU of the video block. The motion vector may indicate the displacement of the PU (or similar coding structure) of the video block in the current video frame relative to the prediction block in the reference frame. The inter-frame prediction coding may use one or more reference pictures. For example, the inter-frame prediction processing unit 214 may locate the prediction video block in the frame buffer ( Figure 8 ). It should be noted that the inter-prediction processing unit 214 may also be configured to apply one or more interpolation filters to the reconstructed residual block to calculate sub-integer pixel values ​​for motion estimation. In addition, the motion prediction may be a single prediction (using one motion vector) or a dual prediction (using two motion vectors). The inter-prediction processing unit 214 may be configured to select a prediction block by calculating a pixel difference determined by, for example, the sum of absolute differences (SAD), the sum of squared differences (SSD), or other difference metrics. The inter-prediction processing unit 214 may output the motion prediction data of the calculated motion vector to the entropy coding unit 218.

[0065] Reference again Figure 8 ,like Figure 8As shown, the inter-frame prediction processing unit 214 can receive the reconstructed video block via the filter unit 216, which can be part of the in-loop filtering process. The filter unit 216 can be configured to perform deblocking, sample adaptive offset (SAO) filtering and / or adaptive loop filtering (ALF). As described above, in JVET-M1001, the ISP coding mode sub-partition boundaries are not considered for deblocking, which results in no deblocking being performed on the sub-partition boundaries, which may cause visual artifacts. In one example, according to the technology herein, the filter unit 216 can be configured so that deblocking can be performed on the sub-partition boundaries.

[0066] As described above, in JVET-M1001, the value of bS is used to determine whether / how to apply deblocking to a specific boundary. In one example, the filter unit 216 may be configured to set the bS value to a non-zero value (e.g., 2) for the ISP coding mode sub-partition boundary. It should be noted that although the ISP coding mode is only used for luminance components, in some examples, the bS value of the corresponding boundary of the chrominance component (or chrominance channel) may be set to a non-zero value. In addition, in one example, the corresponding boundary of the chrominance component may be set to not occur, or the bS value may be set to 0. It should be noted that for the ISP coding mode sub-partition boundary, setting the bS value to a non-zero value (e.g., 2) does not necessarily mean that deblocking will be performed on the boundary, because other conditions may need to be met. For example, in one case, the ISP coding mode sub-partition boundary may need to coincide with the NxN sample deblocking grid. That is, for example, if the grid for deblocking is 8x8, the ISP coding mode sub-partition boundary that coincides with the 8x8 grid may be deblocked.

[0067] In one example, filter unit 216 may be configured to encode sub-block boundaries according to the following derivation process: Set the bS value to a non-zero value (e.g., 2) for ISP coding mode sub-division boundaries: The inputs to this process are: - specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - a variable nCbW specifying the width of the current coding block, - a variable nCbH specifying the height of the current coded block, - variable cIdx that specifies the component index of the picture, - a two-dimensional (nCbW) x (nCbH) matrix edge markers with index cIdx components, - Variable edge type that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered. The output of this process is a modified two-dimensional (nCbW) x (nCbH) matrix edgeFlag with index cIdx components. The number of coded sub-blocks numSbX in the horizontal direction and the number of coded sub-blocks numSbY in the vertical direction are derived as follows: - If CuPredMode[xCb][yCb] is equal to MODE_INTRA and (IntraSubPartitionsSplitType is equal to ISP_NO_SPLIT or component index cidx indicates chroma), numSbX and numSbY are both set equal to 1. Otherwise, if CuPredMode[xCb][yCb] is equal to MODE_INTRA and IntraSubPartitionsSplitType is equal to ISP_VER_SPLIT, and the component index cIdx indicates luma, then numSbX is set equal to NumIntraSubPartitions. - Otherwise, if CuPredMode[xCb][yCb] is equal to MODE_INTRA and IntraSubPartitionsSplitType is equal to ISP_HOR_SPLIT, and the component index cIdx indicates luma, then numSbY is set equal to NumIntraSubPartitions. Otherwise, numSbX and numSbY are set equal to NumSbX[xCb][yCb] and NumSbY[xCb][yCb], respectively. Depending on the value of edgeType, the following applies: - If edgeType is equal to EDGE_VER and numSbX is greater than 1, then for i=l..min((nCbW 18)-1,numSbX-1), k=0..nCbH-1, the following applies: edgeFlags[i*Max(8,nCbW / numSbX)][k]=1 Otherwise, if edgeType is equal to EDGE_HOR and numSbY is greater than 1, then for k = 0..nCbW-1, j = l..min((nCbH 18)-1, numSbY-1), the following applies: edgeFlags[k][j*Max(8,nCbH / numSb Y)]=1 The boundary strength derivation process is as follows: The inputs to this process are: - picture sample matrix recPicture, - specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - variable nCbW that specifies the width of the current coding block, - variable nCbH specifying the height of the current coded block, - the variable edgeType that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered, - The variable cldx that specifies the component index of the picture, - A two-dimensional (nCbW)x(nCbH) matrix edge marker with index cIdx components. The output of this process is a two-dimensional (nCbW)x(nCbH) matrix bS that specifies the boundary filter strength for the component with index cldx. Variable xD i ,yD j ,xN and yN are derived as follows: - If edgeType is equal to EDGE_VER, xDi is set equal to (i<<3), 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. - Otherwise (edgeType equals EDGE_HOR), xD i is set equal to (i<<2), 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). For xD with i=0..xN i and yD with j = 0..yN j , the application is as follows: -If edgeFlags[xD i ][yD j ] is equal to 0, then the variable bS[xD i ][yD j ] is set to equal 0. - Otherwise, the following applies: -The sample values ​​p0 and q0 are derived as follows: - If edge type equals EDGE_VER, then set p0 equal to recPicture[xCb+xD i -1][yCb+yD j], and set q0 equal to recPicture[xCb+xD i ][yCb+yD j ]. - Otherwise (edgeType equals EDGE_HOR), p0 is set equal to recPicture[xCb+xD i ][yCb+yD j -1] and q0 is set equal to recPicture[xCb+xD i ][yCb+yD j ]. -The variable bS[xD i ][yD j ] is derived as follows: If sample p0 or q0 is in a coding block of a coding unit coded in intra prediction mode, then bS[xD i ][yD j ] is set equal to 2.

[0068] It should be noted that regarding the derivation process of the coding sub-block boundary, according to the technology in this article, generally, the ISP edge inside the block (e.g., the edge inside the coding block and aligned with the transform block edge of the component) can be a candidate for deblocking, and other conditions may need to be met before deblocking. In addition, it should be noted that regarding the above-mentioned boundary strength derivation process, according to the technology in this article, in one embodiment, the edge not marked as a deblocking candidate can be assigned a predetermined value of boundary strength (e.g., 0) and / or in one embodiment, when either side of the boundary (e.g., the transform boundary) is encoded using intra-frame mode, the boundary strength can be set to a predetermined value (e.g., 2). In one example, in order to simplify the execution of deblocking, the filter unit 216 can be configured so that the deblocking grid can be set to have a specific size (e.g., a 4x4 luminance sample grid), where, as described above, the boundaries that coincide with the deblocking grid are considered for deblocking. That is, the deblocking grid provides the finest granularity for deblocking. In one example, this can be implemented in the following way: only the (vertical) block size on either side of the deblocking boundary (for the component / channel) and the type of edge to be deblocked are considered. For example, luma long filter selection may be performed by browsing Table 6 top-down and identifying the first matching entry for block size and edge type. Table 6

[0069] Regarding the following Tables 6 and 7-10, in the example, (P side + Q side) for brightness corresponds to the following listed The variables maxFilterLengthP and maxFilterLengthQ in the filtering process: The inputs to this process are: - variables maxFilterLengthP and maxFilterLengthQ, - Sample value p i and q j , where i=0..maxFilterLengthP and j=0..maxFilterLengthQ, -p i and q j 、(xP i ,yP i ) and (xQ j , yQ j ) where i = 0..maxFilterLengthP-1 and j = 0..maxFilterLengthQ-1, -Variable tc. The output of this process is: -Filtered sample value p i "and q j ”, where i = 0..maxFilterLengthP-1, j = 0..maxFilterLengtQ–1. The variables refMIiddle, refP and refQ are derived as follows: If maxFilterLengthP is equal to maxFilterLengthQ If maxFilterLengthP is equal to 5 refMiddle=(p4+p3+2*(p2+p1+p0+q0+q1+q2)+q3+q4+8)>4otherwise refMiddle=(p6-+p5-+p4+p3+p2+p1+2*(p3+q0)+q1+q2+q3+q4+q5+q6+8)>>4 Else, if ((maxFilterLengthQ is equal to 7 and maxFilterLengthP is equal to 5) or (maxFilterLengthQ is equal to 5 and maxFilterLengthP is equal to 7) refMiddle=(p4+p3+2*(p2+p1+p0+q0+q1+q2)+q3+q4+8)>>4 Else, if ((maxFilterLengthQ is equal to 5 and maxFilterLengthP is equal to 3) or (maxFilterLengthQ is equal to 3 and maxFilterLengthP is equal to 5) refMiddle=(p3+p2+p1+p0+q0+q1+q2+q3+4)>>3 Else, if ((maxFilterLengthQ is equal to 7, and maxFilterLengthP is equal to 3) refMiddle=(2*(p2+p1+p0+q C )+p0+p1+q1+q2+q3+q4+q5+q6+8)>>4 otherwise refMiddle=(p6-+p5-+p4+p3+p2+p1+2*(q2+q1+q0+p0)+q0+q1+8)>>4 refP=(pmaxFilterLengtP-+pmaxFilterLengthP·1-+1)>>1 refQ=(qmaxFilterLengtQ-+qmaxFilterLengthQ-1-+1)>>1 Variable f i and tcPD i The definition is as follows: If maxFilterLengthP is equal to 7 f 0..6 ={59, 50, 41, 32, 23, 14, 5} t C PD 0..6 ={6,5,4,3,2,1,1} Otherwise, if maxFilterLengthP is equal to 5 f 0..4 ={58, 45, 32, 19, 6} tcPD0.4 = {6, 5, 4, 3, 2} otherwise f 0..2 ={53,32,11} t C PD 0..2 ={6, 4, 2} Variable g i and tcQD j The definition is as follows: If maxFilterLengthQ is equal to 7 g 0..6 ={59, 50, 41, 32, 23, 14, 5} QTCE 0..6 ={6,5,4,3,2,1,1} Otherwise, if maxFilterLengthQ is equal to 5 g0.4={58, 45, 32, 19, 6} QTCE 0..4 ={6,5,4,3,2} otherwise g02 = {53, 32, 11} QTCE 0..2 ={6, 4, 2} p i ′=Clip3(p i (t c *t c PD)>>1, p i +(t c *tcPD i )>>1,(refMiddle*f i +refP*(64-f i ) +32)>>6) q j ′=Clip3(q j -(t C *t C QD j )>>1,q j +(t C *t c QD j )>>1,(refMiddle*g j +refP*(64-g j )+32)>>6) where i = 0..maxFilterLengthP-I and j = 0..maxFilterLengthQ-1 When one or more of the following conditions are true, the filtered sample value pi' is replaced by the corresponding input sample value p (where i = 0..maxFilterLengthP-1): -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xP0][yP0] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the CU that includes the BC containing sample p0 When one or more of the following conditions are true, the filtered sample value qi′ is replaced by the corresponding input sample value qj (where j=0..maxFilterLengthQ-1): -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xQ0][yQ0] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the coding unit that includes the coding block containing sample q0. in: pcm_loop_filter_disabled_flag specifies whether the loop filter process is disabled for reconstructed samples in coding units with pcm_flag equal to 1 as follows: - If pcm_loop_filter_disabled_flag is equal to 1, deblocking filtering and sample adaptive offset filtering processes are disabled on reconstructed samples in coding units with pcm_flag equal to 1. Otherwise (pcm_loop_filter_disabled_flag value is equal to 0), deblocking filtering and sample adaptive offset filtering processes on reconstructed samples in coding units with pcm_flag equal to 1 are not disabled. When pcm_loop_filter_disabled_flag is not present, it is inferred to be equal to 0. The value of cu_transquant_bypass_flag initializes whether the inverse transform and scaling (dequantization) processing steps are bypassed. In one example, a P side or Q side equal to 3 corresponds to a strong filtering as described in the following filtering process: The inputs to this process are: - sample values ​​pi and qi, where i = 0..3, - the positions of pi and qi, (xPi, yPi) and (xQi, yQi), where i = 0..2, - variable dE, - variables dEp and dEq, containing the decision to filter samples pl and ql respectively, -Variable tc. The output of this process is: - the number of filtered samples nDp and nDq, - Filtered sample values ​​pi' and qi', where i = 0..nDp-1, j = 0..nDq-1. Depending on the value of dE, the following applies: If the variable dE is equal to 2, then both nDp and nDq are set equal to 3 and strong filtering is applied as follows: tD 0..2 ={3, 2, 1} p0′=Clip3(p0-t C D[0]*t C , p0+t C D[0]*t c , (p2+2*p1+2*p0+2*q0+q1+4)>>3) p1′=Clip3(p1-t c D[1]*t C , p1+t C D[1]*t C , (p2+p1+p0+q0+2)>>2) p2′=Clip3(p2=t C D[2]*t C , p2+t C D[2]*t C , (2*p3+3*p2+p1+p0+q0+4)>>3) q0′=Clip3(q0-t C D[0]*t C ,q0+t c D[0]*t c , (p1+2*p0+2*q0+2*q1+q2+4)>>3) q1′=Clip3(q1-t c D[1]*t c ,q1+t C D[1]*t c , (p0+q0+q1+q2+2)>>2) q2′=Clip3(q2-t C D[2]*t C ,q2+t C D[2]*t C , (p0+q0+q1+3*q2+2*q3+4)>>3) Otherwise, nDp and nDq are set to both equal to 0 and a weak filter is applied as follows: -The applications are as follows: Δ=(9*(q0-p0)-3*(q1-p1)+8)>>4 - When Abs(Δ) is less than tc*10, the sequential steps are applied as follows: The filtered sample values ​​p0′ and q0′ are specified as follows: Δ=Clip3(-t C , t C , Δ) p0′=Clip1 Y (p0+Δ) q0′=Clip1 Y (q0-Δ) When dEp is equal to 1, the filtered sample value p 1′ is designated as follows: Δp=Clip3(-(t C >>1), t C >>1, (((p2+p0+1)>>1)-p1+Δ)>>1) p1′=Clip1 Y (p1+Δp) When dEq is equal to 1, the filtered sample value q1′ is specified as follows: Δq=Clip3(-(t c >>1), t C >>1, (((q2+q0+1)>>1)-q1-Δ)>>1) q1′=Clip1 Y (q1+Δq) nDp is set equal to dEp+1 and nDq is set equal to dEq+1. Set nDp equal to 0 when nDp is greater than 0 and one or more of the following conditions are true: pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xP0][yP0] is equal to 1. The cu_transquant_bypass_flag of the coding unit including the coding block containing sample p0 is equal to 1. Set nDq equal to 0 when nDq is greater than 0 and one or more of the following conditions are true: -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xQ0][yQ0] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the coding unit that includes the coding block containing sample q0.

[0070] It should be noted that using Table 6 can minimize the number of conditional checks and avoid inconsistent operations along different edges (e.g., inside a CTU).

[0071] In one example, luma long filter selection may be accomplished by browsing Table 7 top-down and identifying the first matching entry for block size and edge category. Table 7

[0072] It should be noted that using Table 7 can minimize the number of condition checks and avoid inconsistent operations along different edges (e.g., inside a CTU).

[0073] In one example, luma long filter selection may be accomplished by browsing Table 8 top-down and identifying the first matching entry for block size and edge category. Table 8

[0074] It should be noted that using Table 8 can minimize the number of conditional checks and avoid inconsistent operations along different edges (e.g., inside a CTU and at the CTU top boundary).

[0075] In one example, luma long filter selection may be accomplished by browsing Table 9 or Table 10 top-down and identifying the first matching entry for block size and edge category. Table 9 Table 10

[0076] In one example, chroma long filter selection may be accomplished by browsing Table 11 or Table 12 top-down and identifying the first matching entry for block size and edge category. Table 11 Table 12

[0077] With respect to Tables 11 and 12, in one example, the P side or Q side for chroma is 3, which corresponds to a filtering operation when filterLength is equal to 3 in the process described below. In one example, the P side or Q side for chroma is 1, which corresponds to a filtering operation when filterLength is not equal to 3 in the process described below. In other examples, a filtering operation of 1+1 may correspond to the above-described chroma weak filtering operation. This procedure is only called if ChromaArrayType is not equal to 0. The input to this process is: -Variable filterLength - Chroma sample value p i and q i , i=0…filterLength, - chromaticity positions of pi and qi, (xPi, yPi) and (xQi, yQi), -Variable tc The output of this process is: -i=0 filtered sample value p i ′ and q j ', i = 0...filterLength-1 Depending on the value of filterlength, the following applies: - If variable filter length is equal to 3, the following strong filtering is applied: p0′=Clip3(p0-t c , p0+t c , (p3+p2+p1+2*p0+q0+q1+q2+4)>>3) p1′=Clip3(p1-t c , p1+t C , (2*p3+p2+2*p1+p0+q0+q1+4)>>3) p2′=Clip3(p2-t c , p2+t c ,(3*p3+2*p2+p1+p0+q0+4)>>3) q0′=Clip3(q0-t C ,q0+t C , (p2+p1+p0+2*q0+q1+q2+q3+4)>>3) q1′=Clip3(q1-t C ,q1+t C , (p1+p0+q0+2*q1+q2+2*q3+4)>>3) q2′=Clip3(q2-t C ,q2+t C , (p0+q0+q1+2*q2+3*q3+4)>>3) - Otherwise, the following weak filtering is applied: Δ=Clip3(-t c , t C , ((((q0-p0)<<2)+p1-q1+4)>>3)) p0′=Clip1 C (p0+Δ) q0′=Cli[l C(q0-Δ) The filtered sample value pi′ is replaced by the corresponding input sample value pi when one or more of the following conditions are true: i=0...filterLength-1: -pcm_loop_filter_disabled_flag equals 1, pcm_flag[xP0*SubWidthC][yP0* SubHeightC] is equal to 1. -- The cu_transquant_bypass_flag of the coding unit containing the coding block of sample p0 is equal to 1. When one or more of the following conditions are true, the filtered sample value qi′ is replaced by the corresponding input sample value qi: i=0..filterLength-1: -pcm_loop_filter_disabled_flag is equal to 1 and pcm_flag[xQ0*SubWidthC][yQ0* SubHeightC] is equal to 1. - cu_transquant_bypass_flag is equal to 1 for the coding unit that includes the coding block containing sample q0.

[0078] With respect to Tables 6-12, in one example, one or more of the following may apply: when reading sample values ​​for decision, non-deblocked sample values ​​may be read, and when reading sample values ​​for filtering, non-deblocked sample values ​​may be read. It should be noted that in some cases, due to the simplification of the selection logic, it may not be possible to perform parallel execution of deblocking in the horizontal (or vertical) direction without using additional buffers.

[0079] In one example, the filter unit 216 can be configured such that the order of deblocking processing is determined or selected for the edges when deblocking. In one example, the processing order can include deblocking horizontal deblocked edges from top to bottom (before deblocking the edge, deblocking the edge above it), followed by deblocking vertical deblocked edges from left to right (before deblocking the edge, deblocking the edge to its left). In one example, the processing order can include deblocking vertical deblocked edges from left to right (before deblocking the edge, deblocking the edge to its left), followed by deblocking horizontal deblocked edges from top to bottom (before deblocking the edge, deblocking the edge above it).

[0080] In one example, the filter unit 216 can be configured so that the deblocking processing order can be defined. For example, the CTU is processed in coding order, and within the CTU, the CU is processed in coding order, and for the CU, only the left edge and the top edge are processed. In the example when processing a block, the vertical transform edge that can be deblocked is processed first from left to right, and then the horizontal transform edge that can be deblocked is processed from top to bottom. In the example when processing a block, the horizontal transform edge that may be deblocked is processed from top to bottom, and then the vertical transform edge that may be deblocked is processed first from left to right.

[0081] In one example, when reading sample values ​​for decision, non-deblocked sample values ​​and deblocked sample values ​​may be read. In one example, when reading sample values ​​for filtering, non-deblocked sample values ​​and deblocked sample values ​​may be read.

[0082] In one example, the filter unit 216 may be configured to deblock the picture group boundary edge for a second time. In one example, the filter unit 216 may be configured to deblock the picture group boundary edge for a second time. In one example, the filter unit 216 may be configured to deblock the picture segment boundary edge for a second time. In one example, the filter unit 216 may be configured to deblock the motion limited block set (MCTS) boundary edge for a second time. In one example, for the tile group / tile / segment / MCTS, the vertical boundary (subset or all) samples on the left and the (subset or all) samples on the right may be deblocked / filtered before the samples at the tile group boundary are deblocked / filtered. In one example, for the tile group / tile / segment / MCT, the horizontal boundary of the (subset or all) samples above and the (subset or all) samples below may be deblocked / filtered before the samples at the tile group boundary are deblocked / filtered.

[0083] In one example, filter unit 216 may be configured such that x+x (e.g., 5) deblocking is performed on all deblocking edges on the deblocking grid. In one example, the size of the block on one side will result in both edges of the block being deblocked by a single filtering operation (samples at the boundary of the two edges are modified).

[0084] As described above, in JVET-M1001, the CTU is divided according to a quadtree plus multi-type tree (QTMT) structure. In JVET-M1001, the luminance channel and the chrominance channel can be divided according to separate trees, which is called using a dual tree. In JVET-M1001, when a block aligned with an 8x8 luminance grid contains a subblock, the subblock boundary (distance 8) is marked as a candidate deblocking edge. In one example, according to the technology herein, the filter unit 216 can be configured so that when partitioning is performed using a separate (dual) tree and when processing a chrominance channel, the boundary strength is determined based on a value corresponding to the chrominance component (e.g., a chrominance component motion vector). In one example, according to the technology herein, the filter unit 216 can be configured so that when partitioning is performed using a separate (dual) tree and when the luminance channel is being processed, the boundary strength is determined based only on a value corresponding to the luminance component (e.g., a luminance component motion vector). In addition, it should be noted that in the case of separate (dual) luminance and chrominance trees, in some cases, the luminance and chrominance edges may not be aligned. In one example, according to the techniques herein, filter unit 216 may be configured such that when processing a single partition tree, boundary strengths corresponding to all color components may be set, and when processing a dual tree, corresponding boundary strengths corresponding to the components being processed may be set.

[0085] In JVET-M1001, the internal (e.g., sub-block) edges of the transform block can be deblocked even when the residual is non-zero. In some cases, deblocking is required only when the residual amount is zero or small. In one example, according to the techniques herein, the filter unit 216 can be configured so that deblocking of the internal (sub-block) edges of the transform block occurs only when the sum of the absolute values ​​of the residuals is less than a threshold. In one example, according to the techniques herein, the filter unit 216 can be configured so that deblocking of the internal (sub-block) edges of the transform block occurs only when the number of non-zero coefficients is less than a threshold.

[0086] As described above, in JVET-M1001, the bS value is derived as one of 0, 1, or 2, and the bS value can be used in the filtering decision. In one example, according to the techniques herein, the filter unit 216 can be configured to additionally or alternatively determine the filtering decision based on whether the Q block or the P block is a large block (e.g., a transform block, a prediction block, a coding block, a subblock). In one example, determining whether the Q block is a large block (i.e., bSideQisLargeBIk) or the P block is a large block (i.e., bSidePisLargeBIk) can be as follows: If edge type is equal to EDGE_VER, then the ordered steps applied are as follows: … The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: If edge type equals EDGE_HOR, and (y brightness position of sample p0, 0% CtbSize Y) equals 0, then bSidePisLargeBIk is set to 0 Otherwise, if p0,0 belongs to a transform block having a width greater than or equal to 32 in luma samples, bSidePisLargeBIk is set equal to 1, otherwise bSidePisLargeBIk is set equal to 0. If q0,0 belongs to a transform block having a width greater than or equal to 32 in luma samples, bSideQisLargeBIk is set equal to 1, otherwise bSideQisLargeBIk is set equal to 0. … Otherwise, (edge ​​type equals EDGE_HOR), apply the following ordered steps: … The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: If p0,0 belongs to a transform block with height greater than or equal to 32, bSidePisLargeBIk is set equal to 1, otherwise bSidePisLargeBIk is set equal to 0. If q0,0 belongs to a transform block with height greater than or equal to 32, bSideQisLargeBIk is set equal to 1, otherwise bSideQisLargeBIk is set equal to 0.

[0087] As above about Figure 10A-10B As described above, the SBT type and SBT location information in JVET-M1001 allows 8 SBT partitions, such as Fig. 10B About Fig. 10B In each of (a)-(h) in FIG. 14 , the size (i.e., H or W) of the CU (or other video block) into which the sub-blocks are partitioned results in different sizes of sub-blocks SB0 and SB1. Table 13 provides a summary of the different sizes of sub-blocks SB0 and SB1 according to the size of the partitioned CU. In Table 13, for a CU with a luma sample height of H in horizontal partitions (a)-(d), the luma sample height h is specified for sub-blocks SB0 and SB1. L Similarly, in Table 13, for a CU with luma sample width W for vertical partitions (e)-(h), the resulting width W in luma samples is specified for sub-blocks sb0 and sb1. L. It should be noted that in some cases, if the height (or width) of the CU is less than a threshold, the CU may not be allowed to be split into sb0 and sb1. For example, referring to Table 13, the case of a CU with a height (or width) less than threshold 8 is not shown. It should be noted that in other examples, other thresholds can be used, for example, threshold 16. In these examples, Table 13 can be updated as needed. In one example, luma and chroma can be divided in different ways. For example, if a video block is located in an intra-frame segment with an independent tree, luma and chroma can have different restrictions. In addition, in one example, SBT information can signal luma and chroma separately (for example, if a video block is located in an intra-frame segment with a separate tree). In addition, as described above, in JVET-M1001, if there are 8 luma samples on one side of the CU, the corresponding H / 4 or W / 4 split is not allowed. These examples are shown as NA in Table 13. Table 13

[0088] To determine whether / how to apply deblocking, each entry in Table 13 may be assigned an example. Table 14 illustrates the examples assigned to each entry in Table 13. It should be noted that in the example shown in Table 14, common cases are assigned to the corresponding horizontal and vertical SBT partitions. In other examples, different cases may be specified for horizontal and vertical SBT partitions. Table 14

[0089] As described above, with respect to Table 2, the horizontal (H) and vertical (V) core transforms performed on a sub-block may be based on the position of the sub-block, the color channels of the components of the sub-block, and the size of the sub-block. Therefore, each case in Table 14 may also be associated with a horizontal (H) and vertical (V) core transform. Therefore, the cases in Table 14 may correspond to whether the transform is performed on SB 0 or SB 1, the size of SB0 or ​​SB 1, and whether the horizontal (H) and vertical (V) core transforms are performed on SB 0 or SB 1. Therefore, regardless of the SBT mode technique used to generate the sub-block, determining whether / how to apply deblocking for each case shown in Table 14 may be applicable to sub-blocks having positions, sizes, and core transforms corresponding to the cases shown in Table 14. For example, "CE6: Inter-block sub-block transforms (CE6.4.1)," ISO / IEC JTC1 / SC29 / WG11 13th Meeting, January 9-18, 2019, Marrakech, MA, document JVET-M0140, referred to as JVET-M0140, describes where QT partitions can be used to generate SBT sub-blocks. In JVET-M0140, residual data is provided for one of the sub-blocks. Therefore, the sub-blocks generated according to JVET-M0140 can correspond to the case in Table 14 due to having the same size (e.g., h or w) and core transform.

[0090] In one example, according to the techniques of this document, for the purpose of deblocking, the rules applied to regular edges (e.g., CU edges) can also be applied to SBT sub-block edges. Table 15 illustrates that for each case in Table 14, three SBT sub-block edges are specified: (1) left or top (L or T); (2) middle (M); and (3) right or bottom (R or B), and for each edge, the maximum number of samples that can be modified on each side of the edge is specified; according to the above-mentioned JVET-M0471, the allowed long filters for deblocking are specified; and the preferred long filters according to the techniques of this document are specified.

[0091] Regarding Table 15, when "To be determined" is provided for the maximum number of samples that can be modified on each side of the edge, this indicates that the number of samples depends on the neighboring blocks.

[0092] Regarding Table 15, when a "?" is provided for the filter, this means that the neighboring block size can determine which of the three values ​​7, 5, 3 is possible. For example, for ?+7, if the left (or top) edge is a large block, then both 7+7 and 3+7 are allowed. However, if the left (or top) edge is not a large block, then only 3+7 is allowed.

[0093] Regarding Table 15, when "*None" is provided for the filter, this means that the long filter cannot be used at the edge. For example, the large block condition, i.e., the orthogonal block size on the deblocking side is greater than or equal to a threshold, such as 32 (in luma samples), is not satisfied.

[0094] Finally, with respect to Table 15, when "?" and None* are provided for the filter (e.g., ?+None* or None*+?), a long filter can still be used at the edge if the corresponding neighboring block is a large block, but the long filter type can only be ?+3 or 3+?, respectively. Table 15

[0095] Regarding Table 15, it should be noted that the only condition for the middle edge of a block using SBT to be deblocked is when the width (or height) of the block is greater than or equal to 64, because the large block condition is not met for the remaining cases. This corresponds to cases A and D, and as shown, the preferred filtering in this case is 7+7. It should be noted that the large block condition is evaluated based on the transform size rather than the coding block size (for external and internal edges). Therefore, in one example, according to the technology of this article, the marking process can be to mark the internal (i.e., middle) edge of the SBT as a candidate for luma strong and luma weak filter deblocking. In addition, if the size of the (P side and / or Q side) block perpendicular to the direction of the deblocked edge is greater than or equal to 64, the inner edge of the SBT can be a candidate for luma long filter deblocking. In addition, in one example, according to the technology of this article, for the inner edge of the SBT block, for blocks that do not use sub-block motion vectors, the boundary strength determination based on the motion vector can be skipped (because the motion vector on either side of the boundary is the same as the reference picture).

[0096] As described above, the chroma format may define the number of chroma samples included in a video block relative to the number of luma samples included in the video block, and for the 4:2:0 sampling format, the sampling rate of the luma component is twice the sampling rate of the chroma components in the horizontal and vertical directions. For the 4:2:0 sampling format, Table 15 corresponds to Table 13. In Table 15, for a CU having a height H in luma samples, for horizontal partitions (a)-(d), the height h obtained in the chroma samples is specified for sub-blocks SB 0 and SB 1. C Similarly, in Table 15, for a CU with width W in luma samples, for vertical partitions (e)-(h), the resulting width W in chroma samples is specified for sub-blocks SB 0 and SB 1. C . Table 16

[0097] Table 17 illustrates the cases assigned to each entry in Table 16. It should be noted that in the example shown in Table 17, common cases are assigned to the corresponding horizontal and vertical SBT partitions. In other examples, different cases may be specified for horizontal and vertical SBT partitions. Table 17

[0098] Table 18 illustrates that for each case in Table 17, three SBT sub-block edges are specified: (1) left or top (L or T); (2) middle (M); and (3) right or bottom (R or B), and for each edge, the maximum number of samples that can be modified on each side of the edge is specified; in accordance with the above-mentioned JVET-M0471, the allowed long filters for deblocking are specified; and the preferred long filtering according to the technology of this article is specified.

[0099] Regarding Table 18, when "To be determined" is provided for the maximum number of samples that can be modified on each side of an edge, this means that the number of samples depends on neighboring blocks.

[0100] With respect to Table 18, when "*None" is provided for the filter, this indicates that the long filter cannot be used at the edge. For example, the large block condition, i.e., the orthogonal chroma block size on both sides of the deblocked edge is greater than or equal to a threshold value (e.g., 8 (in chroma samples)) is not satisfied. Finally, with respect to Table 18, when 3+3* is provided for the filter, then long filters may be allowed, but depend on neighboring blocks. Table 18

[0101] With respect to Table 18, it should be noted that the only condition under which the middle edge of a block using SBT is deblocked is when the size of the block perpendicular to the direction of the edge being deblocked is >= 32 (in chroma samples) or the size of the block perpendicular to the direction of the edge being deblocked is 16 (in chroma samples) and the half split used is 1. This corresponds to cases (e), (f), (g), (h), (i), and (l), and as shown, the preferred filtering in this case is 3+3. It should be noted that the large block case is evaluated here based on the transform size rather than the coding block size (for external and internal edges). Therefore, in one example, according to the techniques of this article, the marking process can be to mark the internal (i.e., middle) edge of the SBT as a candidate for chroma weak filter deblocking. In addition, if the size of the block perpendicular to the edge direction being deblocked is greater than or equal to a threshold, such as 32 (in chroma samples), or the block dimension perpendicular to the edge direction being deblocked is 16, and half splitting is used, then the inner edge of the SBT can be a candidate for chroma long filter deblocking. Furthermore, in one example, according to the techniques herein, for inner edges of SBT blocks, motion vector-based boundary strength determination may be skipped for blocks that do not use sub-block motion vectors (because the motion vectors on either side of the boundary are the same as the reference picture).

[0102] Thus, in one example, according to the techniques herein, filter unit 216 may be configured to The derivation process of transform block boundaries is performed as follows: The inputs to this process are: - specifies the position (xB0, yB0) of the top left sample of the current coding block relative to the top left sample of the current block, - variable nTbW that specifies the width of the current block, - variable nTbH that specifies the height of the current block, - a variable treeType that specifies whether a single tree (SINGLE_TREE) or a dual tree is used to partition the CTU, and when using a dual tree, whether the luma (DUAL_TREE_LUMA) or chroma component (DUAL_TREE_CHROMA) is currently being processed, -variable filterEdgeFlag, - a 2D (nCbW) x (nCbH) matrix of edgeFlag, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs, - The variable edgeType specifies whether vertical (EDGE_VER) edges or horizontal (EDGE_HOR) edges are filtered. -The variable is SBTSubblock which specifies whether the current block is an SBT subblock. The output of this process is a modified two-dimensional (nCbW) x (nCbH) matrix of edgeFlags, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs. The maximum transform block size maxTbSize is derived as follows: maxTbSize=(treeType==DUAL_TREE_CHROMA)?MaxTbSizeY / 2: MaxTbSizeY depends on maxTbSize and is applied as follows: - If nTbW is greater than maxTbSize or nTbH is greater than maxTbSize, then the following ordered steps apply. 1. The variables newTbW and newTbH are derived as follows: newTbW=(nTbW>maxTbSize)? (nTbW / 2):nTbW newTbH=(nTbH>maxTbSize)? (nTbH / 2):nTbH 2. Call the derivation process for the transform block boundaries as specified in this clause with the position (xB0, yB0), the variable nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable isSETSubblock as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. If nTbW is greater than maxTbSize, the derivation process of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0+newTbW, yB0), the variable nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable isSETSubblock as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQ, maxFilterLengthPs and maxFilterLengthCbCrs. 4. If nTbH is greater than maxTbSize, then the luma position (xB0, yB0) set equal to (xB0, yB0+newTbH), the variable nTbW set equal to newTbW and the variable nTbHnewTbH set equal to newTbW, the variable filterEdgeFlag, the matrix edgeFlag, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable isSETSubblock are used as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQ, maxFilterLengthPs and maxFilterLengthCbCrs. 5. If nTbW is greater than maxTbSize and nTbH is greater than maxTbSize, the derivation of transform block boundaries as specified in this clause is invoked, the luma position (xB0, yB0) is set equal to (xB0+newTbW, yB0+newTbH), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrix edgeFlag, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable isSETSubblock are set as inputs, and the output is a modified version of the matrices edgeFlag, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, if edgeType is equal to EDGE_VER, cu_sbt_flag[xB0][yB0] is equal to 1, cu_sbt_horizontal_flag[xB0][yB0] is equal to 0, and isSBTSubblock is equal to 0, then the following ordered steps are applied: 1. The variable SBTSubblock is set to 1. 2. The derivation process of the transform block boundaries as specified in this item is called with position (xB0, yB0), variable nTbW set equal to nTbW*SbtNumFourthsTb / 4, variable nTbH, variable filterEdgeFlag, matrix edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType and variable isSBTSubblock as input, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQ, maxFilterLengthPs and maxFilterLengthCbCrs. 3. The derivation process of transform block boundaries as specified in this clause is called with luma position (xB0+nTBW*SbtNumFourthsTb0 / 4, yB0), variable nTbW is set equal to (nTbW-nTbW*SbtNumFourthsTb0 / 4), variable nTbH, variable filterEdgeFlag, matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType and variable isSBTSubblock as input, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. Otherwise, if edgeType is equal to EDGE_HOR, cu_sbt_flag[xB0][yB0] is equal to 1, cu_sbt_horizontal_flag[xB0][yB0] is equal to 1, and SBTSubblock is equal to 0, then the following steps are applied in order 1. The variable isSBTSubblock is set to 1. 2. The derivation process of the transform block boundaries as specified in this clause is called using the position (xB0, yB0), the variable nTbW, the variable nTbH is set equal to nTbH*SbtNumFourthsTb0 / 4, the variable filterEdgeFlag, the matrix edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable isSBTSubblock as inputs, and the output is a modified version of the matrix edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. The derivation process of transform block boundaries as specified in this clause is called using the luma position (xB0, yB0+nTBH*SbtNumFourthsTb0 / 4), variable nTbW, variable nTbH set equal to (nTbH-nTbH*SbtNumFourthsTb0 / 4), variable filterEdgeFlag, matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType and variable isSBTSubblock as input, and the output is a modified version of the arraysedgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, the following applies: - If edgeType is equal to EDGE_VER, for k = 0..nTbH-1, the value of edgeFlags[xB0][yB0+k] is derived as follows: -If xB0 is equal to 0, then set edgeFlags[xB0][yB0+k] equal to filterEdgeFlag. Otherwise, set edgeFlags[xB0][yB0+k] equal to 1. - If edgeFlags[xB0][yB0+k] is equal to 1 If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - If the width of the transform block in luma samples at luma position (xB0, yB0+k) is equal to or greater than 32, then maxFilterLengthQs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthQs[xB0][yB0+k]=3 - If the width of the transform block in luma samples at luma position (xB0-1, yB0+k) is equal to or greater than 32, then maxFilterLengthPs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthPs[xB0][yB0+k]=3 - If the width in chroma samples of the transform block at chroma position (xB0 / SubWidthC, (yB0+k) / SubHeightC) and chroma position (xB0 / SubWidthC-1, (yB0+k) / SubHeightC) are both equal to or greater than 8, then maxFilterLengthCbCrs[xB0 / SubWidthC][(yB0+k) / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[xB0 / SubWidthC][(yB0+k) / SubHeightC]=1 otherwise - if the width in chroma samples of the transform block at chroma position (xB0, yB0+k) and chroma position (xB0-1, yB0+k) are both equal to or greater than 8, then maxFilterLengthCbCrs[xB0][yB0+k] = 3 Otherwise, maxFilterLengthCbCrs[xB0][yB0+k]=1 Otherwise (edge ​​type equals EDGE_HOR), for k = 0..nTbW-1, the value of edgeFlags[xB0+k][yB0] is derived as follows: -If yB0 is equal to 0, then set edgeFlags[xB0+k][yB0] equal to filterEdgeFlag. Otherwise, set edgeFlags[xB0+k][yB0] equal to 1. - If edgeFlags[xB0+k][yB0] is equal to 1, If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - if the height of the transform block in luma samples at luma position (xB0+k, yB0) is - equal to or greater than 32, maxFilterLengthQs[xB0+k][yB0] = 7 Otherwise, maxFilterLengthQs[xB0+k][yB0]=3 - If the height in luma samples of the transform block at luma position (xB0+k, yB0-1) is equal to or greater than 32, then maxFilterLengthPs[xB0+k][yB0]=7 - Otherwise, maxFilterLengthPs[xB0+k][yB0]=3 - if the heights of the chroma samples of the transform block at chroma position ((xB0+k) / SubWidthC, yB0 / SubHeightC) and chroma position ((xB0+k) / SubWidthC, yB0 / SubHeightC-1) are both equal to or greater than 8, where yC is the top position of the current block in chroma samples relative to the top position of the current picture if (yC % (1n(log2_ctu_size_minus2+2)) / SubHeightC is equal to 0) (when edge type is EDGE_HOR and the edge overlaps a chroma CTB boundary) -maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=1 Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=1 otherwise - if the heights of the chroma samples of the transform block at the chroma position (xB0+k, yB0) and at the chroma position (xB0+k, yB0-1) are both equal to or greater than 8, Where yC is the top position of the current block in chroma samples relative to the top position of the current picture - If (yC % (1 < < (log2_ctu_size_minus2 + 2)) / SubHeightC is equal to 0) (When edge type is EDGE_HOR and the edge overlaps a chroma CTB boundary) -maxFilterLengthCbCrs[xB0+k][yB0]=1 Otherwise, maxFilterLengthQCbCrs[xB0+k][yB0]=3 - Otherwise, maxFilterLengthCbCrs[xB0+k][yB0]=1

[0103] In one example, the filter unit 216 may be configured to impose restrictions on the long filter selection. For example, when the size of the block orthogonal / perpendicular to the edge of the P side or Q side being deblocked is greater than or equal to 32, the long filter may be used. In one example, when the size of the P side block orthogonal / perpendicular to the edge is not greater than or equal to 32 and the size of the Q side block orthogonal / perpendicular to the edge is greater than or equal to 32, a 3+? type long filter may be selected, where? may be 5 or 7. In one example, when the size of the P side block orthogonal / perpendicular to the edge is greater than or equal to 32 and the size of the Q side block orthogonal / perpendicular to the edge is not greater than or equal to 32, a? +3 type long filter may be selected, where? may be 5 or 7.

[0104] In one example, the constraints may be expressed as follows: If edgeType is equal to EDGE_VER, then the following sequential steps are applied: ...... The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: ...... If bSidePisLargeBIk and bSideQisLargeBIk are both equal to 0, go to step 6. The variables dpq0L, dpq3L, dL, maxFilterLengthP, and maxFilterLengthQ are derived as follows: If bSidePisLargeBIk is equal to 1 dp0L=(dp0+Abs(p 5,0 -2*p 4,0 +p 3,0 )+1)>>1 dp3L=(dp3+Abs(p 5,3 -2*p 4,3 +p 3,3 )+1)>>1 otherwise Dp0L=dp0 dp3L=dp3 maxFilterLengthP=3 If bSideQisLargeBIk is equal to 1 dq0L=(dq0+Abs(q 5,0 -2*q 4,0 +q 3,0 )+1)>>1 dq3L=(dq3+Abs(q 5,3 -2*q 4,3+q 3,3 )+1)>>1 otherwise Dq0L=dq0 dq3L=dq3 maxFilterLengthQ=3 dpq0L=dp0L+dq0L dpq3L=dp3L+dq3L dL=dpq0L+dpq3L ...... Otherwise (edgeType equals EDGE_HOR), the following ordered steps are applied: ...... The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: ...... If bSidePisLargeBIk and bSideQisLargeBIk are both equal to 0, go to step 6. The variables dpq0L, dpq3L, dL, maxFilterLengthP, and maxFilterLengthQ are derived as follows: If bSidePisLargeBIk is equal to 1 Dp0L=(dp0+Abs(p5,0-2*p4,0+p3,0)+1)>>1 dp3L=(dp3+Abs(p5,3-2*p4,3+p3,3)+1)>>1 otherwise Dp0L=dp0 dp3L=dp3 maxFilterLengthP=3 If bSideQisLargeBIk is equal to 1 Dq0L=(dq0+Abs(q5,0-2*q4,0+q3,0)+1)>>1 dq3L=(dq3+Abs(q5,3-2*q4,3+q3,3)+1)>>1 otherwise Dq0L=dq0 dq3L=dq3 maxFilterLengthQ=3 dpq0L=dp0L+dq0L dpq3L=dp3L+dq3L dL=dpq0L+dpq3L …

[0105] As described above, ISP can be used for intra-frame prediction. It should be noted that when using a separate tree, the ISP with two parts simply represents a binary partition of blocks using the same prediction mode and automatic transform selection. Similarly, when using a separate tree, the ISP with four parts only represents a binary partition, and the two partitioned parts are further binary partitioned in the same direction as the initial partition, sharing the internal mode, and automatically selecting the transform type. This is similar to the case of SBT and represents a grammatical shortcut, so deblocking can be applied. That is, all corresponding edges (including internal sub-block edges) can be regarded as regular edges. In an instance, this may include a derivation process for modifying the transform boundaries for deblocking based on whether the ISP is used. In one example, this may include a derivation process for modifying the coding block boundaries for deblocking based on whether the ISP is used. In one example, this may include a derivation process for modifying the sub-block boundaries for deblocking based on whether the ISP is used.

[0106] Thus, in one example, according to the techniques herein, filter unit 216 may be configured to perform the derivation of transform block boundaries as follows: The inputs to this process are: - specifies the position of the top left sample of the current block relative to the top left sample of the current coding block (xB0, yB0), - variable nTbW that specifies the width of the current block, - variable nTbH that specifies the height of the current block, - the variable treeType, which specifies whether a single tree (SINGLE_TREE) or a dual tree is used to partition the CTU, and when using a dual tree, whether the luma (DUAL_TREE_LUMA) or chroma component (DUAL_TREE_CHROMA) is currently being processed, -variable filterEdgeFlag, - a 2D (nCbW) x (nCbH) matrix of edgeFlags, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs, - The variable edgeType specifies whether vertical (EDGE_VER) edges or horizontal (EDGE_HOR) edges are filtered. - Variable ispSubblockIdx that specifies whether the current block is an ISP subblock The output of this process is a modified two-dimensional (nCbW) x (nCbH) matrix of edgeFlags, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs. The maximum transform block size maxTbSize is derived as follows: maxTbSize=(treeType==DUAL_TREE_CHROMA)? MaxTbSize Y / 2: MaxTbSize Y is applied as follows according to maxTbSize: - If nTbW is greater than maxTbSize or nTbH is greater than maxTbSize, then the following ordered steps apply. 1. The variables newTbW and newTbH are derived as follows: newTbW=(nTbW>maxTbSize)? (nTbW / 2):nTbW newTbH=(nTbH>maxTbSize)? (nTbH / 2):nTbH 2. The derivation process of transform block boundaries as specified in this clause is called using the position (xB0, yB0), the variable nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable ispSubblockIdx as input, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. If nTbW is greater than maxTbSize, the derivation process of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0+newTbW, yB0), the variable nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 4. If nTbH is greater than maxTbSize, the derivation process of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0, yB0+newTbH), the variable nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 5. If nTbW is greater than maxTbSize and nTbH is greater than maxTbSize, then the derivation of transform block boundaries as specified in this clause is invoked with the luma position (xB0, yB0) set equal to (xB0+newTbW, yB0+newTbH), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlags, maxFilterLengthQ, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, if edgeType is equal to EDGE_VER, intra_partitions_mode_flag[xB0][yB0] is equal to 1, and IntraSubPartitionsSplitType[xB0][yB0] is equal to ISP_VER_SPLIT, and ispSubblockldx is equal to 0, then apply the following ordered steps 1. The variable ispSubblockldx is set equal to 1 2. Fork = 0 ... (NumIntraSubPartitions - I), the following applies: The derivation procedure for the transform block boundaries specified in this clause is called with position (xB0+k*nTbW / NumIntraSubPartitions, yB0), variable nTbW set equal to nTbW / NumIntraSubPartitions, variable nTbH, variable filterEdgeFlag, arraysedgeFlag, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType and variable ispSubblockldx as input, and the output is a modified version of arraysedgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. Otherwise, if edgeType is equal to EDGE_HOR, intra_partitions_mode_flag[xB0][yB0] is equal to 1, and IntraSubPartitionsSplitType[xB0][yB0] is equal to ISP_HOR_SPLIT, and ispSubblockldx is equal to 0, then the following ordered steps apply: 1. The variable ispSubblockldx is set equal to 1 2. For k = 0 ... (NumIntraSubPartitions - 1), apply as follows: The derivation procedure for the transform block boundaries specified in this clause is called with the position (xB0, yB0+k*nTbH / NumIntraSubPartitions), variable nTbW, variable nTbH set equal to nTbH / NumIntraSubPartitions, variable filterEdgeFlag, matrix edgeFlag, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType and variable ispSubblockldx as input, and the output is a modified version of the arraysedgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, the following applies: - If edgeType is equal to EDGE_VER, then for k = 0..nTbH-1, the value of edgeFlags[xB0][yB0+k] is derived as follows: -If xB0 is equal to 0, then set edgeFlags[xB0][yB0+k] equal to filterEdgeFlag. Otherwise, set edgeFlags[xB0][yB0+k] equal to 1. - If edgeFlags[xB0][yB0+k] is equal to 1 If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - If the width of the transform block in luma samples at luma position (xB0, yB0+k) is equal to or greater than 32, then maxFilterLengthQs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthQs[xB0][yB0+k]=3 - If the width of the transform block in luma samples at luma position (xB0-1, yB0+k) is equal to or greater than 32, then maxFilterLengthPs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthPs[xB0][yB0+k]=3 - If the width in chroma samples of the transform block at chroma position (xB0 / SubWidthC, (yB0+k) / SubHeightC) and chroma position (xB0 / SubWidthC-1, (yB0+k) / SubHeightC) are both equal to or greater than 8, then maxFilterLengthCbCrs[xB0 / SubWidthC][(yB0+k) / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[xB0 / SubWidthC][(yB0+k) / SubHeightC]=1 otherwise - If the width of the transform block in chroma samples at both chroma position (xB0, yB0+k) and chroma position (xB0-1, yB0+k) is equal to or greater than 8, then maxFilterLengthCbCrs[xB0][yB0+k] = 3 Otherwise, maxFilterLengthCbCrs[xB0][yB0+k]=1 Otherwise (edge ​​type equals EDGE_HOR), for k = 0..nTbW-1, the value of edgeFlags[xB0+k][yB0] is derived as follows: -If yB0 is equal to 0, then set edgeFlags[xB0+k][yB0] equal to filterEdgeFlag. Otherwise, set edgeFlags[xB0+k][yB0] equal to 1. - If edgeFlags[xB0+k][yB0] is equal to 1, If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - If the height of the transform block in luma samples at luma position (xB0+k, yB0) is equal to or greater than 32, then maxFilterLengthQs[xB0+k][yB0]=7 Otherwise, maxFilterLengthQs[xB0+k][yB0]=3 - If the height of the transform block in luma samples at luma position (xB0+k, yB0-1) is equal to or greater than 32, maxFilterLengthPs[xB0+k][yB0]=7 - Otherwise, maxFilterLengthPs[xB0+k][yB0]=3 -If the heights of the chroma samples of the transform block at chroma position ((xB0+k) / SubWidthC, yB0 / SubHeightC) and chroma position ((xB0+k) / SubWidthC, yB0 / SubHeightC-1) are both equal to or greater than 8, where yC is the top position of the current block in chroma samples relative to the top position of the current picture -If (1<<(log2_ctu_size_minus2+2)) / SubHeightC is equal to 0) (when edge type is EDGE_HOR and the edge overlaps the chroma CTE boundary) -maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=1 Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][yB0 / SubHeightC]=1 otherwise - if the heights of the chroma samples of the transform block at the chroma position (xB0+k, yB0) and at the chroma position (xB0+k, yB0-1) are both equal to or greater than 8, Where yC is the top position of the current block in chroma samples relative to the top position of the current picture - If (yC % (1 << (log2_ctu_size_minus2+2)) / SubHeightC is equal to 0) (when edge type is EDGE_HOR and the edge overlaps the chroma CTE boundary) -maxFilterLengthCbCrs[xB0+k][yB0]=1 Otherwise, maxFilterLengthQCbCrs[xB0+k][yB0]=3 Otherwise, maxFilterLengthCbCrs[xB0+k][yB0]=1 In an example, the variable specifies whether the current block is an ISP sub-block and whether the current block is a shared SBT sub-block.

[0107] It should be noted that, as described above, in JVET-M1001, the determination of whether to use intra prediction mode or inter prediction mode occurs at the CU level, and ISP sub-block encoding only enables intra prediction and SBT sub-block encoding only enables inter prediction. Thus, the process provided above for deriving sub-block boundaries for deblocking based on whether ISP sub-blocks are used can be incorporated into the overall process of the derivation process of transform block boundaries, which includes a process for deriving sub-block boundaries for deblocking based on whether SBT sub-blocks are used. Specifically, cu_sbt_flag[xB0][yB0] is equal to 1, and a corresponding process for deriving sub-block boundaries for deblocking based on whether SBT sub-blocks are used can be added to the process for deriving sub-block boundaries for deblocking based on whether ISP sub-blocks are used, and the overall derivation process of transform block boundaries is given above.

[0108] As described above, the filter unit 216 can be configured to set the bS value to a non-zero value (e.g., 2) for the ISP coding mode sub-partition boundary of each component of the video. In one example, the filter unit 216 can be configured to perform the following boundary strength derivation process: The inputs to this process are: - picture sample matrix recPicture, - specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - variable nCbW that specifies the width of the current coding block, - variable nCbH specifying the height of the current coded block, - a variable edge type that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered, - variable cIdx that specifies the component index of the picture, - A two-dimensional (nCbW)x(nCbH) matrix edgeFlags with index cIdx components. The output of this process is a two-dimensional (nCbW)x(nCbH) matrix bS specifying the boundary filter strength with index cldx components. Variable xD i ,yD j ,xN and yN are derived as follows: -If edgeType is equal to EDGE_VER, xD i is set equal to (i<<3), 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. - Otherwise (edgeType equals EDGE_HOR), xDi is set equal to (i<<2), 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). For xD with i=0..xN i and yD with j=0..yN j , the application is as follows: -If edgeFlags[xD i ][yD j ] is equal to 0, then the variable bS[xD i ][yD j ] is set equal to 0. - Otherwise, the following applies: -The sample values ​​p0 and q0 are derived as follows: - If edge type equals EDGE_VER, p0 is set equal to recPicture[xCb+xD i -1][yCb+yD j ], and q0 is set equal to recPicture[xCb+xD i ][yCb+yD j ]. - Otherwise (edgeType equals EDGE_HOR), set p0 equal to [xCb+xD i ][yCb+yD j -1], and set q0 equal to recPicture[xCb+xD i ][yCb+yD j ]. -The variable bS[xD i ][yD j ] is derived as follows: If sample p0 or q0 is in a coding block of a coding unit coded in intra prediction mode and IntraSubPartitionsSplitType is equal to ISP NO_SPLIT, bS[xDi][yDj] is set equal to 2. Otherwise, if sample p0 or q0 is in a coding block of a coding unit that is coded in intra prediction mode and IntraSubPartitionsSplitType is not equal to ISPNO_SPLIT: - If the coding block edge is also a transform block edge, bS[xD i ][yD i ] is set equal to 2, Otherwise, if the transform block edge is not a coding block edge and the transform block edge belongs to the luma component, then bS[xD i ][yD j ] is set equal to 2, -Otherwise, bS[xD i ][yD j ] is set to 0

[0109] In one example, according to the techniques herein, marking edges as candidates for deblocking or boundary strength determination processes can be based on the partition tree type of the ISP block. For example, when the tree type is DUAL_TREE_CHROMA, then only the outer edges of the ISP block (e.g., coding block edges) can be marked as deblocking candidates. In another example, when the tree type is DUAL_TREE_CHROMA, then only the outer edges of the ISP block (e.g., coding block edges) can have non-zero boundary strength. For example, in the above-mentioned boundary strength derivation process, the variable bS[xD i ][yD j The derivation of ] can be modified as follows: -Variable bS[xD i ][yD j ] is derived for each component as follows: If sample p0 or q0 is in a coding block of a coding unit that is coded using intra prediction mode and IntraSubPartitionsSplitType is equal to ISP NO_SPLIT, then bS[xD i ][yD j ] is set equal to 2. Otherwise, if sample p0 or q0 is in a coding block of a coding unit that is coded using intra prediction mode, and IntraSubPartitionsSplitType is not equal to ISPNO_SPLIT: - If the coding block edge is also a transform block edge and the tree type is not equal to DUAL_TREE_CHROMA, then bS[xD i ][yD j ] is set equal to 2, Otherwise, if the transform block edge is not a coding block edge and the transform block edge belongs to the luma component, then bS[xD i ][yD j ] is set equal to 2, -Otherwise, bS[xD i ][yD j ] is set to 0

[0110] In one example, the filter unit 216 may be configured to set the boundary strength of a non-existent chroma ISP edge to 0. In one example, the filter unit 216 may be configured to perform the following boundary strength derivation process: The inputs to this process are: - picture sample matrix recPicture, - specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - variable nCbW that specifies the width of the current coding block, - a variable nCbH specifying the height of the current coded block, - the variable edgeType that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered, - A two-dimensional (nCbW) x (nCbH) matrix of edgeFlags. The output of this process is a two-dimensional (nCbW) x (nCbH) matrix bSLuma, and two-dimensional (nCbWISubWidthC, nCbHISubHeightC) matrices bSCb and bSCr that specify the boundary filter strength for each color component. i ,yD j ,xN and yN are derived as follows: -If edgeType is equal to EDGE_VER, then xD i is set equal to (i<<3), 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. - Otherwise (edgeType equals EDGE_HOR), xD i is set equal to (i<<2), 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). For xD i , i = 0..xN and yD j , j = 0..yN, the application is as follows: -If edgeFlags[xD i ][yD j ] is equal to 0, then the variable bS[xD i ][yD j ] is set equal to 0. - Otherwise, the following applies: -The sample values ​​p0 and q0 are derived as follows: - If edge type equals EDGE_VER, then set p0 equal to ecPicture[xCb+xD i -1][yCb+yD j ], and set q0 equal to recPicture[xCb+xD i ][yCb+yD j ]. - Otherwise (edgeType equals EDGE_HOR), p0 is set equal to recPicture[xCb+xD i ][yCb+yD j -1] and q0 is set equal to recPicture[xCb+xD i ][yCb+yD j ]. - The variable bS[xD derived for each component i ][yD j ], and the result for the luminance component is stored in bSLuma[xD i ][yD j ], the result of Cb component is stored in bSCb[xD i / SubWidthC][yD j / SubHeightC], the result of the Cr component is stored in bSCr[xD i / SubWidthC][yD j ISubHeightC], as follows: If sample p0 or q0 is in a coding block of a coding unit that is coded using intra prediction mode, then the following applies: - When the component is chroma, treetype is equal to SINGLE_TREE, intra_subpartitions_mode_flag[xCb][yCb] is equal to 1, xD i is not equal to 0, and yD j Not equal to 0, bS[xD i ][yD j ] is set equal to 0: - Otherwise, when treetype is equal to DUAL_TREE_CHROMA, intra_subpartitions_mode_flag[xCb*SubWidthC][yCb*SubHeightC] is equal to 1, xD i is not equal to 0, and yD i When it is not equal to 0, bS[xD i ][yDj ] is set equal to 0: -Otherwise, bS[xD i ][yD j ] is set equal to 2. Otherwise, if the block edge is also a transform block edge and sample p0 or q0 is in a transform block containing one or more non-zero transform coefficient levels, then bS[xD i ][yD j ] is set equal to 1. Otherwise, if one or more of the following conditions for the luma component is true, then bS[xD i ][yD j ] is set to is equal to 1: - For the prediction of the coded subblock containing sample p0, a different reference picture or a different number of motion vectors is used than for the prediction of the coded subblock containing sample q0. Note 1 - Whether the reference pictures used for two coded sub-blocks are the same or different is determined only based on which pictures are referenced, regardless of whether the prediction is formed using an index in reference picture list 0 or an index in reference picture list 1, and regardless of whether the index positions within the reference picture lists are different. Note 2 - The number of motion vectors (xSb, ySb) used to predict the coded sub-block with top-left sample coverage is equal to PredFlagL0[xSb][ySb]+PredFlagLl[xSb][ySb]. - one motion vector is used to predict the coded subblock containing sample p0, and one motion vector is used to predict the coded subblock containing sample The absolute difference between the horizontal component or the vertical component of the motion vector used is greater than or equal to 4 in units of quarter luma samples. - Two motion vectors and two different reference pictures are used to predict a coded sub-block containing sample p0, two motion vectors of the same two reference pictures are used to predict a coded sub-block containing sample q0, and the absolute difference between the horizontal or vertical components of the two motion vectors used in the prediction of the two coded sub-blocks of the same reference picture is greater than or equal to 4 in units of quarter luma samples. - Two motion vectors for the same reference picture are used to predict the coded subblock containing sample p0, and two motion vectors for the same reference picture are used to predict the coded subblock containing sample q0, and the following conditions are all true: - The absolute difference between the horizontal or vertical components of the list 0 motion vectors used to predict the two coded sub-blocks is greater than or equal to 4 in quarter luma samples, or the absolute difference between the horizontal or vertical components of the list 1 motion vectors used in the prediction of the two coded sub-blocks is greater than or equal to 4 in quarter luma samples. - the absolute difference between the horizontal component or the vertical component of the list 0 motion vector used in the prediction of the coded subblock containing sample p0 and the list 1 motion vector used in the prediction of the coded subblock containing sample q0 is greater than or equal to 4 in units of quarter luma samples, or the list 1 motion vector used in the prediction of the coded subblock containing sample p0 The absolute difference between the horizontal component or the vertical component of the motion vector and the list 0 motion vector used in the prediction of the coded sub-block containing sample q0 is greater than or equal to 4 in units of quarter luma samples. - Otherwise, the variable bS[xD i ][yD j ] is set equal to 0.

[0111] In one example, the filter unit 216 can be configured to not mark non-existent chroma edges as candidates for deblocking. This requires the use of separate luma edge matrices and chroma edge matrices. That is, the filter unit 216 can be configured to call the derivation process of the transform block boundary and the derivation process of the coding subblock boundary as follows: All elements of the two-dimensional (nCbW) x (nCbH) matrices edgeFlags, maxFilterLengthQs, maxFilterlengthPs and the two-dimensional (nCbW / SubWidthC) x (nCbH / subweightc) matrix maxFilterLengthPCbCrs are initialized to zero. The variables isSubblock and ispSubblockIdx are initialized to 0. When the derivation process of the conversion block boundary specified below is called, the position (xB0, yB0) is set to (0, 0), the block width nTbW is set to nCbW, the block height nTbH is set to nCbH, the variable treeType, the variable filterEdgeFlag, matrix edgeFlagYs, matrix edgeFlagsCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, variable edgeType, variable isSBTSubblock and variable ispSubblockldx are taken as input, and the modified matrix edgeFlags, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs are taken as output. The derivation process of the coding sub-block boundaries specified below is called with position (xCb, yCb), coding block width nCbW, coding block height nCbH, matrix edgeFlagYs, matrix edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and variable edgeType as input, and the modified matrices edgeFlags, maxFilterLengthQs and maxFilterLengthPs as output. Derivation of transform block boundaries The input to this process is: - specifies the position of the top left sample of the current block relative to the top left sample of the current coding block (xB0, yB0), - variable nTbW that specifies the width of the current block, - variable nTbH that specifies the height of the current block, - variable treeType, which specifies whether a single tree (SINGLE_TREE) or a dual tree is used to partition the CTU, and when using a dual tree, whether the current processing is the luma (DUAL_TREE_LUMA) or chroma component (DUAL_TREE_CHROMA), -variable filterEdgeFlag, - a 2D (nCbW) x (nCbH) array of edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs, - Variable edge type that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered. - The variable isSBTS sub-chunk specifies whether the current chunk is a SBT sub-chunk - The variable ispSubblockIdx that specifies the index of the ISP subblock The output of this process is the modified two-dimensional (nCbW) x (nCbH) matrix edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs, and maxFilterLengthCbCrs. The maximum transform block size maxTbSize is derived as follows: maxTbSize=(treeType==DUAL_TREE_CHROMA)?MaxTbSizeY / 2:MaxTbSizeY is applied as follows according to maxTbSize: - If nTbW is greater than maxTbSize or nTbH is greater than maxTbSize, then the ordered steps apply as follows. 1. The variables newTbW and newTbH are derived as follows: newTbW=(nTbW>maxTbSize)? (nTbW / 2):nTbW newTbH=(nTbH>maxTbSize)? (nTbH / 2):nTbH 2. The derivation process of transform block boundaries as specified in this clause is called using the position (xB0, yB0), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrices sedgeFlagYs, edgeFlagsCbCrsmaxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockldx as input, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. If nTbW is greater than maxTbSize, the derivation of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0+newTbW, yB0), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 4. If nTbH is greater than maxTbSize, the derivation of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0, yB0+newTbH), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 5. If nTbW is greater than maxTbSize and nTbH is greater than maxTbSize, then the derivation process of transform block boundaries as specified in this clause is called with the luma position (xB0, yB0) set equal to (xB0+newTbW, yB0+newTbH), the variable nTbW is set equal to newTbW and nTbH is set equal to newTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSBTSubblock, the variable ispSubblockIdx as input, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. Otherwise, if edge type is equal to EDGE_VER, cu_sbt_flag[xB0][yB0] is equal to 1, and cu_sbt_horizontal_flag[xB0][yB0] is equal to 0, and isSBTSubblock is equal to 0, then the following ordered steps apply: 1. The variable isSBTSubblock is set to 1 2. The derivation procedure for the transform block boundaries specified in this clause is called using the position (xB0, yB0), the variable nTbW is set equal to nTbW*SbtNumFourthsTb0 / 4, the variable nTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as input, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. The derivation process of the transform block boundaries as specified in this item is called using the luma position (xB0+nTEW*SbtNumFourthsTb0 / 4, yB0), the variable nTbW is set equal to (nTbW-nTbW*SbtNumFourthsTb0 / 4), the variable nTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSBTSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. Otherwise, if edgeType is equal to EDGE_HOR, cu_sbt_flag[xB0][yB0] is equal to 1, and cu_sbt_horizontal_flag[xB0][yB0] is equal to 1, and isSETSubblock is equal to 0, then the following ordered steps apply: 1. The variable isSETSUbblock is set to 1 2. The derivation process of the transform block boundaries as specified in this clause is called using the position (xB0, yB0), the variable nTbW, the variable nTbH set equal to nTbH*SbtNumFourthsTb0 / 4, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagsCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. 3. The derivation process of the transform block boundaries as specified in this item is called using the luma position (xB0, yB0+nTEH*SbtNumFourthsTb0 / 4), the variable nTbW, the variable nTbH set equal to (nTbH-nTbH*SbtNumFourthsTb0 / 4), the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, if edge type is equal to EDGE_VER, tree type is not equal to DUAL_TREE_CHROMA, intra_partitions_mode_flag[xB0][yB0] is equal to 1, and IntraSubPartitionsSplitType[xB0][yB0] is equal to ISP_VER_SPLIT, and ispSubblockIdx is equal to 0, apply the following steps: - For k = 0 ... (NumIntraSubPartitions - 1), apply the following sequence of steps: 1. The variable ispSubblockIdx is set to (k+1) 2. Call the transform block boundary derivation procedure specified in this clause with the position (xB0+k*nTbW / NumIntraSubPartitions, yB0), the variable nTbW is set equal to nTbW / NumIntraSubPartitions, the variable nTbH, the variable filterEdgeFlag, the matrices edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs, the variable edgeType, the variable isSETSubblock and the variable ispSubblockIdx as inputs, and the output is a modified version of the matrices edgeFlagYs, edgeFlagsCbCrs, maxFilterLengthQs, maxFilterLengthPs and maxFilterLengthCbCrs. - Otherwise, the following applies: - If treeType is equal to DUAL_TREE_CHROMA, then set both variables cW and cH to 1, - Otherwise, assign SubWidthC to variable cW and SubHeightC to variable cH - If edgeType is equal to EDGE_VER, the values ​​of edgeFlagYs[xB0][yB0+k] and edgeFlagCbCrs[xB0 / cW][(yB0+k) / cH], k=0..nTbH-1 are derived as follows: -If xB0 is equal to 0, then set edgeFlagYs[xB0][yB0+k] and edgeFlagCbCrs[xB0][yB0+k] equal to filterEdgeFlag. -otherwise, - If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMAedgeFlagYs[xB0][yB0+k] is set equal to 1. - If ispSubblockldx is greater than 1, set edgeFlagCbCrs[xB0 / cW][(yB0+k) / cH] equal to 0 - Otherwise, set edgeFlagCbCrs[xB0 / cW][(yB0+k) / cH] equal to 1 - If edgeFlagYs[xB0][yB0+k] is equal to 1 - If the width of the transform block in luma samples at luma position (xB0, yB0+k) is equal to or greater than 32, then maxFilterLengthQs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthQs[xB0][yB0+k]=3 - If the width of the transform block in luma samples at luma position (xB0-1, yB0+k) is equal to or greater than 32, then maxFilterLengthPs[xB0][yB0+k] = 7 Otherwise, maxFilterLengthPs[xB0][yB0+k]=3 - If edgeFlagCbCrs[xB0 / cW][(yB0+k) / cH] is equal to 1 - If the width in chroma samples of the transform block at chroma position (xB0 / cW, (yB0+k) / cH) and chroma position (xB0 / cW-1, (yB0+k) / cH) are both equal to or greater than 8, then maxFilterLengthCbCrs[xB0 / cW][(yB0+k) / cH] = 3 Otherwise, maxFilterLengthCbCrs[xB0 / cW][(yB0+k) / cH]=1 - Otherwise (edgeType is equal to EDGE_HOR), k=0…nTbW-1, and the values ​​of edgeFlagYs[xB0+k][yB0] and edgeFlagCbCrs[(xB0+k) / cW][yB0 / cH] are derived as follows: -If yB0 is equal to 0, then set edgeFlags[xB0+k][yB0] and edgeFlagCbCrs[(xB0+k) / cW][yB0 / cH] equal to filterEdgeFlag. -otherwise, - If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA, edgeFlagYs[xB0+k][yB0] is set equal to 1. - If ispSubblockldx is greater than 1, set edgeFlagCbCrs[(xB0+k) / cW][yB0 / cH] equal to 0 Otherwise, edgeFlagCbCrs[(xB0+k) / cW][yB0 / cH] is set equal to 1 - If edgeFlag Ys[xB0+k][yB0] is equal to 1, - If the height of the transform block in luma samples at luma position (xB0+k, yB0) is equal to or greater than 32, then maxFilterLengthQs[xB0+k][yB0]=7 Otherwise, maxFilterLengthQs[xB0+k][yB0]=3 - If the height of the transform block in luma samples at luma position (xB0+k, yB0-1) is equal to or greater than 32, then maxFilterLengthPs[xB0+k][yB0]=7 - Otherwise, maxFilterLengthPs[xB0+k][yB0]=3 - If edgeFlagCbCrs[xB0 / cW][(yB0+k) / cH] is equal to 1 - if the height ((xB0+k) / cW, yB0 / cH) and the chroma position ((xB0+k) / cW, yB0 / cH-I) in the chroma samples of the transform block at the chroma position are both equal to or greater than 8, - Set yC to the top position of the current block in chroma samples relative to the top position of the current picture - if (yC % (1<<(log2_ctu_size_minus2+2)) / cH is equal to 0) (when edge type is EDGE_HOR and the edge overlaps the chroma CTE boundary), maxFilterLengthCbCrs[(xB0+k) / cW][yB0 / cH]=1 Otherwise, maxFilterLengthCbCrs[(xB0+k) / cW][yB0 / cH]=3 Sub-block boundary coding derivation process The inputs to this process are: - specifies the position (xCb, yCb) of the top left sample of the current coding block relative to the top left sample of the current picture, - variable nCbW that specifies the width of the current coding block, - variable nCbH specifying the height of the current coded block, - a two-dimensional (nCbW) x (nCbH) matrix of edgeFlagYs, edgeFlagCbCrs, maxFilterLengthQs, and maxFilterLengthPs, - Variable edge type that specifies whether vertical (EDGE_VER) or horizontal (EDGE_HOR) edges are filtered. The output of this process is the modified two-dimensional (nCbW) x (nCbH) matrices edgeFlagYs, edgeFlagCbCrsmaxFilterLengthQs, and maxFilterLengthPs. The number of coded sub-blocks numSbX in the horizontal direction and the number of coded sub-blocks numSbY in the vertical direction are derived as follows: - If CuPred.Mode[xCb][yCb] == MODE_INTRA, then numSbX and numSbY are both set equal to 1 Otherwise, numSbX and numSbY are set equal to NumSbX[xCb][yCb] and NumSbY[xCb][yCb], respectively. Depending on the value of edgeType, the following applies: - If edge type equals EDGE_VER and numSbX is greater than 1, - Create the edgeTransformFlag matrix by copying the edgeFlagY matrix - The following applies for edgeFlagYs[i*Max(8, nCbW / numSbX)][k]=1, i=l..min((nCbW / 8)-1, numSbX-1), k=0..nCbH-1 edgeFlagCbCrs[i*Max(8,nCbW / (numSbX*SubWidthC))][kiSubHeightC]=1 - The following applies for i = 0..min((nCbW / 8)-1, numSbX-1), k = 0..nCbH-1: If edgeFlagYs[i*Max(8,nCbW / numSbX)][k] is equal to 1, If the brightness component -If i is equal to 0, - If numSbX at position (xCb · 1, yCb) is greater than 1, maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]=min(5, maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]) maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]=min(5, maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]) - Otherwise, if edgeTransfromFlags[i*Max(8,nCbW / numSbX)][k] is equal to 1 maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]=min(5, maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]) maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]=min(5, maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]) - Otherwise, if i is equal to 1 or i is equal to nCbW / 8-1 or (edgeTransfrom Flags[(i-1)*Max(8,nCbW / numSbX))][k] is equal to 1) or (edgeTransfromFlags[(i+1)*Max(8,nCbW / numSbX)][k] is equal to 1) maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]=2 maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]=2 -otherwise maxFilterLengtPs[i*Max(8,nCbW / numSbX)][k]=3 maxFilterLengtQs[i*Max(8,nCbW / numSbX)][k]=3 - Otherwise, if edge type equals EDGE_HOR and numSbY is greater than 1, - Create the edgeTransformFlag matrix by copying the edgeFlagY matrix - The following applies for j = l..min((nCbH / 8)-1, numSbY-1), k = 0..nCbW-1: edgeFlagY s[k][j*Max(8,nCbH / numSb Y)]=1 edgeFlagCbCrs[kiSubWidthC][j*Max(8,nCbH / (numSb Y*SubHeightC))]=1 - The following applies for j = 0..min((nCbH / 8)-1, numSbY-1), k = 0..nCbW-1: If edgeFlagY s[k][j*Max(8,nCbH / numSb Y)] is equal to 1 If the brightness component -If j is equal to 0, - If numSbY at position (xCb, yCb-1) is greater than 1, maxFilterLengtPs[k JG*Max(8, nCbH / numSbY)]=min(5, maxFilterLengtPs[k]G*Max(8, nCbH / numSbY)]) maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]=min(5,maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]) Otherwise, if edgeTransformFlags[k][j*Max(8,nCbH / numSbY)] is equal to 1 maxFilterLengtPs[k]G*Max(8,nCbH / numSbY)]=min(5,maxFilterLengtPs[k]G*Max(8,nCbH / numSbY)]) maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]=min(5,maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]) - Otherwise, if j is equal to 1 or j is equal to nCbH / 8-1 or (edgeTransformFlags[k][G-1)*Max(8,nCbH / numSb Y)] is equal to 1) or (edgeTransformFlags[k][G+1)*Max(8,nCbH / numSb Y)] is equal to 1) maxFilterLengtPs[k]G*Max(8,nCbH / numSbY)]=2 -maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]=2 -otherwise maxFilterLengtPs[k]G*Max(8,nCbH / numSb Y)]=3 maxFilterLengtQs[k]G*Max(8,nCbH / numSbY)]=3. As described above, according to the techniques herein, filter unit 216 may be configured such that a filtering decision is determined additionally or alternatively based on whether a Q block or a P block is a large block (e.g., a transform block, a prediction block, a coding block, a sub-block). In one example, the determination of whether a Q block is a large block (i.e., bSideQisLargeBIk) or a P block is a large block (i.e., bSidePisLargeBIk) may be based on whether a neighboring block uses ISP. That is, in one example, determining whether a Q block is a large block (i.e., bSideQisLargeBIk) or a P block is a large block (i.e., bSidePisLargeBIk) may be as follows: If edgeType is equal to EDGE_VER, the following ordered steps apply: … The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: bSidePisLargeBIk is set equal to 1 if any of the following conditions is true: - p0,0 belongs to a coding block whose intra_partitions_mode_flag[][] is equal to 0, and P0,0 belongs to a coding block with a width greater than or equal to 32 in luma samples - The intra_partitions_mode_flag[][] of the coding block to which p0,0 belongs is equal to 1, the intra SubPartitionsSplitType[][] of the coding block to which p0,0 belongs is equal to ISP_HOR_SPLIT, and p0,0 belongs to a coding block with a width greater than or equal to 32 in the luma sample - The intra_partitions_mode_flag[][] of the coding block to which p0,0 belongs is equal to 1, the intra_SubPartitionsSplitType[][] of the coding block to which p0,0 belongs is equal to ISP_VER_SPLIT, and P0,0 belongs to a transform with a width greater than or equal to 32 in the luma sample Otherwise, bSidePisLargeBIk is set equal to 0. If q0,0 belongs to a coding block having a width greater than or equal to 32 in luma samples, bSideQisLargeBIk is set equal to 1, otherwise bSideQisLargeBIk is set equal to 0. … Otherwise (edgeType equals EDGE_HOR), apply the following ordered steps: … The variables bSidePisLargeBIk and bSideQisLargeBIk are derived as follows: If (luminance position of sample p0, 0% CtbSize Y) is equal to 0, then set bSidePisLargeBIk to 0 otherwise, bSidePisLargeBIk is set equal to 1 if any of the following conditions is true: - p0,0 belongs to a coding block whose intra_partitions_mode_flag[][] is equal to 0, and p0,0 belongs to a coding block whose height in luma samples is greater than or equal to 32 - The intra_partitions mode_flag[][] of the coding block to which p0,0 belongs is equal to 1, the intra_SubPartitionsSplitType[][] of the coding block to which p0,0 belongs is equal to ISP_VER_SPLIT, and p0,0 belongs to a coding block whose height in the luma sample is greater than or equal to 32 - the intra_partitions_mode_flag[][] of the coding block to which p0,0 belongs is equal to 1, the intra_SubPartitionsSplitType[][] of the coding block to which p0,0 belongs is equal to ISP_HOR_SPLIT, and p0,0 belongs to a transform with a height greater than or equal to 32 in the luma sample Otherwise, bSidePisLargeBIk is set equal to 0. If q0,0 belongs to a coding block with a height greater than or equal to 32, then bSideQisLargeBIk is set equal to 1, otherwise bSideQisLargeBIk is set equal to 0.

[0112] As described above, a sample block (e.g., a coding block / unit) may contain one or more transform blocks / units. An internal transform boundary may be considered a candidate for deblocking. In addition, in some cases, the decoder may receive a signal indicating that the sample block does not contain any transform block / unit. For example, when there is no residual for a coding unit, a flag such as a cu_cbf flag may be set to 0. Similarly, a flag may indicate that there is no residual for a coding block of a video component. In one example, if the decision process is based on a transform block / unit attribute, other alternative attributes may be used in the absence of a transform block / unit. For example, long filter selection may be based on the size of a transform block / unit orthogonal to the boundary being filtered / deblocked. However, in the absence of a transform block / unit, long filter selection may be based on the size of a prediction block / unit. In another example, long filter selection may be based on the size of a coding block / unit. Similar to a transform block / unit, an alternative attribute may correspond to a dimension orthogonal to the boundary being filtered / deblocked.

[0113] As described above, the coding unit / block may be divided into prediction blocks / units and / or the prediction blocks / units may be the same size as the coding blocks / units. In addition, in some cases, for example due to the use of ISP, the prediction blocks / units correspond to sub-block partitions of the coding blocks / units. In some cases, the prediction blocks / units correspond to groups of samples whose prediction parameters are signaled, for example, coding blocks / units using affine control parameters, coding blocks / units using ATMVP. In some cases, the prediction blocks / units correspond to groups of samples with a common set of prediction parameters, for example, sub-blocks (of the coding blocks / units) correspond to the resolution at which the affine coding blocks / units derive motion vectors, and / or sub-blocks (of the coding blocks / units) correspond to the resolution at which the ATMVP coding blocks / units derive motion vectors. Similar to the above, with respect to transform boundaries, internal prediction boundaries may be considered candidates for deblocking.

[0114] In one example, according to the techniques herein, filter unit 216 can be configured to adjust The derivation process of transform block boundaries is: Derivation of transform block boundaries The input to this process is: - specifies the position of the top left sample of the current block relative to the top left sample of the current coding block (xB0, yB0), - variable nTbW that specifies the width of the current block, - variable nTbH that specifies the height of the current block, - the variable treeType, which specifies whether a single tree (SINGLE_TREE) or a dual tree is used to partition the CTU, and when using a dual tree, whether the luma (DUAL_TREE_LUMA) or chroma component (DUAL_TREE_CHROMA) is currently being processed, -variable filterEdgeFlag, - a 2D (nCbW) x (nCbH) matrix of edgeFlag, maxFilterLengthQs, maxFilterLengthPs and a 2D (nCbW / SubWidthC) x (nCbH / SubHeightC) matrix of maxFilterLengthCbCrs, - The variable edgeType specifies whether vertical (EDGE_VER) edges or horizontal (EDGE_HOR) edges are filtered. The output of this process is the modified two-dimensional (nCbW) x (nCbH) matrix edgeFlag, maxFilterLengthQs, maxFilterLengthPs, and the two-dimensional (nCbW / SubWidthC) x (nCbH / SubHeightC) matrix maxFilterLengthCbCrs. - If edgeType is equal to EDGE_VER, then for k = 0..nTbH-1, l = 0..nTbW-1, the value of edgeFlags[xB0+l][yB0+k] is derived as follows: -If xB0+l is equal to 0, edgeFlags[xB0+l][yB0+k] is set equal to filterEdgeFlag. - Otherwise, if the position (xB0+1 yB0+k) is at a transform block edge, then edgeFlags[xB0+1][yB0+k] is set equal to 1. - If edgeFlags[xB0+l][yB0+k]i is equal to 1 If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - if the width in luma samples of the transform block when cu_cbf is equal to 1 at luma position (xB0+1, yB0+k) or the prediction block when cu_cbf is equal to 0 at luma position (xB0+1, yB0+k) is equal to or greater than 32, then maxFilterLengthQs[xB0+1][yB0+k]=7 Otherwise, maxFilterLengthQs[xB0+1][yB0+k]=3 - if the width in luma samples of the transform block when cu_cbf is equal to 1 at luma position (xB0-1+1, yB0+k) or the prediction block when cu_cbf is equal to 0 at luma position (xB0-1+1, yB0+k) is equal to or greater than 32, then maxFilterLengthPs[xB0+1][yB0+k]=7 Otherwise, maxFilterLengthPs[xB0+1][yB0+k]=3 - if the width in chroma samples of the transform block when cu_cbf is equal to 1 or the prediction block when cu_cbf is equal to 0 is equal to or greater than 8 at both chroma position ((xB0+1) / SubWidthC, (yB0+k) / SubHeightC) and chroma position ((xB0+1) / SubWidthC-1, (yB0+k) / SubHeightC), maxFilterLengthCbCrs[(xB0+1) / SubWidthC][(yB0+k) / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[(xB0+1) / SubWidthC][(yB0+k) / SubHeightC]=1 otherwise - if the width in chroma samples of the transform block when cu_cbf is equal to 1 or the width in chroma samples of the coding block when cu_cbf is equal to 0 at both chroma position (xB0+1, yB0+k) and chroma position (xB0+l-1, yB0+k) is equal to or greater than 8, maxFilterLengthCbCrs[xB0+1][yB0+k] = 3 Otherwise, maxFilterLengthCbCrs[xB0+1][yB0+k]=1 Otherwise (edge ​​type equals EDGE_HOR), for k = 0..nTbW-1, l = 0..nTbH-1, the value of edgeFlags[xB0+k][yB0+l] is derived as follows: -If yB0 is equal to 0, edgeFlags[xB0+k][yB0+l] is set equal to filterEdgeFlag. - Otherwise, if the position (xB0+k, yB0+l) is at the transform block edge, then [xB0+k][yB0+l] is set equal to 1. - If edgeFlags[xB0+k][yB0+l] is equal to 1, If treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA - if the height in luma samples of the transform block when cu_cbf is equal to 1 at luma position (xB0+k, yB0+l) or the prediction block when cu_cbf is equal to 0 at luma position (xB0+k, yB0+l) is equal to or greater than 32, then maxFilterLengthQs[xB0+k][yB0+l]=7 Otherwise, maxFilterLengthQs[xB0+k][yB0+l]=3 - if the height in luma samples of the transform block when cu_cbf is equal to 1 at luma position (xB0+k, yB0+l-1) or the prediction block when cu_cbf is equal to 0 at luma position (xB0+k, yB0+l-1) is equal to or greater than 32, then maxFilterLengthPs[xB0+k][yB0+l]=7 - Otherwise, maxFilterLengthPs[xB0+k][yB0+l]=3 - if the height in chroma samples of the transform block when cu_cbf is equal to 1 at chroma position ((xB0+k) / SubWidthC, (yB0+l) / SubHeightC) and chroma position ((xB0+k) / SubWidthC, (yB0+l) / SubHeightC-l) or the prediction block when cu_cbfIs is equal to 0 at chroma position ((xB0+k) / SubWidthC, (yB0+l) / SubHeightC-l) is equal to or greater than 8, where yC is the top position of the current block in chroma samples relative to the top position of the current picture - if ((yC+yB0+1)%(1<<(log2_ctu_size_minus2+2)) / SubHeightC is equal to 0) (when edge type is EDGE_HOR and the edge overlaps a chroma CTB boundary) -maxFilterLengthCbCrs[(xB0+k) / SubWidthC][(yB0+l) / SubHeightC]=1 Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][(yB0+l) / SubHeightC]=3 - Otherwise, maxFilterLengthCbCrs[(xB0+k) / SubWidthC][(yB0+l) / SubHeightC]=1 otherwise - if the height in chroma samples of the transform block when cu_cbf is equal to 1 at chroma position (xB0+k,yB0+l) and chroma position (xB0+k,yB0+l-1) or the height of the prediction block when cu_cbf is equal to 0 is equal to or greater than 8, where yC is the top position of the current block in chroma samples relative to the top position of the current picture - if ((yC+yB0+l)%(1<<(log2_ctu_size_minus2+2)) / SubHeightC is equal to 0) (when edge type is EDGE_HOR and the edge overlaps a chroma CTB boundary) -maxFilterLengthCbCrs[xB0+k][yB0+l]=1 Otherwise, maxFilterLengthQCbCrs[xB0+k][yB0+l]=3 Otherwise, maxFilterLengthCbCrs[xB0+k][yB0+l]=1

[0115] Similarly, in one example, in the presence of residuals, the calculations used in the decision process for block edges can be based on the transform block / unit size, but when residuals do not exist, they can be based on the prediction block / unit size. That is, in one example, the determination of whether a Q block is a large block (i.e., bSideQisLargeBIk or sideQisLargeBIk) or a P block is a large block (i.e., bSidePisLargeBIk or sidePisLargeBIk) can be based on the transform block / unit size. Based on the following: If edge type is equal to EDGE_VER, then the ordered steps applied are as follows: … 2. First initialize the variables sidePisLargeBIk and sideQisLargeBIk to 0, and then modify them as follows: If maxFilterLengthP is greater than 3, If P0,0 belongs to a prediction block when cu_cbf is equal to 0, or P0,0 belongs to a transform block when cu_cbf is equal to 1 and the width in luma samples is greater than or equal to 32, then sidePisLargeBIk is set equal to 1, otherwise sidePisLargeBIk is set equal to 0. If maxFilterLengthQ is greater than 3, If q0,0 belongs to a prediction block when cu_cbf is equal to 0, or to a transform block when cu_cbf is equal to 1, where the width in luma samples is greater than or equal to 32, Set sideQisLargeBIk equal to 1, otherwise set sideQisLargeBIk equal to 0 … Otherwise (edgeType equals EDGE_HOR), the following ordered steps are applied: … 2. First initialize the variables sidePisLargeBIk and sideQisLargeBIk to 0, and then modify them as follows: If (luminance position of sample p0, 0% CtbSize Y) is equal to 0, then set sidePisLargeBIk to 0 otherwise, If maxFilterLengthP is greater than 3, If P0,0 belongs to a prediction block when cu_cbf is equal to 0, or P0,0 belongs to a transform block when cu_cbf is equal to 1 and height is greater than or equal to 32, then sidePisLargeBIk is set equal to 1, otherwise sidePisLargeBIk is set equal to 0. If maxFilterLengthQ is greater than 3, If q0,0 belongs to the prediction block when cu_cbf is equal to 0 or the conversion block When cu_cbfis is equal to 1 and height is greater than or equal to 32, set sideQisLargeBIk equal to 1, otherwise set sideQisLargeBIk equal to 0.

[0116] Reference again Figure 8 , the entropy coding unit 218 receives quantized transform coefficients and prediction syntax data (i.e., intra-frame prediction data, motion prediction data, QP data, etc.). The entropy coding unit 218 can be configured to perform entropy coding according to one or more techniques described herein. The entropy coding unit 218 can be configured to output a compatible bitstream, i.e., a bitstream from which a video decoder can receive and reproduce video data. In this manner, the video encoder 200 represents an example of a device configured to receive a matrix including sample values ​​of adjacent reconstructed video blocks for a video data component, determine a boundary strength value for a boundary between adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and modify sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0117] Fig. 9 300 is an example block diagram of a video decoder configured to decode video data according to one or more techniques of the present disclosure. In one example, the video decoder 300 may be configured to reconstruct the video data based on one or more of the above techniques. That is, the video decoder 300 may operate in a manner opposite to the above-described video encoder 200. The video decoder 300 may be configured to perform intra-frame prediction decoding and inter-frame prediction decoding, and may therefore be referred to as a hybrid decoder. Fig. 9The illustrated video decoder 300 includes an entropy decoding unit 302, an inverse quantization unit 304, an inverse transform processing unit 306, an intra-frame prediction processing unit 308, an inter-frame prediction processing unit 310, an adder 312, a filter unit 314, and a reference buffer 316. The video decoder 300 can be configured to decode video data in a manner consistent with a video encoding system that can implement one or more aspects of a video coding standard. It should be noted that although the example video decoder 300 is illustrated as having different functional blocks, such illustration is for illustrative purposes and does not limit the video decoder 300 and / or its subcomponents to a particular hardware or software architecture. The functionality of the video decoder 300 can be implemented using any combination of hardware, firmware, and / or software implementations.

[0118] like Fig. 9 As shown, the entropy decoding unit 302 receives an entropy coded bitstream. The entropy decoding unit 302 may be configured to decode the quantized syntax elements and quantized coefficients from the bitstream according to a process opposite to the entropy coding process. The entropy decoding unit 302 may be configured to perform entropy decoding according to any of the above entropy coding techniques. The entropy decoding unit 302 may parse the coded bitstream in a manner consistent with the video coding standard. The video decoder 300 may be configured to parse the coded bitstream generated based on the above techniques. The inverse quantization unit 304 receives the quantized transform coefficients (i.e., level values) and quantization parameter data from the entropy decoding unit 302. The quantization parameter data may include any and all combinations of delta QP values ​​and / or quantization group size values, etc. The video decoder 300 and / or the inverse quantization unit 304 may be configured to determine the QP value for inverse quantization based on the value signaled by the video encoder and / or by video characteristics and / or coding parameters. That is, the inverse quantization unit 304 may operate in a manner opposite to the coefficient quantization unit 206 described above. The inverse quantization unit 304 may be configured to apply inverse quantization. The inverse transform processing unit 306 may be configured to perform an inverse transform to produce reconstructed residual data. The techniques performed by the inverse quantization unit 304 and the inverse transform processing unit 306, respectively, may be similar to the techniques performed by the inverse quantization / transform processing unit 208 described above. The inverse transform processing unit 306 may be configured to apply an inverse DCT, an inverse DST, an inverse integer transform, a non-separable secondary transform (NSST), or a conceptually similar inverse transform process to the transform coefficients to produce a residual block in the pixel domain. Furthermore, as described above, whether a particular transform (or type of particular transform) is performed may depend on the intra prediction mode. For example, Fig. 9 As shown, the reconstructed residual data may be provided to an adder 312. The adder 312 may add the reconstructed residual data to the predicted video block and generate reconstructed video data.

[0119] As described above, the predicted video block can be determined according to the predictive video technology (i.e., intra-frame prediction and inter-frame prediction). The intra-frame prediction processing unit 308 can be configured to receive the intra-frame prediction syntax element and retrieve the predicted video block from the reference buffer 316. The reference buffer 316 may include a memory device configured to store one or more video data frames. The intra-frame prediction syntax element can identify the intra-frame prediction mode, such as the intra-frame prediction mode described above. In one example, the intra-frame prediction processing unit 308 can reconstruct the video block using one or more intra-frame prediction encoding techniques described herein. The inter-frame prediction processing unit 310 can receive the inter-frame prediction syntax element and generate a motion vector to identify the predicted block in one or more reference frames stored in the reference buffer 316. The inter-frame prediction processing unit 310 can generate a motion compensation block, possibly performing interpolation based on an interpolation filter. The syntax element may include an identifier of an interpolation filter for motion estimation with sub-pixel precision. The inter-frame prediction processing unit 310 can use an interpolation filter to calculate the interpolation of sub-integer pixels of the reference block.

[0120] Filter unit 314 may be configured to perform filtering on the reconstructed video data. For example, filter unit 314 may be configured to perform deblocking and / or SAO filtering, as described above with respect to filter unit 216. Furthermore, it should be noted that in some examples, filter unit 314 may be configured to perform proprietary arbitrary filters (e.g., visual enhancement). Fig. 9 As shown, the reconstructed video blocks may be output by the video decoder 300. In this manner, the video decoder 300 represents an example of a device configured to receive a matrix including sample values ​​of adjacent reconstructed video blocks for components of video data, determine a boundary strength value for a boundary between adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary, and modify sample values ​​in the adjacent reconstructed video blocks based on the determined boundary strength value and in accordance with a deblocking filter.

[0121] In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or sent via a computer-readable medium as one or more instructions or codes and executed by a hardware-based processing unit. A computer-readable medium may include a computer-readable storage medium corresponding to a tangible medium such as a data storage medium, or a communication medium including any medium that facilitates the transfer of a computer program from one place to another according to a communication protocol. In this manner, a computer-readable medium may generally correspond to (1) a non-transitory tangible computer-readable storage medium or (2) a communication medium such as a signal or carrier wave. A data storage medium may be any available medium that can be accessed by one or more computers or one or more processors to retrieve instructions, codes, and / or data structures for implementing the techniques described in the present invention. A computer program product may include a computer-readable medium.

[0122] 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 the desired program code in the form of instructions or data structures and can be accessed by a computer. Moreover, any connection is appropriately referred to as a computer-readable medium. For example, if instructions are transmitted from a website, server or other remote source using a coaxial cable, optical cable, twisted pair, digital subscriber line (DSL) or wireless technology such as infrared, radio and microwave, then coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technology such as infrared, radio and microwave are included in the definition of medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals or other temporary media, but are directed to non-temporary tangible storage media. As used herein, disks and optical disks include compact disks (CDs), laser optical disks, optical optical disks, digital versatile disks (DVDs), floppy disks and Blu-ray disks, where disks usually reproduce data magnetically, while optical disks reproduce data optically with lasers. The above combination should also be included in the scope of computer-readable media.

[0123] Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Thus, the term "processor" as used herein may refer to any of the aforementioned structures or any other structure suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided within dedicated hardware and / or software modules configured for encoding and decoding, or incorporated into a combined codec. Moreover, the techniques may be fully implemented in one or more circuits or logic elements.

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

[0125] In addition, each functional block or various features of the base station equipment and terminal equipment used in each of the above-mentioned embodiments can be implemented or executed by a circuit, which is usually an integrated circuit or multiple integrated circuits. The circuit designed to perform the functions described in this specification may include a general-purpose processor, a digital signal processor (DSP), a dedicated or general-purpose integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic, or a discrete hardware component, or a combination thereof. The general-purpose processor may be a microprocessor, or alternatively, the processor may be a conventional processor, a controller, a microcontroller or a state machine. The above-mentioned general-purpose processor or each circuit may be configured by a digital circuit or may be configured by an analog circuit. In addition, when a technology for making an integrated circuit that currently replaces an integrated circuit appears due to advances in semiconductor technology, an integrated circuit using this technology can also be used.

[0126] Various examples have been described. These and other examples are within the scope of the following claims.

[0127] <Conclusion> In one example, a method for filtering reconstructed video data is provided, the method comprising: A matrix comprising sample values ​​of adjacent reconstructed video blocks for components of the video data is received; a boundary strength value is determined for a boundary between the adjacent reconstructed video blocks, wherein the boundary is an intra-subpartition boundary; and sample values ​​in the adjacent reconstructed video blocks are modified according to a deblocking filter based on the determined boundary strength value.

[0128] In one example, the components of the video data in the method include chrominance components.

[0129] In one example, an apparatus for encoding video data is provided, the apparatus comprising one or more processors configured to perform any and all combinations of steps.

[0130] In one example, the apparatus includes a video encoder.

[0131] In one example, the apparatus includes a video decoder.

[0132] In one example, a system includes: a device and a device.

[0133] In one example, an apparatus for encoding video data is provided, the apparatus comprising means for performing any and all combinations of the steps.

[0134] In one example, a non-transitory computer-readable storage medium includes instructions stored thereon that, when executed, cause one or more processors of a device for encoding video data to perform any and all combinations of these steps.

[0135] In one example, a method for filtering reconstructed video data is provided, the method comprising: receiving a matrix of reconstructed luminance samples, the reconstructed luminance samples comprising P blocks and Q blocks adjacent to a deblocking boundary; determining whether the P block or the Q block has an edge perpendicular to the deblocking boundary and whose size is greater than or equal to 32; determining a maximum filter length based on whether the P block or the Q block has the edge; and deblocking the matrix of reconstructed luminance samples based on the determined maximum filter length.

[0136] In one example, the maximum filter length in the method is determined to be set to 7.

[0137] In one example, the maximum filter length in the method is determined to be set to 3.

[0138] In one example, the P block or Q block in the method is a transform block.

[0139] In one example, a device for filtering reconstructed video data is provided, the device comprising one or more processors, the processors being configured to: receive a matrix of reconstructed luminance samples, the reconstructed luminance samples comprising P blocks and Q blocks adjacent to a deblocking boundary; determine whether the P block or the Q block has an edge perpendicular to the deblocking boundary and whose size is greater than or equal to 32; determine a maximum filter length based on whether the P block or the Q block has the edge; and deblock the matrix of reconstructed luminance samples based on the determined maximum filter length.

[0140] <Cross Reference> The priority of this non-provisional application is based on 35 U.S.C. §119 to Provisional Application No. 62 / 807,703 on February 19, 2019, Provisional Application No. 62 / 810,913 on February 26, 2019, Provisional Application No. 62 / 813,985 on March 5, 2019, Provisional Application No. 62 / 816,844 on March 11, 2019, Provisional Application No. 62 / 817,348 on March 12, 2019, and Provisional Application No. 62 / 819,575 on March 16, 2019, all of which are incorporated herein by reference.

Claims

1. A method for filtering reconstructed video data, characterized in that: The method comprises: Receiving a matrix of reconstructed luma samples, the reconstructed luma samples being divided into two or four ISPs by an intra-frame sub-division area ISP pattern, wherein an ISP edge is located between two adjacent ISPs, the two adjacent ISPs including P blocks and Q blocks adjacent to the ISP edge; When an edge of one of the P block and the Q block is perpendicular to the ISP edge and a first size of the edge of the one of the P block and the Q block is greater than or equal to 32, determining, for the one of the P block and the Q block, a first maximum filter length equal to 7; Setting a non-zero value for the ISP edge to determine a boundary strength; and When the boundary strength for the ISP edge is equal to 2, the matrix of the reconstructed luma samples including the ISP edge is deblocked based on the determined first maximum filter length.

2. The method according to claim 1, characterized in that When the edge of the one of the P block and the Q block is perpendicular to the ISP edge and the first size is less than 32, the first maximum filter length is determined to be equal to 3 for the one of the P block and the Q block.

3. The method according to claim 1, characterized in that Each of the P block and the Q block is a transform block.

4. The method according to claim 1, characterized in that: The method further comprises: Determining whether an edge of the other of the P block and the Q block is perpendicular to the ISP edge; When the edge of the other one of the P block and the Q block is perpendicular to the ISP edge, determining whether a second size of the edge of the other one of the P block and the Q block is greater than or equal to 32; determining a second maximum filter length based on the determination of whether the second size is greater than or equal to 32; and The matrix of reconstructed luma samples is deblocked based on the determined first maximum filter length and the determined second maximum filter length.

5. The method according to claim 1, characterized in that The method further comprises: receiving an ISP mode flag for the matrix of the reconstructed luma samples, wherein the ISP mode flag indicates whether the reconstructed luma samples are divided into the two or four ISPs; receiving an ISP partition flag for the matrix of reconstructed luma samples when the ISP mode flag specifies that the matrix of reconstructed luma samples is partitioned into the P-block and the Q-block; and An edge type of the ISP edge is determined based on the ISP segmentation mark.

6. The method according to claim 5, characterized in that: The ISP segmentation mark indicates whether the edge type of the ISP edge is a vertical direction or a horizontal direction; When the edge type is a vertical direction, the first size is a width of the one of the P block and the Q block; as well as When the edge type is horizontal, the first size is a height of the one of the P block and the Q block.

7. An image encoding device for filtering reconstructed video data, characterized in that: The image encoding device comprises: at least one processor; and A storage device, the storage device is coupled to the at least one processor and stores a plurality of instructions executed by the at least one processor, when the at least one processor executes the plurality of instructions, the plurality of instructions cause the at least one processor to perform the method for filtering reconstructed video data as described in any one of claims 1-6.

8. An image decoding device for filtering reconstructed video data, characterized in that: The image decoding device comprises: at least one processor; and A storage device, the storage device is coupled to the at least one processor and stores a plurality of instructions executed by the at least one processor, when the at least one processor executes the plurality of instructions, the plurality of instructions cause the at least one processor to perform the method for filtering reconstructed video data as described in any one of claims 1-6.