Extended taps using different sources for adaptive loop filters in video coding

Abstract

A method for processing video data includes using one or more extension taps in an ALF or a CCALF, and performing a conversion between visual media data and a bitstream based on the extension taps used in the ALF. A syntax element structure in the bitstream includes one or more filters having at least one extended tap, and a first syntax element in the bitstream indicates whether to enable a filter having at least one extended tap. The first syntax element is binarized by a unary code, a truncated unary code, a fixed length code, an Exp-Golomb code, a truncated Exp-Golomb code, or a bypass code. The extended tap obtains information from one or more reference frames in the list zero, the list one, or both. Whether to retrieve information from a previously decoded frame depends on slice type, picture type, or time domain layer index.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application is a continuation application of the international application No. PCT / CN2022 / 098279 filed by Beijing ByteDance Network Technology Co., Ltd. or others on June 11, 2022, with the invention name “Extended taps using different sources for adaptive loop filter in video coding”. This international application is incorporated herein by reference. 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] A first aspect relates to a method for processing video data, comprising: determining an extension tap for an adaptive loop filter (ALF); and performing conversion between visual media data and a bitstream based on the extension tap in the ALF.

[0006] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: using spatial domain taps in the ALF.

[0007] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the extended tap is applied to filter the brightness component.

[0008] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: applying the extended tap to filter the chrominance component.

[0009] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the coefficients generated by applying the extended taps correspond to one or more inputs.

[0010] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the ALF is trained by training data collected jointly between the extension tap and the spatial domain tap.

[0011] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides for: jointly training the extended tap and the spatial domain tap.

[0012] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: jointly deriving parameters of the extended tap and parameters of the spatial domain tap.

[0013] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the extended tap is an independent filter in the ALF.

[0014] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: jointly deriving parameters of the extended tap and parameters of the spatial domain tap.

[0015] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: for samples that have not been ALF filtered, samples that have been ALF filtered, or a combination of the two, the ALF training data is collected.

[0016] Optionally, in any of the aforementioned aspects, another implementation of this aspect stipulates that: the extension tap and the spatial domain tap adopt different filter shapes.

[0017] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: at least one of the ALF, the extension tap and the spatial domain tap adopts at least one filter shape, and wherein the at least one filter shape is a diamond, a square, a cross, a symmetrical shape, an asymmetrical shape or a combination thereof.

[0018] Optionally, in any of the aforementioned aspects, another implementation of this aspect stipulates that: the ALF includes multiple filter lengths.

[0019] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: classifying the ALF based on texture information, frequency band information, input based on spatial taps, input based on extended taps, or a combination thereof.

[0020] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: use of the extended tap is signaled by a first syntax element.

[0021] Optionally, in any of the aforementioned aspects, another implementation manner of this aspect stipulates: signaling the first syntax element in an adaptive parameter set (APS).

[0022] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the extended tap receives input from: a reference picture, a picture stored in a decoded picture buffer, a picture in a reference picture list (RPL), a co-located picture, or a combination thereof.

[0023] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the indicator indicates a picture to be input into the extended tap.

[0024] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the method also includes determining whether the extended tap receives input from another picture based on decoding information of at least one area of ​​the block to be filtered.

[0025] Optionally, in any of the aforementioned aspects, another implementation of this aspect stipulates that: the decoding information includes a slice type, a picture order count (POC) distance, a temporal layer index, a prediction mode, a distortion between a current block and a matching block, or a combination thereof.

[0026] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the method also includes determining whether to use the extended tap based on motion information of the current block and reconstructed samples from a previously decoded slice used to generate a reference block.

[0027] Optionally, in any of the aforementioned aspects, another implementation of this aspect stipulates that: the reference block is a co-located block, a block in the area pointed to by the motion vector, a central block in a previous picture, a block derived by motion estimation, or a combination of the above.

[0028] Optionally, in any of the aforementioned aspects, another implementation of this aspect stipulates that the extended tap uses: different shapes in different reference pictures, different sizes in different reference pictures, or a combination of the two.

[0029] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: an intermediate filtering result of the receiving filter is used as an input of the extended tap.

[0030] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: receiving reconstructed sample points at different encoding stages as input of the extended tap for use by the current block.

[0031] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: determining whether to use the extended tap on the current block is based on reconstructed samples at different encoding stages.

[0032] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the input of the extended tap is generated by discrete cosine transform (DCT), fast Fourier transform (FFT), discrete wavelet transform (DWT), square function, variance function, sine function, cosine function or a combination thereof.

[0033] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the extended tap adopts different settings for different inputs.

[0034] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: the extended tap is applied during loop filtering, pre-processing, post-processing or a combination thereof.

[0035] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: signaling the use of the extended tap in the bit stream.

[0036] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides: determining the use of the extended tap based on codec information.

[0037] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: performing the conversion includes encoding the visual media data into the bitstream based on the extended taps in the ALF.

[0038] Optionally, in any of the aforementioned aspects, another implementation of this aspect provides that: performing the conversion includes decoding the visual media data from the bitstream based on the extended taps in the ALF.

[0039] A second aspect relates to a device for processing video data, comprising: a processor; and a non-transitory memory, wherein instructions are stored in the memory, and when the instructions are executed by the processor, the processor executes the method described in the above aspects.

[0040] A third aspect relates to a non-transitory computer-readable medium, including a computer program product for use with a video codec device, the computer program product including computer executable instructions stored on the non-transitory computer-readable medium, which, when executed by a processor, causes the video codec device to perform the method of any of the aforementioned aspects.

[0041] A fourth aspect relates to a non-transitory computer-readable recording medium storing a bitstream generated by a video processing device executing a method, wherein the method includes: determining an extended tap for an adaptive loop filter (ALF); and generating the bitstream based on the determination.

[0042] A fifth aspect relates to a method for storing a bitstream of a video, comprising: determining an extended tap for an adaptive loop filter (ALF); generating a bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.

[0043] A sixth aspect relates to a method, device or system described in the present disclosure.

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

[0045] 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

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

[0047] Figure 1 An example of nominal vertical and horizontal positions of 4:2:2 luma and chroma samples in a picture is shown.

[0048] Figure 2 An example encoder block diagram is shown.

[0049] Figure 3 An example picture divided into raster scan strips is shown.

[0050] Figure 4 An example picture divided into rectangular scan strips is shown.

[0051] Figure 5 An example picture divided into bricks is shown.

[0052] Figure 6 An example of a CTB that crosses a picture boundary is shown.

[0053] Figure 7 An example of an intra prediction mode is shown.

[0054] Figure 8 Examples of block boundaries in a picture are shown.

[0055] Fig. 9 An example of pixels involved in filter usage is shown.

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

[0057] Fig.11 An example of transform coefficients supported by a 5×5 diamond filter is shown.

[0058] Fig.12 An example of relative coordinates supported by a 5×5 diamond filter is shown.

[0059] Fig.13 Example filter shapes for one or more spatial taps within a filter having at least one extension tap are shown.

[0060] Figure 14-51 An example filter including both spatial taps and extension taps is shown.

[0061] Fig.52 is a block diagram illustrating an example video processing system.

[0062] Fig.53 is a block diagram of an example video processing device.

[0063] Fig.54 is a flow chart of an example method for video processing.

[0064] Fig.55 is a block diagram illustrating an example video codec system.

[0065] Fig.56 is a block diagram illustrating an example encoder.

[0066] Fig.57 is a block diagram illustrating an example decoder.

[0067] Fig.58 is a schematic diagram of an example encoder. DETAILED DESCRIPTION

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

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

[0070] 1. Preliminary Discussion

[0071] This article relates to video codec technology. In particular, it relates to loop filters and other coding tools in image / video codecs. These ideas can be applied to video codecs, such as High Efficiency Video Codec (HEVC), Versatile Video Codec (VVC), or other video codec technologies, alone or in various combinations.

[0072] 2. Abbreviations

[0073] This disclosure includes the following abbreviations. Advanced Video Codec (Rec.ITU-T H.264|ISO / IEC 14496-10) (AVC), Codec Picture Buffer (CPB), Clean Random Access (CRA), Codec Tree Unit (CTU), Codec Video Sequence (CVS), Decode Picture Buffer (DPB), Decoding Parameter Set (DPS), Generic Constraint Information (GCI), High Efficiency Video Codec (also known as Rec.ITU-T H.265|ISO / IEC 23008-2, (HEVC)), Joint Exploration Model (JEM), Motion Constrained Slice Set (MCTS), Network Abstraction Layer (NAL), Output Layer Set (OLS), Picture Header (PH), Picture Parameter Set (PPS), Profile, Tier and Level (PTL), Picture Unit (PU), Reference Picture Resampled (RPR), Raw Byte Sequence Payload (RBSP), Supplemental Enhancement Information (SEI), Slice Header (SH), Sequence Parameter Set (SPS), Video Codec Layer (VCL), Video Parameter Set (VPS), Versatile Video Codec (also known as Rec.ITU-T H.266|ISO / IEC 23090-3) (VVC), VVC Test Model (VTM), Video Usability Information (VUI), Transform Unit (TU), Codec Unit (CU), Deblocking Filter (DF), Sample Adaptive Offset (SAO), Adaptive Loop Filter (ALF), Codec Block Flag (CBF), Quantization Parameter (QP), Rate-Distortion Optimization (RDO) and Bilateral Filter (BF).

[0074] 3. Video Codec Standards

[0075] Video codec standards have evolved primarily through the development of standards by the International Telecommunication Union-Telecommunication Standardization Sector (ITU-T) and the International Organization for Standardization (ISO) / International Electrotechnical Commission (IEC). ITU-T developed H.261 and H.263, ISO / IEC developed the Moving Picture Experts Group (MPEG-1) and MPEG-4 Vision, and the two organizations jointly developed the H.262 / 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). JVET adopted many of the approaches and put them into a reference software called the Joint Exploration Model (JEM)[2]. When the Versatile Video Codec (VVC) project was officially launched, JVET was renamed the Joint Video Experts Team (JVET). VVC is a codec standard that aims to reduce the bit rate by 50% compared to HEVC. The VVC working draft and VVC test model (VTM) are continuously updated.

[0076] The Video Coding Experts Group (VCEG) of the International Telecommunication Union Telecommunication Standardization Sector (ITU-T) and the Moving Picture Experts Group (MPEG) Joint Technical Committee (JTC) 1 / Subcommittee (SC) 29 / Working Group (WG) 11 of the International Organization for Standardization and the International Electrotechnical Commission (ISO / IEC) are studying the potential need for standardization of future video codec technologies with compression capabilities significantly exceeding the current VVC standard. This future standardization action could take the form of additional extensions to VVC or a completely new standard. These groups work 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 the field. The first Exploration Experiment (EE) was established by JVET and uses reference software called the Enhanced Compression Model (ECM). The test model ECM is continuously updated.

[0077] 3.1 Color Space and Chroma Subsampling

[0078] A color space (also called a color model (or color system)) is a mathematical model that describes the range of colors as a tuple of numbers, such as 3 or 4 values ​​or color components (e.g., RGB). In general, a color space is a detailed description of coordinate systems and subspaces. For video compression, the most commonly used color spaces are Luma, Blue-Difference Chroma, and Red-Difference Chroma (YCbCr) and Red, Green, Blue (RGB).

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

[0080] 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

[0082] In 4:4:4, each of the three Y'CbCr components has the same sampling rate. Therefore there is no chroma subsampling. This scheme is sometimes used in high-end film scanners and film post-production. 3.1.2 4:2:2

[0084] In 4:2:2, 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 for a 4:2:2 color format are shown. 3.1.3 4:2:0

[0086] 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 are sampled only on every alternate line. Therefore, the data rate is the same. Cb and Cr are each subsampled by a factor of two in both the horizontal and vertical directions. There are three variants of the 4:2:0 scheme, each with different horizontal and vertical addressing. In MPEG-2, Cb and Cr are co-located in the horizontal direction. Cb and Cr are located between pixels in the vertical direction (i.e., in the gap). In JPEG / JFIF, H.261, and MPEG-1, Cb and Cr are located in the gaps between alternate brightness samples. In 4:2:0DV, Cb and Cr are co-located in the horizontal direction. In the vertical direction, they are located on alternate lines.

[0087]

[0088]

[0089] Table 1. SubWidthC and SubHeightC values ​​derived from chroma_format_idc and Separate_colour_plane_flag

[0090] 3.2 Example encoding process of video codec

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

[0092] 3.3 Definition of Video / Codec Unit

[0093] 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 can be divided into one or more bricks, each of which contains multiple CTU rows. A slice that is not divided into multiple bricks can also be 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.

[0094] Two strip modes are supported, namely, raster scan strip mode and rectangular strip mode. In raster scan strip mode, a strip contains a series of slices in the slice raster scan of the picture. In rectangular strip mode, a strip contains multiple bricks of the picture, which together form a rectangular area of ​​the picture. The bricks within a rectangular strip are arranged in the order of the brick raster scan of the strip. Figure 3 An example of a raster scan striping partitioning of a picture is shown, where the picture is divided into 12 slices and 3 raster scan strips.

[0095] Figure 4 An example of rectangular strip partitioning of a picture is shown, where the picture is partitioned into 24 slices (6 slice columns and 4 slice rows) and 9 rectangular strips.

[0096] Figure 5 An example of a picture being divided into slices, bricks, and rectangular strips is 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.

[0097] 3.3.1 CTU / CTB size

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

[0099] 7.3.2.3 Sequence parameter set RBSP syntax

[0100]

[0101]

[0102]

[0103] log2_ctu_size_minus2 plus 2 specifies the luma coding tree block size for each CTU. log2_min_luma_coding_block_size_minus2 plus 2 specifies the minimum luma coding block size. The variables CtbLog2SizeY, CtbSizeY, MinCbLog2SizeY, MinCbSizeY, MinTbLog2SizeY, MaxTbLog2SizeY, MinTbSizeY, MaxTbSizeY, PicWidthInCtbsY, PicHeightInCtbsY, PicSizeInCtbsY, PicWidthInMinCbsY, PicHeightInMinCbsY, PicSizeInMinCbsY, PicSizeInSamplesY, PicWidthInSamplesC, and PicHeightInSamplesC are derived as follows:

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

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

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

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

[0108] MinTbLog2SizeY=2 (7-13)

[0109] MaxTbLog2SizeY=6 (7-14)

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

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

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

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

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

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

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

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

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

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

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

[0121] 3.3.2 CTUs in a picture

[0122] Assume that the CTB / LCU size is represented by MxN (usually M equals N), and for a CTB located at the picture boundary (or slice or stripe 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, the CTB size still equals M×N. However, the lower / right boundary of the CTB is outside the picture.

[0123] 3.4 Intra prediction

[0124] To capture any edge direction presented in natural videos, the number of directional intra modes is extended from 33 used in HEVC to 65. Figure 7 Additional directional modes are shown, 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.

[0125] The angular intra prediction direction can be defined as from 45 degrees to -135 degrees in the clockwise direction, as Figure 7 shown. In VTM, for non-square blocks, several angular intra prediction modes are adaptively replaced by wide-angle intra prediction modes. The replaced modes are signaled and remapped to the indices of the wide-angle modes after parsing. The total number of intra prediction modes remains unchanged, e.g., 67, and the intra mode coding remains unchanged.

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

[0127] 3.5 Inter prediction

[0128] For each inter-predicted CU, the motion parameters include motion vector, reference picture index, reference picture list usage index, and new coding features for VVC for additional information for sample generation for inter-prediction. Motion parameters can be signaled explicitly or implicitly. When a CU is encoded using skip mode, the CU is associated with one PU and has no significant residual coefficients, no encoded motion vector increments and / or reference picture indexes. 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 indexes for each reference picture list, reference picture list usage flags, and other useful information are explicitly signaled per CU.

[0129] 3.6 Deblocking Filter

[0130] Deblocking filtering is an example loop filter in a video codec. In VVC, the deblocking filtering process is applied to CU boundaries, transform subblock boundaries, and predicted subblock boundaries. Prediction subblock boundaries include prediction unit boundaries introduced by subblock-based temporal motion vector prediction (SbTMVP) and affine mode. Transform subblock boundaries include transform unit boundaries introduced by subblock transform (SBT) and intra sub-partitioning (ISP) mode, as well as transforms due to implicit partitioning of large CUs. The processing order of the deblocking filter is defined as first filtering the vertical edges of the entire image 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. The filtering process can also be implemented CTB by CTB, and the processing delay is very small.

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

[0132] 3.6.1 Boundary Decision

[0133] The filtering is applied on 8x8 block boundaries. In addition, such boundaries must be transform block boundaries or coding subblock boundaries, for example due to the use of affine motion prediction (ATMVP). For other boundaries, deblocking filtering is disabled.

[0134] 3.6.2 Boundary strength calculation

[0135] For transform block boundaries / coding sub-block boundaries, if the boundary is within the 8×8 grid, the boundary can be filtered and the settings of bS[xDi][yDj] of the edge (where [xDi][yDj] represents the coordinates) are defined as in Table 2 and Table 3, respectively.

[0136]

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

[0138]

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

[0140] 3.6.3 Deblocking Decision for Luminance Component

[0141] The wider-stronger luminance filter is a filter that is used only when conditions 1, 2, and 3 are all true (TRUE). 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.

[0142] 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

[0143] 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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0157]

[0158]

[0159] 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:

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

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

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

[0163] if(Sp==5)

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

[0165] else

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

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

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

[0169] If(Sq==5)

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

[0171] else

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

[0173] 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

[0174] 3.6.4 Stronger Luminance Deblocking Filter

[0175] When samples on either side of the boundary belong to a large block, a bilinear filter is used. When the width of the vertical edge is >= 32 and when the height of the horizontal edge is >= 32, the sample is defined as belonging to a large block. The bilinear filter is listed as follows. Block boundary samples pi (i=0 to Sp-1) and qi (j=0 to Sq-1), in the above HEVC deblocking, pi and qi are the i-th sample in the row for filtering the vertical edge, or the i-th sample in the column for filtering the horizontal edge, and then replaced by linear interpolation as shown below:

[0176] p i ′=(fi i *Middle s,t +(64-f i )*P s +32)>>6), clipped to p i ±tcPD i

[0177] q j ′=(g j *Middle s,t +(64-g j )*Q s +32)>>6), clipped to q j ±tcPD j

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

[0179] 3.6.5 Chroma Deblocking Decision

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

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

[0182] 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:

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

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

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

[0186] 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)

[0187] 3.6.6 Strong Deblocking Filter for Chroma

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

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

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

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

[0192] The example chroma filter performs deblocking on a 4x4 grid of chroma samples.

[0193] 3.6.7 Position-dependent limiting

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

[0195] 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) that are provided to the decoder as auxiliary information, based on the result of the decision-making process:

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

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

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

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

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

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

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

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

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

[0205] 3.6.7 Sub-block deblocking adjustment

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

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

[0208]

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

[0210] 3.7 Sample Adaptive Offset

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

[0212]

[0213]

[0214] Table 4 SAO type regulations

[0215] 3.7 Adaptive Loop Filter

[0216] 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 coding 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, filter on / off control at the codec tree unit (CTU) level also helps to improve coding 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 slice data. This syntax design not only supports picture-level optimization, but also achieves lower coding latency.

[0217] 3.8.1 Signaling of parameters

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

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

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

[0221]

[0222]

[0223] 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. 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 nonlinear adaptive loop filtering may be applied to the luma component. alf_luma_num_filters_signalled_minus1 plus 1 specifies the number of adaptive loop filter classes that may be signaled for the luma coefficient signal. The value of alf_luma_num_filters_signalled_minus1 shall be in the range of 0 to NumAlfFilters-1, inclusive. 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 of 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] shall be in the range of 0 to alf_luma_num_filters_signalled_minus1, inclusive.

[0224] alf_luma_coeff_abs[sfIdx][j] specifies the absolute value of the j-th coefficient of the signaled luma filter indicated 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] shall be in the range of 0 to 128, inclusive. alf_luma_coeff_sign[sfIdx][j] specifies the sign of the j-th luma coefficient of the filter indicated by sfIdx, as follows:

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

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

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

[0228] alf_luma_clip_idx[sfIdx][j] specifies the clip index of the clip value to be used before multiplying the jth 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. The codec tree syntax elements associated with the LUMA component in the VTM are listed below:

[0229]

[0230] 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).

[0231] When alf_ctb_flag[cIdx][xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is not present, it is inferred to be equal to 0. alf_use_aps_flag equal to 0 specifies that one of the fixed filter sets is applied to the luma CTB. alf_use_aps_flag equal to 1 specifies that the filter set from the APS is applied to the luma CTB. When alf_use_aps_flag is not present, it is inferred to be equal to 0. alf_luma_prev_filter_idx specifies the previous filter applied to the luma CTB. The value of alf_luma_prev_filter_idx should 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.

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

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

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

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

[0236] Based on the ALF design of VTM, the ALF design of ECM further introduces the concept of alternative filter sets into the luminance filter. Based on the updated luminance CTU ALF on / off decision of each alternative / round, the luminance 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 RDO and signal the relevant alternative information. The ALF data syntax elements associated with the LUMA component in ECM are listed below:

[0237]

[0238]

[0239] 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 should be in the range of 0 to 3, inclusive. alf_luma_clip_flag[altIdx] equal to 0 specifies that linear adaptive loop filtering is applied to the alternative luma filter set with index altIdx luma component. alf_luma_clip_flag[altIdx] equal to 1 specifies that nonlinear adaptive loop filtering may be applied to the alternative luma filter set with index altIdx luma component. alf_luma_num_filters_signalled_minus1[altIdx] plus 1 specifies the number of adaptive loop filter classes that may signal luma coefficients to the alternative luma filter set with index altIdx. The value of alf_luma_num_filters_signalled_minus1[altIdx] should be in the range of 0 to NumAlfFilters-1, inclusive.

[0240] 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] shall be in the range of 0 to alf_luma_num_filters_signalled_minus1[altIdx], inclusive. 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] shall be in the range of 0 to 128, inclusive.

[0241] 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:

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

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

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

[0245] 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 represented 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. The codec tree syntax elements associated with the luma component in the ECM are listed below:

[0246]

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

[0248] 3.8.2 Filter Shape

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

[0250] 3.8.3 Classification of ALF

[0251] 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:

[0252]

[0253] 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:

[0254]

[0255] 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:

[0256]

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

[0258]

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

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

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

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

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

[0264] The activity value A is calculated as:

[0265]

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

[0267] 3.8.3 Geometric Transformation of Filter Coefficients

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

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

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

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

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

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

[0274] 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

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

[0276] 3.8.3 Filtering process

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

[0278]

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

[0280] 3.8.3 Nonlinear Filter Reproduction

[0281] Linear filtering can be recast as follows without sacrificing coding efficiency:

[0282]

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

[0284] 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)). More specifically, the ALF filter is modified as follows:

[0285]

[0286] 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).

[0287] 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 signaling cost and encoder complexity, only 4 fixed values ​​are used, which are the same for INTER and INTRA slices.

[0288] 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. These 4 values ​​have been chosen by roughly evenly dividing the full range of sample values ​​for luma (encoded in 10 bits) and the range of 4 to 1024 for chroma in the logarithmic domain. More precisely, the luma table of clipping values ​​is obtained by the following formula:

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

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

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

[0292] 3.9 Bilateral Loop Filter

[0293] 3.9.1 Bilateral Image Filter

[0294] 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

[0295]

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

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

[0298] 3.9.2 Bilateral Filters in Video Codecs

[0299] The bilateral filter in video codecs is a coding tool used in VVC [1]. The filter acts as a loop filter in parallel with the sample adaptive offset (SAO) filter. Both the bilateral filter and the SAO filter 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 are passed to 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

[0300]

[0301] Among them I C Indicates the intensity of the central sample point, ΔI A =I A -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.

[0302] 4. Technical problems solved by the disclosed technical solutions

[0303] The example designs of adaptive loop filters in video codec systems have the following problems. First, in some example ALF designs, only spatially reconstructed samples of the current frame are used for filter training and filtering. However, other valuable information, such as samples inside the reconstructed reference frame or the corresponding predicted frame, can be used. Second, in some example ALF designs, only spatially reconstructed samples before ALF processing are used for filter training and filtering. However, other valuable information, such as samples before DBF, SAO or other stages, can be used. Third, in some ALF design examples, samples used for filter training and filtering are only in the spatial domain. However, other valuable information, such as information from the transform domain or other domains based on mapping functions, can also be used.

[0304] 5. List of solutions and implementation examples

[0305] In order to solve the above problems, a method as summarized below is disclosed. The embodiments should be regarded as examples for explaining general concepts and should not be interpreted narrowly. In addition, these embodiments can be applied individually or combined in any way. It should be noted that the disclosed method can be used as a loop filter or post-processing. In the present disclosure, a video unit can refer to a sequence, a picture, a sub-picture, a strip, a CTU, a block and / or a region. A video unit may include one color component or multiple color components. In the present disclosure, an ALF processing unit may refer to a sequence, a picture, a sub-picture, a strip, a CTU, a block, a region or a sample. An ALF processing unit may include one color component or multiple color components.

[0306] Example 1

[0307] In one example, at least one extended tap may be used for the ALF to further enhance the efficiency of the ALF.

[0308] Example 2

[0309] In one example, at least one extended tap may be different from the spatial taps in the ALF, which utilizes only the information of spatially adjacent samples of the filtered component (e.g., only spatially adjacent luminance samples are used to filter the central luminance samples inside a filter). In one example, at least one extended tap and at least one spatial tap may coexist inside an ALF filter. In one example, the ALF filter may include both spatial taps and extended taps. In one example, the ALF filter may include M (e.g., M>0) spatial taps and N (e.g., N>0) extended taps. Alternatively, the ALF filter may include only one or more spatial taps. Alternatively, the ALF filter may include only one or more extended taps.

[0310] Example 3

[0311] In one example, a filter with at least one extended tap may be applied to filter different color components. In one example, a filter with at least one extended tap may be applied only to filter the luma component. Alternatively, a filter with at least one extended tap may be applied only to filter one of the chroma components (e.g., Cb or Cr components). Alternatively, a filter with at least one extended tap may be applied to filter two chroma components (e.g., Cb and Cr components). Alternatively, a filter with at least one extended tap may be applied to filter all luma components and chroma components.

[0312] Example 4

[0313] In one example, the coefficients of the extended taps may correspond to one or more inputs. In one example, the coefficients of the extended taps may correspond to only one input. Alternatively, the coefficients of the extended taps may correspond to N inputs (eg, N=2).

[0314] Example 5

[0315] In one example, a filter having at least one extended tap can be trained in different ways. In one example, the training data collection of one or more extended taps of the filter can be performed jointly with one or more spatial taps of the filter. Alternatively, the training data collection of one or more extended taps of the filter can be performed independently. In one example, the coefficients of one or more extended taps of the filter can be jointly trained with one or more spatial taps of the filter. Alternatively, the coefficients of one or more extended taps of the filter can be trained independently. In one example, the parameters of one or more extended taps of the filter (e.g., nonlinear clipping parameters) can be jointly derived with one or more spatial taps of the filter. Alternatively, the parameters of one or more extended taps of the filter (e.g., nonlinear clipping parameters) can be derived independently.

[0316] Example 6

[0317] In one example, a filter with at least one extended tap can be used to form an independent filter in an ALF. In one example, a filter with at least one extended tap can be used to form an independent filter in an ALF. In one example, training data collection for a filter with at least one extended tap can be performed independently. In one example, training data collection for a filter with at least one extended tap can be performed based on samples that are not filtered by the ALF. Alternatively, training data collection for a filter with at least one extended tap can be performed based on samples filtered by the ALF. Alternatively, coefficients of a filter with at least one extended tap can be trained independently. Alternatively, parameters (e.g., nonlinear clipping parameters) of a filter with at least one extended tap can be generated / derived independently.

[0318] Example 7

[0319] In one example, a filter having at least one extended tap may use different shapes or sizes. In one example, the filter may include one or more shapes corresponding to different types of taps (e.g., a shape for one or more spatial taps and a shape for one or more extended taps). In one example, inside the filter, the shape for one or more spatial taps may be different from the shape for one or more extended taps. Alternatively, inside the filter, the shape for one or more spatial taps may be the same as the shape for one or more extended taps. In one example, inside the filter, the filter shapes for one or more spatial taps may use different shapes. In one example, the filter shape for one or more spatial taps may use a diamond shape. In one example, the filter shape for one or more spatial taps may use a square shape. In one example, the filter shape for one or more spatial taps may use a cross shape. Alternatively, the filter shape for one or more spatial taps may use a symmetrical shape. Alternatively, the filter shape for one or more spatial taps may use an asymmetrical shape. Alternatively, the filter shape for one or more spatial taps may use any other shape. In one example, it may be as Fig.13 Designing a filter shape for one or more spatial taps In one example, the filter shape for one or more spatial taps may be determined / signaled / derived on the fly.

[0320] Example 8

[0321] In one example, inside the filter, the filter shape for one or more extended taps can use different shapes. In one example, the filter shape for one or more extended taps can use a diamond shape. In one example, the filter shape for one or more extended taps can use a square shape. In one example, the filter shape for one or more extended taps can use a cross shape. Alternatively, the filter shape for one or more extended taps can use a symmetrical shape. Alternatively, the filter shape for one or more extended taps can use an asymmetrical shape. Alternatively, the filter shape for one or more extended taps can use any other shape. In one example, the filter shape for one or more extended taps can be determined / signaled / derived in real time.

[0322] Example 9

[0323] In one example, the filter may include one or more filter lengths corresponding to different types of taps (e.g., a filter length for one or more spatial taps and a filter length for one or more extended taps). In one example, inside the filter, the filter length for one or more spatial taps may be different from the filter length for one or more extended taps. Alternatively, inside the filter, the filter length for one or more spatial taps may be the same as the filter length for one or more extended taps. In one example, inside the filter, the filter lengths for one or more spatial taps may use different sizes. In one example, the filter length for one or more spatial taps may be equal to N (e.g., N=9 or 11 or 13). In one example, the filter length for one or more spatial taps may be determined / signaled / derived in real time. In one example, inside the filter, the filter length for one or more extended taps may use different sizes. In one example, the filter length for one or more extended taps may be equal to N (e.g., N=3). In one example, the filter length for one or more extended taps may be determined / signaled / derived in real time. In one example, a filter including one or more spatial taps and one or more extended taps may be designed as follows.

[0324] Example 10

[0325] In one example, Fig.14 A filter containing 20 spatial taps having a diamond shape and 5 extension taps having a diamond shape is designed.

[0326] Example 11

[0327] In one example, Fig.15A filter containing 20 spatial taps having a diamond shape and 13 extension taps having a diamond shape is designed.

[0328] Example 12

[0329] In one example, Fig.16 A filter containing 20 spatial taps having a cross shape and 5 extension taps having a diamond shape was designed.

[0330] Example 13

[0331] In one example, Fig.17 A filter containing 20 spatial taps having a cross shape and 13 extension taps having a diamond shape was designed.

[0332] Example 14

[0333] In one example, a symmetry constraint may be applied to a filter including at least one extended tap. In one example, a geometric symmetry constraint may be applied to one or more spatial taps. In one example, a geometric symmetry constraint may be applied to one or more extended taps. In one example, Fig.18 Design a filter with 20 spatial taps and 7 expansion taps.

[0334] Example 15

[0335] In one example, Fig.19 Design a filter with 20 spatial taps and 3 expansion taps.

[0336] Example 16

[0337] In one example, Fig. 20 Design a filter with 20 spatial taps and 7 expansion taps.

[0338] Example 17

[0339] In one example, Fig.21 Design a filter with 18 spatial taps and 3 extension taps.

[0340] Example 18

[0341] In one example, Fig. 22 Design a filter with 18 spatial taps and 2 extension taps.

[0342] Example 19

[0343] In one example, Fig.23 Design a filter with 16 spatial taps and 5 extension taps.

[0344] Example 20

[0345] In one example, Fig.24 Design a filter with 16 spatial taps and 4 extension taps.

[0346] Example 21

[0347] In one example, Fig.25 A filter with 14 spatial taps and 7 extension taps is designed.

[0348] Example 22

[0349] In one example, Fig.26 Design a filter with 14 spatial taps and 6 extension taps.

[0350] Example 23

[0351] In one example, Fig. 27 Design a filter with 18 spatial taps and 3 extension taps.

[0352] Example 24

[0353] In one example, Fig.28 Design a filter with 18 spatial taps and 2 extension taps.

[0354] Example 25

[0355] In one example, Fig.29 Design a filter with 16 spatial taps and 5 extension taps.

[0356] Example 26

[0357] In one example, Fig.30 Design a filter with 16 spatial taps and 4 extension taps.

[0358] Example 27

[0359] In one example, Fig.31 A filter with 14 spatial taps and 7 extension taps is designed.

[0360] Example 28

[0361] In one example, Fig.32 Design a filter with 14 spatial taps and 6 extension taps.

[0362] Example 29

[0363] In one example, a symmetric constraint based on multiple inputs may be performed on one or more extended taps. Fig.33A filter comprising 20 spatial taps and 13 extended taps and having 2 inputs (eg, samples inside 2 reference pictures) is designed.

[0364] Example 30

[0365] In one example, the geometry-based and multiple-input-based symmetry constraints can be performed separately. Alternatively, the geometry-based and multiple-input-based symmetry constraints can be performed jointly. In one example, the Fig.34 A filter comprising 20 spatial taps and 7 extension taps and having 2 inputs (eg, samples inside 2 reference pictures) is designed.

[0366] Example 31

[0367] In one example, a filter having at least one extension tap may have multiple inputs (e.g., input A, input B, and input C) for one or more extension taps. Fig.35 Design a filter with 20 spatial taps and 5 expansion taps.

[0368] Example 32

[0369] In one example, Fig.36 Design a filter with 20 spatial taps and 9 expansion taps.

[0370] Example 33

[0371] In one example, Fig.37 Design a filter with 18 spatial taps and 5 extension taps.

[0372] Example 34

[0373] In one example, Fig.38 Design a filter with 18 spatial taps and 4 extension taps.

[0374] Example 35

[0375] In one example, Fig.39 Design a filter with 16 spatial taps and 7 extension taps.

[0376] Example 36

[0377] In one example, Fig.40 Design a filter with 16 spatial taps and 6 extension taps.

[0378] Example 37

[0379] In one example, Fig.41 A filter with 14 spatial taps and 9 extension taps is designed.

[0380] Example 38

[0381] In one example, Fig.42 Design a filter with 14 spatial taps and 8 extension taps.

[0382] Example 39

[0383] In one example, Fig.43 Design a filter with 18 spatial taps and 5 extension taps.

[0384] Example 40

[0385] In one example, Fig.44 Design a filter with 18 spatial taps and 4 extension taps.

[0386] Example 41

[0387] In one example, Fig.45 Design a filter with 16 spatial taps and 7 extension taps.

[0388] Example 42

[0389] In one example, Fig.46 Design a filter with 16 spatial taps and 6 extension taps.

[0390] Example 43

[0391] In one example, Fig.47 A filter with 14 spatial taps and 9 extension taps is designed.

[0392] Example 44

[0393] In one example, Fig.48 Design a filter with 14 spatial taps and 8 extension taps.

[0394] Example 45

[0395] In one example, Fig.49 Design a filter with 20 spatial taps and 2 extension taps.

[0396] Example 45

[0397] In one example, multiple inputs can be designed in different orders. In one example, assuming that the filter has 3 different inputs (e.g., named A, B, and C), the order of the different inputs can be designed to be one of the following orders: ABC, ACB, BAC, BCA, CAB, or CBA. In one example, the coefficient index can be modified according to the order of the different inputs of a filter. In one example, the geometric transposition of the extended tap can be applied. In one example, the transposition of the extended tap can be designed to be the same as the spatial domain tap. In one example, the transposition of the extended tap can be designed to be different from the spatial domain tap.

[0398] Example 46

[0399] In one example, the total number of extension taps inside the filter can be jointly derived based on the shape, filter length, and symmetry constraints.

[0400] Example 47

[0401] In one example, classification can be performed on a filter having at least one extended tap. In one example, classification can be performed on a filter having at least one extended tap based on texture information. In one example, texture information can be generated by gradient. In one example, texture information can be generated by variance. In one example, classification can be performed on a filter having at least one extended tap based on band information. In one example, band information can be generated by the intensity of one or more input samples. In one example, classification results can be generated independently based on inputs of spatial taps of the filter. In one example, classification results can be generated independently based on inputs of extended taps of the filter. Alternatively, classification results can be jointly generated based on inputs of spatial taps and extended taps of the filter.

[0402] Example 48

[0403] In one example, a first syntax element may be signaled to indicate whether a filter having at least one extended tap is enabled. In one example, the first syntax element may be encoded and decoded by arithmetic coding. In one example, the first syntax element may be encoded and decoded with at least one context. The context may depend on the encoding information of the current block or the adjacent block. The context may depend on the filter shape of at least one adjacent block. In one example, the first syntax element may be encoded and decoded with bypass coding. In one example, the first syntax element may be binarized by a unary code, or a truncated unary code, or a fixed length code, or an exponential Golomb code, a truncated exponential Golomb code, or the like. In one example, the first syntax element may be conditionally signaled. For example, the first syntax element may be signaled only when the extended tap is available. The first syntax element may be encoded in a predictive manner. The first syntax element may be predicted by an on / off decision of the extended tap of at least one adjacent block. The first syntax element may be signaled independently for different color components. Alternatively, the first syntax element may be signaled and shared for different color components. Alternatively, the first syntax element may be signaled for the first color component but not signaled for the second color component.

[0404] Example 49

[0405] A syntax element structure, such as an APS, may include one or more filters having at least one extended tap. In one example, coefficients of the extended tap may be included in the APS. In one example, clipping parameters of the extended tap may be included in the APS. In one example, class merging results of the extended tap may be included in the APS. Alternatively, other parameters of the extended tap may be included in the APS.

[0406] Example 50

[0407] In one example, a filter with at least one extended tap may be used for the ALF based on one / more previously coded frames and motion information. In one example, the previously coded frame may be a reference frame in a reference picture list (RPL) or a reference picture set (RPS) associated with the block / current slice / frame. In one example, the previously coded frame may be a short-term reference picture of the block / current slice / frame. In one example, the previously coded frame may be a long-term reference picture of the block / current slice / frame. Alternatively, the previously coded frame may not be a reference frame, but it is stored in a decoded picture buffer (DPB).

[0408] Example 51

[0409] In one example, at least one indicator is signaled to indicate which previously coded frame(s) to use. In one example, an indicator is signaled to indicate which reference picture list to use. Alternatively, the indicator may be signaled conditionally, e.g., depending on how many reference images are included in the RPL / RPS. Alternatively, the indicator may be signaled conditionally, e.g., depending on how many previously decoded pictures are included in the DPB.

[0410] Example 52

[0411] In one example, it is determined on the fly which frames to utilize. In one example, the extension tap may obtain information from one or more previously coded frames in the DPB. In one example, the extension tap may obtain information from one / more reference frames in list 0. In one example, the extension tap may obtain information from one / more reference frames in list 1. In one example, the extension tap may obtain information from reference frames in both list 0 and list 1. In one example, the extension tap may obtain information from a reference frame closest to the current frame (e.g., having the smallest POC distance to the current slice / frame). In one example, the extension tap may obtain information from a reference frame with a reference index equal to K (e.g., K=0) in the reference list. In one example, K may be predefined. In one example, K may be derived on the fly from reference picture information. In one example, K may be signaled. In one example, the extension tap may obtain information from a co-located frame. In one example, it may be determined which frame to utilize by decoding information. In one example, the frame to be utilized may be defined as the most frequently used reference picture of the first N (e.g., N=1) of the samples within the current slice / frame. In one example, the frames to be utilized may be defined as the top N (e.g., N=1) most frequently used reference pictures for each reference picture list (if available) for samples within the current slice / frame. In one example, the frames to be utilized may be defined as pictures with the top N (e.g., N=1) smallest POC distances / absolute POC distances relative to the current picture.

[0412] Example 53

[0413] In one example, whether to obtain information from a previously coded frame may depend on decoded information (e.g., coding mode / statistics / characteristics) of at least one region of the block to be filtered. In one example, whether to obtain information from a previously coded frame may depend on the slice / picture type. In one example, it may only apply to inter-coded slices / pictures (e.g., P or B slices / pictures). In one example, whether to obtain information from a previously coded frame may depend on the availability of a reference picture. In one example, whether to obtain information from a previously coded frame may depend on reference picture information or picture information in the DPB. In one example, if the minimum POC distance (e.g., the minimum POC distance between a picture in a reference picture / DPB and a current picture) is greater than a threshold, it is disabled. In one example, whether to obtain information from a previously coded frame may depend on a temporal layer index. In one example, it may be applicable to blocks with a given temporal layer index (e.g., the highest temporal layer). In one example, if the block to be filtered contains a portion of samples encoded in a non-inter mode, the extended tap cannot use information from a previously coded frame to filter the block. In one example, a non-inter mode may be defined as an intra mode. In one example, non-inter-mode may be defined as a set of coding modes including but not limited to intra / IBC / palette modes. In one example, the distortion between the current block and the matching block is calculated and used to decide whether to obtain information from a previously coded frame to filter the current block. Alternatively, the distortion between the co-located block in the previously coded frame and the current block may be used to decide whether to obtain information from the previously coded frame to filter the current block. In one example, motion estimation may be first used to find a matching block from at least one previously coded frame. In one example, when the distortion is greater than a predefined threshold, information from the previously coded frame cannot be used.

[0414] Example 54

[0415] In one example, how and / or whether to use a filter with at least one extended tap to obtain motion information of the current block and reconstructed samples in a previously coded frame / strip to construct / generate a reference block. In one example, a reference block may be defined as one / more reference blocks and / or those blocks in a co-located block of the current block. In one example, a reference block may be defined as those blocks in an area pointed to by a motion vector. In one example, the motion vector may be different from the decoded motion vector associated with the current block. In one example, a reference block may refer to a block whose center is located at the same horizontal and vertical position in a previously coded frame as the center of the current block in the current frame. In one example, the reference block is derived by motion estimation, that is, searching from a previously coded frame to find a block with a specific metric closest to the current block. In one example, motion estimation may be performed with integer precision to avoid fractional pixel interpolation. Alternatively, motion estimation may be performed with fractional precision to improve the quality of the reference block. In one example, a reference block may be derived by reusing at least one motion vector contained in the current block. In one example, the motion vector may first be rounded to integer precision to avoid fractional pixel interpolation. In one example, the reference block can be located by adding an offset determined by a motion vector to the position of the current block. In one example, the motion vector can refer to a previously coded picture containing the reference block. In one example, the motion vector can be scaled to a previously coded picture containing the reference block. In one example, the reference block and / or co-located block can have the same size as the current block. In one example, the reference block and / or co-located block can be larger than the current block. In one example, a reference block and / or co-located block having the same size as the current block can be first found, and then the reference block and / or co-located block can be extended at each boundary to include more samples from previously coded samples. In one example, the size of the extended area can be signaled to the decoder or derived on the fly. In one example, the information contains two reference blocks and / or co-located blocks of the current block, one of which is from the first reference frame in list 0 and the other is from the first reference frame in list 1.

[0416] Example 55

[0417] In one example, a filter having at least one extended tap may use different settings in different reference frames. In one example, a filter may use different shapes in different reference frames. In one example, a filter may use different filter sizes in different reference frames. In one example, a filter may be designed in an asymmetric manner. In one example, a filter may be designed in a symmetric manner between reference frames. In this case, each coefficient of an extended tap may be shared by input samples in different reference frames. In one example, Fig.50A filter is designed, which contains 20 spatial taps and 13 extension taps.

[0418] Example 56

[0419] In one example, the filter can be designed in a symmetrical manner in each reference frame. In this case, each coefficient of the extended tap can be shared by the input samples in one reference frame. Fig.51 A filter is designed, which contains 20 spatial taps and 14 extension taps.

[0420] Example 57

[0421] In one example, the intermediate filtering results of the filter are used as the input of the extension tap. In one example, the intermediate filtering results of the ALF filter trained offline can be used as the input of the extension tap. In one example, the intermediate filtering results of the ALF filter trained online can be used as the input of the extension tap. In one example, the intermediate filtering results of other predefined filters can be used as the input of the extension tap. In one example, other intermediate filtering results of online training filters can be used as the input of the extension tap.

[0422] Example 58

[0423] In one example, the reconstruction samples before or after different coding and decoding stages of the current frame are used as the input of the extension tap. In one example, the reconstruction before / after the DBF of the current frame can be used as the input of the extension tap. In one example, the reconstruction before / after the SAO / CCSAO of the current frame can be used as the input of the extension tap. In one example, the reconstruction before / after the BIF of the current frame can be used as the input of the extension tap. Alternatively, the reconstruction before / after other stages of the current frame can be used as the input of the extension tap.

[0424] Example 59

[0425] In one example, whether and / or how to use the reconstructed samples before or after different encoding and decoding stages of the reference frame as the input of the extension tap. In one example, the reconstruction before / after the DBF of the reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the DBF of a reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the DBF of multiple reference frames can be used as the input of the extension tap. In one example, the reconstruction before / after the SAO / CCSAO of the reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the SAO / CCSAO of a reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the SAO / CCSAO of multiple reference frames can be used as the input of the extension tap. In one example, the reconstruction before / after the BIF of the reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the BIF of a reference frame can be used as the input of the extension tap. In one example, the reconstruction before / after the BIF of multiple reference frames can be used as the input of the extension tap. Alternatively, reconstructions before / after other stages of the reference frame may be used as input to the expansion tap. In one example, reconstructions before / after other stages of one reference frame may be used as input to the expansion tap. In one example, reconstructions before / after other stages of multiple reference frames may be used as input to the expansion tap.

[0426] Example 60

[0427] In an example, whether and / or how to use the mapping or transformation result as the input of the extended tap. In an example, a specific transformation can be used to generate the input of the extended tap. In an example, DCT can be applied. In an example, FFT can be applied. In an example, DWT can be applied. Alternatively, other transform functions can also be applied. In an example, a specific mapping function can be used to generate the input of the extended tap. In an example, a square function can be applied. In an example, a variance function can be applied. In an example, a sine function can be applied. In an example, a cosine function can be applied. Alternatively, other linear or nonlinear mapping functions can be applied.

[0428] Example 61

[0429] In one example, the above-mentioned methods can be used in combination. In one example, the extended tap can use multiple inputs located inside or outside the potential inputs mentioned above. In one example, the extended tap can jointly use the reconstruction before the DBF of the current frame and the reconstructed reference frame as input. In one example, the extended tap can jointly use the reconstruction before the DBF of the current frame and the reconstruction before the DBF of the reference frame as input. In one example, the extended tap can jointly use the reconstruction before the BDF of the current frame and the reconstruction after the DBF of the reference frame as input sources. Alternatively, the extended tap can jointly use the reconstruction before the DBF of the reference frame and the reconstructed reference frame as input sources. In one example, the extended tap can jointly use N (for example, N=3) inputs. In one example, a filter with at least one extended tap can use different settings for different inputs. In one example, the shape for one or more extended taps can use different shapes for different inputs. In one example, the shape for one or more extended taps can use a diamond shape in one input and a square shape in another input. In one example, the filter length for one or more extended taps can use different filter sizes in different inputs. In one example, one or more extension taps may be designed in an asymmetrical manner. In this case, each coefficient of the extension tap may have a specific input. In one example, one or more extension taps may be designed in a symmetrical manner between different inputs. In this case, each coefficient of the extension tap may be shared by different inputs. Alternatively, one or more extension taps may be designed in a symmetrical manner within different inputs. In this case, each coefficient of the extension tap may be shared by samples within a specific input.

[0430] Example 62

[0431] Alternatively, the above-mentioned methods may be used individually.

[0432] Example 63

[0433] In one example, the disclosed extended tap method 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). In one example, the proposed extended tap method can be applied to loop filtering methods. In one example, the proposed extended tap method can be applied to ALF. In one example, the proposed extended tap method can be applied to CCALF. Alternatively, the proposed extended tap method can be applied to other loop filtering methods. In one example, the proposed extended tap method can be applied to pre-processing filtering methods. In one example, the proposed extended tap method can be applied to post-processing filtering methods.

[0434] Example 64

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

[0436] Example 65

[0437] Whether and / or how the methods disclosed above are applied may be signaled in the bitstream. In one example, they may be signaled at the sequence level / picture group level / picture level / slice level / slice group level, such as in the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / slice group header. In one example, they may be signaled at the PB / TB / CB / PU / TU / CU / VPDU / CTU / CTU row / slice / slice / sub-picture / other type of region containing more than one sample or pixel.

[0438] Example 66

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

[0440] 6. References

[0441] J. Strom, P. Wennersten, J. Enhorn, D. Liu, K. Andersson and R. Sjoberg, "Bilateral Loop Filter in Combination with SAO," in proceeding of IEEE PictureCoding Symposium (PCS), Nov. 2019.

[0442] Fig.524000 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.

[0443] System 4000 may include coding component 4004, which may implement various coding or coding methods described in this document. Coding component 4004 may reduce the average bit rate of the video from input 4002 to output of coding component 4004 to generate a coded representation of the video. Therefore, coding techniques are sometimes referred to as video compression or video transcoding techniques. The output of coding component 4004 may be stored or sent via connected communications, 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.

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

[0445] Fig.534106 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).

[0446] Fig.54 4200. The method 4200 includes determining an extension tap for an ALF at step 4202. At step 4204, performing a conversion between visual media data and a bitstream based on the extension tap in the ALF. According to an example, the conversion of step 4204 may include encoding at an encoder or decoding at a decoder.

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

[0448] Fig.55 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.

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

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

[0451] 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 (VVM) standard, and other current and / or additional standards.

[0452] Fig.56 is a block diagram showing an example of a video encoder 4400, which may be Fig.55 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.

[0453] The functional components of the video encoder 4400 may include a partition unit 4401, a prediction unit 4402, 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 4413, and an entropy coding unit 4414. The prediction unit 4402 may include a mode selection unit 4403, a motion estimation unit 4404, a motion compensation unit 4405, and an intra-frame prediction unit 4406.

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

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

[0456] The partitioning unit 4401 may partition a picture into one or more video blocks. The video encoder 4400 and the video decoder 4500 may support various video block sizes.

[0457] The mode selection unit 4403 may select one of the coding 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 provide it 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).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0474] Fig.57 is a block diagram showing an example of a video decoder 4500, which may be Fig.55 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.

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

[0476] 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 index, and other motion information. The motion compensation unit 4502 may determine such information, for example, by performing AMVP and Merge modes.

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

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

[0479] 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, partition 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.

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

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

[0482] Fig.58 4600 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.

[0483] 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 into a transform (T) component 4614 and a quantization (Q) component 4616 to generate quantized residual transform coefficients, which are fed into an entropy coding component 4618. The entropy coding component 4618 entropy codes 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 into an inverse quantization (IQ) component 4620, an inverse transform component 4622, and a 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 .

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

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

[0486] 1. A method for processing video data (e.g., Fig.30 The method 4200 shown in FIG. 4 includes: determining ( 4202 ) an extended tap for an adaptive loop filter (ALF); and performing ( 4204 ) conversion between visual media data and a bitstream based on the extended tap in the ALF.

[0487] 2. A method as in solution 1, where spatial taps are used in the ALF.

[0488] 3. The method as in any one of solutions 1 to 2, wherein the extended tap is applied to filter the luminance component.

[0489] 4. The method of any one of solutions 1 to 3, wherein the extended tap is applied to filter the chrominance component.

[0490] 5. A method as in any one of solutions 1 to 4, wherein the coefficients resulting from applying the expansion taps correspond to one or more inputs.

[0491] 6. The method of any one of solutions 1 to 5, wherein the ALF is trained by training data collected jointly between the extension tap and the spatial tap.

[0492] 7. A method as in any one of solutions 1 to 6, wherein the extension tap and the spatial tap are jointly trained.

[0493] 8. A method as in any one of solutions 1 to 7, wherein the parameters of the extension taps and the parameters of the spatial taps are derived jointly.

[0494] 9. The method as in any one of solutions 1 to 8, wherein the extension tap is an independent filter in the ALF.

[0495] 10. A method as in any one of solutions 1 to 9, wherein the parameters of the extension taps and the parameters of the spatial taps are derived jointly.

[0496] 11. The method of any one of solutions 1 to 10, wherein the ALF training data is collected for samples that have not been ALF filtered, samples that have been ALF filtered, or a combination thereof.

[0497] 12. The method of any one of solutions 1 to 11, wherein the extension tap and the space tap adopt different filter shapes.

[0498] 13. A method as described in any one of solutions 1 to 12, wherein at least one of the ALF, the extension tap and the spatial tap adopts at least one filter shape, and wherein the at least one filter shape is a diamond, a square, a cross, a symmetrical shape, an asymmetrical shape or a combination thereof.

[0499] 14. The method of any one of solutions 1 to 13, wherein the ALF comprises a plurality of filter lengths.

[0500] 15. The method of any one of solutions 1 to 14, wherein the ALF is classified based on texture information, frequency band information, spatial tap based input, extended tap based input, or a combination thereof.

[0501] 16. The method of any one of solutions 1 to 15, wherein the use of the extended tap is signaled by a first syntax element.

[0502] 17. The method of any one of solutions 1 to 16, wherein the first syntax element is signaled in an adaptation parameter set (APS).

[0503] 18. A method as in any one of solutions 1 to 17, wherein the extended tap receives input from: a reference picture, a picture stored in a decoded picture buffer, a picture in a reference picture list (RPL), a co-located picture, or a combination thereof.

[0504] 19. The method of any one of solutions 1 to 18, wherein the indicator indicates a picture for input to the extended tap.

[0505] 20. The method of any one of solutions 1 to 19 further includes determining whether the extended tap receives input from another picture based on decoded information of at least one region of the block to be filtered.

[0506] 21. The method of any one of solutions 1 to 20, wherein the decoded information comprises a slice type, a picture order count (POC) distance, a temporal layer index, a prediction mode, a distortion between a current block and a matching block, or a combination thereof.

[0507] 22. The method of any one of solutions 1 to 21, further comprising determining whether to use the extended tap based on motion information of the current block and reconstructed samples from a previously decoded slice used to generate a reference block.

[0508] 23. A method as in any one of solutions 1 to 22, wherein the reference block is a co-located block, a block in the area pointed to by a motion vector, a central block in a previous picture, a block derived by motion estimation, or a combination of the above.

[0509] 24. The method of any one of solutions 1 to 23, wherein the extended tap uses: different shapes in different reference pictures, different sizes in different reference pictures, or a combination thereof.

[0510] 25. The method of any one of solutions 1 to 24, wherein an intermediate filtering result of the filter is received as input to the expansion tap.

[0511] 26. The method of any one of solutions 1 to 25, wherein reconstructed samples at different encoding and decoding stages are received as inputs of the extended taps for use in the current block.

[0512] 27. The method as described in any one of solutions 1 to 26 further includes determining whether to use the extended tap on the current block based on reconstructed samples at different encoding and decoding stages.

[0513] 28. A method as described in any one of solutions 1 to 27, wherein the input to the extended tap is generated by: discrete cosine transform (DCT), fast Fourier transform (FFT), discrete wavelet transform (DWT), square function, variance function, sine function, cosine function, or a combination of the above.

[0514] 29. A method as in any one of solutions 1 to 28, wherein the expansion tap is set differently for different inputs.

[0515] 30. The method of any one of solutions 1 to 29, wherein the extended tap is applied during loop filtering, pre-processing, post-processing, or a combination thereof.

[0516] 31. The method of any one of solutions 1 to 30, wherein the use of the extended taps is signaled in the bitstream.

[0517] 32. A method as in any one of solutions 1 to 31, wherein the use of the extension tap is determined based on coding information.

[0518] 33. The method of any one of solutions 1 to 32, wherein performing the conversion comprises encoding the visual media data into the bitstream based on extended taps in the ALF.

[0519] 34. The method of any one of solutions 1 to 33, wherein performing the conversion comprises decoding the visual media data from the bitstream based on extended taps in the ALF.

[0520] 35. A device for processing video data, comprising: a processor; and a non-temporary memory having instructions stored thereon, wherein the instructions, when executed by the processor, cause the processor to perform a method as in any one of solutions 1 to 34.

[0521] 36. 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 a method as described in any one of solutions 1 to 34.

[0522] 37. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a video processing device executing a method, wherein the method comprises: determining an extended tap for an adaptive loop filter (ALF); and generating the bitstream based on the determination.

[0523] 38. A method for storing a bitstream of a video, comprising: determining an extended tap for an adaptive loop filter (ALF); generating the bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.

[0524] 39. A method, apparatus or system as described in this patent document.

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

[0526] In the solution described herein, an encoder can comply with the format rules by generating an encoded representation according to the format rules. In the solution described herein, a decoder can parse syntax elements in the encoded representation using the format rules and generate decoded video based on the presence and absence of syntax elements known according to the format rules.

[0527] 1. A method for processing video data, comprising: using one or more extension taps in an adaptive loop filter (ALF) or a cross-component ALF (CCALF); and performing conversion between visual media data and a bitstream based on the extension taps used in the ALF, wherein a syntax element structure in the bitstream includes one or more filters having at least one extension tap, wherein a first syntax element is included in the bitstream and indicates whether the filter having at least one extension tap is enabled, and wherein the first syntax element is binarized by a unary code, a truncated unary code, a fixed-length code, an exponential Golomb code, a truncated exponential Golomb code, or a bypass code, wherein the extension tap obtains information from one or more reference frames in list zero, list one, or both, wherein whether the information is obtained from a previously coded or decoded frame depends on a slice type, a picture type, or a temporal layer index.

[0528] 2. A method as in solution 1, wherein the ALF comprises one or more spatial taps, wherein the one or more spatial taps are different from the one or more extension taps, and wherein the one or more spatial taps utilize only information of spatially adjacent samples of the filtering component.

[0529] 3. The method as in any one of solutions 1 to 2, wherein the one or more extension taps and spatial domain taps coexist within the ALF.

[0530] 4. The method as in any one of solutions 1 to 3, wherein the ALF comprises an extension tap and a spatial domain tap.

[0531] 5. The method as in any one of solutions 1 to 4, wherein the ALF comprises M spatial domain taps and N extension taps, wherein M and N are positive integers.

[0532] 6. The method as in any one of solutions 1 to 5, wherein the ALF comprises only the extended tap.

[0533] 7. A method as in any one of solutions 1 to 6, wherein a filter with at least one extended tap is used for filtering different color components.

[0534] 8. The method of any one of solutions 1 to 7, wherein a filter with at least one extended tap is used to filter only the luminance component.

[0535] 9. The method of any one of solutions 1 to 8, wherein a filter having at least one extended tap is used to filter only chrominance components, wherein the chrominance components include a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

[0536] 10. A method as in any one of solutions 1 to 9, wherein a filter having at least one extended tap is used to filter a luminance component and a chrominance component, wherein the chrominance component comprises a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

[0537] 11. A method as in any one of solutions 1 to 10, wherein a filter with at least one extended tap is used to filter all luminance components and all chrominance components, wherein the chrominance components include a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

[0538] 12. The method of any one of solutions 1 to 11, wherein a coefficient corresponding to an extended tap corresponds to one or more inputs of the ALF.

[0539] 13. The method of any one of solutions 1 to 12, wherein a coefficient corresponding to an extended tap corresponds to only one input of the ALF.

[0540] 14. The method of any one of solutions 1 to 13, wherein a coefficient corresponding to an extended tap corresponds to N inputs of the ALF, wherein N is a positive integer.

[0541] 15. The method of any one of solutions 1 to 14, wherein the filter having at least one extended tap is configured to be trained in a plurality of different ways.

[0542] 16. The method of any one of solutions 1 to 15, wherein the training data collection of the one or more extension taps is performed jointly with the one or more spatial domain taps of the ALF.

[0543] 17. The method of any one of solutions 1 to 16, wherein the training data collection of one or more extended taps of the ALF is performed independently.

[0544] 18. The method of any one of solutions 1 to 17, wherein the coefficients of the one or more extension taps are performed jointly with the one or more spatial domain taps of the ALF.

[0545] 19. The method of any one of solutions 1 to 18, wherein the coefficients of one or more extended taps of the ALF are performed independently.

[0546] 20. The method of any one of solutions 1 to 19, wherein parameters of the one or more extension taps are derived jointly with one or more spatial domain taps of the ALF.

[0547] 21. The method of any one of solutions 1 to 20, wherein parameters of the one or more extension taps are independently derived.

[0548] 22. The method of any one of solutions 1 to 21, wherein a filter with at least one extended tap is used to form an independent filter in the ALF.

[0549] 23. The method of solution 22, wherein the training data collection for the filter with at least one extended tap is performed independently.

[0550] 24. The method of solution 22, wherein the training data collection of the filter with at least one extended tap is performed based on samples that have not been ALF filtered.

[0551] 25. The method of solution 22, wherein the training data collection of the filter with at least one extended tap is performed based on ALF filtered samples.

[0552] 26. The method of solution 22, wherein the coefficients of the filter having at least one extended tap are trained independently.

[0553] 27. The method of solution 22, wherein parameters of the filter having at least one extended tap are independently generated or derived.

[0554] 28. The method of any one of solutions 1 to 27, wherein the filter having at least one extended tap is configured to use different shapes or different sizes.

[0555] 29. The method of any of solutions 1 to 28, wherein the filter comprises one or more shapes corresponding to different types of taps.

[0556] 30. A method as in any of solutions 1 to 29, wherein a first shape of one or more spatial domain taps used in the filter is different from a second shape of one or more extension taps used in the filter.

[0557] 31. A method as in any one of solutions 1 to 30, wherein a first shape of one or more spatial taps used in the filter is the same as a second shape of one or more extension taps used in the filter.

[0558] 32. A method as in any one of solutions 1 to 31, wherein one or more spatial taps in the filter use different shapes.

[0559] 33. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter have a diamond shape.

[0560] 34. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter have a square shape.

[0561] 35. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter have a cross shape.

[0562] 36. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter have a symmetrical shape.

[0563] 37. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter have an asymmetric shape.

[0564] 38. The method of any of solutions 1 to 32, wherein the filter comprises twenty different spatial taps in the shape of a cross of forty-one taps.

[0565] 39. A method as in any of solutions 1 to 32, wherein one or more spatial taps in the filter are determined in real time, signaled in the bitstream or derived.

[0566] 40. A method as in any one of solutions 1 to 39, wherein one or more extension taps in the filter use different shapes.

[0567] 41. The method of any of solutions 1 to 40, wherein one or more extension taps in the filter have a diamond shape.

[0568] 42. The method of any of solutions 1 to 40, wherein one or more extension taps in the filter have a square shape.

[0569] 43. The method of any of solutions 1 to 40, wherein one or more extension taps in the filter have a cross shape.

[0570] 44. The method of any of solutions 1 to 40, wherein one or more extension taps in the filter have a symmetrical shape.

[0571] 45. The method of any of solutions 1 to 40, wherein one or more extension taps in the filter have an asymmetric shape.

[0572] 46. ​​A method as in any of solutions 1 to 40, wherein one or more extension taps in the filter are determined in real time, signaled in the bitstream or derived.

[0573] 47. The method of any of solutions 1 to 46, wherein the filter comprises one or more filter lengths corresponding to different types of taps.

[0574] 48. A method as in any of solutions 1 to 46, wherein a first filter length used for one or more spatial taps in the filter is different from a second filter length used for one or more extension taps in the filter.

[0575] 49. A method as in any one of solutions 1 to 46, wherein a first filter length used for one or more spatial domain taps in the filter is the same as a second filter length used for one or more extension taps in the filter.

[0576] 50. A method as in any one of solutions 1 to 49, wherein the filter lengths of different spatial taps in the filter are different.

[0577] 51. A method as in solution 50, wherein the filter length is N, where N is 9, 11 or 13.

[0578] 52. A method as in any of solutions 50 to 51, wherein the filter length is determined in real time, signaled in the bitstream or derived.

[0579] 53. A method as in any one of solutions 1 to 52, wherein the filter lengths of different extension taps in the filter are different.

[0580] 54. A method as in solution 53, wherein the filter length is N, where N is 3.

[0581] 55. A method as in any of solutions 53 to 54, wherein the filter length is determined in real time, signaled in the bitstream or derived.

[0582] 56. A method as in any of solutions 1 to 55, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; and five different extension taps in the shape of a diamond.

[0583] 57. A method as in any of solutions 1 to 56, wherein the filter comprises: twenty different spatial taps in the shape of forty-one tap diamonds; and thirteen different extension taps in the shape of diamonds.

[0584] 58. A method as in any one of solutions 1 to 57, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap cross; and five different extension taps in the shape of a diamond.

[0585] 59. A method as in any one of solutions 1 to 58, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap cross; and thirteen different extension taps in the shape of a diamond.

[0586] 60. A method as in any one of solutions 1 to 59, wherein a symmetry constraint is performed on the filter including the one or more extension taps.

[0587] 61. A method as in any of solutions 1 to 59, wherein a geometric symmetry constraint is performed on one or more spatial taps of the filter.

[0588] 62. A method as in any of solutions 1 to 59, wherein a geometric symmetry constraint is performed on one or more extension taps of the filter.

[0589] 63. A method as in any of solutions 60 to 62, wherein the filter comprises: twenty different spatial taps in the shape of forty-one tap diamonds; and seven different extension taps in the shape of thirteen tap diamonds.

[0590] 64. A method as in any of solutions 60 to 62, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap cross; and three different extension taps in the shape of a five tap diamond.

[0591] 65. A method as in any of solutions 60 to 62, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap cross; and seven different extension taps in the shape of a thirteen tap diamond.

[0592] 66. A method as in any of solutions 60 to 62, wherein the filter comprises: eighteen different spatial taps in the shape of a thirty-seven tap cross; and three different extension taps in the shape of a five tap diamond.

[0593] 67. A method as in any of solutions 60 to 62, wherein the filter comprises: eighteen different spatial taps in the shape of a thirty-seven tap cross; and two different extension taps in the shape of a five tap diamond.

[0594] 68. A method as in any of solutions 60 to 62, wherein the filter comprises: sixteen different spatial taps in the shape of a thirty-seven tap cross; and five different extension taps in the shape of a nine tap cross.

[0595] 69. A method as in any of solutions 60 to 62, wherein the filter comprises: sixteen different spatial taps in the shape of a thirty-seven tap cross; and four different extension taps in the shape of a nine tap cross.

[0596] 70. A method as in any of solutions 60 to 62, wherein the filter comprises: fourteen different spatial taps in the shape of a twenty-nine tap cross; and seven different extension taps in the shape of a thirteen tap diamond.

[0597] 71. A method as in any of solutions 60 to 62, wherein the filter comprises: fourteen different spatial taps in the shape of a twenty-nine tap cross; and six different extension taps in the shape of a thirteen tap diamond.

[0598] 72. A method as in any of solutions 60 to 62, wherein the filter comprises: eighteen different spatial taps in the shape of thirty-seven tap diamonds; and three different extension taps in the shape of five tap diamonds.

[0599] 73. A method as in any of solutions 60 to 62, wherein the filter comprises: eighteen different spatial taps in the shape of a thirty-seven tap cross; and two different extension taps in the shape of a nine-tap cross.

[0600] 74. A method as in any of solutions 60 to 62, wherein the filter comprises: sixteen different spatial taps in the shape of a thirty-three tap cross; and five different extension taps in the shape of a nine tap cross.

[0601] 75. A method as in any of solutions 60 to 62, wherein the filter comprises: sixteen different spatial taps in the shape of a thirty-three tap cross; and four different extension taps in the shape of a nine tap cross.

[0602] 76. A method as in any of solutions 60 to 62, wherein the filter comprises: fourteen different spatial taps in the shape of a twenty-nine tap cross; and seven different extension taps in the shape of a thirteen tap cross.

[0603] 77. A method as in any of solutions 60 to 62, wherein the filter comprises: fourteen different spatial taps in the shape of a twenty-nine tap cross; and six different extension taps in the shape of a thirteen tap cross.

[0604] 78. A method as in any one of solutions 1 to 59, wherein a multi-input based symmetry constraint is performed on the filter including the one or more extended taps.

[0605] 79. A method as in solution 78, wherein the filter includes: twenty different spatial taps in the shape of forty-one tap diamonds; thirteen different extended taps in the shape of thirteen tap crosses with a first input; and the thirteen different extended taps in the shape of the thirteen tap crosses also have a second input.

[0606] 80. A method as in any one of solutions 1 to 79, wherein geometric constraints and multi-input based symmetry constraints are performed separately for the filter.

[0607] 81. A method as in any one of solutions 1 to 80, wherein geometric constraints and multi-input based symmetry constraints are jointly enforced on the filter.

[0608] 82. A method as in solution 81, wherein the filter includes: twenty different spatial taps in the shape of forty-one tap diamonds; seven different extended taps in the shape of thirteen tap crosses with a first input; and the seven different extended taps in the shape of the thirteen tap crosses also have a second input.

[0609] 83. A method as in any one of solutions 1 to 82, wherein the filter including the one or more extension taps has multiple inputs for the one or more extension taps.

[0610] 84. A method as in solution 83, wherein the filter includes: twenty different spatial taps in the shape of a forty-one tap cross; different extended taps with a first input; different extended taps with a second input; and five different extended taps with a third input in the shape of a five tap diamond.

[0611] 85. A method as in solution 83, wherein the filter includes: twenty different spatial taps in the shape of a forty-one tap cross; different extended taps with a first input; different extended taps with a second input; and nine different extended taps in the shape of a thirteen tap diamond with a third input.

[0612] 86. A method as in solution 83, wherein the filter includes: eighteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and five different extended taps with a third input in the shape of a five tap diamond.

[0613] 87. A method as in solution 83, wherein the filter includes: eighteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and four different extended taps with a third input in the shape of a five tap diamond.

[0614] 88. A method as in solution 83, wherein the filter includes: sixteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and seven different extended taps with a third input in the shape of a nine-tap cross.

[0615] 89. A method as in solution 83, wherein the filter includes: sixteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and six different extended taps with a third input in the shape of a nine-tap cross.

[0616] 90. A method as in solution 83, wherein the filter includes: fourteen different spatial taps in the shape of a twenty-nine tap cross; different extended taps with a first input; different extended taps with a second input; and nine different extended taps in the shape of a thirteen tap diamond with a third input.

[0617] 91. A method as in solution 83, wherein the filter includes: fourteen different spatial taps in the shape of a twenty-nine tap cross; different extended taps with a first input; different extended taps with a second input; and eight different extended taps in the shape of a thirteen tap diamond with a third input.

[0618] 92. A method as in solution 83, wherein the filter includes: eighteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and five different extended taps with a third input in the shape of a five tap diamond.

[0619] 93. A method as in solution 83, wherein the filter includes: eighteen different spatial taps in the shape of a thirty-seven tap cross; different extended taps with a first input; different extended taps with a second input; and four different extended taps with a third input in the shape of a five tap diamond.

[0620] 94. A method as in solution 83, wherein the filter includes: sixteen different spatial taps in the shape of a thirty-three tap cross; different extended taps with a first input; different extended taps with a second input; and seven different extended taps with a third input in the shape of a nine tap cross.

[0621] 95. A method as in solution 83, wherein the filter includes: sixteen different spatial taps in the shape of a thirty-three tap cross; different extended taps with a first input; different extended taps with a second input; and six different extended taps with a third input in the shape of a nine tap cross.

[0622] 96. A method as in solution 83, wherein the filter includes: fourteen different spatial taps in the shape of a thirty-nine tap cross; different extended taps with a first input; different extended taps with a second input; and nine different extended taps in the shape of a thirteen tap diamond with a third input.

[0623] 97. A method as in solution 83, wherein the filter includes: fourteen different spatial taps in the shape of a thirty-nine tap cross; different extended taps with a first input; different extended taps with a second input; and eight different extended taps in the shape of a thirteen tap diamond with a third input.

[0624] 98. A method as in solution 83, wherein the filter includes: twenty different spatial taps in the shape of a forty-one tap cross; different extended taps with a first input; and different extended taps with a second input.

[0625] 99. A method as in any of solutions 1 to 98, wherein the plurality of inputs are designed in different orders, and wherein the coefficient index is modified according to one or more of the different orders.

[0626] 100. A method as in any one of solutions 1 to 99, wherein a geometric basis transpose of the one or more extended taps is applied, and wherein the design of the geometric basis transpose is the same as or different from the design of the spatial domain taps.

[0627] 101. A method as in any one of solutions 1 to 100, wherein the total number of one or more extension taps inside the filter is derived jointly based on the shape, filter length or symmetry constraints.

[0628] 102. A method as in any one of solutions 1 to 101, wherein a filter having at least one extended tap can be classified based on texture information or frequency band information, wherein the texture information is generated by gradient or variance, and wherein the frequency band information is generated according to the intensity of one or more input samples.

[0629] 103. A method as described in any one of solutions 1 to 102, wherein the classification result is independently generated based on the input of the spatial taps of the filter, or is independently generated based on the input of the extended taps of the filter, or is jointly generated based on the input of the spatial taps and extended taps of the filter.

[0630] 104. A method as described in any one of solutions 1 to 103, wherein the first syntax element is encoded or decoded by arithmetic coding or by utilizing at least one context, wherein the context depends on encoding or decoding information of a current block or a neighboring block or on a filtering shape of at least one neighboring block.

[0631] 105. A method as described in any one of solutions 1 to 104, wherein the first syntax element is conditionally signaled only when the extended tap is available, or the first syntax element is predicted in a predictive manner, wherein the first syntax element is predicted by an on / off decision of the extended tap of at least one neighboring block, wherein the first syntax element is signaled independently for different color components, wherein the first syntax element is signaled and shared between different color components, or the first syntax element is signaled for the first color component but not for the second color component.

[0632] 106. A method as described in any one of solutions 1 to 105, wherein the syntax element structure includes an adaptive parameter set (APS), and wherein the coefficients of the extended tap are included in the APS, the limiting parameters of the extended tap are included in the APS, the class merging results of the extended tap are included in the APS, or other parameters of the extended tap are included in the APS.

[0633] 107. A method as described in any one of solutions 1 to 106, wherein a filter with at least one extended tap is used for ALF, wherein the filter is based on one or more previously coded frames and motion information, wherein at least one of the previously coded frames is a reference frame in a reference picture list (RPL) or a reference picture set (RPS) associated with a block, a current slice or a frame, wherein the previously coded frame is a short-term reference picture of the block, the current slice or the frame, or wherein the previously coded frame is a long-term reference picture of the block, the current slice or the frame.

[0634] 108. A method as described in any one of solutions 1 to 106, wherein the previously encoded frame is not a reference frame and is stored in a decoded picture buffer (DPB), wherein at least one indicator is signaled in the bitstream to indicate which one of the previously encoded frames is to be used, wherein the indicator is signaled to indicate which reference picture list is to be used, wherein the indicator is conditionally signaled based on how many reference pictures are included in the RPL or the RPS, or wherein the indicator is conditionally signaled based on how many previously decoded pictures are included in the DPB.

[0635] 109. A method as described in any one of solutions 1 to 108, wherein it is determined in real time which frames to utilize, wherein an extension tap obtains information from one or more previously encoded and decoded frames in the DPB, wherein the extension tap is capable of obtaining information from a reference frame that is closest to the current frame or has a minimum picture order count (POC) distance to the current slice or frame, wherein the extension tap obtains information from a reference frame having a reference index equal to K in a reference list, and wherein K is predefined, derived in real time based on the reference picture information, or signaled in the bitstream.

[0636] 110. A method as in any one of solutions 1 to 109, wherein the extended taps obtain information from a co-located frame, wherein the frame to be used is determined by decoded information, wherein the frame to be used is defined as the first N most frequently used reference pictures for samples within the current slice or frame, wherein the frame to be used is defined as the first N (e.g., N=1) most frequently used reference pictures in each reference picture list when available for samples within the current slice or frame, or wherein the frame to be used is defined as the picture with the first N smallest POC distances or absolute POC distances relative to the current picture.

[0637] 111. A method as described in any one of solutions 1 to 110, wherein whether to obtain information from a previously coded frame depends on decoded information, such as a coding mode, statistics or characteristics of at least one area of ​​the block to be filtered, wherein the filter is applied only to inter-coded strips or pictures, wherein whether to obtain information from a previously coded frame depends on the availability of a reference picture, wherein whether to obtain information from a previously coded frame depends on the reference picture information or the picture information in the DPB, wherein the filter is disabled when the minimum POC distance between the reference picture or the picture in the DPB and the current picture is greater than a threshold, or wherein the filter is applied to blocks with a given temporal layer index.

[0638] 112. A method as described in any one of solutions 1 to 111, wherein when the block to be filtered includes a portion of samples encoded and decoded in a non-inter-frame mode, the extended tap does not use information from a previously encoded and decoded frame to filter the block, wherein the non-inter-frame mode is defined as an intra-frame mode, or wherein the non-inter-frame mode is defined as a set of coding modes including intra-frame, intra-frame block copy (IBC) or palette mode.

[0639] 113. A method as in any one of solutions 1 to 112, wherein a distortion between a current block and a matching block is calculated and used to decide whether to obtain information from a previously coded frame to filter the current block, wherein the distortion between a co-located block in a previously coded frame and the current block can be used to decide whether to obtain information from a previously coded frame to filter the current block, wherein a matching block is first found from at least one previously coded frame using motion estimation, or wherein when the distortion is greater than a predefined threshold, information from the previously coded frame is not used.

[0640] 114. A method as in any one of solutions 1 to 113, wherein how and / or whether a filter with at least one extended tap is used to obtain motion information of the current block and reconstructed samples in a previously coded frame or slice to construct or generate a reference block, wherein the reference block is defined as one or more reference blocks and / or those blocks in a co-located block of the current block, wherein the reference block is defined as those blocks in an area pointed to by a motion vector, wherein the motion vector is different from the decoded motion vector associated with the current block, wherein the reference block refers to those blocks whose centers are located at the same horizontal and vertical positions in a previously coded frame as the current block in the current frame, wherein the reference block is derived by a motion estimation method by searching from a previously coded frame to find a block that is closest to the current block in some metric, wherein the motion estimation is performed with integer precision to avoid fractional pixel interpolation, or wherein the motion estimation is performed with fractional precision to improve the quality of the reference block.

[0641] 115. A method as in any one of solutions 1 to 114, wherein the reference block is derived by reusing at least one motion vector in the current block, wherein the motion vector is first rounded to integer precision to avoid fractional pixel interpolation, wherein the reference block is located by adding an offset determined by the motion vector to the position of the current block, wherein the motion vector is capable of referring to a previously coded picture including the reference block, wherein the motion vector is scaled to a previously coded picture including the reference block, wherein the reference block and / or the co-located block is the same size as the current block, wherein the reference block and / or the co-located block is larger than the current block, wherein a reference block and / or the co-located block having the same size as the current block is first found and then the reference block and / or the co-located block is extended at each boundary to include more samples from the previously coded samples, or, wherein the size of the extended area is signaled to the decoder or derived in real time.

[0642] 116. The method of any of solutions 1 to 115, wherein the information comprises two reference blocks and / or co-located blocks for the current block, one of which is from the first reference frame in list-0 and the other is from the first reference frame in list-1.

[0643] 117. A method as in any one of solutions 1 to 116, wherein a filter having at least one extended tap uses different settings in different reference frames, wherein the filter uses different shapes in different reference frames, wherein the filter uses different filter sizes in different reference frames, or wherein the filter is designed in an asymmetric manner.

[0644] 118. A method as described in any one of solutions 1 to 117, wherein the filter is designed in a symmetrical manner between reference frames, and each coefficient of the extended tap is shared by input samples within different reference frames, and wherein the filter comprises: twenty different spatial taps in the shape of forty-one tap diamonds; eight different extended taps in the shape of thirteen tap diamonds with a third input; thirteen different extended taps in the shape of thirteen tap diamonds with a first reference frame; the thirteen different extended taps in the shape of thirteen tap diamonds with a second reference frame.

[0645] 119. A method as described in any one of solutions 1 to 118, wherein the filter is designed in a symmetrical manner in each reference frame, wherein each coefficient of the extended tap is shared by input samples within different reference frames, and wherein the filter comprises: twenty different spatial taps in the shape of forty-one tap diamonds; eight different extended taps in the shape of thirteen tap diamonds with a third input; fourteen different extended taps in the shape of thirteen tap diamonds with a first reference frame; and the fourteen different extended taps in the shape of thirteen tap diamonds have a second reference frame.

[0646] 120. A method as in any one of solutions 1 to 119, wherein an intermediate filtering result of an offline trained ALF filter can be used as an input to the expansion tap, or wherein an intermediate filtering result of other predefined filters can be used as an input to the expansion tap.

[0647] 121. A method as in any one of solutions 1 to 119, wherein intermediate filtering results of an online-trained ALF filter can be used as input to an extended tap, or wherein intermediate filtering results of other online-trained filters can be used as input to an extended tap.

[0648] 122. A method as described in any one of solutions 1 to 121, wherein the reconstructed samples before or after different coding and decoding stages of the current frame are used as inputs to the extension taps, wherein the reconstruction before or after DBF of the current frame is used as inputs to the extension taps, wherein the reconstruction before or after sample adaptive offset SAO or cross-component sample adaptive offset (CCSAO) of the current frame is used as inputs to the extension taps, wherein the reconstruction before or after BIF of the current frame is used as inputs to the extension taps, or wherein the reconstruction before or after other stages of the current frame is used as inputs to the extension taps.

[0649] 123. A method as described in any one of solutions 1 to 122, further comprising determining whether and / or how to use the reconstructed samples before or after different encoding and decoding stages of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the DBF of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the DBF of one reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the DBF of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after the SAO / CCSAO of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the SAO / CCSAO of one reference frame as the input of the extension tap, And / or how to use the reconstruction before or after SAO / CCSAO of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of one reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after other stages of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after other stages of one reference frame as the input of the extension tap, or whether and / or how to use the reconstruction before or after other stages of multiple reference frames as the input of the extension tap.

[0650] 124. A method as in any one of solutions 1 to 123, further comprising determining whether and / or how to use a mapping or transformation result as an input to an extended tap, whether and / or how to use a specific transformation to generate an input to an extended tap, wherein the DCT is applied, the FFT is applied, the DWT is applied, or other transformation functions are applied, and wherein a specific mapping function is used to generate an input to an extended tap, wherein the square function is applied, the variance function is applied, the sine function is applied, the cosine function is applied, or other linear or nonlinear mapping functions are applied.

[0651] 125. A method as in any one of solutions 1 to 124, wherein the extension taps use multiple inputs inside or outside the potential inputs, wherein the extension taps jointly use the reconstruction before DBF of the current frame and the reconstructed reference frame as inputs, wherein the extension taps jointly use the reconstruction before DBF of the current frame and the reconstruction before DBF of the reference frame as inputs, wherein the extension taps jointly use the reconstruction before BDF of the current frame and the reconstruction after DBF of the reference frame as input sources, or wherein the extension taps jointly use the reconstruction before DBF of the reference frame and the reconstructed reference frame as input sources, and wherein the extension taps jointly use N inputs, where N is a positive integer.

[0652] 126. A method as described in any one of solutions 1 to 124, wherein at least one extended tap uses different settings for different inputs, wherein the shapes used for one or more extended taps use different shapes for different inputs, wherein the shapes used for one or more extended taps use a diamond shape in one input and a square shape in another input, wherein the filter lengths used for one or more extended taps use different filter sizes in different inputs, wherein one or more extended taps are designed in an asymmetric manner and each coefficient of the extended tap has a specific input, wherein one or more extended taps are designed in a symmetric manner between different inputs and each coefficient of the extended tap can be shared by different inputs, or wherein one or more extended taps are designed in a symmetric manner within different inputs and each coefficient of the extended tap can be shared by samples within a specific input.

[0653] 127. The method of any one of solutions 1 to 126, wherein any of the aforementioned methods are used jointly or individually.

[0654] 128. A method as in any one of solutions 1 to 127, wherein the method is applied to any loop filtering tool, pre-processing filtering, or post-processing filtering in video codec, including ALF, CCALF, other loop filtering methods, pre-processing filtering methods, post-processing filtering methods, or any other filtering methods.

[0655] 129. A method as in any one of solutions 1 to 128, wherein the video unit of the visual media data refers to a sequence, a picture, a sub-picture, a slice, a codec tree unit (CTU), a CTU row, a CTU group, a codec unit (CU), a prediction unit (PU), a transform unit (TU), a codec tree block (CTB), a codec block (CB), a prediction block (PB), a transform block (TB), or any other region including more than one luma or chroma sample or pixel, wherein whether and / or how to apply the disclosed method is signaled in the bitstream at a sequence level, a group of pictures level, a picture level, a slice level, or a slice group level, such as in a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a dependency parameter set (DPS), a decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a slice group header,

[0656] Wherein a prediction block (PB), a transform block (TB), a codec block (CB), a prediction unit (PU), a transform unit (TU), a codec unit (CU), a video pipe data unit (VPDU), a codec tree unit (CTU), a CTU row, a slice, a slice, a sub-picture or other types of regions including more than one sample or pixel in the bitstream are signaled whether and / or how to apply the disclosed method; or

[0657] Whether and / or how to apply the disclosed method depends on codec information such as block size, color format, single-tree or dual-tree partitioning, color component, slice or picture type.

[0658] 130. A device for processing video data, comprising: a processor; and a non-temporary memory storing instructions, wherein the instructions, when executed by the processor, cause the processor to perform a method as any one of solutions 1 to 129.

[0659] 131. A non-temporary 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-temporary computer-readable medium, so that when executed by a processor, the video codec device performs a method as described in any one of Solutions 1 to 129.

[0660] 132. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a method performed by a video processing device, wherein the method includes: determining an extended tap for an adaptive loop filter (ALF); and generating a bitstream based on the determination.

[0661] 133. A method for storing a bitstream of a video, comprising: determining an extended tap for an adaptive loop filter (ALF); generating a bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.

[0662] 134. A method, apparatus or system as described in the present disclosure.

[0663] In this document, the term "video processing" may refer to video encoding, video decoding, video compression, or video decompression. For example, a video compression algorithm may be applied during conversion from a pixel representation of a video to a corresponding bitstream representation (or vice versa). For example, the bitstream representation of a current video block may correspond to bits that are co-located or distributed at different locations in the bitstream, as defined by the syntax. For example, a macroblock may be encoded based on an error residual value of a transform and codec, and also encoded using bits in a header and other fields in the bitstream. In addition, during conversion, the decoder may parse the bitstream based on a determination, and it is known that certain fields may or may not exist, as described in the above solution. Similarly, the encoder may determine whether to include certain syntax fields, and generate the codec representation accordingly by including or excluding syntax fields in the codec representation.

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

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

[0666] 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, a special purpose logic circuit, such as an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

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

[0668] Although many details are included herein, these details should not be interpreted as limitations on 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 this article in the context of separate embodiments may also be implemented in combination in a single embodiment. On the contrary, 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 features may be described above as acting in certain combinations and even initially claimed, 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.

[0669] 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 herein should not be understood as requiring such separation in all embodiments.

[0670] 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 herein.

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

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

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

Claims

1. A method for processing visual media data, comprising: Using one or more extended taps in an adaptive loop filter (ALF) or a cross-component ALF (CCALF); as well as performing conversion between the visual media data and a bitstream based on the extended tap used in the ALF, wherein the syntax element structure in the bitstream comprises one or more filters having at least one extended tap, wherein a first syntax element is included in the bitstream, indicating whether at least one extension tap inside the filter is enabled, and wherein the first syntax element is binarized by a unary code, a truncated unary code, a fixed length code, an exponential Golomb code, a truncated exponential Golomb code, or a bypass code, wherein the extended taps obtain information from one or more reference frames in list zero, list one, or both, and Whether to obtain information from a previously coded frame depends on the slice type, picture type or temporal layer index.

2. The method of claim 1, wherein the ALF comprises one or more spatial taps, wherein the one or more spatial taps are different from the one or more extended taps, and wherein the one or more spatial taps utilize only information of spatially adjacent samples of a filtering component.

3. The method of any one of claims 1 to 2, wherein the one or more extension taps and spatial domain taps coexist within the ALF.

4. The method according to any one of claims 1 to 3, wherein the ALF comprises an extension tap and a spatial domain tap.

5. The method according to any one of claims 1 to 4, wherein the ALF comprises M spatial domain taps and N extension taps, wherein M and N are positive integers.

6. The method according to any one of claims 1 to 5, wherein the ALF comprises only the extended taps.

7. The method as claimed in any one of claims 1 to 6, wherein a filter having at least one extended tap is used for filtering the different color components.

8. The method as claimed in any one of claims 1 to 7, wherein a filter having at least one extended tap is used to filter only the luminance component.

9. The method of any one of claims 1 to 8, wherein a filter having at least one extended tap is used to filter only chrominance components, wherein the chrominance components include a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

10. The method of any one of claims 1 to 9, wherein a filter having at least one extended tap is used to filter a luminance component and a chrominance component, wherein the chrominance component comprises a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

11. The method of any one of claims 1 to 10, wherein a filter having at least one extended tap is used to filter all luminance components and all chrominance components, wherein the chrominance components include a blue difference chrominance component (Cb) and a red difference chrominance component (Cr).

12. The method of any one of claims 1 to 11, wherein one coefficient corresponding to an extended tap corresponds to one or more inputs of the ALF.

13. The method of any one of claims 1 to 12, wherein one coefficient corresponding to an extended tap corresponds to only one input of the ALF.

14. The method of any one of claims 1 to 13, wherein one coefficient corresponding to an extended tap corresponds to N inputs of the ALF, wherein N is a positive integer.

15. The method of any one of claims 1 to 14, wherein the filter having at least one extended tap is configured to be trained in a plurality of different ways.

16. The method of any one of claims 1 to 15, wherein the training data collection of the one or more extension taps is performed jointly with the one or more spatial domain taps of the ALF.

17. The method of any one of claims 1 to 16, wherein the training data collection of the one or more extended taps of the ALF is performed independently.

18. The method of any one of claims 1 to 17, wherein coefficients of the one or more extension taps are performed jointly with one or more spatial domain taps of the ALF.

19. The method of any one of claims 1 to 18, wherein coefficients of the one or more extended taps of the ALF are performed independently.

20. The method of any one of claims 1 to 19, wherein parameters of the one or more extension taps are derived jointly with one or more spatial domain taps of the ALF.

21. A method as claimed in any one of claims 1 to 20, wherein parameters of the one or more extension taps are independently derived.

22. The method of any one of claims 1 to 21, wherein filters having at least one extended tap are used to form independent filters in the ALF.

23. The method of claim 22, wherein the training data collection for the filter having at least one extended tap is performed independently.

24. The method of claim 22, wherein training data collection for the filter having at least one extended tap is performed based on samples that have not been ALF filtered.

25. The method of claim 22, wherein training data collection for the filter having at least one extended tap is performed based on ALF filtered samples.

26. The method of claim 22, wherein coefficients of the filter having at least one extended tap are independently trained.

27. The method of claim 22, wherein parameters of the filter having at least one extended tap are independently generated or derived.

28. The method of any one of claims 1 to 27, wherein the filter having at least one extended tap is configured to use different shapes or different sizes.

29. A method as claimed in any one of claims 1 to 28, wherein the filter comprises one or more shapes corresponding to different types of taps.

30. The method of any one of claims 1 to 29, wherein a first shape of one or more spatial domain taps used in a filter is different from a second shape of the one or more extension taps used in the filter.

31. A method as claimed in any one of claims 1 to 30, wherein a first shape of one or more spatial domain taps used in a filter is the same as a second shape of the one or more extension taps used in the filter.

32. A method as claimed in any one of claims 1 to 31, wherein one or more spatial taps in the filter use different shapes.

33. A method as claimed in any one of claims 1 to 32, wherein one or more spatial taps in the filter have a diamond shape.

34. A method as claimed in any one of claims 1 to 32, wherein one or more spatial taps in the filter have a square shape.

35. The method of any one of claims 1 to 32, wherein one or more spatial taps in the filter have a cross shape.

36. A method as claimed in any one of claims 1 to 32, wherein one or more spatial taps in the filter have a symmetrical shape.

37. A method as claimed in any one of claims 1 to 32, wherein one or more spatial taps in the filter have an asymmetric shape.

38. A method as claimed in any one of claims 1 to 32, wherein the filter comprises twenty different spatial taps in the shape of a cross of forty-one taps.

39. A method as claimed in any one of claims 1 to 32, wherein one or more spatial taps in the filter are determined in real time, signalled in the bitstream or derived.

40. The method of any one of claims 1 to 39, wherein the one or more extension taps in the filter use different shapes.

41. A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in the filter have a diamond shape.

42. A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in the filter have a square shape.

43. A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in the filter have a cross shape.

44. A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in the filter have a symmetrical shape.

45. A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in the filter have an asymmetric shape.

46. ​​A method as claimed in any one of claims 1 to 40, wherein one or more extension taps in a filter are determined in real time, signalled in the bitstream or derived.

47. A method as claimed in any one of claims 1 to 46, wherein the filter comprises one or more filter lengths corresponding to different types of taps.

48. A method as described in any one of claims 1 to 46, wherein a first filter length used for one or more spatial domain taps in a filter is different from a second filter length used for the one or more extended taps in the filter.

49. A method as described in any one of claims 1 to 46, wherein a first filter length used for one or more spatial domain taps in a filter is the same as a second filter length used for the one or more extended taps in the filter.

50. A method as claimed in any one of claims 1 to 49, wherein the filter lengths of different spatial taps in the filter are different.

51. The method of claim 50, wherein the filter length is N, wherein N is 9, 11 or 13.

52. A method as claimed in any one of claims 50 to 51, wherein the filter length is determined in real time, signalled in the bitstream or derived.

53. A method as claimed in any one of claims 1 to 52, wherein the filter lengths of different extended taps in the filter are different.

54. The method of claim 53, wherein the filter length is N, where N is 3.

55. A method as claimed in any one of claims 53 to 54, wherein the filter length is determined in real time, signalled in the bitstream or derived.

56. A method as claimed in any one of claims 1 to 55, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; as well as Five different expansion taps in the shape of a diamond.

57. A method as claimed in any one of claims 1 to 56, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; as well as Thirteen different expansion taps in a diamond shape.

58. A method as claimed in any one of claims 1 to 57, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; as well as Five different expansion taps in the shape of a diamond.

59. The method of any one of claims 1 to 58, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; as well as Thirteen different expansion taps in a diamond shape.

60. The method of any one of claims 1 to 59, wherein a symmetry constraint is performed on a filter including the one or more extension taps.

61. A method as claimed in any one of claims 1 to 59, wherein a geometric symmetry constraint is performed on one or more spatial taps of the filter.

62. A method as claimed in any one of claims 1 to 59, wherein a geometric symmetry constraint is performed on the one or more extended taps of the filter.

63. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; as well as Seven different extension taps in the shape of a thirteen tap diamond.

64. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; as well as Three different extended taps in the shape of a five tap diamond.

65. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; as well as Seven different extension taps in the shape of a thirteen tap diamond.

66. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; as well as Three different extended taps in the shape of a five tap diamond.

67. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; as well as Two different extension taps in the shape of a five-tap diamond.

68. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-seven tap cross; as well as Five different extension taps in the shape of a nine-tap cross.

69. A method as claimed in any one of claims 60 to 62, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-seven tap cross; as well as Four different extension taps in the shape of a nine-tap cross.

70. The method of any one of claims 60 to 62, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; as well as Seven different extension taps in the shape of a thirteen tap diamond.

71. The method of any one of claims 60 to 62, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; as well as Six different extension taps in the shape of a thirteen tap diamond.

72. The method of any one of claims 60 to 62, wherein the filter comprises: eighteen different airspace taps in the shape of a thirty-seven tap diamond; as well as Three different extended taps in the shape of a five tap diamond.

73. The method of any one of claims 60 to 62, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; as well as Two different extension taps in the shape of a nine-tap cross.

74. The method of any one of claims 60 to 62, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-three tap cross; as well as Five different extension taps in the shape of a nine-tap cross.

75. The method of any one of claims 60 to 62, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-three tap cross; as well as Four different extension taps in the shape of a nine-tap cross.

76. The method of any one of claims 60 to 62, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; as well as Seven different extended taps in the shape of a thirteen tap cross.

77. The method of any one of claims 60 to 62, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; as well as Six different extended taps in the shape of a thirteen tap cross.

78. The method of any one of claims 1 to 59, wherein a multi-input based symmetry constraint is performed on a filter including the one or more extended taps.

79. The method of claim 78, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; thirteen different extended taps having a first input in the shape of a thirteen tap cross; and The thirteen different extended taps in the shape of the thirteen tap crosses also have a second input.

80. The method of any one of claims 1 to 79, wherein geometric constraints and multi-input based symmetry constraints are performed separately for the filter.

81. A method as described in any one of claims 1 to 80, wherein geometric constraints and multi-input based symmetry constraints are jointly performed on the filter.

82. The method of claim 81, wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; seven different extended taps having a first input in the shape of a thirteen-tap cross; and The seven different extended taps in the shape of the thirteen-tap cross also have a second input.

83. A method as described in any one of claims 1 to 82, wherein the filter including the one or more extension taps has multiple inputs for the one or more extension taps.

84. The method of claim 83, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Five different extended taps with a third input in the shape of a five tap diamond.

85. The method of claim 83, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Nine different extension taps with a third input in the shape of a thirteen tap diamond.

86. The method of claim 83, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Five different extended taps with a third input in the shape of a five tap diamond.

87. The method of claim 83, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Four different extended taps with a third input in the shape of a five tap diamond.

88. The method of claim 83, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Seven different extension taps with a third input in the shape of a nine-tap cross.

89. The method of claim 83, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Six different extension taps with a third input in the shape of a nine-tap cross.

90. The method of claim 83, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Nine different extension taps with a third input in the shape of a thirteen tap diamond.

91. The method of claim 83, wherein the filter comprises: Fourteen different airspace taps in the shape of a twenty-nine tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Eight different extended taps with a third input in the shape of a thirteen tap diamond.

92. The method of claim 83, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Five different extended taps with a third input in the shape of a five tap diamond.

93. The method of claim 83, wherein the filter comprises: Eighteen different airspace taps in the shape of a thirty-seven tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Four different extended taps with a third input in the shape of a five tap diamond.

94. The method of claim 83, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-three tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Seven different extension taps with a third input in the shape of a nine-tap cross.

95. The method of claim 83, wherein the filter comprises: sixteen different airspace taps in the shape of a thirty-three tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Six different extension taps with a third input in the shape of a nine-tap cross.

96. The method of claim 83, wherein the filter comprises: fourteen different airspace taps in the shape of a thirty-nine tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Nine different extension taps with a third input in the shape of a thirteen tap diamond.

97. The method of claim 83, wherein the filter comprises: fourteen different airspace taps in the shape of a thirty-nine tap cross; having different expansion taps of the first input; having a different extended tap of the second input; as well as Eight different extension taps with a third input in the shape of a thirteen tap diamond.

98. The method of claim 83, wherein the filter comprises: twenty different airspace taps in the shape of a forty-one tap cross; having different expansion taps of the first input; as well as With different expansion taps for the second input.

99. A method as described in any one of claims 1 to 98, wherein multiple inputs are designed in different orders, and wherein the coefficient index is modified according to one or more of the different orders.

100. A method as described in any one of claims 1 to 99, wherein a geometric basis transpose of the one or more extended taps is applied, and wherein the design of the geometric basis transpose is the same as or different from the design of the spatial domain taps.

101. A method as described in any one of claims 1 to 100, wherein the total number of the one or more extension taps inside the filter is derived jointly based on the shape, filter length or symmetry constraints.

102. A method as described in any one of claims 1 to 101, wherein a filter having at least one extended tap can be classified based on texture information or frequency band information, wherein the texture information is generated by gradient or variance, and wherein the frequency band information is generated according to the intensity of one or more input samples.

103. A method as described in any one of claims 1 to 102, wherein the classification result is independently generated based on the input of the spatial taps of the filter, or independently generated based on the input of the extended taps of the filter, or jointly generated based on the input of the spatial taps and extended taps of the filter.

104. The method of any one of claims 1 to 103, wherein the first syntax element is encoded or decoded by arithmetic coding or by utilizing at least one context, wherein the context depends on encoding or decoding information of a current block or a neighboring block or on a filtering shape of at least one neighboring block.

105. A method as described in any one of claims 1 to 104, wherein the first syntax element is conditionally signaled only when the extended tap is available, or the first syntax element is predicted in a predictive manner, wherein the first syntax element is predicted by an on / off decision of the extended tap of at least one neighboring block, wherein the first syntax element is signaled independently for different color components, wherein the first syntax element is signaled and shared between different color components, or the first syntax element is signaled for a first color component but not for a second color component.

106. A method as described in any one of claims 1 to 105, wherein the syntax element structure includes an adaptive parameter set (APS), and wherein the coefficients of the extended taps are included in the APS, the limiting parameters of the extended taps are included in the APS, the class merging results of the extended taps are included in the APS, or other parameters of the extended taps are included in the APS.

107. The method of any one of claims 1 to 106, wherein a filter having at least one extended tap is used for the ALF, wherein the filter is based on one or more previously coded and decoded frames and motion information, wherein at least one of the previously coded and decoded frames is a reference frame in a reference picture list (RPL) or a reference picture set (RPS) associated with a block, a current slice, or a frame, wherein the previously coded and decoded frame is a short-term reference picture of the block, the current slice, or the frame, or wherein the previously coded and decoded frame is a long-term reference picture of the block, the current slice, or the frame.

108. A method as described in any one of claims 1 to 106, wherein the previously encoded and decoded frame is not a reference frame and is stored in a decoded picture buffer (DPB), wherein at least one indicator is signaled in the bitstream to indicate which one of the previously encoded and decoded frames is to be used, wherein the indicator is signaled to indicate which reference picture list is to be used, wherein the indicator is conditionally signaled depending on how many reference pictures are included in the RPL or the RPS, or wherein the indicator is conditionally signaled depending on how many previously decoded pictures are included in the DPB.

109. A method as described in any one of claims 1 to 108, wherein which frames to be utilized are determined in real time, wherein an extension tap obtains information from one or more previously encoded and decoded frames in the DPB, wherein the extension tap is capable of obtaining information from a reference frame that is closest to the current frame or has a minimum picture order count (POC) distance to the current slice or frame, wherein the extension tap obtains information from a reference frame having a reference index equal to K in a reference list, and wherein K is predefined, derived in real time based on the reference picture information, or signaled in the bitstream.

110. The method of any one of claims 1 to 109, wherein the extension taps obtain information from a co-located frame, wherein the frame to be utilized is determined by decoded information, wherein the frame to be utilized is defined as the first N most frequently used reference pictures for samples within the current slice or frame, wherein the frame to be utilized is defined as the first N (e.g., N=1) most frequently used reference pictures for each reference picture list when available for samples within the current slice or frame, or wherein the frame to be utilized is defined as the picture with the first N smallest POC distances or absolute POC distances relative to the current picture.

111. A method as described in any one of claims 1 to 110, wherein whether to obtain information from a previously coded frame depends on decoded information, such as a coding mode, statistics or characteristics of at least one area of ​​the block to be filtered, wherein the filter is applied only to inter-coded strips or pictures, wherein whether to obtain information from a previously coded frame depends on the availability of a reference picture, wherein whether to obtain information from a previously coded frame depends on the reference picture information or the picture information in the DPB, wherein the filter is disabled when the minimum POC distance between the reference picture or the picture in the DPB and the current picture is greater than a threshold, or wherein the filter is applied to a block with a given temporal layer index.

112. A method as described in any one of claims 1 to 111, wherein when the block to be filtered includes a portion of samples encoded and decoded in a non-inter-frame mode, the extended tap does not use information from a previously encoded and decoded frame to filter the block, wherein the non-inter-frame mode is defined as an intra-frame mode, or wherein the non-inter-frame mode is defined as a group of coding modes including intra-frame, intra-frame block copy (IBC) or palette mode.

113. The method of any one of claims 1 to 112, wherein a distortion between a current block and a matching block is calculated and the distortion is used to decide whether to obtain information from a previously coded frame to filter the current block, wherein the distortion between a co-located block in a previously coded frame and the current block can be used to decide whether to obtain information from a previously coded frame to filter the current block, wherein a matching block is first found from at least one previously coded frame using motion estimation, or wherein when the distortion is greater than a predefined threshold, information from a previously coded frame is not used.

114. A method as claimed in any one of claims 1 to 113, wherein how and / or whether a filter with at least one extended tap is used to obtain the motion information of the current block and reconstructed samples in a previously coded frame or slice to construct or generate a reference block, wherein the reference block is defined as those blocks in the one or more reference blocks and / or co-located blocks of the current block, wherein the reference block is defined as those blocks in the area pointed to by a motion vector, wherein the motion vector is different from the decoded motion vector associated with the current block, wherein the reference block refers to those blocks whose centers are located at the same horizontal and vertical positions as the current block in the current frame in the previously coded frame, wherein the reference block is derived by motion estimation by searching from the previously coded frame to find the block that is closest to the current block by a certain metric, wherein the motion estimation is performed with integer precision to avoid fractional pixel interpolation, or wherein the motion estimation is performed with fractional precision to improve the quality of the reference block.

115. The method of any one of claims 1 to 114, wherein a reference block is derived by reusing at least one motion vector in the current block, wherein the motion vector is first rounded to integer precision to avoid fractional pixel interpolation, wherein the reference block is located by adding an offset determined by the motion vector to the position of the current block, wherein the motion vector refers to the previously coded picture including the reference block, wherein the motion vector is scaled to the previously coded picture including the reference block, wherein the reference block and / or the co-located block is the same size as the current block, wherein the reference block and / or the co-located block is larger than the current block, wherein a reference block and / or the co-located block having the same size as the current block is first found and then the reference block and / or the co-located block is extended at each boundary to include more samples from previously coded samples, or wherein the size of the extended area is signaled to the decoder or derived in real time.

116. The method of any one of claims 1 to 115, wherein the information comprises two reference blocks and / or co-located blocks of the current block, one of which is from the first reference frame in list-0 and the other is from the first reference frame in list-1.

117. A method as described in any one of claims 1 to 116, wherein a filter having at least one extended tap uses different settings in different reference frames, wherein the filter uses different shapes in different reference frames, wherein the filter uses different filter sizes in different reference frames, or wherein the filter is designed in an asymmetric manner.

118. The method of any one of claims 1 to 117, wherein the filter is designed in a symmetrical manner between reference frames and each coefficient of an extended tap is shared by input samples in different reference frames, and wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; eight different extended taps having a third input in the shape of a thirteen-tap diamond; thirteen different extended taps of the first reference frame in the shape of thirteen tap diamonds; and The thirteen different extended taps in the thirteen-tap diamond shape have a second reference frame.

119. The method of any one of claims 1 to 118, wherein the filter is designed in a symmetrical manner in each reference frame, wherein each coefficient of the extended tap is shared by the input samples in different reference frames, and wherein the filter comprises: twenty different spatial taps in the shape of a forty-one tap diamond; eight different extended taps having a third input in the shape of a thirteen-tap diamond; fourteen different extended taps of the first reference frame in the shape of a thirteen-tap diamond; and The fourteen different extended taps in the shape of thirteen-tap diamonds have a second reference frame.

120. A method as described in any one of claims 1 to 119, wherein an intermediate filtering result of an offline trained ALF filter can be used as an input to the expansion tap, or wherein an intermediate filtering result of other predefined filters can be used as an input to the expansion tap.

121. A method as described in any one of claims 1 to 119, wherein the intermediate filtering results of an online-trained ALF filter can be used as an input to an extended tap, or wherein the intermediate filtering results of other online-trained filters can be used as an input to an extended tap.

122. A method as described in any one of claims 1 to 121, wherein the reconstructed samples before or after different encoding and decoding stages of the current frame are used as input to the extension tap, wherein the reconstruction before or after DBF of the current frame is used as input to the extension tap, wherein the reconstruction before or after sample adaptive offset SAO or cross-component sample adaptive offset (CCSAO) of the current frame is used as input to the extension tap, wherein the reconstruction before or after BIF of the current frame is used as input to the extension tap, or wherein the reconstruction before or after other stages of the current frame is used as input to the extension tap.

123. The method of any one of claims 1 to 122, further comprising determining whether and / or how to use the reconstructed samples before or after different coding and decoding stages of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the DBF of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the DBF of one reference frame as the input of the extension tap, whether and / or how to use the reconstruction before / after the DBF of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after the SAO / CCSAO of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the SAO / CCSAO of one reference frame as the input of the extension tap, Whether and / or how to use the reconstruction before or after SAO / CCSAO of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of one reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after the BIF of multiple reference frames as the input of the extension tap, whether and / or how to use the reconstruction before or after other stages of the reference frame as the input of the extension tap, whether and / or how to use the reconstruction before or after other stages of one reference frame as the input of the extension tap, or whether and / or how to use the reconstruction before or after other stages of multiple reference frames as the input of the extension tap.

124. The method of any one of claims 1 to 123, further comprising determining whether and / or how to use a mapping or transformation result as an input to an extended tap, whether and / or how to use a specific transformation to generate an input to an extended tap, wherein the DCT is applied, the FFT is applied, the DWT is applied, or other transformation functions are applied, and A specific mapping function is used to generate the input of the extended tap, wherein the square function is applied, the variance function is applied, the sine function is applied, the cosine function is applied, or other linear or nonlinear mapping functions are applied.

125. The method of any one of claims 1 to 124, wherein the expansion tap uses multiple inputs inside or outside the potential input, wherein the expansion tap jointly uses the reconstruction before DBF of the current frame and the reconstructed reference frame as input, wherein the expansion tap jointly uses the reconstruction before DBF of the current frame and the reconstruction before DBF of the reference frame as input, wherein the expansion tap jointly uses the reconstruction before BDF of the current frame and the reconstruction after DBF of the reference frame as input sources, or wherein the expansion tap jointly uses the reconstruction before DBF of the reference frame and the reconstructed reference frame as input sources, and The expansion taps jointly use N inputs, where N is a positive integer.

126. A method as described in any one of claims 1 to 124, wherein at least one extended tap uses different settings for different inputs, wherein the shapes used for one or more extended taps use different shapes for different inputs, wherein the shapes used for one or more extended taps use a diamond shape in one input and a square shape in another input, wherein the filter lengths used for one or more extended taps use different filter sizes in different inputs, wherein one or more extended taps are designed in an asymmetric manner and each coefficient of the extended tap has a specific input, wherein one or more extended taps are designed in a symmetric manner between different inputs and each coefficient of the extended tap can be shared by different inputs, or wherein one or more extended taps are designed in a symmetric manner within different inputs and each coefficient of the extended tap can be shared by samples within a specific input.

127. The method of any one of claims 1 to 126, wherein any of the aforementioned methods are used in combination or individually.

128. A method as described in any one of claims 1 to 127, wherein the method is applied to any loop filtering tool, pre-processing filtering, or post-processing filtering in video codec, including ALF, CCALF, other loop filtering methods, pre-processing filtering methods, post-processing filtering methods or any other filtering methods.

129. The method of any one of claims 1 to 128, wherein the video unit of the visual media data is a sequence, a picture, a sub-picture, a slice, a codec tree unit (CTU), a CTU row, a CTU group, a codec unit (CU), a prediction unit (PU), a transform unit (TU), a codec tree block (CTB), a codec block (CB), a prediction block (PB), a transform block (TB), or any other region including more than one luma or chroma sample or pixel, Wherein whether to apply and / or how to apply the disclosed method is signaled in the bitstream at a sequence level, a group of picture level, a picture level, a slice level or a slice group level, such as in a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a dependency parameter set (DPS), a decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header or a slice group header, wherein a prediction block (PB), a transform block (TB), a codec block (CB), a prediction unit (PU), a transform unit (TU), a codec unit (CU), a video pipe data unit (VPDU), a codec tree unit (CTU), a CTU row, a slice, a slice, a sub-picture, or other types of regions including more than one sample or pixel in the bitstream is signaled whether and / or how to apply the disclosed method; or Whether and / or how to apply the disclosed method depends on codec information such as block size, color format, single-tree or dual-tree partitioning, color component, slice or picture type.

130. The method of any one of claims 1 to 129, wherein the converting comprises encoding the visual media data into the bitstream.

131. The method of any one of claims 1 to 129, wherein the converting comprises decoding the visual media data from the bitstream.

132. 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 to 131.

133. 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 131.

134. A non-transitory computer-readable recording medium storing a bit stream of visual media data generated by a method performed by a visual media data processing apparatus, wherein the method comprises: determining an expansion tap for an adaptive loop filter (ALF); as well as The bitstream is generated based on the determination.

135. A method for storing a bitstream of visual media data, comprising: determining an expansion tap for an adaptive loop filter (ALF); generating the bitstream based on the determination; as well as The bit stream is stored in a non-transitory computer-readable recording medium.

136. A method, apparatus or system as described in this patent document.

Images