Using non-adjacent sample points for adaptive loop filters in video coding

Abstract

The invention discloses a method for processing video data. The method comprises the following steps: acquiring non-adjacent reconstruction sample points of a picture of a video; inputting non-adjacent reconstructed sample points of the picture as input of an adaptive loop filter (ALF); and in response to inputting the non-adjacent reconstructed sample points of the current picture as the input of the ALF, performing conversion between the video and the bit stream of the video.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to and the benefit of International Patent Application No. PCT / CN2022 / 107923, filed on July 26, 2022. The contents of the foregoing patent application are incorporated herein by reference in their entirety. Technical Field

[0003] The present disclosure relates to the generation, storage and use of digital audio-visual media information in file format. Background Art

[0004] Digital video accounts for the largest share of bandwidth used on the Internet and other digital communications networks. As the number of connected user devices capable of receiving and displaying video increases, the bandwidth requirements for digital video usage are likely to continue to grow. Summary of the invention

[0005] The present disclosure relates to video coding techniques. Specifically, the present disclosure relates to loop filters and other coding tools in image / video coding. The inventive concept can be applied to any existing video coding standard or non-standard video codec, such as high-efficiency video coding (HEVC) and versatile video coding (VVC), individually or in various combinations. These inventive concepts can also be applied to future video coding standards or video codecs.

[0006] A first aspect relates to a method for processing video data, comprising: obtaining non-adjacent reconstructed samples of a picture of a video; inputting the non-adjacent reconstructed samples of the picture as input of an adaptive loop filter (ALF); and performing conversion between a video and a bitstream of the video in response to inputting the non-adjacent reconstructed samples of a current picture as input of the ALF.

[0007] A second aspect relates to an apparatus for processing video data, comprising: a processor; and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method of any one of the preceding aspects.

[0008] A third aspect relates to a non-transitory computer-readable medium, which includes a computer program product for use by a video codec device, the computer program product including computer executable instructions stored on the non-transitory computer-readable medium, so that when executed by a processor, the video codec device performs any of the methods described in the preceding aspects.

[0009] A fourth aspect relates to a non-transitory computer-readable recording medium storing a bit stream of a video generated by a method performed by a video processing device, wherein the method includes the method as described in any one of the preceding aspects.

[0010] A fifth aspect relates to a method for storing a bitstream of a video, comprising a method as described in any of the preceding aspects, wherein performing conversion between a video and a video bitstream in response to inputting non-adjacent reconstructed samples of a current picture as input to an ALF includes generating a bitstream, and wherein the method further comprises storing the bitstream in a non-temporary computer-readable medium.

[0011] For clarity, any of the foregoing embodiments may be combined with one or more of the other foregoing embodiments to create new embodiments within the scope of the present disclosure.

[0012] These and other features will become more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] For a more complete understanding of the present disclosure, reference is now made to the following brief description taken in conjunction with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.

[0014] Figure 1 Examples of nominal vertical and horizontal positions for a 4:2:2 color format are shown.

[0015] Figure 2 An example of an encoder block diagram of VVC is shown.

[0016] Figure 3 An example of raster scan striping of a picture is shown.

[0017] Figure 4 An example of rectangular strip segmentation of a picture is shown.

[0018] Figure 5 Examples of pictures segmented into slices, tiles, and rectangular strips are shown.

[0019] Figure 6 An example of a codec tree block (CTB) crossing a picture boundary is shown.

[0020] Figure 7 Examples of angular intra prediction directions are shown.

[0021] Figure 8 Examples of picture samples and block boundaries are shown.

[0022] Fig. 9 An example of a filter decision and the pixels involved in the selection is shown.

[0023] Fig.10 An example of a filter shape for an ALF is shown.

[0024] Fig.11Examples of transform coefficients for different positions in the diamonds are shown.

[0025] Fig.12 An example of relative coordinates for diamond filter support is shown.

[0026] Fig.13 is a block diagram illustrating an exemplary video processing system.

[0027] Fig.14 is a block diagram of an example video processing device.

[0028] Fig.15 is a flow chart of an example method for video processing.

[0029] Fig.16 is a block diagram illustrating an example video codec system.

[0030] Fig.17 is a block diagram illustrating an example encoder.

[0031] Fig.18 is a block diagram illustrating an example decoder.

[0032] Fig.19 is a schematic diagram of an example encoder. DETAILED DESCRIPTION

[0033] First, it should be understood that although the following provides an illustrative implementation of one or more embodiments, the disclosed systems and / or methods may be used with any number of technical facts, whether currently known or yet to be developed. The present disclosure should not be limited in any way to the exemplary implementations, drawings, and techniques shown below, including the exemplary designs and implementations shown and described herein, but may be modified within the full scope of the appended claims and their equivalents.

[0034] The section titles used in this document are for ease of understanding and do not limit the applicability of the techniques and embodiments disclosed in each section to only that section. In addition, the techniques described herein are applicable to other video codec protocols and designs.

[0035] 1. Summary

[0036] The present disclosure relates to video coding technology. Specifically, it relates to loop filters and other coding tools in image / video coding. The inventive concept can be applied to any existing video coding standard or non-standard video codec, such as high-efficiency video coding (HEVC) and versatile video coding (VVC), alone or in various combinations. The inventive concept proposed herein can also be applied to future video coding standards or video codecs.

[0037] 2. Abbreviations

[0038] AVC Advanced Video Codec

[0039] CPB codec picture buffer

[0040] CRA Pure Random Access

[0041] CTU Codec Tree Unit

[0042] CVS codec video sequence

[0043] DPB decoded picture buffer

[0044] DPS Decoding Parameter Set

[0045] GCI General Constraints Information

[0046] HEVC High Efficiency Video Codec

[0047] JEM Joint Exploration Model

[0048] MCTS Motion Constraints Episode Set

[0049] NAL Network Abstraction Layer

[0050] OLS output layer set

[0051] PH Picture Header

[0052] PPS Picture Parameter Set

[0053] PTL grades, layers and levels

[0054] PU Picture Unit

[0055] RRP Reference Image Resampling

[0056] RBSP Raw Byte Sequence Payload

[0057] SEI Supplemental Enhancement Information

[0058] SH Strip Head

[0059] SPS Sequence Parameter Set

[0060] VCL video codec layer

[0061] VPS Video Parameter Set

[0062] VTM VVC test model

[0063] VUI Video Availability Information

[0064] VVC Multi-functional Video Codec

[0065] TU Transformation Unit

[0066] CU Codec Unit

[0067] DF Deblocking Filter

[0068] SAO Sample Adaptive Offset

[0069] ALF Adaptive Loop Filter

[0070] CBF codec block flag

[0071] QP Quantization Parameter

[0072] RDO Rate-Distortion Optimization

[0073] BF Bilateral Filter

[0074] 3. Background

[0075] Video codec standards have evolved primarily through the development of standards known as the International Telecommunication Union (ITU) Telecommunication Standardization Sector (ITU-T) and the International Organization for Standardization (ISO) / International Electrotechnical Commission (IEC). ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 Vision, and the two organizations jointly produced the H.262 / Moving Picture Experts Group (MPEG)-2 Video and H.264 / MPEG-4 Advanced Video Codec (AVC) and H.265 / HEVC [1] standards. Since H.262, video codec standards have been based on a hybrid video codec structure that utilizes temporal prediction plus transform coding. To explore future video codec technologies beyond HEVC, the Video Codec Experts Group (VCEG) and MPEG jointly established the Joint Video Exploration Team (JVET) in 2015. Since then, JVET has adopted many new methods and put them into reference software called the Joint Exploration Model (JEM) [2]. The JVET meetings are held simultaneously every quarter, and the goal of the new codec standard is to reduce the bit rate by 50% compared to HEVC. The new video codec standard was officially named Versatile Video Codec (VVC) at the JVET meeting in April 2018, and the first version of the VVC Test Model (VTM) was released at that time. Due to the continuous efforts to promote VVC standardization, new codec technologies are adopted in the VVC standard at each JVET meeting. Then, the VVC working draft and the test model VTM are updated after each meeting.

[0076] The latest version of the VVC draft (i.e., VVC draft 10) can be found at: https: / / jvet-experts.org / doc_end_user / documents / 19_Teleconference / wg11 / JVET-S2001-v17.zip.

[0077] The latest reference software for VVC (called VTM) can be found at: https: / / vcgit.hhi.fraunhofer.de / jvet-u-ee2 / VVCSoftware_VTM / - / tree / VTM-11.2.

[0078] ITU-TVCEG (Q6 / 16) and ISO / IEC MPEG (JTC 1 / SC 29 / WG 11) are studying the potential need for standardization of future video codec technologies with compression capabilities that will significantly exceed the current VVC standard. This future standardization action could take the form of additional extensions to VVC or a completely new standard. The groups are working together on this development activity in a joint collaborative effort known as the Joint Video Development Team (JVET) to evaluate the compression technology designs proposed by their experts in this area. The first Exploratory Experiment (EE) was established at the JVET meeting between January 6 and 15, 2021 and in a reference software called the Enhanced Compression Model (ECM). The test model ECM is updated after each JVET meeting.

[0079] 3.1 Color Space and Chroma Subsampling

[0080] A color space (also called a color model (or color system)) is an abstract mathematical model that describes the range of colors simply as a tuple of numbers, as 3 or 4 values ​​or color components (e.g., RGB). Fundamentally, a color space is a detailed description of coordinate systems and subspaces.

[0081] For video compression, the most commonly used color spaces are YCbCr and RGB.

[0082] YCbCr, Y'CbCr or YPb / CbPr / Cr (also written as YCBCR or Y'CBCR) is a series of color spaces used as part of the color image pipeline in video and digital photography systems. Y' is the luminance component, and CB and CR are the blue difference chrominance component and the red difference chrominance component. Y' (with a prime) is different from Y (luminance), which means that the light intensity is non-linearly encoded based on the gamma-corrected RGB primaries.

[0083] Chroma subsampling is the practice of encoding an image at a lower resolution than luminance information by taking advantage of the fact that the human visual system is less sensitive to color differences than to luminance. 3.1.1.4:4:4

[0085] Each of the three Y'CbCr components has the same sampling rate. Therefore there may be no chroma subsampling. This scheme is sometimes used in high-end film scanners and film post-production. 3.1.2.4:2:2

[0087] The two chroma components are sampled at half the sampling rate of luma. The horizontal chroma resolution is halved, while the vertical chroma resolution is unchanged. This reduces the bandwidth of the uncompressed video signal by one third, but there is little visual difference. Figure 1 Examples of nominal vertical and horizontal positions of luma and chroma samples for a 4:2:2 color format in a picture are depicted in FIG. 1 (also in the VVC working draft). 3.1.3 4:2:0

[0089] In the 4:2:0 format, the horizontal sampling is doubled compared to 4:1:1, but in this scheme, the vertical resolution is halved because the Cb and Cr channels can be sampled only on every alternate line. Therefore, the data rate can be the same. Cb and Cr are each subsampled by a factor of two in both horizontal and vertical directions. There are three possible variants of the 4:2:0 scheme, each with different horizontal and vertical addressing.

[0090] In MPEG-2, Cb and Cr are co-located in the horizontal direction. Cb and Cr are located between pixels in the vertical direction (ie, in the gap).

[0091] In JPEG / JFIF, H.261, and MPEG-1, Cb and Cr are located in the gaps between alternate luminance samples.

[0092] In 4:2:0 digital video (DV), Cb and Cr are co-located horizontally. In the vertical direction, they are co-located on alternate lines.

[0093] Table 1. SubWidthC and SubHeightC values ​​derived from chroma_format_idc and separate_colour_plane_flag

[0094]

[0095]

[0096] 3.2 Video Codec Encoding and Decoding Process

[0097] Figure 2 An example of an encoder block diagram for VVC is shown, which contains three loop filter blocks: deblocking filter (DF), sample adaptive offset (SAO) and ALF. Unlike DF, which uses a predefined filter, SAO and ALF use the original samples of the current picture to reduce the mean square error between the original samples and the reconstructed samples by adding an offset and by applying a finite impulse response (FIR) filter, respectively, using the codec's side information to signal the offset and filter coefficients. ALF is located at the last processing stage of each picture and can be seen as a tool that attempts to capture and repair artifacts produced by previous stages.

[0098] 3.3 Definition of Video / Codec Unit

[0099] A picture is divided into one or more slice rows and one or more slice columns. A slice is a sequence of CTUs covering a rectangular area of ​​a picture. A slice is divided into one or more bricks, each brick consisting of multiple CTU rows within the slice. A slice that is not divided into multiple bricks is also called a brick. However, a brick that is a proper subset of a slice cannot be called a slice. A strip contains several slices of a picture or several bricks of a slice.

[0100] Two strip modes can be supported, namely, raster scan strip mode and rectangular strip mode. In raster scan strip mode, a strip contains a series of slices in a slice raster scan of an image. In rectangular strip mode, a strip contains multiple tiles of an image, which together form a rectangular region of the image. The tiles within a rectangular strip are arranged in the order of the tiles raster scan of the strip. Figure 3 An example of raster scan stripe partitioning of a picture with 18 by 12 luma CTUs is shown, where the picture is divided into 12 slices and 3 raster scan stripes.

[0101] Figure 4 An example of rectangular slice partitioning of a picture with 18 by 12 luma CTUs under the VVC standard is also shown, where the picture is divided into 24 slices (6 slice columns and 4 slice rows) and 9 rectangular slices.

[0102] Figure 5 An example of a picture being partitioned into slices, bricks, and rectangular strips under the VVC standard is also shown, where the picture is divided into 4 slices (2 slice columns and 2 slice rows), 11 bricks (the upper left slice contains 1 brick, the upper right slice contains 5 bricks, the lower left slice contains 2 bricks, and the lower right slice contains 3 bricks), and 4 rectangular strips.

[0103] 3.3.1 CTU / CTB size

[0104] In VVC, the CTU size (signaled in SPS through the syntax element log2_ctu_size_minus2) can be as small as 4×4.

[0105] 7.3.2.3 Sequence parameter set RBSP syntax

[0106]

[0107]

[0108]

[0109] log2_ctu_size_minus2 plus 2 specifies the luma codec tree block size for each CTU.

[0110] log2_min_luma_coding_block_size_minus2 plus 2 specifies the minimum luma coding block size.

[0111] The variables CtbLog2SizeY, CtbSizeY, MinCbLog2SizeY, MinCbSizeY, MinTbLog2SizeY, MaxTbLog2SizeY, MinTbSizeY, MaxTbSizeY, PicWidthInCtbsY, PicHeightInCtbsY, PicSizeInCtbsY, PicWidthInMinCbsY, PicHeightInMinCbsY, PicSizeInMinCbsY, PicSizeInSamplesY, PicWidthInSamplesC, and PicHeightInSamplesC are derived as follows:

[0112] CtbLog2SizeY = log2_ctu_size_minus2 + 2 (7-9)

[0113] CtbSizeY = 1 << CtbLog2SizeY (7-10)

[0114] MinCbLog2SizeY=log2_min_luma_coding_block_size_minus2+2(7-11)

[0115] MinCbSizeY = 1 << MinCbLog2SizeY (7-12)

[0116] MinTbLog2SizeY = 2 (7-13)

[0117] MaxTbLog2SizeY = 6 (7-14)

[0118] MinTbSizeY = 1 << MinTbLog2SizeY (7-15)

[0119] MaxTbSizeY = 1 << MaxTbLog2SizeY (7-16)

[0120] PicWidthInCtbsY = Ceil( pic_width_in_luma_samples ÷ CtbSizeY ) (7-17)

[0121] PicHeightInCtbsY = Ceil( pic_height_in_luma_samples ÷ CtbSizeY )(7-18)

[0122] PicSizeInCtbsY = PicWidthInCtbsY * PicHeightInCtbsY (7-19)

[0123] PicWidthInMinCbsY = pic_width_in_luma_samples / MinCbSizeY (7-20)

[0124] PicHeightInMinCbsY = pic_height_in_luma_samples / MinCbSizeY (7-21)

[0125] PicSizeInMinCbsY = PicWidthInMinCbsY * PicHeightInMinCbsY (7-22)

[0126] PicSizeInSamplesY=pic_width_in_luma_samples * pic_height_in_luma_samples (7-23)

[0127] PicWidthInSamplesC = pic_width_in_luma_samples / SubWidthC (7-24)

[0128] PicHeightInSamplesC = pic_height_in_luma_samples / SubHeightC (7 - 25)

[0129] 3.3.2 CTUs in a picture

[0130] Assume that the CTB / largest coding unit (LCU) size is represented by MxN (M equals N, as defined in HEVC / VVC), and for a CTB located at the picture boundary (or slice or strip or other type of boundary, taking the picture boundary as an example), K×L samples are within the picture boundary, where K < M or L < N. For Figure 6 those CTBs shown in

[0131] 3.4 Intra prediction

[0132] To capture any edge direction presented in natural videos, the number of directional intra modes is extended from 33 used in HEVC to 65. The additional directional modes are as shown by the dashed arrows in Figure 7 and the planar and DC modes remain unchanged. These denser directional intra prediction modes apply to all block sizes as well as luminance and chrominance intra prediction.

[0133] Some angular intra prediction directions are defined to be from 45 degrees to -135 degrees in the clockwise direction, as shown in Figure 7 In VTM, for non-square blocks, several angular intra prediction modes are adaptively replaced with wide-angle intra prediction modes. The replaced modes are signaled using the original method and remapped to the indices of the wide-angle modes after parsing. The total number of intra prediction modes can remain unchanged, i.e., 67, and the intra mode coding and decoding remain the same.

[0134] In HEVC, each intra-coded block has a square shape and the length of each side is a power of 2. Therefore, division operations can be avoided to generate the intra predictor using the DC mode. In VVC, blocks can have a rectangular shape, and in general, division operations may have to be used for each block. To avoid division operations for DC prediction, only the longer side can be used to calculate the average value of non-square blocks.

[0135] 3.5 Inter prediction

[0136] For each inter-predicted CU, the motion parameters consist of a motion vector, a reference picture index and a reference picture list usage index, as well as additional information required by the new codec features of VVC for sample generation for inter prediction. Motion parameters can be signaled explicitly or implicitly. When a CU is encoded and decoded using skip mode, the CU is associated with one PU and has no significant residual coefficients, no coded motion vector increments or reference picture indices. A Merge mode is specified, by which the motion parameters of the current CU are obtained from neighboring CUs, including spatial and temporal candidates and additional scheduling introduced in VVC. Merge mode can be applied to any inter-predicted CU, not just skip mode. An alternative to Merge mode is to explicitly send motion parameters, where motion vectors, corresponding reference picture indices for each reference picture list and reference picture list usage flags, as well as other required information, are explicitly signaled per CU.

[0137] 3.6 Deblocking Filter

[0138] Deblocking filtering is a loop filter in the video codec. In VVC, the deblocking filtering process is applied to CU boundaries, transform sub-block boundaries, and predicted sub-block boundaries. The predicted sub-block boundaries include prediction unit boundaries introduced by sub-block based temporal motion vector prediction (SbTMVP) and affine mode, and the transform sub-block boundaries include transform unit boundaries introduced by sub-block transform (SBT) and intra sub-partitioning (ISP) mode and transforms due to implicit partitioning of large CUs. Like HEVC, the processing order of the deblocking filter is defined as first filtering the vertical edges of the entire picture horizontally, and then filtering the horizontal edges vertically. This specific order enables the application of multiple horizontal filtering or vertical filtering processes in parallel threads or can still be implemented on a CTB basis with little processing delay.

[0139] First, filter the vertical edges in the picture. Then, use the samples modified by the vertical edge filtering process as input to filter the horizontal edges in the picture. The vertical and horizontal edges in the CTB of each CTU are processed separately according to the codec unit. Filter the vertical edges of the codec blocks in the codec unit starting from the edge on the left side of the codec block and proceeding to the edge on the right side of the codec block in the geometric order of the codec blocks. Filter the horizontal edges of the codec blocks in the codec unit starting from the edge at the top of the codec block and proceeding to the edge at the bottom of the codec block in the geometric order of the codec blocks. Figure 8 Picture samples on an 8x8 grid are shown, along with horizontal and vertical block boundaries, and non-overlapping blocks of 8x8 samples, which can be deblocked in parallel.

[0140] 3.6.1 Boundary Decision

[0141] The filtering is applied on 8x8 block boundaries. Additionally, it can be a transform block boundary or a codec subblock boundary (e.g. due to the use of affine motion prediction (ATMVP)). For those boundaries that are not such boundaries, the filter is disabled.

[0142] 3.6.2 Boundary strength calculation

[0143] For the transform block boundary / codec sub-block boundary, if it is located within the 8×8 grid, it can be filtered, and the setting of bS[xDi][yDj] of the edge (where [xDi][yDj] represents the coordinates) is defined as Table 2 and Table 3 respectively.

[0144] Table 2. Boundary Strength (When SPS IBC is disabled)

[0145]

[0146] Table 3. Boundary Strength (When SPS IBC is Enabled)

[0147]

[0148] 3.6.3 Deblocking Decision for Luminance Component

[0149] Fig. 9 An example of pixels involved in the filter on / off decision and strong / weak filter selection is shown. The wider-stronger luminance filter is the filter that is used only when conditions 1, 2, and 3 are all true (TRUE).

[0150] Condition 1 is the "large block condition". This condition detects whether the samples on the P side and Q side belong to large blocks, represented by the variables bSidePisLargeBlk and bSideQisLargeBlk, respectively. bSidePisLargeBlk and bSideQisLargeBlk are defined as follows.

[0151] bSidePisLargeBlk = ((edge ​​type is vertical and p0 belongs to a CU with width>=32) || (edge ​​type is horizontal and p0 belongs to a CU with height>=32))? True: False

[0152] bSideQisLargeBlk = ((edge ​​type is vertical and q0 belongs to a CU with width>=32) || (edge ​​type is horizontal and q0 belongs to a CU with height>=32))? True: False

[0153] Based on bSidePisLargeBlk and bSideQisLargeBlk, condition 1 is defined as follows:

[0154] Condition 1 = (bSidePisLargeBlk || bSidePisLargeBlk)? True: False

[0155] Next, if condition 1 is true, we further check condition 2. First, we derive the following variables:

[0156] First, derive dp0, dp3, dq0, dq3 according to the HEVC method

[0157] if (side p is greater than or equal to 32)

[0158] dp0=(dp0+Abs(p50-2*p40+p30)+1)>>1

[0159] dp3=(dp3+Abs(p53-2*p43+p33)+1)>>1

[0160] if (q side is greater than or equal to 32)

[0161] dq0=(dq0+Abs(q50-2*q40+q30)+1)>>1

[0162] dq3=(dq3+Abs(q53-2*q43+q33)+1)>>1

[0163] Condition 2 = (d < β)? True: False

[0164] Where d=dp0+dq0+dp3+dq3.

[0165] If conditions 1 and 2 are valid, then further check if any of the blocks use sub-blocks:

[0166]

[0167]

[0168] Finally, if both conditions 1 and 2 are valid, the proposed deblocking method will check condition 3 (large block strong filter condition), which is defined as follows. In condition 3 StrongFilterCondition, the following variables are derived:

[0169] Derive dpq in the same way as HEVC.

[0170] Derived according to HEVC method sp3 = Abs (p3-p0)

[0171] if (side p is greater than or equal to 32)

[0172] if(Sp==5)

[0173] sp3=(sp3+Abs(p5-p3)+1)>>1

[0174] else

[0175] sp3=(sp3+Abs(p7-p3)+1)>>1

[0176] According to the HEVC method, sq3 = Abs (q0-q3) is derived

[0177] if (q side is greater than or equal to 32)

[0178] If(Sq==5)

[0179] sq3=(sq3+Abs(q5-q3)+1)>>1

[0180] else

[0181] sq3=(sq3+Abs(q7-q3)+1)>>1

[0182] According to HEVC, StrongFilterCondition = (dpq is less than (β>>2), sp3+sq3 is less than (3*β>>5), and Abs(p0-q0) is less than (5*tC+1)>>1)? True: False

[0183] 3.6.4 Stronger Luminance Deblocking Filter

[0184] When samples on either side of the border belong to a large block, a bilinear filter is used. A sample is defined as belonging to a large block when the width of the vertical edge is >= 32 and when the height of the horizontal edge is >= 32.

[0185] The bilinear filters are listed below.

[0186] The block boundary samples pi (i=0 to Sp-1) and qi (j=0 to Sq-1), where pi and qi are the i-th samples in the row for filtering the vertical edge or the i-th samples in the column for filtering the horizontal edge in the above HEVC deblocking, are then replaced by linear interpolation as shown below:

[0187] p i ′=(f i *Middle s,t +(64-f i )*P s +32)>>6),clippedtop i ±tcPD i

[0188] q j ′=(gj *Middle s,t +(64-g j )*Q s +32)>>6),clippedtoq j ±tcPD j

[0189] where tcPD i and tcPD j The term is the position-dependent clipping described in Section 3.6.2, and g j 、f i 、Middle s,t , P s and Q s Given below.

[0190] 3.6.5 Chroma Deblocking Decision

[0191] A chroma strong filter is used on both sides of the block boundary. Here, the chroma filter is selected when both sides of the chroma edge are greater than or equal to 8 (chroma position), and the decision that satisfies the following three conditions: The first decision is the decision of boundary strength and large blocks. The proposed filter can be applied when the block width or height orthogonal to the block edge is equal to or greater than 8 in the chroma sample domain. The second and third decisions are basically the same as the HEVC luma deblocking decisions, which are on / off decisions and strong filtering decisions, respectively.

[0192] In the first decision, the boundary strength (bS) is modified for chroma filtering, and the conditions are checked sequentially. If the condition is met, the remaining conditions with lower priority are skipped. Chroma deblocking is performed when bS is equal to 2, or bS is equal to 1 when a large block boundary is detected. The second and third conditions are basically the same as the HEVC luma strong filter decision, as shown below.

[0193] Under the second condition, d is derived according to HEVC luminance deblocking. When d is less than β, the second condition will be true. Under the third condition, StrongFilterCondition is derived as follows:

[0194] Derive dpq in the same way as HEVC.

[0195] Derived according to HEVC method sp3 = Abs (p3-p0)

[0196] According to the HEVC method, sq3 = Abs (q0-q3) is derived

[0197] According to HEVC design, StrongFilterCondition = (dpq is less than (β>>2), sp3+sq3 is less than (β>>3), and Abs(p0-q0) is less than (5*tC+1)>>1)

[0198] 3.6.6 Strong Deblocking Filter for Chroma

[0199] Define the following strong deblocking filter for chroma:

[0200] p2′=(3*p3+2*p2+p1+p0+q0+4)>>3

[0201] p1′=(2*p3+p2+2*p1+p0+q0+q1+4)>>3

[0202] p0′=(p3+p2+p1+2*p0+q0+q1+q2+4)>>3

[0203] The proposed chroma filter performs deblocking on a 4×4 chroma sample grid.

[0204] 3.6.7 Position-dependent limiting

[0205] Position dependent clipping (tcPD) is applied to the output samples of the luminance filtering process, involving strong and long filters that modify 7, 5 and 3 samples at the boundaries. Assuming a quantization error distribution, it is proposed to increase the clipping value for samples that are expected to have higher quantization noise and therefore the reconstructed sample values ​​are expected to deviate more from the true sample values.

[0206] For each P or Q boundary filtered with an asymmetric filter, a position-dependent threshold table is selected from two tables (e.g., Tc7 and Tc3 listed below) based on the results of the decision-making process in Section 3.6.6, which are provided to the decoder as auxiliary information:

[0207] Tc7={6,5,4,3,2,1,1}; Tc3={6,4,2};

[0208] tcPD=(Sp==3)? Tc3:Tc7;

[0209] tcQD=(Sq==3)? Tc3:Tc7;

[0210] For P or Q boundaries filtered with a short symmetric filter, a lower magnitude position-dependent threshold is applied:

[0211] Tc3 = {3, 2, 1};

[0212] After defining the thresholds, the filtered p'i and q'i sample values ​​are clipped according to the tcP and tcQ clipping values:

[0213] p”i=Clip3(p’i+tcPi,p’i–tcPi,p’i);

[0214] q”j=Clip3(q’j+tcQj,q’j–tcQj,q’j);

[0215] Where p'i and q'i are the filtered sample values, p"i and q"j are the clipped output sample values, and tcPi is the clipping threshold derived from the VVC tc parameters and tcPD and tcQD. Function Clip3 is the clipping function as specified in VVC.

[0216] 3.6.8. Sub-block deblocking adjustment

[0217] In order to achieve parallel-friendly deblocking using both long filters and sub-block deblocking, the long filter is restricted to modifying at most 5 samples on one side using sub-block deblocking (AFFINE or ATMVP or decoder-side motion vector refinement (DMVR)), as shown in the luma control of the long filter. In addition, sub-block deblocking is adjusted so that sub-block boundaries on the 8×8 grid close to CU or implicit TU boundaries are restricted to modifying at most two samples on each side.

[0218] The following applies to sub-block boundaries that are not aligned with CU boundaries.

[0219]

[0220] Where edge equal to 0 corresponds to a CU boundary, edge equal to 2 or equal to orthogonalLength-2 corresponds to a sub-block boundary 8 samples away from the CU boundary, etc. If implicit partitioning of TUs is used, implicitTU is true.

[0221] 3.7. Sample Adaptive Offset

[0222] Sample adaptive offset (SAO) is applied to the reconstructed signal after the deblocking filter by using the offset specified by the encoder for each CTB. The video encoder first decides whether to apply SAO processing to the current strip. If SAO is applied to the strip, each CTB will be classified into one of five SAO types, as shown in Table 4. The concept of SAO is to classify pixels into multiple categories and reduce distortion by adding offsets to pixels of each category. SAO operations include: edge offset (EO), which uses edge attributes for pixel classification in SAO types 1 to 4; and band offset (BO), which uses pixel intensity for pixel classification in SAO type 5. Each applicable CTB has SAO parameters, including sao_merge_left_flag, sao_merge_up_flag, SAO type, and four offsets. If sao_merge_left_flag is equal to 1, the current CTB will reuse the SAO type and offset of the left CTB. If sao_merge_up_flag is equal to 1, the current CTB will reuse the SAO type and offset of the CTB above.

[0223] Table 4. SAO type regulations

[0224]

[0225]

[0226] 3.8. Adaptive Loop Filter

[0227] Adaptive loop filtering for video codecs minimizes the mean square error between the original samples and the decoded samples by using a Wiener-based adaptive filter. ALF is located at the last processing stage of each picture and can be regarded as a tool to capture and repair artifacts from previous stages. The appropriate filter coefficients are determined by the encoder and explicitly signaled to the decoder. In order to achieve better codec efficiency, especially for high-resolution video, local adaptation is used for the luminance signal by applying different filters to different areas or blocks in the picture. In addition to filter adaptation, CTU-level filter on / off control also helps improve codec efficiency. Syntactically, the filter coefficients are sent in a picture-level header called an adaptive parameter set, and the filter on / off flag of the CTU is interleaved at the CTU level in the strip data. This syntax design not only supports picture-level optimization, but also achieves lower encoding latency.

[0228] 3.8.1. Parameter signaling

[0229] According to the ALF design in VTM, the filter coefficients and clipping index are contained in the ALF APS. The ALF APS can include up to 8 chroma filters and one luminance filter set, for a total of up to 25 filters. For each of the 25 luminance classes, an index is also included. Classes with the same index share the same filter. By merging different classes, the number of bits required to represent the filter coefficients is reduced. The absolute value of the filter coefficient is represented using a 0th order Exp-Golomb code followed by the sign bit of the non-zero coefficient. When clipping is enabled, a two-bit fixed-length code is also used to signal the clipping index for each filter coefficient. The decoder can use up to 8 ALF APS simultaneously.

[0230] The filter control syntax elements of ALF in VTM include two types of information. First, the ALF on / off flag signal is signaled at the sequence, picture, slice, and CTB levels. The chroma ALF can be enabled at the picture and slice levels only when the luma ALF is enabled at the corresponding level. Secondly, if ALF is enabled at the picture, slice, and CTB levels, the filter usage information is signaled at that level. If all slices within a picture use the same APS, the referenced ALF APS ID is encoded and decoded at the slice level or picture level. The luma component can reference up to 7 ALF APSs, while the chroma component can reference up to 1 ALF APS. For the luma CTB, an index is signaled to indicate which ALF APS or offline trained luma filter set to use. For the chroma CTB, the index indicates which filter in the referenced APS to use.

[0231] The ALF data syntax elements associated with the LUMA component in the VTM are listed below:

[0232]

[0233]

[0234] alf_luma_filter_signal_flag equal to 1 specifies that the luma filter set is signaled. alf_luma_filter_signal_flag equal to 0 specifies that the luma filter set is not signaled.

[0235] alf_luma_clip_flag equal to 0 specifies that linear adaptive loop filtering is applied to the luma component. alf_luma_clip_flag equal to 1 specifies that non-linear adaptive loop filtering may be applied to the luma component.

[0236] alf_luma_num_filters_signalled_minus1 plus 1 specifies the number of adaptive loop filter classes that can be signaled for the luma coefficient signal. The value of alf_luma_num_filters_signalled_minus1 can be in the range of 0 to NumAlfFilters-1, inclusive.

[0237] alf_luma_coeff_delta_idx[filtIdx] specifies the index of the signaled adaptive loop filter luma coefficient delta for the filter class indicated by filtIdx, in the range 0 to NumAlfFilters-1. When alf_luma_coeff_delta_idx[filtIdx] is not present, it is inferred to be equal to 0. The length of alf_luma_coeff_delta_idx[filtIdx] is Ceil(Log2(alf_luma_num_filters_signalled_minus1+1)) bits. The value of alf_luma_coeff_delta_idx[filtIdx] can be defined in the range of 0.

[0238] alf_luma_coeff_abs[sfIdx][j] specifies the absolute value of the j-th coefficient of the luma filter signaled by sfIdx. When alf_luma_coeff_abs[sfIdx][j] is not present, it is inferred to be equal to 0. The value of alf_luma_coeff_abs[sfIdx][j] can be in the range of 0 to 128, inclusive.

[0239] alf_luma_coeff_sign[sfIdx][j] specifies the sign of the j-th luma coefficient of the filter indicated by sfIdx as follows:

[0240] If alf_luma_coeff_sign[sfIdx][j] is equal to 0, the corresponding luma filter coefficient has a positive value.

[0241] Otherwise (alf_luma_coeff_sign[sfIdx][j] is equal to 1), the corresponding luma filter coefficient has a negative value.

[0242] When alf_luma_coeff_sign[sfIdx][j] is not present, it is inferred to be equal to 0.

[0243] alf_luma_clip_idx[sfIdx][j] specifies the clip index of the clip value to be used before multiplication by the j-th coefficient of the signaled luma filter indicated by sfIdx. When alf_luma_clip_idx[sfIdx][j] is not present, it is inferred to be equal to 0.

[0244] The codec tree syntax elements associated with the LUMA component in the VTM are listed below:

[0245]

[0246] alf_ctb_flag[cIdx][xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] equal to 1 specifies that the adaptive loop filter is applied to the codec tree block of the color component indicated by cIdx of the codec tree unit at luma position (xCtb, yCtb). alf_ctb_flag[cIdx][xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] equal to 0 specifies that the adaptive loop filter is not applied to the codec tree block of the color component indicated by cIdx of the codec tree unit at luma position (xCtb, yCtb).

[0247] When alf_ctb_flag[cIdx][xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is not present, it is inferred to be equal to 0.

[0248] alf_use_aps_flag equal to 0 specifies that one of the fixed filter sets is applied to luma CTBs. alf_use_aps_flag equal to 1 specifies that the filter set from the APS is applied to luma CTBs. When alf_use_aps_flag is not present, it is inferred to be equal to 0.

[0249] alf_luma_prev_filter_idx specifies the previous filter applied to the luma CTB. The value of alf_luma_prev_filter_idx can be in the range of 0 to sh_num_alf_aps_ids_luma-1, inclusive. When alf_luma_prev_filter_idx is not present, it is inferred to be equal to 0.

[0250] The variable AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] specifies the filter set index of the luma CTB at position (xCtb, yCtb) derived as follows:

[0251] If alf_use_aps_flag is equal to 0, AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is set equal to alf_luma_fixed_filter_idx.

[0252] Otherwise, AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is set equal to 16+alf_luma_prev_filter_idx.

[0253] alf_luma_fixed_filter_idx specifies the fixed filter applied to the luma CTB. The value of alf_luma_fixed_filter_idx can be in the range of 0 to 15 (inclusive).

[0254] Based on the ALF design of VTM, the ALF design of ECM further introduces the concept of alternative filter sets into the luma filter. Based on the updated luma CTU ALF on / off decision for each alternative / round, the luma filter is trained for multiple alternatives / rounds. In this way, there will be multiple filter sets associated with each training alternative, and the class merging results of each filter set may be different. Each CTU can select the best filter set by the RDO and signal the relevant alternative information.

[0255] The ALF data syntax elements associated with the LUMA component in the ECM are listed below:

[0256]

[0257]

[0258] alf_luma_num_alts_minus1 plus 1 specifies the number of alternative filter sets for the luma component. The value of alf_luma_num_alts_minus1 may be in the range of 0 to 3, inclusive.

[0259] alf_luma_clip_flag[altIdx] equal to 0 specifies that linear adaptive loop filtering is applied to the alternative luma filter set with index altIdxluma component. alf_luma_clip_flag[altIdx] equal to 1 specifies that non-linear adaptive loop filtering may be applied to the alternative luma filter set with index altIdxluma component.

[0260] alf_luma_num_filters_signalled_minus1[altIdx] plus 1 specifies the number of adaptive loop filter classes that can signal luma coefficients for the alternative luma filter set with index altIdx. The value of alf_luma_num_filters_signalled_minus1[altIdx] can be in the range of 0 to NumAlfFilters-1, inclusive.

[0261] alf_luma_coeff_delta_idx[altIdx][filtIdx] specifies the index of the signaled adaptive loop filter luma coefficient delta for the filter class indicated by filtIdx, in the range 0 to NumAlfFilters–1 for the alternative luma filter set with index altIdx. When alf_luma_coeff_delta_idx[filtIdx][altIdx] is not present, it is inferred to be equal to 0. The length of alf_luma_coeff_delta_idx[altIdx][filtIdx] is Ceil(Log2(alf_luma_num_filters_signalled_minus1[altIdx]+1)) bits. The value of alf_luma_coeff_delta_idx[altIdx][filtIdx] can be in the range of 0 to alf_luma_num_filters_signalled_minus1[altIdx] (inclusive).

[0262] alf_luma_coeff_abs[altIdx][sfIdx][j] specifies the absolute value of the j-th coefficient of the signaled luma filter indicated by sfIdx of the alternative luma filter set with index altIdx. When alf_luma_coeff_abs[altIdx][sfIdx][j] is not present, it is inferred to be equal to 0. The value of alf_luma_coeff_abs[altIdx][sfIdx][j] should be in the range of 0 to 128, inclusive.

[0263] alf_luma_coeff_sign[altIdx][sfIdx][j] specifies the sign of the j-th luma coefficient of the filter indicated by sfIdx of the alternative luma filter set with index altIdx as follows:

[0264] If alf_luma_coeff_sign[altIdx][sfIdx][j] is equal to 0, the corresponding luma filter coefficient has a positive value.

[0265] Otherwise (alf_luma_coeff_sign[altIdx][sfIdx][j] is equal to 1), the corresponding luma filter coefficient has a negative value.

[0266] When alf_luma_coeff_sign[altIdx][sfIdx][j] is not present, it is inferred to be equal to 0.

[0267] alf_luma_clip_idx[altIdx][sfIdx][j] specifies the clip index of the clip value to be used before multiplying the j-th coefficient of the signaled luma filter denoted by sfIdx of the alternative luma filter set indexed by altIdx. When alf_luma_clip_idx[altIdx][sfIdx][j] is not present, it is inferred to be equal to 0.

[0268] The codec tree syntax elements associated with the luma component in ECM are listed below:

[0269]

[0270] alf_ctb_luma_filter_alt_idx[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] specifies the index of the alternative luma filter of the codec tree block applied to the luma component of the codec tree unit at luma position (xCtb, yCtb). When alf_ctb_luma_filter_alt_idx[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is not present, it is inferred to be equal to zero.

[0271] Filter shape

[0272] In JEM, up to three diamond filter shapes can be selected for the luminance component (e.g. Fig.10 ). The filter shape for the luma component is indicated by a picture-level signaling index. Each square represents a sample, and Ci (i is 0 to 6 (left), 0 to 12 (middle), 0 to 20 (right)) represents the coefficient to be applied to the sample. For the chroma components in a picture, a 5×5 diamond shape is always used. In VVC, a 7×7 diamond shape is always used for luma, and a 5×5 diamond shape is always used for chroma.

[0273] 3.8.3. Classification of ALF

[0274] Each 2×2 (or 4×4) block is classified into one of 25 classes. The classification index C is based on the quantized value of its directionality D and activity The derivation is as follows:

[0275]

[0276] In order to calculate D and First, use the 1-dimensional Laplacian operator to calculate the gradient in the horizontal, vertical and two diagonal directions:

[0277]

[0278] The indices i and j refer to the coordinates of the upper left sample point in the 2×2 block, and R(i,j) indicates the reconstructed sample point at the coordinate (i,j). Then, the maximum and minimum values ​​of the gradients D in the horizontal and vertical directions are set as:

[0279]

[0280] And the maximum and minimum values ​​of the gradients in the two diagonal directions are set to:

[0281]

[0282] To derive the value of the directionality D, these values ​​are compared with each other and with two thresholds t1 and t2:

[0283] Step 1. If If both are true, D is set to 0.

[0284] Step 2. If Then continue from step 3; otherwise continue from step 4;

[0285] Step 3. If If yes, set D to 2; otherwise, set D to 1.

[0286] Step 4. If Then set D to 4; otherwise, set D to 3.

[0287] The activity value A is calculated as:

[0288]

[0289] A is further quantized into a range of 0 to 4 (inclusive), and the quantized value is represented as For the two chrominance components in a picture, no classification method is used, ie, a set of ALF coefficients is applied to each chrominance component.

[0290] 3.8.4. Geometric transformation of filter coefficients

[0291] Before filtering each 2×2 block, geometric transformations such as rotation or diagonal and vertical flipping are applied to the filter coefficients f(k,l) associated with the coordinates (k,l) according to the gradient values ​​calculated for that block. This is equivalent to applying these transformations to the samples in the filter support region. The idea is to make different blocks more similar by aligning their directionality, to which the ALF is applied.

[0292] Introduce three geometric transformations, including diagonal transformation, vertical flip and rotation:

[0293] Diagonal: f D (k,l)=f(l,k),

[0294] Flip vertically: f V (k,l)=f(k,Kl-1),

[0295] Rotation: f R (k,l)=f(Kl-1,k).

[0296] Where K is the size of the filter, and 0≤k,l≤K-1 are the coefficient coordinates, so that the position (0,0) is at the upper left corner, and the position (K-1,K-1) is at the lower right corner. The transform is applied to the filter coefficients f(k,l) according to the gradient value calculated for the block. Table 5 summarizes the relationship between the transform and the four gradients in the four directions. Fig.11 The transform coefficients for each position based on a 5x5 diamond are shown.

[0297] Table 5. Gradient maps and transformations computed for a block.

[0298] Gradient Value Transform <![CDATA[g d2 <g d1 And g h <g v ]]> No transformation <![CDATA[g d2 <g d1 And g v <g h ]]> diagonal <![CDATA[g d1 <g d2 And g h <g v ]]> Flip vertically <![CDATA[g d1 <g d2 And g v <g h ]]> Rotation

[0299] 3.8.5. Filtering process

[0300] At the decoder side, when ALF is enabled for a block, each sample R(i,j) within the block is filtered to obtain the sample value R′(i,j) as shown below, where L represents the filter length and f m,n represents the filter coefficient, and f(k,l) represents the decoded filter coefficient.

[0301]

[0302] Fig.12 An example of relative coordinates for a 5×5 diamond filter support is shown, assuming that the coordinates (i, j) of the current sample point are (0, 0). Samples in different coordinates filled with the same color are multiplied by the same filter coefficient.

[0303] 3.8.6. Nonlinear filtering re-enactment

[0304] Linear filtering can be rewritten as follows without affecting codec efficiency:

[0305]

[0306] where w(i,j) are the same filter coefficients.

[0307] VVC introduces nonlinearity to make ALF more efficient by using a simple clipping function to reduce the impact of neighboring sample values ​​(I(x+i,y+j)) when they differ too much from the current sample value being filtered (I(x,y)).

[0308] More specifically, the ALF filter is modified as follows:

[0309]

[0310] where K(d,b)=min(b,max(-b,d)) is the clipping function and k(i,j) are the clipping parameters, which depend on the (i,j) filter coefficients. The encoder performs an optimization to find the best k(i,j).

[0311] The clipping parameters k(i,j) are specified for each ALF filter, with one clipping value being signaled for each filter coefficient. This means that at most 12 clipping values ​​can be signaled in the bitstream for each luma filter, and at most 6 clipping values ​​can be signaled in the bitstream for each chroma filter. To limit the signaling cost and encoder complexity, only 4 fixed values ​​are used, which are the same for INTER and INTRA slices.

[0312] Because the variance of local differences in luma is usually higher than that of local differences in chroma, two different sets of luma filters and chroma filters are applied. A maximum sample value in each set (here 1024 for 10-bit bit depth) is also introduced so that clipping can be disabled when not needed.

[0313] These 4 values ​​have been chosen by roughly evenly dividing the full range of sample values ​​for luma (in 10-bit encoding) and the range of 4 to 1024 for chroma in the logarithmic domain.

[0314] More precisely, the brightness table of the clipping value is obtained by the following formula:

[0315] Where M = 2 10 And N = 4

[0316] Similarly, the chromaticity table of the clipped value can be obtained according to the following formula:

[0317] Where M = 2 10 , N=4 and A=4

[0318] 3.9. Bilateral Loop Filter

[0319] 3.9.1. Bilateral Image Filter

[0320] Bilateral image filter is a nonlinear filter that smoothes noise while preserving edge structure. Bilateral filtering is a technique that makes the filter weight decrease not only with the distance between samples but also with the increase of intensity difference. In this way, edge oversmoothing can be improved. The weight is defined as

[0321]

[0322] where Δx and Δy are the vertical and horizontal distances, and ΔI is the intensity difference between the sample points.

[0323] The edge-preserving denoising bilateral filter uses a low-pass Gaussian filter for both the domain filter and the range filter. The domain low-pass Gaussian filter gives higher weights to pixels that are spatially close to the center pixel. The range low-pass Gaussian filter gives higher weights to pixels that are similar to the center pixel. Combining the range filter and the domain filter, the bilateral filter at the edge pixel becomes an elongated Gaussian filter that is oriented along the edge and greatly reduced in the gradient direction. This is why the bilateral filter can smooth out noise while preserving the edge structure.

[0324] 3.9.2. Bilateral Filters in Video Codecs

[0325] The bilateral filter in video codecs is proposed as a codec tool for VVC. The filter acts as a loop filter in parallel with the sample adaptive offset (SAO) filter. Both the bilateral filter and SAO act on the same input samples, and each filter produces an offset, which is then added to the input samples to produce output samples, which enter the next stage after clipping. The spatial filter strength σ d Determined by the block size, the smaller the block, the greater the filter strength, and the intensity filter strength σ r Determined by the quantization parameter, where stronger filtering is used for higher QPs. Only the four closest samples are used, so the filtered sample strength I F can be calculated as

[0326]

[0327] Among them I C Indicates the intensity of the central sample point, ΔI A =IA -I C Indicates the intensity difference between the center sample point and the sample point above. ΔI B , ΔI L andΔI R Represents the intensity difference between the center sample and the samples below, to the left, and to the right, respectively.

[0328] 4. Question

[0329] The existing design of adaptive loop filter in video coding has the following problems.

[0330] In the current ALF design, only the adjacent reconstructed samples in the current frame are used as the input of the online trained filter. However, there are other valuable information that can be potentially utilized, such as non-adjacent reconstructed samples in the current frame.

[0331] In the current ALF design, only the adjacent reconstructed samples in the current frame are used as the input of the offline trained filter. However, there are other valuable information that can be potentially utilized, such as the non-adjacent reconstructed samples in the current frame.

[0332] 5. Examples

[0333] In order to solve the above problems and some other problems not mentioned, the method summarized as follows is disclosed. The embodiments should be regarded as examples to explain the general concept and should not be interpreted narrowly. In addition, these embodiments can be applied separately or combined in any way.

[0334] It should be noted that the proposed method can be used as a loop filter or as post-processing.

[0335] In this disclosure, a video unit may refer to a sequence, a picture, a sub-picture, a slice, a CTU, a block, or a region.A video unit may include one color component or it may include multiple color components.

[0336] In the present disclosure, an ALF processing unit may refer to a sequence, a picture, a sub-picture, a slice, a CTU, a block, a region, or a sample. An ALF processing unit may include one color component or it may include multiple color components.

[0337] Example 1

[0338] 1) It is proposed to use at least one non-adjacent reconstructed sample in the first picture as the input of the ALF.

[0339] a. In one example, the first picture may be the current picture.

[0340] a) Alternatively, the first picture may be a reference picture.

[0341] b. In one example, the distance from a non-adjacent reconstruction sample point to the current processing position can be expressed as (x, y).

[0342] a) In one example, non-adjacent reconstruction samples may be located at the position of (x+h, y) (eg, h≠0).

[0343] b) In one example, non-adjacent reconstruction samples may be located at the position of (x, y+v) (eg, v≠0).

[0344] c) In one example, non-adjacent reconstruction samples may be located at the position of (x+h, y+v) (eg, h≠0 or v≠0).

[0345] c. In one example, non-adjacent reconstruction samples may be located in the same unit of the current processing position.

[0346] a) In one example, non-adjacent reconstructed samples may be located in the same CTU / CTB of the current filtering position.

[0347] b) In one example, non-adjacent reconstructed samples may be located in the same CU / CB of the current filtering position.

[0348] c) In one example, non-adjacent reconstructed samples may be located in the same TU / TB of the current filtering position.

[0349] d) In one example, non-adjacent reconstructed samples may be located in the same PU / PB of the current filtering position.

[0350] e) In one example, non-adjacent reconstructed samples may be located in the same predefined codec unit / block of the current filtering position.

[0351] f) In one example, non-adjacent reconstructed samples may be located in the same virtual processing decoding unit (VPDU).

[0352] d. In one example, non-adjacent reconstruction samples may be located in different cells of the current processing position.

[0353] a) In one example, non-adjacent reconstructed samples may be located in different CTUs / CTBs of the current filtering position.

[0354] b) In one example, non-adjacent reconstructed samples may be located in different CUs / CBs of the current filtering position.

[0355] c) In one example, non-adjacent reconstructed samples may be located in different TUs / TBs of the current filtering position.

[0356] d) In one example, non-adjacent reconstructed samples may be located in different PUs / PUs of the current position.

[0357] e) In one example, non-adjacent reconstructed samples may be located in different predefined codec units / blocks of the current filtering position.

[0358] f) In one example, non-adjacent reconstructed samples may be located in different VPDUs of the current position.

[0359] Example 2

[0360] 2) It is proposed to use at least one extended tap for ALF to further enhance the efficiency of ALF.

[0361] a. In one example, at least one extended tap may be different from any existing spatial domain taps in the ALF.

[0362] b. In one example, at least one extended tap and at least one existing spatial domain tap may coexist within one ALF filter.

[0363] a) In one example, the ALF filter may consist of both existing spatial domain taps and extended taps.

[0364] 1. In one example, the ALF filter may consist of M (eg, M>0) existing spatial taps and N (eg, N>0) extended taps.

[0365] b) Alternatively, the ALF filter may consist of only one or more existing spatial domain taps.

[0366] c) Alternatively, the ALF filter may consist of one or more extension taps only.

[0367] c. In one example, a filter with at least one extended tap may be applied to filter different color components.

[0368] a) In one example, a filter with at least one extended tap may only be applied to filter the luma component.

[0369] b) Alternatively, the filter with at least one extended tap may be applied to filter only one of the chroma components (eg, the Cb or Cr component).

[0370] c) Alternatively, a filter with at least one extended tap may be applied to filter two chrominance components (eg, Cb and Cr components).

[0371] d) Alternatively, a filter with at least one extended tap may be applied to filter all luminance and chrominance components.

[0372] d. In one example, a filter with at least one extended tap may be used to form an independent filter in the ALF.

[0373] a) In one example, a filter with at least one extended tap may be used to form an independent filter in the ALF.

[0374] b) In one example, training data collection for a filter with at least one extended tap may be performed independently.

[0375] 1. In one example, training data collection for a filter with at least one extended tap may be performed based on ALF unfiltered samples.

[0376] 2. Alternatively, training data collection for a filter with at least one extended tap may be performed based on ALF filtered samples.

[0377] c) Alternatively, the coefficients of a filter with at least one extended tap may be trained independently.

[0378] d) Alternatively, the parameters of the filter having at least one extended tap (eg non-linear clipping parameters) may be generated / derived independently.

[0379] e. In one example, a first syntax element may be signaled to indicate whether a filter with at least one extended tap is enabled.

[0380] a) In one example, the first syntax element may be encoded and decoded by arithmetic coding and decoding.

[0381] 1. In one example, a first syntax element may be encoded or decoded with at least one context.

[0382] a. The context may depend on the codec information of the current block or neighboring blocks.

[0383] b. The context may depend on the filter shape of at least one neighboring block.

[0384] 2. In one example, the first syntax element may be encoded and decoded using bypass codec.

[0385] b) In one example, the first syntax element may be binarized by a unary code, a truncated unary code, a fixed-length code, an exponential Golomb code, a truncated exponential Golomb code, or the like.

[0386] c) In one example, the first syntax element may be conditionally signaled.

[0387] 1. For example, the first syntax element may be signaled only when extended taps are available.

[0388] d) The first syntax element may be encoded or decoded in a predictive manner.

[0389] 1. The first syntax element may be predicted by an on / off decision of an extended tap of at least one neighboring block.

[0390] e) The first syntax element may be signaled independently for different color components.

[0391] 1. Alternatively, the first syntax element may be signaled and shared for different color components.

[0392] 2. Alternatively, the first syntax element may be signaled for the first color component, but not for the second color component.

[0393] f. A syntax element structure (such as an APS) may contain one or more filters with at least one extended tap.

[0394] a) In one example, the coefficients of the extended taps may be included in the APS.

[0395] b) In one example, the clipping parameters of the extended taps may be included in the APS.

[0396] c) In one example, the class merging result of the extended taps can be included in the APS.

[0397] d) Alternatively, other parameters of the extended taps may be included in the APS.

[0398] Example 3

[0399] 3 proposes to use one or more non-adjacent reconstructed samples as the input of the ALF offline filter.

[0400] a. In one example, one or more non-adjacent reconstructed samples may be used as input to one or more offline filters of the ALF.

[0401] a) In one example, one or more non-adjacent reconstructed samples may be used as input to all taps of the off-line filter of the ALF.

[0402] b) In one example, one or more non-adjacent reconstructed samples may be used as input to some of the taps of the offline filter of the ALF.

[0403] Example 4

[0404] 4) It is proposed to use one or more non-adjacent reconstructed samples as the input of the ALF classifier.

[0405] a. In one example, one or more non-adjacent reconstructed samples may be used as input to a classifier of an offline filter of an ALF.

[0406] a) In one example, one or more non-adjacent reconstructed samples may be used as input to a gradient-based classifier of an offline filter of the ALF.

[0407] b) In one example, one or more non-adjacent reconstructed samples may be used as input to a band-based classifier of an offline filter of the ALF.

[0408] c) In one example, one or more non-adjacent reconstructed samples may be used as input to a neural network based classifier of an offline filter of the ALF.

[0409] d) In one example, one or more non-adjacent reconstructed samples may be used as input to a machine learning based classifier of an offline filter of the ALF.

[0410] e) In one example, one or more non-adjacent reconstructed samples may be used as input to a mix-based classifier of an offline filter of the ALF.

[0411] f) In one example, one or more non-adjacent reconstructed samples may be used as input to any other classifier of the offline filter of the ALF.

[0412] b. In one example, one or more non-adjacent reconstructed samples may be used as input to a classifier for online filtering of the ALF.

[0413] a) In one example, one or more non-adjacent reconstructed samples may be used as input to a gradient-based classifier of an online filter of the ALF.

[0414] b) In one example, one or more non-adjacent reconstructed samples may be used as input to a band-based classifier of an online filter of the ALF.

[0415] c) In one example, one or more non-adjacent reconstructed samples may be used as input to a neural network based classifier of an online filter of the ALF.

[0416] d) In one example, one or more non-adjacent reconstructed samples may be used as input to a machine learning based classifier of an online filter of the ALF.

[0417] e) In one example, one or more non-adjacent reconstructed samples may be used as input to a classifier based on a hybrid approach for an online filter of the ALF.

[0418] f) In one example, one or more non-adjacent reconstructed samples may be used as input to any other classifier of the ALF's online filter.

[0419] Example 5

[0420] 5) It is proposed to use one or more non-adjacent reconstructed samples as the input of the ALF online filter.

[0421] a. In one example, one or more non-adjacent reconstructed samples may be used as input to the spatial domain taps of the online filter of the ALF.

[0422] a) In one example, one or more non-adjacent reconstructed samples may be used as input to all spatial taps of the ALF's online filter.

[0423] b) Alternatively, one or more non-adjacent reconstructed samples may be used as input to some of the taps of the on-line filter of the ALF.

[0424] b. In one example, one or more non-adjacent reconstructed samples may be used as input to the expansion taps of the on-line filter of the ALF.

[0425] a) In one example, one or more non-adjacent reconstructed samples may be used as input to all expansion taps of the on-line filter of the ALF.

[0426] b) In one example, one or more non-adjacent reconstructed samples may be used as input to a partial expansion tap of an on-line filter of an ALF.

[0427] Example 6

[0428] 6) In one example, non-adjacent samples of different color components may be used.

[0429] a. In one example, one or more non-adjacent luma samples may be used to generate the luma output of the ALF.

[0430] b. In one example, one or more non-adjacent luma samples may be used to generate the chroma output of the ALF.

[0431] c. In one example, one or more non-adjacent chroma samples may be used to generate the luma output of the ALF.

[0432] d. In one example, one or more non-adjacent chroma samples may be used to generate the chroma output of the ALF.

[0433] Example 7

[0434] 7) In one example, the above mentioned methods can be used in combination.

[0435] Example 8

[0436] 8) Alternatively, the above-mentioned methods may be used individually.

[0437] Example 9

[0438] 9) In one example, the proposed / described method of using non-adjacent samples can be applied to any loop filtering tool, pre-processing or post-processing filtering method in video codec (including but not limited to ALF / CCALF or any other filtering method). a. In one example, the proposed extended tap method can be applied to the loop filtering method.

[0439] a) In one example, the proposed non-adjacent sample usage method can be applied to ALF.

[0440] b) In one example, the proposed non-adjacent sample point usage method can be applied to CCALF.

[0441] c) In one example, the proposed non-adjacent sample point usage method can be applied to SAO.

[0442] d) In one example, the proposed non-adjacent sample point usage method can be applied to the bilateral filter (BIF) / chrominance

[0443] BIF.

[0444] e) Alternatively, the proposed non-adjacent sample point usage method can be applied to other loop filtering methods.

[0445] b. In one example, the proposed extended tap method can be applied to the pre-processing filtering method.

[0446] c. In one example, the proposed extended tap method can be applied to a post-processing filtering method.

[0447] Example 10

[0448] 10) In the above examples, a video unit may refer to a sequence / picture / sub-picture / slice / slice / codec tree unit (CTU) / CTU row / CTU group / codec unit (CU) / prediction unit (PU) / transform unit (TU) / codec tree block (CTB) / codec block (CB) / prediction block (PB) / transform block (TB) / any other region containing more than one luma or chroma sample / pixel.

[0449] Embodiment 11

[0450] 11) Whether and / or how to apply the method disclosed above may be signaled in the bitstream.

[0451] a. In one example, they can be signaled at sequence level / picture group level / picture level / slice level / slice group level, for example, signaled in sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / slice group header.

[0452] b. In one example, they can be in PB / TB / CB / PU / TU / CU /

[0453] VPDU / CTU / CTU row / slice / slice / sub-picture / other types of area signaling notification.

[0454] Example 12

[0455] 12) Whether and / or how to apply the method disclosed above may depend on codec information such as block size, color format, single / dual tree partitioning, color component, slice / picture type.

[0456] Fig.13 4000 is a block diagram illustrating an example video processing system 4000 in which various techniques disclosed herein may be implemented. Various implementations may include some or all of the components of system 4000. System 4000 may include an input 4002 for receiving video content. The video content may be received in a raw or uncompressed format (e.g., 8-bit or 10-bit multi-component pixel values), or may be received in a compressed or encoded format. Input 4002 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interfaces include wired interfaces such as Ethernet, a passive optical network (PON), etc., and wireless interfaces such as Wi-Fi or a cellular interface.

[0457] System 4000 may include a codec component 4004 that may implement various codecs or coding methods described in this document. Codec component 4004 may reduce the average bit rate of the video from the input 4002 to the codec component 4004 to the output to generate the codec representation of the video. Therefore, codec technology is sometimes referred to as video compression or video transcoding technology. The output of codec component 4004 may be stored or sent via the connected communication, as shown in component 4006. The stored or transmitted bitstream representation (or codec representation) of the video received at input 4002 may be used by component 4008 to generate pixel values ​​or displayable video, which is sent to display interface 4010. The process of generating user-visible video from bitstream representation is sometimes referred to as video decompression. In addition, although some video processing operations are referred to as "codec" operations or tools, it should be understood that codec tools or operations are used in encoders, and decoders will perform corresponding decoding tools or operations of the reverse process of encoding.

[0458] Examples of peripheral bus interfaces or display interfaces may include Universal Serial Bus (USB) or High Definition Multimedia Interface (HDMI) or Display Port, etc. Examples of storage interfaces include Serial Advanced Technology Attachment (SATA), Peripheral Component Interconnect (PCI), Integrated Drive Electronics (IDE) interface, etc. The techniques described in this document may be embodied in various electronic devices such as mobile phones, laptop computers, smart phones, or other devices capable of performing digital data processing and / or video display.

[0459] Fig.14 4106 is a block diagram of an example video processing device 4100. Device 4100 may be used to implement one or more methods described herein. Device 4100 may be implemented as a smart phone, a tablet computer, a computer, an Internet of Things (IoT) receiver, etc. Device 4100 may include one or more processors 4102, one or more memories 4104, and video processing circuitry 4106. Processor 4102 may be configured to implement one or more methods described in this document. Memory (memory) 4104 may be used to store data and code for implementing the methods and techniques described herein. Video processing circuitry 4106 may be used to implement some of the techniques described in this document in hardware circuits. In some embodiments, video processing circuitry 4106 may be at least partially included in processor 4102 (e.g., a graphics coprocessor).

[0460] Fig.15 4200 is a flow chart of an example method 4200 for video processing. The method 4200 includes determining at step 4202 to perform a conversion, such as a conversion between visual media data and a bitstream. The determination at step 4202 to perform the conversion may include obtaining non-adjacent reconstructed samples of a picture of the video and inputting the non-adjacent reconstructed samples of the picture as input to the ALF. At step 4204, based on inputting the non-adjacent reconstructed samples of the current picture as input to the ALF, the conversion between the visual media data and the bitstream is performed. According to an example, the conversion at step 4204 may include encoding at an encoder or decoding at a decoder.

[0461] It should be noted that the method 4200 may be implemented in a device for processing video data, the device comprising a processor and a non-transitory memory having instructions thereon, such as the video encoder 4400, the video decoder 4500, and / or the encoder 4600. In this case, the instructions, when executed by the processor, cause the processor to perform the method 4200. In addition, the method 4200 may be performed by a non-transitory computer-readable medium including a computer program product for use by a video codec device. The computer program product includes computer executable instructions stored on a non-transitory computer-readable medium, such that when executed by the processor, the video codec device performs the method 4200.

[0462] Fig.16 43 is a block diagram illustrating an example video codec system 4300 that can utilize the techniques of the present disclosure. The video codec system 4300 may include a source device 4310 and a target device 4320. The source device 4310 generates encoded video data, which may be referred to as a video encoding device. The target device 4320 may decode the encoded video data generated by the source device 4310, which may be referred to as a video decoding device.

[0463] Source device 4310 may include video source 4312, video encoder 4314 and input / output (I / O) interface 4316. Video source 4312 may include a source such as a video capture device, an interface for receiving video data from a video content provider and / or a computer graphics system for generating video data, or a combination of such sources. Video data may include one or more pictures. Video encoder 4314 encodes video data from video source 4312 to generate a bitstream. The bitstream may include a series of bits that form a codec representation of video data. The bitstream may include codec pictures and associated data. Codec pictures are codec representations of pictures. Associated data may include sequence parameter sets, picture parameter sets and other syntax structures. I / O interface 4316 may include a modulator / demodulator (modem) and / or a transmitter. The encoded video data may be directly sent to target device 4320 via network 4330 via I / O interface 4316. The encoded video data may also be stored on storage medium / server 4340 for access by target device 4320.

[0464] Target device 4320 may include an I / O interface 4326, a video decoder 4324, and a display device 4322. The I / O interface 4326 may include a receiver and / or a modem. The I / O interface 4326 may obtain encoded video data from source device 4310 or storage medium / server 4340. The video decoder 4324 may decode the encoded video data. The display device 4322 may display the decoded video data to a user. The display device 4322 may be integrated with the target device 4320, or may be external to the target device 4320, which may be configured to interface with an external display device.

[0465] The video encoder 4314 and the video decoder 4324 may operate according to a video compression standard, such as the High Efficiency Video Codec (HEVC) standard, the Versatile Video Codec (VVC) standard, and other current and / or additional standards.

[0466] Fig.17is a block diagram showing an example of a video encoder 4400, which may be Fig.16 Video encoder 4314 in system 4300 shown. Video encoder 4400 can be configured to perform any or all of the techniques of the present disclosure. Video encoder 4400 includes multiple functional components. The techniques described in the present disclosure can be shared between the various components of video encoder 4400. In some examples, the processor can be configured to perform any or all of the techniques described in the present disclosure.

[0467] The functional components of the video encoder 4400 may include a segmentation unit 4401; a prediction unit 4402, which may include a mode selection unit 4403, a motion estimation unit 4404, a motion compensation unit 4405 and an intra-frame prediction unit 4406; a residual generation unit 4407; a transform processing unit 4408; a quantization unit 4409; an inverse quantization unit 4410; an inverse transform unit 4411; a reconstruction unit 4412; a buffer area 4413 and an entropy coding unit 4414.

[0468] In other examples, the video encoder 4400 may include more, fewer, or different functional components. In an example, the prediction unit 4402 may include an intra-block copy (IBC) unit. The IBC unit may perform prediction in an IBC mode, where at least one reference picture is a picture where the current video block is located.

[0469] Furthermore, some components, such as the motion estimation unit 4404 and the motion compensation unit 4405 , may be highly integrated but are represented separately in the example of the video encoder 4400 for explanation purposes.

[0470] The segmentation unit 4401 may segment the picture into one or more video blocks. The video encoder 4400 and the video decoder 4500 may support various video block sizes.

[0471] The mode selection unit 4403 may select one of the codec modes, for example, based on the error result, and provide the resulting intra-frame or inter-frame codec block to the residual generation unit 4407 to generate residual block data and to the reconstruction unit 4412 to reconstruct the codec block for use as a reference picture. In some examples, the mode selection unit 4403 may select a combined intra and inter prediction (CIIP) mode, where the prediction is based on an inter prediction signal and an intra prediction signal. The mode selection unit 4403 may also select a resolution of motion vectors for the block in the case of inter prediction (e.g., sub-pixel or integer pixel precision).

[0472] To perform inter-frame prediction on the current video block, the motion estimation unit 4404 may generate motion information for the current video block by comparing one or more reference frames from the buffer 4413 with the current video block. The motion compensation unit 4405 may determine a predicted video block for the current video block based on the motion information and decoded samples of a picture from the buffer 4413 instead of the picture associated with the current video block.

[0473] The motion estimation unit 4404 and the motion compensation unit 4405 may perform different operations on the current video block, for example, depending on whether the current video block is in an I slice, a P slice, or a B slice.

[0474] In some examples, the motion estimation unit 4404 may perform unidirectional prediction on the current video block, and the motion estimation unit 4404 may search for a reference video block for the current video block in the reference pictures of list 0 or list 1. The motion estimation unit 4404 may then generate a reference index indicating a reference picture in list 0 or list 1, the reference picture containing the reference video block and a motion vector indicating a spatial displacement between the current video block and the reference video block. The motion estimation unit 4404 may output the reference index, the prediction direction indicator, and the motion vector as motion information of the current video block. The motion compensation unit 4405 may generate a predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.

[0475] In other examples, the motion estimation unit 4404 may perform bidirectional prediction on the current video block, and the motion estimation unit 4404 may search for a reference video block of the current video block in the reference pictures in list 0, and may also search for another reference video block of the current video block in the reference pictures in list 1. The motion estimation unit 4404 may then generate a reference index indicating a reference picture in list 0 and list 1, the reference picture containing a reference video block and a motion vector indicating a spatial displacement between the reference video block and the current video block. The motion estimation unit 4404 may output the reference index and the motion vector of the current video block as motion information of the current video block. The motion compensation unit 4405 may generate a predicted video block of the current video block based on the reference video block indicated by the motion information of the current video block.

[0476] In some examples, motion estimation unit 4404 may output a complete set of motion information for use in a decoding process of a decoder. In some examples, motion estimation unit 4404 may not output a complete set of motion information for the current video. Rather, motion estimation unit 4404 may reference motion information of another video block to signal motion information of the current video block. For example, motion estimation unit 4404 may determine that motion information of the current video block is sufficiently similar to motion information of an adjacent video block.

[0477] In one example, the motion estimation unit 4404 may indicate a value in a syntax structure associated with the current video block that indicates to the video decoder 4500 that the current video block has the same motion information as another video block.

[0478] In another example, the motion estimation unit 4404 can identify another video block and a motion vector difference (MVD) in a syntax structure associated with the current video block. The motion vector difference indicates the difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 4500 can use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.

[0479] As discussed above, the video encoder 4400 can predictively signal motion vectors.Two examples of predictive signaling techniques that can be implemented by the video encoder 4400 include Advanced Motion Vector Prediction (AMVP) and Merge mode signaling.

[0480] The intra prediction unit 4406 may perform intra prediction on the current video block. When the intra prediction unit 4406 performs intra prediction on the current video block, the intra prediction unit 4406 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include the predicted video block and various syntax elements.

[0481] The residual generating unit 4407 may generate residual data for the current video block by subtracting the predicted video block of the current video block from the current video block. The residual data of the current video block may include residual video blocks corresponding to different sample components of the samples in the current video block.

[0482] In other examples, such as in skip mode, there may be no residual data for the current video block of the current video block, and the residual generation unit 4407 may not perform a subtraction operation.

[0483] The transform processing unit 4408 may generate a transform coefficient video block for a current video block by applying one or more transforms to the residual video block associated with the current video block.

[0484] After the transform processing unit 4408 generates a transform coefficient video block associated with the current video block, the quantization unit 4409 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values ​​associated with the current video block.

[0485] The inverse quantization unit 4410 and the inverse transform unit 4411 may apply inverse quantization and inverse transform to the transform coefficient video block, respectively, to reconstruct a residual video block from the transform coefficient video block. The reconstruction unit 4412 may add the reconstructed residual video block to corresponding samples from one or more predicted video blocks generated by the prediction unit 4402 to generate a reconstructed video block associated with the current block for storage in the buffer 4413.

[0486] After the reconstruction unit 4412 reconstructs the video block, a loop filtering operation may be performed to reduce video blocking effects in the video block.

[0487] The entropy coding unit 4414 may receive data from other functional components of the video encoder 4400. When the entropy coding unit 4414 receives data, the entropy coding unit 4414 may perform one or more entropy coding operations to generate entropy coded data and output a bitstream including the entropy coded data.

[0488] Fig.18 is a block diagram showing an example of a video decoder 4500, which may be Fig.16 Video decoder 4324 in the system 4300 shown. Video decoder 4500 can be configured to perform any or all of the techniques of the present disclosure. In the example shown, video decoder 4500 includes multiple functional components. The techniques described in the present disclosure can be shared between the various components of video decoder 4500. In some examples, the processor can be configured to perform any or all of the techniques described in the present disclosure.

[0489] In the example shown, the video decoder 4500 includes an entropy decoding unit 4501, a motion compensation unit 4502, an intra-frame prediction unit 4503, an inverse quantization unit 4504, an inverse transform unit 4505, and a reconstruction unit 4506, a buffer area 4507. In some examples, the video decoder 4500 can perform a decoding process that is substantially the inverse of the encoding process described with respect to the video encoder 4400.

[0490] The entropy decoding unit 4501 may retrieve an encoded bitstream. The encoded bitstream may include entropy-encoded video data (e.g., encoded video data blocks). The entropy decoding unit 4501 may decode the entropy-encoded video data, and the motion compensation unit 4502 may determine motion information based on the entropy-decoded video data, the motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. The motion compensation unit 4502 may determine such information, for example, by performing AMVP and Merge modes.

[0491] The motion compensation unit 4502 may generate a motion compensated block, possibly performing interpolation based on an interpolation filter. The identification of the interpolation filter used with sub-pixel precision may be included in a syntax element.

[0492] The motion compensation unit 4502 may calculate interpolation of sub-integer pixels of a reference block using an interpolation filter used by the video encoder 4400 during encoding of the video block. The motion compensation unit 4502 may determine the interpolation filter used by the video encoder 4400 according to received syntax information and use the interpolation filter to generate a prediction block.

[0493] The motion compensation unit 4502 can use some syntax information to determine the size of blocks used to encode frames and / or slices of the encoded video sequence, partitioning information describing how each macroblock of the pictures of the encoded video sequence is partitioned, a mode indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-frame codec block, and other information used to decode the encoded video sequence.

[0494] The intra prediction unit 4503 may form a prediction block from spatially adjacent blocks using, for example, an intra prediction mode received in the bitstream. The inverse quantization unit 4504 inversely quantizes, i.e., dequantizes, the video block coefficients provided in the bitstream and decoded and quantized by the entropy decoding unit 4501. The inverse transform unit 4505 applies an inverse transform.

[0495] The reconstruction unit 4506 may add the residual block to the corresponding prediction block generated by the motion compensation unit 4502 or the intra prediction unit 4503 to form a decoded block. If necessary, a deblocking filter may also be applied to filter the decoded block to eliminate block artifacts. The decoded video block is then stored in a buffer 4507, which provides reference blocks for subsequent motion compensation / intra prediction and also generates decoded video for presentation on a display device.

[0496] Fig.194600 is a schematic diagram of an example encoder 4600. The encoder 4600 is suitable for implementing VVC technology. The encoder 4600 includes three loop filters, namely, a deblocking filter (DF) 4602, a sample adaptive offset (SAO) 4604, and an adaptive loop filter (ALF) 4606. Unlike the DF 4602 that uses a predefined filter, the SAO 4604 and the ALF 4606 use the original samples of the current picture to reduce the mean square error between the original samples and the reconstructed samples by adding an offset and applying a finite impulse response (FIR) filter, respectively, and using the codec's side information to signal the offset and filter coefficients. The ALF 4606 is located at the last processing stage of each picture and can be seen as a tool that attempts to capture and repair artifacts created by previous stages.

[0497] The encoder 4600 also includes an intra prediction component 4608 and a motion estimation / compensation (ME / MC) component 4610 configured to receive an input video. The intra prediction component 4608 is configured to perform intra prediction, while the ME / MC component 4610 is configured to perform inter prediction using a reference picture obtained from a reference picture buffer 4612. The residual block from the inter prediction or intra prediction is fed to the transform (T) component 4614 and the quantization (Q) component 4616 to generate quantized residual transform coefficients, which are fed to the entropy coding component 4618. The entropy coding component 4618 entropy codes and decodes the prediction result and the quantized transform coefficients and sends them to a video decoder (not shown). The quantized component output from the quantization component 4616 can be fed to the inverse quantization (IQ) component 4620, the inverse transform component 4622, and the reconstruction (REC) component 4624. The REC component 4624 is capable of outputting images to the DF 4602 , SAO 4604 , and ALF 4606 for filtering before these pictures are stored in the reference picture buffer 4612 .

[0498] A list of solutions preferred by some examples is provided next.

[0499] The following solutions illustrate examples of the techniques discussed herein.

[0500] 1. A method for processing video data, comprising: obtaining non-adjacent reconstructed samples of a picture of a video; inputting the non-adjacent reconstructed samples of the picture as input of an adaptive loop filter (ALF); and in response to inputting the non-adjacent reconstructed samples of a current picture as the input of the ALF, performing conversion between the video and a bitstream of the video.

[0501] The method of claim 1 , wherein the picture is a current picture or a reference picture.

[0502] 3. The method of any one of claims 1 to 2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample is given by (x+h, y), where h is not equal to 0.

[0503] 4. The method of any one of claims 1 to 2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample is given by (x, y+v), where v is not equal to 0.

[0504] 5. The method of any one of claims 1 to 2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample point is given by (x+h, y+v), where h and v are not equal to 0.

[0505] 6. The method of any one of claims 1 to 5, wherein the non-adjacent reconstructed samples are located in the same codec tree unit, codec tree block, codec unit, codec block, transform unit, transform block, picture unit, picture block or virtual processing decoding unit as the current processing position.

[0506] 7. The method of any one of claims 1 to 5, wherein the non-adjacent reconstructed samples are located in different codec tree units, codec tree blocks, codec units, codec blocks, transform units, transform blocks, picture units, picture blocks or virtual processing decoding units from the current processing position.

[0507] 8. The method of any one of claims 1 to 7, wherein the ALF comprises at least N extension taps, wherein N is greater than 0.

[0508] 9. The method of any one of claims 1 to 8, wherein the ALF comprises at least M existing spatial domain taps, wherein M is greater than 0.

[0509] 10. The method of any one of claims 1 to 7, wherein the ALF comprises only one or more extension taps.

[0510] 11. The method of any one of claims 1 to 7, wherein the ALF comprises only one or more existing spatial domain taps.

[0511] 12. The method of any one of claims 1 to 11, wherein the ALF is applied only to the luma components of the non-adjacent reconstructed samples.

[0512] 13. The method of any one of claims 1 to 11, wherein the ALF is applied only to the first chrominance component (Cb) or the second chrominance component (Cr) of the non-adjacent reconstructed samples.

[0513] 14. The method of any one of claims 1 to 11, wherein the ALF is applied to a first chrominance component (Cb) and a second chrominance component (Cr) of the non-adjacent reconstructed samples.

[0514] 15. The method of any one of claims 1 to 11, wherein the ALF is applied to a luma component, a first chroma component (Cb), and a second chroma component (Cr) of the non-adjacent reconstructed samples.

[0515] 16. The method of any one of claims 1 to 15, wherein the at least one extended tap forms an independent filter in the ALF.

[0516] 17. The method according to any one of claims 1 to 16, wherein the training data collection of the ALF including at least one extended tap is performed independently based on samples that have not been ALF filtered or based on samples that have been ALF filtered.

[0517] 18. The method of any one of claims 1 to 17, wherein coefficients of the ALF including at least one extended tap are independently trained, wherein nonlinear clipping parameters of the ALF including at least one extended tap are independently generated or derived, or a combination thereof.

[0518] 19. The method of any one of claims 1 to 18, wherein a first syntax element is signaled to indicate whether the ALF with at least one extended tap is enabled.

[0519] 20. The method of any one of claims 1 to 19, wherein the first syntax element is encoded and decoded using arithmetic coding, the first syntax element is encoded and decoded using bypass coding, the first syntax element is encoded and decoded using at least one context, the context depends on coding information of a current block or a neighboring block, the context depends on a filter shape of at least one neighboring block, or a combination thereof.

[0520] 21. The method of any one of claims 1 to 19, wherein the first syntax element is binarized by a unary code, a truncated unary code, a fixed length code, an exponential Golomb code, or a truncated exponential Golomb code.

[0521] 22. The method of any one of claims 1 to 21, wherein the first syntax element is conditionally signaled based on whether the extended tap is available.

[0522] 23. The method of any one of claims 1 to 21, wherein the first syntax element is coded in a predictive manner, wherein the first syntax element is predicted based on an on / off decision of an extended tap of at least one neighboring block.

[0523] 24. A method as described in any one of claims 1 to 23, wherein the first syntax element is signaled independently for different color components; or wherein the first syntax element is signaled for different color components and shared; or wherein the first syntax element is signaled for a first color component but not for a second color component.

[0524] 25. The method of any one of claims 1 to 24, wherein one or more non-adjacent reconstructed samples are provided as input to an offline filter of the ALF; or wherein one or more non-adjacent reconstructed samples are provided as input to all taps of the offline filter of the ALF; or wherein one or more non-adjacent reconstructed samples are provided as input to some taps of the offline filter of the ALF.

[0525] 26. The method of any one of claims 1 to 25, wherein one or more non-adjacent reconstructed samples are provided as input to a classifier of an offline filter of the ALF, wherein the classifier is a gradient-based classifier, a frequency band-based classifier, a neural network-based classifier, a machine learning-based classifier, a hybrid method-based classifier, or a combination thereof.

[0526] 27. The method of any one of claims 1 to 26, wherein one or more non-adjacent reconstructed samples are provided as input to a classifier of an online filter of the ALF, wherein the classifier is a gradient-based classifier, a frequency band-based classifier, a neural network-based classifier, a machine learning-based classifier, a hybrid method-based classifier, or a combination thereof.

[0527] 28. The method of any one of claims 1 to 27, wherein the existing spatial taps are spatial taps of an online filter of the ALF, and wherein one or more non-adjacent reconstructed sample points are provided as inputs to the spatial taps of the online filter of the ALF, wherein one or more non-adjacent reconstructed sample points are provided as inputs to all spatial taps of the online filter of the ALF, or wherein one or more non-adjacent reconstructed sample points are provided as inputs to part of the spatial taps of the online filter of the ALF.

[0528] 29. The method of any one of claims 1 to 28, wherein the extended taps are extended taps of an online filter of the ALF, and wherein one or more non-adjacent reconstructed sample points are provided as inputs to the extended taps of the online filter of the ALF, wherein one or more non-adjacent reconstructed sample points are provided as inputs to all extended taps of the online filter of the ALF, or wherein one or more non-adjacent reconstructed sample points are provided as inputs to part of the extended taps of the online filter of the ALF.

[0529] 30. The method of any one of claims 1 to 29, wherein the luma output of the ALF is based on a luma component of one or more non-adjacent reconstructed samples, wherein the chroma output of the ALF is based on a luma component of one or more non-adjacent reconstructed samples, wherein the luma output of the ALF is based on a chroma component of one or more non-adjacent reconstructed samples, wherein the chroma output of the ALF is based on a chroma component of one or more non-adjacent reconstructed samples, or a combination thereof.

[0530] 31. The method of any one of claims 1 to 30, wherein the non-adjacent reconstructed samples are provided as input to a loop filter, wherein the non-adjacent reconstructed samples are provided as input to a pre-processing filter, wherein the non-adjacent reconstructed samples are provided as input to a post-processing filter, or a combination thereof.

[0531] 32. The method of claim 31, wherein the loop filter comprises the ALF, a cross-component ALF (CCALF), a sample adaptive offset (SAO) filter, a bilateral filter (BF), a chroma BF, or a combination thereof.

[0532] 33. The method of any one of claims 1 to 32, wherein whether or how the non-adjacent reconstructed samples of the picture are input into the ALF is signaled in the bitstream.

[0533] 34. A method as described in any one of claims 1 to 33, wherein a syntax element structure includes one or more filters having at least one extended tap, wherein the syntax element structure includes coefficients of the at least one extended tap, limiting parameters of the at least one extended tap, class merging results of the at least one extended tap, other parameters of the at least one extended tap, or a combination thereof.

[0534] 35. The method of any one of claims 1 to 34, wherein whether or how the non-adjacent reconstructed samples of the picture are input into the ALF is based on codec information, the codec information comprising block size, color format, single / dual tree partitioning, color component, slice / picture type, or a combination thereof.

[0535] 36. The method of any one of claims 1 to 35, wherein the converting comprises encoding the video into the bitstream.

[0536] 37. The method of any one of claims 1 to 35, wherein the converting comprises decoding the video from the bitstream.

[0537] 38. An apparatus for processing video data, comprising: a processor; and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method of any one of claims 1 to 37.

[0538] 39. A non-transitory computer-readable medium, comprising a computer program product for use by a video codec device, the computer program product comprising computer executable instructions stored on the non-transitory computer-readable medium, so that when executed by a processor, the video codec device performs the method as described in any one of claims 1 to 37.

[0539] 40. A non-transitory computer-readable recording medium storing a bit stream of a video generated by a method performed by a video processing device, wherein the method comprises the method of any one of claims 1 to 37.

[0540] 41. A method for storing a bitstream of a video, comprising the method of any one of claims 1 to 37, wherein performing conversion between the video and the bitstream of the video in response to inputting the non-adjacent reconstructed samples of the current picture as the input to the ALF comprises generating the bitstream, and wherein the method further comprises storing the bitstream in a non-transitory computer-readable medium.

[0541] 42. A method, apparatus or system as described in the present disclosure.

[0542] In the solution described in this article, the encoder can comply with the format rules by generating a codec representation according to the format rules. In the solution described in this article, the decoder can use the format rules to parse the syntax elements in the codec representation, and the presence and absence of the syntax elements are known according to the format rules to generate the decoded video. In this article, the term "video processing" can refer to video encoding, video decoding, video compression or video decompression. For example, the video compression algorithm can be applied during the conversion from the pixel representation of the video to the corresponding bitstream representation (or vice versa). For example, the bitstream representation of the current video block can correspond to bits at different positions in the co-location or distribution in the bitstream, as defined by the syntax. For example, the macroblock can be encoded according to the error residual value of the transform and the codec, and is also encoded using bits in the header and other fields in the bitstream. In addition, during the conversion, the decoder can parse the bitstream based on the determination, and it is known that certain fields may exist or not exist, as described in the above solution. Similarly, the encoder can determine whether to include certain syntax fields and generate the codec representation accordingly by including or excluding syntax fields in the codec representation.

[0543] The solutions, examples, embodiments, modules and functional operations described and disclosed herein and others can be implemented in digital electronic circuits or computer software, firmware or hardware or a combination of one or more thereof, which includes the structures disclosed in this document and their equivalents. The disclosed embodiments and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions, encoded on a computer-readable medium for execution by a data processing device or for controlling the operation of the data processing device. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a material composition that affects a machine-readable propagation signal, or a combination of one or more thereof. The term "data processing device" covers all devices, equipment and machines for processing data, including, for example, a programmable processor, a computer or multiple processors or computers. In addition to hardware, the device may also include code that creates an execution environment for the computer program in question, for example, code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more thereof. A propagation signal is an artificially generated signal, for example, a machine-generated electrical, optical or electromagnetic signal, which is generated to encode information for transmission to a suitable receiver device.

[0544] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or any other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program may be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or portions of code). A computer program may be deployed to execute on one computer or on multiple computers, which are located at one site or distributed across multiple sites and interconnected by a communication network.

[0545] The processes or logic flows described herein may be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows may also be performed by, and the apparatus may also be implemented as, special purpose logic circuitry, such as a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC).

[0546] Processors suitable for executing computer programs include, for example, both general-purpose microprocessors and special-purpose microprocessors and any one or more processors of any kind of digital computer. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include one or more mass storage devices for storing data, such as magnetic disks, magneto-optical disks, or optical disks, or be operably coupled to receive data from one or more mass storage devices or transfer data to one or more mass storage devices or both. However, a computer does not necessarily have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including, for example, semiconductor memory devices, such as erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and compact disc read-only memory (CD ROM) and digital versatile disc read-only memory (DVD-ROM) disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

[0547] Although the present disclosure contains many details, these details should not be interpreted as limitations on the scope of any subject matter or content that may be claimed, but should be interpreted as descriptions of features of specific embodiments that may be specific to a particular technology. Certain features described in the context of separate embodiments in the present disclosure may also be implemented in combination in a single embodiment. Conversely, the individual features described in the context of a single embodiment may also be implemented in multiple embodiments individually or in any appropriate sub-combination. In addition, although the above may describe features as working in certain combinations and even initially claiming protection, in some cases, one or more features from the claimed combination may be removed from the combination, and the claimed combination may involve a sub-combination or a deformation of a sub-combination.

[0548] Similarly, although operations are shown in a particular order in the figures, this should not be understood as requiring such operations to be performed in the particular order shown or in a sequential order or to perform all of the operations shown to achieve the desired results. In addition, the separation of various system components described in this disclosure should not be understood as requiring such separation in all embodiments.

[0549] Only a few implementations and examples are described herein, and other implementations, enhancements, and variations may be made based on what is described and illustrated in this disclosure.

[0550] A first component is directly coupled to a second component when there are no intermediate components other than a line, trace, or another medium between the first and second components. A first component is indirectly coupled to a second component when there are intermediate components other than a line, trace, or another medium between the first and second components. The term "coupled" and variations thereof include direct coupling and indirect coupling. Unless otherwise specified, the use of the term "about" is meant to include a range of ±10% of the subsequent value.

[0551] Although several embodiments are provided in the present disclosure, it should be understood that the disclosed systems and methods may be implemented in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are considered to be illustrative rather than restrictive and should not be limited to the details given herein. For example, various elements or components may be combined or integrated in another system, or certain features may be omitted or not implemented.

[0552] In addition, without departing from the scope of the present disclosure, the techniques, systems, subsystems and methods described and shown as discrete or separate in various embodiments may be combined or integrated with other systems, modules, techniques or methods. Other items shown or discussed as coupled may be directly connected, or may be indirectly coupled or communicated through some interface, device or intermediate component, whether electrically, mechanically or otherwise coupled or communicated. Other examples of changes, substitutions and alterations may be identified by those skilled in the art, and these changes, substitutions and alterations may be made without departing from the spirit and scope disclosed herein.

[0553] The schemes listed in this disclosure may be used to compress images, compress videos, compress portions of images, or compress portions of videos.

[0554] In addition, the techniques, systems, subsystems, and methods described and illustrated in the various embodiments may be used to compress images, compress videos, compress portions of images, or compress portions of videos.

Claims

1. A method for processing video data, comprising: Get non-adjacent reconstructed sample points of a picture of the video; Inputting non-adjacent reconstructed samples of the picture as input to an adaptive loop filter (ALF); as well as In response to inputting the non-adjacent reconstructed samples of a current picture as the input of the ALF, conversion between the video and a bitstream of the video is performed. The method of claim 1 , wherein the picture is a current picture or a reference picture.

3. The method of any one of claims 1-2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample point is given by (x+h, y), where h is not equal to 0.

4. The method of any one of claims 1-2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample point is given by (x, y+v), where v is not equal to 0.

5. The method of any one of claims 1-2, wherein the current processing position of the picture is given by (x, y), and the position of the non-adjacent reconstruction sample point is given by (x+h, y+v), where h and v are not equal to 0.

6. The method of any one of claims 1-5, wherein the non-adjacent reconstructed samples are located in the same codec tree unit, codec tree block, codec unit, codec block, transform unit, transform block, picture unit, picture block or virtual processing decoding unit as the current processing position.

7. The method of any one of claims 1-5, wherein the non-adjacent reconstructed samples are located in different codec tree units, codec tree blocks, codec units, codec blocks, transform units, transform blocks, picture units, picture blocks or virtual processing decoding units from the current processing position.

8. The method of any one of claims 1-7, wherein the ALF comprises at least N extension taps, wherein N is greater than 0.

9. The method of any one of claims 1-8, wherein the ALF comprises at least M existing spatial domain taps, wherein M is greater than 0.

10. The method of any one of claims 1-7, wherein the ALF comprises only one or more extension taps.

11. The method of any one of claims 1-7, wherein the ALF comprises only one or more existing spatial domain taps.

12. The method according to any one of claims 1 to 11, wherein the ALF is applied only to the luma components of the non-adjacent reconstructed samples.

13. The method of any one of claims 1-11, wherein the ALF is applied only to the first chrominance component (Cb) or the second chrominance component (Cr) of the non-adjacent reconstructed samples.

14. The method of any one of claims 1-11, wherein the ALF is applied to a first chrominance component (Cb) and a second chrominance component (Cr) of the non-adjacent reconstructed samples.

15. The method of any one of claims 1-11, wherein the ALF is applied to a luma component, a first chroma component (Cb), and a second chroma component (Cr) of the non-adjacent reconstructed samples.

16. The method of any one of claims 1-15, wherein the at least one extension tap forms an independent filter in the ALF.

17. The method according to any one of claims 1 to 16, wherein the training data collection of the ALF including at least one extended tap is performed independently based on samples that have not been ALF filtered or based on samples that have been ALF filtered.

18. The method of any one of claims 1-17, wherein coefficients of the ALF including at least one extended tap are independently trained, wherein nonlinear clipping parameters of the ALF including at least one extended tap are independently generated or derived, or a combination thereof.

19. The method of any one of claims 1-18, wherein a first syntax element is signaled to indicate whether the ALF with at least one extended tap is enabled.

20. The method of any one of claims 1-19, wherein the first syntax element is encoded and decoded using arithmetic coding, the first syntax element is encoded and decoded using bypass coding, the first syntax element is encoded and decoded using at least one context, the context depends on coding information of a current block or a neighboring block, the context depends on a filter shape of at least one neighboring block, or a combination thereof.

21. The method of any one of claims 1-19, wherein the first syntax element is binarized by a unary code, a truncated unary code, a fixed length code, an exponential Golomb code, or a truncated exponential Golomb code.

22. The method of any one of claims 1-21, wherein the first syntax element is conditionally signaled based on whether the extended tap is available.

23. The method of any one of claims 1-21, wherein the first syntax element is coded in a predictive manner, wherein the first syntax element is predicted based on an on / off decision of an extended tap of at least one neighboring block.

24. The method of any one of claims 1-23, wherein the first syntax element is signaled independently for different color components; or wherein the first syntax element is signaled for different color components and shared; or wherein the first syntax element is signaled for a first color component but not for a second color component.

25. The method of any one of claims 1-24, wherein one or more non-adjacent reconstructed samples are provided as input to an offline filter of the ALF; or wherein one or more non-adjacent reconstructed samples are provided as input to all taps of the offline filter of the ALF; or wherein one or more non-adjacent reconstructed samples are provided as input to some taps of the offline filter of the ALF.

26. The method of any one of claims 1-25, wherein one or more non-adjacent reconstructed samples are provided as input to a classifier of an offline filter of the ALF, wherein the classifier is a gradient-based classifier, a frequency band-based classifier, a neural network-based classifier, a machine learning-based classifier, a hybrid method-based classifier, or a combination thereof.

27. The method of any one of claims 1-26, wherein one or more non-adjacent reconstructed samples are provided as input to a classifier of an online filter of the ALF, wherein the classifier is a gradient-based classifier, a frequency band-based classifier, a neural network-based classifier, a machine learning-based classifier, a hybrid method-based classifier, or a combination thereof.

28. The method of any one of claims 1-27, wherein the existing spatial taps are spatial taps of an online filter of the ALF, and wherein one or more non-adjacent reconstructed sample points are provided as inputs to the spatial taps of the online filter of the ALF, wherein one or more non-adjacent reconstructed sample points are provided as inputs to all spatial taps of the online filter of the ALF, or wherein one or more non-adjacent reconstructed sample points are provided as inputs to part of the spatial taps of the online filter of the ALF.

29. The method of any one of claims 1-28, wherein the extended taps are extended taps of an online filter of the ALF, and wherein one or more non-adjacent reconstructed sample points are provided as inputs to the extended taps of the online filter of the ALF, wherein one or more non-adjacent reconstructed sample points are provided as inputs to all extended taps of the online filter of the ALF, or wherein one or more non-adjacent reconstructed sample points are provided as inputs to part of the extended taps of the online filter of the ALF.

30. The method of any one of claims 1-29, wherein the luma output of the ALF is based on a luma component of one or more non-adjacent reconstructed samples, wherein the chroma output of the ALF is based on a luma component of one or more non-adjacent reconstructed samples, wherein the luma output of the ALF is based on a chroma component of one or more non-adjacent reconstructed samples, wherein the chroma output of the ALF is based on a chroma component of one or more non-adjacent reconstructed samples, or a combination thereof.

31. The method of any one of claims 1-30, wherein the non-adjacent reconstructed samples are provided as input to a loop filter, wherein the non-adjacent reconstructed samples are provided as input to a pre-processing filter, wherein the non-adjacent reconstructed samples are provided as input to a post-processing filter, or a combination thereof.

32. The method of claim 31, wherein the loop filter comprises the ALF, a cross-component ALF (CCALF), a sample adaptive offset (SAO) filter, a bilateral filter (BF), a chroma BF, or a combination thereof.

33. The method of any one of claims 1-32, wherein whether or how the non-adjacent reconstructed samples of the picture are input into the ALF is signaled in the bitstream.

34. The method of any one of claims 1 to 33, wherein: A syntax element structure includes one or more filters having at least one extended tap, wherein the syntax element structure includes coefficients of the at least one extended tap, limiting parameters of the at least one extended tap, class merging results of the at least one extended tap, other parameters of the at least one extended tap, or a combination thereof.

35. The method of any one of claims 1-34, wherein whether or how the non-adjacent reconstructed samples of the picture are input into the ALF is based on codec information, the codec information comprising block size, color format, single / dual tree partitioning, color component, slice / picture type, or a combination thereof.

36. The method of any one of claims 1-35, wherein the converting comprises encoding the video into the bitstream.

37. The method of any one of claims 1-35, wherein the converting comprises decoding the video from the bitstream.

38. An apparatus for processing video data, comprising: processor; and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method of any one of claims 1-37.

39. A non-transitory computer-readable medium, comprising a computer program product for use by a video codec device, the computer program product comprising computer executable instructions stored on the non-transitory computer-readable medium, the computer executable instructions, when executed by a processor, causing the video codec device to perform a method as described in any one of claims 1-37.

40. A non-transitory computer-readable recording medium storing a bit stream of a video, wherein the bit stream is generated by a video processing device executing a method, wherein the method comprises the method according to any one of claims 1 to 37.

41. A method for storing a bitstream of a video, comprising the method of any one of claims 1-37, wherein performing conversion between the video and the bitstream of the video in response to inputting the non-adjacent reconstructed samples of the current picture as the input of the ALF comprises generating the bitstream, and wherein the method further comprises storing the bitstream in a non-transitory computer-readable medium.

Images