Deblocking filter for subpartition boundaries caused by intra-subpartition coding tools

JP7590506B2Active Publication Date: 2024-11-26HUAWEI TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2023114626
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2019-01-10
Filing Date
2023-07-12
Publication Date
2024-11-26
Estimated Expiration
2040-01-10

AI Technical Summary

Benefits of technology

【0083】 1つまたは複数の実施形態の詳細が、添付図面および以下の説明において記載される。他の特徴、目的、および利点は、説明、図面、および請求項から明らかとなろう。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007590506000003
    Figure 0007590506000003
  • Figure 0007590506000004
    Figure 0007590506000004
  • Figure 0007590506000005
    Figure 0007590506000005
Patent Text Reader

Abstract

To provide a deblocking filter apparatus and method capable of reducing block artifacts.SOLUTION: A deblocking method includes the steps of: dividing a current coding block into sub-partitions including a first sub-partition and a second sub-partition adjacent to the first sub-partition when the current coding block is coded in an intra prediction mode; determining that maximum filter length for the first / second sub-partition is one when width of the first or second sub-partition is 4 samples, or when height of the first or second sub-partition is 4 samples, and modifying values for up to one sample of the first or second sub-partition.SELECTED DRAWING: Figure 11
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This patent application claims priority to U.S. Provisional Patent Application No. 62 / 791,003, filed January 10, 2019. The disclosures of the above-mentioned patent applications are incorporated herein by reference in their entireties.

[0002] FIELD Embodiments of the present disclosure relate generally to the field of picture processing, and more particularly, to deblocking filters for sub-partition boundaries caused by intra-sub-partition (ISP) coding tools. [Background technology]

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

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

[0005] In particular, in the context of intra prediction, the intra subpartition (ISP) coding tool has been recently introduced, where an image block (such as a transform unit (TU), a prediction unit (PU), or a coding unit (CU)) is divided into multiple subpartitions. However, intra subpartitions (ISP) can cause discontinuities in sample values ​​across subpartition boundaries, thereby causing undesirable boundaries, i.e. edge artifacts perceptible by the viewer. The goal in block-based image coding is to reduce edge artifacts below a visibility threshold. This is done by performing a deblocking filtering process. Such deblocking filtering is performed on the one hand at the decoding side to remove visible edge artifacts, but also at the encoding side to prevent edge artifacts from being coded into the image at all.

[0006] Therefore, there is a need for an improved in-loop deblocking filter apparatus and method that provides efficient removal of block artifacts that may be caused by intra-sub-partition coding tools. Summary of the Invention [Means for solving the problem]

[0007] In view of the above-mentioned problems, embodiments of the present application aim to provide a deblocking filter apparatus, an encoder, a decoder, and corresponding methods, which can reduce or even eliminate blocking artifacts that would be caused by an intra-subpartition coding tool, so as to improve coding efficiency.

[0008] Embodiments of the invention are defined by the features of the independent claims, further advantageous implementations of the embodiments are defined by the features of the dependent claims.

[0009] Particular embodiments are outlined in the accompanying independent claims and other embodiments in the dependent claims.

[0010] These and other objects are achieved by the subject matter of the independent claims. Further implementations are evident from the dependent claims, the description and the figures.

[0011] According to a first aspect of the present disclosure, there is provided a deblocking method for deblocking subpartition boundaries in a coding block in image encoding and / or decoding, in which a current coding block is coded in an intra prediction mode, the current coding block is divided into subpartitions including a first subpartition and a second subpartition adjacent to the first subpartition (such that the second subpartition is on the block to the right or below the first subpartition). In one example, the second subpartition is intra predicted based on the first subpartition (i.e., the current coding block is coded using an intra-subpartition ISP tool, or the subpartition boundaries are caused by the intra-subpartition ISP tool, in detail, the current coding block is divided into subpartitions by the ISP coding tool, and the inner subpartitions are intra predicted one by one, such as from left to right or from top to bottom), and the method includes: determining a first maximum filter length for the first subpartition to be 1 and / or a second maximum filter length for the second subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples or the height of the first subpartition is 4 samples or the height of the second subpartition is 4 samples; modifying (i.e. filtering) values ​​of up to one sample of the first subpartition, the up to one sample being taken from a row or column of the first subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; and / or and modifying (i.e., filtering) values ​​of up to one sample of the second subpartition, the up to one sample being taken from a row or column of the second subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition.

[0012] It may be understood that a first maximum filter length for a first subpartition may refer to a maximum number of samples in each adjacent row or column perpendicular to the subpartition boundary that are allowed to be modified for the first subpartition. A second maximum filter length for a second subpartition may refer to a maximum number of samples in each adjacent row or column perpendicular to the subpartition boundary that are allowed to be modified for the second subpartition. It may be understood that depending on the particular filtering decision phase, in some cases, no samples may be modified, or in other cases, only one sample may be modified in each adjacent row or column perpendicular to the subpartition boundary.

[0013] The present invention works for both vertical and horizontal subpartition boundaries. For vertical subpartition boundaries, the width of the first or second subpartition is checked to see if it is 4 samples wide. For horizontal subpartition boundaries, the height of the first or second subpartition is checked to see if it is 4 samples high.

[0014] It should be noted that the terms "block", "coding block", or "image block" are used in this disclosure and may apply to prediction units (PUs), coding units (CUs), etc. In VVC, generally, transform units and coding units are aligned in most cases, except for some scenarios when TU tiling or sub-block transform (SBT) or ISP is used. It may be understood that the terms "block / image block / coding block" may be interchanged in this disclosure. The terms "sample / pixel" may be interchanged in this disclosure.

[0015] The intra subpartition coding tool divides an intra prediction block (i.e. an intra coding block, which is an omission of the current coding block coded in intra prediction mode) into subpartitions and predicts the inner subpartitions one by one. There may be discontinuities across the subpartition boundaries. To reduce artifacts caused by these subpartition boundaries, an improved filtering process is proposed in which filtering up to one sample is performed within the first or second subpartition when the height of the first or second subpartition is four samples or when the width of the first or second subpartition is four samples. This allows to correct a small number of sample values ​​at the subpartition boundary, and thus the method can reduce block artifacts that may be caused by subpartition boundaries within the current coding block due to the application of ISP. From the viewpoint of computational load, weak filtering is advantageous.

[0016] In one possible implementation of the method according to the first aspect itself, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, then when the height of the first or second subpartition is 4 samples, up to one sample taken from a column of the first or second subpartition that is perpendicular to and adjacent to the boundary between the first and second subpartition is modified. It can be understood that "up to one sample is modified" may refer to that at most one sample is allowed to be modified, i.e. depending on the particular filtering decision phase, in some cases no samples may be modified or in other cases only one sample may be modified in each column that is perpendicular to and adjacent to the subpartition boundary.

[0017] In one possible implementation of the method according to the first aspect itself, if the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, then when the width of the first or second subpartition is 4 samples, up to one sample taken from a row of the first or second subpartition that is perpendicular to and adjacent to the boundary between the first and second subpartition is modified. It can be understood that "up to one sample is modified" may refer to at most one sample being allowed to be modified, i.e. depending on the particular filtering decision phase, in some cases no samples may be modified or in other cases only one sample may be modified in each row that is perpendicular to and adjacent to the subpartition boundary.

[0018] In one possible implementation form of a method according to any preceding implementation form of the first aspect or the first aspect itself, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, the subpartition boundary between the first subpartition and the second subpartition is a horizontal subpartition boundary, or alternatively, if the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, the subpartition boundary between the first subpartition and the second subpartition is a vertical subpartition boundary.

[0019] In one possible implementation of the method according to any preceding implementation of the first aspect or the first aspect itself, if an intra subpartitioning type for dividing the current coding block into subpartitions is vertical, the first subpartition may be to the left of the second subpartition, and the second subpartition may be intra predicted based on a reconstructed value (e.g., a reconstructed version) of the first subpartition; If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the first subpartition may be above the second subpartition, and the second subpartition may be intra predicted based on a reconstructed value (e.g., a reconstructed version) of the first subpartition.

[0020] It can be understood that the second sub-partition is intra-predicted based on the reconstructed version (i.e., reconstructed value) of the first sub-partition. The reconstructed first sub-partition represents a reference for intra-prediction of the second sub-partition. It should be noted that after the current picture to which the current coding block belongs is reconstructed, the reconstructed picture is input to the filtering process. During the reconstruction of the current picture, the current coding block is intra-predicted, which is applied by the ISP coding tool to obtain a prediction block (e.g., a predicted value) of the current coding block, in detail, the inner sub-partitions of the current intra-coding block are intra-predicted one by one.

[0021] In one possible implementation of the method according to any preceding implementation of the first aspect or the first aspect itself, the number of sub-partitions is two or four.

[0022] In one possible implementation of the method according to any preceding implementation of the first aspect or the first aspect itself, If the width of the current coding block is equal to 4 and the height of the coding block is equal to 8, and / or if the width of the current coding block is equal to 8 and the height of the current coding block is equal to 4, the number of subpartitions is 2; Otherwise, the number of subpartitions is 4.

[0023] In one possible implementation of the method according to any preceding implementation of the first aspect or the first aspect itself, up to one sample in the first or second subpartition is modified, where n is an integer, even if a subpartition boundary between the first and second subpartitions does not overlap with the n×n sample grid.

[0024] It is allowed to deblock target boundaries that are not aligned with the n×n grid, but are internal boundaries between subpartitions of the coding block caused by the ISP.

[0025] In one possible implementation of any preceding implementation of the first aspect or the method according to the first aspect itself, up to one sample in the first or second subpartition is modified only if a subpartition boundary between the first and second subpartitions overlaps with an n×n sample grid, where n is an integer, e.g., n=4 or n=8. Thereby, the computational load can be reduced even further.

[0026] Moreover, filtering of up to one sample in a subpartition may be performed only when all of the subpartitions are four samples high or four samples wide, which may further reduce the computational load of the overall coding process.

[0027] In general, the sub-partitions may be rectangular transform block sub-partitions.

[0028] In one possible implementation of the method according to any preceding implementation of the first aspect or the first aspect itself, the samples of the sub-partition are luma samples or the samples of the sub-partition are chroma samples.

[0029] In one possible implementation of the method according to any of the preceding implementations of the first aspect or the first aspect itself, if the intra-subpartitioning type of dividing the current coding block into subpartitions is vertical, the order of intra-predicting the subpartitions is from left to right, or if the intra-subpartitioning type of dividing the current coding block into subpartitions is horizontal, the order of intra-predicting the subpartitions is from top to bottom. That is, the division of the prediction block into subpartitions may be performed in the vertical direction. In this case, the order of intra-predicting the subpartitions is from left to right one by one. Alternatively, the division of the prediction block into subpartitions may be performed in the horizontal direction. In this case, the order of intra-predicting the two subpartitions is from top to bottom one by one.

[0030] In this disclosure, the current coding block is coded using an intra-subpartition ISP tool, or the subpartition boundary is caused by the intra-subpartition ISP tool.

[0031] In general, the boundary strengths of all boundaries between sub-partitions of a coding block may be set to a constant value (eg, 2) indicating the strength of the filtering process to simplify the overall processing.

[0032] Moreover, in the above embodiment, the method includes the steps of obtaining coded block flags CBF values ​​corresponding to two adjacent sub-partitions; and determining a boundary strength of the boundary between the two adjacent sub-partitions of the current block according to the CBF values ​​corresponding to the two adjacent sub-partitions; and making a filtering decision of whether to perform filtering or not according to the determined boundary strength. At least one of the CBF values ​​corresponding to two adjacent sub-partitions may not be equal to 0, where 0 implies that there is no residual data after quantization of that sub-partition.

[0033] According to a second aspect of the present disclosure, there is provided a deblocking method for deblocking block edges between image blocks in image encoding and / or decoding, the block edges including edges between a current sub-partition of a current coding block (i.e. a current intra-coding block) and a neighboring block of the current coding block, the current coding block is coded in an intra prediction mode, the current coding block is divided into sub-partitions (or the current coding block is coded using an intra-sub-partition ISP tool, or the sub-partitions are caused by an intra-sub-partition ISP tool), and the method includes: determining a third maximum filter length for the current subpartition to be 1 and / or a fourth maximum filter length for the neighboring blocks to be 1 when the width of the current subpartition is 4 samples or the height of the current subpartition is 4 samples; modifying the value of up to one sample of the current sub-partition, the up to one sample being taken from a row or column of the current sub-partition that is perpendicular to and adjacent to an edge between the current sub-partition and the neighboring block; and / or and modifying the value of up to one sample of the neighboring block, the up to one sample being taken from a row or column of the neighboring block that is perpendicular to and adjacent to the edge between the current subpartition and the neighboring block.

[0034] It should be noted that according to the first aspect itself, if the number of subpartitions is two, the current subpartition may be the first subpartition or the second subpartition. If the number of subpartitions is more than two, such as four, the current subpartition may be the leftmost or rightmost subpartition inside the current coding block if the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, or the current subpartition may be the topmost or bottommost subpartition inside the current coding block if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal.

[0035] In the second aspect of the present disclosure, the current sub-partition is intra-predicted based on the neighboring block from above or to the left. Note that the neighboring block may not be a coding block with further division, i.e., there may be no sub-partition of the neighboring block.

[0036] It may be understood that the third maximum filter length for the current subpartition may refer to the maximum number of samples in each adjacent row or column perpendicular to the edge that are allowed to be modified for the current subpartition. The fourth maximum filter length for the neighboring block may refer to the maximum number of samples in each adjacent row or column perpendicular to the edge that are allowed to be modified for the neighboring block. It may be understood that depending on the particular filtering decision phase, in some cases, no samples may be modified, or in other cases, only one sample may be modified in each adjacent row or column perpendicular to the subpartition boundary.

[0037] The present invention works for both vertical and horizontal edges between the current subpartition and the neighboring block. For vertical edges, the width of the current subpartition or neighboring block is checked to see if it is 4 samples wide. For horizontal edges, the height of the current subpartition or neighboring block is checked to see if it is 4 samples high.

[0038] The difference between a block edge and a subpartition boundary is explained in further description: a subpartition boundary is an edge that is internal to a coding block using intra-subpartition (ISP) coding tools, and a block edge (i.e., a coding unit (CU) edge or coding block edge or CU boundary) is an edge that is shared between two coding units or two coding blocks.

[0039] The intra subpartition coding tool divides an intra prediction block (i.e. an intra coding block, which is an omission of a current coding block coded in an intra prediction mode) into subpartitions and predicts the inner subpartitions of the intra prediction block one by one. There may be discontinuities across the edges between the current subpartition of the current coding block and the neighboring blocks of the current coding block. Therefore, to reduce artifacts caused by such edges, an improved filtering process is proposed, which filters up to one sample in the current subpartition or the neighboring block when the height of the current subpartition is four samples or the width of the current subpartition is four samples. This allows a small number of sample values ​​at the edge to be corrected, and thus the method can reduce block artifacts that may be caused by edges between the current block where the ISP is applied and the neighboring blocks, while avoiding to some extent the overlapping of filtering between the edge and the subpartition boundary.

[0040] In one possible implementation of the method according to the second aspect itself, If the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, then when the height of the current subpartition is 4 samples, up to one sample from a column of the current subpartition that is perpendicular to and adjacent to an edge between the current subpartition and a neighboring block below or above the current subpartition is modified. It may be understood that "up to one sample is modified" may refer to at most one sample being allowed to be modified. That is, depending on the particular filtering decision phase, in some cases no samples may be modified, or in other cases only one sample may be modified in each column that is perpendicular to and adjacent to an edge.

[0041] In one possible implementation of the method according to the second aspect itself, If the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, then when the width of the current subpartition is 4 samples, up to one sample from a row of the current subpartition that is perpendicular to and adjacent to an edge between the current subpartition and a neighboring block to the left or right of the current subpartition is modified. It may be understood that "up to one sample is modified" may refer to at most one sample being allowed to be modified. That is, depending on the particular filtering decision phase, in some cases no samples may be modified, or in other cases only one sample in each row that is perpendicular to and adjacent to an edge may be modified.

[0042] In one possible implementation of the method according to any of the preceding implementations of the second aspect or the second aspect itself, if an intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, the current subpartition is to the right of a neighboring block, and the current subpartition is intra predicted based on reconstructed values ​​of the neighboring block; If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the current subpartition is below a neighboring block, and the current subpartition is intra predicted based on the reconstructed values ​​of the neighboring block.

[0043] The current sub-partition may be intra predicted based on another coding block that is located adjacent to the coding block, which may be above the coding block or to the left of the coding block. More precisely, the current sub-partition may be intra predicted based on reconstructed versions of the neighboring coding blocks.

[0044] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, the number of sub-partitions is two or four.

[0045] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, If the width of the current coding block is equal to 4 and the height of the coding block is equal to 8, and / or if the width of the current coding block is equal to 8 and the height of the current coding block is equal to 4, the number of subpartitions is 2; Otherwise, the number of subpartitions is 4.

[0046] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, up to one sample in the current subpartition or in the neighboring block is modified, even if the edge between the current subpartition and the neighboring block does not overlap with the n×n sample grid, where n is an integer, for example n=4 or n=8.

[0047] In one possible implementation of the method according to any of the preceding implementations of the second aspect or the second aspect itself, up to one sample in the current subpartition or in the neighboring block is removed only if an edge between the current subpartition and the neighboring block overlaps with the n×n sample grid. has been fixed , where n is an integer, for example, n=4 or n=8.

[0048] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, the samples of the sub-partition are luma samples or the samples of the sub-partition are chroma samples.

[0049] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, the sub-partitions are rectangular transform block sub-partitions.

[0050] In one possible implementation of the method according to any preceding implementation of the second aspect or the second aspect itself, the current coding block is coded using an intra-sub-partition ISP tool.

[0051] According to a third aspect of the present disclosure, there is provided a device for use in an image encoder and / or an image decoder for deblocking a sub-partition boundary in a coding block, the device comprising: a current coding block coded in an intra prediction mode, the current coding block being divided into sub-partitions including a first sub-partition and a second sub-partition adjacent to the first sub-partition, the second sub-partition being intra predicted based on the first sub-partition; The device is determining a first maximum filter length for the first subpartition to be 1 and / or a second maximum filter length for the second subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples or the height of the first subpartition is 4 samples or the height of the second subpartition is 4 samples; modifying values ​​of up to one sample of the first subpartition, the up to one sample being taken from a row or column of the first subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; and / or modifying values ​​of up to one sample of the second subpartition, the up to one sample being taken from a row or column of the second subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; The method includes the step of:

[0052] According to a fourth aspect of the present disclosure, there is provided a device for use in an image encoder and / or an image decoder for deblocking block edges between image blocks, the block edges including edges between current sub-partitions of a current coding block and neighboring blocks of the current coding block, the current coding block being coded in an intra prediction mode, the current coding block being divided into sub-partitions, The device is determining a third maximum filter length for the current subpartition to be 1 and / or a fourth maximum filter length for the neighboring blocks to be 1 when the width of the current subpartition is 4 samples or the height of the current subpartition is 4 samples; modifying values ​​of up to one sample of the current sub-partition, the up to one sample being taken from a row or column of the current sub-partition that is perpendicular to and adjacent to an edge between the current sub-partition and a neighboring block; and / or modifying values ​​of up to one sample of the neighboring block, the up to one sample being taken from a row or column of the neighboring block that is perpendicular to and adjacent to an edge between the current subpartition and the neighboring block; The method includes the step of:

[0053] The method according to the first aspect of the invention may be performed by an apparatus according to the third aspect of the invention. Further features and implementations of the apparatus according to the third aspect of the invention correspond to the features and implementations of the method according to the first aspect of the invention.

[0054] The method according to the second aspect of the invention may be performed by an apparatus according to the fourth aspect of the invention. Further features and implementations of the apparatus according to the fourth aspect of the invention correspond to the features and implementations of the method according to the second aspect of the invention.

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

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

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

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

[0059] According to a ninth aspect, the present invention relates to an encoder or decoder comprising processing circuitry for performing a method according to the first or second aspect or any possible embodiment of the first or second aspect.

[0060] According to a tenth aspect of the present invention there is provided a video encoding apparatus for encoding pictures of a video stream, the video encoding apparatus comprising: a reconstruction unit configured to reconstruct a picture, the reconstruction of the picture comprising generating a reconstructed block of a current coding block belonging to the picture, the current coding block being coded in an intra prediction mode, the current coding block being divided into sub-partitions including a first sub-partition and a second sub-partition, the second sub-partition being intra predicted based on the first sub-partition; a filter processing unit configured to process the reconstructed picture into a filtered reconstructed picture, the filter processing unit being specifically configured to filter up to one sample in a current subpartition of a reconstructed subpartition of a reconstructed block when a height of the current subpartition or another subpartition adjacent to the current subpartition is four samples or when a width of the current subpartition or another subpartition adjacent to the current subpartition is four samples, the up to one sample being located in a row or column of the current subpartition that is orthogonal to a boundary between the current subpartition and the other subpartition located adjacent to the current subpartition, with one sample adjacent to the boundary; or the filter processing unit being specifically configured to filter a boundary between a current subpartition of a reconstructed block and a neighboring block adjacent to the current subpartition based on a respective maximum filter length for the current subpartition and a respective maximum filter length for the neighboring block, the respective maximum filter lengths being 1 when a height of the current subpartition is four samples or a width of the current subpartition is four samples.

[0061] This makes it possible to efficiently improve the quality of the reconstructed pictures in the framework of an ISP.

[0062] In one possible implementation, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, then when the height of the first or second subpartition is 4 samples, up to one sample taken from a column of the first or second subpartition that is perpendicular to and adjacent to the boundary between the first and second subpartition is modified. It may be understood that "up to one sample is modified" may refer to at most one sample being allowed to be modified. That is, depending on the particular filtering decision phase, in some cases no samples may be modified, or in other cases only one sample may be modified in each column that is perpendicular to and adjacent to the subpartition boundary.

[0063] In one possible implementation, if the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, then when the width of the first or second subpartition is 4 samples, up to one sample taken from a row of the first or second subpartition that is perpendicular to and adjacent to the boundary between the first and second subpartition is modified. It may be understood that "up to one sample is modified" may refer to at most one sample being allowed to be modified. That is, depending on the particular filtering decision phase, in some cases no samples may be modified, or in other cases only one sample may be modified in each row that is perpendicular to and adjacent to the subpartition boundary.

[0064] In one possible implementation, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, the subpartition boundary between the first subpartition and the second subpartition is a horizontal subpartition boundary, or if the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, the subpartition boundary between the first subpartition and the second subpartition is a vertical subpartition boundary.

[0065] In one possible implementation, if an intra subpartitioning type for dividing the current coding block into subpartitions is vertical, a first subpartition may be to the left of a second subpartition, and the second subpartition may be intra predicted based on the reconstructed values ​​of the first subpartition; If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the first subpartition may be above the second subpartition, and the second subpartition may be intra predicted based on the reconstructed values ​​of the first subpartition.

[0066] It can be understood that the second sub-partition is intra-predicted based on the reconstructed version (i.e., reconstructed value) of the first sub-partition. The reconstructed first sub-partition represents a reference for intra-prediction of the second sub-partition. It should be noted that after the current picture to which the current coding block belongs is reconstructed, the reconstructed picture is input to the filtering process. During the reconstruction of the current picture, the current coding block is intra-predicted, which is applied by the ISP coding tool to obtain a prediction block (e.g., a predicted value) of the current coding block, in detail, the inner sub-partitions of the current intra-coding block are intra-predicted one by one.

[0067] In one possible implementation, the number of sub-partitions is two or four.

[0068] In one possible implementation, If the width of the current coding block is equal to 4 and the height of the coding block is equal to 8, and / or if the width of the current coding block is equal to 8 and the height of the current coding block is equal to 4, the number of subpartitions is 2; Otherwise, the number of subpartitions is 4.

[0069] In one possible implementation, up to one sample in the first or second subpartition is modified, where n is an integer, even if the subpartition boundary between the first and second subpartitions does not overlap with the n×n sample grid.

[0070] It is allowed to deblock target boundaries that are not aligned with the n×n grid, but are internal boundaries between subpartitions of the coding block caused by the ISP.

[0071] In one possible implementation, up to one sample in the first or second subpartition is modified only if the subpartition boundary between the first and second subpartitions overlaps with the n×n sample grid, where n is an integer, e.g., n=4 or n=8. Thereby, the computational load can be reduced even further.

[0072] Moreover, filtering of up to one sample in a subpartition may be performed only when all of the subpartitions are four samples high or four samples wide, which may further reduce the computational load of the overall coding process.

[0073] In general, the sub-partitions may be rectangular transform block sub-partitions.

[0074] In one possible implementation, the samples of the sub-partitions are luma samples or the samples of the sub-partitions are chroma samples.

[0075] In one possible implementation, if the intra-subpartitioning type of the current coding block is divided into subpartitions is vertical, the order of intra-predicting the subpartitions is from left to right, or if the intra-subpartitioning type of the current coding block is divided into subpartitions is horizontal, the order of intra-predicting the subpartitions is from top to bottom. That is, the division of the prediction block into subpartitions may be performed in the vertical direction. In this case, the order of intra-predicting the subpartitions is from left to right one by one. Alternatively, the division of the prediction block into subpartitions may be performed in the horizontal direction. In this case, the order of intra-predicting the two subpartitions is from top to bottom one by one.

[0076] In this disclosure, the current coding block is coded using an intra-subpartition ISP tool, or the subpartition boundary is caused by the intra-subpartition ISP tool.

[0077] In general, the boundary strengths of all boundaries between sub-partitions of a coding block may be set to a constant value (eg, 2) indicating the strength of the filtering process to simplify the overall processing.

[0078] In addition, a coded block flag CBF value corresponding to two adjacent sub-partitions may be obtained, and a boundary strength of a boundary between the two adjacent sub-partitions of the current block is determined according to the CBF value corresponding to the two adjacent sub-partitions; A filtering decision of whether to filter or not may be made according to the determined boundary strength. At least one of the CBF values ​​corresponding to two adjacent subpartitions may not be equal to 0, where 0 implies that there is no residual data after quantization of that subpartition.

[0079] According to an eleventh aspect of the present invention there is provided a video decoding apparatus for decoding pictures of an encoded video stream, the video decoding apparatus comprising: a reconstruction unit configured to reconstruct a picture, the reconstruction of the picture comprising generating a reconstructed block of a current coding block belonging to a current picture, the current coding block being coded in an intra prediction mode, the current coding block being divided into sub-partitions including a first sub-partition and a second sub-partition, the second sub-partition being intra predicted based on the first sub-partition; a filter processing unit configured to process the reconstructed picture into a filtered reconstructed picture, the filter processing unit being specifically configured to filter up to one sample in a current subpartition of a reconstructed subpartition of a reconstructed block when a height of the current subpartition or another subpartition adjacent to the current subpartition is four samples or when a width of the current subpartition or another subpartition adjacent to the current subpartition is four samples, the up to one sample being located in a row or column of the current subpartition that is orthogonal to a boundary between the current subpartition and the other subpartition located adjacent to the current subpartition, with one sample adjacent to the boundary; or the filter processing unit being specifically configured to filter a boundary between a current subpartition of a reconstructed block and a neighboring block adjacent to the current subpartition based on a respective maximum filter length for the current subpartition and a respective maximum filter length for the neighboring block, the respective maximum filter lengths being 1 when a height of the current subpartition is four samples or a width of the current subpartition is four samples.

[0080] This makes it possible to efficiently improve the quality of the reconstructed pictures in the framework of an ISP.

[0081] Further, an encoder is provided, comprising means for encoding a current coding block of a current picture, the means comprising means for generating a reconstructed block of the current coding block according to any one of the above-mentioned embodiments of the method of the present invention, and means for filtering the reconstructed picture of the current picture.

[0082] Further, a decoder is provided, comprising means for decoding a current coding block of a current picture, the means comprising means for generating a reconstructed block of the current coding block according to any one of the above-mentioned embodiments of the method of the present invention, and means for filtering the reconstructed picture of the current picture.

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

[0084] In the following, embodiments of the invention are explained in more detail with reference to the accompanying figures and drawings. [Brief description of the drawings]

[0085] [Figure 1A] 1 is a block diagram illustrating an example of a video coding system configured to implement embodiments of the present invention. [Figure 1B] 2 is a block diagram illustrating another example of a video coding system configured to implement embodiments of the present invention. [Diagram 2] FIG. 1 is a block diagram illustrating an example of a video encoder configured to implement embodiments of the present invention. [Diagram 3] 2 is a block diagram illustrating an exemplary structure of a video decoder configured to implement embodiments of the present invention. [Figure 4] FIG. 1 is a block diagram showing an example of an encoding device or a decoding device. [Diagram 5] FIG. 11 is a block diagram showing another example of an encoding device or a decoding device. [Figure 6] 1 is a block diagram illustrating an example of deblocking subpartition edges within a coding unit (CU) using an intra-subpartition (ISP) tool. [Figure 7]FIG. 13 is a block diagram illustrating another example of deblocking subpartition edges within a CU using an intra-subpartition (ISP) tool. [Figure 8] FIG. 13 is a block diagram illustrating an example of deblocking sub-partition edges within a CU that overlap an 8×8 sample grid. [Figure 9] FIG. 13 is a block diagram illustrating an example of deblocking all subpartition edges in a CU that overlap a 4×4 sample grid. [Figure 10] FIG. 13 is a block diagram illustrating an example in which when the sub-partition size is less than 8 samples orthogonal in the direction of deblocking, a weak filter that uses only 3 samples in the deblocking decision and modifies only 1 sample is accordingly used. [Figure 11] FIG. 1 is a flow diagram illustrating an example process for deblocking filtering. [Figure 12] FIG. 11 is a flow diagram illustrating another example process for deblocking filtering. [Figure 13] 1 is a schematic diagram of a device for deblocking sub-partition boundaries in a coding block. [Figure 14] FIG. 2 is a schematic diagram of a device for deblocking block edges. [Figure 15] 1 is a flow diagram illustrating an example process of coding implemented in a decoding device or an encoding device. [Figure 16] FIG. 11 is a flow diagram illustrating another exemplary process of coding implemented in a decoding device or an encoding device. [Figure 17] 1 is a schematic diagram of a device for video coding. [Figure 18] 1 is a schematic diagram of a device for video coding. [Figure 19] 1 is a block diagram showing an exemplary structure of a content supply system for implementing a content distribution service. [Figure 20]FIG. 2 is a block diagram illustrating the structure of an example of a terminal device. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0086] In the following, identical reference signs refer to identical or at least functionally equivalent features, unless expressly specified otherwise.

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

[0088] For example, it is understood that disclosure related to a described method may also apply to a corresponding device or system configured to perform the method, and vice versa. For example, if one or more particular method steps have been described, the corresponding device may include one or more units (e.g., one unit performing one or more steps, or multiple units each performing one or more of the multiple steps), e.g., functional units, for performing the described one or more method steps, even if such one or more units are not explicitly described or illustrated. On the other hand, if, for example, a particular apparatus is described based on one or more units, e.g., functional units, the corresponding method may include one step for performing the function of one or more units (e.g., one step performing the function of one or more units, or multiple steps each performing one or more functions of multiple units), even if such one or more steps are not explicitly described or illustrated. Furthermore, it is understood that features of various exemplary embodiments and / or aspects described herein may be combined with each other, unless specifically stated otherwise.

[0089] Video coding usually refers to the processing of a sequence of pictures to form a video or a video sequence. Instead of the term "picture", the terms "frame" or "image" may be used synonymously in the field of video coding. Video coding (or, in general, coding) includes two parts: video encoding and video decoding. Video encoding is performed at the source side and usually involves processing the original video picture (e.g., by compression) to reduce the amount of data required to represent the video picture (for more efficient storage and / or transmission). Video decoding is performed at the destination side and usually involves the reverse processing compared to the encoder to reconstruct the video picture. The embodiments referring to "coding" of a video picture (or, in general, a picture) shall be understood to relate to "encoding" or "decoding" of the video picture or the respective video sequence. The combination of the encoding and decoding parts is also called a codec (coding and decoding).

[0090] In the case of lossless video coding, the original video picture can be reconstructed, i.e., the reconstructed video picture has the same quality as the original video picture (assuming there is no transmission loss or other data loss during storage or transmission). In the case of lossy video coding, further compression is performed, e.g., by quantization, to reduce the amount of data representing the video picture, and the video picture cannot always be completely reconstructed at the decoder, i.e., the quality of the reconstructed video picture is lower, i.e., worse, compared to the quality of the original video picture.

[0091] Some video coding standards belong to the group of "lossy hybrid video codecs" (i.e., they combine spatial and temporal prediction in the sample domain with 2D transform coding to apply quantization in the transform domain). Each picture of a video sequence is usually divided into a set of non-overlapping blocks, and coding is usually performed at the block level. In other words, in the encoder, a video is usually processed or coded at the block (video block) level, for example, by using spatial (intra-picture) and / or temporal (inter-picture) prediction to generate a predictive block, subtracting the predictive block from a current block (a block currently being / to be processed) to obtain a residual block, transforming the residual block, and quantizing the residual block in the transform domain to reduce (compress) the amount of data to be transmitted, while in the decoder, the reverse processing is applied to the coded or compressed block compared to the encoder to reconstruct the current block for representation. Furthermore, the encoder replicates the decoder processing loop so that both generate the same prediction (e.g., intra-prediction and inter-prediction) and / or reconstruction for processing or coding a subsequent block.

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

[0093] 1A is a schematic block diagram illustrating an example coding system 10, such as video coding system 10 (or short coding system 10), that may utilize techniques of the present application. A video encoder 20 (or short encoder 20) and a video decoder 30 (or short decoder 30) of video coding system 10 represent examples of devices that may be configured to perform techniques according to various examples described in the present application.

[0094] As shown in FIG. 1A, coding system 10 may generate encoded picture data 21, e.g., encoded picture data 21 The present invention includes a source device 12 configured to provide a destination device 14 with a digital signal for decoding.

[0095] The source device 12 includes an encoder 20, and may additionally, i.e. optionally, include a picture source 16, a pre-processor (or pre-processing unit) 18, for example a picture pre-processor 18, and a communication interface or unit 22.

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

[0097] To distinguish from the pre-processor 18 and the processing performed by the pre-processing unit 18 , the pictures or picture data 17 are sometimes referred to as raw pictures or raw picture data 17 .

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

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

[0100] Communications interface 22 of source device 12 may be configured to receive encoded picture data 21 and transmit the encoded picture data 21 (or any further processed version thereof) via communications channel 13 to another device, e.g., destination device 14 or any other device, for storage or direct reconstruction.

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

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

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

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

[0105] Communications interface 28, which forms the counterpart of communications interface 22, may be configured, for example, to receive transmitted data and process the transmitted data using any type of corresponding transmission decoding or processing and / or depackaging to obtain encoded picture data 21.

[0106] Both communication interface 22 and communication interface 28 may be configured as unidirectional communication interfaces, as indicated by the arrow for communication channel 13 in FIG. 1A pointing from source device 12 to destination device 14, or as bidirectional communication interfaces, and may be configured to send and receive messages, e.g., to set up a connection, to acknowledge and exchange any other information related to the communication link and / or data transmission, e.g., the transmission of encoded picture data.

[0107] The decoder 30 is configured to receive the encoded picture data 21 and provide decoded picture data 31 or decoded pictures 31 (further details are described below, for example based on Figure 3 or Figure 5).

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

[0109] A display device 34 of destination device 14 is configured to receive the post-processed picture data 33, for example, for displaying the picture to a user or viewer. The display device 34 may be or include any type of display, e.g., an integrated or external display or monitor, for presenting the reconstructed picture. The display may include, for example, a liquid crystal display (LCD), an organic light emitting diode (OLED) display, a plasma display, a projector, a micro LED display, a liquid crystal on silicon (LCoS), a digital light processor (DLP), or any type of other display.

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

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

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

[0113] Source device 12 and destination device 14 may include any of a wide range of devices, including any type of handheld or fixed device, e.g., a notebook or laptop computer, a mobile phone, a smartphone, a tablet or tablet computer, a camera, a desktop computer, a set-top box, a television, a display device, a digital media player, a video game console, a video streaming device (such as a content service server or a content delivery server), a broadcast receiver device, a broadcast transmitter device, and the like, and may use no operating system or any type of operating system. In some cases, source device 12 and destination device 14 may be equipped for wireless communication. Thus, source device 12 and destination device 14 may be wireless communication devices.

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

[0115] For ease of explanation, embodiments of the present invention are described herein with reference to, for example, High-Efficiency Video Coding (HEVC) or with reference to reference software of Versatile Video Coding (VVC), a next-generation video coding standard formulated by the Joint Collaboration Team on Video Coding (JCT-VC) of the ITU-T Video Coding Experts Group (VCEG) and the ISO / IEC Motion Picture Experts Group (MPEG). It will be appreciated by those skilled in the art that embodiments of the present invention are not limited to HEVC or VVC.

[0116] Encoder and encoding method FIG. 2 shows a schematic block diagram of an exemplary video encoder 20 configured to implement the techniques of the present application. In the example of FIG. 2, the video encoder 20 includes an input 201 (or an input interface 201), a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210 and an inverse transform processing unit 212, a reconstruction unit 214, a loop filter unit 220, a decoded picture buffer (DPB) 230, a mode selection unit 260, an entropy coding unit 270, and an output 272 (or an output interface 272). The mode selection unit 260 may include an inter prediction unit 244, an intra prediction unit 254, and a division unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). The video encoder 20 as shown in FIG. 2 may also be referred to as a hybrid video encoder, i.e., a video encoder according to a hybrid video codec.

[0117] The residual calculation unit 204, the transform processing unit 206, the quantization unit 208, and the mode selection unit 260 may be referred to as forming a forward signal path of the encoder 20, while the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244, and the intra prediction unit 254 may be referred to as forming a backward signal path of the video encoder 20, which corresponds to the signal path of the decoder (see video decoder 30 in FIG. 3). The inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the loop filter 220, the decoded picture buffer (DPB) 230, the inter prediction unit 244, and the intra prediction unit 254 are also referred to as forming a “built-in decoder” of the video encoder 20.

[0118] Pictures and picture divisions (pictures and blocks) The encoder 20 may be configured to receive, for example, via input 201, a picture 17 (or picture data 17), e.g., a picture of a sequence of pictures forming a video or a video sequence. The received picture or picture data may also be a preprocessed picture 19 (or preprocessed picture data 19). For simplicity, the following description refers to picture 17. Picture 17 may also be called a current picture, or a picture to be coded (particularly in video coding, to distinguish the current picture from other pictures, e.g., previously encoded and / or decoded pictures, of the same video sequence, i.e. a video sequence that also includes the current picture).

[0119] A (digital) picture is or can be considered as a two-dimensional array or matrix of samples with intensity values. The samples in the array are sometimes called pixels (picture elements in short form) or pels. The number of samples in the horizontal and vertical directions (or axes) of the array or picture defines the size and / or resolution of the picture. For color representation, three color components are usually employed, i.e., a picture may be represented or contain three sample arrays. In an RBG format or color space, a picture contains corresponding red, green, and blue sample arrays. However, in video coding, each pixel is usually represented in a luminance and chrominance format or color space, e.g., YCbCr, which contains a luminance component denoted by Y (sometimes L is also used instead) and two chrominance components denoted by Cb and Cr. The luminance (or short luma) component Y represents the brightness or gray level intensity (e.g., as in a grayscale picture), and the two chrominance (or short chroma) components Cb and Cr represent the chromaticity or color information components. Thus, a picture in YCbCr format contains a luminance sample array of luminance sample values ​​(Y) and two chrominance sample arrays of chrominance values ​​(Cb and Cr). A picture in RGB format can be converted to YCbCr format. (convert) or conversion (transform) and vice versa, the process being a color transformation (color transformation) or color conversion (color conversion) If a picture is monochrome, it may only contain an array of luma samples. Thus, a picture may be, for example, an array of luma samples in monochrome format, or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color formats.

[0120] An embodiment of video encoder 20 may include a picture division unit (not shown in FIG. 2) configured to divide picture 17 into multiple (usually non-overlapping) picture blocks 203. These blocks may also be called root blocks, macroblocks (H.264 / AVC), or coding tree blocks (CTBs) or coding tree units (CTUs) (H.265 / HEVC and VVC). The picture division unit may be configured to use the same block size for all pictures of a video sequence and a corresponding grid that defines the block sizes, or to vary the block size among pictures or subsets or groups of pictures, and to divide each picture into corresponding blocks.

[0121] In further embodiments, the video encoder may be configured to directly receive block 203 of picture 17, e.g., one, multiple, or all of the blocks that form picture 17. Picture block 203 may also be referred to as a current picture block or a picture block to be coded.

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

[0123] An embodiment of video encoder 20 as shown in FIG. 2 may be configured to encode picture 17 block-by-block, eg, encoding and prediction is performed for each block 203.

[0124] An embodiment of video encoder 20 as shown in FIG. 2 may be further configured to divide and / or encode pictures by using slices (also referred to as video slices), where a picture may be divided into or encoded using one or more (usually non-overlapping) slices, each of which may include one or more blocks (e.g., CTUs).

[0125] 2 may be further configured to divide and / or encode a picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where a picture may be divided into or encoded using one or more (usually non-overlapping) tile groups, each of which may include, for example, one or more blocks (e.g., CTUs) or one or more tiles, and each tile may be, for example, rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., full blocks or fractional blocks.

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

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

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

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

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

[0131] The quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit transform coefficient may be truncated to an m-bit transform coefficient during quantization, where n is greater than m. The degree of quantization may be modified by adjusting a quantization parameter (QP). For example, in the case of scalar quantization, various scalings may be applied to achieve finer or coarser quantization. A smaller quantization step size corresponds to a finer quantization, while a larger quantization step size corresponds to a coarser quantization. The applicable quantization step sizes may be indicated by a quantization parameter (QP). The quantization parameter may, for example, be an index into a predefined set of applicable quantization step sizes. For example, a small quantization parameter may correspond to fine quantization (small quantization step size) and a large quantization parameter may correspond to coarse quantization (large quantization step size), or vice versa. The quantization may include a division by the quantization step size, and the corresponding inverse quantization and / or inverse inverse quantization, e.g., by the inverse quantization unit 210, may include a multiplication by the quantization step size. Some standards, e.g., embodiments according to HEVC, may be configured to use a quantization parameter to determine the quantization step size. In general, the quantization step size may be calculated based on the quantization parameter using a fixed-point approximation of an equation that includes a division. An additional scaling factor may be introduced for the quantization and inverse quantization to restore the norm of the residual block, which may be modified due to the scaling used in the fixed-point approximation of the equation for the quantization step size and the quantization parameter. In one example implementation, the scaling of the inverse transform and the inverse quantization may be combined. Alternatively, a customized quantization table may be used, e.g., signaled from the encoder to the decoder in the bitstream. Quantization is a lossy operation, and the loss increases with increasing quantization step size.

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

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

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

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

[0136] Filtering The loop filter unit 220 (or, for short, "loop filter" 220) is configured to filter the reconstructed block 215 to obtain a filtered block 221, or in general, to filter the reconstructed samples to obtain filtered samples. The loop filter unit is configured, for example, to smooth pixel transitions or otherwise improve video quality. The loop filter unit 220 may include one or more loop filters, such as a deblocking filter, a sample adaptive offset (SAO) filter, or one or more other filters, for example, a bilateral filter, an adaptive loop filter (ALF), a sharpening filter, a smoothing filter, or a collaborative filter, or any combination thereof. Although the loop filter unit 220 is illustrated in FIG. 2 as being an in-loop filter, in other configurations, the loop filter unit 220 may be implemented as a post-loop filter. The filtered block 221 may also be referred to as a filtered reconstructed block 221.

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

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

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

[0140] The mode selection unit 260 may be configured to determine or select a partitioning and prediction mode (e.g., intra or inter prediction mode) for a current block prediction mode (which does not include partitioning) and generate a corresponding prediction block 265 that is used for calculation of the residual block 205 and for reconstruction of the reconstructed block 215.

[0141] An embodiment of the mode selection unit 260 may be configured to select the partitioning and prediction mode (e.g., from those supported by or available to the mode selection unit 260) that gives the best match, i.e., in other words, the smallest residual (which means better compression for transmission or storage), or the smallest signaling overhead (which means better compression for transmission or storage), or that considers or balances both. The mode selection unit 260 may be configured to determine the partitioning and prediction mode based on rate-distortion optimization (RDO), i.e., to select the prediction mode that results in the smallest rate distortion. Terms such as “best”, “minimum”, “optimum”, etc. in this context do not necessarily refer to an overall “best”, “minimum”, “optimum”, etc., but may refer to the satisfaction of a termination or selection criterion, such as a value above or below a threshold or other constraint, potentially leading to a “suboptimal selection”, but reducing computational effort and processing time.

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

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

[0144] Split The splitting unit 262 may split (i.e., divide) the current block 203 into smaller partitions, e.g., smaller blocks of square or rectangular size. These smaller blocks (sometimes called sub-blocks) may be further split into even smaller partitions. This is also called tree splitting or hierarchical tree splitting, e.g., a root block at root tree level 0 (hierarchical level 0, depth 0) may be split recursively, e.g., into two or more blocks at the next lower tree level, e.g., nodes at tree level 1 (hierarchical level 1, depth 1), which may again be split into two or more blocks at the next lower level, e.g., tree level 2 (hierarchical level 2, depth 2), etc., until the splitting is terminated, e.g., because a termination criterion is met, e.g., a maximum tree depth or a minimum block size has been reached. Blocks that are not further split are also called leaf blocks or leaf nodes of the tree. A tree that uses a division into two partitions is called a binary tree (BT), a tree that uses a division into three partitions is called a ternary tree (TT), and a tree that uses a division into four partitions is called a quad tree (QT).

[0145] As mentioned before, the term "block" as used herein may be a portion of a picture, in particular a square or rectangular portion. For example, with reference to HEVC and VVC, a block may be or may correspond to a coding tree unit (CTU), a coding unit (CU), a prediction unit (PU), and a transform unit (TU), and / or a corresponding block, such as a coding tree block (CTB), a coding block (CB), a transform block (TB), or a prediction block (PB).

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

[0147] For example, in an embodiment according to HEVC, a coding tree unit (CTU) may be divided into CUs by using a quad-tree structure denoted as a coding tree. The decision of whether a picture area should be coded using (temporal) inter-picture prediction or (spatial) intra-picture prediction is made at the CU level. Each CU may be further divided into one, two, or four PUs according to a PU partition type. Inside one PU, the same prediction process is applied, and related information is sent to the decoder on a PU-by-PU basis. After obtaining a residual block by applying a prediction process based on a PU partition type, the CU may be divided into transform units (TUs) according to another quad-tree structure similar to the coding tree for CUs.

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

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

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

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

[0152] The intra prediction unit 254 is configured to use reconstructed samples of neighboring blocks of the same current picture to generate an intra prediction block 265 according to an intra prediction mode of the set of intra prediction modes.

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

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

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

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

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

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

[0159] The motion compensation unit may also generate syntax elements relating to the blocks and video slices for use by video decoder 30 in decoding picture blocks of the video slices. In addition to or alternatively to the slices and their respective syntax elements, tile groups and / or tiles and their respective syntax elements may be generated or used.

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

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

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

[0163] In the example of Figure 3, the decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (e.g., adder 314), a loop filter 320, a decoded picture buffer (DBP) 330, a mode application unit 360, an inter prediction unit 344, and an intra prediction unit 354. The inter prediction unit 344 may be or include a motion compensation unit. The video decoder 30, in some examples, may perform a decoding path that is generally reverse to the encoding path described with respect to the video encoder 100 from Figure 2.

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

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

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

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

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

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

[0170] Decoded Picture Buffer The decoded video blocks 321 of the picture are then stored in a decoded picture buffer 330, which stores the decoded picture 331 as a reference picture for subsequent motion compensation relative to other pictures and / or for output display, respectively.

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

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

[0173] When a video slice is coded as an intra-coded (I) slice, the intra prediction unit 354 of the mode application unit 360 is configured to generate a prediction block 365 for a picture block of the current video slice based on the signaled intra prediction mode and data from a previously decoded block of the current picture. When a video picture is coded as an inter-coded (i.e., B or P) slice, the inter prediction unit 344 (e.g., a motion compensation unit) of the mode application unit 360 is configured to produce a prediction block 365 for a video block of the current video slice based on a motion vector and other syntax elements received from the entropy decoding unit 304. In the case of inter prediction, the prediction block may be produced from one of the reference pictures in one of the reference picture lists. The video decoder 30 may construct the reference frame lists, i.e., list 0 and list 1, using a default configuration method based on the reference pictures stored in the DPB 330. The same or similar may apply to or with embodiments that use tile groups (e.g., video tile groups) and / or tiles (e.g., video tiles) in addition to or instead of slices (e.g., video slices), e.g., video may be coded using I, P, or B tile groups and / or tiles.

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

[0175] An embodiment of the video decoder 30 as shown in FIG. 3 may be configured to divide and / or decode pictures by using slices (also referred to as video slices), where a picture may be divided into or decoded using one or more (usually non-overlapping) slices, each of which may include one or more blocks (e.g., CTUs).

[0176] An embodiment of video decoder 30 as shown in FIG. 3 may be configured to divide and / or decode a picture by using tile groups (also referred to as video tile groups) and / or tiles (also referred to as video tiles), where a picture may be divided into or decoded using one or more (usually non-overlapping) tile groups, each of which may include, for example, one or more blocks (e.g., CTUs) or one or more tiles, and each tile may be, for example, rectangular in shape and may include one or more blocks (e.g., CTUs), e.g., complete blocks or fractional blocks.

[0177] Other variations of the video decoder 30 may be used to decode the encoded picture data 21. For example, the decoder 30 may produce an output video stream without a loop filtering unit 320. For example, a non-transform-based decoder 30 may directly inverse quantize the residual signal without an inverse transform processing unit 312 for some blocks or frames. In another implementation, the video decoder 30 may have the inverse quantization unit 310 and the inverse transform processing unit 312 combined into a single unit.

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

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

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

[0181] Video coding device 400 includes an ingress port 410 (or input port 410) and a receiver unit (Rx) 420 for receiving data, a processor, logic unit, or central processing unit (CPU) 430 for processing data, a transmitter unit (Tx) 440 and an egress port 450 (or output port 450) for transmitting data, and a memory 460 for storing data. Video coding device 400 may also include optical-to-electrical (OE) and electrical-to-optical (EOl) components coupled to the ingress port 410, the receiver unit 420, the transmitter unit 440, and the egress port 450 for the egress or ingress of optical or electrical signals.

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

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

[0184] FIG. 5 is a simplified block diagram of an apparatus 500 that may be used as either or both of source device 12 and destination device 14 from FIG. 1 in accordance with an example embodiment.

[0185] The processor 502 in the apparatus 500 may be a central processing unit, or may be any other type of device or devices, now existing or later developed, capable of manipulating or processing information. Although the disclosed implementations may be practiced with a single processor, e.g., processor 502, as shown, advantages in speed and efficiency may be achieved using two or more processors.

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

[0187] The apparatus 500 may also include one or more output devices, such as a display 518. The display 518, in one example, may be a touch-sensitive display that combines a display with a touch-sensitive element operable to sense touch input. The display 518 may be coupled to the processor 502 via the bus 512.

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

[0189] Intra-subpartition (ISP) coding tools divide an intra (prediction) block into multiple subpartitions and predict these subpartitions, e.g., predicting one subpartition first and then predicting subsequent subpartitions. In some situations, there may be discontinuities across subpartition boundaries that cause block artifacts.

[0190] In one example, FIG. 6 illustrates an ISP partitioning of an intra block 600 into multiple subpartitions. In this example, there are two directional partitions, namely horizontal partition 601 and vertical partition 602, and in other examples (not illustrated in FIG. 6), other partitions, such as angular directional partitions, are performed. In the example illustrated in FIG. 6, the subpartitions using the vertical partition 602 and the corresponding boundaries are labeled. Herein, the intra block 600 is partitioned into four subpartitions, namely sub0, sub1, sub2, and sub3. Three subpartition boundaries are labeled, namely subpartition boundary A between subpartitions 0 and 1, subpartition boundary B between subpartitions 1 and 2, and subpartition boundary C between subpartitions 2 and 3, and a similar definition may be used in the example of horizontal partition 601.

[0191] In one embodiment, the prediction of the sub-partitions comes from the ISP tool, and the sub-partitions may be successively decoded. For one sub-partition, a residual signal may be generated by entropy decoding the coefficients sent by the encoder, then inverse quantizing and inverse transforming them. Then the sub-partitions are intra predicted, and finally the corresponding reconstructed samples are obtained by adding the residual signal to the prediction signal. The prediction signal may basically represent the intra prediction made based on the angle mode from the upper and left reference sample lines. The residual is decoded and then added to the prediction signal to form the final prediction. These reconstructed samples are then used to predict the next sub-partition. Thus, the reconstructed values ​​of one sub-partition are available to generate the prediction of the next sub-partition, which repeats the process, and so on. All sub-partitions (sub0, sub1, sub2, sub3) share the same intra mode.

[0192] In general, two processing orders can be used for the subpartitions: normal order and reverse order. In one example, for horizontal partitions, the normal order is top to bottom and the reverse order is bottom to top. In another example, for vertical partitions, the normal order is left to right and the reverse order is right to left.

[0193] As shown in Figure 7, to reduce block artifacts caused by the ISP coding tool, the inner subpartition boundaries of the block to which ISP is applied are deblocking filtered after the horizontal partitioning of the coding block 700 into subpartitions 701 or after the vertical partitioning of the coding block 700 into subpartitions 702. Several alternative methods have been proposed to apply the deblocking filter to these subpartition boundaries.

[0194] Deblocking filtering with increased boundary strength Boundary strength (Bs) is a parameter used to control the strength of the deblocking filter. The larger the value of Bs, the more samples that are orthogonal to the boundary can be filtered. ISP prediction can lead to the problem of error propagation, i.e., prediction errors propagate in the processing order.

[0195] In one example as shown in FIG. 6, with vertical partitions of coding blocks (coding units) and a normal processing order, the samples in these subpartitions are reconstructed from left to right, i.e., sub0, sub1, sub2, and sub3. Subpartition 0 may generally have better prediction quality since its reference samples (from the left neighboring block and the upper neighboring block) have already been reconstructed. However, the left part of the reference samples of subpartition 1 is from the reconstructed subpartition 0, and thus the reference samples of subpartition 1 may not be as accurate as those of subpartition 0, resulting in more residual signals. Similarly, the reference samples of subpartition 2 are even worse than those of subpartition 1, and the prediction error propagates in the processing order.

[0196] A method is proposed in which the boundary strength increases in the processing order: when a boundary between two subpartitions (e.g., boundary A, B, C in Fig. 6) is closer to the neighboring block, Bs for this boundary is set to a smaller value since the boundary has less error; when a boundary is farther from the neighboring block, Bs for this boundary is set to a larger value since the boundary has more error due to error propagation.

[0197] In one example, as shown in FIG. 6, when vertical partitioning and normal (left-to-right) processing order is performed on a block, Bs of subpartition boundary A is set to 0, Bs of subpartition boundary B is set to 1, and Bs of subpartition boundary C is set to 2.

[0198] In one example, as shown in FIG. 6, when vertical partitioning and reverse (right-to-left) processing order is performed on a block, Bs of subpartition boundary A is set to 2, Bs of subpartition boundary B is set to 1, and Bs of subpartition boundary C is set to 0.

[0199] In another example, a similar process is performed for the horizontal partitions.

[0200] Deblocking filter processing based on Coded Block Flags (CBF) In one example, each subpartition is predicted and reconstructed separately, and each subpartition may have different residual (difference between original signal and predicted signal) information. In particular, after quantization, a coded block flag (CBF) is used to indicate whether a block or subpartition has residual data. In general, a block with a CBF equal to 1 (i.e., there is residual data after quantization) has more distortion than a block with a CBF equal to 0 (i.e., there is no residual data after quantization). This embodiment applies a deblocking filter to the boundary between two subpartitions based on the CBF flags of the two adjacent subpartitions.

[0201] In one example, if each of the two subpartitions of the subpartition boundary has a CBF flag value equal to 0, then the deblocking filter is not applied; otherwise (if at least one of the two subpartitions of the subpartition boundary has a CBF flag value equal to 1), then the deblocking filter is applied and the Bs value of the subpartition boundary is set to 1. Taking the example in FIG. 6, if each of subpartitions 0 and 1 have a CBF flag equal to 0, then the deblocking filter is not applied for subpartition boundary A. If at least subpartitions 0 and 1 have CBF flags equal to 1, then the deblocking filter is applied for subpartition boundary A with Bs set to 1.

[0202] In one example, if the two subpartitions of the subpartition boundary each have a CBF flag value equal to 0, then the deblocking filter is not applied; otherwise (if at least one of the two subpartitions of the subpartition boundary has a CBF flag value equal to 1), then the Bs value of the subpartition boundary is set to 2 and the deblocking filter is applied. Taking the example in FIG. 6, if subpartitions 0 and 1 each have a CBF flag equal to 0, then the deblocking filter is not applied to subpartition A. If at least subpartitions 0 and 1 have CBF flags equal to 1, then Bs is set to 2 and the deblocking filter is applied to subpartition boundary A.

[0203] Set uniform boundary strength for subpartition boundaries In one example, a constant boundary strength (Bs) is set to 1 for all sub-partition boundaries A, B, and C shown in FIG.

[0204] In another example, a constant boundary strength (Bs) is set to 2 for all sub-partition boundaries A, B, and C shown in FIG.

[0205] According to another example, after the horizontal partitioning of the coding block 800 into subpartitions 801 or after the vertical partitioning of the coding block 800 into subpartitions 802, only the subpartition boundaries that overlap with the 8×8 sample grid are deblocked, and the rest of the subpartition edges are not deblocked, as shown in Figure 8. This has the advantage of reduced computational complexity, since only a small fraction of the edges are deblocked.

[0206] Another alternative is shown in Figure 9. In this case, after the horizontal partitioning of the coding block 900 into subpartitions 901 or after the vertical partitioning of the coding block 900 into subpartitions 902, all subpartition boundaries that overlap the 4x4 sample grid are deblocked.

[0207] A position coordinator is defined as (x,y), where x represents how many samples horizontally away from the top-left sample of the entire frame, and y represents how many samples vertically away from the top-left sample of the entire frame. The coordinator for the top-left sample of the entire frame is (0,0).

[0208] In one example, an 8×8 sample grid may start at location (x,y), where x%8==0. The operation % denotes modular arithmetic, defined as the remainder of x divided by 8.

[0209] In one example, an 8x8 sample grid may start at location (x,y), where x%8==4. The operation % denotes modular arithmetic, defined as the remainder of x divided by 8.

[0210] In one example, an 8×8 sample grid may start at location (x,y), where y %8==0. The operation % denotes modular arithmetic, defined as the remainder of y divided by 8.

[0211] In one example, an 8x8 sample grid may start at location (x,y), where y%8==4. The operation % denotes modular arithmetic, defined as the remainder of y divided by 8.

[0212] Handling smaller blocks The application of ISP may result in subpartitions that are 4 samples in height or width. In the example in FIG. 6 using vertical partitions, when W is 16 samples, each subpartition is 4 samples in width. In this case, subpartitions 1031 and 1032 are shown in FIG. 1033 A weak filter may be used that only modifies up to one sample 10314 or 10331 along the subpartition boundary 1032 between the neighboring block 1010 and the current block 1030. In the example shown in FIG. 10, for example, filtering is performed within each row of subpartitions 1031, 1033 that are perpendicular to and adjacent to the subpartition boundary 1032 between subpartition 1031 and subpartition 1033. As shown in FIG. 10, a weak filter may be used that only modifies up to one sample 1108 or 10311 along the edge 1020 between the neighboring block 1010 and the current block 1030. In another example shown in FIG. 10, for example, filtering is performed within each row of subpartition 1031 or neighboring block 1010 that are perpendicular to and adjacent to the edge 1020 between the neighboring block 1010 and the subpartition 1031 of block 1030. Otherwise (if the height / width of the subpartition orthogonal to the subpartition boundary is greater than 4 samples), a regular VVC JVET-L1001 version 13 (http: / / phenix.it-sudparis.eu / jvet / doc_end_user / current_document.php?id=4834) deblocking filter (e.g., the deblocking filter disclosed in the VVC document above) may be used.

[0213] In another embodiment, for any one of the above embodiments and examples, when the subpartition boundaries are not aligned with the 8x8 grid, the deblocking filter is not applied.

[0214] The detailed definition of the intra-subpartition related aspects of the proposed method are given as follows in the format of the VVC draft specification (parts 7.3.9.5 and 7.4.10.5):

[0215] [Table 1]

[0216] 7.4.10.5 Coding unit semantics 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 sub-partitions. intra_subpartitions_mode_flag[x0][y0] equal to 0 specifies that the current intra coding unit is not partitioned into rectangular transform block sub-partitions.

[0217] When intra_subpartitions_mode_flag[x0][y0] is not present, it is inferred to be equal to 0.

[0218] intra_subpartitions_split_flag[x0][y0] specifies whether the intra subpartition split type is horizontal or vertical. When intra_subpartitions_split_flag[x0][y0] is not present, it is inferred as follows: If cbHeight is greater than MaxTbSizeY, intra_subpartitions_split_flag[x0][y0] is inferred to be equal to 0. Otherwise (cbWidth is greater than MaxTbSizeY), intra_subpartitions_split_flag[x0][y0] is inferred to be equal to 1.

[0219] The variable IntraSubPartitionsSplitType specifies the type of split used for the current luma coding block, as shown in Table 13. IntraSubPartitionsSplitType is derived as follows: If intra_subpartitions_mode_flag[x0][y0] is equal to 0, then IntraSubPartitionsSplitType is set equal to 0. Otherwise, IntraSubPartitionsSplitType is set equal to 1 + intra_subpartitions_split_flag[x0][y0].

[0220] [Table 2]

[0221] The variable NumIntraSubPartitions specifies the number of transform block sub-partitions into which an intra-luma coding block is divided. NumIntraSubPartitions is derived as follows: If IntraSubPartitionsSplitType is equal to ISP_NO_SPLIT, then NumIntraSubPartitions is set equal to 1. Otherwise, if one of the following conditions is true, then NumIntraSubPartitions is set equal to 2: cbWidth equals 4 and cbHeight equals 8. cbWidth equals 8 and cbHeight equals 4. Otherwise, NumIntraSubPartitions is set equal to 4.

[0222] 11 is a flowchart of a deblocking method for deblocking a subpartition boundary in a coding block in image encoding and / or decoding, where a current coding block is coded in an intra prediction mode, the current coding block is divided into subpartitions including a first subpartition and a second subpartition adjacent to the first subpartition, and the second subpartition is intra predicted based on the first subpartition. Further details of the method are described above, for example, with respect to FIGS. 6 to 10.

[0223] In step 1101, when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples, or when the height of the first subpartition is 4 samples or the height of the second subpartition is 4 samples, determine a first maximum filter length for the first subpartition to be 1 and / or determine a second maximum filter length for the second subpartition to be 1; Steps 1102 modifying values ​​of up to one sample of the first subpartition, the up to one sample being taken from a row or column of the first subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; and / or Steps 1103 modifying values ​​of up to one sample of the second subpartition, where the up to one sample is taken from a row or column of the second subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition.

[0224] Based on the above, the present disclosure enables modifying a small number of sample values ​​at sub-partition boundaries, and thus the method can reduce block artifacts that may be caused by sub-partition boundaries within a block to which an ISP is applied, thus improving coding efficiency.

[0225] 12 is a flowchart of a deblocking method for deblocking block edges between image blocks in image encoding and / or decoding, the block edges including edges between a current sub-partition of a current coding block and neighboring blocks of the current coding block, the current coding block being coded in an intra-prediction mode, and the current coding block being divided into sub-partitions. Further details of the method are described above, for example with respect to FIGS. 6 to 10.

[0226] In step 1201, when the width of the current subpartition is 4 samples or the height of the current subpartition is 4 samples, determine that the third maximum filter length for the current subpartition is 1 and / or the fourth maximum filter length for the neighboring block is 1; In step 1202, modifying values ​​of up to one sample of the current subpartition, the up to one sample being taken from a row or column of the current subpartition that is perpendicular to and adjacent to an edge between the current subpartition and the neighboring block; and / or In step 1203, the value of up to one sample of the neighboring block is modified, where the up to one sample is taken from a row or column of the neighboring block that is perpendicular to and adjacent to the edge between the current sub-partition and the neighboring block.

[0227] Based on the above, the present disclosure enables modifying a small number of sample values ​​at sub-partition boundaries, and thus the method can reduce block artifacts that may be caused by sub-partition boundaries within the block to which the ISP is applied, while avoiding to some extent duplication of filtering between block edges and sub-partition boundaries, thus improving coding efficiency.

[0228] 13 is a block diagram illustrating an example device 1300 for deblocking sub-partition boundaries in a coding block according to the techniques described in this disclosure (further details are described below, for example, based on FIGS. 2 and 3 and 6-10). A device for use in an image encoder and / or decoder for deblocking sub-partition boundaries in a coding block, where a current coding block is coded in an intra-prediction mode, the current coding block is divided into sub-partitions including a first sub-partition and a second sub-partition adjacent to the first sub-partition, and in one example, the second sub-partition is intra-predicted based on the first sub-partition, and the device 1300: determining a first maximum filter length for the first subpartition to be 1 and / or a second maximum filter length for the second subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples or the height of the first subpartition is 4 samples or the height of the second subpartition is 4 samples; modifying values ​​of up to one sample of the first subpartition, the up to one sample being taken from a row or column of the first subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; and / or modifying values ​​of up to one sample of the second subpartition, the up to one sample being taken from a row or column of the second subpartition that is perpendicular to and adjacent to a subpartition boundary between the first subpartition and the second subpartition; The signal processing device 1300 includes a deblocking filter 1310 configured to perform the following steps:

[0229] 14 is a block diagram illustrating an example device 1400 for deblocking block edges according to the techniques described in this disclosure (further details are described below, for example, based on FIGS. 2 and 3 and 6-10). The device may be for use in an image encoder and / or decoder, the device including: a block edge between a current sub-partition of a current coding block and a neighboring block of the current coding block; the current coding block is coded in an intra-prediction mode; the current coding block is divided into sub-partitions; The device 1400 is determining a third maximum filter length for the current subpartition to be 1 and / or a fourth maximum filter length for the neighboring blocks to be 1 when the width of the current subpartition is 4 samples or the height of the current subpartition is 4 samples; modifying values ​​of up to one sample of the current sub-partition, the up to one sample being taken from a row or column of the current sub-partition that is perpendicular to and adjacent to an edge between the current sub-partition and a neighboring block; and / or modifying values ​​of up to one sample of the neighboring block, the up to one sample being taken from a row or column of the neighboring block that is perpendicular to and adjacent to an edge between the current subpartition and the neighboring block; The signal processing device 1400 includes a deblocking filter 1410 configured to perform the following steps:

[0230] FIG. 15 is a flow chart of a method of coding implemented in a decoding device or an encoding device.

[0231] In step 1501, a reconstructed block of a current coding block belonging to a current picture is generated, the current coding block is coded in an intra prediction mode, the current coding block is divided into a subpartition including a first subpartition and a second subpartition, and the second subpartition is intra predicted based on the first subpartition.

[0232] In step 1502, filtering is performed on the reconstructed picture of the current picture, and filtering on the reconstructed picture of the current picture includes filtering up to one sample in a current subpartition of a reconstructed subpartition of the reconstructed block when the height of the current subpartition is four samples or when the width of the current subpartition is four samples, where one sample is located in a row or column of the current subpartition that is orthogonal to a boundary between the current subpartition and another subpartition that is located adjacent to the current subpartition, and one sample is adjacent to the boundary.

[0233] In some implementations of this embodiment, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, when the height of the current subpartition is four samples, the value of one sample obtained from a column of the current subpartition that is perpendicular to and adjacent to the boundary between the current subpartition and another subpartition below or above the current subpartition is modified.

[0234] In some implementations of this embodiment, when the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, when the width of the current subpartition is four samples, the value of one sample obtained from a row of the current subpartition that is perpendicular to and adjacent to the boundary between the current subpartition and another subpartition to the left or right of the current subpartition is modified.

[0235] In some implementations of this embodiment, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, the boundary between the current subpartition and the other subpartition that is disposed adjacent to the current subpartition is a horizontal subpartition boundary; or If the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, then the boundary between the current subpartition and another subpartition that is disposed adjacent to the current subpartition is a vertical subpartition boundary.

[0236] In some implementations of this embodiment, when an intra subpartitioning type for dividing the current coding block into subpartitions is vertical, a first subpartition is to the left of a second subpartition, and the second subpartition is intra predicted based on the reconstructed value of the first subpartition; If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the first subpartition is above the second subpartition, and the second subpartition is intra predicted based on the reconstructed values ​​of the first subpartition.

[0237] In some implementations of this embodiment, the current subpartition is a reconfigured version of the first subpartition or a reconfigured version of the second subpartition.

[0238] In some implementations of this embodiment, the number of sub-partitions is two or four.

[0239] In some implementations of this embodiment, if the coding block width is equal to 4 and the coding block height is equal to 8, and / or if the coding block width is equal to 8 and the coding block height is equal to 4, the number of subpartitions is 2; Otherwise, the number of subpartitions is 4.

[0240] In a further possible implementation of this embodiment, filtering of up to one sample in the current subpartition is performed only if the boundary between the current subpartition and other subpartitions overlaps with the n×n sample grid of the reconstructed block, where n is an integer, for example, n=4 or n=8. Thereby, the computation load can be further reduced.

[0241] In a further possible implementation of this embodiment, Filter up to one sample in the current subpartition only if all of the subpartitions are four samples high or four samples wide, which can further reduce the computational load of the overall coding process.

[0242] In detail, the subpartitions are rectangular transform block subpartitions. When the ISP is divided, each subpartition is a transform block.

[0243] In this disclosure, coding blocks are coded using the intra-subpartition ISP tool.

[0244] In a further possible implementation of this embodiment, if the intra subpartitioning type for dividing the current coding block into subpartitions is vertical, the order of intra predicting the subpartitions is from left to right or from right to left (e.g., the division of the prediction block into subpartitions may be performed in the vertical direction), or If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the order of intra predicting the subpartitions is top-to-bottom or bottom-to-top (division of the prediction block into subpartitions may be performed in the horizontal direction).

[0245] In particular, the current subpartition is a reconstructed version (i.e., a reconstructed value) of the first subpartition or a reconstructed version (i.e., a reconstructed value) of the second subpartition. For example, the number of subpartitions may be two or four.

[0246] The coding block may be coded using an intra-subpartition ISP tool. The ISP coding tool is applied only to coding blocks with intra prediction. The division of the coding block / intra prediction block may result in 1D subpartitions, i.e. lines of subpartitions. If the method is used in image coding, the generation of the reconstructed block is based on the following process flow (as it is known in the art): calculation of a residual block based on a current block (i.e., an original block) and an intra prediction block, transforming and quantizing the residual coefficients of the residual block, inverse quantization and inverse transformation to obtain a reconstructed residual block (see also the detailed description below). The reconstructed block is obtained based on the reconstructed residual block and the prediction block. If the method is used in image decoding, the generation of the reconstructed block is based on the following process flow (as it is known in the art): calculation of a residual block based on information contained in a received bitstream, transforming and quantizing the residual coefficients of the residual block, inverse quantization and inverse transformation to obtain a reconstructed residual block (see also the detailed description below). The reconstructed block is obtained based on the reconstructed residual block and the prediction block. Furthermore, the reconstructed picture of the current image including the current block is input into the filtering process in the block-based image coding scheme by filtering up to one sample, and boundary filtering is intended, including modifying up to one sample adjacent to the block boundary. This kind of deblocking decision may be based on only three samples (adjacent in the same row in case of filtering the boundary between vertical subpartitions, or adjacent in the same column in case of filtering the boundary between horizontal subpartitions) (see also the detailed description above).

[0247] In general, the boundary strengths of all boundaries between sub-partitions of a coding block may be set to a constant value (eg, 2) indicating the strength of the filtering process to simplify the overall processing.

[0248] The weak filtering (down to 1 sample) employed according to the invention makes it possible to reduce block artifacts in small blocks without the need for unnecessarily large computational load and memory resources.

[0249] FIG. 16 is a flow chart of another method of coding implemented in a decoding device or an encoding device.

[0250] In step 1601, a reconstructed block of a current coding block belonging to a current picture is generated, the current coding block is coded in an intra prediction mode, the current coding block is divided into a subpartition including a first subpartition and a second subpartition, and the second subpartition is intra predicted based on the first subpartition.

[0251] Steps 1602 In the method, performing a filtering operation on a reconstructed picture of a current picture, the filtering operation on the reconstructed picture of the current picture includes filtering a boundary between a current subpartition of a reconstructed block and a neighboring block adjacent to the current subpartition (i.e., a neighboring block of the current block) based on a maximum filter length of the current subpartition and a maximum filter length of the neighboring block, wherein when a height of the current subpartition is 4 samples or a width of the current subpartition is 4 samples, the maximum filter length of the current subpartition and the maximum filter length of the neighboring block are 1.

[0252] In one example, step 1203 includes: modifying one sample value of the current subpartition adjacent to the boundary based on a maximum filter length MA of the current subpartition; and modifying sample values ​​of neighboring blocks adjacent to the boundary based on a maximum filter length MB of the neighboring blocks.

[0253] MA=1, MB=1.

[0254] In detail, step 1203 includes the steps of: modifying at most MA sample values ​​of the current sub-partition, where at most MA samples are in a line that is perpendicular to the boundary and adjacent to the boundary, where MA=1; The step of modifying the sample values ​​of the neighboring blocks adjacent to the boundary based on the maximum filter length MB includes: The method includes modifying at most MB sample values ​​of a neighboring block, where at most MB samples are in adjacent lines perpendicular to the boundary, and where MB=1.

[0255] Here, the maximum filter length of the current subpartition refers to the number of samples that are allowed to be modified in the filtering process for the current subpartition, and the maximum filter length of the neighboring blocks refers to the number of samples that are allowed to be modified in the filtering process for the neighboring blocks.

[0256] In some implementations of this embodiment, the first sub-partition is intra predicted based on another reconstructed block that is located adjacent to the coding block.

[0257] In a further possible implementation of this embodiment, filtering is performed only if the boundary overlaps with an n×n sample grid of the reconstructed block, where n is an integer, e.g., n is 4 or 8.

[0258] In some implementations of this embodiment, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, when the height of the current subpartition is four samples, the value of one sample obtained from a column of the current subpartition that is perpendicular to and adjacent to the boundary between the current subpartition and the neighboring block below or above the current subpartition is modified.

[0259] In some implementations of this embodiment, when the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, when the width of the current subpartition is four samples, the value of one sample obtained from a row of the current subpartition that is perpendicular to and adjacent to the boundary between the current subpartition and the neighboring block to the left or right of the current subpartition is modified.

[0260] In some implementations of this embodiment, if the intra-subpartitioning type for dividing the current coding block into subpartitions is horizontal, the boundary between the current subpartition and the neighboring block adjacent to the current subpartition is a horizontal boundary; or If the intra-subpartitioning type for dividing the current coding block into subpartitions is vertical, the boundary between the current subpartition and the neighboring block that is disposed adjacent to the current subpartition is a vertical boundary.

[0261] In some implementations of this embodiment, when an intra subpartitioning type for dividing the current coding block into subpartitions is vertical, a first subpartition is to the left of a second subpartition, and the second subpartition is intra predicted based on the reconstructed value of the first subpartition; If the intra subpartitioning type for dividing the current coding block into subpartitions is horizontal, the first subpartition is above the second subpartition, and the second subpartition is intra predicted based on the reconstructed values ​​of the first subpartition.

[0262] In detail, the number of subpartitions is 2 or 4. When the number of subpartitions is 2, there is a first subpartition and a second subpartition inside the current block correspondingly, and the current subpartition may be a reconstructed version of the first subpartition or a reconstructed version of the second subpartition.

[0263] When the number of subpartitions is four, there are correspondingly a first subpartition, a second subpartition, a third subpartition and a fourth subpartition inside the current block, and the current subpartition may be a reconstructed version of the first subpartition or a reconstructed version of the fourth subpartition.

[0264] It can be understood that the first subpartition, the second subpartition, the third subpartition, and the fourth subpartition are simply used differently for the subpartitions. In some cases, the height of all of the subpartitions is 4 samples, or the width of all of the subpartitions is 4 samples.

[0265] In a further possible implementation of this embodiment, if the coding block width is equal to 4 and the coding block height is equal to 8, and / or if the coding block width is equal to 8 and the coding block height is equal to 4, the number of subpartitions is 2; Otherwise, the number of subpartitions is 4.

[0266] In a further possible implementation of this embodiment, filtering is performed only if the boundary overlaps with an n×n sample grid of the reconstructed block, where n is an integer, e.g., n is 4 or 8.

[0267] In particular, the sub-partitions are rectangular transform block sub-partitions.

[0268] In this disclosure, coding blocks are coded using the intra-subpartition ISP tool.

[0269] FIG. 17 is a block diagram illustrating an example device 1700 according to the techniques described in this disclosure (further details are described below based on, for example, FIGS. 6-10 and 15). The device is intended for use in an image encoder and / or image decoder. In one example, the device 1700 may correspond to the encoder in FIG. 2. In another example, the device 1700 may correspond to the decoder in FIG. 3. The device may: A reconstruction unit 1701 configured to generate a reconstructed block of a current coding block belonging to a current picture, where the current coding block is coded in an intra prediction mode, and the current coding block is divided into a sub-partition including a first sub-partition and a second sub-partition, and the second sub-partition is intra predicted based on the first sub-partition; A filter processing unit 1730 configured to perform filtering on a reconstructed picture of a current picture, the filter processing unit 1730 being particularly configured to filter up to one sample in a current subpartition of a reconstructed subpartition of a reconstructed block when the height of the current subpartition is four samples or when the width of the current subpartition is four samples, where one sample is located in a row or column of the current subpartition that is orthogonal to a boundary between the current subpartition and another subpartition that is located adjacent to the current subpartition, and one sample is adjacent to the boundary.

[0270] FIG. 18 is a block diagram illustrating an example device 1800 in accordance with the techniques described in this disclosure (further details are described below, for example, based on FIGS. 6-10 and 16). The device is intended for use in an image encoder and / or image decoder. In one example, the device 1800 may correspond to the encoder in FIG. 2. In another example, the device 1800 may correspond to the decoder in FIG. 3. The device may: a reconstruction unit 1810 configured to generate a reconstructed block of a current coding block belonging to a current picture, where the current coding block is coded in an intra prediction mode, and the current coding block is divided into a sub-partition including a first sub-partition and a second sub-partition, and the second sub-partition is intra predicted based on the first sub-partition; and a filter processing unit 1830 configured to perform filtering on a reconstructed picture of a current picture, the filter processing unit 1830 being specifically configured to filter a boundary between a current subpartition of a reconstructed block and a neighboring block adjacent to the current subpartition based on a maximum filter length of the current subpartition and a maximum filter length of the neighboring block, wherein when the height of the current subpartition is 4 samples or when the width of the current subpartition is 4 samples, the maximum filter length of each of the current subpartition and the neighboring block is 1.

[0271] Based on the above, the present disclosure enables modifying a small number of sample values ​​at sub-partition boundaries, and thus the method can reduce block artifacts that may be caused by sub-partition boundaries within the block to which the ISP is applied, while avoiding to some extent duplication of filtering between block edges and sub-partition boundaries, thus improving coding efficiency.

[0272] The following is a description of application examples of the encoding method and the decoding method as shown in the above embodiments and the system using them.

[0273] FIG. 17 is a block diagram illustrating an example device 1700 according to the techniques described in this disclosure (further details are described below based on, for example, FIGS. 6-10 and 15). The device is intended for use in an image encoder and / or image decoder. In one example, the device 1700 may correspond to the encoder in FIG. 2. In another example, the device 1700 may correspond to the decoder in FIG. 3. The device may: a reconstruction unit configured to generate a reconstructed block of a current coding block belonging to a current picture; 1710A reconstruction unit 1701, in which a current coding block is coded in an intra prediction mode, the current coding block is divided into sub-partitions including a first sub-partition and a second sub-partition, and the second sub-partition is intra predicted based on the first sub-partition; A filter processing unit 1730 configured to perform filtering on a reconstructed picture of a current picture, the filter processing unit 1730 being particularly configured to filter up to one sample in a current subpartition of a reconstructed subpartition of a reconstructed block when the height of the current subpartition is four samples or when the width of the current subpartition is four samples, where one sample is located in a row or column of the current subpartition that is orthogonal to a boundary between the current subpartition and another subpartition that is located adjacent to the current subpartition, and one sample is adjacent to the boundary.

[0274] The capture device 3102 may generate data and encode the data by the encoding method as shown in the above embodiment. Alternatively, the capture device 3102 may deliver the data to a streaming server (not shown), which encodes the data and transmits the encoded data to the terminal device 3106. The capture device 3102 includes, but is not limited to, a camera, a smartphone or pad, a computer or laptop, a video conferencing system, a PDA, an in-vehicle device, or any combination thereof. For example, the capture device 3102 may include a source device 12 as described above. When the data includes video, a video encoder 20 included in the capture device 3102 may actually perform the video encoding process. When the data includes audio (i.e., voice), an audio encoder included in the capture device 3102 may actually perform the audio encoding process. For some practical scenarios, the capture device 3102 delivers the encoded video and audio data by multiplexing them together. For other practical scenarios, for example, in a video conferencing system, the encoded audio data and the encoded video data are not multiplexed. The capture device 3102 delivers the encoded audio data and the encoded video data separately to the terminal device 3106 .

[0275] In the content supply system 3100, the terminal device 310 receives and plays the encoded data. The terminal device 3106 may be a device having data receiving and restoring capabilities, such as a smartphone or pad 3108, a computer or laptop 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a TV 3114, a set-top box (STB) 3116, a video conferencing system 3118, a video surveillance system 3120, a personal digital assistant (PDA) 3122, an in-vehicle device 3124, or any combination thereof, capable of decoding the above-mentioned encoded data. For example, the terminal device 3106 may include a destination device 14 as described above. When the encoded data includes video, the video decoder 30 included in the terminal device is prioritized to perform video decoding. When the encoded data includes audio, the audio decoder included in the terminal device is prioritized to perform audio decoding processing.

[0276] In the case of a terminal device having a display, for example, a smartphone or pad 3108, a computer or laptop 3110, a network video recorder (NVR) / digital video recorder (DVR) 3112, a TV 3114, a personal digital assistant (PDA) 3122, or an in-vehicle device 3124, the terminal device can provide the decoded data to its display. In the case of a terminal device not equipped with a display, for example, an STB 3116, a video conferencing system 3118, or a video surveillance system 3120, an external display 3126 is brought into contact with them to receive and display the decoded data.

[0277] When each device in the system performs encoding or decoding, a picture encoding device or a picture decoding device as shown in the above embodiments may be used.

[0278] 20 is a diagram showing the structure of an example of a terminal device 3106. After the terminal device 3106 receives a stream from the capture device 3102, a protocol progression unit 3202 analyzes the transmission protocol of the stream. The protocol includes, but is not limited to, Real Time Streaming Protocol (RTSP), Hypertext Transfer Protocol (HTTP), HTTP Live Streaming Protocol (HLS), MPEG-DASH, Real Time Transport Protocol (RTP), Real Time Messaging Protocol (RTMP), or any kind of combination thereof.

[0279] After the protocol proceeding unit 3202 processes the stream, a stream file is generated. The file is output to the demultiplexing unit 3204. The demultiplexing unit 3204 can separate the multiplexed data into encoded audio data and encoded video data. As described above, in some practical scenarios, for example, in a video conferencing system, the encoded audio data and encoded video data are not multiplexed. In this situation, the encoded data is sent to the video decoder 3206 and the audio decoder 3208 without passing through the demultiplexing unit 3204.

[0280] Through the demultiplexing process, a video elementary stream (ES), an audio ES, and optionally a subtitle are generated. The video decoder 3206, including the video decoder 30 as described in the above embodiment, decodes the video ES by the decoding method as shown in the above embodiment to generate a video frame, and supplies this data to the synchronization unit 3212. The audio decoder 3208 decodes the audio ES to generate an audio frame, and supplies this data to the synchronization unit 3212. Alternatively, the video frame may be stored in a buffer (not shown in Figure Y) before supplying it to the synchronization unit 3212. Similarly, the audio frame may be stored in a buffer (not shown in Figure Y) before supplying it to the synchronization unit 3212.

[0281] The synchronization unit 3212 synchronizes video and audio frames and provides the video / audio to a video / audio display 3214. For example, the synchronization unit 3212 synchronizes the presentation of video and audio information, which may be coded in the syntax using timestamps related to the presentation of the coded audio and visual data, as well as timestamps related to the delivery of the data stream itself.

[0282] If subtitles are included in the stream, the subtitle decoder 3210 decodes the subtitles, synchronizes them with the video and audio frames, and provides the video / audio / subtitles to the video / audio / subtitle display 3216 .

[0283] The present invention is not limited to the above-mentioned system, and any of the picture encoding devices or picture decoding devices in the above-mentioned embodiments may be incorporated into other systems, for example, automobile systems.

[0284] The present invention has been described herein with various embodiments. However, other variations to the disclosed embodiments can be understood and effected by those skilled in the art from a study of the drawings, the disclosure, and the appended claims, when practicing the claimed invention. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite article "a" or "an" does not exclude a plurality. A single processor or other unit may perform the functions of several items recited in the claims. The mere fact that several measures are usually recited in different dependent claims does not indicate that a combination of these measures cannot be used to advantage. The computer program may be stored / distributed in a suitable medium, such as an optical storage medium or a solid-state medium, provided together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless communication systems.

[0285] Those skilled in the art will appreciate that the "blocks" ("units") of the various figures (method and apparatus) represent or describe functions of embodiments of the invention (rather than necessarily separate "units" in hardware or software) and thus equally describe functions or features of apparatus embodiments and method embodiments (units = steps).

[0286] The term "unit" is used merely to illustrate the functionality of an encoder / decoder embodiment and is not intended to limit the present disclosure.

[0287] In some embodiments provided in the present application, it should be understood that the disclosed system, device, and method may be implemented in other ways. For example, the device embodiment described is only exemplary. For example, the unit division is only a logical functional division, and there may be other divisions in actual implementation. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the shown or described mutual couplings or direct couplings or communication connections may be implemented by using some interfaces. Indirect couplings or communication connections between devices or units may be implemented in electronic, mechanical, or other forms.

[0288] The units described as separate parts may or may not be physically separate, and the parts shown as units may or may not be physical units, and may be located in one location or distributed over multiple network units. Some or all of the units may be selected according to the actual needs to achieve the objectives of the solution of the present embodiment.

[0289] In addition, the functional units in embodiments of the present invention may be integrated into one processing unit, or each of the units may exist physically alone, or two or more units may be integrated into one unit.

[0290] Embodiments of the present invention may further include apparatus, e.g., encoders and / or decoders, including processing circuitry configured to perform any of the methods and / or processes described herein.

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

[0292] For example, the embodiments of the encoder 20 and the decoder 30, and the functions described herein with reference to the encoder 20 and the decoder 30, may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on a computer-readable medium or transmitted over a communication medium as one or more instructions or codes and executed by a hardware-based processing unit. The computer-readable medium may include a computer-readable storage medium, which corresponds to a tangible medium, such as a data storage medium, or a communication medium, which includes any medium that facilitates the transfer of a computer program from one place to another, for example, according to a communication protocol. In this manner, the computer-readable medium may generally correspond to (1) a tangible computer-readable storage medium that is non-transitory, or (2) a communication medium, such as a signal or carrier wave. The 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, code, and / or data structures for implementation of the techniques described in this disclosure. The computer program product may include a computer-readable medium.

[0293] 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 may be used to store desired program code in the form of instructions or data structures and that may be accessed by a computer. Also, any connection is properly referred to as a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included within the definition of the medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but instead cover non-transitory tangible storage media. As used herein, disk (disk) and disk (disc) Compact Disc (disc) (CD), Laser Disc (registered trademark )(disc) ,optical disk (disc) , Digital Versatile Disc (disc) (DVD), Floppy disk (disk) , and Blu-ray (registered trademark) disc (disc) Wherein the disk (disk) The disk usually reproduces data magnetically. (disc) uses a laser to optically reproduce the data. Combinations of the above should also be included within the scope of computer-readable media.

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

[0295] The techniques of the present 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 highlight functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by various hardware units. Rather, as described above, the various units may be combined in a codec hardware unit or may be provided by a collection of interoperable hardware units including one or more processors as described above, along with suitable software and / or firmware. [Explanation of symbols]

[0296] 10 Coding Systems 12 Source Device 13 Communication Channels 14 Destination Device 16 Picture Source 17 Pictures, 18 Preprocessors 19 Preprocessed Picture Data 20 Encoder 21 Encoded Picture Data 22 Communication Interface 28 Communication Interface 30 Decoder, Video Decoder 31 Decoded Pictures 32 Post Processor 33 Post-Processed Picture Data 34 Display Devices 46 Processing circuit configuration 201 Input 203 Picture Block 204 Residual Calculation Unit 205 Residual Blocks 206 Conversion Processing Unit 207 Conversion Factors 208 Quantization Units 209 Quantized Coefficients 210 Inverse Quantization Unit 211 Dequantized Coefficients 212 Inverse Transformation Processing Unit 213 Reconstructed Residual Blocks 214 Reconstruction Unit 215 Reconstructed Blocks 220 Loop Filter Unit 221 Filtered Blocks 230 Decoded Picture Buffer (DPB) 231 Decoded Pictures 244 Inter Prediction Units 254 intra prediction units 260 Mode Selection Unit 262 Split Unit 265 predicted blocks 266 Syntax Elements 270 Entropy Coding Unit 272 Output 304 Entropy Decoding Unit 309 Quantized Coefficients 310 Inverse Quantization Unit 311 Dequantized Coefficients 312 Inverse Transformation Processing Unit 313 Reconstruction Residual Block 314 Reconstruction Unit 315 Reconstructed Blocks 320 Loop Filter 321 Filtered Blocks 330 Decoded Picture Buffer (DBP) 331 Decoded Pictures 344 Inter Prediction Units 354 intra prediction units 360 mode application unit 365 predicted blocks 400 Video Coding Device 410 Input Port 420 Receiver Unit (Rx) 430 Processor 440 Transmitter Unit (Tx) 450 output ports 460 Memory 470 Coding Module 500 devices 502 processor 504 Memory 506 Data 508 Operating Systems 510 Application Program 512 Bus 518 Display 600 Intrablock 601 Horizontal Partition 602 Vertical Partition 700 coding blocks 701, 702 subpartitions 800 coding blocks 801, 802 subpartitions 900 coding blocks 901, 902 subpartitions 1010 Neighborhood Blocks 1020 Edge 1030 Current Block 1031 subpartitions 1032 subpartition boundaries 1033 subpartitions 1108 Sample 1300 devices 1310 Deblocking Filter 1400 devices 1410 Deblocking Filter 1700 devices 1701 Reconstruction Unit 1730 Filter Processing Unit 1800 devices 1810 Reconstruction Unit 1830 Filter Processing Unit 3100 Contents Supply System 3102 Capture Device 3104 Communication Links 3106 Terminal Device 3108 Smartphones, Pads 3110 Computers, laptops 3112 Network Video Recorder (NVR) / Digital Video Recorder (DVR) 3114 TV 3116 Set-top box (STB) 3118 Video Conference System 3120 Video Surveillance System 3122 Personal digital assistant (PDA) 3124 In-vehicle devices 3126 Display 3202 Protocol Progression Unit 3204 Demultiplexing Unit 3206 Video Decoder 3208 Audio Decoder 3210 Subtitle Decoder 3212 Synchronous Unit 3214 Video / Audio Display 3216 Video / Audio / Subtitle Display 10311, 10314, 10331 Samples

Claims

1. A device, comprising: one or more processors; and a computer-readable storage medium coupled to the one or more processors and storing programming instructions, the one or more processors configured to execute the programming instructions to cause the device to perform an operation for deblocking a sub-partition boundary in a coding block during an image encoding or decoding process, the coding block being coded in an intra-prediction mode, the coding block being divided into sub-partitions including a first sub-partition and a second sub-partition, the first sub-partition being horizontally adjacent to the second sub-partition; The operation includes: determining a first maximum filter length for the first subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples; modifying values ​​of up to one sample of the first subpartition based on the first maximum filter length, wherein the values ​​of the up to one sample are taken from a row of the first subpartition that is perpendicular to the subpartition boundary between the first subpartition and the second subpartition, and the up to one sample is adjacent to the subpartition boundary between the first subpartition and the second subpartition. device.

2. 2. The device of claim 1, wherein an intra-subpartitioning type for dividing the coding block into subpartitions is vertical, and the subpartition boundary between the first subpartition and the second subpartition is a vertical subpartition boundary.

3. 2. The device of claim 1, wherein an intra subpartitioning type for dividing the coding block into subpartitions is vertical, the first subpartition is to the left of the second subpartition, and the second subpartition is intra predicted based on reconstructed values ​​of the first subpartition.

4. The device of claim 1 , wherein the number of sub-partitions in the coding block is two or four.

5. if the width of the coding block is equal to 4 and the height of the coding block is equal to 8, or if the width of the coding block is equal to 8 and the height of the coding block is equal to 4, the number of sub-partitions in the coding block is 2; Otherwise, the number of subpartitions is 4.

2. The device of claim 1.

6. 2. The device of claim 1, wherein values ​​of the up to one sample in the first subpartition are modified only if the subpartition boundary between the first subpartition and the second subpartition overlaps with a 4x4 sample grid.

7. The device of claim 1 , wherein the samples of the sub-partition are luma samples.

8. The device of claim 1 , wherein the sub-partitions are rectangular transform block sub-partitions.

9. 2. The device of claim 1, wherein an order for intra predicting the subpartitions is from left to right and an intra subpartitioning type for dividing the coding block into subpartitions is vertical.

10. 10. The device of claim 1, wherein the coding block is coded using an intra-subpartition (ISP) tool or the subpartition boundaries are caused by an intra-subpartition (ISP) tool.

11. 1. A method for deblocking a sub-partition boundary in a coding block during an image encoding or decoding process, the coding block being coded in an intra prediction mode, the coding block being divided into sub-partitions including a first sub-partition and a second sub-partition, the first sub-partition being horizontally adjacent to the second sub-partition; The method comprises: determining a first maximum filter length for the first subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples; modifying values ​​of up to one sample of the first subpartition based on the first maximum filter length, wherein the values ​​of the up to one sample are taken from a row of the first subpartition that is perpendicular to the subpartition boundary between the first subpartition and the second subpartition, and the up to one sample is adjacent to the subpartition boundary between the first subpartition and the second subpartition. method.

12. The method of claim 11 , wherein an intra-subpartitioning type for dividing the coding block into subpartitions is vertical, and the subpartition boundary between the first subpartition and the second subpartition is a vertical subpartition boundary.

13. 12. The method of claim 11, wherein an intra subpartitioning type for dividing the coding block into subpartitions is vertical, the first subpartition is to the left of the second subpartition, and the second subpartition is intra predicted based on reconstructed values ​​of the first subpartition.

14. The method of claim 11 , wherein the number of sub-partitions in the coding block is two or four.

15. if the width of the coding block is equal to 4 and the height of the coding block is equal to 8, or if the width of the coding block is equal to 8 and the height of the coding block is equal to 4, the number of sub-partitions in the coding block is 2; Otherwise, the number of subpartitions is 4. The method of claim 11.

16. 12. The method of claim 11, wherein values ​​of the up to one sample in the first subpartition are modified only if the subpartition boundary between the first subpartition and the second subpartition overlaps with a 4x4 sample grid.

17. The method of claim 11 , wherein the samples of the sub-partition are luma samples.

18. The method of claim 11 , wherein the sub-partitions are rectangular transform block sub-partitions.

19. The method of claim 11 , wherein an order of intra predicting the subpartitions is from left to right and an intra subpartitioning type for dividing the coding block into subpartitions is vertical.

20. 20. The method of claim 11, wherein the coding block is coded using an intra-subpartition (ISP) tool or the subpartition boundaries are caused by an intra-subpartition (ISP) tool.

21. 1. A computer-readable storage medium carrying programming instructions, which when executed by a computing device, cause the computing device to perform an operation for deblocking a sub-partition boundary in a coding block in an image encoding or decoding process, the coding block being coded in an intra-prediction mode, the coding block being divided into sub-partitions including a first sub-partition and a second sub-partition, the first sub-partition being horizontally adjacent to the second sub-partition, The operation includes: determining a first maximum filter length for the first subpartition to be 1 when the width of the first subpartition is 4 samples or the width of the second subpartition is 4 samples; modifying values ​​of up to one sample of the first subpartition based on the first maximum filter length, wherein the values ​​of the up to one sample are taken from a row of the first subpartition that is perpendicular to the subpartition boundary between the first subpartition and the second subpartition, and the up to one sample is adjacent to the subpartition boundary between the first subpartition and the second subpartition. A computer-readable storage medium.

Citation Information

Patent Citations

  • Determining a low-complexity deblocking filter

    JP2014526818A

  • Low complex deblocking filter decisions

    US20140185689A1