RU2785090C2 - Device and method for removal of blocking artifacts - Google Patents

Abstract

FIELD: image processing.

SUBSTANCE: no more than MA values of samples of the first image block, adjacent to a block edge, are modified, and no more than MB values of samples of the second image block, adjacent to a block edge, are modified; or no more than MA values of samples of the second image block, adjacent to the block edge, are modified, and no more than MB values of samples of the first encoding block, adjacent to a block edge, are modified, wherein MA≠MB.

EFFECT: creation of an effective and precise filter for removal of blocking artifacts of an image encoding device.

49 cl, 5 tbl, 20 dwg

Description

The field of technology to which the invention belongs

Embodiments of the present invention relate to the field of image processing, such as still image and/or video coding. In particular, embodiments of the invention disclose an improved deblocking filter.

State of the art

A wide range of digital imaging applications use image coding (encoding and decoding), such as digital television applications, video transmission over the Internet and mobile networks, real-time conversational applications such as video chat, video conferencing, DVD and Blu-ray discs, systems collecting and editing video content and for security cameras.

In 1990, after the block hybrid approach to video coding was developed in the H.261 standard, new video coding methods and tools were developed, which formed the basis of new video coding standards. One of the goals of most video coding standards was to reduce the bit rate compared to its predecessor without compromising image quality. Additional video coding standards include MPEG-1 video, MPEG-2 video, ITU-T H.262/MPEG-2, ITU-T H.263, ITU-T H.264/MPEG-4 Part 10 Advanced Video Coding (AVC), ITU-T H.265, High Efficiency Video Coding (HEVC), ITU-T H.266/Versatile Video Coding (VVC), and extensions such as scalability and/or 3D extensions to these standards.

Common to block image coding schemes is that edge artifacts can appear along the edges of the blocks. These artifacts arise from independent coding of coding blocks. These edge artifacts are often easily visible to the user. The goal of block image coding is to reduce edge artifacts below a visibility threshold. This technical problem is solved by deblocking filtering. Such deblocking filtering is performed on the one hand on the decoding side to remove visible edge artifacts, but also on the encoding side to prevent edge artifacts from appearing in the image during encoding. In particular, for an image block (such as a transform unit (TU), a prediction unit (PU), a coding unit (CU)) that uses sub-block tools, deblocking filtering may be a difficult task.

Disclosure of the essence of the invention

In view of the above technical problem, embodiments of the present invention aim to improve conventional deblocking filtering. Embodiments of the present invention provide a deblocking filter apparatus, an encoder, a decoder, and related methods that can perform deblocking filtering with reduced processing time. In addition, deblocking must be efficient and accurate.

Embodiments of the invention are defined by the features of the independent claims and additional useful implementations of the embodiments are defined by the features of the dependent claims.

Specific embodiments are set forth in the appended independent claims and other embodiments are suggested in the dependent claims.

According to a first aspect of the invention, a deblocking filter device is provided. The deblocking filter device is intended for use in an image encoder and/or an image decoder. The deblocking filter device comprises:

an edge localization unit configured to determine edges between blocks, wherein the edges between blocks comprise a block edge (e.g., a CU edge or a CU boundary or a TU boundary) between a first P coding block and a second Q coding block and a subblock edge between subblocks of the first P coding block or a second Q coding block (i.e., the first P coding block or the second Q coding block has subblocks, or the first P coding block or the second Q coding block use subblock tools), in which the first P coding block has a size of M × N samples, or N × M samples, the second Q coding block has a block size of L × T samples or T × L samples (the block size of either of the two coding blocks can also be represented as W * H, where W and H indicate the width and height of the corresponding coding block ), for example, N or T is an even integer 2 ⁿ (i.e. an integer power of two to which n is an integer) and greater than a threshold value (i.e., the value e 8 or 16, etc.);

a deblocking determination unit configured to determine whether a block edge between the first P coding block and the second Q coding block should be filtered by applying a first filter (i.e., a longer tap filter or an asymmetric filter or an asymmetric tap filter or an asymmetric long filter); and

a deblocking filter unit configured to apply a first filter (i.e., a longer tap filter, or an asymmetric filter, or an asymmetric tap filter, or an asymmetric long filter) to sample values near a block edge between the first P coding block and the second Q coding block when it is determined that the block edge between the first P coding block and the second Q coding block is to be filtered by applying a first filter in which no more than the number MA of sample values of the first coding block perpendicular to and adjacent to the block edge per line are modified, and not modified more than the number of MB sample values of the second coding block, perpendicular and adjacent to the edge of the block per line; or at most the number MA of sample values of the second coding block adjacent to a block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to a block edge per line is modified, MA ≠ MB , in particular, MA < MB, e.g. , MA < MB = 7. For example, MA = 3 and MB = 7; or MA = 4 and MB = 7; or MA = 5 and MB = 7, etc. It can be understood that the value of MA or MB depends on the value of N or T.

If the second image block Q is the current block that has subblocks or uses subblock tools, and the first P image block is a neighboring block of the current block, respectively, in the second coding block, for each row of input samples that are perpendicular and adjacent to the edge of the block, the no more than the number of MA samples to generate output filtered samples; in the first coding block, for each row of input samples that are perpendicular and adjacent to the edge of the block, at most MB samples are modified to generate output filtered samples. In the example, N or T is an even integer 2 ⁿ greater than 8, M or L is an even integer 2 ⁿ greater than 2 (for example, M or L can have the following values 4, 8, 16 or 32,…), M is different from N or M is the same as N; or L is different from T, or L is the same as T; M × N, in which N > 8 applies to horizontal edges, and N × M, in which N > 8, applies to vertical edges. In another example, N or T is an even integer ²ⁿ greater than 16, M×N where N>16 is used for horizontal edges, and N×M where N>16 is used for vertical edges.

Next, a description will be given of the difference between a block edge and sub-block edges. A sub-block edge is an edge that is internal to a block that uses sub-block tools that include sub-block tools such as Affine or advanced temporal motion vector prediction (ATMVP), and a block edge (that is, a coding block edge (CU ) or coding block edge or CU boundary) is an edge shared between two coding blocks or two coding blocks or two transform blocks. Subblock tools may also include tools such as internal subpartition (ISP) and subblock transform (SBT) tools.

It should be noted that the present invention uses the term "block", "coding block" or "picture block", which can be used for transform units (TUs), prediction units (PUs), coding units (CUs), and so on. In VVC, usually, transform blocks and encoding blocks are mostly aligned, with the exception of a few scenarios where TU tile or sub-block transform (SBT) is used. It can be understood that in the present invention, the terms "block/image block/coding block/transformation block" and "block size/transformation block size" can be interchanged with each other. In the present invention, the terms "sample/pixel" are used interchangeably.

The invention applies to both vertical and horizontal edges. For vertical edges, the width of the first or second coding block is checked, namely whether the width is greater than 8 samples (eg 16 or 32). For horizontal edges, the height of the first or second coding block is checked to see if the height is greater than 8 samples (eg, 16 or 32). For vertical edges, the block width is taken into account, only for blocks with a width >= 16 or a width > 16, a longer tap filter is applied (namely, a long filter). For horizontal edges, the block height is taken into account, only for blocks with a height >= 16 or a height > 16, a longer drain filter (namely, a long filter) is applied.

It should be noted that the first filter (i.e., longer tap filter or asymmetric filter or asymmetric tap filter or asymmetric long filter) is a filter that uses the fetch DA to make a filtering decision on one side of the block edge and uses the fetch DB to filter decisions on the other side of the block edge, and MB samples are updated on one side of the block edge (CU edge or TU edge), while MA samples are updated on the other side of the block edge (CU edge or TU edge), in which the MA ≠ MB, in particular MA < MB, e.g. MA < MB = 7, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. In general, DA = MA + 1 and DB = MB + 1. The first filter can be an asymmetric filter that modifies a different number of samples on each side of the block edge (eg CU edge or TU edge).

This allows the two sides of the box edge to be treated differently, and therefore, the method can prevent overlap filtering between the box edge and the sub-box edge, and thus can ensure that deblocking can be performed in parallel. Thus, the processing time for deblocking filtering is greatly reduced.

It should be noted that the filter device may include a processor configured to perform filtering and modification. In addition, it can also guarantee the ability to perform deblocking in parallel, especially the edges between blocks in which any of the blocks use subblock tools.

In a possible form of implementation of the device according to the first aspect as such, in which, within the first coding block, there is a subblock edge between subblocks, and within the second coding block, there is a subblock edge between subblocks (i.e., the coding block and the second coding block have subblocks), the deletion determination block the blockiness is further configured to determine whether there is a block edge between the first coding block and the second coding block to be filtered by applying a second filter (eg, HEVC strong filter); and

the deblocking filter unit is further configured to apply a second filter (e.g., HEVC strong filter) to sample values near a block edge when it is determined that the block edge between the first coding block and the second coding block is to be filtered by applying the second filter (e.g., HEVC strong filter) in which the number MA' of sample values of the first coding block adjacent to the block edge is modified, and the number MB' of sample values of the second coding block adjacent to the block edge is modified, MA' = MB', for example, MA'= MB ' < 7, e.g. MA'= MB' = 3 or MA'= MB' = 5.

It should be noted that the second filter may be a HEVC strong filter that modifies MA' samples (eg 3) on one side of the block edge (CU edge) and modifies MB' samples (eg 3) on the other side of the block edge (CU edge). ). In another example, the second filter is a strong filter that can modify at most three samples on either side of the edge. In HEVC, two filters are defined as a deblocking filter: a regular filter and a strong filter. The normal filter modifies no more than two samples on either side of the edge. The strong filter performs three additional checks between samples along the edge.

In a possible form of implementation of the device according to the first aspect as such, in which, if there is no subblock edge between subblocks inside the second coding block, but a subblock edge between subblocks is inside the first coding block (i.e., when the first coding block has subblocks), not more than the number MA of sample values of the first coding block adjacent to the block edge per line, and modified by at most the number MB of sample values of the second coding block adjacent to the edge of the block per line, for example, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7;

or

if there is no subblock edge between subblocks inside the first coding block, but if there is a subblock edge between subblocks inside the second coding block (that is, when the second coding block has subblocks), no more than the number MA of sample values of the second coding block adjacent to the block edge are modified row, and at most the number of MBs of sample values of the first coding block adjacent to a block edge per row is modified, e.g., MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7.

In an exemplary embodiment of an apparatus according to any prior implementation of the first aspect, or the first aspect as such, the deblocking determination unit is further configured to determine whether a block edge between the first coding block and the second coding block should be filtered by applying the first filter (i.e. longer bypass filter or asymmetric filter or asymmetric bypass filter or asymmetric long filter) on the base

- no more than the number DA of sample values of the first coding block adjacent to the edge of the block as the decision values of the first filter, and

- no more than the number DB of sample values of the second coding block adjacent to the edge of the block as decision values of the second filter.

In general, DA = MA + 1 and DB = MB + 1. If MA = 3 and MB = 3, DA = DB = 4; or, if MA = 7 and MB = 7, DA = DB = 8; or, if MA = 3 and MB = 7, DA = 4, DB = 8; or, if MA = 4 and MB = 7, DA = 5, DB = 8; or, if MA = 5 and MB = 7, DA = 6, DB = 8.

This allows you to very accurately and in parallel determine which edges are actually deblocked and which edges are not deblocked.

In an exemplary embodiment of an apparatus according to any prior implementation of the first aspect, or the first aspect as such, if there is a subblock edge between subblocks within the second Q coding block (i.e., if the second Q coding block has subblocks), the deblocking determination unit is configured to determine whether the first condition defined by the following first equation is satisfied:

in which β denotes the threshold parameter and q _i represent the sample values of the second Q coding block, i = 0,1,2,3 and p _j represent the sample values of the first P coding block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5.

A new filtering condition is proposed. This greatly reduces the amount of line memory required to store the pixel values of the preceding coding blocks needed to perform deblocking at the edge of the coding block.

In an exemplary embodiment of an apparatus according to any prior implementation of the first aspect, or the first aspect as such, if there is a subblock edge between subblocks within the first P coding block (i.e., if the first P coding block has subblocks), the deblocking determination unit is configured to determine , whether the second condition defined by the following second equation is satisfied:

where β denotes the threshold parameter and p _i represents the sample values of the first P coding block, i = 0,1,2,3 and q _j represent the sample values of the second Q coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

A new filtering condition is proposed. This greatly reduces the amount of line memory required to store the pixel values of the preceding coding blocks needed to perform deblocking at the edge of the coding blocks.

In an exemplary embodiment of the apparatus according to any prior implementation of the first aspect, or the first aspect per se, the threshold parameter β is determined based on the quantization parameter, QP, associated with the quantization step size of the plurality of samples, or

the threshold parameter β is determined based on the quantization parameter, QP, using a look-up table.

выборки первой выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края (505) между первым блоком изображения P и вторым блоком изображения Q (503a, 503b) выборок на основании следующего уравнения:In a possible form of implementation of the apparatus according to any prior implementation of the first aspect, or the first aspect as such, in the absence of a subblock edge between subblocks within the first P coding block, and in the presence of a subblock edge between subblocks within the second Q coding block (i.e., the first P coding block has no subblocks and the second Q coding block has subblocks), the deblocking filter block is configured to determine the filtered value

samples the first sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge (505) between the first image block P and the second image block Q (503a, 503b) samples based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

New filter coefficients are proposed. This allows two kinds of filter coefficients to be used, containing HEVC strong filter coefficients and asymmetric longer tap filter coefficients.

выборки второй выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края (505) между первым блоком изображения P и вторым блоком изображения Q (503a, 503b) выборок на основании следующего уравнения:In a possible form of implementation of the apparatus according to any prior implementation of the first aspect, or the first aspect as such, in the absence of a subblock edge between subblocks within the first P coding block, and in the presence of a subblock edge between subblocks within the second Q coding block (i.e., the first P coding block has no subblocks and the second Q coding block has subblocks) the deblocking filter block is configured to determine the filtered value

samples the second sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge (505) between the first image block P and the second image block Q (503a, 503b) samples based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

New filter coefficients are proposed. This allows two kinds of filter coefficients to be used, containing HEVC strong filter coefficients and asymmetric longer tap filter coefficients.

выборки третьей выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края (505) между первым блоком изображения P и вторым блоком изображения Q (503a, 503b) выборок на основании следующего уравнения:In an exemplary form of implementation of the arrangement according to any prior implementation of the first aspect, or the first aspect as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block (i.e., the first P coding block has no subblocks and the second Q coding block has subblocks) the deblocking filter block is configured to determine the filtered value

samples the third sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge (505) between the first image block P and the second image block Q (503a, 503b) samples based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

New filter coefficients are proposed. This allows two kinds of filter coefficients to be used, containing HEVC strong filter coefficients and asymmetric longer tap filter coefficients.

выборки соответствующей выборки текущей строки или столбца выборок слева или вверху вертикального или горизонтального края (505) между первым блоком изображения P и вторым блоком изображения Q (503a, 503b) выборок на основании следующего уравнения:In a possible form of implementation of the apparatus according to any prior implementation of the first aspect, or the first aspect as such, in the absence of a subblock edge between subblocks within the first P coding block, and in the presence of a subblock edge between subblocks within the second Q coding block (i.e., the first P coding block has no subblocks and the second Q coding block has subblocks) the deblocking filter block is configured to determine the filtered value

samples the corresponding sample of the current row or column of samples to the left or top of the vertical or horizontal edge (505) between the first image block P and the second image block Q (503a, 503b) samples based on the following equation:

,

,

,

,

,

,

,

,

,

,

,

,

,

,

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

This allows the use of new asymmetric longer tap filter coefficients.

According to a second aspect, a deblocking filter device is provided. The deblocking filter device is intended for use in an image encoder and/or an image decoder. The deblocking filter device comprises:

an edge localization unit configured to determine edges between blocks, wherein the edges between blocks comprise a block edge between a first P coding block and a second Q coding block and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block (i.e., the first The P coding block or the second Q coding block has sub-blocks, or the first P coding block or the second Q coding block uses sub-block tools), in which the first P coding block has a block size of M × N or N × M, the second Q coding block has a size block L × T or T × L, for example, N or T is an even integer 2 ⁿ that exceeds the threshold value (eg, 8 or 16, etc.);

a deblocking determination unit, configured to determine whether a block edge between the first P coding block and the second Q coding block should be filtered by applying the first filter (i.e., a longer tap filter, or an asymmetric filter, or an asymmetric tap filter, or an asymmetric long filter) and

a deblocking filtering unit configured to apply a third filter to sample values near a block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is not to be filtered by applying the first a filter that modifies at most the number MA of sample values of the first coding block adjacent to the block edge per line, and modifies at most the number MB of sample values of the second coding block adjacent to the edge of the block per line, MA = MB < 7, for example MA = MB = 4.

In one example, N or T are even integers 2 ⁿ greater than 8, M or L are even integers 2 ⁿ greater than 2; M is different from N or M is the same as N; or L is different from T, or L is the same as T;

In one example, the third filter may be a strong HEVC filter that can modify a maximum of four samples on either side of a block edge (CU edge). In other words, the third filter may be a HEVC strong filter in which a maximum of four samples are modified on one side of the block edge (CU edge), while a maximum of four samples are modified on the other side of the block edge (CU edge).

This allows a small number of sample values to be modified on two sides of a box edge, and therefore, this method can prevent overlap filtering between a box edge and a sub-box edge to a certain extent, and thus can ensure that deblocking can be performed in parallel. Thus, the processing time for deblocking filtering can be shortened.

According to a third aspect of the invention, a deblocking filter device is provided. The deblocking filter device is intended for use in an image encoder and/or an image decoder. The deblocking filter device comprises:

an edge localization unit configured to determine edges between blocks, wherein the edges between blocks comprise a block edge between a first P coding block and a second Q coding block and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block (i.e., the first P coding block or the second Q coding block has sub-blocks), in which the first P coding block has a block size of M × N or N × M, the second Q coding block has a block size of L × T or T × L, for example, N or T is an even integer 2 ⁿ greater than a threshold value (eg, 8 or 16, etc.);

a deblocking determination unit, configured to determine a subblock edge between subblocks (inside) of the first P coding block or the second Q coding block that is not to be filtered; in other words, determine a sub-block edge between sub-blocks (within) the first P coding block or the second Q coding block that is not subject to deblocking y; and

a deblocking filter unit configured to apply a fourth filter (a normal longer tap filter) to the sample values near the block edge between the first P coding block and the second Q coding block, in which the number MA of sample values of the first coding block adjacent to the block edge is modified , and the number MB of sample values of the second coding block adjacent to the edge of the block, MA = MB, is modified, for example, MA = MB = 7.

In the example, N or T is an even integer 2 ⁿ greater than 8, M or is an even integer 2 ⁿ greater than 2; M is different from N or M is the same as N; or L is different from T, or L is the same as T.

In one example, the fourth filter may be a normal longer tap filter that can modify up to 7 samples on either side of a block edge (eg, CU edge or CU border).

This makes it possible not to perform sub-block edge deblocking processing between sub-blocks (within) the first P coding block or the second Q coding block, and therefore the method can prevent overlap filtering between the block edge and the sub-block edge, thus it can be ensured that deblocking can run in parallel. Thus, the processing time for deblocking filtering is greatly reduced.

According to a fourth aspect of the invention, a video encoding device is provided. A video encoding device (100) for encoding an image of a video stream, in which the video encoding device (100) comprises:

block (114) restoration, made with the ability to restore the image; and

a filter device (120), as previously described, for processing the reconstructed image into a filtered reconstructed image.

This allows for very efficient and accurate encoding of the image.

According to a fifth aspect of the invention, a video decoding apparatus is provided. A video decoding device (200) for decoding an image of an encoded video stream (303), in which the video decoding device (200) comprises:

block (214) recovery, made with the ability to restore the image; and

a loop filter device (220), as previously described, for processing the reconstructed image into a filtered reconstructed image.

This allows the image to be decoded particularly accurately and efficiently.

According to a sixth aspect, the invention relates to a deblocking method for use in image encoding and/or image decoding, wherein the method comprises:

an inter-block edge definition, wherein the inter-block edges comprise a block edge between a first P coding block and a second Q coding block and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block (e.g., the first P coding block or the second Q coding block has subblocks, or the first P coding block or the second Q coding block has subblock tools), in which the first P coding block has a block size of M × N samples or N × M samples, the second Q coding block has a block size of L × T samples or T × L samples, for example, in which N or T is an even integer 2 ⁿ greater than a threshold value (eg, 8, 16, or so on);

determining whether the block edge between the first P coding block and the second Q coding block should be filtered by applying a first filter (i.e., a longer tap filter or asymmetric filter or an asymmetric tap filter or an asymmetric long filter), in other words, determining, whether a block edge between the first P coding block and the second Q coding block is subject to deblocking processing by applying the first filter (ie, a longer tap filter or an asymmetric filter or an asymmetric tap filter); and

applying a first filter (i.e., a longer tap filter, or an asymmetric filter, or an asymmetric tap filter, or an asymmetric long filter) to the sample values near the block edge between the first P coding block and the second Q coding block, when it is determined that the block edge is between the first The P coding block and the second Q coding block shall be filtered by applying a first filter that modifies no more than the number MA of sample values of the first coding block adjacent to a block edge per line, and modifies no more than the number MB of sample values of the second coding block adjacent to block edge per line; or at most the number MA of sample values of the second coding block adjacent to a block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to a block edge per line is modified, MA ≠ MB, in particular, MA < MB, e.g. , MA <MB = 7. For example, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7, etc.

In the example, N or T is an even 2 ⁿ integer greater than 8 (for example, N or T is 16 or 32,…), M or L is an even 2 ⁿ integer greater than 2 (for example, M or L is 4, 8 , 16 or 32,…); M is different from N or M is the same as N; or L is different from T, or L is the same as T.

In another example, N or T is an even ²ⁿ integer greater than 16 (e.g., N or T is 32 or 64,…), M or L is an even ²ⁿ integer greater than 2 (e.g., M or L is 4, 8, 16. or 32,…), M is different from N or M is the same as N; or L is different from T, or L is the same as T; M × N, in which N > 16 applies to horizontal edges, and N × M, in which N > 16, applies to vertical edges.

In the example, the first filter (i.e., a longer tap filter, or an asymmetric filter, or an asymmetric tap filter) is a filter that uses a fetch DB to make a filter decision on one side of the block edge, and uses a fetch DA to make a filter decision on the other. side of the block edge, and MB samples are modified on said one side of the block edge (CU edge or TU edge), while MA samples are modified on said other side of the block edge (CU edge or TU edge), MA ≠ MB, in particular, MA < MB, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. The first filter can be an asymmetric filter that modifies a different number of samples on either side of the block edge (for example, CU edge or TU edge).

This provides particularly accurate and efficient deblocking processing. In particular, this allows the two sides of a block edge to be treated differently, and hence the method avoids overlap filtering between a block edge and a sub-block edge, thus it can be guaranteed that deblocking can be performed in parallel. Thus, the processing time for deblocking filtering is greatly reduced.

In a possible form of implementing the method according to the sixth aspect as such, if there is a subblock edge between subblocks within the first coding block, and if there is a subblock edge between subblocks within the second coding block (for example, the first P coding block and the second Q coding block have subblocks or the first P the coding block and the second Q coding block have sub-block tools).

The method further comprises:

determining whether a block edge between the first coding block and the second coding block should be filtered by applying the second filter; and

applying a second filter to sample values adjacent to a block edge when it is determined that a block edge between the first coding block and the second coding block is to be filtered by applying a second filter that modifies the number MA' of sample values of the first coding block adjacent to the block edge, and the number MB' of sample values of the second coding block adjacent to the edge of the block is modified, MA'=MB', for example, MA'=MB'=3, or MA'=MB'=5.

In an exemplary implementation form of the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, in the absence of a subblock edge between subblocks within the second coding block (e.g., the first P coding block has subblocks while the second Q coding block has no subblocks), the not more than the number of MA sample values of the first coding block adjacent to the block edge per line, and modified by at most the number of MB sample values of the second coding block adjacent to the block edge per line, MA = 3 and MB = 7 or MA = 4 and MB = 7, MA=5 and MB=7;

or

if there is no subblock edge between subblocks within the first coding block (e.g., the second Q coding block has subblocks while the first P coding block has no subblocks), no more than the number MA of sample values of the second coding block adjacent to the block edge per line is modified , and at most the number of MBs of samples of the first coding block adjacent to the block edge per line, MA = 3 and MB = 7, or MA = 4 and MB = 7, MA = 5 and MB = 7, is modified.

In an exemplary form of implementation of the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, it is determined whether a block edge between the first coding block and the second coding block is to be filtered by applying a first filter based on

- no more than the number DA of sample values of the first coding block adjacent to the edge of the block as first filtering decision values, and

- no more than the number DB of sample values of the second coding block adjacent to the edge of the block as second filtering decision values.

In an exemplary form of implementation of the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, if there is a subblock edge between subblocks within the second Q coding block (e.g., the second Q coding block has subblocks), it is determined whether the first condition defined by the following first equation is satisfied:

in which β denotes the threshold parameter and q _i represents the sample values of the second Q coding block, i = 0,1,2,3 and p _j represents the sample values of the first P coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

In an exemplary form of implementation of the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, if there is a subblock edge between subblocks within the first P coding block (e.g., the first P coding block has subblocks), it is determined whether the second condition defined by the following second equation is satisfied :

in which β denotes the threshold parameter and p _i represents the sample values of the first P coding block, i = 0,1,2,3 and q _j represents the sample values of the second Q coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

In an exemplary form of implementing the method according to any prior implementation of the sixth aspect, or the sixth aspect per se, wherein the threshold value parameter β is determined based on the quantization parameter, QP, associated with the quantization step size of the plurality of samples, or

the threshold parameter β is determined based on the quantization parameter, QP, using a look-up table.

выборки первой выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края между между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:In an exemplary form of implementing the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, wherein, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block (e.g., the first P block coding block has no subblocks, and the second Q coding block has subblocks), the filtered value is determined

samples of the first sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between between the first P coding block and the second Q sample coding block based on the following equation:

;

;

or,

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

выборки второй выборки текущей строки или столбца выборок для правого или нижнего вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:In an exemplary form of implementing the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block (e.g., the P coding block has no subblocks and Q coding block has subblocks), the filtered value is determined

samples of the second sample of the current row or column of samples for the right or bottom vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

выборки третьей выборки текущей строки или столбца выборок для правого или нижнего вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:In an exemplary form of implementing the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block (e.g., the P coding block has no subblocks and Q coding block has subblocks), the filtered value is determined

samples of the third sample of the current row or column of samples for the right or bottom vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

выборки соответствующей выборки текущей строки или столбца выборок для левого или верхнего вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:In an exemplary form of implementing the method according to any prior implementation of the sixth aspect, or the sixth aspect as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block (e.g., the P coding block has no subblocks and Q coding block has subblocks), the filtered value is determined

samples of the corresponding sample of the current row or column of samples for the left or top vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

,

,

,

,

,

,

,

,

,

,

,

,

,

,

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In a possible implementation form of the method according to any previous implementation of the sixth aspect, or the sixth aspect as such, if N and T are even integers 2 ⁿ greater than 16, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7.

According to a seventh aspect, the invention relates to a method for deblocking a block edge between a first P coding block and a second Q image coding block for image encoding and/or image decoding,

in which the first P coding block has size M * N or N * M, the second Q coding block has size L * T or T * L, for example, N or T is an even integer 2 ⁿ greater than 8, in particular, N or T is an even integer ²ⁿ greater than 16, and if there is a subblock edge between subblocks of the first coding block or the second coding block (i.e., the first coding block or the second coding block has subblocks), wherein the method comprises:

in case there is a subblock edge between subblocks of the first codingblock (i.e. the first codingblock has subblocks or the first codingblock uses the tools of a subblock in which the first codingblock is the current block),

- modifying no more than MA number of sample values of the first coding block adjacent to the edge of the block as output sample values of the first filter; and

- modifying no more than the number of MB of sample values of the second coding block adjacent to the edge of the block, as the output values of the samples of the second filter; where MA ≠ MB, in particular MA < MB, e.g. MA < MB = 7, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7, etc. .d.;

or,

in case a sub-block edge is between sub-blocks of the second coding block (i.e., the second coding block has sub-blocks, or the second coding block uses the tools of a sub-block in which the second coding block is the current block),

- modifying no more than MA number of sample values of the second coding block adjacent to the edge of the block as output sample values of the first filter; and

- modifying (1404) no more than the number MB of sample values of the first coding block (902, 1302) adjacent to the edge of the block as the output sample values of the second filter, in which MA ≠ MB, in particular? MA < MB, e.g. MA < MB = 7, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7, etc.

This provides particularly accurate and efficient deblocking. In particular, different processing methods are provided for two sides of a block edge, and therefore, the method enables overlap filtering between a block edge and a sub-block edge to be performed, and thus parallel deblocking processing is provided. Thus, the processing time for deblocking filtering is greatly reduced.

According to an eighth aspect, the invention relates to a deblocking method for use in image encoding and/or image decoding, wherein the method comprises:

an inter-block edge definition, wherein the inter-block edges comprise a block edge between a first P coding block and a second Q coding block, and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block, wherein the first P coding block has a size of M×N or N × M, the second Q coding block has a size of L × T or T × L;

determining whether a block edge between the first P coding block and the second Q coding block is to be filtered by applying the first filter (ie, longer tap filter or asymmetric filter or asymmetric tap filter or asymmetric long filter); and

applying a third filter to the sample values near the block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is not to be filtered by applying a first filter in which at most a number is modified MA sample values of the first coding block adjacent to the block edge per line, and modified by at most the number MB of sample values of the second coding block adjacent to the block edge per line, MA = MB, e.g., MA = MB < 7, e.g., MA = MB = 4.

In one example, N or T is an even integer 2 ⁿ greater than 8, in particular, N or T is an even integer 2 ⁿ greater than 16, M or L is an even integer 2 ⁿ greater than 2; M is different from N or M is the same as N; or L is different from T, or L is the same as T.

In the example, the first filter (i.e. longer tap filter or asymmetric filter or asymmetric tap filter or asymmetric long filter) is a filter that uses the fetch DB to make a filtering decision on one side of the block edge and uses the fetch DA to filter decision is made on the other side of the block edge, and MB samples are modified on said one side of the block edge (CU edge or TU edge), while MA samples are modified on said other side of the block edge (CU edge or TU edge), MA ≠ MB, in particular MA < MB, e.g. MA < MB = 7, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7.

In one example, the third filter may be a HEVC strong filter that can modify a maximum of four samples on either side of a block edge (CU edge or TU edge). In other words, the third filter could be a HEVC strong filter in which a maximum of four samples on one side of the block edge (CU edge or TU edge) are modified, while a maximum of four samples on the other side of the block edge (CU edge or TU edge) are modified. .

This provides particularly accurate and efficient deblocking.

According to a ninth aspect, the invention relates to a deblocking method for use in image encoding and/or image decoding, wherein the method comprises:

an inter-block edge definition, wherein the inter-block edges comprise a block edge between a first P coding block and a second Q coding block, and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block, wherein the first P coding block has a size of M×N or N × M, the second Q coding block has a size of L × T or T × L;

determining that a subblock edge between subblocks of the first P coding block or the second Q coding block is not to be filtered (eg, determining that deblocking of the subblock edge between subblocks of the first P coding block or the second Q coding block is disabled); and

applying a fourth filter (a standard longer tap filter) to the sample values near the block edge between the first P coding block and the second Q coding block, in which the number MA of sample values of the first coding block adjacent to the edge of the block is modified, and the number MB of sample values of the second is modified of the coding block adjacent to the edge of the block, MA = MB, for example MA = MB = 7.

In one example, N or T is an even integer 2 ⁿ greater than 8, in particular, N or T is an even integer 2 ⁿ greater than 16, M or L is an even integer 2 ⁿ greater than 2; M is different from N or M is the same as N; or L is different from T, or L is the same as T.

In one example, the fourth filter may be a normal longer tap filter that can modify up to 7 samples on either side of a block edge (eg, CU edge or CU boundary).

This provides particularly accurate and efficient deblocking.

According to a tenth aspect, the invention relates to an encoding method for encoding an image, comprising the previously or later described deblocking method according to any implementation of any aspect or any aspect as such.

This allows for very efficient and accurate encoding of the image.

According to an eleventh aspect, the invention relates to a decoding method for decoding an image, comprising the previously or later described deblocking method according to any implementation of any aspect or any aspect as such. This allows for very efficient and accurate image decoding.

According to a twelfth aspect of the invention, a deblocking filter apparatus is provided. The deblocking filter device is intended for use in an image encoder and/or an image decoder. The deblocking filter device comprises:

an edge localization unit configured to determine inter-block edges, wherein the inter-block edges comprise a block edge (eg, CU edge) between a first P coding block and a second Q coding block, and a sub-block edge (eg, sud-pu edge) between sub-blocks within the first P coding block and/or the second Q coding block, in which the first P coding block has a size of M × N or N × M, the second Q coding block has a size of L × T or T × L, for example, N or T is an even integer number 2 ⁿ exceeding the threshold value (for example, 8 or 16, etc.);

a deblocking determination unit configured to determine a block edge between the first P coding block and the second Q coding block, and the first set of subblock edges between subblocks within the first P coding block and/or the second Q coding block, and the second set of subblock edges between subblocks within the first P coding block and/or the second Q coding block shall not be filtered; and

a deblocking filtering unit configured to perform deblocking filtering on sample values near a block edge between the first P coding block and a second Q coding block, and perform deblocking filtering on sample values near each of the first set of subblock edges between subblocks within the first P coding block and/or a second Q coding block.

For example, the deblocking determiner may be configured to determine a "first" subblock edge between subblocks (within) the first P coding block or the second Q coding block that is not to be filtered; in other words, a "first" subblock edge between subblocks (inside) of the first P coding block or the second Q coding block for which deblocking processing is disabled is determined.

For example, the deblocking determination unit may be configured to determine the edge of the "last" subblock between subblocks (within) the first P coding block or the second Q coding block that is not to be filtered; in other words, determining the edge of the "last" sub-block between sub-blocks (within) the first P coding block or the second Q coding block for which deblocking processing is disabled.

For example, the deblocking determiner may be configured to determine all subblock edges that overlap the 16 x 16 grid for the first P coding block and/or the second Q coding block, and apply deblocking only to those inner edges. The other inner edges of the subblocks are not subjected to deblocking processing. Also, to deblock the inner edges of sub-blocks that overlap with the 16 x 16 grid, a longer tap filter can be applied, while a longer tap filter can be applied to the CU edge.

In a possible form of implementation of the device according to the twelfth aspect as such, wherein the first set of subblock edges between subblocks within the first coding block and/or second coding block comprises (consists of) a plurality of subblock edges, excluding the first subblock edge and the last subblock edge, between the subblocks within the first P coding block and/or the second Q coding block, in which the edge of the first sub-block is closest to one of the first P coding block and the second Q coding block, in which the edge of the last sub-block is closest to the other of the first P coding block and the second Q block coding;

the second set of subblock edges between subblocks within the first coding block and/or the second coding block consists of the first subblock edge and the last subblock edge between subblocks within the first P coding block and/or the second Q coding block in which the first subblock edge is closest to one from the first P coding block and the second coding block Q, and the edge of the last sub-block is closest to the other of the first P coding block and the second Q coding block.

In a possible form of implementation of the apparatus according to the twelfth aspect as such, wherein the deblocking filter unit is configured to apply the fifth filter to sample values near each of the first set of subblock edges within the first P coding block and/or the second Q coding block, in which not more than the number NA of sample values on one side of the corresponding one of the first subblock edge set within the first P coding block and/or the second Q coding block, and at most the number NB of sample values on the other side of the corresponding one of the first subblock edge set, NA, NB = 4.

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения, когда принято решение применить пятый фильтр, являющийся HEVC фильтрацией удаления блочности:In a possible form of implementing the apparatus according to the twelfth aspect as such, wherein, in the absence of a subblock edge between subblocks within the first P coding block, and in the presence of a plurality of subblock edges between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal edge of the sub-block within the second Q coding block based on the following equation, when it is decided to apply the fifth filter, which is the HEVC deblocking filtering:

in which p _i represents the corresponding sample value of the part of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the part of the current row or column of samples of the second Q coding block, i = 0, 1, j = 0, 1..3 .

In a possible form of implementation of the apparatus according to the twelfth aspect as such, wherein the first set of subblock edges between subblocks within the first coding block and/or the second coding block comprises (consists of) one or more subblock edges that overlap with a 16×16 grid between subblocks within the first P coding block and/or second Q coding block;

the second set of subblock edges between subblocks within the first or second coding block comprises (consists of) one or more subblock edges, excluding subblock edges that overlap with a 16 x 16 grid between subblocks within the first P coding block and/or the second Q coding block.

In a possible form of implementing the apparatus according to the twelfth aspect as such, wherein the deblocking filter unit is configured to apply the sixth filter to sample values near each of the first set of subblock edges within the first P coding block and/or the second Q coding block, in which not more than the number NA' of sample values on one side of the corresponding one of the first subblock edge set within the first P coding block or the second Q coding block, and at most the number NB' of sample values on the other side of the corresponding one of the first subblock edge set, NA' = NB'=7. It can be understood that NA' and NB' may be determined based on the block size, in other words, NA' and NB' depend on the block size of the corresponding block. In the implementation for large blocks, ie, block size >= 32, the maximum number of modified samples can be 7 (corresponding to a long filter).

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения:In a possible form of implementing the apparatus according to the twelfth aspect as such, wherein, in the absence of a subblock edge between subblocks within the first P coding block, and in the presence of a plurality of subblock edges between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal sub-block edge within the second Q coding block based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

и

отфильтрованной выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования и первого Р блока кодирования, соответственно, на основании следующего уравнения:In a possible implementation form of the apparatus according to the twelfth aspect, as such, in the case of having a plurality of subblock edges between subblocks within a first P coding block and having a plurality of subblock edges between subblocks within a second Q coding block, the deblocking filtering block is configured to determine values

and

filtered sample of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal sub-block edge within the second Q coding block and the first P coding block, respectively, based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In an exemplary form of implementation of the apparatus according to the twelfth aspect as such, the deblocking determining unit is further configured to determine whether a block edge between the first P coding block and the second Q coding block is to be filtered by applying the first filter; and

the deblocking filter unit is further configured to apply the first filter to the sample values near the block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is to be filtered by applying the first filter , in which no more than the number MA of sample values of the first coding block adjacent to the block edge per line is modified, and no more than the number MB of sample values of the second coding block adjacent to the edge of the block per line are modified; or at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the edge of the block per line is modified, MA = 3 and MB = 7.

In a possible form of implementing the apparatus according to the twelfth aspect as such, wherein in the case of having a plurality of subblock edges between subblocks within a first coding block, and having a plurality of subblock edges between subblocks within a second coding block,

the deblocking determination unit is further configured to determine a block edge between the first coding block and the second coding block to be filtered by applying the second filter; and

the deblocking filter unit is further configured to apply a second filter to sample values near a block edge when it is determined that a block edge between the first coding block and the second coding block is to be filtered by applying a second filter in which the number MA' of sample values of the first block is modified of the coding block adjacent to the block edge, and the number MB' of sample values of the second coding block adjacent to the block edge is modified, MA'=3 and MB'=3.

In a possible form of implementation of the device according to the twelfth aspect as such, in the absence of a subblock edge between subblocks within the second coding block, no more than the number MA of sample values of the first coding block adjacent to the block edge per line are modified, and no more than the number MB of sample values of the second coding block are modified. block coding adjacent to the edge of the block per line;

or

when there is no subblock edge between subblocks within the first coding block, at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the block edge per line is modified, MA = 3 and MB=7.

In an exemplary form of implementation of the apparatus according to the twelfth aspect as such, the deblocking determination unit is further configured to determine whether a block edge between the first coding unit and the second coding unit is to be filtered by applying a first filter based on

- no more than the number DA of sample values of the first coding block adjacent to the edge of the block as the decision values of the first filter, and

- no more than the number DB of sample values of the second coding block adjacent to the edge of the block as decision values of the second filter.

In a possible implementation form of the apparatus according to the twelfth aspect as such, when there are a plurality of subblock edges between subblocks within the second Q coding block, the deblocking determining unit is configured to determine whether the first condition defined by the following first equation is satisfied:

in which β denotes the threshold parameter and q _i represent the sample values of the second Q coding block, i = 0,1,2,3 and p _j represents the sample values of the first P coding block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5.

In a possible implementation form of the apparatus according to the twelfth aspect as such, wherein, when there are a plurality of subblock edges between subblocks within the first P coding block, the deblocking determining unit is configured to determine whether the second condition defined by the following second equation is satisfied:

where β denotes the threshold parameter and p _i represents the sample values of the first P coding block, i = 0,1,2,3 and q _j represent the sample values of the second Q coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

In an exemplary form of implementation of the device according to the twelfth aspect as such, wherein the threshold parameter β is determined based on the quantization parameter, QP, associated with the quantization step size of the plurality of samples, or

the threshold parameter β is determined based on the quantization parameter, QP, using a look-up table.

выборки первой выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборок на основании следующего уравнения:In a possible implementation form of the apparatus according to the twelfth aspect, as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the first sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between the first P coding block and the second Q coding block of samples based on the following equation:

;

;

or,

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of a portion of the current row or column of samples of the second Q coding block, i, j = 0, 1...7.

выборки второй выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборок на основании следующего уравнения:In a possible implementation form of the apparatus according to the twelfth aspect, as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the second sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between the first P coding block and the second Q coding block of samples based on the following equation:

;

;

or,

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

выборки третьей выборки текущей строки или столбца выборок справа или внизу вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборок на основании следующего уравнения:In a possible implementation form of the apparatus according to the twelfth aspect, as such, if there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the third sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between the first P coding block and the second Q coding block of samples based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

выборки соответствующей выборки текущей строки или столбца выборок слева или вверху вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборок на основании следующего уравнения:In a possible implementation form of the apparatus according to the twelfth aspect, as such, if there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the deblocking filter block is configured to determine the filtered value

samples of the corresponding sample of the current row or column of samples to the left or top of the vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

,

,

,

,

,

,

,

,

,

,

,

,

,

,

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In an exemplary form of implementation of the apparatus according to the twelfth aspect as such, the deblocking determining unit is further configured to determine whether a block edge between the first P coding block and the second Q coding block is to be filtered by applying the first filter; and

the deblocking filtering unit is further configured to apply a third filter to the sample values near the block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is not to be filtered by applying the first A filter that modifies at most MA number of sample values of the first coding block adjacent to the block edge per line, and modifies at most MB number of sample values of the second coding block adjacent to the block edge per line, MA = MB = 4.

According to a thirteenth aspect, the invention relates to a deblocking method for use in image encoding and/or image decoding, wherein the method comprises:

definition of inter-block edges, wherein the inter-block edges comprise a block edge between a first P coding block and a second Q coding block, and a sub-block edge between sub-blocks within the first P coding block and/or the second Q coding block, wherein the first P coding block has a size M × N or N × M, the second Q coding block has a block size L × T or T × L, for example, in which N or T is an even integer 2 ⁿ , greater than a threshold value (for example, 8 or 16, etc. .);

determining a block edge between a first P coding block and a second Q coding block, and a first set of subblock edges between subblocks within the first P coding block and/or a second Q coding block to be filtered, and a second set of subblock edges between subblocks within the first P coding block and/or the second Q coding block is not subject to filtering; and

performing deblocking filtering on sample values near a block edge between the first P coding block and second Q coding block and performing deblocking filtering on sample values near each of the first set of subblock edges between subblocks within the first P coding block and/or second Q coding block.

In an exemplary form of implementing the method according to the thirteenth aspect as such, the first set of subblock edges between subblocks within the first coding block and/or the second coding block comprises (consists of) a plurality of subblock edges excluding the first subblock edge and the last subblock edge between subblocks within the first P of a coding block and/or a second Q coding block, in which the edge of the first subblock is closest to one of the first P coding block and the second Q coding block, in which the edge of the last subblock is closest to the other of the first P coding block and the second Q coding block ;

the second set of subblock edges between subblocks within the first coding block and/or the second coding block consists of the first subblock edge and the last subblock edge between subblocks within the first P coding block and/or the second Q coding block in which the first subblock edge is closest to one from the first P coding block and the second coding block Q, and the edge of the last sub-block is closest to the other of the first P coding block and the second Q coding block.

In an exemplary form of implementing the method according to the thirteenth aspect, as such, the step of performing deblocking filtering at sample values near each of the first set of subblock edges between subblocks of the first P coding block and/or the second Q coding block comprises:

applying a fifth filter to the sample values near each of the first set of subblock edges within the first P coding block and/or the second Q coding block, in which at most NA number of sample values on one side of the corresponding block from the first set of subblock edges within the first P coding block are modified and/or a second Q coding block, and no more than NB number of sample values on the other side of the corresponding one of the first set of subblock edges are modified, NA = NB = 4.

In a possible form of implementing the method according to the thirteenth aspect, as such, if there is no subblock edge between subblocks within the first P coding block, and if there are multiple subblock edges between subblocks within the second Q coding block, the step of performing deblocking filtering at sample values around each of the first set subblock edges between subblocks within the first P coding block and/or the second Q coding block contains:

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения, когда принято решение применить пятый фильтр, который является HEVC фильтром удаления блочности:filtered value definition

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal edge of the sub-block within the second Q coding block based on the following equation, when it is decided to apply the fifth filter, which is a HEVC deblocking filter:

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i = 0, 1, j = 0, 1..3 .

In an exemplary embodiment of the method according to the thirteenth aspect, as such, the first set of subblock edges between subblocks within the first coding block and/or the second coding block comprises (consists of) one or more subblock edges that overlap with a 16 x 16 grid between subblocks within the first P coding block and/or a second Q coding block;

the second set of subblock edges between subblocks within the first or second coding block comprises (consists of) one or more subblock edges, excluding subblock edges that overlap with a 16 x 16 grid between subblocks within the first P coding block and/or the second Q coding block.

In an exemplary form of implementing the method according to the thirteenth aspect, as such, the step of performing deblocking filtering at sample values near each of the first set of subblock edges between subblocks of the first P coding block and/or the second Q coding block comprises:

applying a sixth filter to the sample values adjacent to each of the first set of subblock edges within the first P coding block and/or the second Q coding block in which at most NA' number of sample values on one side corresponding to one of the first set of subblock edges within the first P are modified coding block or the second Q coding block, no more than the number NB' of sample values on the other side of the corresponding one of the first set of sub-block edges is modified, NA'= NB' = 7.

In an exemplary form of implementing the method according to the thirteenth aspect as such, if there is no subblock edge between subblocks within the first P coding block, and if there are multiple subblock edges between subblocks within the second Q coding block,

the step of performing deblocking filtering at sample values near each of the first set of subblock edges between subblocks within the first P coding block and/or the second Q coding block, comprising:

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения:filtered value definition

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal sub-block edge within the second Q coding block based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In an exemplary form of implementing the method according to the thirteenth aspect as such, if there are multiple subblock edges between subblocks within the first P coding block and if there are multiple subblock edges between subblocks within the second Q coding block,

the step of performing deblocking filtering at sample values near each of the first set of subblock edges between subblocks within the first P coding block and/or the second Q coding block, comprising:

и

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования и первого Р блока кодирования соответственно на основании следующего уравнения:filtered value definition

and

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal edge of the sub-block within the second Q coding block and the first P coding block, respectively, based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In a possible form of implementation of the method according to the thirteenth aspect, as such, the method further comprises:

determining whether a block edge between the first P coding block and the second Q coding block should be filtered by applying the first filter; and

applying a first filter to sample values near a block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is to be filtered by applying a first filter in which at most the number of MAs is modified sample values of the first coding block adjacent to the edge of the block per line, and modified by no more than the number MB of the values of the samples of the second coding block adjacent to the edge of the block per line; or at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the edge of the block per line is modified, MA = 3 and MB = 7.

In a possible form of implementing the method according to the thirteenth aspect as such, in the case of having a plurality of subblock edges between subblocks within a first coding block, and having a plurality of subblock edges between subblocks within a second coding block, the method further comprises:

determining a block edge between the first coding block and the second coding block to be filtered by applying the second filter; and

applying a second filter to sample values near a block edge when it is determined that a block edge between the first coding block and the second coding block is to be filtered by applying a second filter that modifies the number MA' of sample values of the first coding block adjacent to the block edge, and the number MB' of sample values of the second coding block adjacent to the edge of the block is modified, MA'=3 and MB'=3.

In a possible form of implementing the method according to the thirteenth aspect, as such, in the absence of a subblock edge between subblocks within the second coding block, no more than the number MA of sample values of the first coding block adjacent to the block edge per line are modified, and no more than the number MB of sample values of the second coding block are modified. block coding adjacent to the edge of the block per line;

or

when there is no subblock edge between subblocks within the first coding block, at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the block edge per line is modified, MA = 3 and MB=7.

In an exemplary form of implementing the method according to the thirteenth aspect as such, the method further comprises: determining whether a block edge between the first coding block and the second coding block is to be filtered by applying the first filter based on

- no more than the number DA of sample values of the first coding block adjacent to the edge of the block as the decision values of the first filter, DA = 4 and

- no more than the number DB of sample values of the second coding block adjacent to the edge of the block as decision values of the second filter, DB = 4.

In an exemplary form of implementing the method according to the thirteenth aspect as such, if there are a plurality of subblock edges between subblocks within the second Q coding block, the method further comprises: determining whether the first condition defined by the following first equation is satisfied:

in which β denotes the threshold parameter and q _i represent the sample values of the second Q coding block, i = 0,1,2,3 and p _j represent the sample values of the first P coding block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5.

In an exemplary form of implementing the method according to the thirteenth aspect as such, if there are a plurality of subblock edges between subblocks within the first P coding block, the method further comprises: determining whether the second condition defined by the following second equation is met:

where β denotes the threshold parameter and p _i represents the sample values of the first P coding block, i = 0,1,2,3 and q _j represent the sample values of the second Q coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

In an exemplary embodiment of the method according to the thirteenth aspect, as such, the threshold parameter β is determined based on the quantization parameter, QP, associated with the quantization step size of the plurality of samples, or the threshold parameter β is determined based on the quantization parameter, QP, using a look-up table.

In a possible form of implementing the method according to the thirteenth aspect, as such, if there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering at sample values near the block edge between the first P coding block and the second Q coding block contains:

выборки первой выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборок на основании следующего уравнения:filtered value definition

samples of the first sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between the first P coding block and the second Q coding block of samples based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In a possible form of implementing the method according to the thirteenth aspect, as such, if there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering at sample values near the block edge between the first P block coding and the second Q coding block contains:

выборки второй выборки текущей строки или столбца выборок справа или снизу от вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:filtered value definition

samples of the second sample of the current row or column of samples to the right or below the vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In a possible form of implementing the method according to the thirteenth aspect, as such, if there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering at sample values near the block edge between the first P block coding and the second Q coding block contains:

выборки третьей выборки текущей строки или столбца выборок справа или снизу вертикального или горизонтального края между первым P блоком кодирования и вторым Q блоком кодирования выборки на основании следующего уравнения:filtered value definition

samples of the third sample of the current row or column of samples to the right or bottom of the vertical or horizontal edge between the first P coding block and the second Q sample coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In a possible form of implementing the method according to the thirteenth aspect, as such, if there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering at sample values near the block edge between the first P block coding and the second Q coding block contains:

отфильтрованной выборки соответствующей выборки текущей строки или столбца выборок слева или вверху вертикального или горизонтального края между первым и вторым блоком кодирования на основании следующего уравнения:definition of value

filtered sample of the corresponding sample of the current row or column of samples to the left or top of the vertical or horizontal edge between the first and second coding block based on the following equation:

,

,

,

,

,

,

,

,

,

,

,

,

,

,

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of a portion of the current row or column of samples of the second Q coding block, i, j = 0, 1...7.

In a possible form of implementation of the method according to the thirteenth aspect, as such, the method further comprises:

determining whether a block edge between the first P coding block and the second Q coding block should be filtered by applying the first filter; and

applying a third filter to the sample values near the block edge between the first P coding block and the second Q coding block, when it is determined that the block edge between the first P coding block and the second Q coding block is not to be filtered by applying a first filter in which at most a number is modified MA sample values of the first coding block adjacent to the block edge per line, and modified by no more than the number MB of sample values of the second coding block adjacent to the block edge per line, MA = MB = 4.

The method according to the sixth or seventh aspect of the invention may be carried out by the device according to the first aspect of the invention. Additional features and forms of implementation of the method according to the sixth or seventh aspect of the invention are a direct result of the functionality of the device according to the first aspect of the invention and its various forms of implementation.

The method according to the eighth aspect of the invention can be performed by the device according to the second aspect of the invention. Additional features and forms of implementation of the method according to the eighth aspect of the invention are a direct result of the functionality of the device according to the second aspect of the invention and its various forms of implementation.

The method according to the thirteenth aspect of the invention can be performed by the device according to the twelfth aspect of the invention. Additional features and forms of implementation of the method according to the eighth aspect of the invention are a direct result of the functionality of the device according to the second aspect of the invention and its various forms of implementation.

According to another aspect, the invention relates to a device for decoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to execute the deblocking method according to any prior implementation of any prior aspect, or any prior aspect as such.

According to another aspect, the invention relates to a device for encoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to execute the deblocking method according to any prior implementation of any prior aspect, or any prior aspect as such.

According to another aspect, a computer-readable storage medium is provided that stores instructions that, when executed, cause one or more processors to encode video data. The instructions cause one or more processors to execute the deblocking method according to any prior implementation of any previous aspect, or any prior aspect as such.

According to another aspect, a computer program product is provided with program code for performing a deblocking method according to any prior implementation of any prior aspect, or any prior aspect as such, when a computer program is executed on a computer.

Details of one or more embodiments are set forth in the accompanying drawings and in the description below. Other features, objects and advantages will be apparent from the description, drawings and claims.

Brief description of the drawings

The following embodiments of the invention are described in more detail with reference to the accompanying drawings, in which:

1 is a block diagram showing an example of a video encoder capable of implementing embodiments of the invention;

2 is a block diagram showing an exemplary structure of a video decoder capable of implementing embodiments of the invention;

3 is a block diagram showing an example of a video coding system capable of implementing embodiments of the invention;

4 shows two exemplary coding blocks in which the Q coding block uses sub-block tools (in general, sub-block tools);

FIG. 5 shows two exemplary coding blocks and corresponding sample values used and modified during filtering using the exemplary method shown in FIG. ten;

6 shows a first embodiment of a deblocking filter apparatus according to embodiments of the invention;

7 shows a flowchart illustrating a method for determining whether to use a longer tap filter;

8 shows a flowchart illustrating a method for determining whether a strong filter condition HEVC is satisfied;

9 shows two exemplary blocks of coding and sample values used and modified during filtering according to another embodiment of the invention, and

10 shows a flowchart depicting an exemplary process for improving deblocking filtering efficiency;

11A shows a flowchart depicting an exemplary process for improving deblocking filtering efficiency;

11B shows a flowchart depicting an exemplary process for improving deblocking filtering efficiency;

12 is a flowchart showing an exemplary process for improving deblocking filtering efficiency;

FIG. 13 shows a simplified block diagram of a device 1300 that can be used as one or both of source device 310 and destination device 320 of FIG. 3, according to an exemplary embodiment;

Fig. 14 is a diagram of a device for video encoding;

Fig. 15 shows how deblocking can be applied to all inner edges of sub-blocks that are in a 16 x 16 grid,

16 shows a method for applying HEVC deblocking to all inner edges of subblocks except the edges of the first and last subblocks;

17 shows two exemplary sub-blocks within an encoding block in which the encoding block uses sub-block tools;

18 shows exemplary sub-blocks within an encoding block, in which the encoding block uses sub-block tools, in which each of these sub-blocks uses separate motion vectors; and

Fig. 19 illustrates image samples of horizontal and vertical block boundaries on an 8*8 grid.

In the following, identical reference numerals refer to identical or at least functionally equivalent elements. In part, different reference numbers have been used in different drawings referring to the same objects.

Implementation of the invention

The following description is given with reference to the accompanying drawings, which form part of the present invention and show, by way of illustration, specific aspects of embodiments of the invention or specific aspects in which embodiments of the present invention may be used. Obviously, embodiments of the invention can be used in other aspects and contain structural or logical changes not shown in the drawings. Therefore, the following detailed description should not be considered in a limiting sense, and the scope of the present invention is determined by the appended claims.

For example, it is understood that the present invention discloses a method that can also be used for a corresponding device or system capable of performing the method, and vice versa. For example, if one or more specific method steps are described, the corresponding apparatus may include one or more blocks, such as functional blocks for performing one or more method steps described (for example, one block performing one or more steps, or a plurality of blocks each of which performs one or more of a plurality of steps) even if such one or more units are not explicitly described or illustrated in the drawings. On the other hand, for example, if a particular device is described in terms of one or more blocks, such as functional blocks, the corresponding method may include one step to perform the functionality of one or more blocks (for example, one step to perform the functionality of one or more blocks). blocks, or a plurality of steps, each of which performs the functionality of one or more of the plurality of blocks) even if such one or more steps are not explicitly described or illustrated in the drawings. In addition, it should be understood that features of the various exemplary embodiments and/or aspects described herein may be combined with each other unless specifically noted otherwise.

Video coding generally refers to the processing of a sequence of images that form a video or video sequence. Instead of the term "picture", the terms "frame" or "picture" may be used interchangeably in the field of video coding. Video encoding contains two parts: video encoding and video decoding. Video encoding is performed at the source side, typically involving processing (eg, by compressing) the original video images to reduce the amount of data needed to represent the video images (for more efficient storage and/or transmission). Video decoding is performed on the destination side and usually contains inverse processing compared to the encoder for recovering video images. Embodiments relating to "coding" of video images (or images in general, as will be explained later) should be understood to refer to both "coding" and "decoding" of video images. The combination of an encoding part and a decoding part is also called CODEC (Coding and Decoding).

In the case of lossless video coding, the original video images can be reconstructed, i.e. the restored video images have the same quality as the original video images (assuming no transmission loss or other data loss during storage or transmission). In the case of lossy video coding, additional compression is performed, for example by quantization, to reduce the amount of data representing video images that cannot be fully reconstructed in the decoder, i.e. the quality of the restored video images is lower or worse than the quality of the original video images.

Several video coding standards, starting with H.261, belong to the group of "hybrid lossy video codecs" (ie, combine spatial and temporal sample-domain prediction and 2D transform coding to apply transform-domain quantization). Each picture of a video sequence is usually divided into a set of non-overlapping blocks, and encoding is usually done at the block level. In other words, the video is usually processed in the encoder, that is, encoded at the block (video block) level, for example, using spatial (inner picture) prediction and temporal (outer picture) prediction to generate a prediction block, subtracting the prediction block from the current block (block, which is currently being processed/will be processed) to obtain a residual block, transforming the residual block, and quantizing the residual block in the transform domain to reduce the amount of data that must be transmitted (compression), while the representation is back-processed in the decoder compared to the encoder to the encoded or compressed block to reconstruct the current block. In addition, the encoder duplicates the processing cycle of the decoder so that both will generate identical predictions (eg, intra and inter prediction) and/or reconstruction for processing, i.e. encoding, subsequent blocks.

Since video image processing (also called moving image processing) and still image processing (the term processing containing encoding) have many common concepts and technologies or tools, in the following, the term “image” is used to refer to a video image, a video sequence (as explained above) and/or a still image. image to avoid unnecessary repetition and differences between video images and still images in which this is not necessary. If the description refers only to still images (or still images), the term "still image" should be used.

In the following embodiments, encoder 100, decoder 200, and encoding system 300 are described based on FIGS. 1-3 before the embodiments are described in more detail based on FIGS. 4-14.

3 is a conceptual or schematic block diagram illustrating an embodiment of an encoding system 300, such as an image encoding system 300, in which the encoding system 300 comprises a source device 310 configured to provide encoded data 330, such as an encoded image 330, for example, to the destination device 320 to decode the encoded data 330.

Source device 310 includes encoder 100 or encoder 100 and may additionally, i.e. optionally include an image source 312, a pre-processor 314, such as an image pre-processor 314, and a communication interface or communication unit 318.

Image source 312 may comprise or be any type of image capture device, such as for capturing a real world image, and/or any type of image generating device, such as a computer graphics processor for generating a computer animated image, or any type of device for receiving and/or providing real image, computer animated image (eg, screen content, virtual reality (VR) image), and/or any combination thereof (eg, augmented reality (AR) image). In the following, all these types of images and any other images will be referred to as "image" or "frame", unless specifically indicated otherwise, while the foregoing explanations regarding the term "image" cover "video images" and "still images" as before. remain in effect unless expressly stated otherwise.

A (digital) image is, or can be viewed as, a two-dimensional array or matrix of samples with intensity values. A sample in an array can also be called a pixel (short for picture element) or a pixel. The number of samples in the horizontal and vertical direction (or axis) of the array or image determines the size and/or resolution of the image. Three color components are typically used to represent a color, that is, an image can be represented by or include three arrays of samples. In RGB format or color space, an image contains a corresponding array of red, green, and blue color samples. However, in video encoding, each pixel is typically represented in a luma/chrominance format or color space, such as YCbCr, which contains a luminance component labeled Y (sometimes L is also used instead) and two chrominance components labeled Cb and Cr. The luminance Y component (short for luminance) represents the brightness or intensity of the gray level (eg, as in a grayscale image), while the two chrominance components (short for chrominance) Cb and Cr represent components of chrominance or color information. Accordingly, an image in YCbCr format contains an array of luminance samples of values (Y) of luminance samples and two arrays of chrominance samples of chrominance values (Cb and Cr). RGB images can be converted or converted to YCbCr format and vice versa, this process is also known as color conversion or conversion. If the image is monochrome, it can only contain an array of brightness samples.

Image source 312 may be, for example, a camera for capturing an image, a memory, such as an image memory, containing or storing a previously captured or generated image, and/or any type of interface (internal or external) for acquiring or receiving an image. The camera may be, for example, a local or integrated camera integrated into the source device, the memory may be local or integrated memory, for example, integrated into the source device. The interface may be, for example, an external interface for receiving an image from an external video source, such as an external image capturing device such as a camera, external memory, or an external image generating device, such as an external computer GPU, computer, or server. The interface may be any, such as a wired or wireless interface, an optical interface in accordance with any proprietary or standardized interface protocol. The interface for obtaining image data 312 may be the same interface as the communication interface 318, or part of it.

Unlike the preprocessor 314 and the processing performed by the preprocessor 314, the image or image data 313 may also be referred to as a raw image or raw image data 313.

The pre-processor 314 is configured to receive (raw) image data 313 and perform pre-processing of the image data 313 to obtain a pre-processed image 315 or pre-processed image data 315. Pre-processing is performed by pre-processor 314 and may, for example, include cropping, color format conversion (eg, from RGB to YCbCr), color correction, or denoising.

The encoder 100 is configured to receive pre-processed image data 315 and provide encoded image data 171 (more details will be described, for example, with reference to FIG. 1).

The communication interface 318 of source device 310 may be configured to receive encoded image data 171 and directly transmit it to another device, such as destination device 320 or any other device for storage or direct retrieval or for processing encoded image data 171, respectively, prior to storage. encoded data 330 and/or transmit encoded data 330 to another device, such as destination device 320 or any other device for decoding or storage.

Destination device 320 includes decoder 200 or decoder 200 and may additionally, i.e. possibly contain a communication interface or communication unit 322, a post-processor 326, and a display device 328.

The communication interface 322 of the destination device 320 is configured to receive encoded image data 171 or encoded data 330, for example, directly from source device 310 or from any other source, such as a memory, such as encoded image data memory.

Communication interface 318 and communication interface 322 may be configured to transmit, respectively, receive encoded image data 171 or encoded data 330 via a direct link between source device 310 and destination device 320, such as over a direct wired or wireless connection, or over any network. , for example, a wired or wireless network, or any combination thereof, or any private and public network, or any combination thereof.

The communication interface 318 may, for example, be configured to package the encoded image data 171 into an appropriate format, such as packets, for transmission over a communication channel or network, and may further comprise data loss protection and data loss recovery.

Communication interface 322 analogous to communication interface 318 may, for example, be configured to decompress encoded data 330 to obtain encoded image data 171, and may also be configured to perform data loss protection and data loss recovery, for example, comprising error masking.

Both the communication interface 318 and the communication interface 322 can be configured as unidirectional communication interfaces, as shown by the arrow for the encoded image data 330 in FIG. 3 pointing from source device 310 to destination device 320, or as bidirectional communication interfaces, and can be implemented with the ability, for example, to send and receive messages, for example, to establish a connection, acknowledge and / or resend lost or delayed data, including image data, and exchange any other information related to the communication channel and / or data transfer, for example , transmission of encoded image data.

The decoder 200 is configured to receive encoded image data 171 and provide decoded image data 231 or decoded image 231 (more details will be described, for example, with reference to FIG. 2).

The post-processing unit 326 of the destination device 320 is configured to post-process the decoded image data 231, such as the decoded image 231, to obtain post-processed image data 327, such as the post-processed image 327. The post-processing performed by the post-processing unit 326 may comprise, for example, color format conversion (eg, from YCbCr to RGB), color correction, cropping or resampling, or any other processing, such as preparing decoded image data 231 for display, such as by a display device 328.

The display device 328 of the destination device 320 is configured to receive post-processed image data 327 to display the image to, for example, a user or viewer. The display device 328 may be or comprise any kind of display for presenting the reconstructed image, such as a built-in or external display or monitor. The displays may, for example, consist of cathode ray tubes (CRT), liquid crystal displays (LCD), plasma displays, organic light emitting diode (OLED) displays or any other displays…beam, hologram (3D),…

Although FIG. 3 depicts source device 310 and destination device 320 as separate devices, device embodiments may also contain both the functionality of source device 310 and the corresponding functionality of destination device 320. In such embodiments, source device 310 or related functionality and destination device 320 or related functionality may be implemented using the same hardware and/or software, or using separate hardware and/or software, or any combination thereof.

As will be apparent to those skilled in the art based on the description, the presence and (exact) separation of functionality of various blocks or functions in source device 310 and/or destination device 320 as shown in FIG. 3 may vary depending on the actual device and application.

Therefore, source device 310 and destination device 320 as shown in FIG. 3 are merely exemplary embodiments of the invention, and the embodiments of the invention are not limited to those shown in FIG. 3.

Source device 310 and destination device 320 may comprise any of a wide range of devices, including any kind of portable or stationary devices, such as laptops or laptops, mobile phones, smartphones, tablets or tablet computers, cameras, desktop computers, set-top boxes, televisions, display devices, digital media players, game consoles, video streaming devices, broadcast receiver devices, etc. (also servers and workstations for large-scale professional encoding/decoding, such as network objects) and may not use or use any type of operating system.

Figure 1 shows a schematic/conceptual block diagram of an embodiment of an encoder 100, for example, an image encoder 100, which includes an input 102, a residual calculation block 104, a transform block 106, a quantizer block 108, an inverse quantizer block 110, and an inverse transform block 112, reconstruction block 114, buffer 118, loop filter 120, decoded picture buffer (DPB) 130, prediction block 160 [inter estimator 142, inter prediction block 144, intra estimator 152, intra prediction block 154, mode selection block 162], block 170 entropy encoding and output 172. The video encoder 100 shown in FIG. 1 may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.

For example, the residual calculator 104, the transform block 106, the quantizer 108, and the entropy coding block 170 form the direct signal path of the encoder 100, while, for example, the inverse quantizer 110, the inverse transform block 112, the reconstruction block 114, the buffer 118, the loop filter 120, a decoded picture buffer (DPB) 130, an inter prediction block 144, and an intra prediction block 154 form an encoder return signal path, in which the encoder return signal path corresponds to the decoder signal path (see decoder 200 in FIG. 2).

The encoder is configured to receive, for example, via input 102, an image 101 or an image block 103 of image 101, for example, an image of a sequence of images constituting a video or video sequence. Image block 103 may also be referred to as the current image block or image block to be encoded, and image 101 is the current image or image to be encoded (particularly when encoding a video to distinguish the current image from other images, such as previously encoded and/or decoded images of the same video sequence, i.e. a video sequence that also contains the current image).

Embodiments of encoder 100 may comprise a splitter (not shown in FIG. 1), for example, which may also be referred to as a picture splitter, configured to split image 103 into multiple blocks, such as blocks like block 103, typically into multiple non-overlapping blocks. . The dividing block may be configured to use the same block size for all images of the video sequence and the corresponding grid defining the block size, or to change the block size between images or subsets or groups of images, and to divide each image into appropriate blocks.

Like image 101, block 103 is again, or can be viewed as, a two-dimensional array or matrix of samples with intensity values (sample values), albeit smaller than image 101. In other words, block 103 may contain, for example, one array of samples (for example, a luminance array in the case of a monochrome image 101) or three sample arrays (eg, a luminance array and two chrominance arrays in the case of a color image 101) or any other number and/or type of arrays depending on the color format used. The number of samples in the horizontal and vertical direction (or axis) of block 103 determines the size of block 103.

The encoder 100, as shown in FIG. 1, is configured to encode the image 101 block by block, for example, encoding and prediction are performed in block 103.

Residual block 104 is configured to calculate residual block 105 based on image block 103 and predictor 165 (more details about predictor 165 are provided later), for example, by subtracting sample values of predictor 165 from sample values of image block 103, sample by sample. (pixel by pixel) to obtain a residual block 105 in the sample area.

Transform block 106 is configured to apply transforms, such as a space-frequency transform or a linear spatial transform, such as a discrete cosine transform (DCT) or a discrete sine transform (DST), on the sample values of the residual block 105 to obtain transformed coefficients 107 in the transform domain. The transformed coefficients 107 may also be referred to as transformed residual coefficients and represent the residual block 105 in the transform region.

Transform block 106 may be configured to apply DCT/DST integer approximations, such as the base transforms defined for HEVC/H.265. Compared to the orthonormal DCT transform, such integer approximations are usually scaled by a certain factor. To preserve the norm of the residual block that is processed by forward and backward transforms, additional scaling factors are applied as part of the transform process. The scaling factors are usually chosen based on certain constraints, such as scaling factors that are a power of two for the shift operation, the bit depth of the transformed coefficients, the trade-off between accuracy and implementation cost, and so on. Specific scaling factors can be defined, respectively, such as those indicated for the inverse transform, for example, by the inverse transform block 212 in the decoder 200 (and the corresponding inverse transform, for example, by the inverse transform block 112 in the encoder 100) and the corresponding scaling factors for the forward transform. , for example, using the transform block 106 in the encoder 100.

Quantizer 108 is configured to quantize the transformed coefficients 107 to obtain quantized coefficients 109, for example by applying scalar quantization or vector quantization. The quantized coefficients 109 may also be referred to as quantized residual coefficients 109. For example, a different scaling may be applied to scalar quantization to achieve finer or coarser quantization. Smaller quantization step sizes correspond to finer quantization, while larger quantization step sizes correspond to coarser quantization. The applicable quantization step size may be indicated by a quantization parameter (QP). The quantization parameter may, for example, be an index to a predetermined set of applicable quantization step sizes. For example, small quantization parameters may correspond to fine quantization (small quantization step sizes) and large quantization parameters may correspond to coarse quantization (large quantization step sizes), or vice versa. The quantization may include dividing by the quantization step size and the corresponding inverse dequantization, for example by the inverse quantizer 110, may include multiplying by the quantization step size.

Embodiments according to HEVC may be configured to use a quantization parameter to determine the quantization step size. Typically, the quantization step size can be calculated based on the quantization parameter using a fixed-point approximation of an equation involving division. Additional scaling factors may be introduced for quantization and dequantization to recover the residual block norm, which may be modified by the scaling used in the fixed-point approximation of the equation for quantization step size and quantization parameter. In one exemplary implementation, inverse transform scaling and dequantization may be combined. Alternatively, customized quantization tables can be used and signaled from the encoder to the decoder, for example, in a bitstream. Quantization is a lossy operation in which the loss increases with increasing quantization step sizes.

Embodiments of encoder 100 (or quantizer 108, respectively) can be configured to derive the quantization scheme and quantization step size, for example, using an appropriate quantization parameter, so that decoder 200 can receive and apply the appropriate inverse quantization. Embodiments of encoder 100 (or quantizer 108) may be configured to output the quantization scheme and quantization step size, eg encoded directly or entropy via entropy coding unit 170 or any other entropy coding unit.

The inverse quantizer 110 is configured to apply the inverse quantization of the quantizer 108 to the quantized coefficients to obtain the dequantized coefficients 111, for example, by applying a scheme, the inverse quantization scheme applied by the quantizer 108, based on or using the same quantization step size as block 108 quantization. The dequantized coefficients 111 may also be referred to as the dequantized residual coefficients 111 and correspond, although they are usually not identical to the transformed coefficients due to quantization loss, to the transformed coefficients 108.

The inverse transform block 112 is configured to apply an inverse transform applied by the transform block 106, such as an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST), to obtain an inverse transform block 113 in the sample area. The inverse transform block 113 may also be referred to as the dequantized inverse transform block 113 or the residual inverse transform block 113 .

Restoration block 114 is configured to combine inverse transform block 113 and predictor 165 to obtain a reconstructed block 115 in the sample area, for example, by discretely adding the sample values of the decoded residual block 113 and the sample values of the prediction block 165.

Buffer block 116 (or "buffer" 116 for short), eg, line buffer 116, is configured to buffer or store the reconstructed block and associated sample values, eg, for intra-estimation and/or intra-prediction. In further embodiments, the encoder may be configured to use the unfiltered reconstructed blocks and/or corresponding sample values stored in buffer block 116 for any kind of estimation and/or prediction.

Embodiments of encoder 100 may be configured such that, for example, buffer block 116 is used not only to store reconstructed blocks 115 for intra estimation 152 and/or intra prediction 154, but also for loop filter block 120 (not shown in FIG. 1) and/or such that, for example, buffer block 116 and decoded picture buffer 130 form one buffer. Additional embodiments may be configured to use filtered blocks 121 and/or blocks or samples from decoded picture buffer 130 (both not shown in FIG. 1) as input or basis for intra estimation 152 and/or intra prediction 154.

The loop filter block 120 (or "loop filter" 120 for short) is configured to filter the reconstructed block 115 to obtain a filtered block 121, for example, by applying an adaptive offset deblocking (SAO) filter or other filters, such as sharpening or anti-aliasing filters. or joint filters. The filtered block 121 may also be referred to as the filtered reconstructed block 121. The loop filter 120 is also referred to as a deblocking filter in the following. Additional details of the loop filter unit 120 will be described below, for example, based on FIG. 6 or fig.7 or fig.10-fig.12.

Embodiments of the loop filter block 120 may comprise (not shown in FIG. 1) a filter analysis block and an actual filter block, in which the filter analysis block is configured to determine the loop filter parameters for the actual filter. The filter parser may be configured to apply fixed predetermined filter parameters to an actual loop filter, adaptively select filter parameters from a set of predefined filter parameters, or adaptively calculate filter parameters for an actual loop filter.

Embodiments of the loop filter unit 120 may comprise (not shown in FIG. 1) one or a plurality of filters (loop filter components/sub-filters), e.g., one or more different kinds or types of filters, e.g., connected in series or in parallel, or any combination thereof. , in which each of the filters may contain separately or together with other filters from a plurality of filters a filter analysis unit to determine the corresponding loop filter parameters, for example, as described in the previous paragraph.

Embodiments of the encoder 100 (respectively, the loop filter block 120) may be configured to output the loop filter parameters, for example, encoded directly or entropy through the entropy encoding block 170 or any other entropy encoding block, so that, for example, the decoder 200 can receive and apply the same loop filter parameters for decoding.

A decoded picture buffer (DPB) 130 is configured to receive and store a filtered block 121. The decoded picture buffer 130 can be further configured to store other previously filtered blocks, such as previously reconstructed and filtered blocks 121 of the same current image or different images. , for example, previously restored images and can provide complete previously restored, i.e. decoded, pictures (and corresponding reference blocks and samples) and/or partially reconstructed current picture (and corresponding reference blocks and samples), for example, for inter-estimation and/or inter-prediction.

Additional embodiments of the invention may also be configured to use the previously filtered blocks and the corresponding filtered sample values of the decoded image buffer 130 for any kind of estimation or prediction, such as intra- and inter-estimation and prediction.

The predictor 160, also referred to as the block predictor 160, is configured to receive or obtain an image block 103 (the current image block 103 of the current image 101) and decoded or at least reconstructed image data, such as reference samples of the same (current) images from buffer 116 and/or decoded image data 231 from one or a plurality of previously decoded images from decoded image buffer 130, and process such data for prediction, i.e., provide a prediction block 165, which may be an inter prediction block 145 or an intra prediction block 155 predictions.

Mode selector 162 may be configured to select a prediction mode (eg, intra or inter prediction mode) and/or a corresponding predictor 145 or 155 to be used as predictor 165 to calculate the residual block 105 and to reconstruct the reconstructed block 115 .

Embodiments of mode selector 162 may be configured to select a prediction mode (e.g., from those supported by predictor 160) that provides the best fit, or in other words, minimum residual (minimum residual means better compression for transmission or storage), or minimal signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which takes into account or balances both. The mode selector 162 may be configured to determine a prediction mode based on rate distortion optimization (RDO), that is, select a prediction mode that provides minimum rate distortion optimization or which associated rate distortion at least satisfies the prediction mode selection criterion. .

Next, a detailed description will be given of the prediction processing process (for example, by the prediction block 160 and mode selection (for example, by the mode selector 162) performed by the exemplary encoder 100.

As described above, encoder 100 is configured to determine or select the best or optimal prediction mode from a set of (given) prediction modes. The set of prediction modes may include, for example, intra prediction modes and/or inter prediction modes.

The intra prediction mode set may contain 32 different intra prediction modes, such as non-directional modes such as DC (or average) mode and planar mode or directional modes, such as defined in H.264, or may contain 65 different intra prediction modes, for example, non-directional modes such as DC (or medium) mode and planar mode, or directional modes such as defined in H.265.

The set (or possible) inter prediction modes depends on the available reference pictures (i.e., preceding at least partially decoded pictures, such as those stored in DBP 230) and other inter prediction parameters, such as whether it is the entire reference picture or only it. part, for example, to find the best match of the reference block, a search box is used, the area around the area of the current block, the reference frame, and/or, for example, whether pixel interpolation is applied, such as half/half pixel and/or quarter pixel interpolation or not.

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

The predictor 160 may be further configured to divide the block 103 into smaller portions or sub-blocks, for example, iteratively using quadripartite partitioning (QT), binary partitioning (BT), or ternary partitioning (TT), or any combination thereof, and performing, for example, prediction for each of the partitions or sub-blocks of the block, wherein the mode selection comprises selecting a tree structure of the partitioned block 103 and prediction modes applied to each of the partitions or sub-blocks of the block.

The external estimator 142, also referred to as the external image estimator 142, is configured to receive or obtain an image block 103 (the current image block 103 of the current image 101) and a decoded image 231 or at least one or a plurality of previously reconstructed blocks, for example, reconstructed blocks of one or a plurality of other/different previously decoded pictures 231 for external evaluation (or "external image estimation"). For example. the video sequence may comprise the current picture and the previously decoded pictures 231 or, in other words, the current picture and the previously decoded pictures 231 may be part of or form a sequence of pictures constituting the video sequence.

Encoder 100 may, for example, be configured to select a reference block from a plurality of reference blocks of the same or different pictures from a plurality of other pictures and supply a reference picture (or reference frame index, ...) and/or offset (spatial offset) between position ( X, Y coordinates) of the reference block and the position of the current block as external estimation parameters 143 to the external prediction block 144 . This displacement is also called motion vector (MV). The extrinsic estimate is also called motion estimation (ME) and the extrinsic prediction is also called motion prediction (MP).

Inter prediction block 144 is configured to receive, for example, receive inter prediction parameter 143 and perform inter prediction based on or using inter prediction parameter 143 to obtain inter prediction block 145.

Although Figure 1 shows two separate blocks (or steps) for inter-coding, namely, inter-estimation 142 and inter-prediction 152, both functions can be performed as one (inter-estimate) and require/include calculation of an inter prediction block, i.e. . or “type” of inter prediction 152), e.g., by iteratively testing all possible or a given subset of possible inter prediction modes, keeping the current best inter prediction mode and the corresponding inter prediction block, and using the current best inter prediction mode and the corresponding inter prediction block as ( final) of the inter prediction parameter 143 and the inter prediction block 145 without performing inter prediction 144 another time.

The internal estimator 152 is configured to receive, for example, an image block 103 (the current image block) and one or a plurality of previously reconstructed blocks, such as reconstructed adjacent blocks of the same image, for internal evaluation. Encoder 100 may, for example, be configured to select an intra prediction mode from a plurality of (predetermined) intra prediction modes and provide it as an intra estimation parameter 153 to intra prediction block 154 .

Embodiments of encoder 100 may be configured to select an intra prediction mode based on an optimization criterion, such as minimum residual (eg, intra prediction mode providing prediction block 155 most similar to current image block 103) or minimum rate distortion.

The intra prediction block 154 is configured to determine, based on the intra prediction parameter 153, for example, the selected intra prediction mode 153, the intra prediction block 155.

Although figure 1 shows two separate blocks (or steps) for intra coding, namely, intra estimation 152 and intra prediction 154, both functions can be performed as one (intra estimation) and requires/contains calculation of an intra prediction block, i.e. . or "type" of intra prediction 154), e.g., by iteratively testing all possible or a predetermined subset of possible intra prediction modes while keeping the currently best intra prediction mode and corresponding intra prediction block, and using the currently best intra prediction mode and corresponding block intra prediction as the (final) intra prediction parameter 153 and intra prediction block 155 without re-executing intra prediction 154.

The entropy encoding unit 170 is configured to apply an entropy encoding algorithm or scheme (e.g., a variable length coding (VLC) scheme, a context adaptive VLC (CALVC) scheme, an arithmetic coding scheme, a context adaptive binary arithmetic coding (CABAC) scheme) to quantized residual coefficients 109, inter prediction parameters 143, intra prediction parameter 153, and/or loop filter parameters, individually or jointly (or not) to obtain encoded image data 171 that can be output by output 172, for example, as a coded bitstream 171.

Other structural variations of video encoder 100 may be used to encode the video stream. For example, non-transform encoder 100 may quantize the residual signal directly without a transform processor for specific blocks or frames. In another implementation, encoder 100 may have a quantization block and an inverse quantization block combined into a single block.

2 shows an exemplary video decoder 200 configured to receive encoded image data 171 (eg, encoded bitstream), such as encoded by encoder 100, to obtain a decoded image 231.

The decoder 200 includes an input 202, an entropy decoding block 204, an inverse quantizer 210, an inverse transform block 212, a reconstruction block 214, a buffer 216, a contour filter 220, a decoded picture buffer 230, a prediction block 260, an inter prediction block 244, an intra prediction block 254 , block 262 mode selection and output 232.

Entropy decoding unit 204 is configured to perform entropy decoding of encoded image data 171 to obtain, for example, quantized coefficients 209 and/or decoded coding parameters (not shown in FIG. 2), for example, (decoded) any or all inter prediction parameters 143, an intra prediction parameter 153 and/or loop filter parameters.

In embodiments of decoder 200, inverse quantizer 210, inverse transform 212, restorer 214, buffer 216, loop filter 220, decoded picture buffer 230, predictor 260, and mode selector 262 are configured to perform the inverse processing of encoder 100 (and corresponding function blocks) to decode the encoded image data 171 .

In particular, inverse quantizer 210 may be identical in function to inverse quantizer 110, inverse transform 212 may be identical in function to inverse transform 112, restorer 214 may be identical in function to restorer 114, buffer 216 may be identical in function. buffer 116, the loop filter 220 may be identical in function to the loop filter 120 (with respect to the actual loop filter, since the loop filter 220 usually does not include a filter parser to determine filter parameters based on the original image 101 or block 103, but accepts (explicitly or implicitly ) or obtains the filter parameters used for encoding, for example, from entropy decoding block 204), and the decoded image buffer 230 may be identical in function to the decoded image buffer 130.

Prediction block 260 may comprise inter prediction block 244 and intra prediction block 254, in which inter prediction block 244 may be identical in function to inter prediction block 244 and intra prediction block 254 may be identical in function to intra prediction block 154. Predictor 260 and mode selector 262 are typically configured to perform block prediction and/or obtain prediction block 265 from encoded data 171 only (without any additional information about the original image 101) and receive or obtain (explicitly or implicitly) parameters 143 or 153 predictions and/or information about the selected prediction mode, for example, from block 204 entropy decoding.

The decoder 200 is configured to output the decoded image 231, for example, through the output 232 for presentation or viewing to the user.

Although embodiments of the invention have been primarily described in terms of video encoding, it should be noted that embodiments of encoder 100 and decoder 200 (and system 300, respectively) can also be configured to process or encode still pictures, i.e., process or encode a single image, independent of any preceding or subsequent image, as in video encoding. In general, in case the image encoding processing is limited to one image 101, only the inter-estimation 142, inter-prediction 144, 242 is not performed. equally used, for example, division, transformation (scaling) 106, quantization 108, inverse quantization 110, inverse transformation 112, intra estimation 142, intra prediction 154, 254 and/or loop filtering 120, 220, entropy encoding 170, and entropy decoding 204.

The present invention relates to the internal mechanisms of the deblocking filter, also referred to as the loop filter in FIG. 1 and FIG. Next will be a detailed description of the block 120, 220 of the loop filter, for example, based on Fig.6 or Fig.7 or Fig.10 - Fig.12 or Fig.15 - Fig.16.

Based on the successful concept of block-based hybrid video coding, video coding schemes such as H.264/AVC and HEVC have been developed. Using this principle, the image is first divided into blocks and then each block is predicted using intra or inter prediction. These blocks are encoded with respect to neighboring blocks and approximate the original signal with some degree of similarity. Since the encoded blocks only approximate the original signal, the difference between the approximations can cause discontinuities at the boundaries of the prediction and transform blocks. These inhomogeneities are suppressed by the deblocking filter. HEVC replaces the H.264/AVC macroblock structure with the concept of a coding tree unit (CTU) with a maximum size of 64x64 pixels. The CTU may be further partitioned by a quadtree decomposition scheme into smaller coding units (CUs), which may be partitioned down to a minimum size of 8 x 8 pixels. HEVC also introduces the concepts of Prediction Blocks (PBs) and Transform Blocks (TBs).

In HEVC, two filters are defined in the deblocking filter: a regular filter and a strong filter. The normal filter modifies no more than two samples on either side of the edge. In a strong filter, three additional checks are evaluated between samples at the edge and some pre-specified threshold. If all of these checks are correct, a strong filter is applied. A strong filter has a stronger anti-aliasing effect on edge samples and can only modify a maximum of three samples on either side of the edge.

ITU-T VCEG (Q6/16) and ISO/IEC MPEG (JTC 1/SC 29/WG 11) are studying the next generation video codec: Universal Video Coding (VVC). This new video codec standard aims for a compression capability that far exceeds the capabilities of the current HEVC standard (which includes its current extensions and short term extensions for screen content encoding and high dynamic range encoding). The groups work together on this research activity in a collaborative project known as the Joint Video Exploration Team (JVET) to evaluate compression technologies proposed by their experts in the field.

The VVC Test Model (VTM) describes the features that are undergoing a coordinated test model study by the Joint Video Research Team (JVET) of ITU-T VCEG and ISO/IEC MPEG as a potentially advanced video coding technology beyond the capabilities of HEVC.

The VTM software uses a new block partitioning scheme called Quadtree Plus Binary Tree Plus Triple Tree (QTBTTT).

The QTBTTT structure removes the concepts of several types of separation, that is, removes the separation of coding units (CUs), prediction units (PUs), and transform units (TUs). Therefore, CU = PU = TU.

QTBTTT supports more flexible CU partition shapes, in which the CU can be square or rectangular. The minimum width and height of a CU can be 4 samples, and the dimensions of a CU can also be 4 x N or N x 4, in which N can take values in the range [4, 8, 16, 32]. In addition, the largest CTU size has been increased to 128x128 pixels, which is 4 times larger than the CTU size in HEVC.

For rectangular CUs, distortion near the shorter edge can be evident, resulting in blocky artifacts even when a strong HEVC filter is applied. Block artifact can also be observed at the edge of large CUs where distortion is significant due to larger prediction and transform operations.

Additional Sub-pu tools (commonly referred to as sub-pu tools) such as Affine and ATMVP are now adapted to the Universal Video Coding (VVC) standard. In an implementation for sub-pu tools, especially Affine, deblocking can also be done for sub-pu edges/borders that overlap with an 8 x 8 grid. In another implementation for sub-pu tools, especially Affine, only sub-pu borders , which overlap with the 16 x 16 grid are subject to deblocking, all other sub-pu boundaries are not deblocked, i.e., for sub-pu boundaries that overlap with the 8 x 8 grid, are not deblocked, as shown in Fig. .fifteen. In another implementation, for sub-pu tools, especially Affine, the inner bounds of the first and last sub-pu are not subject to deblocking processing. All other sub-pu inner edges are subject to deblocking processing as shown in FIG. In other words, the solutions shown in Fig. 15 and Fig. 16 at least allow deblocking processing of some of the inner edges of the sub-pu to be performed. All of these implementations are mainly designed to accommodate the use of longer tap filters when one of the blocks that share a common edge uses sub-pu tools such as Affine or ATMVP.

4 illustrates the current operation of the deblocking filter (quadtree split plus binary tree plus ternary tree (QTBTTT)).

Figure 4 illustrates the technical challenge of applying a "longer tap-off filter" to sub-pu tools. The coding blocks 401, 402, also called P, Q, are two CUs, the CU size is 16x4 samples.

When filtering the edge CU (marked with a thick black line), a maximum of 7 samples are modified on either side of the edge CU. Therefore, the samples are modified from Q _0.0 to Q _6.0 . Also in the decision operation to apply deblocking of the sub-pu boundary, samples Q _7.0 Q _6.0 Q _5.0 (marked with a thin black line) are used. Therefore, the filtering generates an overlap and furthermore causes the edge deblocking operation to not be performed in parallel.

Therefore, it is necessary to perform deblocking filtering sequentially. This leads to very long processing times. This leads to unnecessarily long processing times, especially with the advent of new processing technologies using more and more parallel processing structures. By adapting deblocking filtering to parallel processing, significant processing time can be saved.

In more detail, parallelization of deblocking filtering can be achieved with an approach as illustrated in FIG. 5, FIG. 15, or FIG.

7.1. embodiments of the invention

Solution 1:

1.1 If the current Q block uses Sub-pu tools such as Affine or ATMVP, then the present invention uses an asymmetric version of the longer tap filter, i.e., an asymmetric filter is used to deblock the CU boundary between the P and Q blocks, as shown in the table one; basically, the coding block may use inter-prediction. In inter-prediction, there are several different tools that a coding block can use. Affine and ATMVP are two sub-pu tools. The sub-pu tools mean that a given coding block will additionally use smaller prediction blocks (sub-pus), and motion compensation is performed separately for each of the sub-pus. For example, given a 16x4 coding block, the affine tool uses 2 8x4 sub-puses (as shown in Figure 4) or 4 4x4 sub-puses. For example, given a 16x16 coding block, the affine tool uses 16 4 x 4 sub-pus or 4 8 x 8 sub-pus as shown in Fig. 17(a) and (b). Each of these sub-pus or sub-blocks uses separate motion vectors, as shown in Fig.18.

Therefore, for a Q coding block that uses Sub-pu tools, a maximum of three samples are modified, while for a coding block P, a maximum of 7 samples are modified. See FIG. 4 or FIG. 5, if the width of the coding block P is greater than 8 samples, such as 16 or 32 samples, the coding block P is modified to a maximum of 7 samples. It may be noted that in some scenarios, 3, 4, 5, or 6 samples may also be modified for the P, Q coding block.

The input pixels correspond to the pixel values or sample values used for filtering, and the output pixels correspond to the modified sample values. It should be noted that the input pixels can be successive pixels perpendicular to the block edge, starting from the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block. As illustrated in Table 1, in the example, the first output values (related to the Q coding block) correspond to q2, q1, q0; and the second output values (related to the P coding block) correspond to p0, p1, p2, ... p5, p6. Accordingly, Q coding block corresponds to the second image block that the sub-block tool uses, and P coding block corresponds to the first image block. Q coding block is the current block and P coding block is a neighboring block of the current block.

In addition, the filter condition (Equation 1) ensures that a maximum of 4 samples from the Q block are used to make the filter decision.

In the example for the first and fourth lines of the deblock segment:

(уравнение 1)

(equation 1)

Generally, the deblocking filter process may include three steps: border/edge detection, filtering decision (filter on/off decision), and filtering process for vertical and horizontal edges.

Only 4 samples are used to make a filtering decision (for Equation 1). Therefore, in equation 1 for Q block, only samples from q ₀ to q ₃ are used. In Equation 1, four samples can be used for the P block, as shown in Equation 1. In the example, the second decision values correspond to q3, q2, q1, q0; and the values of the first solution correspond to p0, p3, p4, p7, p0, p2, p3, p5.

If Equation 1 is satisfied, then a longer bypass filter as shown in Table 1 can be used. If Equation 1 is not satisfied, then a HEVC strong filter can be used. A maximum of 3 samples from the Q block are also modified, i.e., from q ₀ to q ₂ .. Basically, Equation 1 is considered to apply the longer tap filter. Only if Equation/Condition 1 is true, the longer tap filter shown in Table 1. It may be noted that Equation 1 can be used at step 707 in FIG. 7.

Equation 1 basically tests the gradient on both sides of the CU edge. Since only a maximum of 4 samples are available to make a filtering decision from the Q block, only samples from q ₀ to q ₃ are used from the Q block, in which β denotes a threshold parameter known, for example, from the HEVC standard. For the filtering condition, the value of the threshold parameter β depends on the quantization parameter QP. As already described above, QP is a well-known parameter in video coding standards that governs the trade-off between bit rate and video content quality. In an embodiment, QP may range from 0 to 51. In an embodiment, the processing circuitry of the filter apparatus 120, 220 is configured to determine a threshold parameter β based on the quantization parameter QP using a look-up table. In an embodiment, a lookup table may be defined as follows:

For more information on the threshold parameter β and its dependence on QP, reference is made to chapter 7 of the book "High Efficiency Video Coding (HEVC)" by Sze et al., which is incorporated herein by reference in its entirety.

1.2 If the adjacent P block uses Sub-pu tools such as Affine or ATMVP, then the present invention uses an asymmetric version of the longer tap filter, i.e., uses an asymmetric filter as shown in Table 2 to perform CU deblocking of the boundary between P and Q blocks;

Therefore, for the P coding block that uses the Sub-pu tools, a maximum of three samples are modified in the example, while for the current Q coding block, a maximum of 7 samples are modified.

The input pixels correspond to the pixel values or sample values used for filtering, and the output pixels correspond to the modified sample values. It should be noted that the input pixels can be successive pixels perpendicular to the block edge, starting from the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block. As illustrated in Table 2, in the example, the first output values (related to the P coding block) correspond to p2, p1, p0; and second output values (relating to coding block Q) correspond to q0, q1, q2, ... q5, q6. Accordingly, P coding block corresponds to the second image block that uses the sub-block tools, and Q coding block corresponds to the first image block. P coding block is the current block and Q coding block is a neighboring block of the current block.

Also, the filtering condition (Equation 2) ensures that only a maximum of 4 P block samples are used to make a filtering decision.

In the example for the first and fourth lines of the deblock segment:

(equation 2)

Generally, the deblocking filter process may include three steps: edge/edge detection, filtering decision (filter on/off decision), and filtering process for vertical and horizontal edges.

Only 4 samples can be used to make a filtering decision (for Equation 2). Therefore, in equation 2 for the P block, only samples from p ₀ to p ₃ are used. In Equation 2, four samples can be used for the Q block, as shown in Equation 2. In the example, the values of the second solution correspond to p ₃ , p ₂ , p ₁ , p ₀ ; and the values of the first solution correspond to q ₀ , q ₃ , q ₄ , q ₇ , q ₀ , q ₂ , q ₃ , q ₅ .

If Equation 2 is satisfied, then the longer bypass filter mentioned in Table 2 can be used. If Equation 2 is not satisfied, a HEVC strong filter can be used. Also, a maximum of 3 samples from the P block are modified here, that is, from p ₀ to p ₂ . Basically, to apply a longer tap filter, Equation 2 is considered. Only if Equation 2 is true, then the longer tap filter shown in Table 2 can be applied. It can be noted that Equation 2 can be used at step 707 in FIG.

It is allowed to use a maximum of 4 samples from the P block to make a filtering decision. Therefore, the samples p4, p5… p7 cannot be used and, therefore, the filtering coefficients of the samples p4, p5… p7 are equal to zero. Thus, p4, p5… p7 are not used in filtering operations.

Equation 2 basically tests the gradient on both sides of the box. Since no more than 4 samples are available to make a filtering decision from the P block, only samples p ₀ to p ₃ are used from the P block.

1.3 In an alternative implementation, the coefficients for p ₀ , p ₁ , p ₂ or q ₀ , q ₁ , q ₂ may also use strong filter HEVC coefficients. The coefficients for the case where the P coding block uses Sub-pu tools are shown in Table 3. In other words, the present invention can use an asymmetric version of a longer tap filter, that is, can use an asymmetric filter as shown in Table 3 to deblock CU boundaries between P and Q blocks. Accordingly, P coding block corresponds to the second image block and Q coding block corresponds to the first image block. P coding block is the current block and Q coding block is a neighboring block of the current block.

Alternatively, the coefficients for the p ₀ , p ₁ , p ₂ or q ₀ , q ₁ , q ₂ filter may also use the HEVC coefficients of the strong filter. Table 4 shows the filter coefficients for the case in which the Q coding block uses Sub-pu tools. In other words, the present invention may use an asymmetric version of the longer tap filter, that is, may use an asymmetric filter as shown in Table 4 to deblock the CU boundary between P and Q blocks. Accordingly, Q coding block corresponds to the second image block and P coding block corresponds to the first image block. Q coding block is the current block and P coding block is a neighboring block of the current block.

The filter condition used can be Equation 1 or Equation 2 depending on whether the P block or Q block uses sub-pu tools. For example, if the P block uses sub-pu tools, the filter condition is Equation 2; if the Q block uses sub-pu tools, the filtering condition is Equation 1;

1.4 If both Q coding block and P coding block use sub-pu tools, then the longer tap filter is no longer applied at the CU boundary. HEVC strong filter can be considered for CU edge (short for CE). The implementation modifies a maximum of 3 samples on the edge CU side in a P block, and updates a maximum of 3 samples on the other side of the edge CU in a Q block. Table 5 shows the filter used. In other words, the present invention can use the filter shown in Table 5 to deblock the boundary CU between P and Q blocks.

7 is a flowchart illustrating a method for determining whether to use a longer tap filter (or asymmetric long filter). As illustrated in FIG. 7, the strong filter HEVC condition must be met in order for the "longer tap filter" conditions to be met. At block 707, the details have been described above. The longer tap filter used in step 709 is different from the normal longer tap filter used in step 708, the details have been described above. The status of a standard longer bypass filter can be as follows:

In some examples, on top of the HEVC filter, the normal longer tap filter at step 708 uses 8 samples to make a filtering decision on each side of the edge, and 7 samples are modified on each side of the edge. However, the longer tap filter in step 709 uses the sample DB to make a filter decision on one side of the edge and the sample DA to make a filter decision on the other side of the edge, and on said one side of the edge, the MB samples are modified while on the other side of the edge, MA samples. MA ≠ MB, in particular MA < MB, e.g. MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. In general, DA = MA + 1; db = db + 1.

Fig. 8 illustrates the details for determining whether the strong filter condition HEVC is to be met. 8 is a flowchart showing the general deblocking filtering decision process for a block boundary, including decisions between strong and normal filtering.

In the first step 800, it is checked whether the edge of the currently filtered block is aligned with the 8×8 grid of coding samples. If so, then in the second step 801 it is checked whether the edge of the block to be filtered is a boundary between prediction blocks or transform blocks. If so, then in the third step 802 it is checked whether the boundary strength Bs > 0. If this condition is also satisfied, then in the fourth step 803 it is checked whether condition 7.1 is true.

Condition 7.1 is used to check whether deblocking filtering is applied to the block boundary or not. The condition specifically checks how much the signal on each side of the block boundary deviates from a straight line (sawtooth).

If this condition is not met, or if any of the checks in steps 800, 801, and 802 fail, then a decision is made in fifth step 804 that no filtering is performed.

In the sixth step 805 (not shown in FIG. 8), it is now checked whether the block size of either of the two blocks surrounding the edge to be filtered is equal to four. If this is not the case, at the seventh step 806 it is checked whether the additional conditions 7.2, 7.3 and 7.4 are satisfied.

Condition 7.2 checks for the absence of significant signal changes on the sides of the block boundary. Condition 7.3 checks whether the boundary is even on both sides. Condition 7.4 guarantees that the step between sample values on the sides of the block boundary will be small.

If all these conditions are true, strong filtering is performed in the eighth step 807, step 807 is directly replaced by step 702 in FIG. If it is not, at the ninth step 808 it is determined that normal filtering is being performed.

This solution enables part of the deblocking flowchart so that only one fetch modification is performed.

This can significantly reduce the number of checks required to determine if filtering is being performed and what type of filtering is being performed, in case at least one of the block sizes is an even integer 2 ⁿ that is greater than a threshold value (for example, 8 or 16, etc. .), especially if at least one of the block sizes is an even integer 2 ⁿ greater than 16.

To prevent filter overlap when a longer tap filter is applied to blocks, one or both of which use sub-pu tools such as Affine and ATMVP, the present invention proposes the following solutions.

Solution 1. Use an "asymmetric" filter that allows modification to MA samples for a block using sub-pu tools if the Q block or P block uses Sub-pu tools such as Affine or ATMVP, e.g. MA = 3, 4, 5 or 6.

Solution 2: For edge CU, a longer tap filter cannot be applied if both the Q coding block and the P coding block use Sub-pu tools. For the edge, a HEVC strong filter is considered. Therefore, for P and Q blocks, the same number of samples are modified on both sides of the CU edge, MA'=MB'.

Solution 3: Disable deblocking for sub-pu edges while only deblocking on CU edges if any of the Q block or P block is using Sub-pu tools like Affine or ATMVP.

Decisions 4 and 5: If one of the Q or P blocks is using Sub-pu tools like Affine or ATMVP, then not only is deblocking done on some of the Sub-pu edges, but it is also done on the CU edges.

Solution 4. In this solution, a longer tapped deblocking filter or all CU edges can be applied with a normal HEVC deblocking filter. For Sub-pu inner edges, only the edges that are overlapped by the 16 x 16 grid are deblocked. Sub-pu inner edges that are overlapped by the 8 x 8 grid are not deblocked. The main advantage of this solution is that a longer tap-off filter can be applied to some inner edges of the Sub-pu, except for the CU edges.

As shown in FIG. 15, the example includes three coding blocks (blocks) P, Q, R. The Q block uses sub-pu instruments such as Affine or ATMVP and therefore consists of a sub-pu inner edge. There are two coding block edges, one edge is shared between a P block (eg, CU P) and a Q block (eg, CU Q), and the other coding block edge is shared between a Q block (eg, CU Q) and an R block (eg, CU Q). , CU R). In order to apply a longer tap filter to the edge of the coding block without introducing filter overlaps and therefore without sacrificing parallel deblocking, the proposed solution only deblocks all inner sub-pu edges that overlap with the 16 x 16 grid. All other inner sub edges -pu does not subject deblocking to u. This situation is also depicted in FIG. 15, the dotted lines illustrate inner sub-pu edges that overlap with the 8 x 8 grid and do not deblock. The normal lines depict the inner edges of the sub-pu, which are overlaid with a 16 x 16 grid, so deblocking is applied to them. An important feature of this solution is that: a longer tap-off filter can be applied to CU edges and to inner sub-pu edges that are overlapped by a 16 x 16 grid.

P, Q, R block has a block size equal to M × N, or N × M, or L × T, or T × L, and N or T being an even integer 2 ⁿ greater than a threshold value (for example, 8 or 16 etc.). For example, the size (ie, width or height) of the P, Q, R block may be 32 or 64 samples.

For a 16 x 16 grid, at least one inner sub-pu edge that overlaps. In general, for smaller blocks, the inner edge of the first and last sub-pu overlapped by the 8x8 grid will only be one, and therefore cannot be deblocked. This is the situation depicted in Fig.4.

19 shows an 8 x 8 grid. An 8 x 8 grid will have vertical and horizontal lines separated by 8 samples. A 16 x 16 grid will have vertical and horizontal lines separated by 16 samples.

A sixth filter can be used, such as a longer tap filter that modifies a maximum of 7 samples on either side of the sub-block edge, i.e., NA'= NB' = 7. Incidentally, the HEVC normal deblocking filter can also be applied to all of these sub-pu edges that overlap with a 16 x 16 grid. Typically, a HEVC normal deblocking filter can modify a maximum of 3 samples on either side of an edge. When the HEVC normal deblocking filter is applied to these sub-pu edges that overlap with the 16 x 16 grid, the number of samples to be modified on each side of the sub-pu edges can be adapted according to different scenarios.

In Fig. 15, that is, for solution 4 (16 x 16 grid), the sixth filter may refer to the longer tap filter. The longer tap filter is a filter that modifies the same number of samples on either side of the edge. In this case any longer bypass filter with NA'= NB' = 7 can be used, i.e. a longer tap filter can modify no more than 7 samples on each side of the edge. If it is a longer tap filter, then NA'= NB' = 7. The longer tap filter modifies a maximum of 7 samples on either side of the sub-PU edge. You can also apply a HEVC normal filter. Samples internal to the sub-pu block are used to make the filtering decision and modify the filter.

Solution 5: In this solution, deblocking is disabled for the inner edges of the first and last sub-pu, such as an 8 x 8 grid overlay. For all other sub-pu edges, such as an 8 x 8 grid overlap, a fifth filter can be applied (eg HEVC normal deblocking filter or any other filter) that modifies up to a maximum of 4 samples. The longer tap deblocking filter can be safely applied to all edges of the CU.

As shown in Fig. 16, the example consists of three coding blocks (blocks) P, Q, R. The Q block uses sub-pu tools such as Affine or ATMVP and therefore consists of a sub-pu inner edge. There are two coding block edges, one edge is shared between the P block and the Q block, and the other edge of the coding block is shared between the Q block and the R block. In order to apply a longer tap filter to the edge of the coding block without introducing filter overlaps and therefore without sacrificing parallel deblocking, the solution only deblocks all inner sub-pu edges except for the edges of the first and last sub-pu. Also a fifth filter, such as a HEVC deblocking filter that modifies a maximum of 3 samples, or any other deblocking filter that modifies a maximum of 4 samples, can be used to deblock all other inner sub-pu edges except the edges of the first and last sub -pu. It should be noted that for the sub-pu inner edges in this solution 5 because each subsequent edge is only 8 samples apart, since we usually filter on an 8×8 grid. Therefore, in solution 5, one can use the HEVC normal deblocking filter, or any other filter that can modify up to a maximum of 4 samples.

In Fig. 16, that is, for solution 5 (except for the first and last), the fifth filter may also refer to the longer tap filter. The longer tap filter may be a filter that modifies the same number of samples on either side of the edge. In this case, any other longer tap filter can be used with NA = NB = 4. If it is a longer tap filter, then NA = NB = 4. The longer tap filter modifies a maximum of 4 samples on either side of the sub-PU edge. You can also apply a HEVC normal filter. Samples internal to the sub-pu block are used to make the filtering decision and modify the filter.

P, Q, R block has a block size of M × N or N × M or L × T or T × L, and N or T is an even integer 2 ⁿ greater than 8. For example, the size (such as width or height) The P, Q, R block may be 32 or 64 samples. In general, for smaller blocks, the inner edges of the first and last sub-pu overlap with the 8x8 grid will only be one, and therefore deblocking cannot be performed. This is the situation depicted in Fig.4.

For the edge of the first sub-pu and the edge of the last sub-pu between sub-blocks within the first P coding block or the second Q coding block, the edge of the first sub-pu is closest to one of the first P coding block and the second Q coding block, and the edge of the last sub- pu is closest to the other of the first P coding block and the second Q coding block;

The present invention applies equally well to both vertical edges and horizontal edges. The present invention can define the edge of the first sub-pu using the top left position (x, y) of the sub-pu block, and for the first vertical edge we can say that the top left position has (x + n, y + 8) in which n is edge increment, but their position is the same. For the last vertical edge, we can say that the position is near the position of neighboring blocks (p, q), then the position of the last vertical edge will start at (p + n, q- 8). For the horizontal edge, the opposite is true.

In summary, solutions can ensure that parallel deblocking operations can be performed and hence improve the subjective and objective quality of video encoding. Solution 3 calls for no deblocking for all sub-pu inner edges, while Solution 4 and Solution 5 at least apply deblocking for some of the sub-pu inner edges.

This approach is also shown in Fig.15 or Fig.16. In FIG. 5 shows an image 500 comprising two blocks 501, 502. A block edge 504 separates blocks 501 and 502. A block edge 505 separates block 502 into blocks 5021 and 5022. According to a first embodiment of the invention, seven sample values near block edge 504 within block 501 are modified. , and three sample values adjacent to block edge 504 within block 502, 5021 are modified, while on both sides of block edge 504, two consecutive sample values are used as filter inputs. 9 shows only the respective blocks 901 and 902 of the image 900, the same applies to the horizontal edges. The invention is applicable to all types of blocks to apply a longer tap-off filter, the invention is applicable to both vertical and horizontal edges, for example, vertical edges with a width > 8.

A future video coding standard may use a "long tap" filter that modifies more than 3 samples. Further, a "long tap" filter that uses 8 samples as filter inputs and modifies to 7 samples can be used whenever the block size is greater than or equal to 16 samples.

To ensure that parallel deblocking is possible in such a scenario where the current block uses subblock tools, the following improved mechanisms are proposed:

Mechanism 1a: apply the "long tap" filter when the current block size is ≥ 16 samples, and also when the adjacent block size is also ≥ 16 samples.

Mechanism 2a: apply an "asymmetric filter" as explained earlier.

Therefore, "Asymmetric Filter" modifies the samples used as input values and the modified values according to the block width:

For example: if

• block width == 4, then three samples can be used in the filter solution and one sample can be modified

• block width == 8, then 4 samples can be modified and used in the filtering solution

• for block width >= 16 a longer bypass filter can be applied,

as described earlier, for example, in the case where the current block uses subblock tools, no more than the number of MA sample values of the current block (which uses subblock tools) adjacent to the edge of the block per line are modified, and no more than the number of sample values of the adjacent block value MA are modified , adjacent to the edge of the block per line; MA ≠ MB, in particular MA < MB, for example, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. It can be understood that in a scenario in which the current block has sub-block tools, MA and MB may be determined based on the block size, in other words, MA and MB depend on the block size of the corresponding block. In the implementation for large blocks, ie, block size >= 32, the maximum modified number of samples can be 7 (corresponding to a long filter).

6 is a block diagram illustrating an exemplary deblocking filter apparatus 600 according to the techniques described herein (further details will be described below, for example, with reference to FIGS. 7, 8 or FIGS. 10, 11A, 11B, 12). The deblocking filter device 600 may be configured to perform deblocking methods in accordance with various examples described in the present invention. In general, one or both of the loop filters 120 in FIG. 1 and the loop filter 220 in FIG. 2 may include components substantially similar to those of the deblocking filter apparatus 600. Other video encoding devices, such as video encoders, video decoders, video encoders/decoders (CODEC), and the like, may also include components substantially similar to deblocking filter 600. The deblocking filter device 600 may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software or firmware, appropriate hardware (eg, one or more processors or processors and memory for storing instructions for the software or firmware) may also be provided.

In the example in FIG. 6, the deblocking filter apparatus 600 includes a deblocking determination block 604, support definitions 602 stored in memory, a deblocking filter block 606, deblocking filter parameters 608 stored in memory, an edge localization block 603, and an edge location data structure 605. . Any or all components of the deblocking filter 600 may be functionally integrated. The components of the deblocking filter 600 are shown separately for illustration purposes only. In general, the deblocking filter 600 receives data for the decoded blocks, for example, from a summation component 114, 214, which combines the prediction data with the residual data for the blocks. The data may further include an indication of how the blocks were predicted. In the example described below, the deblocking filter apparatus 600 is configured to receive data including a decoded video block associated with a CTB (or LCU) and a CU quadtree for the CTB, in which the CU quadtree describes how the CTB is partitioned into CUs. and prediction modes for PUs and TUs of leaf node CUs.

The deblocking filter device 600 may maintain the edge location data structure 605 in the memory of the deblocking filter device 600 or in an external memory provided by an appropriate video encoder. In some examples, edge localizer 603 may receive a quadtree corresponding to a CTB that indicates how the CTB is split into CUs. An edge localizer 603 may then parse the CU quadtree to determine edges between decoded video blocks associated with TUs and PUs of CUs in the CTB that are candidates for deblocking.

The edge location data structure 605 may contain an array having a horizontal size, a vertical size, and a size representing the horizontal edges and the vertical edges. In general, edges between video blocks may occur between two video blocks associated with the smallest CTB size CUs or TUs and PUs for CUs. Assuming the CTB is of size N × N, and assuming the CU of the smallest CTB is of size M × M, the array may contain a size of [N/M] × [N/M] × 2, in which "2" represents two possible edge directions between CUs (horizontal and vertical). For example, assuming the CTB is 64×64 pixels and the smallest CU is 8×8, the array could contain [8]×[8]×[2] entries.

Each entry can typically correspond to a possible edge between two video blocks. In fact, edges may be missing at each of the positions within the LCU corresponding to each of the entries in the edge location data structure 605. Accordingly, the values of the data structure can be initialized as false. In general, the edge localizer 603 may parse the CU quadtree to determine the edge locations between two video blocks associated with the TUs and PUs of the CTB CUs and set the corresponding values in the edge location data structure 605 to true.

In general, the array entries may describe whether a corresponding edge exists in the CTB as a deblocking candidate. That is, when the edge localizer 603 determines that if there is an edge between two adjacent video blocks associated with TUs and PUs from CTB CUs, the edge localizer 603 may set the value of the corresponding entry in the edge location data structure 605 to indicate the presence of an edge (e.g., meaning "true").

Deblocking determination block 604 generally determines whether to perform edge deblocking between two blocks for two adjacent blocks. Deblocking determiner 604 may determine edge locations using edge location data structure 605 . When the value of the edge location data structure 605 is a Boolean value, the deblocking determiner 604 may determine that a "true" value indicates the presence of an edge, and a value of "false" indicates that an edge is missing in some examples.

In general, the deblocking determination block 604 is configured with one or more deblocking determination functions. The features may include a plurality of coefficients applied to lines of pixels that cross an edge between blocks. For example, the functions may be applied to a row of pixels that is perpendicular to an edge in which MA (eg, 3, 4, or 5) pixels are in one of the two blocks and MB (eg, 7) pixels are in the other of the two blocks. Support definitions 602 define feature support. In general, "support" corresponds to the pixels to which the features are applied.

Deblocking determiner 604 may be configured to apply one or more deblocking determination functions to one or more support sets, as determined by support definitions 602, to determine whether a particular edge between two blocks of video data should be deblocked. The dotted line emanating from the deblocking determination block 604 represents data for blocks output without filtering. In cases where the deblocking determiner 604 determines that an edge between two blocks is not to be filtered, the deblocking filter 600 may output data for the blocks without changing the data. That is, the data can bypass the deblocking filter block 606 . On the other hand, when the deblocking determiner 604 determines that an edge is to be deblocked, the deblocking determiner 604 may cause the deblocking filtering block 606 to filter neighboring pixel values to perform edge deblocking.

The deblock filter block 606 retrieves the deblock filter definitions from the deblock filter parameters 608 for the edges to be deblocked, as indicated by the deblock determine block 604 . In general, edge filtering uses pixel values from the vicinity of the current edge to be deblocked. Therefore, both deblocking decision functions and deblocking filters can have a defined support area on both sides of the edge. By applying a deblocking filter to pixels in the vicinity of an edge, the deblocking filter block 606 can smooth pixel values by suppressing high-frequency transitions near the edge. Thus, applying deblocking filters to pixels near the edge can reduce the deblocking artifacts near the edge.

10 is a flowchart illustrating an exemplary deblocking method according to the techniques described in the present invention (further details will be described below, for example, with reference to FIGS. 7, 8).

10 shows an embodiment of the deblocking method.

In a first step 1001, inter-block edges are determined, wherein the inter-block edges comprise a block edge between the first coding block and the second coding block, and a sub-block edge between sub-blocks of the first coding block or the second coding block (e.g., the first coding block or the second coding block has sub-blocks, or the first coding block or the second coding block has sub-block tools), in which the first coding block has a block size of M × N or N × M, the second coding block has a size of L × T or T × L, and N or T is an even integer 2 ⁿ exceeding a threshold value (for example, 8 or 16, etc.);

In the second step 1002, it is determined whether the block edge between the first coding block and the second coding block should be filtered by applying the first filter (longer tap filter or asymmetric filter or asymmetric long filter or asymmetric tap filter); in other words, it is determined whether block edge deblocking is performed between the first coding block and the second coding block by applying the first filter (i.e., a longer tap filter or an asymmetric filter or an asymmetric tap filter or an asymmetric long filter);

In a third step 1003, a first filter (a longer tap filter, or an asymmetric filter, or an asymmetric tap filter, or an asymmetric longer tap filter) is applied to the sample values (i.e., input pixels) near the block edge between the first coding block and the second coding block. when it is determined that the block edge between the first coding block and the second coding block is to be filtered by applying the first filter, in which in the case where the first coding block has subblocks (or the first coding block has subblock tools, the first codingblock is the current block, and the second coding block is a neighboring block of the current block), no more than the number MA of sample values of the first coding block adjacent (i.e., perpendicular to) the block edge per row is modified, and no more than the number MB of sample values of the second coding block adjacent (i.e., e. perpendicular) to the edge of the block per line; or, in the case where the second coding block has sub-blocks (or the second coding block has sub-block tools, the second coding block is the current block, and the first coding block is a neighboring block of the current block), at most the number MA of second coding block sample values adjacent to ( i.e., perpendicular) to the block edge per line, and no more than the number of MB of sample values of the first coding block adjacent (i.e., perpendicular) to the block edge per line, MA ≠ MB, in particular, MA < MB, for example, MA < MB = 7.

For example, MA = 3 and MB = 7,

MA = 4 and MB = 7, or

MA = 5 and MB = 7.

It can be understood that in a scenario in which the current block has sub-block tools, MA and MB may be determined based on the block size, in other words, MA and MB depend on the block size of the corresponding block. In the implementation for large blocks, ie, block size >= 32, the maximum number of modified samples can be 7 (corresponding to a long filter).

The input pixels correspond to the pixel values or sample values used for filtering, and the output pixels correspond to the modified sample values. It should be noted that the input pixels may be consecutive pixels perpendicular to the block edge, starting at the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block.

In the following description, reference may be made to previously described details of the deblocking method and will not be repeated.

Fig. 11A is a flowchart illustrating another exemplary deblocking method according to the technologies described herein (further details will be described below, for example, with reference to FIGS. 7, 8).

In FIG. 11A shows another version of the deblocking method.

In a first step 1101, edges between blocks are determined, in which edges between blocks comprise a block edge between the first coding block and the second coding block, and a sub-block edge between sub-blocks of the first coding block or the second coding block, in which the first coding block has a size of M × N or N × M, the second coding block has a size of L × T or T × L, and N or T is an even integer 2 ⁿ greater than a threshold value (eg, 8 or 16, etc.);

In the second step 1102, it is determined whether the block edge between the first coding block and the second coding block should be filtered by applying the first filter (longer tap filter or asymmetric filter or asymmetric tap filter or asymmetric long filter); in other words, it is determined whether block edge deblocking is performed between the first coding block and the second coding block by applying the first filter (longer tap filter or asymmetric filter or asymmetric tap filter or asymmetric long filter);

In a second step 1103, a third filter is applied to the sample values (i.e., input pixels) near the block edge between the first coding block and the second coding block when it is determined that the block edge between the first coding block and the second coding block is not to be filtered by applying the first filter. , in which at most MA number of sample values of the first coding block adjacent (i.e., perpendicular to) the block edge per line are modified, and at most MB number of samples of the value of the second coding block adjacent (i.e., perpendicular to) the block edge per line are modified , MA = MB, e.g. MA = MB = 4.

It can be understood that the first coding block is the current block and the second coding block is a neighboring block of the current block, or the second coding block is the current block and the first coding block is a neighboring block of the current block.

The input pixels correspond to the pixel values or sample values used for filtering, and the output pixels correspond to the modified sample values. It should be noted that the input pixels can be successive pixels perpendicular to the block edge, starting from the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block.

Further reference may be made to previously disclosed details of an exemplary deblocking method and repetition are omitted.

Fig. 11B is a flowchart illustrating another exemplary deblocking method according to the technologies described herein (further details will be described below, for example, with reference to FIGS. 7, 8).

In FIG. 11B shows another version of the deblocking method.

In a first step 1121, the inter-block edges are determined, in which the inter-block edges comprise a block edge between the first P coding block and the second Q coding block, and a sub-block edge between sub-blocks of the first P coding block or the second Q coding block, in which the first P coding block has a size M × N or N × M, the second Q coding block has a block size of L × T or T × L, and N or T is an even integer 2 ⁿ greater than a threshold value (eg, 8 or 16, etc.);

In a second step 1122, it is determined that a subblock edge between subblocks of the first P coding block or the second Q coding block is not to be filtered; in other words, it is determined that a sub-block edge between sub-blocks of the first P coding block or the second Q coding block is not subject to deblocking;

In the third step 1123, a fourth filter (eg, a normal longer tap filter) is applied to the sample values (i.e., input pixels) near the block edge between the first P coding block and the second Q coding block, in which the number MA of sample values of the first coding block is modified , adjacent (i.e., perpendicular) to the block edge, and the number of MB sample values of the second coding block adjacent (i.e., perpendicular to) the block edge, MA = MB = 7, is modified.

Obviously, the first coding block is the current block and the second coding block is a neighboring block of the current block, or the second coding block is the current block and the first coding block is a neighboring block of the current block.

The input pixels correspond to the pixel values or sample values used for filtering, and the output pixels correspond to the modified sample values. It should be noted that the input pixels can be successive pixels perpendicular to the block edge, starting from the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block.

Fig. 12 is a flowchart illustrating another exemplary deblocking method according to the technologies described in the present invention (further details will be described below, for example, with reference to Figs. 7, 8, 10, 11A, 11B, 12 and Fig. 15 , 16).

In FIG. 12 shows another version of the deblocking method.

In the first step 1201, the inter-block edges in which the inter-block edges are determined comprise a block edge between the first P coding block and the second Q coding block, and a sub-block edge between sub-blocks within the first P coding block and/or the second Q coding block, in which the first P coding block coding block has size M × N or N × M, the second Q coding block has size L × T or T × L, for example, N or T be an even integer 2 ⁿ greater than a threshold value (for example, 8 or 16, etc. .);

In a second step 1202, it is determined that the block edge between the first P coding block and the second Q coding block and the first set of subblock edges between subblocks within the first P coding block and/or the second Q coding block are to be filtered, and the second set of subblock edges between subblocks within the first P coding block and/or the second Q coding block shall not be filtered; and

In a third step 1203, deblocking filtering is performed on sample values near a block edge between the first P coding block and the second coding block Q, and deblocking filtering is performed on sample values near each of the first set of subblock edges between subblocks within the first coding block P and/ or a second Q coding block.

Obviously, the first coding block is the current block and the second coding block is a neighboring block of the current block, or the second coding block is the current block and the first coding block is a neighboring block of the current block.

The input pixels correspond to the pixel values or sample values used for filtering and the output pixels correspond to the modified sample values. It should be noted that the input pixels can be successive pixels perpendicular to the block edge, starting from the block edge. In addition, the output pixels may be successive pixels perpendicular to the edge of the block, starting at the edge of the block.

As shown in FIG. 16, the first set of subblock edges between subblocks within the first coding block and/or the second coding block comprises (consists of) a plurality of subblock edges except for the first subblock edge and the last subblock edge between subblocks within the first P coding block and/ or a second Q coding block, in which the edge of the first subblock is closest to one of the first P coding block and the second Q coding block, and the last edge of the subblock is closest to the other of the first P coding block and the second Q coding block;

the second set of subblock edges between subblocks within the first coding block and/or the second coding block consists of the first subblock edge and the last subblock edge between subblocks within the first P coding block and/or the second Q coding block in which the first subblock edge is closest to one of the first P coding block and the second Q coding block, and the edge of the last sub-block is closest to the other of the first P coding block and the second Q coding block.

In a second step 1203, the step of performing deblocking filtering on sample values near each of the first set of subblock edges between subblocks of the first P coding block and/or the second Q coding block comprises:

applying a fifth filter to the sample values near each of the first set of subblock edges within the first P coding block and/or the second Q coding block, in which at most NA number of sample values on one side of the corresponding block from the first set of subblock edges within the first P coding block are modified and/or a second Q coding block, and no more than the number NB of sample values on the other side of the corresponding one of the first edge subblock set, NA = NB = 4, are modified.

If there are no subblock edges between subblocks within the first P coding block, and if there are multiple subblock edges between subblocks within the second Q coding block, in a second step 1203 a step of performing deblocking filtering on sample values near each of the first set of subblock edges between subblocks within the first The P of the coding block and/or the second Q of the coding block contains:

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения, когда принято решение применять пятый фильтр для HEVC фильтрации удаления блочности:filtered value definition

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal edge of the sub-block within the second Q coding block based on the following equation, when it is decided to apply the fifth filter for HEVC deblocking filtering:

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i = 0, 1, j = 0, 1..3 .

As shown in FIG. 15, the first set of subblock edges between subblocks within the first coding block and/or second coding block comprises (consists of) one or more subblock edges that overlap with a 16 x 16 grid between subblocks within the first P coding block and/ or a second Q coding block;

the second set of subblock edges between subblocks within the first or second coding block comprises (consists of) one or more subblock edges, excluding subblock edges that overlap with a 16 x 16 grid between subblocks within the first P coding block and/or the second Q coding block.

Accordingly, in the second step 1203, the step of performing deblocking filtering on sample values near each of the first set of subblock edges between subblocks of the first P coding block and/or the second Q coding block comprises:

applying a sixth filter to the sample values adjacent to each of the first set of subblock edges within the first P coding block and/or the second Q coding block that modifies at most NA' of sample values on one side of the corresponding one of the first set of subblock edges within the first P of a coding block or a second Q coding block, and no more than the number NB' of sample values on the other side of the corresponding one of the first edge subblock set, NA'=NB' = 7, is modified.

If there is no subblock edge between subblocks within the first P coding block, and if there are multiple subblock edges between subblocks within the second Q coding block (for example, if the first P coding block has no subblocks, but the second Q coding block has subblocks),

Accordingly, in the second step 1203, the step of performing deblocking filtering on sample values near each of the first set of subblock edges between subblocks within the first P coding block and/or the second Q coding block comprises:

выборки соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования на основании следующего уравнения:filtered value definition

samples of the corresponding sample of the current row or column of samples on the corresponding side of the vertical or horizontal sub-block edge within the second Q coding block based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

In the case of having a plurality of subblock edges between subblocks within a first P coding block and having a plurality of subblock edges between subblocks within a second Q coding block, in a second step 1203 a step of performing deblocking filtering at sample values around each of the first set of subblock edges between subblocks within the first P coding block and/or second Q coding block, contains:

и

соответствующей выборки текущей строки или столбца выборок на соответствующей стороне вертикального или горизонтального края субблока внутри второго Q блока кодирования и первого Р блока кодирования соответственно на основании следующего уравнения:filtered value definition

and

of the corresponding sample of the current row or column of samples on the respective side of the vertical or horizontal sub-block edge within the second Q coding block and the first P coding block, respectively, based on the following equation:

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

; и/или

; and/or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

The deblocking method according to the embodiments further comprises:

determining whether to filter a block edge between the first P coding block and the second Q coding block by applying the first filter; and the first filter is applied to the sample values near the block edge between the first P coding block and the second Q coding block when it is determined that the block edge between the first P coding block and the second Q coding block is to be filtered by applying the first filter in which at most the number MA of sample values of the first coding block adjacent to the block edge per line, and is modified by no more than the number MB of sample values of the second coding block adjacent to the block edge per line; or at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the edge of the block per line is modified, MA ≠ MB , in particular MA < MB, for example, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7.

In the case where there are multiple subblock edges between subblocks within the first coding block and if there are multiple subblock edges between subblocks within the second coding block, the method further comprises:

determining that a block edge between the first coding block and the second coding block is to be filtered by applying a second filter; and a second filter is applied to sample values near a block edge when it is determined that a block edge between the first coding block and the second coding block is to be filtered by applying a second filter in which the sample number MA' of the value of the first coding block adjacent to the block edge is modified, and the number of sample values MB' of the second coding block adjacent to the edge of the block, MA'=3 and MB'=3, is modified.

When there is no subblock edge between subblocks in the second coding block, at most the number MA of sample values of the first coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the second coding block adjacent to the block edge per line is modified, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7;

or

when there is no subblock edge between subblocks within the first coding block, at most the number MA of sample values of the second coding block adjacent to the block edge per line is modified, and at most the number MB of sample values of the first coding block adjacent to the block edge per line is modified, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7.

The method, further comprising: determining whether a block edge between the first coding block and the second coding block should be filtered by applying the first filter based on

- no more than the number DA of sample values of the first coding block adjacent to the edge of the block as the decision values of the first filter, DA = 4 and

- no more than the number DB of sample values of the second coding block adjacent to the edge of the block as decision values of the second filter, DB = 4.

If there are multiple sub-block edges between sub-blocks within the second Q coding block, the method further comprises: determining if the first condition defined by the following first equation is satisfied:

in which β denotes the threshold parameter and q _i represent the sample values of the second Q coding block, i = 0,1,2,3 and p _j represent the sample values of the first P coding block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5.

If there is a plurality of sub-block edges between sub-blocks within the first P coding block, the method further comprises: determining whether the second condition is satisfied, as defined by the following second equation:

where β denotes the threshold parameter and p _i represents the sample values of the first P coding block, i = 0,1,2,3 and q _j represent the sample values of the second Q coding block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5.

The threshold parameter β is determined based on the quantization parameter, QP, associated with the quantization step size of the plurality of samples, or

the threshold parameter β is determined based on the quantization parameter, QP, using a look-up table.

If there is no subblock edge between subblocks within the first P coding block, and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering on sample values near the block edge between the first P coding block and the second Q coding block comprises:

выборки первой выборки текущей строки или столбца выборок справа или снизу от вертикального или горизонтального края между первым Р блоком кодирования и вторым Q блоком кодирования на основании следующего уравнения:filtered value definition

samples of the first sample of the current row or column of samples to the right or below the vertical or horizontal edge between the first P coding block and the second Q coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

If there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering on sample values near the block edge between the first P coding block and the second Q coding block comprises:

выборки второй выборки текущей строки или столбца выборок справа или снизу от вертикального или горизонтального края между первым Р блоком кодирования и вторым Q блоком кодирования на основании следующего уравнения:filtered value definition

samples of the second sample of the current row or column of samples to the right or below the vertical or horizontal edge between the first P coding block and the second Q coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block q _j represents the corresponding sample value of a portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

If there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering on sample values near the block edge between the first P coding block and the second Q coding block comprises:

выборки третьей выборки текущей строки или столбца выборок справа или снизу от вертикального или горизонтального края между первым Р блоком кодирования и вторым Q блоком кодирования на основании следующего уравнения:filtered value definition

samples of the third sample of the current row or column of samples to the right or below the vertical or horizontal edge between the first P coding block and the second Q coding block based on the following equation:

;

;

or

;

;

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

If there is no subblock edge between subblocks within the first P coding block and if there is a subblock edge between subblocks within the second Q coding block, the step of performing deblocking filtering on sample values near the block edge between the first P coding block and the second Q coding block comprises:

выборки соответствующей выборки текущей строки или столбца выборок слева или вверху от вертикального или горизонтального края между первым и вторым блоком кодирования на основании следующего уравнения:filtered value definition

samples of the corresponding sample of the current row or column of samples to the left or top of the vertical or horizontal edge between the first and second coding block based on the following equation:

,

,

,

,

,

,

,

,

,

,

,

,

,

,

in which p _i represents the corresponding sample value of a portion of the current row or column of samples of the first P coding block and q _j represents the corresponding sample value of the portion of the current row or column of samples of the second Q coding block, i, j = 0, 1..7.

The deblocking method according to the embodiments further comprises:

determining whether to filter a block edge between the first P coding block and the second Q coding block by applying the first filter; and a third filter is applied to sample values near a block edge between the first P coding block and the second Q coding block when it is determined that the block edge between the first P coding block and the second Q coding block is not to be filtered by applying a first filter in which not more than the number MA of sample values of the first coding block adjacent to the block edge per line, and modified by at most the number MB of sample values of the second coding block adjacent to the block edge per line, MA = MB = 4.

Obviously, the first filter, the second filter, the third filter, the fourth filter, the fifth filter and the sixth filter correspond to different block edge filtering. In other words, all the different filters use as input and output samples: samples that are perpendicular to and adjacent to a given block edge. Moreover, different filters use different number of maximum filter samples as input and also modify different number of maximum filter samples as filter output.

FIG. 13 is a simplified block diagram of a device 1300 that can be used as one or both source device 310 and destination device 320 of FIG. 3 according to an exemplary embodiment. Device 1300 may implement the methods of the present invention. Device 1300 may be implemented in the form of a computing system including multiple computing devices, or in the form of a single computing device, such as a mobile phone, tablet computer, laptop computer, laptop computer, desktop computer, and so on.

Processor 1302 of device 1300 may be a central processing unit. Alternatively, processor 1302 may be any other type of device or a plurality of devices capable of manipulating or processing information that currently exists or will be developed in the future. Although the disclosed implementations may be implemented with a single processor, as illustrated by processor 1302, for example, speed and efficiency advantages may be achieved using more than one processor.

In the present invention, memory 1304 in device 1300 may be a read only memory (ROM) device or a random access memory (RAM) device. Memory 1304 may be any other suitable type of storage device. Memory 1304 may be used to store code and/or data 1306 accessed by processor 1302 over bus 1312. Memory 1304 may further be used to store operating system 1308 and application programs 1310. Application programs 1310 may include at least one a program that allows the processor 1302 to perform the methods described herein. For example, application programs 1310 may include applications 1 through N and further include a video encoding application that performs the methods described herein. Device 1300 may also include additional memory in the form of secondary storage 1314, which may, for example, be a memory card used with a mobile computing device. Because video communications may contain a significant amount of information, they may be stored in whole or in part in storage 1314 and loaded into memory 1304 as needed for processing.

Device 1300 may also include one or more output devices, such as a display 1318. Display 1318 may be, in one example, a touch display that combines a display with a touch element capable of recognizing touch inputs. Display 1318 may be coupled to processor 1302 via bus 1312. In addition to, or alternatively, display 1318, other output devices may be provided that allow a user to program or otherwise use device 1300. When an output device is or includes a display, The display may be implemented in a variety of ways, including a liquid crystal display (LCD), a cathode ray tube (CRT) display, a plasma display, or a light emitting diode (LED) display such as an organic light emitting diode (OLED) display.

The device 1300 may also include or interface with an imaging device 1320, such as a camera, or any other imaging device 1320 currently in use or developed in the future, that can capture an image, such as an image of the user operating device 1300. The imaging device 1320 may be positioned to point towards the user control device 1300. In an example, the position and optical axis of imaging device 1320 may be configured such that the field of view includes an area immediately adjacent to display 1318 and from which display 1318 is visible.

The device 1300 may also include a sound detection device 1322, such as a microphone, or any other sound detection device currently or in the future that can sense sounds in the vicinity of the device 1300 or interact with it. The sound detection device 1322 may be positioned to point toward the user's control device 1300 and may be configured to receive sounds, such as speech or other sounds, made by the user when the user operates the device 1300.

Although FIG. 13 depicts processor 1302 and memory 1304 of device 1300 as integrated into a single device, other configurations may be used. The operations of processor 1302 may be distributed across multiple machines (each machine having one or more processors), which may be connected directly or through a local area or other network. Memory 1304 may be distributed across multiple machines, such as network storage or memory on multiple machines performing the operations of device 1300. Although a single bus is depicted here, bus 1312 of device 1300 may contain multiple buses. In addition, secondary storage 1314 may be directly connected to other components of the device 1300 or may be accessed via a network and may contain one integrated unit, such as a memory card, or more units, such as multiple memory cards. Thus, device 1300 can be implemented in a wide variety of configurations.

14 is a diagram of an exemplary encoder 1400 for encoding video according to an embodiment of the present invention. Encoder 1400 is configured to implement the disclosed embodiments as described herein. In an embodiment, encoder 1400 may be a decoder such as video decoder 200 of FIG. 2 or an encoder such as video encoder 100 of FIG. In an embodiment, encoder 1400 may be one or more components of video decoder 200 of FIG. 2 or video encoder 100 of FIG. 1, as described above.

Encoder 1400 includes input ports 1420 and receiver (Rx) units 1410 for receiving data; a processor, logical unit, or central processing unit (CPU) 1430 for processing data; blocks 1440 transmitter (Tx) and output ports 1450 for data transmission; a memory 1460 for storing data. Encoder 1400 may also include optical-electrical (OE) components and electrical-optical (EO) components connected to input ports 1420, receiver units 1410, transmitter units 1440, and output ports 1450 for outputting or inputting optical or electrical signals. In some examples, encoder 1400 may also include wireless transmitters and/or receivers.

The processor 1430 is implemented in hardware and software. Processor 1430 may be implemented as one or more CPU chips, cores (eg, as a multi-core processor), field-programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), and digital signal processors (DSPs). The processor 1430 is connected to input ports 1420, receiver units 1410, transmitter units 1440, output ports 1450, and memory 1460. Processor 1430 includes an encoder 1414. Encoding module 1414 implements the embodiments disclosed above. For example, encoding module 1414 implements, processes, prepares, or provides various encoding operations. Thus, using the encoder 1414 provides a significant improvement in the functionality of the encoder 1400 and causes the encoder 1400 to be converted to another state. Alternatively, encoding module 1414 is implemented as instructions stored in memory 1460 and executed by processor 1430 (eg, as a computer program product stored on a persistent storage medium).

The memory 1460 contains one or more disks, tape drives, and solid state drives and can be used as an overflow storage device, for storing programs when such programs are selected for execution, and for storing instructions and data that are being read. during program execution. Memory 1460 may be 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). Encoder 1400 may also have an input/output (I/O) device for interaction with the end user. For example, encoder 1400 may include a display such as a monitor for visual output, speakers for audio output, and a keyboard/mouse/trackball, etc. for user input.

The present invention has been described in conjunction with various embodiments. However, other variations of the disclosed embodiments may be understood and practiced by those skilled in the art in the practice of the claimed invention based on examination of the drawings, description, and appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite article "a" or "an" does not exclude plurality. One processor or other device can perform the functions of several elements specified in the claims. The mere fact that certain measures are set forth in generally different dependent claims does not mean that a combination of these measures cannot be used to advantage. The computer program may be stored/distributed on a suitable medium, such as an optical storage medium or solid state media provided with or as part of other equipment, but may also be distributed in other forms, such as over the Internet or other wired or wireless communication systems.

In the text of this document, in which embodiments and descriptions refer to the term "memory", the term "memory" should be understood and / or should contain [list of all possible storage devices] magnetic disk, optical disk, read-only memory , ROM) or RAM (Random Access Memory, RAM),…, unless otherwise specified.

In the text of this document, in which embodiments and description refer to the term "network", the term "network" should be understood and/or should contain [a list of all possible networks]... unless explicitly stated otherwise.

It will be apparent to one skilled in the art that the "units" in the various drawings (method and apparatus) represent or describe the functionality of embodiments of the invention (rather than necessarily individual "blocks" in hardware or software) and thus describe equally the functions or features of device embodiments as well as method embodiments (block = step).

The terminology "blocks" is used merely for illustrative purposes of the functionality of encoder/decoder embodiments and is not intended to limit the present invention.

In several embodiments presented in the present invention, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the device embodiment described is merely exemplary. For example, the division into blocks is simply a division of logical functions and may be another division in the actual implementation. For example, many blocks or components may be combined or integrated into another system, or certain functions may be ignored or not performed. Additionally, displayed or discussed reciprocal links or direct links or communication connections can be implemented using some interfaces. Indirect links or communication connections between devices or units may be implemented in electronic, mechanical or other forms.

Blocks described as separate parts may or may not be physically separate, and parts displayed as blocks may or may not be physical blocks, may be located in the same position, or may be distributed over multiple network blocks. Some or all of the blocks may be selected according to actual needs in order to achieve the goals of the solutions of the embodiments.

Additionally, the functional blocks in the embodiments of the present invention may be integrated into one processing unit, or each of the units may be physically used separately, or two or more units may be combined into one unit.

Embodiments of the invention may further comprise an apparatus, such as an encoder and/or decoder, that includes a processing circuit configured to perform any of the methods and/or processes described herein.

Embodiments may be implemented as hardware, firmware, software, or any combination thereof. For example, encoder/encoder or decoder/decoder functionality may be performed by a processing circuit with or without firmware or software, such as a processor, microcontroller, digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit ( ASIC) etc.

The functionality of encoder 100 (and corresponding encoding method 100) and/or decoder 200 (and corresponding decoding method 200) may be implemented using program instructions stored on a computer-readable medium. Program instructions, when executed, cause a processing circuit, a computer, a processor, or the like. perform steps of encoding and/or decoding methods. The computer-readable medium may be any medium including a permanent storage medium on which the program is stored, such as a Bluray disc, DVD, CD, USB (flash drive), hard disk, server storage accessible via a network, etc.

An embodiment of the invention comprises a computer program containing program code for performing any of the methods described herein when executed on a computer.

An embodiment of the invention comprises or is a computer-readable medium containing program code that, when executed by a processor, causes a computer system to perform any of the methods described herein.

In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored or transmitted as one or more instructions or code on a computer-readable medium and executed by a hardware processor. A computer-readable medium may include a computer-readable medium that corresponds to a tangible medium, such as a data medium, or a communication medium, including any medium that facilitates the transfer of a computer program from one place to another, such as according to a communication protocol. Thus, computer-readable media can typically correspond to (1) tangible computer-readable storage media that are non-volatile, or (2) communication media such as a signal or carrier wave. Storage media can be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code, and/or data structures for implementing the methods described in this invention. The computer program product may include a computer readable storage medium.

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 or other magnetic storage devices, flash memory, or any other media which can be used to store the necessary program code in the form of instructions or data structures and can be accessed by a computer. Additionally, any connection is properly referred to as a computer-readable storage 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, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave should be considered as the medium. However, it should be understood that computer-readable storage media and storage media do not include connections, carrier waves, signals, or other temporary media, but are instead nonvolatile tangible storage media. The disc and disc used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray disc, in which discs usually reproduce data magnetically, and discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer readable media.

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 gate arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Accordingly, the term "processor" as used herein may refer to any of the aforementioned structures, or any other structure suitable for implementing the described methods. Additionally, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured to encode and decode or contained in a combined codec. Additionally, the methods may be fully implemented in one or more circuits or logic elements.

The methods of the present invention may be implemented in a wide variety of devices or devices, including a wireless telephone, an integrated circuit (IC), or a set of ICs (eg, a chipset). This invention describes various components, modules, or blocks to emphasize the functional aspects of devices capable of performing the disclosed technologies, but not necessarily requiring implementation in different hardware blocks. Rather, as described above, the various blocks may be combined into a codec hardware block, or provided with a set of cooperating hardware blocks, including one or more processors, as described above, in combination with suitable software and/or firmware.

Although the present invention presents several embodiments, it should be understood that the disclosed systems and methods can be embodied in many other specific forms, without going beyond the scope of the present invention. The present examples are to be considered as illustrative and not restrictive, and the present invention is not limited to the details provided herein. For example, various elements or components may be combined or integrated into another system, or certain features may be omitted or not implemented.

Additionally, the methods, systems, subsystems, and methods described and illustrated in various embodiments as discrete or separate may be combined or integrated with other systems, modules, technologies, or methods without departing from the scope of the present invention. Other elements shown or discussed as related or directly connected or interacting with each other may be indirectly connected or may interact through some interface, device or intermediate component, electrically, mechanically or otherwise. Those skilled in the art will recognize other examples of changes, substitutions and modifications that can be made without departing from the spirit and scope of the present invention.

Claims (138)

1. A deblocking filter device (120, 220, 600) for use in an image encoder (100, 1300, 1400) and/or an image decoder (200, 1300, 1400) to deblock the edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502), wherein the first image block (401, 501) has a size of M * N blocks or N * M, where M and N represent respectively the width and height of the first image block or N and M represent the width and height of the first image block, respectively; a the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, while the deblocking filter device is characterized in that, when one of the first image block and the second image block contains sub-blocks (4021, 4022, 5021, 5022), said one image block containing sub-blocks is the second block (402, 502) and N or T is an even integer ²ⁿ greater than 16, where n is a positive integer: - modification of the values, at most, of the MA samples of the second block (402, 502) of the image as the first output values, where the maximum number of MA samples is on a line perpendicular to the edge (403, 504, 903) of the block and the maximum number of MA samples are adjacent to the edge (403, 504, 903) blocks, and MA is a positive integer equal to or less than 5; - modification of the values, maximum, of the MV samples of the first block (401, 501) of the image as the second output values, where the maximum number of MV samples are on a line perpendicular to the edge (403, 504, 903) of the block, and the maximum number of MA samples are adjacent to edge (403, 504, 903) of the block, where MB is a positive integer equal to 7. 2. The deblocking filter apparatus (120, 220, 600) of claim 1, wherein when N and T are even integers 2 ⁿ greater than 16, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. 3. The deblocking filter apparatus (120, 220, 600) of claim 1, wherein when N is an even integer 2 ⁿ greater than 16 and T is an even integer 2 ⁿ equal to or less than 16, MA = 3 and MB = 7. 4. The deblocking filter device (120, 220, 600) according to any one of claims 1 to 3, characterized in that it is further configured that when the second image block (402, 502) includes sub-blocks ( 4021, 4022; 5021 , 5022) and the first image block (401, 501) includes sub-blocks: - modifications, at most, of the number MA' of sample values of the first image block (401, 501) as third output values, where the maximum number of samples MA' is on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block, - modifications, at most, of the number MB' of sample values of the second image block (402, 502) as fourth output values, where the maximum number of MB' samples are on a line perpendicular to and adjacent to the edge (403 , 504, 903) of the block, with MA' =MB'. 5. The deblocking filter apparatus (120, 220, 600) of claim 4, wherein MA'=MB'=3 or MA'=MB'=5. 6. The deblocking filter device (120, 220, 600) according to any one of claims 1 to 6, characterized in that it is further configured to determine whether the edge (403, 504, 903) is to be filtered and/or should be performed asymmetric long filtering, based on: - values, at most, of the number DA samples of the first block (401, 501, 902) of the image adjacent to the edge (403, 504, 903) of the block, as first decision values, and - values, at most, of the number DB of samples of the second block (401, 501) of the image adjacent to the edge (403, 504, 903) of the block, as the values of the second decision, and DA and DB are integers. 7. The deblocking filter device (120, 220, 600) of claim 6, wherein DA = MA + 1 and DB = MB + 1. 8. The deblocking filter device (120, 220, 600) of claim 6 or 7, wherein when the second image block has sub-blocks, the deblocking filter device (120, 220, 600) is further configured to determine whether the or the first condition defined by the following first equation:

, where β denotes the threshold parameter, q _i represent the sample values of the second image block, i = 0, 1, 2, 3, and p _j represent the sample values of the first image block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5. 9. The deblocking filter device (120, 220, 600) of claim 6 or 7, wherein when the first image block has subblocks, the deblocking filter device (120, 220, 600) is further configured to determine whether or the second condition defined by the following second equation:

, where β denotes the threshold parameter, p _i represents the sample values of the first image block, i = 0, 1, 2, 3, and q _j represent the sample values of the second image block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5. 10. A deblocking filter device (120, 220, 600) according to any one of claims 1-9, wherein: if the block edge (903) is the horizontal block edge (903), the height direction N of the first image block is perpendicular to the block edge (903) and the height direction T of the second image block is perpendicular to the block edge (903), with the heights of one or both of the first and second image blocks are an even integer 2 ⁿ greater than 16; or if the block edge (903) is the vertical block edge (403, 504), the width direction N of the first image block is perpendicular to the block edge (903) and the width direction T of the second image block is perpendicular to the block edge (903), with the widths of one or both of the first and the second image blocks are even integers 2 ⁿ greater than 16. 11. A deblocking filter device (120, 220, 600) according to any one of claims 1-10, wherein the second image block is the current block, and the first P image block is the adjacent block of the current block. 12. The deblocking filter apparatus (120, 220, 600) of claim 11, wherein the first image block is to the left of the second image block. 13. A deblocking filter device (120, 220, 600) according to any one of claims 1-12, wherein the first image block and the second image block are transformation blocks, or the first image block and the second image block are coding blocks. 14. A deblocking method for deblocking an edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502) for use in an image encoding device and/or an image decoding device, wherein the first image block (401, 501) has a block size of M * N or N * M, where M and N represent respectively the width and height of the first image block, or N and M represent the width and height of the first image block, respectively; a the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, the deblocking method comprises the steps where, when the second image block (402, 502) includes sub-blocks (4021, 4022; 5021, 5022) and N or T is an even integer 2 ⁿ greater than 16, where n is positive integer: - modify, at most, the number MA of sample values of the second block (402, 502) of the image as the first output values, where the maximum number of MA samples are on a line perpendicular to the edge (403, 504, 903) of the block, and the maximum number of MB samples are adjacent edge (403, 504, 903) of the block, wherein MA is a positive integer equal to or less than 5; and - modify, as a maximum, the number of MV samples of the first image block (401, 501) as the second output values, where the maximum number of MV samples are on a line perpendicular to the edge (403, 504, 903) of the block, and the maximum number of MV samples are adjacent edge (403, 504, 903) of the block; where MB is a positive integer equal to 7. 15. The deblocking method of claim 14, wherein if N and T are even integers 2n greater than 16, MA = 3 and MB = 7, or MA = 4 and MB = 7, or MA = 5 and MB = 7. 16. The deblocking method of claim 14, wherein when N is an even integer ²ⁿ greater than 16 and T is an even integer ²ⁿ equal to or less than 16, MA = 3 and MB = 7. 17. The deblocking method according to any one of claims 14 to 16, further comprising the steps of, when each of the second image block (402, 502) and the first image block (401, 501) includes sub-blocks (4021, 4022; 5021, 5022): - modifying, at most, the number MA' of sample values of the first image block (401, 501) as third output values, the maximum number of samples MA' being on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block; and - modify, at most, the number MB' of sample values of the second image block (402, 502) as fourth output values, with the maximum number of samples MB' being on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block; and MA' and MB' are integers and MA'= MB'. 18. The deblocking method of claim 17, wherein MA'=MB'=3 or MA'=MB'=5. 19. The deblocking method according to any one of claims 14 to 16, further comprising determining whether an edge (403, 504, 903) is to be block filtered and/or whether asymmetric long filtering is to be performed based on: values, maximum, the number of DA samples of the first block (401, 501, 902) of the image adjacent to the edge (403, 504, 903) of the block, as the values of the first decision, and values, maximum, the number DB of samples of the second image block (401, 501) adjacent to the edge (403, 504, 903) of the block as second decision values, where DA and DB are integers. 20. The deblocking method of claim 19, wherein DA = MA + 1 and DB = MB + 1. 21. The deblocking method according to claim 19 or 20, further comprising, when the second image block has sub-blocks, determining whether the first condition defined by the following first equation is satisfied:

, where β denotes the threshold parameter, q _i represent the sample values of the second image block, i = 0, 1, 2, 3, and p _j represent the sample values of the first image block, j = 0, 3, 4, 7 or j = 0, 2, 3, 5. 22. The deblocking method according to claim 19 or 20, further comprising, when the first image block has sub-blocks, determining whether the second condition defined by the following second equation is satisfied:

, where β denotes the threshold parameter, p _i represents the sample values of the first image block, i = 0, 1, 2, 3, and q _j represent the sample values of the second image block, j = 0, 3, 4, 7, or j = 0, 2, 3, 5. 23. The deblocking method according to any one of claims 14-22, wherein: when the edge (903) of the block is the horizontal edge (903) of the block, the height direction N of the first image block is perpendicular to the edge (903) of the block, and the height direction T of the second image block is perpendicular to the edge (903) of the block, the height of one or both of the first and the second image blocks are even integers 2n greater than 16; or if the edge (903) of the block is the vertical edge (403, 504) of the block, the width direction N of the first image block is perpendicular to the edge (903) of the block and the width direction T of the second image block is perpendicular to the edge (903) of the block, the width of one or both of the first and the second image blocks are even integers 2 ⁿ greater than 16. 24. The deblocking method according to any one of claims 14 to 23, wherein the second image block is the current block and the first image block is an adjacent block of the current block. 25. The deblocking method of claim 24, wherein the first image block is to the left of the second image block. 26. The deblocking method according to any one of claims 14 to 25, wherein the first image block and the second image block are transform blocks, or the first image block and the second image block are coding blocks. 27. A deblocking filter device (120, 220, 600) for use in an image encoder (100, 1300, 1400) and/or an image decoder (200, 1300, 1400) to deblock the edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502), wherein the first image block (401, 501) has a block size of M * N or N * M, where M and N represent respectively the width and height of the first image block, or N and M represent the width and height of the first image block, respectively; the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, and the deblocking filter device comprises: memory for storing commands; a processor coupled to the memory, configured to, when executing instructions, when the second image block (402, 502) includes sub-blocks (4021, 4022; 5021, 5022) and the first image block (401, 501) includes sub-blocks and N or T is an even integer 2 ⁿ greater than 16, where n is a positive integer: - modifications, at most, of the number MA' of sample values of the first image block (402, 502) as third output values, the maximum number of samples MA' being on a line perpendicular to the edge (403, 504, 903) of the block, and the maximum number MA' the samples are adjacent to the edge (403, 504, 903) of the block, with MA' being a positive integer equal to 5; and - modifications, at most, of the number MB' of sample values of the second image block (401, 501) as fourth output values, with the maximum number of MB' samples being on a line perpendicular to the edge (403, 504, 903) of the block, and the maximum number of MB' samples are adjacent to the edge (403, 504, 903) of the block, with MB' being a positive integer equal to 7. 28. The deblocking filter device (120, 220, 600) of claim 27, wherein: - when the block edge (903) is the horizontal block edge (903), the height direction N of the first image block is perpendicular to the block edge (903), and the height direction T of the second image block is perpendicular to the block edge (903), with the heights of one or both of the first and second blocks, the images are even integers 2 ⁿ greater than 16; or - when the edge (903) of the block is the vertical edge (403, 504) of the block, the width direction N of the first image block is perpendicular to the edge (903) of the block, and the width direction T of the second image block is perpendicular to the edge (903) of the block, with a width of one or both of the first and second image blocks are even integers ²ⁿ greater than 16. 29. The deblocking filter apparatus (120, 220, 600) of claim 27 or 28, wherein the second image block is the current block and the first image block is an adjacent block of the current block. 30. The deblocking filter apparatus (120, 220, 600) of claim 29, wherein the first image block is to the left of the second image block. 31. The deblocking filter device (120, 220, 600) according to any one of claims 27 to 30, wherein the first image block and the second image block are transform blocks, or the first image block and the second image block are coding blocks. 32. A deblocking filter device (120, 220, 600) for use in an image encoder (100, 1300, 1400) and/or an image decoder (200, 1300, 1400) to deblock the edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502), wherein the first image block (401, 501) has a block size of M * N or N * M, where M and N represent respectively the width and height of the first image block, or N and M represent the width and height of the first image block, respectively; a the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, and the deblocking filter device comprises: memory for storing commands; and a processor coupled to the memory, configured, when executing instructions, when there is a subblock edge (404, 505) between subblocks (4021, 4022; 5021, 5022) of the second encoding block (402, 502) and N or T is an even integer 2 ⁿ over 16, where n is a positive integer: - modifications, based on the maximum filter length, MA of the sample values of the second image block (402, 502) adjacent to the edge (403, 504, 903) of the block, where MA is a positive integer equal to or less than 5; and - modifications, based on the maximum length of the filter, MB sample values of the first block (401, 501) of the image adjacent to the edge (403, 504, 903) of the block, and MB is a positive integer equal to 7. 33. The deblocking filter apparatus (120, 220, 600) of claim 32, wherein the maximum filter length MA is associated with the second image block (402, 502) and the maximum filter length MB is associated with the first image block (401, 501). . 34. Deblocking filter device (120, 220, 600) according to claim 32 or 33, characterized in that it is configured to: - modifications, at most, of the number of MA sample values of the second image block (402, 502), with the maximum number of MA samples being on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block; and - modifications, at most, of the number of MB sample values of the first block (401, 501) of the image, with the maximum number of MV samples being on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block. 35. An encoder for encoding an image containing a deblocking filter device (120, 220, 600) according to any one of paragraphs. 1-13 and 27-34. 36. A decoder for decoding an image, comprising a deblocking filter device (120, 220, 600) according to any one of paragraphs. 1-13 and 27-34. 37. A deblocking method for deblocking an edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502) for use in an image encoding device and/or an image decoding device, wherein the first image block (401, 501) has a block size of M * N or N * M, where M and N represent respectively the width and height of the first image block, or N and M represent the width and height of the first image block, respectively; a the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, and the deblocking method comprises the steps where, when the second image block (402, 502) and the first image block (401, 501) include sub-blocks (4021, 4022; 5021, 5022) and N or T is an even integer 2 ⁿ , greater than 16, and n is a positive integer: - modify, at most, the number MA' of sample values of the first image block (401, 501) as third output values, the maximum number of samples MA' being on the line perpendicular to the edge (403, 504, 903) of the block, and the maximum number MA' the samples are adjacent to the edge (403, 504, 903) of the block, with MA' being a positive integer equal to 5; and - modify, at most, the number MB' of sample values of the second image block (402, 502) as the fourth output values, with the maximum number MB' of samples being on the line perpendicular to the edge (403, 504, 903) of the block, and the maximum number MB' samples are adjacent to the edge (403, 504, 903) of the block, with MB' being a positive integer equal to 7. 38. The deblocking method of claim 37, wherein: if the block edge (903) is the horizontal block edge (903), the height direction N of the first image block is perpendicular to the block edge (903) and the height direction T of the second image block is perpendicular to the block edge (903), the height of one or both of the first and second image blocks is an even integer 2 ⁿ greater than 16; or if the block edge (903) is the vertical block edge (403, 504), the width direction N of the first image block is perpendicular to the block edge (903) and the width direction T of the second image block is perpendicular to the block edge (903), the width of one or both of the first and of the second image block is an even integer 2 ⁿ greater than 16. 39. The deblocking method of claim 37 or 38, wherein the second image block is the current block and the first image block is an adjacent block of the current block. 40. The deblocking method of claim 39, wherein the first image block is to the left of the second image block. 41. The deblocking method according to any one of claims 37 to 40, wherein the first image block and the second image block are transform blocks, or the first image block and the second image block are coding blocks. 42. A deblocking method for deblocking an edge (403, 504, 903) of a block between the first image block (401, 501) and the second image block (402, 502) for use in an image encoding device and/or an image decoding device, wherein the first image block (401, 501) has a block size of M * N or N * M, where M and N represent respectively the width and height of the first image block, or N and M represent the width and height of the first image block, respectively; a the second image block (402, 502) has a size of L * T or T * L, where L and T represent, respectively, the width and height of the second image block, or T and L represent, respectively, the width and height of the second image block, respectively, and the deblocking method comprises steps in which, when there is a subblock edge (404, 505) between subblocks (4021, 4022; 5021, 5022) of the second coding block (402, 502) and N or T is an even integer 2 ⁿ greater than 16 , where n is a positive integer: - modify, based on the maximum length of the filter, MA sample values of the second block (402, 502) of the image adjacent to the edge (403, 504, 903) of the block, and MA is a positive integer equal to or less than 5; and - modify, based on the maximum length of the filter, MB sample values of the first block (401, 501) of the image adjacent to the edge (403, 504, 903) of the block, and MB is a positive integer equal to 7. 43. The deblocking method of claim 42, wherein the maximum filter length MA is associated with the second image block (402, 502) and the maximum filter length MB is associated with the first image block (401, 501). 44. The deblocking method according to claim 42 or 43, wherein the step of modifying, based on the maximum filter length, MA sample values of the second image block (402, 502) adjacent to the edge (403, 504, 903) of the block, comprises a sub-step, on which: - modify, at most, the number of MA sample values of the second block (402, 502) of the image, and the maximum number of MA samples is on a line perpendicular to and adjacent to the edge (403, 504, 903) of the block; a the modification step, based on the maximum filter length, MB sample values of the first image block (401, 501) adjacent to the block edge (403, 504, 903), comprises a sub-step of: - modify, as a maximum, the number of MV values of samples of the first block (401, 501) of the image, and the maximum number of MV samples is on a line perpendicular and adjacent to the edge (403, 504, 903) of the block. 45. An encoding method for encoding an image, comprising the deblocking method according to any one of claims 14-26 and 37-44. 46. A decoding method for decoding an image, comprising a deblocking method according to any one of paragraphs. 14-26 and 37-44. 47. A decoder for decoding an image, comprising: one or more processors; and a persistent computer-readable storage medium coupled to the processors and storing programs for execution by the processors, wherein the programs executed by the processors cause execution, by a decoder, of a method according to any one of claims. 14-26 and 37-44. 48. An encoder for encoding an image, comprising: one or more processors; and a persistent computer-readable storage medium coupled to the processors and storing programs for execution by the processors, wherein the programs executed by the processors cause execution, by a decoder, of a method according to any one of claims. 14-26 and 37-44. 49. A permanent computer-readable medium that stores computer instructions that cause, when executed by one or more processors, the execution, by one or more processors, of the method according to any one of paragraphs. 14-26 and 37-44.

Images