Adaptive loop filter classification using predefined filters in video encoding and decoding.
By combining adaptive loop filters and predefined filters, the artifact and distortion problems of existing video codecs under high resolution and high frame rate video are solved, thereby improving video quality and encoding/decoding efficiency.
Patent Information
- Application Number
- CN202580028858.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-04-19
- Filing Date
- 2025-04-21
- Publication Date
- 2026-11-17
AI Technical Summary
Existing video encoding and decoding technologies struggle to effectively reduce artifacts and distortion when processing high-resolution and high-frame-rate videos, particularly exhibiting inefficiencies in color space downsampling and loop filter processing.
The video data is classified using an adaptive loop filter (ALF) and predefined filters, and signal compensation is performed using a finite impulse response filter to reduce the mean square error between the original and reconstructed samples.
It improves the efficiency of artifact repair and image quality in the video encoding and decoding process, and enhances the processing capabilities of video codecs in high-resolution and high-frame-rate videos.
Smart Images

Figure CN123125859A_ABST
Abstract
Description
[0001] Cross-references to related applications
[0002] This application claims priority and benefit to International Application No. PCT / CN2024 / 088789, filed on April 19, 2024, the entire contents of which are incorporated herein by reference. Technical Field
[0003] This disclosure relates to the generation, storage, and use of digital audio and video media information in file formats. Background Technology
[0004] Digital video accounts for the largest share of bandwidth used on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, the bandwidth demand for digital video is likely to continue to grow. Summary of the Invention
[0005] The first aspect relates to a method for processing video data, comprising: determining an adaptive loop filter (ALF) classification using one or more predefined filters; and performing a conversion between visual media data and a bitstream based on the ALF.
[0006] The second aspect relates to an apparatus for processing video data, including a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform any of the aspects described above.
[0007] The third aspect relates to a non-transitory computer-readable medium comprising a computer program product for use by a video codec device, the computer program product including computer-executable instructions stored on the non-transitory computer-readable medium such that, when executed by a processor, the video codec device performs the methods of any of the preceding aspects.
[0008] The fourth aspect relates to a non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: determining adaptive loop filter (ALF) classification using one or more predefined filters; and generating the bitstream based on the determination.
[0009] The fifth aspect relates to a method for storing a bitstream of video, comprising: determining adaptive loop filter (ALF) classification using one or more predefined filters; generating the bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.
[0010] The sixth aspect relates to the methods, apparatus, or systems described in this disclosure.
[0011] For clarity, any of the embodiments described above may be combined with one or more other embodiments described above to create new embodiments within the scope of this disclosure.
[0012] These and other features will become clearer through the following detailed description of the embodiments with reference to the accompanying drawings and claims. Attached Figure Description
[0013] To gain a more complete understanding of this disclosure, reference is now made to the following brief description, taken in conjunction with the accompanying drawings and detailed description, wherein like reference numerals denote like parts.
[0014] Figure 1 Examples of the nominal vertical and horizontal positions of 4:2:2 luminance and chrominance samples in an image are shown.
[0015] Figure 2 A sample encoder block diagram is shown.
[0016] Figure 3 An example image is shown, segmented into raster scan strips.
[0017] Figure 4 An example image is shown, segmented into rectangular scan strips.
[0018] Figure 5 An example image showing the structure divided into bricks is shown.
[0019] Figures 6A-6C An example of a Coding Tree Block (CTB) spanning the boundaries of an image is shown.
[0020] Figure 7 An example of an intra-frame prediction mode is shown.
[0021] Figure 8 An example of a block boundary is shown in the image.
[0022] Figure 9 An example of pixels used in a filter is shown.
[0023] Figure 10 An example of the filter shape for an Adaptive Loop Filter (ALF) is shown.
[0024] Figure 11 An example of the transform coefficients supported by a 5×5 rhombus filter is shown.
[0025] Figure 12 An example of the relative coordinates supported by a 5×5 rhombus filter is shown.
[0026] Figure 13This is a block diagram illustrating an example video processing system.
[0027] Figure 14 This is a block diagram of an example video processing device.
[0028] Figure 15 This is a flowchart of an example method for video processing.
[0029] Figure 16 This is a block diagram illustrating an example video codec system.
[0030] Figure 17 This is a block diagram showing an example encoder.
[0031] Figure 18 This is a block diagram showing an example decoder.
[0032] Figure 19 This is a schematic diagram of an example encoder. Detailed Implementation
[0033] First, it should be understood that although illustrative implementations of one or more embodiments are provided below, the disclosed systems and / or methods can be implemented using any number of techniques, whether currently known or yet to be developed. This disclosure should not be limited in any way to the illustrative implementations, drawings, and techniques described below, including the exemplary designs and implementations shown and described herein, but modifications can be made within the full scope of their equivalents and within the scope of the appended claims.
[0034] Chapter headings are used in this disclosure for ease of understanding and not to limit the applicability of the techniques and embodiments disclosed in each chapter to that chapter only. Furthermore, the embodiments described herein are applicable to other video codec protocols and designs.
[0035] 1. Preliminary Discussion
[0036] This disclosure relates to video codec techniques. Specifically, it relates to loop filters and other codec tools in image / video codecs. These ideas can be applied individually or in various combinations to video codecs, such as High Efficiency Video Coding (HEVC), Versatile Video Coding (VVC), or other video codec techniques.
[0037] 2. Abbreviation
[0038] This disclosure includes the following abbreviations: Advanced video coding (AVC), Bidirectional Optical Flow (BDOF), Coded Picture Buffer (CPB), Clean Random Access (CRA), Coding Tree Unit (CTU), Coded Video Sequence (CVS), Convolutional Cross-component Model (CCCM), Cross-component Linear Model (CCLM), Decoded Picture Buffer (DPB), Decoding Parameter Set (DPS), General Constraints Information (GCI), and High Efficiency Video Coding (HEVC, also known as ITU-T H).265 | ISO / IEC 23008-2), History-based Motion Vector Prediction (HMVP), Joint Exploration Model (JEM), Low-frequency Non-separable Transform (LFNST), Matrix-Based Intra Prediction (MIP), Merge with Motion Vector Difference (MMVD), Motion Constrained Tile Set (MCTS), Multi Transform Selection (MTS), 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 Resampling The components include: Resampling (RPR), Raw Byte Sequence Payload (RBSP), Supplemental Enhancement Information (SEI), Slice Header (SH), Sequence Parameter Set (SPS), Symmetric Motion Vector Difference (SMVD), Video Coding Layer (VCL), Video Parameter Set (VPS), and Versatile Video Coding (VVC, also known as Recommendation ITU-T H).266 | ISO / IEC 23090-3), VVC Test Model (VTM), Video Usability Information (VUI), Transform Unit (TU), Coding Unit (CU), Deblocking Filter (DF), Sample Adaptive Offset (SAO), Adaptive Loop Filter (ALF), Coding Block Flag (CBF), Quantization Parameter (QP), Rate Distortion Optimization (RDO), and Bilateral Filter (BF).
[0039] 3. Video codec standards
[0040] Video coding standards have evolved primarily through the development of standards by the ITU Telecommunication Standardization Sector (ITU-T) of the International Telecommunication Union (ITU) and the International Organization for Standardization (ISO) / International Electrotechnical Commission (IEC). ITU-T produced the H.261 and H.263 standards, ISO / IEC produced the Moving Picture Experts Group (MPEG)-1 and MPEG-4 Vision standards, and the two organizations jointly produced the H.262 / MPEG-2 video standard and the H.264 / MPEG-4 Advanced Video Coding (AVC) standard and the H.265 / HEVC standard[1]. Starting with H.262, video coding standards are based on a hybrid video coding architecture, which utilizes temporal prediction plus transform coding. In order to explore future video coding technologies beyond HEVC, VCEG and MPEG jointly established the Joint Video Exploration Team (JVET). JVET adopted many approaches and incorporated them into a reference software called the Joint Exploration Model (JEM) [2]. When the Multi-Functional 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 working draft of VVC and the VVC Test Model (VTM) are constantly being updated.
[0041] A sample version of the VVC draft, namely the Multi-Functional Video Codec (Draft 10), can be found at: https: / / jvet-experts.org / doc_end_user / documents / 19_Teleconference / wg11 / JVET-S2001-v17.zip. A sample version of the VVC reference software, named VTM, can be found at: https: / / vcgit.hhi.fraunhofer.de / jvet-u-ee2 / VVCSoftware_VTM / - / tree / VTM-11.2.
[0042] The International Telecommunication Union Telecommunication Standardization Sector (ITU-T) Video Coding Experts Group (VCEG) and the International Organization for Standardization and the International Electrotechnical Commission (ISO / IEC) Moving Picture Experts Group (MPEG) Joint Technical Committee (JTC) 1 / Subcommittee (SC) 29 / Working Group (WG) 11 are studying the potential need for standardization of future video coding and decoding technologies with compression capabilities significantly exceeding the current VVC standard. This future standardization effort could take the form of multiple extensions to VVC or entirely new standards. These groups are working together on this exploration in a collaborative effort known as the Joint Video Exploration Team (JVET) to evaluate compression technology designs proposed by experts in the field. JVET has established the first Exploration Experiments (EE), and reference software called the Enhanced Compression Model (ECM) is in use. The ECM test model is continuously updated.
[0043] 3.1 Color Space and Chromaticity Downsampling
[0044] A color space, also known as a color model (or color system), is a mathematical model that describes a range of colors as tuples of numbers, such as 3 or 4 values or color components (e.g., RGB). Generally, a color space is a refinement of a coordinate system and its subspaces. For video compression, the most commonly used color spaces are Luminance, Blue Difference, and Red Difference (YCbCr) and Red, Green, and Blue (RGB).
[0045] YCbCr, Y'CbCr, or Y Pb / Cb Pr / Cr, also written as YCBCR or Y'CBCR, is a family 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 and red difference chromaticity components. Y' (with an apostrophe) is distinguished from Y, where Y is luminance; Y' means that the light intensity is non-linearly encoded based on gamma-corrected RGB primary colors.
[0046] Chromaticity downsampling is a practice of encoding images by applying a lower resolution to chromaticity information compared to luminance information, taking advantage of the fact that the human visual system is less sensitive to color differences than to luminance differences. 3.1.1 4:4:4
[0048] In a 4:4:4 scheme, each of the three Y'CbCr components has the same sample rate. Therefore, there is no chromaticity downsampling. This scheme is sometimes used in high-end film scanners and film post-production. 3.1.2 4:2:2
[0050] In a 4:2:2 format, both chroma components are sampled at half the sampling rate of the luminance. The horizontal chroma resolution is halved, while the vertical chroma resolution remains unchanged. This reduces the bandwidth of the uncompressed video signal by one-third with almost no visual difference. Figure 1 Examples of the nominal vertical and horizontal positions of 4:2:2 luminance and chrominance samples in an image are shown. 3.1.3 4:2:0
[0052] In 4:2:0, the horizontal sampling is doubled compared to 4:1:1, but the vertical resolution is halved because the Cb and Cr channels are sampled only on each alternating row. Therefore, the data rate remains the same. Cb and Cr are downsampled by a factor of 2 in both the horizontal and vertical directions. There are three variations of the 4:2:0 scheme with different horizontal and vertical positions.
[0053] In MPEG-2, Cb and Cr are co-located horizontally. Cb and Cr are located between pixels vertically (at gap positions). In Joint Picture Experts Group (JPEG) / JPEG File Interchange Format (JFIF), H.261, and MPEG-1, Cb and Cr are located at gap positions, in the middle of alternating luminance samples. In 4:2:0 DV, Cb and Cr are co-located horizontally. Vertically, Cb and Cr are co-located on alternating lines.
[0054] Table 1. SubWidthC and SubHeightC values derived from chroma_format_idc and separate_colour_plane_flag
[0055]
[0056] 3.2 Example codec stream for video codecs
[0057] Figure 2An example encoder block diagram is shown, for example in VVC. The encoder contains three loop filtering blocks: Deblocking Filter (DF), Sample Adaptive Compensation (SAO), and ALF. Unlike DF, which uses predefined filters, SAO and ALF utilize the original samples of the current image, reducing the mean square error between the original and reconstructed samples by adding compensation and by applying Finite Impulse Response (FIR) filters, respectively, and by utilizing encoded and decoded side information through signal transmission offset and filter coefficients. ALF is located in the final processing stage of each image and can be thought of as a tool to attempt to capture and repair artifacts caused by previous stages.
[0058] 3.3 Definition of Video / Encoding / Decoding Unit
[0059] An image 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 the image. A slice can be divided into one or more bricks, each brick comprising multiple CTU rows within the slice. 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 multiple slices of an image or multiple bricks of a slice.
[0060] Two stripe modes are supported: raster scan stripe mode and rectangular stripe mode. In raster scan stripe mode, the stripe contains a sequence of slices from a raster scan of the image. In rectangular stripe mode, the stripe contains multiple tiles that together form a rectangular area of the image. The tiles within the rectangular stripe are arranged in the order of the stripe's raster scan. Figure 3 An example image segmented into raster scan strips is shown. In the example, the image is segmented according to raster scan strip segmentation, where the image includes 18×12 luminance CTUs and is divided into 12 patches and 3 raster scan strips.
[0061] Figure 4 Example images segmented into rectangular scan strips are shown. For example, Figure 4 An example of rectangular strip segmentation of an image with 18×12 luminance CTUs is shown, where the image is divided into 24 slices (6 slice columns and 4 slice rows) and 9 rectangular strips.
[0062] Figure 5 Example images showing the structure divided into bricks are shown. For example, Figure 5 An example of an image divided into slices, bricks, and rectangular strips is shown, where the image is divided into 4 slices (2 slice columns and 2 slice rows), 11 bricks (the top left slice contains 1 brick, the top right slice contains 5 bricks, the bottom left slice contains 2 bricks, and the bottom right slice contains 3 bricks) and 4 rectangular strips.
[0063] 3.3.1 CTU / CTB Dimensions
[0064] In VVC, the CTU size for signal transmission in the Sequence Parameter Set (SPS) can be as small as 4×4 via the syntax element log2_ctu_size_minus2.
[0065] 7.3.2.3 Sequence Parameter Set (RBSP) Syntax
[0066]
[0067]
[0068] `log2_ctu_size_minus2` plus 2 specifies the luma codec block size for each CTU. `log2_min_luma_coding_block_size_minus2` plus 2 specifies the minimum luma codec 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:
[0069] CtbLog2SizeY = log2_ctu_size_minus2 + 2 (7-9)
[0070] CtbSizeY = 1 << CtbLog2SizeY (7-10)
[0071] MinCbLog2SizeY = log2_min_luma_coding_block_size_minus2 + 2 (7-11)
[0072] MinCbSizeY = 1 << MinCbLog2SizeY (7-12)
[0073] MinTbLog2SizeY = 2 (7-13)
[0074] MaxTbLog2SizeY = 6 (7-14)
[0075] MinTbSizeY = 1 << MinTbLog2SizeY (7-15)
[0076] MaxTbSizeY = 1 << MaxTbLog2SizeY (7-16)
[0077] PicWidthInCtbsY = Ceil( pic_width_in_luma_samples ÷ CtbSizeY ) (7-17)
[0078] PicHeightInCtbsY = Ceil( pic_height_in_luma_samples ÷ CtbSizeY )(7-18)
[0079] PicSizeInCtbsY = PicWidthInCtbsY PicHeightInCtbsY (7-19)
[0080] PicWidthInMinCbsY = pic_width_in_luma_samples / MinCbSizeY (7-20)
[0081] PicHeightInMinCbsY = pic_height_in_luma_samples / MinCbSizeY (7-21)
[0082] PicSizeInMinCbsY = PicWidthInMinCbsY PicHeightInMinCbsY (7-22)
[0083] PicSizeInSamplesY = pic_width_in_luma_samples pic_height_in_luma_samples (7-23)
[0084] PicWidthInSamplesC = pic_width_in_luma_samples / SubWidthC (7-24)
[0085] PicHeightInSamplesC = pic_height_in_luma_samples / SubHeightC (7-25)
[0086] 3.3.2 CTU in a picture
[0087] Figures 6A-6C shows an example of a CTB crossing the picture boundary. Figure 6A shows a CTB crossing the bottom picture boundary. Figure 6B shows a CTB crossing the right picture boundary. Figure 6C shows a CTB crossing the right and bottom picture boundaries. Let the CTB / Largest Coding Unit (LCU) size be indicated by M×N (usually M is equal to N), and for a CTB located at a picture boundary (or a slice or tile or other type of boundary, with the picture boundary as an example), K×L samples are within the picture boundary, where K<M or L<N. For CTBs such as Figures 6A-6C those shown, the CTB size is still equal to M×N, however, the bottom boundary / right boundary of the CTB is outside the picture.
[0088] 3.4 Intra prediction
[0089] Figure 7 shows an example of intra prediction modes. To capture any edge direction present in natural videos, the number of directional intra modes is extended from 33 used in HEVC to 65. The extended directional modes are as Figure 7 shown, and the Planar and Direct Current (DC) modes remain unchanged. These denser directional intra prediction modes apply to all block sizes, and both luma and chroma intra prediction.
[0090] As Figure 7 shown, the angular intra prediction directions can be defined as clockwise from 45 degrees to -135 degrees. 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, for example 67, and intra mode coding and decoding remains unchanged.
[0091] 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 needed to generate intra prediction values using the DC mode. In VVC, blocks can have a rectangular shape, which in the general case requires a division operation 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.
[0092] 3.5 Inter-frame prediction
[0093] For each inter-frame predicted CU, motion parameters include motion vectors, reference picture indexes, reference picture list usage indexes, and extended information for new encoding / decoding features used in VVC, which will be used for sample generation in the inter-frame predicted CU. Motion parameters can be transmitted via signaling in an explicit or implicit manner. When a CU is encoded / decoded in skip mode, the CU is associated with a PU and does not have significant residual coefficients, encoded / decoded motion vector increments, and / or reference picture indexes. A Merge mode is defined, whereby the motion parameters of the current CU are obtained from neighboring CUs, including spatial and temporal candidates, as well as extended scheduling introduced in VVC. The Merge mode can be applied to any inter-frame predicted CU, not just skip mode. An alternative to the Merge mode is explicit transmission of motion parameters, where the motion vectors, the corresponding reference picture indexes for each reference picture list, the reference picture list usage flags, and other useful information are explicitly transmitted via signaling for each CU.
[0094] 3.6 Deblocking Filter
[0095] Deblocking filtering is an example of a loop filter in a video codec. In VVC, the deblocking filtering process is applied to CU boundaries, transform subblock boundaries, and predictive subblock boundaries. Predictive subblock boundaries include prediction unit boundaries introduced by Subblock Based Temporal Motion Vector Prediction (SbTMVP) and affine modes. Transform subblock boundaries include transform unit boundaries introduced by Subblock Transform (SBT) and Intra Sub-Partitions (ISP) modes, and transforms due to the implicit partitioning of large CUs. The processing order of the deblocking filter is defined as first performing horizontal filtering on the vertical edges of the entire image, and then performing vertical filtering on the horizontal edges. This specific order allows multiple horizontal or vertical filtering processes to be applied in parallel threads. The filtering process can also be implemented on a CTB-by-CTB basis with only a small processing latency.
[0096] The vertical edges in the image are first filtered. Then, the horizontal edges in the image are filtered using samples modified by the vertical edge filtering process as input. Vertical and horizontal edges in the CTB of each CTU are processed separately on a codec unit basis. The vertical edges of the codec blocks in the codec unit are filtered, starting from the edge on the left-hand side of the codec block and proceeding geometrically through the edges towards the right-hand side of the codec block. The horizontal edges of the codec blocks in the codec unit are filtered, starting from the edge on the top of the codec block and proceeding geometrically through the edges towards the bottom of the codec block.
[0097] Figure 8 An example of a block boundary in an image is shown. For example, Figure 8 The image samples and horizontal and vertical block boundaries on an 8×8 grid are shown, as well as non-overlapping blocks of the 8×8 samples that can be de-blocked in parallel.
[0098] 3.6.1 Boundary Decision
[0099] The filter is applied to the 8x8 block boundaries. Additionally, such boundaries must be transform block boundaries or codec sub-block boundaries, such as those resulting from the use of Affine Motion Prediction (ATMVP). For other boundaries, deblocking filtering is disabled.
[0100] 3.6.2 Boundary Strength Calculation
[0101] For transform block boundaries / encoder / decoder sub-block boundaries, if the boundary is located in an 8x8 grid, the boundary can be filtered, and the settings of bS[xDi][yDj] (where [xDi][yDj] represents the coordinates) of the edge are defined as shown in Tables 2 and 3 respectively.
[0102] Table 2. Boundary Strength (when SPS Intra Block Copy (IBC) is disabled)
[0103]
[0104] Table 3. Boundary Strength (when SPS IBC is enabled)
[0105]
[0106] 3.6.3 Deblocking decision for the luminance component
[0107] Figure 9 An example involving the pixels used by the filter is shown. For example, Figure 9The image shows pixels involved in filter on / off decisions and strong / weak filter selection. A wider and stronger luminance filter is used only if conditions 1, 2, and 3 are all true. Condition 1 is the "bulk condition." This condition detects whether samples on the P-side and Q-side belong to a bulk, represented by the variables bSidePisLargeBlk and bSideQisLargeBlk, respectively. bSidePisLargeBlk and bSideQisLargeBlk are defined as follows.
[0108] bSidePisLargeBlk = ((Edge type is vertical and p0 belongs to CU with width >= 32) || (Edge type is horizontal and p0 belongs to CU with height >= 32)) ? TRUE : FALSE
[0109] bSideQisLargeBlk = ((Edge type is vertical and q0 belongs to CU with width >= 32) || (Edge type is horizontal and q0 belongs to CU with height >= 32)) ? TRUE : FALSE
[0110] Based on bSidePisLargeBlk and bSideQisLargeBlk, condition 1 is defined as follows:
[0111] Condition 1 = (bSidePisLargeBlk || bSidePisLargeBlk) ? TRUE : FALSE
[0112] Next, if condition 1 is true, condition 2 will be further examined. First, the following variables are derived:
[0113] First, derive dp0, dp3, dq0, and dq3 using the HEVC method.
[0114] if (p side is greater than or equal to 32)
[0115] dp0 = (dp0 + Abs(p50 - 2)) p40 + p30 + 1) >> 1
[0116] dp3 = (dp3 + Abs(p53 - 2)) p43 + p33 + 1) >> 1
[0117] if (q side is greater than or equal to 32)
[0118] dq0 = (dq0 + Abs(q50 - 2)) q40 + q30 + 1) >> 1
[0119] dq3 = (dq3 + Abs(q53 - 2)) q43 + q33 + 1) >> 1
[0120] Condition 2 = (d < β) ? TRUE : FALSE
[0121] Where d = dp0 + dq0 + dp3 + dq3.
[0122] If conditions 1 and 2 are valid, then further check whether any of the blocks uses a sub-block:
[0123] If (bSidePisLargeBlk)
[0124] {
[0125] If (block P's mode == SUBBLOCKMODE)
[0126] Sp = 5
[0127] else
[0128] Sp = 7
[0129] }
[0130] else
[0131] Sp = 3
[0132] If (bSideQisLargeBlk)
[0133] {
[0134] If (block Q's mode == SUBBLOCKMODE)
[0135] Sq = 5
[0136] else
[0137] Sq = 7
[0138] }
[0139] else
[0140] Sq = 3
[0141] Finally, if both conditions 1 and 2 are valid, the deblocking method will check condition 3 (the strong filter condition), which is defined as follows. In condition 3, StrongFilterCondition, the following variables are derived:
[0142] Derive dpq using the HEVC method.
[0143] Derive sp3 = Abs( p3 - p0 ) using the HEVC method
[0144] if (p side is greater than or equal to 32)
[0145] if (Sp == 5)
[0146] sp3 = ( sp3 + Abs( p5 - p3 ) + 1) >> 1
[0147] else
[0148] sp3 = ( sp3 + Abs( p7 - p3 ) + 1) >> 1
[0149] Derive sq3 = Abs( q0 - q3 ) using the HEVC method.
[0150] if (q side is greater than or equal to 32)
[0151] If (Sq == 5)
[0152] sq3 = ( sq3 + Abs( q5 - q3 ) + 1) >> 1
[0153] else
[0154] sq3 = ( sq3 + Abs( q7 - q3 ) + 1) >> 1
[0155] According to HEVC, StrongFilterCondition = (dpq < (β >> 2), sp3 + sq3 < (3)). β >> 5), and Abs(p0 - q0) is less than (5). tC + 1 ) >> 1) ? TRUE : FALSE.
[0156] 3.6.4 A more robust deblocking filter for luminance
[0157] When a sample on either side of the boundary belongs to a large block, a bilinear filter is used. A sample belonging to a large block is defined as one that is >= 32 for the vertical edge width and >= 32 for the horizontal edge height. The bilinear filter is listed below. Then, the 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 used for filtering the vertical edge, or the i-th sample in the column used for filtering the horizontal edge) are replaced by the following linear interpolation:
[0158]
[0159]
[0160] in and The item is the aforementioned position-related limit, and , , , and The following is given.
[0161] 3.6.5 Color Deblocking Decision
[0162] A strong chromaticity filter is used on both sides of the block boundary. Here, a chromaticity filter is selected when the chromaticity of both sides of the edge is greater than or equal to 8 (chromaticity position), and the following decision is satisfied with three conditions: The first is the decision for boundary strength and the size of the block. A chromaticity filter can be applied when the width or height of the block orthogonally passing through the block edge is equal to or greater than 8 in the chromaticity sample domain. The second and third are essentially the same as the decisions used for HEVC luminance deblocking, which are the on / off decision and the strong filter decision, respectively.
[0163] In the first decision, for chroma filtering, the boundary strength (bS) is modified, and conditions are checked sequentially. If a condition is met, the remaining conditions with lower priority are skipped. Chroma deblocking is performed when bS equals 2, or when bS equals 1 when a large block boundary is detected. The second and third conditions are essentially the same as the HEVC luma strong filter decision below.
[0164] In the second condition, d is then derived using the HEVC luminance deblocking method. The second condition will be true when d is less than β. In the third condition, StrongFilterCondition is derived as follows:
[0165] Derive dpq using the HEVC method;
[0166] Derive sp3 = Abs( p3 - p0 ) using the HEVC method; and
[0167] The derivation of sq3 = Abs( q0 - q3 ) follows the HEVC method.
[0168] According to the HEVC design, StrongFilterCondition = (dpq < (β >> 2), sp3 + sq3 < (β >> 3), and Abs(p0 - q0) < (5). tC + 1) >> 1)
[0169] 3.6.6 Strong Deblocking Filter for Chroma
[0170] The following strong deblocking filter is defined for chroma:
[0171] p2′= (3 p3+2 p2+p1+p0+q0+4) >> 3
[0172] p1′= (2 p3+p2+2 p1+p0+q0+q1+4) >> 3
[0173] p0′= (p3+p2+p1+2 p0+q0+q1+q2+4) >> 3
[0174] The example chroma filter performs deblocking on a 4x4 chroma sample grid.
[0175] 3.6.7 Location-related amplitude limiting
[0176] Position-dependent limiting (tcPD) is applied to the output samples of strong and long filters that involve modifying 7, 5, and 3 samples at the boundaries. By adjusting the quantization error distribution, the limiting value can be increased for samples expected to have higher quantization noise, thus anticipating a higher deviation between the reconstructed sample value and the true sample value.
[0177] For each P or Q boundary filtered by an asymmetric filter, the location-related threshold table is selected from two tables (e.g., Tc7 and Tc3 listed below) as edge information, based on the result of the decision process:
[0178] Tc7 = {6, 5, 4, 3, 2, 1, 1}; Tc3 = {6, 4, 2};
[0179] tcPD = (Sp == 3) ? Tc3 : Tc7;
[0180] tcQD = (Sq == 3) ? Tc3 : Tc7;
[0181] For P or Q boundaries filtered by a short symmetric filter, apply a lower-amplitude position correlation threshold:
[0182] Tc3 = { 3, 2, 1};
[0183] After defining the threshold, the filtered p'i sample values and q'i sample values are limited according to the tcP limiting value and the tcQ limiting value:
[0184] p''i = Clip3(p'i + tcPi, p'i – tcPi, p'i );
[0185] q''j = Clip3(q'j + tcQj, q'j – tcQ j, q'j );
[0186] Where p'i and q'i are the filtered sample values, p''i and q''j are the output sample values after clipping, and tcPi is the clipping threshold derived from the VVC tc parameters, tcPD, and tcQD. The function Clip3 is the clipping function as specified in VVC.
[0187] 3.6.8 Sub-block Removal and Adjustment
[0188] To enable parallel-friendly deblocking using both long filters and sub-block deblocking, the long filter is restricted to modifying a maximum of 5 samples on the side using sub-block deblocking (AFFINE, ATMVP, or Decoder-side Motion Vector Refinement (DMVR)), as shown in the long filter's brightness control. Extending this, sub-block deblocking is adjusted such that sub-block boundaries on the 8x8 mesh near the CU or implicit TU boundaries are restricted to modifying a maximum of two samples on each side.
[0189] The following applies to sub-block boundaries that are not aligned with the CU boundary.
[0190] If (block Q's mode == SUBBLOCKMODE && edge != 0) {
[0191] if (!(implicitTU && (edge == (64 / 4))))
[0192] if (edge == 2 || edge == (orthogonalLength - 2) || edge== (56 / 4) || edge == (72 / 4))
[0193] Sp = Sq = 2;
[0194] else
[0195] Sp = Sq = 3;
[0196] else
[0197] Sp = Sq = bSideQisLargeBlk ? 5:3
[0198] }
[0199] Where edge = 0 corresponds to the CU boundary, edge = 2 or orthogonalLength-2 corresponds to the sub-block boundary 8 samples away from the CU boundary, and so on. If implicit partitioning of TU is used, then implicitTU is true.
[0200] 3.7 Sample point adaptive compensation
[0201] Sample Adaptive Compensation (SAO) is applied to the reconstructed signal after the deblocking filter using compensation specified by the encoder for each CTB. The video encoder first decides whether to apply the SAO process to the current slice. If SAO is applied to a slice, each CTB is 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 compensation to pixels in each category. SAO operations include Edge Offset (EO) and Band Offset (BO), where EO uses edge attributes for pixel classification in SAO types 1 through 4, and BO 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 compensations. If sao_merge_left_flag equals 1, the current CTB will reuse the SAO type and compensation of the left CTB. If sao_merge_up_flag equals 1, the current CTB will reuse the SAO type and compensation of the CTB above.
[0202] Table 4. Specifications for SAO Types
[0203]
[0204] 3.8 Adaptive Loop Filter
[0205] Adaptive Loop Filtering (ALF) for video encoding and decoding minimizes the mean square error between the original and decoded samples using Wiener-based adaptive filters. ALF is located at the final processing stage of each picture and can be considered a tool for capturing and repairing artifacts from previous stages. Appropriate filter coefficients are determined by the encoder and explicitly transmitted to the decoder via the signal. To achieve better encoding and decoding efficiency, especially for high-resolution video, local adaptation is used for the luminance signal by applying different filters to different regions or blocks in the picture. In addition to filter adaptation, filter on / off control at the codec tree unit (CTU) level also contributes to improved encoding and decoding efficiency. Syntactically, filter coefficients are sent in a picture-level header called the adaptive parameter set, and the filter on / off flags of the CTUs are interleaved at the CTU level in the stripe data. This syntactic design not only supports picture-level optimization but also achieves low encoding latency.
[0206] 3.8.1 Signaling of Parameters
[0207] According to the ALF design in VTM, filter coefficients and clipping indices are carried in the ALF Adaptive Parameter Set (APS). The ALF APS can include up to eight chromaticity filters and a luma filter set with up to 25 filters. An index is also included for each of the 25 luma categories. Categories with the same index share the same filters. By merging different categories, the number of bits required to represent the filter coefficients is reduced. The absolute values of the filter coefficients are represented using 0th-order Exp-Golomb code followed by a sign bit for the non-zero coefficient. When clipping is enabled, a two-bit fixed-length code is also used to transmit the clipping index for each filter coefficient via signal transmission. The decoder can use up to eight ALF APSs simultaneously.
[0208] The filter control syntax elements for ALF in VTM include two types of information. First, the ALF on / off flag is signaled at the sequence, picture, strip, and CTB levels. Chroma ALF can only be enabled at the corresponding level if Luminance ALF is enabled at the picture and strip levels. Second, if ALF is enabled at the picture, strip, and CTB levels, filter usage information is signaled at that level. If all strips within a picture use the same APS, the referenced ALF APS ID is encoded / decoded at the strip or picture level. A luminance component can reference up to 7 ALF APSs, and a chroma component can reference 1 ALF APS. For luminance CTB, an index is signaled to indicate which ALF APS or offline-trained luminance filter set is used. For chroma CTB, the index indicates which filter in the referenced APS is used.
[0209] The data syntax elements of the ALF associated with the luminance component in VTM are listed below:
[0210]
[0211] `alf_luma_filter_signal_flag` equal to 1 specifies the set of luminance filters transmitted via signaling. `alf_luma_filter_signal_flag` equal to 0 specifies that no luminance filter set is transmitted via signaling. `alf_luma_clip_flag` equal to 0 specifies that linear adaptive loop filtering is applied to the luminance component. `alf_luma_clip_flag` equal to 1 specifies that nonlinear adaptive loop filtering can be applied to the luminance component. `alf_luma_num_filters_signalled_minus1` plus 1 specifies the number of adaptive loop filter classes for which luminance coefficients can be transmitted via signaling. The value of `alf_luma_num_filters_signalled_minus1` must be in the range of 0 to NumAlfFilters - 1 (inclusive). `alf_luma_coeff_delta_idx[filtIdx]` specifies the index of the adaptive loop filter luminance coefficient increment transmitted via signaling, which is the index of the filter class indicated by `filtIdx` in the range of 0 to NumAlfFilters - 1. When alf_luma_coeff_delta_idx[filtIdx] does not exist, it is presumed 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] must be within the range of 0 to alf_luma_num_filters_signalled_minus1 (inclusive).
[0212] `alf_luma_coeff_abs[ sfIdx ][ j ]` specifies the absolute value of the j-th coefficient of the luminance filter transmitted through the signal, indicated by `sfIdx`. When `alf_luma_coeff_abs[ sfIdx ][ j ]` does not exist, it is presumed to be equal to 0. The value of `alf_luma_coeff_abs[ sfIdx ][ j ]` must be in the range of 0 to 128 (inclusive). `alf_luma_coeff_sign[ sfIdx ][ j ]` specifies the sign of the j-th luminance coefficient of the filter indicated by `sfIdx`, as follows:
[0213] If alf_luma_coeff_sign[ sfIdx ][ j ] equals 0, then the corresponding luminance filter coefficient has a positive value.
[0214] Otherwise (alf_luma_coeff_sign[ sfIdx ][ j ] equals 1), the corresponding luminance filter coefficient has a negative value.
[0215] When alf_luma_coeff_sign[ sfIdx ][ j ] does not exist, it is presumed to be equal to 0.
[0216] `alf_luma_clip_idx[ sfIdx ][ j ]` specifies the limiting index of the limiting value to be used before multiplying by the j-th coefficient of the luminance filter transmitted through the signal, indicated by `sfIdx`. When `alf_luma_clip_idx[ sfIdx][ j ]` does not exist, it is presumed to be equal to 0. The codec tree unit syntax elements of the ALF associated with the luminance component in the VTM are listed below:
[0217]
[0218] `alf_ctb_flag[ cIdx ][ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY ]` equal to 1 indicates that the adaptive loop filter is applied to the codec tree block of the codec tree unit at the luma position (xCtb, yCtb), for the color component indicated by `cIdx`. `alf_ctb_flag[ cIdx ][ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY ]` equal to 0 indicates that the adaptive loop filter is not applied to the codec tree block of the codec tree unit at the luma position (xCtb, yCtb), for the color component indicated by `cIdx`.
[0219] When `alf_ctb_flag[ cIdx ][ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY]` does not exist, it is presumed 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 a filter set from the APS is applied to the luma CTB. When `alf_use_aps_flag` does not exist, it is presumed 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` must be in the range of 0 to `sh_num_alf_aps_ids_luma - 1` (inclusive). When `alf_luma_prev_filter_idx` does not exist, it is presumed to be equal to 0.
[0220] The variable AlfCtbFiltSetIdxY[ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY ], representing the filter set index of the luminance CTB at a specified location (xCtb, yCtb), is derived as follows:
[0221] If alf_use_aps_flag equals 0, AlfCtbFiltSetIdxY[ xCtb >> CtbLog2SizeY ][yCtb >> CtbLog2SizeY ] is set to equal alf_luma_fixed_filter_idx.
[0222] Otherwise, AlfCtbFiltSetIdxY[ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY] is set to equal to 16 + alf_luma_prev_filter_idx.
[0223] alf_luma_fixed_filter_idx specifies the fixed filter to be applied to the lumen CTB. The value of alf_luma_fixed_filter_idx must be in the range of 0 to 15 (inclusive).
[0224] Building upon the ALF design of VTM, the ALF design of ECM further introduces the concept of candidate filter sets into the luminance filter. The luminance filter can be trained with multiple candidates / rounds based on the updated luminance CTU ALF on / off decisions for each candidate / round. This results in multiple filter sets associated with each trained candidate, and the class merging results for each filter set can be different. Each CTU can select the optimal filter set via RDO, and the relevant candidate information is transmitted via signal transmission. The data syntax elements of the ALF associated with the luminance component in ECM are listed below:
[0225]
[0226] `alf_luma_num_alts_minus1` plus 1 specifies the number of candidate filter sets for the luminance component. The value of `alf_luma_num_alts_minus1` must 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 candidate luminance filter set with index `altIdx` for the luminance component. `alf_luma_clip_flag[altIdx]` equal to 1 specifies that nonlinear adaptive loop filtering can be applied to the candidate luminance filter set with index `altIdx` for the luminance component. `alf_luma_num_filters_signalled_minus1[altIdx]` plus 1 specifies the number of adaptive loop filter categories in the candidate luminance filter set with index `altIdx` for which the luminance coefficient can be transmitted via signal transmission. The value of alf_luma_num_filters_signalled_minus1[altIdx] must be in the range of 0 to NumAlfFilters - 1 (inclusive).
[0227] `alf_luma_coeff_delta_idx[altIdx][filtIdx]` specifies the index of the adaptive loop filter luminance coefficient increment transmitted via signal transmission. This index is the index of the filter class indicated by `filtIdx`, ranging from 0 to `NumAlfFilters – 1`. When `alf_luma_coeff_delta_idx[filtIdx][altIdx]` does not exist, it is presumed 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]` must 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 luminance filter transmitted through the signal, indicated by `sfIdx`, from the set of candidate luminance filters with index `altIdx`. When `alf_luma_coeff_abs[altIdx][sfIdx][j]` does not exist, it is presumed to be equal to 0. The value of `alf_luma_coeff_abs[altIdx][sfIdx][j]` must be in the range of 0 to 128 (inclusive).
[0228] `alf_luma_coeff_sign[altIdx][sfIdx][j]` specifies the sign of the j-th luminance coefficient of the filter indicated by `sfIdx` in the set of candidate luminance filters with index `altIdx`, as follows:
[0229] If alf_luma_coeff_sign[altIdx][sfIdx][j] equals 0, then the corresponding luminance filter coefficient has a positive value.
[0230] Otherwise (alf_luma_coeff_sign[altIdx][sfIdx][j] equals 1), the corresponding luminance filter coefficient has a negative value.
[0231] When alf_luma_coeff_sign[altIdx][sfIdx][j] does not exist, it is presumed to be equal to 0.
[0232] `alf_luma_clip_idx[altIdx][sfIdx][j]` specifies the limiting index to be used before multiplying the j-th coefficient of the luminance filter transmitted through the signal, indicated by `sfIdx`, in the set of candidate luminance filters with index `altIdx`. When `alf_luma_clip_idx[altIdx][sfIdx][j]` does not exist, it is presumed to be equal to 0. The codec tree unit syntax elements of the ALF associated with the luminance component in the ECM are listed below:
[0233]
[0234] `alf_ctb_luma_filter_alt_idx[ xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY ]` specifies the index of the candidate luma filter, which is applied to the luma component's codec tree block of the codec tree unit at the luma position (xCtb, yCtb). If `alf_ctb_luma_filter_alt_idx[xCtb >> CtbLog2SizeY ][ yCtb >> CtbLog2SizeY ]` does not exist, it is presumed to be zero.
[0235] 3.8.2 Filter Shape
[0236] Figure 10 An example of ALF filter shape is shown. In JEM, there are a maximum of three diamond filter shapes (such as...). Figure 10 (As shown) can be selected for the luma component. At the image level, the filter shape used for the luma component is indicated by a signal transmission index. Each square represents a sample, and Ci (i = 0~6 (left), 0~12 (middle), 0~20 (right)) represents the coefficient to be applied to the sample. For the chroma component in the image, a 5×5 rhombus shape is always used. In VVC, a 7×7 rhombus shape is always used for luma, while a 5×5 rhombus shape is always used for chroma.
[0237] 3.8.3 Classification of ALF
[0238] Each 2×2 (or 4×4) block is classified into one of 25 categories. The classification index C is based on its directionality. and activity The quantization value is derived as follows:
[0239]
[0240] In order to calculate and First, the gradients in the horizontal, vertical, and two diagonal directions are calculated using 1-D Laplacian:
[0241]
[0242] index and Referencing the coordinates of the top left sample point in the 2×2 block, and Indicator coordinates The reconstructed sample points are then used. Then, the gradients in the horizontal and vertical directions are... The maximum and minimum values are set as follows:
[0243]
[0244] Furthermore, the maximum and minimum values of the gradients in the two diagonal directions are set as follows:
[0245]
[0246] In order to derive directionality The values are compared with each other and with two thresholds. and Compare:
[0247] Step 1. If and If both are true, then Set as .
[0248] Step 2. If If yes, continue from step 3; otherwise, continue from step 4.
[0249] Step 3. If ,but Set as ;otherwise Set as .
[0250] Step 4. If ,but Set as ;otherwise Set as .
[0251] Activity value Calculated as:
[0252]
[0253] It is further quantized to the range of 0 to 4 (including boundary values), and the quantized value is represented as No classification method was applied to the two chromaticity components in the image; that is, a single set of ALF coefficients was applied to each chromaticity component.
[0254] 3.8.4 Geometric Transformation of Filter Coefficients
[0255] Before filtering each 2×2 block, geometric transformations such as rotation or diagonal and vertical flipping are applied to the filter coefficients associated with the coordinates (k, l), based on the gradient values calculated for that block. This is equivalent to applying these transformations to samples in the filter's support region. The idea is to make the different blocks more similar by aligning the directions of the different blocks to which the ALF is applied.
[0256] Three geometric transformations are introduced: diagonal, vertical flip, and rotation.
[0257]
[0258] in It is the size of the filter, and These are coefficient coordinates, which make the position... In the top left corner, and in position In the bottom right corner, the transformation is applied to the filter coefficients f(k, l) based on the gradient values calculated for this block. The relationship between the transformation in the four directions and the four gradients is summarized in Table 5.
[0259] Figure 11 An example of the transform coefficients of a relative coordinator supported by a 5×5 rhombus filter is shown. For example, Figure 11 The transformation coefficients for each position based on a 5×5 rhombus are shown.
[0260] Table 5. Mapping of gradients to transformations computed for a block
[0261]
[0262] 3.8.5 Filtering Process
[0263] On the decoder side, when ALF is enabled for a block, each sample within the block... The filtering results in sample values as shown below. Where L represents the filter length, Represents the filter coefficients, and This represents the decoded filter coefficients.
[0264]
[0265] Figure 12This example illustrates the relative coordinates used to support a 5×5 diamond filter, where the coordinates (i, j) of the current sample point are (0, 0). Sample points at different coordinates filled with the same color are multiplied by the same filter coefficient.
[0266] 3.8.6 Restating Nonlinear Filtering
[0267] Linear filtering can be reformulated as follows without affecting encoding / decoding efficiency:
[0268]
[0269] in They are the same filter coefficients.
[0270] VVC introduces nonlinearity by using a simple limiting function to measure the value at neighboring sample points ( Compared with the current sample value being filtered ( When the difference is too large, the influence of neighboring sample values is reduced, thus making ALF more efficient. More specifically, the ALF filter is modified as follows:
[0271]
[0272] in It is a limiting function, and It is the limiting parameter, which depends on Filter coefficients. The encoder performs optimization to find the optimal values. .
[0273] Limiting parameters For each ALF filter, it is specified that each filter coefficient has a limiting value transmitted via signaling. This means that a maximum of 12 limiting values and a maximum of 6 limiting values for each luminance filter can be transmitted via signaling in the bitstream. To limit signaling costs and encoder complexity, only 4 fixed values are used, identical for both INTER and INTRA stripes.
[0274] Because the variance of local differences in luminance is typically higher than that in chrominance, two distinct sets are applied for luminance and chrominance filters. A maximum sample value in each set (1024 for a 10-bit bit depth) is also introduced so that clipping can be disabled if unnecessary. The four values are chosen by dividing the full range of luminance sample values (encoded and decoded on 10 bits) into approximately equal parts in the logarithmic domain, and the range of chrominance from 4 to 1024. More precisely, the luminance table of clipping values has been obtained using the following formula:
[0275] AlfClip L Where M=210 And N=4
[0276] Similarly, the colorimetric table for the limiting values is obtained according to the following formula:
[0277] AlfClip C Where M=2 10 N=4 and A=4
[0278] 3.9 Bilateral Loop Filter
[0279] 3.9.1 Bilateral Image Filter
[0280] Bilateral image filtering is a nonlinear filter that smooths noise while preserving edge structure. Bilateral filtering is a technique where the filter weights decrease not only with increasing distance between samples but also with increasing intensity difference. This improves the smoothing of overly smoothed edges. The weights are defined as follows:
[0281]
[0282] in and It is the distance in the vertical and horizontal directions, and It is the intensity difference between sample points.
[0283] The edge-preserving denoising bilateral filter employs low-pass Gaussian filters for both the domain and range filters. The domain low-pass Gaussian filter assigns higher weights to pixels spatially closer to the center pixel. The range low-pass Gaussian filter assigns higher weights to pixels similar to the center pixel. Combining the range and domain filters, the bilateral filter at edge pixels becomes a thin Gaussian filter, oriented along the edge and significantly reduced in the gradient direction. This is why the bilateral filter can smooth noise while preserving edge structure.
[0284] 3.9.2 Bilateral Filters in Video Encoding and Decoding
[0285] Bilateral filters in video encoding and decoding are encoding and decoding tools used for VVC [2]. The filter acts as a loop filter in parallel with the Sample Adaptive Compensation (SAO) filter. Both the bilateral filter and the SAO act on the same input sample, each filter produces compensation, and these compensations are then added to the input sample to produce an output sample, which is then clipped before proceeding to the next stage. Spatial filtering intensity Determined by the block size, smaller blocks are filtered more strongly, and the intensity of the filter is equal to the strength. Determined by the quantization parameters, stronger filtering is used for higher QP. Only the four nearest samples are used, therefore the filtered sample intensity... It can be calculated as
[0286]
[0287] in Indicates the intensity of the central sample point. This indicates the intensity difference between the center sample point and the sample point above it. These represent the intensity differences between the central sample point and the sample points below, to the left, and to the right, respectively.
[0288] 4. Technical problems solved by the disclosed embodiments
[0289] The example design of the Adaptive Loop Filter (ALF) in video encoding and decoding has the following problems.
[0290] First, in the example ALF design, only the reconstructed samples and residual samples from before ALF are used in the classification process. However, there is other valuable input information that can potentially be utilized, such as the reconstructed samples from before DBF.
[0291] Second, in the example ALF design, only gradients are used to measure the texture intensity of the classifier units. However, there are other valuable measurements that could potentially be utilized, such as the difference of Gaussian (DoG).
[0292] 5. List of solutions and implementation examples
[0293] To address the shortcomings of the above-mentioned problems, a method outlined below is disclosed. The embodiments should be considered as examples for explaining general concepts and should not be interpreted in a narrow sense. Furthermore, these embodiments can be applied individually or in any combination.
[0294] It should be noted that the disclosed method can be used as a loop filter or post-processing.
[0295] In this disclosure, a video unit can refer to a sequence, picture, subpicture, strip, CTU, block, and / or region. A video unit may include one color component or multiple color components.
[0296] In this disclosure, an ALF processing unit can refer to a sequence, image, sub-image, stripe, CTU, block, region, or sample. An ALF processing unit can include one or more color components. Furthermore, side information can include encoding / decoding information other than the samples to be filtered by the current filter, and such side information can be used to determine the current filter's use of the samples to be filtered.
[0297] 1) In one example, ALF classifiers can refer to different shapes or sizes.
[0298] a. In one example, an ALF classification unit can refer to a sequence, image, sub-image, strip, CTU, block, region, or sample point.
[0299] b. In one example, an ALF classification unit can refer to a block with a different shape.
[0300] a) In one example, the ALF classification unit can be a square.
[0301] b) In one example, the ALF classification unit can be a diamond shape.
[0302] c) In one example, the ALF classification unit can be symmetrical in shape.
[0303] d) In one example, the ALF classification unit can be asymmetrical in shape.
[0304] e) In one example, the ALF classification unit can be any other shape.
[0305] c. In one example, an ALF classification unit can refer to a block with different sizes.
[0306] a) In one example, the ALF classification unit can be an M×N block.
[0307] b) In one example, M and N can be the same. (For example, M = N = 2).
[0308] c) In one example, M and N can be different. (For example, M = 4, N = 2).
[0309] 2) A method for ALF classification using different input sources was proposed.
[0310] a. In one example, the input source could be the reconstructed samples prior to ALF.
[0311] b. In one example, the input source can be the reconstructed samples prior to DBF.
[0312] c. In one example, the input source can be reconstructed samples prior to BF / SAO / Cross-Component SAO (CCSAO).
[0313] d. In one example, the input source can be residual samples.
[0314] e. In one example, the input source could be prediction samples.
[0315] f. In one example, the input source could be encoded or decoded information.
[0316] a) In one example, encoding / decoding information can refer to prediction mode information.
[0317] b) In one example, encoding / decoding information can refer to segmentation information.
[0318] c) Encoding / decoding information can be obtained from a block / cell containing samples (or sets of samples) to be classified in ALF.
[0319] d) Encoding and decoding information can depend on color components.
[0320] g. In one example, the input source can be any other type of sample / information.
[0321] 3) The use of one or more predefined filter outputs in ALF classification is proposed.
[0322] a. Predefined filters can be applied to the samples or sets of samples to be classified.
[0323] b. In one example, the input to a predefined filter can refer to different sources.
[0324] a) In one example, the input can be the reconstructed samples before ALF.
[0325] b) In one example, the input can be the reconstructed samples prior to DBF.
[0326] c) In one example, the input can be reconstructed samples prior to BF / SAO / CCSAO.
[0327] d) In one example, the input can be residual samples.
[0328] e) In one example, the input can be predicted samples.
[0329] f) In one example, the input can be other types of samples.
[0330] c. In one example, the predefined filter can refer to different types.
[0331] a) In one example, a predefined filter could refer to a Gaussian filter.
[0332] 1. In one example, non-linear limiting of the input can be enabled in Gaussian filtering.
[0333] 2. In one example, non-linear limiting of the input can be disabled in Gaussian filtering.
[0334] b) In one example, a predefined filter could refer to the Sobel filter.
[0335] c) In one example, a predefined filter could refer to the Canny filter.
[0336] d) In one example, a predefined filter could refer to a Laplace filter.
[0337] e) In one example, a predefined filter could refer to the Roberts cross filter.
[0338] f) In one example, a predefined filter could refer to a Prewitt filter.
[0339] g) In one example, a predefined filter can refer to a low-pass filter.
[0340] h) In one example, a predefined filter can refer to a high-pass filter.
[0341] i) In one example, a predefined filter can refer to a bilateral filter.
[0342] j) In one example, a predefined filter can refer to a fixed filter in ALF.
[0343] d. In one example, the output of one or more predefined filters can be used to classify online-trained filters for ALF.
[0344] e. In one example, the output of one or more predefined filters can be used for ALF-trained filter classification.
[0345] f. In one example, a predefined filter can be used for ALF classification.
[0346] a) In one example, the difference between the current sample and the filtered sample can be used to derive the class index.
[0347] b) In one example, filtered samples can be used to directly derive class indices.
[0348] g. In one example, more than one predefined filter can be used for ALF classification.
[0349] a) In one example, the difference between filtered samples generated by different predefined filters can be used to derive class indices.
[0350] 1. In one example, different predefined filters can refer to Gaussian filters with different intensities.
[0351] 2. In one example, different predefined filters can refer to Gaussian filters with different Laplace settings.
[0352] 3. In one example, the Difference of Gaussians (DoG) method can be used to derive class indices.
[0353] 4. In one example, the Laplacian of Gaussian (LoG) method can be used to derive class indexes.
[0354] 5. In one example, let the difference be D and the total number of classes be N. Then the class index can be derived using Clip3(0, N – 1, D / K), where K is the scaling factor.
[0355] b) In one example, filtered samples generated by different predefined filters can be used to directly derive class indices.
[0356] h. In one example, the class index of a classification unit can refer to different designs.
[0357] a) In one example, the cell class index can refer to the average of the sample class indices within the current cell, or be derived from the average of the sample class indices within the current cell.
[0358] b) In one example, the cell class index can refer to the maximum value of the sample class index within the current cell, or be derived from the maximum value of the sample class index within the current cell.
[0359] c) In one example, the cell class index can refer to the minimum value of the sample class index within the current cell, or be derived from the minimum value of the sample class index within the current cell.
[0360] d) In one example, the cell class index may refer to the median of the sample class indices within the current cell, or be derived from the median of the sample class indices within the current cell.
[0361] e) In one example, a cell class index may refer to the mapping result of one or more sample class indices within the current cell, or be derived from the mapping result of one or more sample class indices within the current cell.
[0362] i. In one example, the proposed method can be implemented as an additional classifier for ALF.
[0363] j. In one example, the proposed method can be implemented as a combination of existing classifiers for ALF.
[0364] 4) It is proposed to use the output of one or more predefined filters as side information in the encoding and decoding stages outside of ALF.
[0365] a. One or more predefined filters may be the same as ALF's predefined filters, or be variations of ALF's predefined filters.
[0366] b. In one example, the output of one or more predefined filters can be used in a bilateral filter.
[0367] a) In one example, the output of one or more predefined filters can be used in the classification of bilateral filters.
[0368] b) In one example, different output values can result in different filtering strengths for the bilateral filter.
[0369] c) In one example, the difference between different outputs can lead to different filtering strengths in the bilateral filter.
[0370] c. In one example, the output of one or more predefined filters can be used in a Hadamard Transform Domain Filtering (HTDF) filter.
[0371] a) In one example, the output of one or more predefined filters can be used in the classification of HTDF filters.
[0372] b) In one example, different output values can result in different filter strengths for the HTDF filter.
[0373] c) In one example, the difference between different outputs can lead to different filter strengths in the HTDF filter.
[0374] d. In one example, the output of one or more predefined filters can be used in SAO.
[0375] a) In one example, the output of one or more predefined filters can be used in the classification of SAO.
[0376] 1. In one example, the output of one or more predefined filters can be used as an additional classification pattern.
[0377] 2. In one example, the output of one or more predefined filters can be used as side information for an existing classification pattern.
[0378] b) In one example, the output of one or more predefined filters can be used to generate compensation for the SAO.
[0379] e. In one example, the output of one or more predefined filters can be used in CCSAO.
[0380] a) In one example, the output of one or more predefined filters can be used in CCSAO classification.
[0381] 1. In one example, the output of one or more predefined filters can be used as an additional classification pattern.
[0382] 2. In one example, the output of one or more predefined filters can be used as side information for an existing classification pattern.
[0383] b) In one example, the output of one or more predefined filters can be used to generate compensation for CCSAO.
[0384] f. In one example, the output of one or more predefined filters can be used in any other encoding / decoding tool / stage.
[0385] 5) In one example, whether / how the output of one or more predefined filters can be transmitted as a signal in the bitstream.
[0386] a. One or more predefined filters can be used in ALF.
[0387] b. One or more predefined filters may not be used in ALF.
[0388] a) One or more predefined filters may be the same as or a variant of the predefined filters of ALF.
[0389] c. In one example, the first syntax element can be signaled to indicate whether the output of one or more predefined filters is enabled / used.
[0390] a) In one example, the first syntax element can be encoded or decoded using arithmetic encoding / decoding.
[0391] 1. In one example, the first syntax element can be encoded or decoded using at least one context.
[0392] a. The context can depend on the encoding / decoding information of the current block or neighboring blocks.
[0393] b. The context may depend on the filter shape of at least one neighboring block.
[0394] 2. In one example, the first syntax element can be encoded and decoded using bypass encoding / decoding.
[0395] b) In one example, the first syntax element can be binary-coded using unary code, rounded unary code, fixed-length code, exponential Golomb code, rounded exponential Golomb code, etc.
[0396] c) In one example, the first syntax element can be conditionally transmitted via signal.
[0397] 1. For example, the first syntax element can only be transmitted via signaling if the output of one or more predefined filters is available.
[0398] d) The first syntax element can be encoded and decoded in a predictive manner.
[0399] 1. The first syntax element can be predicted by the on / off decision of the output of one or more predefined filters of at least one neighboring block.
[0400] e) For different color components, the first syntax element can be transmitted independently via signal.
[0401] 1. Alternatively, for different color components, the first syntax element can be transmitted and shared via signal transmission.
[0402] 2. Alternatively, the first syntax element may be transmitted via signal for the first color component but not for the second color component.
[0403] f) Syntax elements can be transmitted via signals in SPS / PPS / image header / strip header / APS / CTU / CU / etc.
[0404] 1. In one example, syntax elements can be transmitted via signals at the SPS / PPS level.
[0405] 2. In one example, syntax elements can be transmitted via signals at the CTU level.
[0406] 3. In one example, syntax elements can be transmitted via signals at the APS level.
[0407] a. In one example, the syntax element can transmit signals for all luminance / chrominance filters within all alternative filter sets.
[0408] b. In one example, a syntax element can transmit signals for all luminance / chrominance filters within an alternative filter set.
[0409] 6) In one example, the disclosed methods can be used in post-processing and / or pre-processing.
[0410] 7) In one example, the above methods can be used in combination.
[0411] 8) Alternatively, the above methods can be used alone.
[0412] 9) In one example, the proposed method for ALF classification using predefined filters can be applied to any loop filtering tool, preprocessing or postprocessing filtering method (including but not limited to ALF / CCALF / BF / SAO / CCSAO or any other filtering method) in video encoding and decoding.
[0413] a. In one example, the proposed method of using predefined filters can be applied to loop filtering methods.
[0414] a) In one example, the proposed method of using predefined filters can be applied to ALF.
[0415] b) In one example, the proposed method of using predefined filters can be applied to CCALF.
[0416] c) Alternatively, the proposed method of using predefined filters can be applied to other loop filtering methods.
[0417] b. In one example, the proposed method of using predefined filters can be applied to preprocessing filtering methods.
[0418] c. In one example, the proposed method of using predefined filters can be applied to post-processing filtering methods.
[0419] 10) In the above examples, a video unit can refer to a sequence / picture / subpicture / strip / piece / code-decode tree unit (CTU) / CTU line / CTU group / code-decode unit (CU) / prediction unit (PU) / transform unit (TU) / code-decode tree block (CTB) / code-decode block (CB) / prediction block (PB) / transform block (TB) / any other region containing more than one luminance or chrominance sample / pixel.
[0420] 11) Whether and / or how the methods disclosed above can be applied to transmit signals in a bitstream.
[0421] a. In one example, they can be transmitted via signaling at the sequence level / picture group level / picture level / strip level / piece group level, such as in the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / strip header / piece group header.
[0422] b. In one example, they can be transmitted via signal at PB / TB / CB / PU / TU / CU / VPDU / CTU / CTU lines / strips / pieces / sub-pictures / other types of areas containing more than one sample point or pixel.
[0423] 12) Whether and / or how the methods disclosed above are applied may depend on the encoded / decoded information, such as block size, color format, single / dual tree segmentation, color components, and stripe / picture type.
[0424] 13) The syntax elements disclosed above can be binary-coded as flags, fixed-length codes, EG(x) codes, unary codes, rounded unary codes, rounded binary codes, etc. They can be signed or unsigned.
[0425] 14) The syntax elements disclosed above can be encoded and decoded using at least one context model. Alternatively, the syntax elements disclosed above can be encoded and decoded using a bypass method.
[0426] 15) The syntax elements disclosed above can be transmitted via signals in a conditional manner.
[0427] a. SE is transmitted via signal only when the corresponding function is applicable.
[0428] b. SE is transmitted via signal only if the dimensions (width and / or height) of the block meet the requirements.
[0429] 16) The syntax elements disclosed above can be transmitted via signaling at the block level / sequence level / picture group level / picture level / strip level / piece group level, such as in the codec structure of CTU / CU / TU / PU / CTB / CB / TB / PB, or in the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / strip header / piece group header.
[0430] 17) The proposed methods can be combined with another codec tool such as affine / MTS / LFNST / MMVD / MIP / ISP / CCLM / CCCM / SMVD / BDOF / DMVR / HMVP / template matching / IBC / palette / etc.
[0431] 18) The proposed methods (multiple methods) can be excluded from other codec tools such as affine / MTS / LFNST / MMVD / MIP / ISP / CCLM / CCCM / SMVD / BDOF / DMVR / HMVP / template matching / IBC / palette / etc.
[0432] a. In one example, if the proposed method(s) are used, the excluded codec tools are implicitly disabled without signaling.
[0433] b. In one example, if the excluded codec tools are used, the proposed method(s) are implicitly disabled without signaling.
[0434] Figure 13 This is a block diagram illustrating an example video processing system 4000 in which various embodiments 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, such as 8 or 10-bit multi-component pixel values, or it may be 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, Passive Optical Network (PON), and wireless interfaces such as Wi-Fi or cellular interfaces.
[0435] System 4000 may include an encoding / decoding component 4004 capable of implementing the various encoding / decoding or coding methods described in this disclosure. Encoding / decoding component 4004 may reduce the average bit rate from the video input 4002 to the output of encoding / decoding component 4004 to produce an encoded / decoded representation of the video. Encoding / decoding techniques are therefore sometimes referred to as video compression or video transcoding techniques. The output of encoding / decoding component 4004 may be stored or transmitted via a communication connection, such as that represented by component 4006. The stored or communicatively transmitted bitstream (or encoded / decoded) representation of the video received at input 4002 may be used by component 4008 to generate pixel values or displayable video that is sent to display interface 4010. The process of generating user-visible video from the bitstream representation is sometimes referred to as video decompression. Furthermore, although some video processing operations are referred to as “encoding / decoding” operations or tools, it is understood that encoding / decoding tools or operations are used by the encoder, and the corresponding decoding tools or operations that inversely convert the encoding / decoding results will be performed by the decoder.
[0436] Examples of peripheral bus interfaces or display interfaces may include Universal Serial Bus (USB), High Definition Multimedia Interface (HDMI), or DisplayPort, etc. Examples of storage interfaces include Serial Advanced Technology Attachment (SATA), Peripheral Component Interconnect (PCI), Integrated Drive Electronic Devices (IDE), etc. The embodiments described in this disclosure can be embodied in a variety of electronic devices, such as mobile phones, laptops, smartphones, or other devices capable of performing digital data processing and / or video display.
[0437] Figure 14This is a block diagram of an example video processing apparatus 4100. Apparatus 4100 can be used to implement one or more methods described herein. Apparatus 4100 can be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, etc. Apparatus 4100 may include one or more processors 4102, one or more memories 4104, and video processing circuitry 4106. The processors(multiple) 4102 can be configured to implement one or more methods described herein. The memories(multiple) 4104 can be used to store data and code for implementing the methods and embodiments described herein. The video processing circuitry 4106 can be used to implement some embodiments described herein in hardware circuitry. In some embodiments, the video processing circuitry 4106 may be at least partially included in the processor 4102, such as a graphics coprocessor.
[0438] Figure 15 This is a flowchart of an example method 4200 for video processing. Method 4200 includes determining, in step 4202, an Adaptive Loop Filter (ALF) classification using one or more predefined filters. In step 4204, a conversion is performed between visual media data and a bitstream based on the ALF. According to the example, the conversion in step 4204 may include encoding at an encoder or decoding at a decoder.
[0439] It should be noted that method 4200 can be implemented in an apparatus for processing video data, including a processor and a non-transitory memory having instructions thereon, such as a video encoder 4400, a video decoder 4500, and / or an encoder 4600. In this case, the instructions, when executed by the processor, cause the processor to perform method 4200. Furthermore, method 4200 can be executed 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 the non-transitory computer-readable medium, causing the video codec device to perform method 4200 when executed by a processor.
[0440] Figure 16 This is a block diagram illustrating an example video encoding / decoding system 4300 that can utilize embodiments of the present disclosure. The video encoding / decoding system 4300 may include a source device 4310 and a destination device 4320. The source device 4310 generates encoded video data, and this source device 4310 may be referred to as a video encoding device. The destination device 4320 can decode the encoded video data generated by the source device 4310, and this destination device 4320 may be referred to as a video decoding device.
[0441] Source device 4310 may include video source 4312, video encoder 4314, and input / output (I / O) interface 4316. Video source 4312 may include sources such as video capture devices, interfaces for receiving video data from video content providers, and / or computer graphics systems for generating video data, or combinations of such sources. Video data may include one or more pictures. Video encoder 4314 encodes the video data from video source 4312 to generate a bitstream. The bitstream may include a sequence of bits forming a codec representation of the 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 transmitter. Encoded video data may be transmitted directly to destination device 4320 via network 4330 through I / O interface 4316. Encoded video data may also be stored on storage medium / server 4340 for access by destination device 4320.
[0442] The destination 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 acquire encoded video data from the source device 4310 or the 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 destination device 4320 or may be external to the destination device 4320, wherein the destination device 4320 may be configured to interface with an external display device.
[0443] The video encoder 4314 and the video decoder 4324 can operate according to video compression standards, such as the High Efficiency Video Codec (HEVC) standard, the Multi-Functional Video Codec (VVC) standard, and other existing and / or further standards.
[0444] Figure 17 This is a block diagram illustrating an example of a video encoder 4400, which can be... Figure 16 The system 4300 shown includes a video encoder 4314. The video encoder 4400 can be configured to perform any or all embodiments of this disclosure. The video encoder 4400 includes multiple functional components. The embodiments described in this disclosure can be shared among the various components of the video encoder 4400. In some examples, a processor can be configured to perform any or all embodiments described in this disclosure.
[0445] The functional components of the video encoder 4400 may include a segmentation unit 4401; a prediction unit 4402, which may include a mode selection unit 4403, a motion estimation unit 4404, a motion compensation unit 4405, and an intra-frame prediction unit 4406; a residual generation unit 4407; a transform processing unit 4408; a quantization unit 4409; an inverse quantization unit 4410; an inverse transform unit 4411; a reconstruction unit 4412; a buffer 4413; and an entropy coding unit 4414.
[0446] In other examples, the video encoder 4400 may include more, fewer, or different functional components. In one example, the prediction unit 4402 may include an intra-block copy (IBC) unit. The IBC unit can perform prediction in an IBC mode, where at least one reference picture is the picture in which the current video block is located.
[0447] Furthermore, some components such as the motion estimation unit 4404 and the motion compensation unit 4405 can be highly integrated, but for illustrative purposes, they are shown separately in the example of the video encoder 4400.
[0448] The segmentation unit 4401 can segment an image into one or more video blocks. The video encoder 4400 and the video decoder 4500 can support various video block sizes.
[0449] The mode selection unit 4403 can, for example, select one of several codec modes (intra-frame codec or inter-frame codec) based on error results, and provide the resulting intra-frame or inter-frame codec block to the residual generation unit 4407 to generate residual block data, and to the reconstruction unit 4412 to reconstruct the coded block for use as a reference image. In some examples, the mode selection unit 4403 can select a Combination of Intra and Inter Prediction (CIIP) mode, where prediction is based on inter-frame prediction signals and intra-frame prediction signals. In the case of inter-frame prediction, the mode selection unit 4403 can also select a resolution for the block based on the motion vector (e.g., sub-pixel precision or integer pixel precision).
[0450] To perform inter-frame prediction on the current video block, motion estimation unit 4404 can generate motion information for the current video block by comparing one or more reference frames from buffer 4413 with the current video block. Motion compensation unit 4405 can determine the predicted video block for the current video block based on the motion information and decoded samples of images from buffer 4413 other than the image associated with the current video block.
[0451] The motion estimation unit 4404 and the motion compensation unit 4405 can perform different operations on the current video block, for example, depending on whether the current video block is in an I-band, P-band, or B-band.
[0452] In some examples, motion estimation unit 4404 can perform unidirectional prediction on the current video block, and can search for reference images in list 0 or list 1 to find a reference video block for the current video block. Motion estimation unit 4404 can then generate a reference index indicating the reference image (which contains the reference video block) in list 0 or list 1 and a motion vector indicating the spatial displacement between the current video block and the reference video block. Motion estimation unit 4404 can output the reference index, prediction direction indicator, and motion vector as motion information for the current video block. Motion compensation unit 4405 can generate a predicted video block for the current block based on the reference video block indicated by the motion information of the current video block.
[0453] In other examples, motion estimation unit 4404 can perform bidirectional prediction on the current video block. Motion estimation unit 4404 can search for reference images in list 0 to find a reference video block for the current video block, and can also search for reference images in list 1 to find another reference video block for the current video block. Motion estimation unit 4404 can then generate reference indices indicating the reference images containing the reference video blocks in lists 0 and 1, and motion vectors indicating the spatial displacement between the reference video blocks and the current video block. Motion estimation unit 4404 can output the reference index and motion vector of the current video block as motion information for the current video block. Motion compensation unit 4405 can generate a predicted video block for the current video block based on the reference video blocks indicated by the motion information of the current video block.
[0454] In some examples, the motion estimation unit 4404 can output a complete set of motion information for use in the decoder's decoding process. In some examples, the motion estimation unit 4404 may not output a complete set of motion information for the current video. Instead, the motion estimation unit 4404 can reference the motion information of another video block to transmit the motion information of the current video block via a signal. For example, the motion estimation unit 4404 may determine that the motion information of the current video block is sufficiently similar to the motion information of neighboring video blocks.
[0455] In one example, the motion estimation unit 4404 may indicate a value to the video decoder 4500 in the syntax structure associated with the current video block, which indicates that the current video block has the same motion information as another video block.
[0456] In another example, motion estimation unit 4404 may identify another video block and a motion vector difference (MVD) in the 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. Video decoder 4500 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.
[0457] As discussed above, the video encoder 4400 can transmit motion vectors via signals in a predictive manner. Two examples of predictive signaling techniques that can be implemented by the video encoder 4400 include Advanced Motion Vector Prediction (AMVP) and Merge Pattern Signaling.
[0458] Intra-prediction unit 4406 can perform intra-prediction on the current video block. When intra-prediction unit 4406 performs intra-prediction on the current video block, it can generate prediction data for the current video block based on the decoded samples of other video blocks in the same frame. The prediction data for the current video block can include the predicted video block and various syntax elements.
[0459] The residual generation unit 4407 can generate residual data for the current video block by subtracting (or more) predicted video blocks from the current video block. The residual data for the current video block may include residual video blocks corresponding to different sample components of the samples in the current video block.
[0460] In other examples, such as in skip mode, there may be no residual data for the current video block, and the residual generation unit 4407 may not perform subtraction operations.
[0461] The transform processing unit 4408 can generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to the residual video blocks associated with the current video block.
[0462] After the transform processing unit 4408 generates a transform coefficient video block associated with the current video block, the quantization unit 4409 can 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.
[0463] The inverse quantization unit 4410 and the inverse transform unit 4411 can apply inverse quantization and inverse transform to the transform coefficient video block respectively to reconstruct the residual video block from the transform coefficient video block. The reconstruction unit 4412 can add the reconstructed residual video block to the corresponding sample points of one or more predicted video blocks generated by the prediction unit 4402 to produce a reconstructed video block associated with the current block for storage in the buffer 4413.
[0464] After the video block is reconstructed by reconstruction unit 4412, a loop filtering operation can be performed to reduce video block artifacts in the video block.
[0465] The entropy encoding unit 4414 can receive data from other functional components of the video encoder 4400. When the entropy encoding unit 4414 receives data, it can perform one or more entropy encoding operations to generate entropy-encoded data and output a bitstream including the entropy-encoded data.
[0466] Figure 18 This is a block diagram illustrating an example of a video decoder 4500, which can be... Figure 16 The system 4300 shown includes a video decoder 4324. The video decoder 4500 can be configured to perform any or all embodiments of this disclosure. In the example shown, the video decoder 4500 includes multiple functional components. The embodiments described in this disclosure can be shared among the various components of the video decoder 4500. In some examples, a processor can be configured to perform any or all embodiments described in this disclosure.
[0467] 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, a reconstruction unit 4506, and a buffer 4507. In some examples, the video decoder 4500 can perform a decoding process that is generally contrasted with the encoding process described with respect to the video encoder 4400.
[0468] The entropy decoding unit 4501 can retrieve the encoded bitstream. The encoded bitstream may include entropy-encoded video data (e.g., encoded blocks of video data). The entropy decoding unit 4501 can decode the entropy-encoded video data, and based on the entropy-decoded video data, the motion compensation unit 4502 can determine motion information including motion vectors, motion vector precision, reference image list index, and other motion information. The motion compensation unit 4502 can determine this information, for example, by executing AMVP and Merge modes.
[0469] The motion compensation unit 4502 can generate motion compensation blocks, possibly performing interpolation based on an interpolation filter. The identifier of the interpolation filter to be used, with sub-pixel accuracy, can be included in the syntax element.
[0470] The motion compensation unit 4502 can use the interpolation filter used by the video encoder 4400 during the encoding of a video block to calculate the interpolation for sub-integer pixels of the reference block. The motion compensation unit 4502 can determine the interpolation filter used by the video encoder 4400 based on the received syntax information, and the motion compensation unit 4502 can use the interpolation filter to generate a prediction block.
[0471] The motion compensation unit 4502 may use some syntax information to determine the size of the blocks used to encode (multiple) frames and / or (multiple) stripes of the encoded video sequence, segmentation information describing how each macroblock of the image of the encoded video sequence is segmented, a mode indicating how each segment is encoded, one or more reference frames (and a list of reference frames) for each inter-frame codec block, and other information for decoding the encoded video sequence.
[0472] Intra-prediction unit 4503 can use, for example, an intra-prediction mode received in the bitstream to form prediction blocks from spatially adjacent blocks. Inverse quantization unit 4504 inverse quantizes the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 4501. Inverse transform unit 4505 applies the inverse transform.
[0473] The reconstruction unit 4506 can add the residual block to the corresponding prediction block generated by the motion compensation unit 4502 or the intra-frame prediction unit 4503 to form a decoded block. If necessary, a deblocking filter can also be used to filter the decoded block to remove block artifacts. The decoded video block is then stored in a buffer 4507, which provides a reference block for subsequent motion compensation / intra-frame prediction and also generates decoded video for presentation on a display device.
[0474] Figure 19This is a schematic diagram of an example encoder 4600. Encoder 4600 is suitable for implementing VVC techniques. Encoder 4600 includes three loop filters: a deblocking filter (DF) 4602, a sample adaptive compensation (SAO) 4604, and an adaptive loop filter (ALF) 4606. Unlike DF 4602, which uses predefined filters, SAO 4604 and ALF 4606 utilize the original samples of the current image, respectively, by adding compensation and by applying a finite impulse response (FIR) filter, and by utilizing the encoded / decoded side information through signal transmission compensation and filter coefficients to reduce the mean square error between the original and reconstructed samples. ALF 4606 is located in the final processing stage of each image and can be considered as a tool for attempting to capture and repair artifacts caused by previous stages.
[0475] The encoder 4600 also includes an intra-frame prediction component 4608 and a motion estimation / compensation (ME / MC) component 4610 configured to receive input video. The intra-frame prediction component 4608 is configured to perform intra-frame prediction, while the ME / MC component 4610 is configured to perform inter-frame prediction using a reference image obtained from a reference image buffer 4612. Residual blocks from inter-frame or intra-frame prediction are fed into a transform (T) component 4614 and a quantization (Q) component 4616 to generate quantized residual transform coefficients, which are then fed into an entropy encoder / decoder component 4618. The entropy encoder / decoder component 4618 entropy-encodes and decodes the prediction results and quantized transform coefficients and transmits them toward a video decoder (not shown). The quantization 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. REC component 4624 is able to output images to DF 4602, SAO 4604 and ALF 4606 for filtering before these images are stored in reference image buffer 4612.
[0476] The following provides a list of preferred solutions as examples.
[0477] The following solutions illustrate examples of the embodiments discussed herein.
[0478] 1. A method for processing video data, comprising: determining adaptive loop filter (ALF) classification using one or more predefined filters; and performing a conversion between visual media data and a bitstream based on the ALF.
[0479] 2. The method according to Solution 1, wherein ALF classification includes classifying ALF into one or more ALF classification units, and wherein the ALF classification units include different shapes or different sizes.
[0480] 3. The method according to solution 1 or 2, wherein the ALF classification unit includes sequence, image, sub-image, strip, CTU, block, region, sample point, block with different shape, square, rhombus, symmetrical shape, asymmetrical shape, any other shape, block with different size, or block with size M×N, wherein M and N are the same or different.
[0481] 4. The method according to any one of solutions 1-3, wherein the input source is used for ALF classification.
[0482] 5. The method according to any one of solutions 1-4, wherein the input source is the reconstructed sample before the ALF, the reconstructed sample before the deblocking filter DBF, the bilateral filter BF, the sample adaptive compensation SAO, the cross-component sample adaptive compensation CCSAO, the residual sample, the predicted sample, the encoding / decoding information, the prediction mode information, the segmentation information, the information obtained from a block or cell containing the sample or set of sample to be classified in the ALF, the information depending on the color component, or any other type of sample or information.
[0483] 6. The method according to any one of solutions 1-5, wherein the output of the predefined filter is used for ALF classification.
[0484] 7. The method according to any one of solutions 1-6, wherein the predefined filter is applied to the sample points or sample set to be classified.
[0485] 8. The method according to any one of solutions 1-7, wherein the input of the predefined filter includes an input source, the input source including reconstructed samples before the ALF, reconstructed samples before the DBF, reconstructed samples before the BF, reconstructed samples before the SAO, reconstructed samples before the CCSAO, residual samples, prediction samples, or any other type of samples.
[0486] 9. The method according to any one of solutions 1-8, wherein the predefined filter includes a type, and wherein the type includes a Gaussian filter, a Sobel filter, a Canny filter, a Laplace filter, a Roberts cross filter, a Prewitt filter, a low-pass filter, a high-pass filter, a bilateral filter, or a fixed filter of an ALF, or wherein nonlinear limiting for the input is enabled or disabled in the Gaussian filter.
[0487] 10. The method according to any one of solutions 1-9, wherein the output of the one or more predefined filters is used for online-trained filter classification of the ALF or offline-trained filter classification of the ALF.
[0488] 11. The method according to any one of solutions 1-10, wherein the class index of the classification unit for the ALF classification is derived by the difference between the current sample and the filtered sample, the difference between filtered samples generated by different predefined filters, the difference of Gaussians (DoG), the Laplace of Gaussians (LoG), or the filtered samples generated by different predefined filters.
[0489] 12. The method according to any one of solutions 1-11, wherein the difference is D and the total number of classes is N, wherein the class index is derived by Clip3(0, N – 1, D / K), where K is a scaling factor.
[0490] 13. The method according to any one of solutions 1-12, wherein the different predefined filters include Gaussian filters with different intensities or Gaussian filters with different Laplace settings.
[0491] 14. The method according to any one of solutions 1-13, wherein the class index of the classification unit includes different designs, or wherein the unit class index is derived from the average value of the sample class index within the current unit, the maximum value of the sample class index within the current unit, the minimum value of the sample class index within the current unit, the median of the sample class index within the current unit, or a mapping result of one or more sample class indices within the current unit, or wherein the ALF classification using the predefined filter is part of an additional classifier for the ALF or a combination of classifiers for the ALF.
[0492] 15. The method according to any one of solutions 1-14, wherein the output of the predefined filter is used as side information in the encoding / decoding stage outside of the ALF.
[0493] 16. The method according to any one of solutions 1-15, wherein the predefined filter is the same as a predefined filter of ALF, or the predefined filter is a variant of a predefined filter of ALF, or the output of the predefined filter is used in a bilateral filter, or the output of the predefined filter is used in the classification of the bilateral filter, or different output values or differences between different outputs result in different filter strengths of the bilateral filter, or the output of the predefined filter is used in a Hadamard transform domain filter (HTDF), or the output of the predefined filter is used in the classification of the HTDF filter, or different output values or differences between different outputs result in different filter strengths of the HTDF. Different filter strengths of the F filter, or, wherein the output of the predefined filter is used in the SAO filter, or, wherein the output of the predefined filter is used as side information of an additional classification pattern or a classification pattern in the SAO filter, or, wherein the output of the predefined filter is used to generate compensation for the SAO filter, or, wherein the output of the predefined filter is used in the CCSAO filter, or, wherein the output of the predefined filter is used as side information of an additional classification pattern or a classification pattern in the CCSAO filter, or, wherein the output of the predefined filter is used to generate compensation for the CCSAO filter, or, wherein the output of the predefined filter is used in any other encoding / decoding tool or stage.
[0494] 17. The method according to any one of solutions 1-16, wherein the output of one or more predefined filters is transmitted as a signal in the bitstream, whether or how.
[0495] 18. The method according to any one of solutions 1-17, wherein one or more predefined filters are or are not used in the ALF, or wherein the predefined filter is the same as a predefined filter of the ALF, or wherein the predefined filter is a variant of a predefined filter of the ALF, or wherein a first syntax element is signaled to indicate whether the output of one or more predefined filters is enabled or used, or wherein the first syntax element is encoded / decoded using arithmetic encoding / decoding, or wherein the first syntax element is encoded / decoded using at least one context, or wherein the context depends on the encoding / decoding information of the current block or neighboring blocks, or wherein the context depends on the filter shape of at least one neighboring block, or wherein the first syntax element is encoded / decoded using bypass encoding / decoding, or wherein the first syntax element is encoded / decoded using unary code, rounded unary code, fixed-length code, exponential Golomb code, or rounded exponential Golomb code. The syntax element is binary encoded using Lombu code, or, wherein the first syntax element is conditionally transmitted via signaling, or, wherein the first syntax element is transmitted via signaling only when the output of one or more predefined filters is available, or, wherein the first syntax element is encoded / decoded in a predictive manner, or, wherein the first syntax element is predicted by on / off decisions of the output of predefined filters of at least one neighboring block, or, wherein the first syntax element is transmitted via signaling independently for different color components, or, wherein the first syntax element is transmitted via signaling and shared for different color components, or, wherein the first syntax element is transmitted via signaling for the first color component but not for the second color component, or, wherein the syntax element is transmitted via signaling in a sequence parameter set (SPS), a picture parameter set (PPS), a picture header, a strip header, an adaptive parameter set (APS), a codec tree unit (CTU), or a codec unit (CU).
[0496] 19. The method according to any one of solutions 1-18, wherein the method is used in post-processing or pre-processing.
[0497] 20. The method according to any one of solutions 1-19, wherein the methods are used in combination or individually.
[0498] 21. The method according to any one of solutions 1-20, wherein the ALF classification using the predefined filter is applied to any loop filtering tool, preprocessing or postprocessing filtering method in video encoding and decoding, including the ALF, CCALF, BF, SAO, CCSAO or any other filtering method, or wherein the mapping value of the prediction mode is applied to the loop filter, or wherein the mapping value of the prediction mode is applied to the ALF, CCALF, any other loop filter, preprocessing filter or postprocessing filter.
[0499] 22. The method according to any one of solutions 1-21, wherein the predefined filter for ALF classification is applied to a video unit, and wherein the video unit is a sequence, picture, sub-picture, strip, slice, CTU, CTU line, CTU group, CU, prediction unit PU, transform unit TU, codec tree block CTB, codec block CB, prediction block PB, transform block TB, or any other region containing more than one luminance or chrominance sample or pixel.
[0500] 23. The method according to any one of solutions 1-22, wherein the use of the method is transmitted via signal in the bit stream.
[0501] 24. The method according to any one of solutions 1-23, wherein the use of the method is transmitted via signal at the sequence level, picture group level, picture level, strip level, or slice group level, including in the sequence header, picture header, sequence parameter set SPS, video parameter set VPS, decoding parameter set DPS, decoding capability information DCI, picture parameter set PPS, adaptive parameter set APS, strip header, or slice group header, or wherein the use of the method is transmitted via signal at the prediction block PB, transform block TB, codec block CB, prediction unit PU, transform unit TU, codec unit CU, virtual pipeline decoding unit VPDU, codec tree unit CTU, CTU row, strip, slice, sub-picture, or other region containing more than one sample or pixel.
[0502] 25. The method according to any one of solutions 1-24, wherein the application of the method depends on encoded / decoded information, the encoded / decoded information including block size, color format, single-tree segmentation, dual-tree segmentation, color components, stripe type, or image type.
[0503] 26. The method according to any one of solutions 1-25, wherein the syntax element is: binary-coded as a flag, a fixed-length code, an exponential Golomb code, a unary code, a rounded unary code, or a rounded binary code, signed or unsigned, encoded or decoded using a context model, encoded or decoded by bypass, conditionally transmitted by signaling, transmitted by signaling only when the corresponding function is applied, transmitted by signaling when the height or width of the block satisfies a condition, or a combination thereof.
[0504] 27. The method according to any one of solutions 1-26, wherein syntax elements are transmitted via signals at the sequence level, picture group level, picture level, stripe level or slice group level, in the sequence header, picture header, SPS, VPS, DPS, decoding capability information DCI, PPS, APS, stripe header or slice group header.
[0505] 28. The method according to any one of solutions 1-27, wherein the method is used in combination with affine, multiple transform selection (MTS), LFNST, Merge MMVD with motion vector difference, matrix-based intra-prediction (MIP), ISP, cross-component linear model (CCLM), convolutional cross-component model (CCCM), symmetric motion vector difference (SMVD), bidirectional optical flow (BDOF), decoder-side motion vector refinement (DMVR), history-based motion vector prediction (HMVP), template matching, intra-block copying (IBC), or palette, or not in combination with affine, multiple transform selection (MTS), LFNST, Merge MMVD with motion vector difference, matrix-based intra-prediction (MIP), ISP, cross-component linear model (CCLM), convolutional cross-component model (CCCM), symmetric motion vector difference (SMVD), bidirectional optical flow (BDOF), decoder-side motion vector refinement (DMVR), history-based motion vector prediction (HMVP), template matching, intra-block copying (IBC), or palette.
[0506] 29. The method according to any one of solutions 1-28, wherein the excluded tool is implicitly disabled without signaling, or wherein the method is implicitly disabled without signaling when the excluded tool is used.
[0507] 30. The method according to any one of solutions 1-29, wherein the conversion includes encoding the visual media data into the bitstream.
[0508] 31. The method according to any one of solutions 1-29, wherein the conversion includes decoding the visual media data from the bitstream.
[0509] 32. An apparatus for processing video data, comprising a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method according to any one of solutions 1-31.
[0510] 33. 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 such that, when executed by a processor, the video codec device performs the method according to any one of solutions 1-31.
[0511] 34. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: determining adaptive loop filter (ALF) classification using one or more predefined filters; and generating the bitstream based on the determination.
[0512] 35. A method for storing a bitstream of video, comprising: determining adaptive loop filter (ALF) classification using one or more predefined filters; generating the bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.
[0513] 36. A method, apparatus or system described in this disclosure.
[0514] In the described solution, the encoder conforms to the format rules by generating a codec representation based on those rules. In the described solution, the decoder parses the syntax elements in the codec representation using known information about their presence or absence, based on the format rules, to produce the decoded video.
[0515] In this disclosure, the term "video processing" can refer to video encoding, video decoding, video compression, or video decompression. For example, a video compression algorithm can be applied during the conversion from a pixel representation of a video to a corresponding bitstream representation, and vice versa. For example, the bitstream representation of the current video block can correspond to bits at co-positions or propagated at different positions in the bitstream defined by the syntax. For example, a macroblock can be encoded based on the error residual value after transformation and encoding / decoding, and can also use bits from the header and other fields in the bitstream. Furthermore, during the conversion, the decoder can parse the bitstream based on this determination, knowing whether some fields may or may not be present, as described in the solutions above. Similarly, the encoder can determine whether to include or exclude specific syntax fields, and generate the codec representation accordingly by including or excluding syntax fields from the codec representation.
[0516] The disclosed and other solutions, examples, embodiments, modules, and functional operations described herein can be implemented in digital electronic circuits, or in computer software, firmware, or hardware, including the structures disclosed herein and their structural equivalents, or in combinations thereof. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more computer program instruction modules encoded on a computer-readable medium for execution by a data processing apparatus or for controlling the operation of the data processing apparatus. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a storage device, a composition of substances influencing machine-readable propagation signals, or combinations thereof. The term "data processing apparatus" includes all means, devices, and machines for processing data, including, for example, a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may also include code that creates an execution environment for the computer program in question, such as code constituting processor firmware, protocol stacks, database management systems, operating systems, or combinations thereof. Propagation signals are artificially generated signals, such as machine-generated electrical signals, optical signals, or electromagnetic signals, which are generated to encode information to be transmitted to a suitable receiver device.
[0517] Computer programs (also known as programs, software, software applications, scripts, or code) can be written in any programming language, including compiled or interpreted languages, and can be deployed in any form, including standalone programs or modules, components, subroutines, or other units suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can 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 co-located files (e.g., a file storing one or more modules, subroutines, or code portions). A computer program can be deployed to execute on one computer or on multiple computers located at a single site or distributed across multiple sites and interconnected by a communications network.
[0518] The processing and logic flows described in this disclosure can be executed by one or more programmable processors that execute one or more computer programs to perform functions by manipulating input data and generating outputs. The processing and logic flows can also be executed by special-purpose logic circuitry, and the apparatus can be implemented as special-purpose logic circuitry, such as field-programmable gate arrays (FPGAs) or application-specific integrated circuits (ASICs).
[0519] Processors suitable for executing computer programs include, for example, general-purpose and special-purpose microprocessors, and any one or more processors of any type of digital computer. Typically, a processor receives instructions and data from read-only memory or random access memory, or both. The basic components of a computer are a processor that executes instructions and one or more storage devices that store the 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 receive data from or transfer data to one or more mass storage devices via operative coupling, 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 storage devices, including, for example, semiconductor storage 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 hard disks; magneto-optical disks; and compact disc read-only memory (CD ROM) and digital versatile disc read-only memory (DVD-ROM). Processors and memory may be supplemented by or incorporated into dedicated logic circuitry.
[0520] While this disclosure contains numerous details, these details should not be construed as limiting any subject matter or the scope of the claims, but rather as descriptions of features specific to particular embodiments of this disclosure. Certain features described in the context of individual embodiments in this disclosure may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented separately in multiple embodiments, or in any suitable sub-combination. Furthermore, although features may function in certain combinations as described above, and even were originally claimed in this manner, in some cases one or more features in a claimed combination may be removed from that combination, and the claimed combination may be for sub-combinations or variations thereof.
[0521] Similarly, although operations are depicted in a specific order in the accompanying drawings, this should not be construed as requiring such operations to be performed sequentially in the particular order or sequence shown, or requiring all shown operations to be performed in order to achieve the desired result. Furthermore, the partitioning of various system components in the embodiments described in this disclosure should not be construed as requiring such partitioning in all embodiments.
[0522] Only a few implementations and examples are described, and other implementations, improvements and variations may be made based on what is described and shown in this disclosure.
[0523] When there is no intervening component other than a line, trace, or other medium between the first and second components, the first component is directly coupled to the second component. When there is an intervening component other than a line, trace, or other medium between the first and second components, the first component is indirectly coupled to the second component. The term "coupled" and its variations include direct coupling and indirect coupling. The use of the term "about" means including a range of ±10% of the following figures, unless otherwise specified.
[0524] While several embodiments have been provided in this disclosure, it should be understood that the disclosed systems and methods may be embodied in many other specific forms without departing from the spirit or scope of this disclosure. The present examples are to be considered illustrative rather than restrictive and are not intended to be limited to the details set forth herein. For example, various elements or components may be combined or integrated into another system, or certain features may be omitted or not implemented.
[0525] Furthermore, the technologies, systems, subsystems, and methods described and illustrated as discrete or separate in the various embodiments can be combined or integrated with other systems, modules, technologies, or methods without departing from the scope of this disclosure. Other items shown or discussed as couplings can be directly connected or indirectly coupled or communicated through some interface, device, or intermediate component, whether electrical, mechanical, or otherwise. Those skilled in the art can identify examples of other changes, substitutions, and modifications, which can be made without departing from the spirit and scope of this disclosure.
Claims
1. A method for processing video data, comprising: Determine whether to use one or more predefined filters for adaptive loop filter ALF classification; as well as The conversion between visual media data and bitstream is performed based on the ALF.
2. The method according to claim 1, wherein, ALF classification includes classifying ALF into one or more ALF classification units, wherein the ALF classification units include different shapes or different sizes.
3. The method according to claim 1 or 2, wherein, ALF classification units include sequences, images, sub-images, strips, codec tree units (CTUs), blocks, regions, samples, blocks with different shapes (square, rhombus, symmetrical, asymmetrical, any other shape), blocks with different sizes, or blocks of size M×N, where M and N are the same or different.
4. The method according to any one of claims 1-3, wherein, The ALF classification unit includes a square.
5. The method according to any one of claims 1-4, wherein, ALF classification units consist of blocks of size M×N, where M=N=2.
6. The method according to any one of claims 1-5, wherein, The input source was used for ALF classification.
7. The method according to any one of claims 1-6, wherein, The input source is the reconstructed samples prior to the ALF.
8. The method according to any one of claims 1-7, wherein, The input source is the reconstructed samples before the deblocking filter (DBF).
9. The method according to any one of claims 1-8, wherein, The input sources are reconstructed samples before the bilateral filter (BF), reconstructed samples before the sample adaptive compensation (SAO), reconstructed samples before the cross-component sample adaptive compensation (CCSAO), or predicted samples.
10. The method according to any one of claims 1-9, wherein, The input source is residual samples.
11. The method according to any one of claims 1-10, wherein, The input source is encoding and decoding information, which includes prediction mode information, segmentation information, or information obtained from blocks or cells containing samples or sets of samples to be classified in the ALF.
12. The method according to any one of claims 1-11, wherein, The encoding / decoding information includes information that depends on the color components, or any other type of sample or information.
13. The method according to any one of claims 1-12, wherein, The output of the predefined filter is used for ALF classification.
14. The method according to any one of claims 1-13, wherein, The predefined filter is applied to the sample points or set of sample points to be classified.
15. The method according to any one of claims 1-14, wherein, The input of the predefined filter includes an input source, which includes reconstructed samples before ALF, reconstructed samples before DBF, or residual samples.
16. The method according to any one of claims 1-15, wherein, The input to the predefined filter includes an input source, which may include reconstructed samples before BF, reconstructed samples before SAO, reconstructed samples before CCSAO, residual samples, prediction samples, or any other type of sample.
17. The method according to any one of claims 1-16, wherein, The predefined filter includes a type, and the type includes a Gaussian filter or a fixed filter of the ALF.
18. The method according to any one of claims 1-8, wherein, The predefined filters include types, and the types include Sobel filters, Canny filters, Laplace filters, Roberts cross filters, Prewitt filters, low-pass filters, high-pass filters, or bilateral filters.
19. The method according to any one of claims 1-18, wherein, Nonlinear limiting of the input is enabled or disabled in Gaussian filtering.
20. The method according to any one of claims 1-19, wherein, The outputs of one or more predefined filters are used for the online-trained filter classification of the ALF.
21. The method according to any one of claims 1-20, wherein, The outputs of one or more predefined filters are used for the offline-trained filter classification of the ALF.
22. The method according to any one of claims 1-21, wherein, The class index of the classification unit used for the ALF classification is derived from the difference between the current sample and the filtered sample, the difference between filtered samples generated by different predefined filters, the difference of Gaussians (DoG), the Laplace of Gaussians (LoG), or the filtered samples generated by different predefined filters.
23. The method according to any one of claims 1-22, wherein, The difference is D, and the total number of classes is N, where the class index is derived by Clip3(0, N – 1, D / K), where K is the scaling factor.
24. The method according to any one of claims 1-23, wherein, Different predefined filters include Gaussian filters with different intensities or Gaussian filters with different Laplace settings.
25. The method according to any one of claims 1-24, wherein, The class index of the classification unit includes different designs, or, wherein the unit class index is derived from the average of the sample class indices within the current unit or the median of the sample class indices within the current unit.
26. The method according to any one of claims 1-25, wherein, The cell class index is derived from the maximum value of the sample class index within the current cell, the minimum value of the sample class index within the current cell, or the mapping result of one or more sample class indices within the current cell.
27. The method according to any one of claims 1-26, wherein, Using the predefined filter for ALF classification is part of an additional classifier for the ALF or a combination of classifiers for the ALF.
28. The method according to any one of claims 1-27, wherein, The output of the predefined filter is used as side information in the encoding and decoding stages outside of the ALF.
29. The method according to any one of claims 1-28, wherein, The predefined filter is the same as the predefined filter of the ALF, or the predefined filter is a variant of the predefined filter of the ALF.
30. The method according to any one of claims 1-29, wherein, The output of the predefined filter is used in the bilateral filter, or... The output of the predefined filter is used in the classification of the bilateral filter, or... Different output values or differences between different outputs result in different filter strengths for the bilateral filter, or... The output of the predefined filter is used in a Hadamard transform domain filter (HTDF), or... The output of the predefined filter is used in the classification of the HTDF filter, or... Different output values or differences between different outputs result in different filter strengths for the HTDF filter, or... Wherein, the output of the predefined filter is used in the SAO filter, or, The output of the predefined filter is used as side information of the additional classification pattern or the classification pattern in the SAO filter, or... The output of the predefined filter is used to generate compensation for the SAO filter, or... The output of the predefined filter is used in the CCSAO filter, or... The output of the predefined filter is used as additional classification patterns or side information of the classification patterns in the CCSAO filter, or... The output of the predefined filter is used to generate compensation for the CCSAO filter, or... The output of the predefined filter is used in any other encoding / decoding tool or stage.
31. The method according to any one of claims 1-30, wherein, Whether or how to use the output of one or more predefined filters to transmit signals in the bitstream.
32. The method according to any one of claims 1-31, wherein, One or more predefined filters are used in the ALF.
33. The method according to any one of claims 1-32, wherein, One or more predefined filters are not used in ALF, or, The predefined filter is the same as the predefined filter of the ALF, or the predefined filter is a variant of the predefined filter of the ALF.
34. The method according to any one of claims 1-33, wherein, The first syntax element is transmitted via signaling to indicate whether the output of one or more predefined filters is enabled or used.
35. The method according to any one of claims 1-34, wherein, The first syntax element is encoded and decoded using arithmetic encoding / decoding, or... Wherein, the first syntax element utilizes at least one context for encoding and decoding, or... Wherein, the context depends on the encoding / decoding information of the current block or neighboring blocks, or, Wherein, the context depends on the filter shape of at least one neighboring block, or, Wherein, the first syntax element is encoded and decoded using bypass encoding / decoding, or... Wherein, the first syntax element is binary-coded using unary code, rounded unary code, fixed-length code, exponential Golomb code, or rounded exponential Golomb code, or... Wherein, the first syntax element is conditionally transmitted via signal, or, Specifically, the first syntax element is transmitted via signal only if the output of one or more predefined filters is available, or... Wherein, the first syntax element is encoded and decoded using a predictive method, or... Wherein, the first syntax element is predicted by the on / off decision of the output of a predefined filter from at least one neighboring block, or, In this context, the first syntax element is transmitted independently via signal for different color components, or... In this context, different color components are transmitted and shared via signal transmission through the first syntax element, or... Specifically, the first syntax element is transmitted via signal for the first color component but not for the second color component, or... The syntax elements are transmitted via signals in the sequence parameter set (SPS), picture parameter set (PPS), picture header, strip header, codec tree unit (CTU), or codec unit (CU).
36. The method according to any one of claims 1-35, wherein, Syntax elements are transmitted via signals in the Adaptive Parameter Set (APS).
37. The method according to any one of claims 1-36, wherein, The method is used in post-processing or pre-processing.
38. The method according to any one of claims 1-37, wherein, The methods may be used in combination or individually.
39. The method according to any one of claims 1-38, wherein, The use of the predefined filter for ALF classification is applied to loop filtering tools, preprocessing filtering methods, or postprocessing filtering methods in video encoding and decoding, wherein the filtering tools and methods include the ALF, CCALF, BF, SAO, or CCSAO, or wherein the method using the predefined filter is applied to a loop filter, or wherein the method using the predefined filter is applied to the ALF, the CCALF, any other loop filter, preprocessing filter, or postprocessing filter.
40. The method according to any one of claims 1-39, wherein, The predefined filter used for ALF classification is applied to video units, wherein the video unit is a sequence, picture, sub-picture, strip, slice, CTU, CTU line, CTU group, CU, prediction unit PU, transform unit TU, codec tree block CTB, codec block CB, prediction block PB, transform block TB, or any other region containing more than one luminance or chrominance sample or pixel.
41. The method according to any one of claims 1-40, wherein, The method is used in the bit stream via signal transmission.
42. The method according to any one of claims 1-41, wherein, The method is used at the sequence level, picture group level, picture level, strip level, or slice group level via signal transmission, including in the sequence header, picture header, sequence parameter set SPS, video parameter set VPS, decoding parameter set DPS, decoding capability information DCI, picture parameter set PPS, adaptive parameter set APS, strip header, or slice group header; or, the method is used at the prediction block PB, transform block TB, codec block CB, prediction unit PU, transform unit TU, codec unit CU, virtual pipeline decoding unit VPDU, codec tree unit CTU, CTU row, strip, slice, sub-picture, or other region containing more than one sample or pixel via signal transmission.
43. The method according to any one of claims 1-42, wherein, The application of the method depends on the encoded and decoded information, which includes block size, color format, single-tree segmentation, double-tree segmentation, color components, stripe type, or image type.
44. The method according to any one of claims 1-43, wherein, Syntax elements: binary converted to flags, fixed-length codes, exponential Golomb codes, unary codes, rounded unary codes, or rounded binary codes; signed or unsigned; encoded or decoded using a context model; encoded or decoded by bypass; conditionally transmitted via signaling; transmitted via signaling only when the corresponding function is applied; transmitted via signaling when the height or width of the block meets a condition; or a combination thereof.
45. The method according to any one of claims 1-44, wherein, Syntax elements are transmitted via signals at the sequence level, picture group level, picture level, stripe level, or slice group level, in the sequence header, picture header, SPS, VPS, DPS, decoding capability information DCI, PPS, APS, stripe header, or slice group header.
46. The method according to any one of claims 1-45, wherein, The method can be used in combination with or without affine, multiple transform selection (MTS), low-frequency inseparable transform (LFNST), merged MMVD with motion vector difference, matrix-based intra-prediction (MIP), intra-fragmentation (ISP), cross-component linear model (CCLM), convolutional cross-component model (CCCM), symmetric motion vector difference (SMVD), bidirectional optical flow (BDOF), decoder-side motion vector refinement (DMVR), history-based motion vector prediction (HMVP), template matching, intra-block copying (IBC), or a palette.
47. The method according to any one of claims 1-46, wherein, The excluded tool is implicitly disabled without signaling, or the method is implicitly disabled without signaling when the excluded tool is used.
48. The method according to any one of claims 1-47, wherein, The conversion includes encoding the visual media data into the bitstream.
49. The method according to any one of claims 1-47, wherein, The conversion includes decoding the visual media data from the bitstream.
50. An apparatus for processing video data, comprising a processor and a non-transitory memory having instructions thereon, wherein, When executed by the processor, the instructions cause the processor to perform the method according to any one of claims 1-49.
51. A non-transitory computer-readable medium comprising a computer program product for use by a video codec apparatus, the computer program product comprising computer-executable instructions stored on the non-transitory computer-readable medium such that, when executed by a processor, the video codec apparatus performs the method according to any one of claims 1-49.
52. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein, The method includes: Determine whether to use one or more predefined filters for adaptive loop filter ALF classification; and The bit stream is generated based on the determination.
53. A method for storing a bitstream of video, comprising: Determine whether to use one or more predefined filters for adaptive loop filter ALF classification; The bit stream is generated based on the determination; as well as The bit stream is stored in a non-transitory computer-readable recording medium.
