USING DIFFERENT SOURCES FOR HADAMARD DOMAIN FILTER IN VIDEO CODING

Abstract

A mechanism for processing video data is disclosed. The mechanism includes determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof. A conversion is performed between a visual media data and a bitstream based on the HDF.

Description

TECHNICAL FIELD

The present disclosure relates to generation, storage, and consumption of digital audio video media information in a file format.

BACKGROUND

Digital video accounts for the largest 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 usage is likely to continue to grow.

SUMMARY

A first aspect relates to a method for processing video data comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; and performing a conversion between a visual media data and a bitstream based on the HDF process.

A second aspect relates to a method for processing video data comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof to produce filtered samples; determining to apply an adaptive HDF process to combine the filtered samples with signaled parameters and/or online-trained parameters; and performing a conversion between a visual media data and a bitstream based on the HDF and adaptive HDF processes.

A third aspect relates to an apparatus for processing video data comprising: a processor; and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform any of the preceding aspects.

A fourth aspect relates to a non-transitory computer readable medium comprising a computer program product for use by a video coding device, the computer program product comprising computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the video coding device to perform the method of any of the preceding aspects.

A fifth aspect relates to a non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; and generating the bitstream based on the determining.

A sixth aspect relates to a method for storing bitstream of a video comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; generating the bitstream based on the determining; and storing the bitstream in a non-transitory computer-readable recording medium.

A seventh aspect relates to a method, apparatus or system described in the present disclosure.

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

These and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

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

FIG. 1 illustrates an example of nominal vertical and horizontal locations of 4:2:2 luma and chroma samples in a picture.

FIG. 2 illustrates an example encoder block diagram.

FIG. 3 illustrates an example picture partitioned into raster scan slices.

FIG. 4 illustrates an example picture partitioned into rectangular scan slices.

FIG. 5 illustrates an example picture partitioned into bricks.

FIGS. 6A, 6B, and 6C illustrate examples of coding tree blocks (CTBs) crossing picture borders.

FIG. 7 illustrates an example of intra prediction modes.

FIG. 8 illustrates an example of block boundaries in a picture.

FIG. 9 illustrates an example of pixels involved in filter usage.

FIG. 10 illustrates an example of filter shapes for adaptive loop filter (ALF).

FIG. 11 illustrates an example of transformed coefficients for 5×5 diamond filter support.

FIG. 12 illustrates an example of relative coordinates for 5×5 diamond filter support.

FIG. 13 illustrates an example scan pattern.

FIG. 14 is a block diagram showing an example video processing system.

FIG. 15 is a block diagram of an example video processing apparatus.

FIG. 16 is a flowchart for an example method of video processing.

FIG. 17 is a block diagram that illustrates an example video coding system.

FIG. 18 is a block diagram that illustrates an example encoder.

FIG. 19 is a block diagram that illustrates an example decoder.

FIG. 20 is a schematic diagram of an example encoder.

DETAILED DESCRIPTION

It should be understood at the outset that although an illustrative implementation of one or more embodiments are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or yet to be developed. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the exemplary designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents.

Section headings are used in the present disclosure for ease of understanding and do not limit the applicability of techniques and embodiments disclosed in each section only to that section. Furthermore, the embodiments described herein are applicable to other video codec protocols and designs.

1. Initial Discussion

This disclosure is related to video coding technologies. Specifically, it is related to in-loop filter and other coding tools in image/video coding. The ideas may be applied individually or in various combinations to video codecs, such as High Efficiency Video Coding (HEVC), Versatile Video Coding (VVC), or other video coding technologies.

2. Abbreviations

The present disclosure includes the following abbreviations. Advanced video coding (Rec. ITU-T H.264|ISO/IEC 14496-10) (AVC), coded picture buffer (CPB), clean random access (CRA), coding tree unit (CTU), coded video sequence (CVS), decoded picture buffer (DPB), decoding parameter set (DPS), general constraints information (GCI), high efficiency video coding, also known as Rec. ITU-T H.265|ISO/IEC 23008-2, (HEVC), International Organization for Standardization (ISO), International Electrotechnical Commission (IEC), Joint exploration model (JEM), motion constrained tile set (MCTS), network abstraction layer (NAL), output layer set (OLS), picture header (PH), picture parameter set (PPS), profile, tier, and level (PTL), picture unit (PU), reference picture resampling (RPR), raw byte sequence payload (RBSP), supplemental enhancement information (SEI), slice header (SH), sequence parameter set (SPS), video coding layer (VCL), video parameter set (VPS), versatile video coding, also known as Rec. ITU-T H.266|ISO/IEC 23090-3, (VVC), 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), bilateral filter (BF); and Hadamard Domain Filter (HDF).

3. Video Coding Standards

Video coding standards have evolved primarily through the development of the International Telecommunication Union-Telecommunication Standardization Sector (ITU-T) and ISO/IEC standards. The ITU-T produced H.261 and H.263, ISO/IEC produced Moving Picture Experts Group (MPEG)-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized. To explore the future video coding technologies beyond HEVC, the Joint Video Exploration Team (JVET) was founded by Video Coding Experts Group (VCEG) and MPEG jointly. Many methods have been adopted by JVET and put into the reference software named Joint Exploration Model (JEM). The JVET was renamed to be the Joint Video Experts Team (JVET) when the Versatile Video Coding (VVC) project officially started. VVC is a coding standard, targeting a 50% bitrate reduction as compared to HEVC. The VVC working draft and VVC test model (VTM) are continuously updated.

ITU-T VCEG and ISO/IEC MPEG joint technical committee (JTC) 1/subcommittee (SC) 29/working group (WG) 11 are studying the potential need for standardization of future video coding technology with a compression capability that significantly exceeds that of the current VVC standard. Such future standardization action could either take the form of additional extension(s) of VVC or an entirely new standard. The groups are working together on this exploration activity in a joint-collaboration effort known as JVET to evaluate compression technology designs proposed by their experts in this area. The first Exploration Experiments (EE) are established by JVET and reference software named Enhanced Compression Model (ECM) is in use. The test model ECM is updated continuously.

3.1 Color Space and Chroma Subsampling

Color space, also known as the color model (or color system), is a mathematical model which describes the range of colors as tuples of numbers, for example as 3 or 4 values or color components (e.g., RGB). Generally speaking, a color space is an elaboration of the coordinate system and sub-space. For video compression, the most frequently used color spaces are luma, blue difference chroma, and red difference chroma (YCbCr) and red, green, blue (RGB).

YCbCr, Y′CbCr, or Y Pb/Cb Pr/Cr, also written as YCBCR or Y′CBCR, is a family of color spaces used as a part of the color image pipeline in video and digital photography systems. Y′ is the luma component and CB and CR are the blue-difference and red-difference chroma components. Y′ (with prime) is distinguished from Y, which is luminance, meaning that light intensity is nonlinearly encoded based on gamma corrected RGB primaries.

Chroma subsampling is the practice of encoding images by implementing less resolution for chroma information than for luma information, taking advantage of the human visual system's lower acuity for color differences than for luminance.

3.1.1 4:4:4

In 4:4:4, each of the three Y′CbCr components have the same sample rate. Thus there is no chroma subsampling. This scheme is sometimes used in high-end film scanners and cinematic postproduction.

3.1.2 4:2:2

In 4:2:2, the two chroma components are sampled at half the sample rate of luma. The horizontal chroma resolution is halved while the vertical chroma resolution is unchanged. This reduces the bandwidth of an uncompressed video signal by one-third with little to no visual difference. An example of nominal vertical and horizontal locations of 4:2:2 color format is depicted in FIG. 1.

3.1.3 4:2:0

In 4:2:0, the horizontal sampling is doubled compared to 4:1:1, but as the Cb and Cr channels are only sampled on each alternate line in this scheme, the vertical resolution is halved. The data rate is thus the same. Cb and Cr are each subsampled at a factor of 2 both horizontally and vertically. There are three variants of 4:2:0 schemes, having different horizontal and vertical siting.

In MPEG-2, Cb and Cr are cosited horizontally. Cb and Cr are sited between pixels in the vertical direction (sited interstitially). In JPEG/JFIF, H.261, and MPEG-1, Cb and Cr are sited interstitially, halfway between alternate luma samples. In 4:2:0 DV, Cb and Cr are co-sited in the horizontal direction. In the vertical direction, they are co-sited on alternating lines.

TABLE 1
SubWidthC and SubHeightC values derived from chroma—
format_idc and separate_colour_plane_flag
chroma_format_idc	separate_colour_plane_flag	Chroma format	SubWidthC	SubHeightC
0	0	Monochrome	1	1
1	0	4:2:0	2	2
2	0	4:2:2	2	1
3	0	4:4:4	1	1
3	1	4:4:4	1	1

3.2 Example Coding Flow of a Video Codec

FIG. 2 shows an example of encoder block diagram of VVC, which contains three in-loop filtering blocks: deblocking filter (DF), sample adaptive offset (SAO) and ALF. Unlike DF, which uses predefined filters, SAO and ALF utilize the original samples of the current picture to reduce the mean square errors between the original samples and the reconstructed samples by adding an offset and by applying a finite impulse response (FIR) filter, respectively, with coded side information signaling the offsets and filter coefficients. ALF is located at the last processing stage of each picture and can be regarded as a tool trying to catch and fix artifacts created by the previous stages.

3.3 Definitions of Video/Coding Units

A picture is divided into one or more tile rows and one or more tile columns. A tile is a sequence of CTUs that covers a rectangular region of a picture. A tile may be divided into one or more bricks, each of which includes a number of CTU rows within the tile. A tile that is not partitioned into multiple bricks may also be referred to as a brick. However, a brick that is a true subset of a tile may not be referred to as a tile. A slice either contains several tiles of a picture or several bricks of a tile.

Two modes of slices are supported, namely the raster-scan slice mode and the rectangular slice mode. In the raster-scan slice mode, a slice contains a sequence of tiles in a tile raster scan of a picture. In the rectangular slice mode, a slice contains a number of bricks of a picture that collectively form a rectangular region of the picture. The bricks within a rectangular slice are in the order of brick raster scan of the slice. FIG. 3 shows an example of raster-scan slice partitioning of a picture (with 18 by 12 luma CTUs), where the picture is divided into 12 tiles and 3 raster-scan slices.

FIG. 4 shows an example of rectangular slice partitioning of a picture (with 18 by 12 luma CTUs), where the picture is divided into 24 tiles (6 tile columns and 4 tile rows) and 9 rectangular slices.

FIG. 5 shows an example of a picture partitioned into tiles, bricks, and rectangular slices, where the picture is divided into 4 tiles (2 tile columns and 2 tile rows), 11 bricks (the top-left tile contains 1 brick, the top-right tile contains 5 bricks, the bottom-left tile contains 2 bricks, and the bottom-right tile contain 3 bricks), and 4 rectangular slices.

3.3.1 CTU/CTB Sizes

In VVC, the CTU size, signaled in a sequence parameter set (SPS) by the syntax element log 2_ctu_size_minus2, could be as small as 4×4.

7.3.2.3 Sequence parameter set RBSP syntax
                                 Descriptor
seq_parameter_set_rbsp( ) {
sps_decoding_parameter_set_id    u(4)
sps_video_parameter_set_id       u(4)
sps_max_sub_layers_minus1        u(3)
sps_reserved_zero_5bits          u(5)
profile_tier_level( sps_max_sub_layers_minus1 )
gra_enabled_flag                 u(1)
sps_seq_parameter_set_id         ue(v)
chroma_format_idc                ue(v)
if( chroma_format_idc = = 3 )
separate_colour_plane_flag       u(1)
pic_width_in_luma_samples        ue(v)
pic_height_in_luma_samples       ue(v)
conformance_window_flag          u(1)
if( conformance_window_flag ) {
conf_win_left_offset             ue(v)
conf_win_right_offset            ue(v)
conf_win_top_offset              ue(v)
conf_win_bottom_offset           ue(v)
}
bit_depth_luma_minus8            ue(v)
bit_depth_chroma_minus8          ue(v)
log2_max_pic_order_cnt_lsb_minus4 ue(v)
sps_sub_layer_ordering_info_present_flag u(1)
for( i = ( sps_sub_layer_ordering_info_present_flag ? 0 : sps_max_sub_layers_minus1
);
i <= sps_max_sub_layers_minus1; i++ ) {
sps_max_dec_pic_buffering_minus1[ i ] ue(v)
sps_max_num_reorder_pics[ i ]    ue(v)
sps_max_latency_increase_plus1[ i ] ue(v)
}
long_term_ref_pics_flag          u(1)
sps_idr_rpl_present_flag         u(1)
rpl1_same_as_rpl0_flag           u(1)
for( i = 0; i < ! rpl1_same_as_rp10_flag ? 2 : 1; i++ ) {
num_ref_pic_lists_in_sps[ i ]    ue(v)
for( j = 0; j < num_ref_pic_lists_in_sps[ i ]; j++)
ref_pic_list_struct( i, j )
}
qtbtt_dual_tree_intra_flag       u(1)
log2_ctu_size_minus2             ue(v)
log2_min_luma_coding_block_size_minus2 ue(v)
partition_constraints_override_enabled_flag u(1)
sps_log2_diff_min_qt_min_cb_intra_slice_luma ue(v)
sps_log2_diff_min_qt_min_cb_inter_slice ue(v)
sps_max_mtt_hierarchy_depth_inter_slice ue(v)
sps_max_mtt_hierarchy_depth_intra_slice_luma ue(v)
if( sps_max_mtt_hierarchy_depth_intra_slice_luma != 0 ) {
sps_log2_diff_max_bt_min_qt_intra_slice_luma ue(v)
sps_log2_diff_max_tt_min_qt_intra_slice_luma ue(v)
}
if( sps_max_mtt_hierarchy_depth_inter_slices != 0 ) {
sps_log2_diff_max_bt_min_qt_inter_slice ue(v)
sps_log2_diff_max_tt_min_qt_inter_slice ue(v)
}
if( qtbtt_dual_tree_intra_flag ) {
sps_log2_diff_min_qt_min_cb_intra_slice_chroma ue(v)
sps_max_mtt_hierarchy_depth_intra_slice_chroma ue(v)
if ( sps_max_mtt_hierarchy_depth_intra_slice_chroma != 0 ) {
sps_log2_diff_max_bt_min_qt_intra_slice_chroma ue(v)
sps_log2_diff_max_tt_min_qt_intra_slice_chroma ue(v)
}
}
...
rbsp_trailing_bits( )
}

log 2_ctu_size_minus2 plus 2 specifies the luma coding tree block size of each CTU. log 2_min_luma_coding_block_size_minus2 plus 2 specifies the minimum luma coding block size. The variables CtbLog2SizeY, CtbSizeY, MinCbLog2SizeY, MinCbSizeY, MinTbLog2SizeY, MaxTbLog2SizeY, MinTbSizeY, MaxTbSizeY, PicWidthInCtbsY, PicHeightInCtbsY, PicSizeInCtbsY, PicWidthInMinCbsY, PicHeightInMinCbsY, PicSizeInMinCbsY, PicSizeInSamplesY, PicWidthInSamplesC and PicHeightInSamplesC are derived as follows:

$\begin{array}{cc}\mathrm{CtbLog}2\mathrm{SizeY}=\log 2\mathrm{\_ctu}\mathrm{\_size}\mathrm{\_minus}2+2& \left(7-9\right)\end{array}$ $\begin{array}{cc}\mathrm{CtbSizeY}=1\ll \mathrm{CtbLog}2\mathrm{SizeY}& \left(7-10\right)\end{array}$ $\begin{array}{cc}\mathrm{MinCbLog}2\mathrm{SizeY}=\mathrm{log2\_min}\mathrm{\_luma}\mathrm{\_coding}\mathrm{\_block}\mathrm{\_size}\mathrm{\_minus2}+2& \left(7-11\right)\end{array}$ $\begin{array}{cc}\mathrm{MinCbSizeY}=1\ll \mathrm{MinCbLog}2\mathrm{SizeY}& \left(7-12\right)\end{array}$ $\begin{array}{cc}\mathrm{MinTbLog}2\mathrm{SizeY}=2& \left(7-13\right)\end{array}$ $\begin{array}{cc}\mathrm{MaxTbLog}2\mathrm{SizeY}=6& \left(7-14\right)\end{array}$ $\begin{array}{cc}\mathrm{MinTbSizeY}=1\ll \mathrm{MinTbLog}2\mathrm{SizeY}& \left(7-15\right)\end{array}$ $\begin{array}{cc}\mathrm{MaxTbSizeY}=1\ll \mathrm{MaxTbLog}2\mathrm{SizeY}& \left(7-16\right)\end{array}$ $\begin{array}{cc}\mathrm{PicWidthInCtbsY}=\mathrm{Ceil}\left(\mathrm{pic\_width}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}÷\mathrm{CtbSizeY}\right)& \left(7-17\right)\end{array}$ $\begin{array}{cc}\mathrm{PicHeightInCtbsY}=\mathrm{Ceil}\left(\mathrm{pic\_height}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}÷\mathrm{CtbSizeY}\right)& \left(7-18\right)\end{array}$ $\begin{array}{cc}\mathrm{PicSizeInCtbsY}=\mathrm{PicWidthInCtbsY}*\mathrm{PicHeightInCtbsY}& \left(7-19\right)\end{array}$ $\begin{array}{cc}\mathrm{PicWidthInMinCbsY}=\mathrm{pic\_width}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}/\mathrm{MinCbSizeY}& \left(7-20\right)\end{array}$ $\begin{array}{cc}\mathrm{PicHeightInMinCbsY}=\mathrm{pic\_height}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}/\mathrm{MinCbSizeY}& \left(7-21\right)\end{array}$ $\begin{array}{cc}\mathrm{PicSizeInMinCbsY}=\mathrm{PicWidthInMinCbsY}*\mathrm{PicHeightInMinCbsY}& \left(7-22\right)\end{array}$ $\begin{array}{cc}\mathrm{PicSizeInSamplesY}=\mathrm{pic\_width}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}*\mathrm{pic\_height}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}& \left(7-23\right)\end{array}$ $\begin{array}{cc}\mathrm{PicWidthInSamplesC}=\mathrm{pic\_width}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}/\mathrm{SubWidthC}& \left(7-24\right)\end{array}$ $\begin{array}{cc}\mathrm{PicHeightInSamplesC}=\mathrm{pic\_height}\mathrm{\_in}\mathrm{\_luma}\mathrm{\_samples}/\mathrm{SubHeightC}& \left(7-25\right)\end{array}$

3.3.2 CTUs in One Picture

Suppose the CTB/LCU size indicated by M×N (typically M is equal to N), and for a CTB located at picture border (or tile or slice or other types of borders, picture border is taken as an example) border, K×L samples are within picture border wherein either K<M or L<N. For those CTBs as depicted in FIGS. 6A-6C, the CTB size is still equal to M×N. However, the bottom boundary of the CTB is outside the picture as shown in FIG. 6A, the right boundary of the CTB is outside the picture as shown in FIG. 6B, or the bottom boundary/right boundary of the CTB is outside the picture as shown in FIG. 6C.

3.4 Intra Prediction

To capture the arbitrary edge directions presented in natural video, the number of directional intra modes is extended from 33, as used in HEVC, to 65. The additional directional modes are depicted in FIG. 7, and the planar and DC modes remain the same. These denser directional intra prediction modes apply for all block sizes and for both luma and chroma intra predictions.

Angular intra prediction directions may be defined from 45 degrees to −135 degrees in clockwise direction as shown in FIG. 7. In VTM, several angular intra prediction modes are adaptively replaced with wide-angle intra prediction modes for the non-square blocks. The replaced modes are signaled and remapped to the indexes of wide angular modes after parsing. The total number of intra prediction modes is unchanged, e.g., 67, and the intra mode coding is unchanged.

In the HEVC, every intra-coded block has a square shape and the length of each of the block's sides is a power of 2. Thus, no division operations are required to generate an intra-predictor using DC mode. In VVC, blocks can have a rectangular shape that necessitates the use of a division operation per block in the general case. To avoid division operations for DC prediction, only the longer side is used to compute the average for non-square blocks.

3.5 Inter Prediction

For each inter-predicted CU, motion parameters include motion vectors, reference picture indices, reference picture list usage index, and additional information used for the new coding feature of VVC to be used for inter-predicted sample generation. The motion parameters can be signaled in an explicit or implicit manner. When a CU is coded with skip mode, the CU is associated with one PU and has no significant residual coefficients, no coded motion vector delta, and/or reference picture index. A merge mode is specified whereby the motion parameters for the current CU are obtained from neighboring CUs, including spatial and temporal candidates, and additional schedules introduced in VVC. The merge mode can be applied to any inter-predicted CU, not only for skip mode. The alternative to merge mode is the explicit transmission of motion parameters, where motion vector, corresponding reference picture index for each reference picture list, reference picture list usage flag, and other useful information are signaled explicitly per each CU.

3.6 Deblocking Filter

Deblocking filtering is an example in-loop filter in video codec. In VVC, the deblocking filtering process is applied on CU boundaries, transform subblock boundaries, and prediction subblock boundaries. The prediction subblock boundaries include the prediction unit boundaries introduced by the Subblock based Temporal Motion Vector prediction (SbTMVP) and affine modes. The transform subblock boundaries include the transform unit boundaries introduced by Subblock transform (SBT) and Intra Sub-Partitions (ISP) modes and transforms due to implicit split of large CUs. The processing order of the deblocking filter is defined as horizontal filtering for vertical edges for the entire picture first, followed by vertical filtering for horizontal edges. This specific order enables either multiple horizontal filtering or vertical filtering processes to be applied in parallel threads. Filtering processes can also be implemented on a CTB-by-CTB basis with only a small processing latency.

The vertical edges in a picture are filtered first. Then the horizontal edges in a picture are filtered with samples modified by the vertical edge filtering process as input. The vertical and horizontal edges in the CTBs of each CTU are processed separately on a coding unit basis. The vertical edges of the coding blocks in a coding unit are filtered starting with the edge on the left-hand side of the coding blocks proceeding through the edges towards the right-hand side of the coding blocks in their geometrical order. The horizontal edges of the coding blocks in a coding unit are filtered starting with the edge on the top of the coding blocks proceeding through the edges towards the bottom of the coding blocks in their geometrical order.

FIG. 8 is an illustration 800 of samples 802 within 8×8 blocks of samples 804. As shown, the illustration 800 includes horizontal and vertical block boundaries on an 8×8 grid 806, 808, respectively. In addition, the illustration 800 depicts the nonoverlapping blocks of the 8×8 samples 810, which can be deblocked in parallel.

3.6.1 Boundary Decision

Filtering is applied to 8×8 block boundaries. In addition, such boundaries must be a transform block boundary or a coding subblock boundary, for example due to usage of Affine motion prediction (ATMVP). For other boundaries, deblocking filtering is disabled.

3.6.2 Boundary Strength Calculation

For a transform block boundary/coding subblock boundary, if the boundary is located in the 8×8 grid, the boundary may be filtered and the setting of bS[xDi][yDj] (wherein [xDi][yDj] denotes the coordinate) for this edge as defined in Table 2 and Table 3, respectively.

TABLE 2
Boundary strength (when SPS IBC is disabled)
Priority	Conditions	Y	U	V
5	At least one of the adjacent blocks is intra	2	2	2
4	TU boundary and at least one of the adjacent blocks has non-zero	1	1	1
	transform coefficients
3	Reference pictures or number of MVs (1 for uni-prediction, 2 for bi-	1	N/A	N/A
	prediction) of the adjacent blocks are different
2	Absolute difference between the motion vectors of same reference	1	N/A	N/A
	picture that belong to the adjacent blocks is greater than or equal to one
	integer luma sample
1	Otherwise	0	0	0

TABLE 3
Boundary strength (when SPS IBC is enabled)
Priority	Conditions	Y	U	V
8	At least one of the adjacent blocks is intra	2	2	2
7	TU boundary and at least one of the adjacent blocks has non-zero	1	1	1
	transform coefficients
6	Prediction mode of adjacent blocks is different (e.g., one is IBC, one is	1
	inter)
5	Both IBC and absolute difference between the motion vectors that	1	N/A	N/A
	belong to the adjacent blocks is greater than or equal to one integer
	luma sample
4	Reference pictures or number of MVs (1 for uni-prediction, 2 for bi-	1	N/A	N/A
	prediction) of the adjacent blocks are different
3	Absolute difference between the motion vectors of same reference	1	N/A	N/A
	picture that belong to the adjacent blocks is greater than or equal to one
	integer luma sample
1	Otherwise	0	0	0

3.6.3 Deblocking Decision for Luma Component

FIG. 9 is an example of pixels involved in filter on/off decision and strong/weak filter selection. Wider-stronger luma filter is filters are used only if all the Condition1, Condition2 and Condition 3 are TRUE. The condition 1 is the “large block condition”. This condition detects whether the samples at P-side and Q-side belong to large blocks, which are represented by the variable bSidePisLargeBlk and bSideQisLargeBlk respectively. The bSidePisLargeBlk and bSideQisLargeBlk are defined as follows.

• • bSidePisLargeBlk=((edge type is vertical and p₀ belongs to CU with width>=32)∥(edge type is horizontal and p₀ belongs to CU with height>=32))? TRUE: FALSE
  • bSideQisLargeBlk=((edge type is vertical and q₀ belongs to CU with width>=32)∥(edge type is horizontal and q₀ belongs to CU with height>=32))? TRUE: FALSE

Based on bSidePisLargeBlk and bSideQisLargeBlk, the condition 1 is defined as follows:

• • Condition1=(bSidePisLargeBlk∥bSidePisLargeBlk)? TRUE: FALSE

Next, if Condition 1 is true, the condition 2 will be further checked. First, the following variables are derived:

$\mathrm{dp}0,\mathrm{dp}3,\mathrm{dq}0,\mathrm{dq}3\mathrm{are}\mathrm{first}\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}$ $\mathrm{if}\left(p\mathrm{side}\mathrm{is}\mathrm{greater}\mathrm{than}\mathrm{or}\mathrm{equal}\mathrm{to}32\right)$ $\mathrm{dp}0=\left(\mathrm{dp}0+\mathrm{Abs}\left(p50-2*p40+p30\right)+1\right)\gg 1$ $\mathrm{dp}3=\left(\mathrm{dp}3+\mathrm{Abs}\left(p53-2*p43+p33\right)+1\right)\gg 1$ $\mathrm{if}\left(q\mathrm{side}\mathrm{is}\mathrm{greater}\mathrm{than}\mathrm{or}\mathrm{equal}\mathrm{to}32\right)$ $\mathrm{dq}0=\left(\mathrm{dq}0+\mathrm{Abs}\left(q50-2*q40+q30\right)+1\right)\gg 1$ $\mathrm{dq}3=\left(\mathrm{dq}3+\mathrm{Abs}\left(q53-2*q43+q33\right)+1\right)\gg 1$ $\mathrm{Condition}2=\left(d<\beta \right)?\mathrm{TRUE}:\mathrm{FALSE}$ $\mathrm{where}d=\mathrm{dp}0+d\mathrm{q0}+\mathrm{dp}3+\mathrm{dq}3.$

If Condition1 and Condition2 are valid, whether any of the blocks uses sub-blocks is further checked:

If (bSidePisLargeBlk)
{
If (mode block P == SUBBLOCKMODE)
Sp =5
else
Sp =7
}
else
Sp = 3
If (bSideQisLargeBlk)
{
If (mode block Q == SUBBLOCKMODE)
Sq =5
else
Sq =7
}
else
Sq = 3

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

$\mathrm{dpq}\mathrm{is}\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}.$ $\mathrm{sp}3=\mathrm{Abs}\left(p3-\mathrm{p0}\right),\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}$ $\mathrm{if}\left(p\mathrm{side}\mathrm{is}\mathrm{greater}\mathrm{than}\mathrm{or}\mathrm{equal}\mathrm{to}32\right)$ $\mathrm{if}\left(\mathrm{Sp}==5\right)$ $\mathrm{sp}3=\left(\mathrm{sp}3+\mathrm{Abs}\left(p5-p3\right)+1\right)\gg 1$ $\mathrm{else}$ $\mathrm{sp}3=\left(\mathrm{sp}3+\mathrm{Abs}\left(p7-p3\right)+1\right)\gg 1$ $\mathrm{sq}3=\mathrm{Abs}\left(q0-q3\right),\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}$ $\mathrm{if}\left(q\mathrm{side}\mathrm{is}\mathrm{greater}\mathrm{than}\mathrm{or}\mathrm{equal}\mathrm{to}32\right)$ $\mathrm{if}\left(\mathrm{Sq}==5\right)$ $\mathrm{sq}3=\left(\mathrm{sq}3+\mathrm{Abs}\left(q5-q3\right)+1\right)\gg 1$ $\mathrm{else}$ $\mathrm{sq}3=\left(\mathrm{sq}3+\mathrm{Abs}\left(q7-q3\right)+1\right)\gg 1$

As in HEVC, StrongFilterCondition=(dpq is less than (β>>2), sp3+sq3 is less than (3*β>>5), and Abs (p0−q0) is less than (5*tC+1)>>1)? TRUE: FALSE.

3.6.4 Stronger Deblocking Filter for Luma

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

$p_i^{\prime }=\left(f_i*{\mathrm{Middle}}_{s,t}+\left(64-f_i\right)*P_s+32\right)\gg 6),\mathrm{clipped}\mathrm{to}{p}_i\pm tcP{D}_i$ $q_j^{\prime }=\left(g_j*{\mathrm{Middle}}_{s,t}+\left(64-g_j\right)*Q_s+32\right)\gg 6),\mathrm{clipped}\mathrm{to}{q}_j\pm tcP{D}_j$

where tcPD_i and tcPD_i term is a position dependent clipping described above and g_j, f_i, Middle_s,t, P_s and Q_s are given below:

3.6.5 Deblocking Decision for Chroma

The chroma strong filters are used on both sides of the block boundary. Here, the chroma filter is selected when both sides of the chroma edge are greater than or equal to 8 (chroma position), and the following decision with three conditions are satisfied: the first one is for decision of boundary strength as well as large block. The filter can be applied when the block width or height which orthogonally crosses the block edge is equal to or larger than 8 in chroma sample domain. The second and third one is basically the same as for HEVC luma deblocking decision, which are on/off decision and strong filter decision, respectively.

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

In the second condition d is then derived as in HEVC luma deblocking. The second condition will be TRUE when d is less than B. In the third condition StrongFilterCondition is derived as follows:

• • dpq is derived as in HEVC.

${\mathrm{sp}}_3=\mathrm{Abs}\left(p_3-p_0\right),\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}$ ${\mathrm{sq}}_3=\mathrm{Abs}\left(q_0-q_3\right),\mathrm{derived}\mathrm{as}\mathrm{in}\mathrm{HEVC}$

As in HEVC design, StrongFilterCondition=(dpq is less than (β>>2), sp3+sq3 is less than (β>>3), and Abs (p₀−q₀) is less than (5*tC+1)>>1)

3.6.6 Strong Deblocking Filter for Chroma

The following strong deblocking filter for chroma is defined:

$p{2}^{\prime }=\left(3*p3+2*p2+p1+p0+q0+4\right)\gg 3$ $p{1}^{\prime }=\left(2*p3+p2+2*p1+p0+q0+q1+4\right)\gg 3$ $p{0}^{\prime }=\left(p3+p2+p1+2*p0+q0+q1+q2+4\right)\gg 3$

An example chroma filter performs deblocking on a 4×4 chroma sample grid.

3.6.7 Position Dependent Clipping

The position dependent clipping tcPD is applied to the output samples of the luma filtering process involving strong and long filters that are modifying 7, 5 and 3 samples at the boundary. Assuming quantization error distribution, a clipping value may be increased for samples which are expected to have higher quantization noise, thus expected to have higher deviation of the reconstructed sample value from the true sample value.

For each P or Q boundary filtered with asymmetrical filter, depending on the result of decision-making process, position dependent threshold table is selected from two tables (e.g., Tc7 and Tc3 tabulated below) that are provided to decoder as a side information:

• • Tc7={6, 5, 4, 3, 2, 1, 1}; Tc3={6, 4, 2};
  • tcPD=(Sp==3)? Tc3:Tc7;
  • tcQD=(Sq==3)? Tc3:Tc7;

For the P or Q boundaries being filtered with a short symmetrical filter, position dependent threshold of lower magnitude is applied:

• • Tc3={3, 2, 1};

Following defining the threshold, filtered p′i and q′i sample values are clipped according to tcp and tcQ clipping values:

$p^{″}i=\mathrm{Clip}3\left(p^{\prime }i+\mathrm{tcPi},p^{\prime }i-\mathrm{tcPi},p^{\prime }i\right);$ $p^{″}j=\mathrm{Clip}3\left(q^{\prime }j+\mathrm{tcQj},q^{\prime }j-\mathrm{tcQj},q^{\prime }j\right);$

where p′i and q′i are filtered sample values, p″i and q″j are output sample value after the clipping and tcPi are clipping thresholds that are derived from the VVC tc parameter and tcPD and tcQD. The function Clip3 is a clipping function as it is specified in VVC.

3.6.8 Sub-Block Deblocking Adjustment

To enable parallel friendly deblocking using both long filters and sub-block deblocking the long filters is restricted to modify at most 5 samples on a side that uses sub-block deblocking (AFFINE or ATMVP or decoder side motion vector refinement (DMVR)) as shown in the luma control for long filters. Additionally, the sub-block deblocking is adjusted such that that sub-block boundaries on an 8×8 grid that are close to a CU or an implicit TU boundary is restricted to modify at most two samples on each side.

The following applies to sub-block boundaries that not are aligned with the CU boundary.

If (mode block Q == SUBBLOCKMODE && edge != 0) {
if (!(implicitTU && (edge == (64 / 4))))
if (edge == 2 || edge == (orthogonalLength − 2) ||
edge == (56 / 4) || edge == (72 / 4))
Sp = Sq = 2;
else
Sp = Sq = 3;
else
Sp = Sq = bSideQisLargeBlk ? 5:3
}

where edge equal to 0 corresponds to CU boundary, edge equal to 2 or equal to orthogonalLength−2 corresponds to sub-block boundary 8 samples from a CU boundary etc. Where implicit TU is true if implicit split of TU is used.

3.7 Sample Adaptive Offset

Sample adaptive offset (SAO) is applied to the reconstructed signal after the deblocking filter by using offsets specified for each CTB by the encoder. The video encoder first makes the decision on whether or not the SAO process is to be applied for current slice. If SAO is applied for the slice, each CTB is classified as one of five SAO types as shown in Table 4. The concept of SAO is to classify pixels into categories and reduces the distortion by adding an offset to pixels of each category. SAO operation includes edge offset (EO) which uses edge properties for pixel classification in SAO type 1 to 4 and band offset (BO) which uses pixel intensity for pixel classification in SAO type 5. Each applicable CTB has SAO parameters including sao_merge_left_flag, sao_merge_up_flag, SAO type and four offsets. If sao_merge_left_flag is equal to 1, the current CTB will reuse the SAO type and offsets of the CTB to the left. If sao_merge_up_flag is equal to 1, the current CTB will reuse SAO type and offsets of the CTB above.

TABLE 4
Specification of SAO type
SAO	sample adaptive offset type to	Number of
type	be used	categories
0	None	0
1	1-D 0-degree pattern edge offset	4
2	1-D 90-degree pattern edge offset	4
3	1-D 135-degree pattern edge offset	4
4	1-D 45-degree pattern edge offset	4
5	band offset	4

3.8 Adaptive Loop Filter

Adaptive loop filtering for video coding is to minimize the mean square error between original samples and decoded samples by using Wiener-based adaptive filter. The ALF is located at the last processing stage for each picture and can be regarded as a tool to catch and fix artifacts from previous stages. The suitable filter coefficients are determined by the encoder and explicitly signaled to the decoder. To achieve better coding efficiency, especially for high resolution videos, local adaptation is used for luma signals by applying different filters to different regions or blocks in a picture. In addition to filter adaptation, filter on/off control at coding tree unit (CTU) level is also helpful for improving coding efficiency. Syntax-wise, filter coefficients are sent in a picture level header called adaptation parameter set, and filter on/off flags of CTUs are interleaved at CTU level in the slice data. This syntax design not only supports picture level optimization but also achieves a low encoding latency.

3.8.1 Signaling of Parameters

According to ALF design in VTM, filter coefficients and clipping indices are carried in ALF adaptation parameter sets (APSs). An ALF APS can include up to 8 chroma filters and one luma filter set with up to 25 filters. An index is also included for each of the 25 luma classes. Classes having the same index share the same filter. By merging different classes, the num of bits required to represent the filter coefficients is reduced. The absolute value of a filter coefficient is represented using a 0th order exponential Golomb code followed by a sign bit for a non-zero coefficient. When clipping is enabled, a clipping index is also signaled for each filter coefficient using a two-bit fixed-length code. Up to 8 ALF APSs can be used by the decoder at the same time.

Filter control syntax elements of ALF in VTM include two types of information. First, ALF on/off flags are signaled at sequence, picture, slice and CTB levels. Chroma ALF can be enabled at picture and slice level only if luma ALF is enabled at the corresponding level. Second, filter usage information is signaled at picture, slice and CTB level, if ALF is enabled at that level. Referenced ALF APSs IDs are coded at a slice level or at a picture level if all the slices within the picture use the same APSs. Luma component can reference up to 7 ALF APSs and chroma components can reference 1 ALF APS. For a luma CTB, an index is signalled indicating which ALF APS or offline trained luma filter set is used. For a chroma CTB, the index indicates which filter in the referenced APS is used.

The data syntax elements of ALF associated to LUMA component in VTM are listed as follows:

                                 Descriptor
alf_data( ) {
alf_luma_filter_signal_flag      u(1)
if( alf_luma_filter_signal_flag ) {
alf_luma_clip_flag               u(1)
alf_luma_num_filters_signalled_minus1 ue(v)
if( alf_luma_num_filters_signalled_minus1 > 0 )
for( filtIdx = 0; filtIdx < NumAlfFilters; filtIdx++ )
alf_luma_coeff_delta_idx[ filtIdx ] u(v)
for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1; sfIdx++ )
for( j = 0; j < 12; j++ ) {
alf_luma_coeff_abs[ sfIdx ][ j ] ue(v)
if( alf_luma_coeff_abs[ sfIdx ][ j ] )
alf_luma_coeff_sign[ sfIdx ][ j ] u(1)
}
if( alf_luma_clip_flag )
for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1; sfIdx++ )
for( j = 0; j < 12; j++ )
alf_luma_clip_idx[ sfIdx ][ j ]  u(2)
}

alf_luma_filter_signal_flag equal to 1 specifies that a luma filter set is signalled. alf_luma_filter_signal_flag equal to 0 specifies that a luma filter set is not signalled. alf_luma_clip_flag equal to 0 specifies that linear adaptive loop filtering is applied to the luma component. alf_luma_clip_flag equal to 1 specifies that non-linear adaptive loop filtering could be applied to the luma component. alf_luma_num_filters_signalled_minus1 plus 1 specifies the number of adaptive loop filter classes for which luma coefficients can be signalled. The value of alf_luma_num_filters_signalled_minus1 shall be in the range of 0 to NumAlfFilters−1, inclusive. alf_luma_coeff_delta_idx[filtIdx] specifies the indices of the signalled adaptive loop filter luma coefficient deltas for the filter class indicated by filtIdx ranging from 0 to NumAlfFilters−1. When alf_luma_coeff_delta_idx[filtIdx] is not present, it is inferred to be equal to 0. The length of alf_luma_coeff_delta_idx[filtIdx] is Ceil (Log 2 (alf_luma_num_filters_signalled_minus1+1)) bits. The value of alf_luma_coeff_delta_idx[filtIdx] shall be in the range of 0 to alf_luma_num_filters_signalled_minus1, inclusive.

alf_luma_coeff_abs[sfIdx][j] specifies the absolute value of the j-th coefficient of the signalled luma filter indicated by sfIdx. When alf_luma_coeff_abs[sfIdx][j] is not present, it is inferred to be equal 0. The value of alf_luma_coeff_abs[sfIdx][j] shall be in the range of 0 to 128, inclusive. alf_luma_coeff_sign[sfIdx][j] specifies the sign of the j-th luma coefficient of the filter indicated by sfIdx as follows:

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

When alf_luma_coeff_sign[sfIdx][j] is not present, it is inferred to be equal to 0. alf_luma_clip_idx[sfIdx][j] specifies the clipping index of the clipping value to use before multiplying by the j-th coefficient of the signalled luma filter indicated by sfIdx. When alf_luma_clip_idx[sfIdx][j] is not present, it is inferred to be equal to 0. The coding tree unit syntax elements of ALF associated to LUMA component in VTM are listed as follows:

                                 Descriptor
coding_tree_unit( ) {
xCtb = CtbAddrX << CtbLog2SizeY
yCtb = CtbAddrY << CtbLog2SizeY
if( sh_alf_enabled_flag ){
alf_ctb_flag[ 0 ][ CtbAddrX ][ CtbAddrY ] ae(v)
if( alf_ctb_flag[ 0 ][ CtbAddrX ][ CtbAddrY ] ) {
if( sh_num_alf_aps_ids_luma > 0 )
alf_use_aps_flag                 ae(v)
if( alf_use_aps_flag ) {
if( sh_num_alf_aps_ids_luma > 1 )
alf_luma_prev_filter_idx         ae(v)
} else
alf_luma_fixed_filter_idx        ae(v)
}
}

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

When alf_ctb_flag[cIdx][xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is not present, it is inferred to be equal to 0. alf_use_aps_flag equal to 0 specifies that one of the fixed filter sets is applied to the luma CTB. alf_use_aps_flag equal to 1 specifies that a filter set from an APS is applied to the luma CTB. When alf_use_aps_flag is not present, it is inferred to be equal to 0. alf_luma_prev_filter_idx specifies the previous filter that is applied to the luma CTB. The value of alf_luma_prev_filter_idx shall be in a range of 0 to sh_num_alf_aps_ids_luma−1, inclusive. When alf_luma_prev_filter_idx is not present, it is inferred to be equal to 0.

The variable AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] specifying the filter set index for the luma CTB at location (xCtb, yCtb) is derived as follows:

• • If alf_use_aps_flag is equal to 0,
  • AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is set equal to alf_luma_fixed_filter_idx.
  • Otherwise, AlfCtbFiltSetIdxY[xCtb>>CtbLog2SizeY][yCtb>>CtbLog2SizeY] is set equal to 16+alf_luma_prev_filter_idx.

alf_luma_fixed_filter_idx specifies the fixed filter that is applied to the luma CTB. The value of alf_luma_fixed_filter_idx shall be in a range of 0 to 15, inclusive.

Based on the ALF design of VTM, the ALF design of ECM further introduces the concept of alternative filter sets into luma filters. The luma filters are be trained multiple alternatives/rounds based on the updated luma CTU ALF on/off decisions of each alternative/rounds. In such way, there will be multiple filter sets that associated to each training alternative and the class merging results of each filter set may be different. Each CTU could select the best filter set by RDO and the related alternative information will be signaled. The data syntax elements of ALF associated to LUMA component in ECM are listed as follows:

                                 Descriptor
alf_data( ) {
alf_luma_filter_signal_flag      u(1)
if( alf_luma_filter_signal_flag ) {
alf_luma_num_alts_minus1         ue(v)
for(altIdx = 0; altIdx < alf_luma_num_alts_minus1 +1; altIdx++){
alf_luma_clip_flag[altIdx]       u(1)
alf_luma_num_filters_signalled_minus1[altIdx] ue(v)
if(alf_luma_num_filters_signalled_minus1[altIdx] > 0){
for( filtIdx = 0; filtIdx < NumAlfFilters; filtIdx++ )
alf_luma_coeff_delta_idx[altIdx][filtIdx] u(v)
}
for(sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[altIdx];
sfIdx++){
for(j = 0; j < 19; j++){
alf_luma_coeff_abs[altIdx][ sfIdx ][ j ] ue(v)
if( alf_luma_coeff_abs[altIdx][ sfIdx ][ j ] )
alf_luma_coeff_sign[altIdx][ sfIdx ][ j ] u(1)
}
}
if( alf_luma_clip_flag [altIdx])
for( sfIdx = 0; sfIdx <= alf_luma_num_filters_signalled_minus1[altIdx];
sfIdx++ )
for( j = 0; j <19; j++ )
alf_luma_clip_idx[altIdx][ sfIdx ][ j ] u(2)
}
}

alf_luma_num_alts_minus1 plus 1 specifies the number of alternative filter sets for luma component. The value of alf_luma_num_alts_minus1 shall be in the range of 0 to 3, inclusive. alf_luma_clip_flag[altIdx] equal to 0 specifies that linear adaptive loop filtering is applied to the alternative luma filter set with index altIdxluma component. alf_luma_clip_flag[altIdx] equal to 1 specifies that non-linear adaptive loop filtering could be applied to the alternative luma filter set with index altIdx luma component. alf_luma_num_filters_signalled_minus1 [altIdx] plus 1 specifies the number of adaptive loop filter classes for which luma coefficients can be signalled of the alternative luma filter set with index altIdx. The value of alf_luma_num_filters_signalled_minus1 [altIdx] shall be in the range of 0 to NumAlfFilters−1, inclusive.

alf_luma_coeff_delta_idx[altIdx][filtIdx] specifies the indices of the signalled adaptive loop filter luma coefficient deltas for the filter class indicated by filtIdx ranging from 0 to NumAlfFilters−1 for the alternative luma filter set with index altIdx. When alf_luma_coeff_delta_idx[filtIdx][altIdx] is not present, it is inferred to be equal to 0. The length of alf_luma_coeff_delta_idx[altIdx][filtIdx] is Ceil (Log 2 (alf_luma_num_filters_signalled_minus1 [altIdx]+1)) bits. The value of alf_luma_coeff_delta_idx[altIdx][filtIdx] shall be in the range of 0 to alf_luma_num_filters_signalled_minus1 [altIdx], inclusive. alf_luma_coeff_abs[altIdx][sfIdx][j] specifies the absolute value of the j-th coefficient of the signalled luma filter indicated by sfIdx of the alternative luma filter set with index altIdx. When alf_luma_coeff_abs[altIdx][sfIdx][j] is not present, it is inferred to be equal 0. The value of alf_luma_coeff_abs[altIdx][sfIdx][j] shall be in the range of 0 to 128, inclusive.

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

• • If alf_luma_coeff_sign[altIdx][sfIdx][j] is equal to 0, the corresponding luma filter coefficient has a positive value.
  • Otherwise (alf_luma_coeff_sign[altIdx][sfIdx][j] is equal to 1), the corresponding luma filter coefficient has a negative value.When alf_luma_coeff_sign[altIdx][sfIdx][j] is not present, it is inferred to be equal to 0.

alf_luma_clip_idx[altIdx][sfIdx][j] specifies the clipping index of the clipping value to use before multiplying by the j-th coefficient of the signalled luma filter indicated by sfIdx of the alternative luma filter set with index altIdx. When alf_luma_clip_idx[altIdx][sfIdx][j] is not present, it is inferred to be equal to 0. The coding tree unit syntax elements of ALF associated to LUMA component in ECM are listed as follows:

                                 Descriptor
coding_tree_unit( ) {
xCtb = CtbAddrX << CtbLog2SizeY
yCtb = CtbAddrY << CtbLog2SizeY
if( sh_alf_enabled_flag ){
alf_ctb_flag[ 0 ][ CtbAddrX ][ CtbAddrY ] ae(v)
if( alf_ctb_flag[ 0 ][ CtbAddrX ][ CtbAddrY ] ) {
if( sh_num_alf_aps_ids_luma > 0 )
alf_use_aps_flag                 ae(v)
if( alf_use_aps_flag ) {
if( sh_num_alf_aps_ids_luma > 1 )
alt_ctb_luma_filter_alt_idx[CtbAddrX][CtbAddrY] ae(v)
alf_luma_prev_filter_idx         ae(v)
} else
alf_luma_fixed_filter_idx        ae(v)
}
}

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

3.8.2 Filter Shapes

In the JEM, up to three diamond filter shapes (as shown in FIG. 10) can be selected for the luma component. An index is signalled at the picture level to indicate the filter shape used for the luma component. Each square represents a sample, and Ci (i being 0˜6 (left), 0˜12 (middle), 0˜20 (right)) denotes the coefficient to be applied to the sample. For chroma components in a picture, the 5×5 diamond shape is always used. In VVC, the 7×7 diamond shape is always used for Luma while the 5×5 diamond shape is always used for Chroma.

3.8.3 Classification for ALF

Each 2×2 (or 4×4) block is categorized into one out of 25 classes. The classification index C is derived based on its directionality D and a quantized value of activity Â, as follows:

$C=5D+\hat{A}.$

To calculate D and Â, gradients of the horizontal, vertical and two diagonal direction are first calculated using 1-D Laplacian:

$g_v=\sum _{k=i-2}^{i+3}\sum _{l=j-2}^{j+3}{V}_{k,l},V_{k,l}=❘2R\left(k,l\right)-R\left(k,l-1\right)-R\left(k,l+1\right)❘,$ $g_h=\sum _{k=i-2}^{i+3}\sum _{l=j-2}^{j+3}{H}_{k,l},H_{k,l}=❘2R\left(k,l\right)-R\left(k-1,l\right)-R\left(k+1,l\right)❘,$ $g_{d1}=\sum _{k=i-2}^{i+3}\sum _{l=j-3}^{j+3}D{1}_{k,l},D{1}_{k,l}=❘2R\left(k,l\right)-R\left(k-1,l-1\right)-R\left(k+1,l+1\right)❘$ $g_{d2}=\sum _{k=i-2}^{i+3}\sum _{j=j-2}^{j+3}D{2}_{k,l},D{2}_{k,l}=❘2R\left(k,l\right)-R\left(k-1,l+1\right)-R\left(k+1,l-1\right)❘$

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

g _h,v ^max=max(g_h,g_v), g_h,v^min=min(g_h,g_v),

and the maximum and minimum values of the gradient of two diagonal directions are set as:

g _d0,d1 ^max=max(g_d0,g_d1), g_d0,d1^min=min(g_d0,g_d1),

To derive the value of the directionality D, these values are compared against each other and with two thresholds t₁ and t₂:

• • Step 1. If both g_h,v^max≤t₁·g_h,v^min and g_d0,d1^max≤t₁·g_d0,d1^min are true, D is set to 0.
  • Step 2. If g_h,v^max/g_h,v^min>g_d0,d1^max/g_d0,d1^min, continue from Step 3; otherwise continue from Step 4.
  • Step 3. If g_h,v^max>t₂·g_h,v^min, D is set to 2; otherwise D is set to 1.
  • Step 4. If g_d0,d1^max>t₂·g_d0,d1^min, D is set to 4; otherwise D is set to 3.

The activity value A is calculated as:

$A=\sum _{k=i-2}^{i+3}\sum _{l=j-2}^{j+3}\left(V_{k,l}+H_{k,l}\right).$

A is further quantized to the range of 0 to 4, inclusively, and the quantized value is denoted as Â. For both chroma components in a picture, no classification method is applied, i.e., a single set of ALF coefficients is applied for each chroma component.

3.8.4 Geometric Transformations of Filter Coefficients

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

Three geometric transformations, including diagonal, vertical flip and rotation are introduced:

$\mathrm{Diagonal}:f_D\left(k,l\right)=f\left(l,k\right),$ $\mathrm{Vertical}\mathrm{flip}:f_V\left(k,l\right)=f\left(k,K-l-1\right),$ $\mathrm{Rotation}:f_R\left(k,l\right)=f\left(K-l-1,k\right).$

where K is the size of the filter and 0≤k,l≤K−1 are coefficients coordinates, such that location (0,0) is at the upper left corner and location (K−1, K−1) is at the lower right corner. The transformations are applied to the filter coefficients f (k, l) depending on gradient values calculated for that block. The relationship between the transformation and the four gradients of the four directions are summarized in Table 5. FIG. 11 shows the transformed coefficients for each position based on the 5×5 diamond.

TABLE 5
Mapping of the gradient calculated for
one block and the transformations.
Gradient values       Transformation
gd2 < gd1 and gh < gv No transformation
gd2 < gd1 and gv < gh Diagonal
gd1 < gd2 and gh < gv Vertical flip
gd1 < gd2 and gv < gh Rotation

3.8.5 Filtering Process

At decoder side, when ALF is enabled for a block, each sample R(i, j) within the block is filtered, resulting in sample value R′(i, j) as shown below, where L denotes filter length, f_m,n represents filter coefficient, and f (k, l) denotes the decoded filter coefficients.

$R^{\prime }\left(i,j\right)=\sum _{k=-L/2}^{L/2}\sum _{l=-L/2}^{L/2}f\left(k,l\right)\times R\left(i+k,j+l\right)$

FIG. 12 shows an example of relative coordinates used for 5×5 diamond filter support supposing the current sample's coordinate (i, j) to be (0, 0). Samples in different coordinates filled with the same color are multiplied with the same filter coefficients.

3.8.6 Non-Linear Filtering Reformulation

Linear filtering can be reformulated, without coding efficiency impact, in the following expression:

$O\left(x,y\right)=I\left(x,y\right)+\sum _{\left(i,j\right)\ne \left(0,0\right)}w\left(i,j\right).\left(I\left(x+i,y+j\right)-I\left(x,y\right)\right)$

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

VVC introduces the non-linearity to make ALF more efficient by using a simple clipping function to reduce the impact of neighbor sample values (I(x+i, y+j)) when they are too different with the current sample value (I(x, y)) being filtered. More specifically, the ALF filter is modified as follows:

$O^{\prime }\left(x,y\right)=I\left(x,y\right)+\sum _{\left(i,j\right)\ne \left(0,0\right)}w\left(i,j\right).K\left(I\left(x+i,y+j\right)-I\left(x,y\right),k\left(i,j\right)\right)$

where K(d, b)=min (b, max (−b, d)) is the clipping function, and k(i, j) are clipping parameters, which depends on the (i, j) filter coefficient. The encoder performs the optimization to find the best k(i, j).

The clipping parameters k(i, j) are specified for each ALF filter, one clipping value is signaled per filter coefficient. It means that up to 12 clipping values can be signaled in the bitstream per Luma filter and up to 6 clipping values for the Chroma filter. In order to limit the signaling cost and the encoder complexity, only 4 fixed values which are the same for INTER and INTRA slices are used.

Because the variance of the local differences is often higher for Luma than for Chroma, two different sets for the Luma and Chroma filters are applied. The maximum sample value (here 1024 for 10-bit bit-depth) in each set is also introduced, so that clipping can be disabled if it is not necessary. The 4 values have been selected by roughly equally splitting, in the logarithmic domain, the full range of the sample values (coded on 10 bits) for Luma, and the range from 4 to 1024 for Chroma. More precisely, the Luma table of clipping values have been obtained by the following formula:

${\mathrm{AlfClip}}_L=\{\mathrm{round}\left({\left({\left(M\right)}^{\frac{1}{N}}\right)}^{N-n+1}\right)\mathrm{for}n\in 1\dots N]\},$ $\mathrm{with}M=2^{10}\mathrm{and}N=4$

Similarly, the Chroma tables of clipping values is obtained according to the following formula:

${\mathrm{AlfClip}}_C=\{\mathrm{round}\left(A.{\left({\left(\frac{M}{A}\right)}^{\frac{1}{N-1}}\right)}^{N-n}\right)\mathrm{for}n\in 1\dots N]\},$ $\mathrm{with}M=2^{10},N=4\mathrm{and}A=4$

3.9 Hadamard Transform Domain Filter in Video Coding

The Hadamard transform domain filter (HDF) is as a coding tool that may be used for VVC. The HDF is applied to luma blocks after inverse transform and reconstruction. The filtered result is used both for output as well as for spatial and temporal prediction.

The Hadamard domain in-loop filter is always applied to luma reconstructed blocks with non-zero transform coefficients, excluding 4×4 blocks and is also applied if the slice quantization parameter (QP) is larger than 17. The filter parameters are explicitly derived from the coded information. If applied, the HDF is performed on the decoded samples right after inverse transform.

For each pixel resulting from a reconstructed block pixel, the associated processing comprises the following steps: First, scan 4 neighboring pixels around a processing pixel including the current processing pixel according to a scan pattern. Second, perform a 4-point Hadamard transform of read pixels. Third, perform spectrum filtering based on the following formula:

$F\left(i,\sigma \right)=\frac{{R\left(i\right)}^2}{{R\left(i\right)}^2+{\sigma }^2}*R\left(i\right)$

where (i) is index of spectrum component in Hadamard spectrum, R(i) is spectrum component of reconstructed pixels corresponding to the index, and σ is a filtering parameter deriving from codec quantization parameter QP using following equation:

$\sigma =2^{\left(1+0.126*\left(QP-27\right)\right)}$

It can be noted that filtering implies multiplication of spectrum component R(i) on a scaling coefficient, which is always less than 1. It can also be observed that at high values of R(i), the scaling coefficient is close to 1. Based on these observations, spectrum filtering is implemented using a lookup table, which allows for exclusion of multiplication and division from filtering operations:

The THR is set to 128, which requires storage 128 of int32 entries in ROM per QP. An inverse 4-point Hadamard transform is also applied to a filtered spectrum. After filtering the step, the filtered pixels are

$F\left(i,\sigma \right)=\{\begin{array}{c}R\left(i\right),\mathrm{Abs}\left(R\left(i\right)\right)>\mathrm{THR}\\ \mathrm{LUT}\left(R\left(i\right),\sigma \right),R\left(i\right)>0\\ -\mathrm{LUT}\left(R\left(i\right),\sigma \right),R\left(i\right)\le 0\end{array}\mathrm{LUT}\left(R\left(i\right),\sigma \right)=\frac{{R\left(i\right)}^3}{{R\left(i\right)}^2+{\sigma }^2}$

placed to their original positions into an accumulation buffer. After completing filtering of all pixels in the CU the accumulated values are normalized by a number of processing groups used for each pixel filtering. The normalization is implemented as an add-and-shift method excluding divisions and multiplications. The example of scan pattern is depicted FIG. 13, in which A is a current pixel and B, C, and D are surrounding pixels.

For pixels positioned on a CU boundary the scan pattern is adjusted to ensuring all required pixels are within a current CU.

3.10 Bilateral In-Loop Filter

3.10.1 Bilateral Image Filter

Bilateral image filter is a nonlinear filter that smooths the noise while preserving edge structures. The bilateral filtering is a technique to make the filter weights decrease not only with the distance between the samples but also with increasing difference in intensity. This way, over-smoothing of edges can be ameliorated. A weight is defined as:

$w\left(\Delta x,\Delta y,\Delta I\right)=e^{-\frac{\Delta x^2+\Delta y^2}{2{\sigma }_d^2}-\frac{\Delta I^2}{2{\sigma }_r^2}}$

where Δx and Δy are distances in the horizontal and vertical directions, respectively, and ΔI is the difference in intensity between the samples.

The edge-preserving de-noising bilateral filter adopts a low-pass Gaussian filter for both the domain filter and the range filter. The domain low-pass Gaussian filter gives higher weight to pixels that are spatially close to the center pixel. The range low-pass Gaussian filter gives higher weight to pixels that are similar to the center pixel. Combining the range filter and the domain filter, a bilateral filter at an edge pixel becomes an elongated Gaussian filter that is oriented along the edge and is greatly reduced in gradient direction. This is the reason why the bilateral filter can smooth the noise while preserving edge structures.

3.10.2 Bilateral Filter in Video Coding

The bilateral filter in video coding is a coding tool for the VVC. The filter acts as a loop filter in parallel with the sample adaptive offset (SAO) filter. Both the bilateral filter and SAO act on the same input samples, each filter produces an offset, and these offsets are then added to the input sample to produce an output sample that, after clipping, goes to the next stage. The spatial filtering strength σ_d is determined by the block size, with smaller blocks filtered more strongly, and the intensity filtering strength σ_r is determined by the quantization parameter, with stronger filtering being used for higher QPs. Only the four closest samples are used, so the filtered sample intensity I_F can be calculated as

$I_F=I_C+\frac{w_A\Delta I_A+w_B\Delta I_B+w_L\Delta I_L+w_R\Delta I_R}{w_C+w_A+w_B+w_L+w_R}$

where I_C denotes the intensity of the center sample, ΔI_A=I_A−I_C the intensity difference between the center sample and the sample above. ΔI_B, ΔI_L and ΔI_R denote the intensity difference between the center sample and that of the sample below, to the left and to the right respectively.

4. Technical Problems Solved by Disclosed Embodiments

Example designs for the Hadamard domain filter (HDF) in video coding systems have the following problems. In an example HDF design, only the reconstruction samples of a current frame are used for filtering. However, there is other valuable information that can be potentially utilized, such as samples inside reconstructed reference frames or the corresponding prediction frame. In an example HDF design, only the reconstruction samples before HDF processing are used for filtering. However, there is other valuable information that can be potentially utilized, such as samples before deblocking filter (DBF) or other stages.

5. A Listing of Solutions and Embodiments

To solve the above-described problems, methods as summarized below are disclosed. The embodiments should be considered as examples to explain the general concepts and should not be interpreted in a narrow way. Furthermore, these embodiments can be applied individually or combined in any manner. It should be noted that the disclosed methods may be used as in-loop filters or post-processing. In this disclosure, a video unit may refer to a sequence, a picture, a sub-picture, a slice, a CTU, a block, and/or a region. The video unit may comprise one color component or multiple color components. In this disclosure, an HDF processing unit may refer to a sequence, a picture, a sub-picture, a slice, a CTU, a block, a region, or a sample. The HDF processing unit may comprise one color component or multiple color components.

In the following disclosure, the filtered sample value is denoted as the output of HDF. For example, in the procedure described as

$F\left(i,\sigma \right)=\{\begin{array}{c}R\left(i\right),\mathrm{Abs}\left(R\left(i\right)\right)>\mathrm{THR}\\ \mathrm{LUT}\left(R\left(i\right),\sigma \right),R\left(i\right)>0\\ -\mathrm{LUT}\left(R\left(i\right),\sigma \right),R\left(i\right)\le 0\end{array}\mathrm{LUT}\left(R\left(i\right),\sigma \right)=\frac{{R\left(i\right)}^3}{{R\left(i\right)}^2+{\sigma }^2}$

where F (i, σ) is denoted as the output of HDF.

In the following disclosure, the HDF denotes an example Hadamard Transform Domain filter in video coding which generally uses pre-defined filtering parameters to produce an output of HDF. For example, there is no online-training or signaling for the filtering parameters in HDF.

In the following disclosure, the adaptive HDF denotes an improved version of HDF on top of the HDF in video coding. The online-parameter-training and parameter signaling are involved into the adaptive HDF. For example, multiple filtered samples generated based on the HDF are further combined with the signaled and online-trained parameters.

Example 1

In an example, an adaptive HDF is used to further enhance the efficiency of the HDF. In one example, the final output of HDF may be generated by a combination of multiple elements. In one example, different combination methods may be applied to generate the final output of HDF. In one example, an average sum method may be applied. In one example, a weighted sum method may be applied. In one example, a linear sum method may be applied. In one example, a non-linear sum method may be applied.

Example 2

In one example, the combination method may be performed by employing a Wiener function. In one example, the final output of HDF may be described as follows:

$G={\sum }_{i=0}^{i=N}{C}_i\times f_i$

where c_i denotes the i-th coefficient, f_i denotes the i-th intermedia output, which is used as an input element for the final output, N denotes the total number of input elements (e.g., N=2) and G denotes the final output of HDF. In one example, the i-th intermedia output may be an output of one HDF. In one example, the intermedia output may be generated by a different HDF. In one example, the HDF may employ a different filtering window. In one example, the HDF may employ a different filtering parameter. In one example, the HDF may employ a different filtering strength.

In one example, the i-th intermedia output may be the filtered sample, which is not filtered by HDF. For example, the non-HDF filter may be a deblocking filtering (DBF), a BF, adaptive loop filter (ALF), sample adaptive offset (SAO), cross component ALF (CC-ALF), cross component SAO (CC-SAO), etc.

Example 3

In one example, different settings may be applied to the Wiener function. The clipping method may or may not be applied to the difference between input element and current reconstruction samples. The geometrical transformation may or may not be applied to the coefficients. In one example, the coefficients may be designed in a symmetrical way. In one example, the coefficients may be designed in an asymmetrical way.

Example 4

In one example, the coefficients may be generated by different ways. In one example, the coefficients may be pre-defined. In one example, the coefficients may be determined on-the-fly. In one example, the coefficients may be derived at the encoder side and signaled to the decoder side. In one example, the clipping and other parameters may be generated by different ways. In one example, the clipping and other parameters may be pre-defined. In one example, the clipping and other parameters may be determined on-the-fly. In one example, the clipping and other parameters may be derived at the encoder side and signaled to the decoder side.

Example 5

In one example, one or more classification methods may be applied to the input elements. In one example, a gradient-information based classification method may be used. In one example, a band-information based classification method may be used. In one example, a linear-function based classification method may be use. In one example, a non-linear-function based classification method may be used. In one example, the class merging method may be performed. In some examples, each class may have an independent parameter set for adaptive HDF.

Example 6

In one example, a first syntax element may be signaled to indicate whether the adaptive combination for HDF is enabled. In one example, the first syntax element may be coded by arithmetic coding. In one example, the first syntax element may be coded with at least one context. The context may depend on coding information of the current block or neighboring block. The context may depend on the filter shape of at least one neighboring block.

In one example, the first syntax element may be coded with bypass coding. In one example, the first syntax element may be binarized by unary code, truncated unary code, fixed-length code, exponential Golomb code, or truncated exponential Golomb code, etc.

In one example, the first syntax element may be signaled conditionally. For example, the first syntax element may be signaled only if the adaptive HDF is available. The first syntax element may be coded in a predictive way. The first syntax element may be predicted by the on/off decision of the adaptive HDF of at least one neighboring block. The first syntax element may be signaled independently for different color components. In an example, the first syntax element may be signaled and shared for different color components. In an example, the first syntax element may be signaled for a first color component but not signaled for a second color component.

Example 7

In one example, a syntax element structure, such as an adaptation parameter set (APS), may contain the parameters of adaptive combination for HDF. In one example, the coefficients may be contained in an APS. In one example, the clipping parameters may be contained in an APS. In one example, the class merging results may be contained in an APS. In an example, other parameters may be contained in an APS.

Example 8

In one example, different resources may be utilized in an HDF or adaptive HDF process.

In one example, an intermediate result may be used in the HDF or adaptive HDF process by feeding reconstruction before HDF into HDF. In one example, the reconstruction before the DBF may be used in the HDF or adaptive HDF process. In one example, the intermediate result may be used in the HDF or adaptive HDF process by feeding reconstruction before DBF into HDF.

In one example, the reconstruction of a reference picture may be used in HDF or adaptive HDF process. In one example, one or more forward reference pictures may be used. In one example, one or more backward reference pictures may be used. In one example, one or more forward and backward reference pictures may be used jointly.

In one example, the intermediate result may be used by feeding a reference picture into the HDF. In one example, one or more forward reference pictures may be used. In one example, one or more backward reference pictures may be used. In one example, one or more forward and backward reference pictures may be used jointly.

In one example, the reconstruction before and/or after other coding stages may be used. In one example, the intermediate result may be used by feeding reconstruction before and/or after other coding stages. In one example, the resource of the current position may be used for a spatial position. In one example, the resource of the neighboring position may be used for a spatial position.

Example 9

In one example, an HDF or adaptive HDF may be based on one/more previously coded frames and motion information. In one example, the previously coded frame may be a reference frame in a reference picture list (RPL) or reference picture set (RPS) associated with the block/the current slice/frame. In one example, the previously coded frame may be a short-term reference picture of the block/the current slice and/or frame. In one example, the previously coded frame may be a long-term reference picture of the block, the current slice, and/or frame. In an example, the previously coded frame may NOT be a reference frame, but is still stored in the decoded picture buffer (DPB).

Example 10

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

Example 11

In one example, the frames to be utilized can be determined on-the-fly. In one example, HDF or the adaptive HDF may take information from one or more previously coded frames in DPB. In one example, an HDF or adaptive HDF may take information from one or more reference frames in list 0. In one example, an HDF or adaptive HDF may take information from one or more reference frames in list 1. In one example, an HDF or adaptive HDF may take information from reference frames in both list 0 and list 1.

In one example, the HDF or adaptive HDF may take information from the closest reference frame to the current frame where the closest reference frame is the reference frame with a smallest picture order count (POC) distance to current slice and/or frame. In one example, the HDF or adaptive HDF may take information from the reference frame with reference index equal to K (e.g., K=0) in a reference list. In one example, K may be pre-defined. In one example, K may be derived on-the-fly according to reference picture information. In one example, K may be signaled.

In one example, the HDF or adaptive HDF may take information from a collocated frame. In one example, the frame to be utilized may be determined by the decoded information. In one example, the frame to be utilized may be defined as the top N (e.g., N=1) most-frequently used reference pictures for samples within the current slice/frame. In one example, the frame to be utilized may be defined as the top N (e.g., N=1) most-frequently used reference pictures of each reference picture list, if available, for samples within the current slice/frame. In one example, the frame to be utilized may be defined as the pictures with top N (e.g., N=1) smallest POC distances and/or absolute POC distances relative to current picture.

Example 12

In one example, whether to take information from previously coded frames may be dependent on decoded information (e.g., coding modes/statistics/characteristics) of at least one region of the to-be-filtered block. In one example, whether to take information from previously coded frames may be dependent on the slice and/or picture type. In one example, such information may only be applicable to inter-coded slices and/or pictures (e.g., unidirectional inter prediction (P) or bidirectional inter prediction (B) slices and/or pictures). In one example, whether to take information from previously coded frames may be dependent on availability of reference pictures. In one example, whether to take information from previously coded frames may be dependent on the reference picture information or the picture information in the DPB.

In one example, taking information from previously coded frames may be disabled if the smallest POC distance (e.g., smallest POC distance between reference pictures/pictures in DPB and current picture) is greater than a threshold. In one example, whether to take information from previously coded frames may be dependent on the temporal layer index. In one example, information from previously coded frames may be applicable to blocks with a given temporal layer index (e.g., the highest temporal layer).

In one example, if the to-be-filtered block contains a portion of samples that are coded in non-inter mode, the HDF or adaptive HDF may not use information from previously coded frames to filter the block. In one example, the non-inter mode may be defined as intra mode. In one example, the non-inter mode may be defined as a set of coding modes which includes, but are not limited to intra, intra block copy (IBC), and Palette modes.

In one example, a distortion between current block and the matching block is calculated and used to decide whether to take information from previously coded frames to filter a current block. In one example, the distortion between the collocated block in a previously coded frame and current block may be used to decide whether to take information from previously coded frames to filter a current block. In one example, motion estimation may be first used to find a matching block from at least one previously coded frame. In one example, information from previously coded frames may not be used when the distortion is larger than a pre-defined threshold.

Example 13

In one example, how to and/or whether to use the HDF or adaptive HDF may take the motion information of current block and reconstructed samples in previously coded frames and/or slices to build/generate reference a block. In one example, reference block may be defined as those in the one or more reference blocks and/or collocated blocks of the current block. In one example, the reference blocks may be defined as those in a region pointed to by a motion vector. In one example, the motion vector may be different from the decoded motion vector associated with current block. In one example, a reference block may refer to a block whose center is located at the same horizontal and vertical position in a previously coded frame as that of current block in the current frame. In one example, a reference block is derived by motion estimation, for example by searching from a previously coded frame to find the block that is closest to current block with a certain measure. In one example, the motion estimation may be performed at integer precision to avoid fractional pixel interpolation. In one example, the motion estimation may be performed at fractional precision to improve the quality of reference block.

In one example, a reference block may be derived by reusing at least one motion vector contained in the current block. In one example, the motion vector may be first rounded to the integer precision to avoid fractional pixel interpolation. In one example, the reference block may be located by adding an offset which is determined by the motion vector to the position of the current block. In one example, the motion vector may refer to the previously coded picture containing the reference block. In one example, the motion vector may be scaled to the previously coded picture containing the reference block. In one example, reference blocks and/or collocated blocks may be the same size of current block.

In one example, reference blocks and/or collocated blocks may be larger than current block. In one example, reference blocks and/or collocated blocks with the same size of the current block may be first found and then extended at each boundary to contain more samples from the previously coded samples. In one example, the size of extended area may be signaled to the decoder or derived on-the-fly. In one example, the information contains two reference blocks and/or collocated blocks of a current block, with one of them from the first reference frame in list-0 and the other from the first reference frame in list-1.

Example 14

In one example, the reconstruction samples before or after different coding stages of current frame are used as input for HDF or the adaptive HDF. In one example, the reconstruction before and/or after DBF of the current frame may be used as input for HDF or the adaptive HDF. In one example, the reconstruction before and/or after the SAO and/or CCSAO of current frame may be used as input for HDF or the adaptive HDF. In one example, the reconstruction before and/or after the BF of the current frame may be used as input for the HDF or the adaptive HDF. In one example, the reconstruction before and/or after HDF of current frame may be used as input for HDF or the adaptive HDF. In one example, the reconstruction before/after other stages of current frame may be used as input for the HDF or the adaptive HDF.

Example 15

In one example, different methods may be used to determine whether to and/or how to use mapping or transform result as input for the HDF or adaptive HDF. In one example, a specific transform may be used to generate the input for the HDF or adaptive HDF. In one example, the discrete cosine transform (DCT) may be applied. In one example, the fast Fourier transform (FFT) may be applied. In one example, the discrete wavelet transform (DWT) may be applied. For example, other transform functions may be applied.

In one example, a specific mapping function may be used to generate the input for the HDF or the adaptive HDF. In one example, the square function may be applied. In one example, the variance function may be applied. In one example, the sine function may be applied. In one example, the cosine function may be applied. In one example, other linear or non-linear mapping function may be applied.

Example 16

In one example, the above-mentioned methods may be used jointly.

Example 17

In one example, the above-mentioned methods may be used individually.

Example 18

In one example, the above-mentioned methods may be applied to different color components. In one example, the above-mentioned methods may be only applied to LUMA. In one example, the above-mentioned methods may be only applied to CHROMA. In one example, the above-mentioned methods may be applied to LUMA and CHROMA jointly.

Example 19

In one example, the adaptive HDF method may be applied to any in-loop filtering tools, pre-processing, and/or post-processing filtering method in video coding, which includes but is not limited to DBF, BF, SAO, CCSAO, ALF, CCALF, Hadamard Domain Filter, or any other filtering method. In one example, the adaptive HDF method may be applied to an in-loop filtering method. In one example, the adaptive HDF method may be applied to an in-loop filtering method with pre-defined parameters. In one example, the adaptive HDF method may be applied to an in-loop filtering method with online-trained parameters. In one example, the adaptive HDF method may be applied to a pre-processing filtering method. In one example, the proposed adaptive HDF method may be applied to a post-processing filtering method.

Example 20

In above examples, the video unit may refer to sequence/picture/sub-picture/slice/tile/coding tree unit (CTU)/CTU row/groups of CTU/coding unit (CU)/prediction unit (PU)/transform unit (TU)/coding tree block (CTB)/coding block (CB)/prediction block (PB)/transform block (TB)/any other region that contains more than one luma or chroma sample/pixel.

Example 21

Whether to and/or how to apply the disclosed methods above may be signaled in a bitstream. In one example, they may be signaled at sequence level/group of pictures level/picture level/slice level/tile group level, such as in a sequence header, picture header, SPS, VPS, DPS, decoder capability information (DCI), PPS, APS, slice header, and tile group header. In one example, they may be signaled at PB, TB, CB, PU, TU, CU, virtual pipeline data unit (VPDU), CTU, CTU row, slice, tile, sub-picture, other kinds of region contain more than one sample or pixel.

Example 22

Whether to and/or how to apply the disclosed methods above may be dependent on coded information, such as block size, color format, single/dual tree partitioning, color component, slice/picture type.

FIG. 14 is a block diagram showing 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 the system 4000. The system 4000 may include input 4002 for receiving video content. The video content may be received in a raw or uncompressed format, e.g., 8- or 10-bit multi-component pixel values, or may be in a compressed or encoded format. The input 4002 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as Wi-Fi or cellular interfaces.

The system 4000 may include a coding component 4004 that may implement the various coding or encoding methods described in the present disclosure. The coding component 4004 may reduce the average bitrate of video from the input 4002 to the output of the coding component 4004 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 4004 may be either stored, or transmitted via a communication connected, as represented by the component 4006. The stored or communicated bitstream (or coded) representation of the video received at the input 4002 may be used by a component 4008 for generating pixel values or displayable video that is sent to a display interface 4010. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or DisplayPort, and so on. Examples of storage interfaces include serial advanced technology attachment (SATA), peripheral component interconnect (PCI), integrated drive electronics (IDE) interface, and the like. The embodiments described in the present disclosure may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.

FIG. 15 is a block diagram of an example video processing apparatus 4100. The apparatus 4100 may be used to implement one or more of the methods described herein. The apparatus 4100 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 4100 may include one or more processors 4102, one or more memories 4104 and video processing circuitry 4106. The processor(s) 4102 may be configured to implement one or more methods described in the present disclosure. The memory (memories) 4104 may be used for storing data and code used for implementing the methods and embodiments described herein. The video processing circuitry 4106 may be used to implement, in hardware circuitry, some embodiments described in the present disclosure. In some embodiments, the video processing circuitry 4106 may be at least partly included in the processor 4102, e.g., a graphics co-processor.

FIG. 16 is a flowchart for an example method 4200 of video processing. The method 4200 includes determining to apply an HDF to samples of a picture at step 4202. The HDF applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof. A conversion is performed between a visual media data and a bitstream based on the HDF at step 4204. The conversion of step 4204 may include encoding at an encoder or decoding at a decoder, depending on the example.

It should be noted that the method 4200 can be implemented in an apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, such as video encoder 4400, video decoder 4500, and/or encoder 4600. In such a case, the instructions upon execution by the processor, cause the processor to perform the method 4200. Further, the method 4200 can be performed by a non-transitory computer readable medium comprising a computer program product for use by a video coding device. The computer program product comprises computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the video coding device to perform the method 4200.

FIG. 17 is a block diagram that illustrates an example video coding system 4300 that may utilize the embodiments of this disclosure. The video coding system 4300 may include a source device 4310 and a destination device 4320. Source device 4310 generates encoded video data which may be referred to as a video encoding device. Destination device 4320 may decode the encoded video data generated by source device 4310 which may be referred to as a video decoding device.

Source device 4310 may include a video source 4312, a video encoder 4314, and an input/output (I/O) interface 4316. Video source 4312 may include a source such as a video capture device, an interface to receive video data from a video content provider, and/or a computer graphics system for generating video data, or a combination of such sources. The video data may comprise 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 that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. I/O interface 4316 may include a modulator/demodulator (modem) and/or a transmitter. The encoded video data may be transmitted directly to destination device 4320 via I/O interface 4316 through network 4330. The encoded video data may also be stored onto a storage medium/server 4340 for access by destination device 4320.

Destination device 4320 may include an I/O interface 4326, a video decoder 4324, and a display device 4322. I/O interface 4326 may include a receiver and/or a modem. I/O interface 4326 may acquire encoded video data from the source device 4310 or the storage medium/server 4340. Video decoder 4324 may decode the encoded video data. Display device 4322 may display the decoded video data to a user. Display device 4322 may be integrated with the destination device 4320, or may be external to destination device 4320, which can be configured to interface with an external display device.

Video encoder 4314 and video decoder 4324 may operate according to a video compression standard, such as the HEVC standard, VVC standard, and other current and/or further standards.

FIG. 18 is a block diagram illustrating an example of video encoder 4400, which may be video encoder 4314 in the system 4300 illustrated in FIG. 17. Video encoder 4400 may be configured to perform any or all of the embodiments of this disclosure. The video encoder 4400 includes a plurality of functional components. The embodiments described in this disclosure may be shared among the various components of video encoder 4400. In some examples, a processor may be configured to perform any or all of the embodiments described in this disclosure.

The functional components of video encoder 4400 may include a partition unit 4401; a prediction unit 4402, which may include a mode select unit 4403, a motion estimation unit 4404, a motion compensation unit 4405, and an intra 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 encoding unit 4414.

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

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

Partition unit 4401 may partition a picture into one or more video blocks. Video encoder 4400 and video decoder 4500 may support various video block sizes.

Mode select unit 4403 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra or inter coded block to a residual generation unit 4407 to generate residual block data and to a reconstruction unit 4412 to reconstruct the encoded block for use as a reference picture. In some examples, mode select unit 4403 may select a combination of intra and inter prediction (CIIP) mode in which the prediction is based on an inter prediction signal and an intra prediction signal. Mode select unit 4403 may also select a resolution for a motion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of inter prediction.

To perform inter prediction on a current video block, motion estimation unit 4404 may generate motion information for the current video block by comparing one or more reference frames from buffer 4413 to the current video block. Motion compensation unit 4405 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from buffer 4413 other than the picture associated with the current video block.

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

In some examples, motion estimation unit 4404 may perform uni-directional prediction for the current video block, and motion estimation unit 4404 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. Motion estimation unit 4404 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. Motion estimation unit 4404 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. Motion compensation unit 4405 may generate the predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.

In other examples, motion estimation unit 4404 may perform bi-directional prediction for the current video block, motion estimation unit 4404 may search the reference pictures in list 0 for a reference video block for the current video block and may also search the reference pictures in list 1 for another reference video block for the current video block. Motion estimation unit 4404 may then generate reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. Motion estimation unit 4404 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block. Motion compensation unit 4405 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.

In some examples, motion estimation unit 4404 may output a full set of motion information for decoding processing of a decoder. In some examples, motion estimation unit 4404 may not output a full set of motion information for the current video. Rather, motion estimation unit 4404 may signal the motion information of the current video block with reference to the motion information of another video block. For example, motion estimation unit 4404 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.

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

In another example, motion estimation unit 4404 may identify, in a syntax structure associated with the current video block, another video block and a motion vector difference (MVD). The motion vector difference indicates a difference between the motion vector of the current video block and the motion vector of the indicated video block. The 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.

As discussed above, video encoder 4400 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 4400 include advanced motion vector prediction (AMVP) and merge mode signaling.

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

Residual generation unit 4407 may generate residual data for the current video block by subtracting the predicted video block(s) of the current video block from the current video block. The residual data of the current video block may include residual video blocks that correspond to different sample components of the samples in the current video block.

In other examples, there may be no residual data for the current video block for the current video block, for example in a skip mode, and residual generation unit 4407 may not perform the subtracting operation.

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

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

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

After reconstruction unit 4412 reconstructs the video block, the loop filtering operation may be performed to reduce video blocking artifacts in the video block.

Entropy encoding unit 4414 may receive data from other functional components of the video encoder 4400. When entropy encoding unit 4414 receives the data, entropy encoding unit 4414 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.

FIG. 19 is a block diagram illustrating an example of video decoder 4500 which may be video decoder 4324 in the system 4300 illustrated in FIG. 17. The video decoder 4500 may be configured to perform any or all of the embodiments of this disclosure. In the example shown, the video decoder 4500 includes a plurality of functional components. The embodiments described in this disclosure may be shared among the various components of the video decoder 4500. In some examples, a processor may be configured to perform any or all of the embodiments described in this disclosure.

In the example shown, video decoder 4500 includes an entropy decoding unit 4501, a motion compensation unit 4502, an intra prediction unit 4503, an inverse quantization unit 4504, an inverse transformation unit 4505, a reconstruction unit 4506, and a buffer 4507. Video decoder 4500 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 4400.

Entropy decoding unit 4501 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). Entropy decoding unit 4501 may decode the entropy coded video data, and from the entropy decoded video data, motion compensation unit 4502 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. Motion compensation unit 4502 may, for example, determine such information by performing the AMVP and merge mode.

Motion compensation unit 4502 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used with sub-pixel precision may be included in the syntax elements.

Motion compensation unit 4502 may use interpolation filters as used by video encoder 4400 during encoding of the video block to calculate interpolated values for sub-integer pixels of a reference block. Motion compensation unit 4502 may determine the interpolation filters used by video encoder 4400 according to received syntax information and use the interpolation filters to produce predictive blocks.

Motion compensation unit 4502 may use some of the syntax information to determine sizes of blocks used to encode frame(s) and/or slice(s) of the encoded video sequence, partition information that describes how each macroblock of a picture of the encoded video sequence is partitioned, modes indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter coded block, and other information to decode the encoded video sequence.

Intra prediction unit 4503 may use intra prediction modes for example received in the bitstream to form a prediction block from spatially adjacent blocks. Inverse quantization unit 4504 inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 4501. Inverse transform unit 4505 applies an inverse transform.

Reconstruction unit 4506 may sum the residual blocks with the corresponding prediction blocks generated by motion compensation unit 4502 or intra prediction unit 4503 to form decoded blocks. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in buffer 4507, which provides reference blocks for subsequent motion compensation/intra prediction and also produces decoded video for presentation on a display device.

FIG. 20 is a schematic diagram of an example encoder 4600. The encoder 4600 is suitable for implementing the techniques of VVC. The encoder 4600 includes three in-loop filters, namely a deblocking filter (DF) 4602, a sample adaptive offset (SAO) 4604, and an adaptive loop filter (ALF) 4606. Unlike the DF 4602, which uses predefined filters, the SAO 4604 and the ALF 4606 utilize the original samples of the current picture to reduce the mean square errors between the original samples and the reconstructed samples by adding an offset and by applying a finite impulse response (FIR) filter, respectively, with coded side information signaling the offsets and filter coefficients. The ALF 4606 is located at the last processing stage of each picture and can be regarded as a tool trying to catch and fix artifacts created by the previous stages.

The encoder 4600 further includes an intra prediction component 4608 and a motion estimation/compensation (ME/MC) component 4610 configured to receive input video. The intra prediction component 4608 is configured to perform intra prediction, while the ME/MC component 4610 is configured to utilize reference pictures obtained from a reference picture buffer 4612 to perform inter prediction. Residual blocks from inter prediction or intra prediction are fed into a transform (T) component 4614 and a quantization (Q) component 4616 to generate quantized residual transform coefficients, which are fed into an entropy coding component 4618. The entropy coding component 4618 entropy codes the prediction results and the quantized transform coefficients and transmits the same toward a video decoder (not shown). Quantization components output from the quantization component 4616 may be fed into an inverse quantization (IQ) components 4620, an inverse transform component 4622, and a reconstruction (REC) component 4624. The REC component 4624 is able to output images to the DF 4602, the SAO 4604, and the ALF 4606 for filtering prior to those images being stored in the reference picture buffer 4612.

A listing of solutions preferred by some examples is provided next.

The following solutions show examples of embodiments discussed herein.

• • 1. A method for processing video data, comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; and performing a conversion between a visual media data and a bitstream based on the HDF process.
  • 2. The method of solution 1, wherein a final output of the HDF process is described as follows:

$G={\sum }_{i=0}^{i=N}{C}_i\times f_i$

where c_i denotes the i-th coefficient, f_i denotes the i-th intermedia output, which is used as an input element for the final output, N denotes the total number of input elements and G denotes the final output of the HDF process.

• • 3. The method of solution 2, wherein N is greater than or equal to 2, and all the intermedia outputs are outputs of a same first HDF process.
  • 4. The method of solution 2, wherein N is greater than or equal to 2, and one of the intermedia outputs is generated by a first HDF process, wherein another intermedia output of the intermedia outputs is generated by a second HDF process, and wherein the second HDF process employs a different filtering window, a different filtering parameter, or a different filtering strength than the first HDF process.
  • 5. The method of any of solutions 1-4, wherein the i-th intermedia output is a filtered sample that is not filtered by the HDF.
  • 6. The method of any of solutions 1-5, wherein a clipping step is applied to the input element, or a clipping step is applied to the final output of the HDF process.
  • 7. The method of any of solutions 1-6, wherein a clipping step is applied to a difference between an input element and current reconstruction samples, or a clipping step is applied to a difference between the final output of the HDF process and current reconstruction samples.
  • 8. The method of any of solutions 1-7, wherein geometrical transformation is applied to coefficients of the Wiener function, and wherein the coefficients of the Wiener function are designed either symmetrically or asymmetrically.
  • 9. The method of any of solutions 1-8, wherein coefficients are pre-defined, derived, signaled in the bitstream, or combinations thereof, and wherein clipping parameters are pre-defined, derived, signaled in the bitstream, or combinations thereof.
  • 10. The method of any of solutions 1-9, wherein input elements are classified based on gradient information, band information, a linear function, a non-linear function, a class merging function, or combinations thereof.
  • 11. The method of any of solutions 1-10, wherein the bitstream includes a syntax element indicating whether an adaptive combination is employed by the HDF process, wherein the syntax element is coded with bypass coding or with at least one context that is based on coding information of the current block or a neighboring block, and wherein when the context is based on the coding information of the neighboring block, the context is based on a filter shape of the neighboring block.
  • 12. The method of any of solutions 1-11, wherein the bitstream includes a syntax element indicating whether an adaptive combination is employed by a bilateral filtering (BF) process, wherein the syntax element is coded with bypass coding or with at least one context that is based on coding information of the current block or a neighboring block, and wherein when the context is based on the coding information of the neighboring block, the context is based on a filter shape of the neighboring block.
  • 13. The method of any of solutions 1-12, wherein the syntax element is binarized by unary code, truncated unary code, fixed-length code, exponential Golomb code, or truncated exponential Golomb code.
  • 14. The method of any of solutions 1-13, wherein the syntax element is signaled based on whether the adaptive combination employed by the HDF process is available, and/or wherein the syntax element is predicted based on an on/off decision of an adaptive combination employed by the HDF process for at least one neighboring block, and/or wherein the syntax element is signaled independently for different color components, is signaled and shared for different color components, or is signaled for a first color component but not signaled for a second color component.
  • 15. The method of any of solutions 1-14, wherein an adaptation parameter set includes coefficients, clipping parameters, class merging results, or combinations thereof.
  • 16. A method for processing video data, comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof to produce filtered samples; determining to apply an adaptive HDF process to combine the filtered samples with signaled parameters and/or online-trained parameters; and performing a conversion between a visual media data and a bitstream based on the HDF and adaptive HDF processes.
  • 17. The method of any of solutions 1-16, wherein reconstructed samples filtered by another filter before the HDF process provide an intermediate result that is input into the HDF process and/or the adaptive HDF process.
  • 18. The method of any of solutions 1-17, wherein reconstructed samples from before a deblocking filter provide the intermediate result that is input into the HDF process and/or the adaptive HDF process.
  • 19. The method of any of solutions 1-18, wherein reconstructed samples from before the deblocking filter are filtered by the HDF process to provide the intermediate result that is input into the HDF process and/or the adaptive HDF process.
  • 20. The method of any of solutions 1-19, wherein reconstructed reference pictures are input into the HDF process and/or the adaptive HDF process, and wherein the reconstructed reference pictures include forward reference pictures, backwards reference pictures, or combinations thereof.
  • 21. The method of any of solutions 1-20, wherein reconstructed reference pictures filtered by another filter before the HDF process provide an intermediate result that is input into the HDF process and/or the adaptive HDF process, and wherein the reconstructed reference pictures include forward reference pictures, backwards reference pictures, or combinations thereof.
  • 22. The method of any of solutions 1-21, wherein the reconstructed samples and/or reconstructed pictures are from before or after coding stages other than the HDF process and/or the adaptive HDF process.
  • 23. The method of any of solutions 1-22, wherein the intermediate result is obtained by feeding reconstructed samples and/or reconstructed pictures from before or after coding stages other than the HDF process and/or the adaptive HDF process to another filter different than the HDF process and/or the adaptive HDF process.
  • 24. The method of any of solutions 1-23, wherein a spatial position is based on a resource of a current position.
  • 25. The method of any of solutions 1-24, wherein a spatial position is based on a resource of a neighboring position.
  • 26. The method of any of solutions 1-25, wherein the HDF process and/or the adaptive HDF process receives previously coded frames as input.
  • 27. The method of any of solutions 1-26, wherein the previously coded frames include reference frames in a reference picture list (RPL) or reference picture set (RPS).
  • 28. The method of any of solutions 1-27, wherein the previously coded frames are not reference frames, and are stored in a decoded picture buffer.
  • 29. The method of any of solutions 1-28, wherein the bitstream includes an indicator indicating which previously coded frames are used as input when filtering a current frame.
  • 30. The method of any of solutions 1-28, wherein the previously coded frames used as input to the HDF process and/or the adaptive HDF process are determined based on: information from frames in the decoded picture buffer, information from one or more reference picture lists, a determination of closest reference frames, reference frame index, a determination of collocated frames, decoded information, or combinations thereof.
  • 31. The method of any of solutions 1-30, wherein a determination of whether to take information from previously coded frames as input into the HDF process and/or the adaptive HDF process is made based on slice type, reference picture information, temporal layer index, whether a current picture contains samples coded by a non-inter prediction mode, a distortion between a current block and a matching block, or combinations thereof.
  • 32. The method of any of solutions 1-31, wherein the HDF process receives motion information of a current block and reconstructed samples of a previously coded frame to generate a reference block.
  • 33. The method of any of solutions 1-32, wherein the reference block includes samples in a region pointed to by a motion vector, samples in block centered at a same horizontal and vertical position as a current block in a previous frame, samples in a block derived by motion estimation, samples in a block derived by using motion vectors associated with a current block, or combinations thereof.
  • 34. The method of any of solutions 1-33, wherein the reference block is larger than the current block.
  • 35. The method of any of solutions 1-34, wherein the reference block is from a first reference frame in a first list, and another reference block is from the first reference frame in a second list.
  • 36. The method of any of solutions 1-35, wherein the HDF process and/or the adaptive HDF process receives reconstructed samples as input, and wherein the reconstructed samples are taken from prior to application of a deblocking filter (DB), prior to application of a sample adaptive offset (SAO) filter, prior to application of a bilateral filter (BF), or combinations thereof.
  • 37. The method of any of solutions 1-36, wherein a discrete cosine transform (DCT), a fast Fourier transform (FFT), a discrete wavelet transform (DWT), or combination thereof, are used to generate input to the HDF process and/or the adaptive HDF process.
  • 38. The method of any of solutions 1-37, wherein a square function, a variance function, a sine function, a cosine function, a linear mapping function, a non-linear mapping function, or combinations thereof are applied to generate input for the HDF process and/or the adaptive HDF process.
  • 39. The method of any of solutions 1-38, wherein the HDF process and/or the adaptive HDF process is applied only to luma components of the picture, or wherein the HDF process and/or the adaptive HDF process is applied only to chroma components of the picture, or wherein the HDF process and/or the adaptive HDF process is applied to both luma and chroma components of the picture.
  • 40. The method of any of solutions 1-39, wherein the adaptive HDF process is applied to an in-loop filter and/or a pre-processing filter and/or a post-processing filter.
  • 41. The method of any of solutions 1-40, wherein the adaptive HDF process is applied to an in-loop filter with either pre-defined or online-trained parameters.
  • 42. The method of any of solutions 1-41, wherein the HDF process and/or the adaptive HDF process are applied based on parameters signaled in a bitstream.
  • 43. The method of any of solutions 1-42, wherein the HDF process and/or the adaptive HDF process are applied based on a block size, a color format, a single or dual tree partitioning, a color component, a slice or picture type, or a combination thereof.
  • 44. The method of any of solutions 1-43, wherein the conversion includes encoding the visual media data into the bitstream.
  • 45. The method of any of solutions 1-43, wherein the conversion includes decoding the visual media data from the bitstream.
  • 46. An apparatus for processing video data, comprising: a processor; and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform the method of any of solutions 1-45.
  • 47. A non-transitory computer readable medium comprising a computer program product for use by a video coding device, the computer program product comprising computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the video coding device to perform the method of any of solutions 1-45.
  • 48. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; and generating the bitstream based on the determining.
  • 49. A method for storing bitstream of a video comprising: determining to apply a Hadamard Domain Filter (HDF) process to samples of a picture, wherein the HDF process applies an average sum, a weighted sum, a linear sum, a non-linear sum, a Wiener function, or combinations thereof; generating the bitstream based on the determining; and storing the bitstream in a non-transitory computer-readable recording medium.
  • 50. A method, apparatus, or system described in the present disclosure.

In the solutions described herein, an encoder may conform to the format rule by producing a coded representation according to the format rule. In the solutions described herein, a decoder may use the format rule to parse syntax elements in the coded representation with the knowledge of presence and absence of syntax elements according to the format rule to produce decoded video.

In the present disclosure, the term “video processing” may refer to video encoding, video decoding, video compression or video decompression. For example, video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa. The bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax. For example, a macroblock may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream. Furthermore, during conversion, a decoder may parse a bitstream with the knowledge that some fields may be present, or absent, based on the determination, as is described in the above solutions. Similarly, an encoder may determine that certain syntax fields are or are not to be included and generate the coded representation accordingly by including or excluding the syntax fields from the coded representation.

The disclosed and other solutions, examples, embodiments, modules and the functional operations described in this disclosure can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this disclosure and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program 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 coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this disclosure can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).

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

While the present disclosure contains many specifics, these should not be construed as limitations on the scope of any subject matter or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of the present disclosure. Certain features that are described in the present disclosure in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in the present disclosure should not be understood as requiring such separation in all embodiments.

Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in the present disclosure.

A first component is directly coupled to a second component when there are no intervening components, except for a line, a trace, or another medium between the first component and the second component. The first component is indirectly coupled to the second component when there are intervening components other than a line, a trace, or another medium between the first component and the second component. The term “coupled” and its variants include both directly coupled and indirectly coupled. The use of the term “about” means a range including ±10% of the subsequent number unless otherwise stated.

While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented.

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

Claims

1. A method for processing video data, comprising: determining, during a conversion between a video comprising a picture and a bitstream of the video, to apply an adaptive Hadamard Domain Filter (HDF) process in addition to an HDF process to samples of the picture, wherein parameters of the HDF process are predefined and parameters of the adaptive HDF process are trained online, and wherein a final output of the adaptive HDF process in addition to the HDF process is generated by a combination of multiple elements; andperforming the conversion based on the final output.

2. The method of claim 1, wherein the combination is performed in a wiener function way, and the final output of the adaptive HDF process in addition to the HDF process is described as follows:

3. The method of claim 2, wherein N is greater than or equal to 2, and all the intermedia outputs are outputs of a same first HDF process, and wherein the first HDF process is one of the adaptive HDF process and the HDF process.

4. The method of claim 2, wherein N is greater than or equal to 2, wherein one of the intermedia outputs is generated by a first HDF process, wherein another intermedia output of the intermedia outputs is generated by a second HDF process that is different the first HDF process, and wherein the first HDF process and the second HDF process is one of the adaptive HDF process and the HDF process.

5. The method of claim 2, wherein coefficients of the adaptive HDF process are derived at an encoder side and signaled to a decoder side.

6. The method of claim 2, wherein clipping parameters of the adaptive HDF process are derived at an encoder side and signaled to a decoder side.

7. The method of claim 1, wherein the bitstream includes a syntax element indicating whether an adaptive combination for the adaptive HDF process and the HDF process is enabled.

8. The method of claim 2, wherein an intermediate result generated by feeding reconstructed samples before the HDF process into the HDF is used as the intermediate result that is input into the HDF process or the adaptive HDF process.

9. The method of claim 2, wherein reconstructed samples from before a deblocking filter provide the intermediate result that is input into the HDF process or the adaptive HDF process.

10. The method of claim 2, wherein reconstructed samples from before a deblocking filter are filtered by the HDF process to provide the intermediate result that is input into the HDF process or the adaptive HDF process.

11. The method of claim 1, wherein the HDF process or the adaptive HDF process receives reconstructed samples before or after coding stages of a current frame as input.

12. The method of claim 11, further comprising determining whether to or how to use mapping or transform results of the reconstructed samples as the input for the HDF process or the adaptive HDF process.

13. The method of claim 1, wherein the HDF process or the adaptive HDF process receives previously coded frames as input, and wherein the previously coded frames used as input to the HDF process or the adaptive HDF process are determined based on information from one or more frames in a decoded picture buffer.

14. The method of claim 1, wherein the HDF process or the adaptive HDF process receives previously coded frames as input, and wherein the previously coded frames used as input to the HDF process or the adaptive HDF process are determined based on information from one or more reference frames in list 0, or list 1, or in both list 0 and list 1.

15. The method of claim 1, wherein whether to take information from previously coded frames as input into the HDF process or the adaptive HDF process is determined based on at least one of: a slice type a picture type, or a distortion between a current block and a matching block.

16. The method of claim 1, wherein the conversion includes encoding the video into the bitstream.

17. The method of claim 1, wherein the conversion includes decoding the video from the bitstream.

18. An apparatus for processing video data, comprising: a processor; and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, during a conversion between a video comprising a picture and a bitstream of the video, to apply an adaptive Hadamard Domain Filter (HDF) process in addition to an HDF process to samples of the picture, wherein parameters of the HDF process are predefined and parameters of the adaptive HDF process are trained online, and wherein a final output of the adaptive HDF process in addition to the HDF process is generated by a combination of multiple elements; andperform the conversion based on the final output.

19. The apparatus of claim 18, wherein the combination is performed in a wiener function way, and the final output of the adaptive HDF process in addition to the HDF process is described as follows:

20. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: determine, for a video comprising a picture, to apply an adaptive Hadamard Domain Filter (HDF) process in addition to an HDF process to samples of the picture, wherein parameters of the HDF process are predefined and parameters of the adaptive HDF process are trained online, and wherein a final output of the adaptive HDF process in addition to the HDF process is generated by a combination of multiple elements; andgenerating the bitstream based on the final output.