RU2817405C1 - Method, equipment and devices for encoding and decoding - Google Patents

Abstract

FIELD: video encoding and decoding technologies.

SUBSTANCE: result is achieved by the fact that if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining the gradient value of the current pixel point based on the initial pixel value of the current pixel point and the initial pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the initial pixel value of the current pixel point, a specified pixel value of the current pixel point is determined.

EFFECT: high efficiency of encoding video images.

15 cl, 7 dwg, 2 tbl

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the field of encoding and decoding technologies and, in particular, to a method, equipment and apparatus for encoding and decoding.

PREREQUISITES FOR CREATION OF THE INVENTION

[0002] To save space, video images are always transmitted after encoding. A complete video encoding method may include processes such as prediction, transform, quantization, entropy encoding, filtering, etc., and predictive encoding may include inner encoding and outer encoding. Further, outer encoding refers to the operation of using time domain video correlation to predict pixel values of the current image using the pixel values of neighboring encoded images to effectively eliminate redundancy in time domain video. Intra coding refers to the operation of using spatial domain video correlation to predict a current pixel value using the pixel values of one or more coded blocks of the current image to eliminate spatial domain video redundancy.

[0003] Common filtering technologies include deblocking filter technology (DBF), sample adaptive offset technology (SAO), and adaptive loop filter technology (ALF). DBF technology is used to eliminate the block boundary effect created by block coding. SAO technology consists of performing classification based on the pixel values of the samples and the gradient values of the surrounding blocks, and adding a different compensation value for each class of pixel values to ensure that the reconstructed image is closer to the original image. ALF technology is used to filter the reconstructed image using a Wiener filter to ensure that the reconstructed image is closer to the original image.

[0004] But all filtering technologies such as DBF, SAO and ALF perform classification based on the pixel value of the current pixel point or based on the relationship between the pixel value of the current pixel point and the pixel value of the surrounding pixel point, and then perform various filtering operations based on different classes. In this case, the phenomenon of overfiltering may occur: the filtered pixel values are much larger or much smaller than the unfiltered pixel values, and much larger or much smaller than the original pixel values. Thus, problems such as poor filtering effect and poor encoding performance occur.

SUMMARY OF THE INVENTION

[0005] The present disclosure provides encoding and decoding method and equipment, as well as corresponding devices, to improve encoding performance.

[0006] The present disclosure provides an encoding and decoding method. The method includes:

[0007] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining a gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[0008] In the present disclosure, a decoding apparatus is provided. The device contains:

[0009] a memory configured to store video data;

[00010] decoder configured:

[00011] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determine the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; Based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determine the refined pixel value of the current pixel point.

[00012] The present disclosure provides an encoding device.

The device contains:

[00013] a memory configured to store video data;

[00014] encoder configured:

[00015] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determine the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; Based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determine the refined pixel value of the current pixel point.

[00016] In the present disclosure, a decoder device is provided. The device includes: a processor and a computer-readable storage medium on which computer-readable instructions executed by the processor are stored;

[00017] The processor is configured to execute machine-readable instructions to carry out the following steps:

[00018] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[00019] The present disclosure provides an encoder apparatus. The device includes a processor and a computer-readable storage medium on which computer-readable instructions executable by the processor are stored;

[00020] The processor is configured to execute machine-readable instructions to carry out the following steps:

[00021] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[00022] From the above technical solutions, it can be seen that in embodiments of the present disclosure, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, the refined pixel value of the current pixel point can be determined based on the gradient value of the current pixel point and the original value pixel of the current pixel point, namely, refinement is performed on the original pixel value of the current pixel point based on the gradient value of the current pixel point, to ensure that the refined pixel value of the current pixel point is closer to the original pixel, which improves encoding performance. In filtering processes such as DBF, SAO and ALF, if the current pixel point in the current block satisfies the condition of enabling the advanced refinement mode, refinement can be performed on the original pixel value of the current pixel point based on the gradient value of the current pixel point to improve the filtering effect and performance coding.

BRIEF DESCRIPTION OF THE DRAWINGS

[00023] FIG. 1 is a schematic diagram illustrating an encoding and decoding structure according to an embodiment of the present invention.

[00024] FIG. 2A and 2B are diagrams illustrating block division in accordance with an embodiment of the present invention.

[00025] FIG. 3 is a schematic diagram,

illustrating deblocking filtering according to an embodiment of the present disclosure.

[00026] FIG. 4 is a flowchart illustrating an encoding and decoding method according to an embodiment of the present invention.

[00027] FIG. 5A is a schematic diagram,

illustrating a hardware structure of a decoder device according to an embodiment of the present disclosure.

[00028] FIG. 5B is a schematic diagram illustrating a hardware structure of an encoder device according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[00029] The terms used in the embodiments of the present disclosure are intended only to describe specific embodiments of the invention and not to limit the embodiments of the present disclosure. The singular forms used in the present disclosure and claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the combination “and/or” as used herein refers to any one or all possible combinations of one or more related listed elements. It should be understood that although terms such as “first”, “second”, “third”, etc. may be used in embodiments of the present disclosure to describe various information, the information should not be limited to these terms. These terms are used only to distinguish information of the same type. For example, within the spirit of embodiments of the present disclosure, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, so the choice of terms depends on the context. Additionally, the word “if” used can be interpreted as “after,” “when,” or “in response to.”

[00030] To enable those skilled in the art to better understand the technical concepts of the present disclosure, technical terms are briefly presented below.

[00031] Video Coding Structure: With reference to FIG. 1, a video encoding framework may be used to implement an encoder processing flow in embodiments of the present disclosure. A schematic diagram of the video decoding structure may be similar to FIG. 1, and therefore will not be repeated here. A video decoding structure may be used to implement a decoder processing flow in embodiments of the present disclosure. The video encoding structure and the video decoding structure may include, but are not limited to: a prediction module (for example, an intra prediction module and an inter prediction module, etc.), a motion estimation/compensation module, a reference picture buffer, an in-loop filtering module, a reconstruction module, conversion module, quantization module, inverse transformation module, inverse quantization module, entropy encoder, etc. In the encoder, through the interaction of these modules, the encoder processing flow can be provided; in the decoder, through the interaction of these modules, the decoder processing flow can be provided.

[00032] A contour filter is used to reduce problems such as image blocking or poor image quality to improve image quality. A loop filter may include: three filters, i.e. DBF, SAO and ALF. DBF is a deblocking filter and is used to eliminate the block boundary effect created by block encoding. SAO is an adaptive sample offset filter that is used to perform classification based on the pixel values of the samples and the gradient values of the surrounding blocks and add a different compensation value for each class of pixel values to ensure that the reconstructed image is closer to the original image. ALF is an adaptive contour filter and is used to filter the reconstructed image using a Wiener filter to ensure that the reconstructed image is closer to the original image.

[00033] In some embodiments of the invention, in the video encoding process and in the video decoding process, the prediction process may include intra prediction and inter prediction. In intra-prediction, due to the strong correlation in the spatial domain between neighboring blocks, the surrounding reconstructed pixels are used as reference pixels to predict the current uncoded block. Thus, it is further necessary to encode only the residual values without encoding the original values, which effectively eliminates the redundancy in the spatial domain and greatly improves the compression efficiency. Inter-prediction refers to the operation of using time-domain video correlation to predict the pixel values of the current image using the pixel values of neighboring encoded images to eliminate redundancy in the time-domain video.

[00034] In some embodiments of the invention, in a video encoding process and in a video decoding process, transform refers to transforming an image described as pixels in a spatial domain into a transformed domain image that is represented as a transform coefficient. Since most images contain many flat regions and slowly varying regions, the decentralized energy distribution of the image in the spatial domain is converted into a centralized distribution in the transformed region in a proper conversion process to eliminate the correlation between signals in the frequency domain and effectively compress the bit stream in conjunction with the quantization process.

[00035] In some embodiments of the invention, entropy encoding refers to performing lossless encoding based on the principle of information entropy, which consists of having the final processing module in video compression convert the symbol sequence of elements representing the video sequence into a single binary bitstream for transmission or storage The input symbols may include quantized transform coefficient(s), motion vector information, prediction mode information, and syntax related to transform and quantization, and the like. The output of the entropy encoding module is the final bitstream after the original video has been compressed. Entropy coding can effectively eliminate the statistical symbol redundancy of these video elements and is one of the important tools to ensure compression efficiency in video coding.

[00036] In some embodiments of the invention, a loop filter is used to reduce problems such as blocking or poor image quality to improve image quality. The loop filter may include, but is not limited to: DBF, SAO and ALF, etc. For example, in a video image, the boundaries of the image blocks are not continuous, and when the image is compressed and reconstructed, there is an obvious blocking effect, which greatly affects the image quality. DBF technology can be used to perform,at the edge, filtering to eliminate blocking. Deblocking filtering is performed at the boundaries of all Prediction Units (PUs) and Transform Units (TUs), and deblocking filtering includes a filtering decision and a filtering operation. In the filtering decision process, the boundary strength (eg, no filtering, weak filtering, or strong filtering) and the filtering parameter are obtained. During the filtering operation, correction for a pixel is performed based on the edge strength and the filtering parameter. For example, when filtering is performed at the edge, the filtering can be strong or weak filtering, which is performed using different numbers of elements.

[00037] The SAO filter is used to eliminate the ringing effect. Ringing effect refers to the ripple phenomenon occurring around the edge after decoding due to the quantization distortion of the high frequency variable coefficient. The larger the converted block size, the more noticeable the ringing effect. The basic principle of SAO is to compensate the peak pixels of the reconstruction curve by adding a negative value, and the bottom pixels by adding a positive value. SAO can, with the Coding Tree Unit (CTU) as the base unit, include two main classes of compensation forms: Edge Offset (ED) and Band Offset (BO). Next, the parameter fusion technology is introduced.

[00038] The ALF filter is used to obtain the optimal filter in the root mean square sense, i.e. Wiener filter, based on the original signals and distortion signals. The ALF filter may include, but is not limited to: a 7*7 diamond filter or a 5*5 diamond filter, a 7*7 cross filter plus a 3*3 square centrosymmetric filter, or a 7*7 cross filter plus a 5*5 square centrosymmetric filter.

[00039] Intra prediction must use spatial domain video correlation to perform prediction on one or more coded blocks of the current block to eliminate spatial domain video redundancy. Intra prediction provides multiple prediction modes, each corresponding to one texture direction (except DC mode). For example, if the image texture is horizontal, the horizontal prediction mode can better predict image information.

[00040] External prediction is to predict a pixel of the current image based on the correlation of the time domain video using pixels of neighboring encoded images because the video sequence contains a strong correlation in the time domain, to effectively eliminate the redundancy of the time domain video. All parts of inter-prediction in video coding standards use block-based motion compensation technology, the basic principle of which is to find the best matching block in a previously encoded image for each block of pixels in the current image, a process called ME (Motion Estimation).

[00041] An inter-prediction Motion Vector (MV) may be used to represent the relative offset between the current block of the current image and a reference block of the reference image. Each block obtained by division has a corresponding motion vector that must be transmitted to the decoder. If the motion vector of each block is encoded and transmitted independently, many smaller blocks consume many bits. To reduce the number of bits used to encode the motion vector, it is possible to use the spatial domain correlation between adjacent blocks to predict the motion vector of the current block to be encoded based on the motion vector of the adjacent encoded block, and then encode the prediction difference. In this way, the number of bits representing the motion vector can be effectively reduced. Based on this, in the process of encoding the motion vector of the current block, to predict the motion vector of the current block, first use the motion vector of the adjacent encoded block, and then encode the motion vector difference (MVD) between the motion vector prediction value (MVP) and the real value of the motion vector estimate.

[00042] For motion information, since the motion vector represents the deviation of the position of the current block relative to the reference block, to accurately obtain information about the specified block, in addition to the motion vector, reference image index information is also needed to indicate which reference image is used for the current block. In video coding technology, a reference picture list may generally be set for the current picture, and the reference picture index information indicates which reference picture specified in the reference picture list is used for the current block. In addition, many encoding technologies also support multiple reference picture lists, so an index value can also be used to indicate which reference picture list is used, and this index value can be referred to as a reference direction. To summarize, in video coding technology, motion-related information such as motion vector, reference image index information, and reference direction may be collectively referred to as motion information.

[00043] There are many modes for flag encoding in video encoding. For a particular block, one of these modes can be adopted. To represent which mode is accepted, each block must mark the mode by encoding the appropriate flag. For example, for an encoder, the value of a flag is determined by the decision of the encoder, and then the value of the flag is encoded and passed to the decoder. For the decoder, decoding the flag value determines whether the corresponding mode is enabled.

[00044] In the flag encoding process, encoding the flag may be accomplished through high-level syntax. High-level syntax can be used to represent whether to enable a mode, namely, enabling a mode is enabled or disabled by high-level syntax.

[00045] In some embodiments, the high-level syntax may be high-level sequence parameter set syntax, or high-level image parameter set syntax, or high-level slice header syntax, or high-level image header syntax, but is not limited to this.

[00046] For high-level sequence parameter set syntax (SPS), there is a flag for determining whether to enable or disable certain modes (tool/method) in an entire video sequence (ie, across multiple video images). For example, if the value of the flag is the value A (for example, the value 1, etc.), the video sequence allows the mode corresponding to the flag to be turned on; or, if the value of the flag is the value B (for example, the value 0, etc.), the video sequence prohibits the inclusion of the mode corresponding to the flag.

[00047] For high-level picture parameter set syntax (PPS), there is a flag for determining whether to enable or disable certain modes (tool/method) in a picture (eg, a video picture). If the flag value is equal to the value A, the video image allows the mode corresponding to the flag to be turned on; if the flag value is equal to value B, the video image prohibits the inclusion of the mode corresponding to the flag.

[00048] For high-level image header syntax, there is a flag for determining whether to enable or disable certain modes (tool/method) in the image header. If the value of the flag is A, the image header allows the mode corresponding to the flag to be enabled; if the value of the flag is B, the image header disables the mode corresponding to the flag from being enabled. In some embodiments of the invention, the image header stores general information only for the current image. For example, when an image includes multiple slices, the multiple slices may share information in the image header.

[00049] For the high-level slice header syntax, there is a flag to determine whether to enable or disable certain modes (tool/method) in the slice. If the value of the flag is the value A, the slice allows the mode corresponding to the flag to be enabled; if the value of the flag is B, the slice prevents the mode corresponding to the flag from being enabled. In some embodiments, one image may include one or more slices, and the high-level syntax for the slice header is the high-level syntax configured for each slice.

[00050] High-level syntax is used to represent whether to enable the inclusion of some tools (methods), namely, the inclusion of some tools (methods) can be enabled or disabled by high-level syntax. In some embodiments of the invention, as described above, the high-level syntax may be high-level sequence parameter set syntax, or high-level image parameter set syntax, or high-level slice header syntax, or high-level image header syntax, which is not limited to herein, as long as the above functions can be implemented .

[00051] For rate distortion optimized (RDO), there are two metrics to evaluate coding efficiency: bit rate and PSNR (peak signal to noise ratio). The smaller the bit stream, the greater the compression ratio; and the higher the PSNR, the better the quality of the reconstructed image. When choosing a mode, the discriminant formula is essentially a complex assessment of these two indicators. For example, the cost associated with a mode can be calculated using the following formula: J (mode)=B+X*R, where D represents the distortion, usually measured using the SSE (sum of squared error), a SSE refers to the sum of the root mean square differences between the reconstructed image block and the original image; X represents the Lagrange multiplier; R represents the actual number of bits required to encode a block of an image in this mode, including the total number of bits required to encode mode information, motion information, residuals, etc. In mode selection, if a comparative decision is made for the encoding mode based on the RDO principle, optimal encoding performance is generally achieved.

[00052] Block partitioning technology: one coding tree unit (CTU, coding tree unit) is divided into coding units (CU, coding unit) using quadtree recursion. The use of internal or external coding is determined at the CU level of the output node. A CU can be divided into two or four prediction units (PUs), and the same prediction information is used in one PU. After obtaining the residual information after completion of the prediction, one CU can be divided into a plurality of transform units (TUs) by a quadtree. For example, in the present disclosure, the current image block is one PU. In addition, the block partitioning technology can be modified, for example, using a partition structure combining binary tree/ternary tree/quad tree to replace the original partitioning mode, so as to cancel the conceptual distinction of CU, PU and TU and support more flexible CU partitioning. CUs can be obtained by square or rectangular division. The CTU is first split by a quadtree, and then the end node of the quadtree split is split by a binary tree and a ternary tree. With reference to FIG. 2A, CUs can be divided by five types of partitioning, which are quad-tree partitioning, horizontal binary tree partitioning, vertical binary tree partitioning, horizontal ternary tree partitioning, and vertical ternary tree partitioning. With reference to FIG. 2B, the division of a CU into a CTU may be any combination of the above five types of division. From the above, it may be known that different partitioning methods allow the PU to have different shapes, such as rectangles and squares of different sizes.

[00053] DBF filtering (deblocking filtering) method: DBF filtering processing includes two processes: filtering decision and filtering operation.

[00054] The filtering decision includes 1) obtaining a boundary strength value (BS (boundary strength) value); 2) decision to enable filtering; and 3) selection of filtration strength. For the chrominance component, there is only stage 1), and the BS value of the luminance component is directly multiplexed. For the chrominance component, the filtering operation is performed only when the BS value is 2 (namely, at least one of the blocks on both sides of the current block is using the internal mode).

[00055] The filtering operation includes 1) strong filtering and weak filtering of the luminance component; and 2) chrominance component filtering.

[00056] In some embodiments of the invention, DBF filtering processing typically includes performing horizontal edge filtering (also called horizontal DBF filtering) and vertical edge filtering (also called vertical DBF filtering) with 8x8 pixels as a block. A maximum of three pixel points on both sides of the border are filtered, and a maximum of four pixel points on both sides of the border are used for filtering. In this way, horizontal DBF filtering and vertical DBF filtering of different blocks do not affect each other, namely, horizontal DBF filtering and DBF filtering can be performed in parallel.

[00057] As shown in FIG. 3, for the current block (for example, 8*8 pixels), vertical DBF filtering is performed on three columns of pixel points to the left of the current block and three columns of pixel points to the right of the left block (the block to the left of the current block), and then horizontal DBF filtering is performed filtering by three rows of pixel points on the top side of the current block and three rows of pixel points on the bottom side of the top block (the block above the current block).

[00058] In some embodiments of the invention, for pixel points subject to vertical DBF filtering and horizontal DBF filtering, vertical DBF filtering is typically performed before horizontal DBF filtering. Of course, horizontal DBF filtering can also be performed before vertical DBF filtering. In subsequent embodiments of the invention, for example, vertical DBF filtering is performed before horizontal DBF filtering.

[00059] In one possible implementation, the DBF filtering flow may include the following steps.

[00060] In step S11, the boundary condition values of the horizontal direction and the vertical direction are respectively calculated with 4*4 as the unit.

[00061] For a CU boundary, which is an 8*8 boundary, the edge condition value is 2 (used to indicate that the luma component and the chrominance component are both filtered). For a prediction unit (PU) boundary (such as 1/4, 1/2 and 3/4 horizontal line inside 2N*hN), which is also an 8*8 boundary, the value of the boundary condition is 1 (used to indicate that the component The luminance component is filtered, but the chrominance component is not filtered). Under circumstances other than the two mentioned above, the value of the boundary condition is 0.

[00062] In step S12, with the size 4*4 as the unit (filtering is performed with the size 8*8 as the unit, but information such as the boundary condition value is stored with the unit 4*4), vertical filtering on all blocks is completed. When the value of the boundary condition is not 0, the following filtering process is performed.

[00063] 1. Luminance component filtering (vertical filtering is performed on the four rows of the vertical boundary, and horizontal filtering is performed on the four columns of the horizontal boundary):

[00064] 1.1 The first step is to determine whether to skip the filtering process. In some embodiments of the invention, if the blocks on both sides of the boundary are non-internal mode blocks with no residuals and consistent motion, the filtering process will be skipped, otherwise the filtering process will be performed.

[00065] 1.2 If the filtering process is not skipped, the following processing is performed.

[00066] 1.2.1 If the filtering type (dftype) of the current image is type 1 and ABS(R0-L0)>=4* Alpha, FS is 0; otherwise, step 1.2.2 is performed to determine FS. Alpha is a predefined value, and ABS() indicates the operation of taking an absolute value.

[00067] 1.2.2 FL (Flatness Left, which takes the values 0, 2, or 3) and FR (Flatness Right, which takes the values 0, 2, or 3) are calculated. FL and FR are used to determine the degree of flatness of the inside of both sides. FS is then determined based on FL and FR. For example, to determine FS, you can use the following formula: FS=FL+FR.

[00068] 1.2.2.1 If ABS(L1-L0)<Beta and ABS(L2-L0)<Beta, FL is 3; if ABS(L1-L0)<Beta and ABS(L2-L0)>=Beta, FL is 2; if ABS(L1-L0)>=Beta and ABS(L2-L0)<Beta, FL is 1; otherwise, FL is 0. Beta is a predefined value, and ABS() indicates the operation of taking an absolute value.

[00069] 1.2.2.2 FR can be calculated in the same way as FL and will not be repeated here.

[00070] 1.2.3 The value of BS can be determined based on FS (FS can be 0, 2, 3, 4, 5 or 6 and BS can be 0, 1, 2, 3 or 4). For example, after receiving FS, the value of BS can be determined based on the value of FS.

[00071] 1.2.3.1 If FS is less than or equal to 2 (at most one side is moderately flat), BS=0.

[00072] 1.2.3.2 If FS is 3 (only if one side is very flat),

BS=(ABS(L1-R1)<Beta) ? 1:0, namely, if ABS (L1-R1)<Beta, BS=1, and otherwise BS=0.

[00073] 1.2.3.3 If FS is 4 (both sides are moderately flat), BS=(FL==2)? 2:1, namely, if FL=2, BS=2, and if FL is not equal to 2, BS=1.

[00074] 1.2.3.4 If FS is 5 (i.e. one side is moderately flat and the other is very flat), then:

[00075] if the filtering type (df type) of the current image is type 1, BS=(R1==R0 && L0==L1 && ABS(R2-L2)<Alpha) ? 3:2; namely, if the pixel value of pixel point R1 is equal to the pixel value of pixel point R0, and the pixel value of pixel point L0 is equal to the pixel value of pixel point L1, and the absolute value of the difference between the pixel value of pixel point R2 and the pixel value of pixel point L2 is less than Alpha ( i.e. pre-configured value), BS=3, otherwise BS=2.

[00076] Otherwise (namely, when the df type of the current image is not type 1), if the filter type of the current image is type 0, BS=(R1=R0 && L0=L1) ? 3:2; namely, the pixel value at pixel point R1 is equal to the pixel value at pixel point R0, and the pixel value at pixel point L0 is equal to the pixel value at pixel point L1, BS=3, and otherwise BS=2.

[00077] 1.2.3.5 If FS is 6 (both sides are very flat), then:

[00078] if the df type of the current image is type 1, BS=(ABS(R0-R1)<=Beta / 4 && ABS(L0-L1)<=Beta / 4 && ABS(R0-L0)< Alpha) && ABS(R0-R3)<=Beta / 2 && ABS(L0-L3)<=Beta / 2 ? 4:3; namely, if the conditions ABS(R0-R1)<=Beta/4, ABS(L0-L1)<=Beta/4, ABS(R0-L0)<Alpha, ABS(R0-R3)<=Beta/2 and ABS(L0-L3)<=Beta / 2 are all satisfied, BS=4, otherwise BS=3.

[00079] Otherwise (i.e., when the df type of the current image is not type 1), if the filter type of the current image is type 0, BS=(ABS(R0-R1)<=Beta / 4 && ABS(L0-L1)<=Beta / 4 && ABS(R0-L0)<Alpha) ? 4:3; namely, if the conditions ABS(R0-R1)<=Beta / 4, ABS(L0-L1)<=Beta / 4 and ABS(R0-L0)<Alpha, BS=4 are met, and otherwise BS=3 .

[00080] 1.2.4 Based on the BS value, the filter coefficient and the number of filtered pixels are determined. For example, if the four pixel points on the left or top side of the border have values from L0 to L3 respectively (as shown in Fig. 3, with the left side in Fig. 3 as an example); the four pixel points on the right or bottom side of the border have values from R0 to R3 respectively (as shown in Fig. 3, with the right side in Fig. 3 as an example). For the brightness component:

[00081] 1.2.4.1 If BS=4, filtering is performed on three pixels on each of both sides of the border.

[00082] For L0 and R0, the filter coefficient is [3,8,10,8,3]/32, namely, to determine the filtered pixel value of pixel point L0, a weighted sum of the pixel values of pixel points L2, L1, L0, R0 is performed and R1 with corresponding weighting coefficients (filtering coefficients) successively equal to 3/32, 8/32, 10/32, 8/32 and 3/32. If wj indicates the filter coefficient when j=-2 (second pixel point L2 to the left of the current pixel point), wj=3/32; when j=-1 (first pixel point L1 to the left of the current pixel point), wj=8/32; when j=0 (current pixel point, i.e. L0), wj=10/32; when j=1 (first pixel point R0 to the right of the current pixel point), wj=8/32; when j=2 (second pixel point R1 to the right of the current pixel point), wj=3/32. To determine the filtered pixel value of pixel point R0, a weighted sum is performed on the pixel values of pixel points R2, R1, R0, L0, and L1 with corresponding weights successively equal to 3/32, 8/32, 10/32, 8/32, or 3 /32. If wj indicates the filter coefficient when j=-2 (second pixel point R2 to the right of the current pixel point), wj=3/32; when j=-1 (first pixel point R1 to the right of the current pixel point), wj=8/32; when j=0 (current pixel point, i.e. R0), wj=10/32; when jj=1 (first pixel point L0 to the left of the current pixel point), wj=8/32; when j=2 (second pixel point L1 to the left of the current pixel point), wj=3/32.

[00083] In conclusion, L0'=clip(L2*3+L1*8+L0*10+R0*8+R1*3+16) >> 5), where L0' is the filtered pixel value of pixel point L0, L0 to L2 respectively indicate the pixel values at pixel points L0 to L2 before filtering, and R0 to R1 respectively indicate the pixel values at pixel points R0 to R1, the same notations being used below. R0 - clip((R2*3+R1*8+R0*10+L0*8+L1*3+16) >> 5) >> 5).

[00084] In the above formulas, """ indicates a right shift operation instead of division, for example, ">>5" is equivalent to dividing by 2 ⁵ (32). Multiplication (“*”) can be replaced by a shift to the left, for example, a multiplied by 4 can be replaced by a shift two positions to the left, namely by a<<2; a multiplied by 10 can be replaced by (a<<3)+(a<<1). """ is a left shift operation to replace multiplication, for example "a<<2" is equivalent to multiplying by 2 ² (4). When the division operation is performed by shift, the result of the operation can be rounded directly, namely, when the result of the operation is a non-integer number between N and N+1, the result of the operation is N. When the fractional part is greater than 0.5, the result of the operation is obtained as N+1 for increasing accuracy. Therefore, to improve the accuracy of a certain pixel value, 1/2 of the denominator (i.e., the dividend) can be added to the numerator of the above weighted sum during operation to achieve a rounding effect. Taking L0' for example, shifting it five positions to the right is equivalent to dividing by 2 ⁵ (32). As a result, 16 can be added to the numerator of the weighted sum. clip(x) specifies the clipping operation. When x is higher than the upper limit of the specified value range, the value of x is set equal to the upper limit of the specified value range; when x is below the lower limit of the specified value range, the value of x is set equal to the lower limit of the specified value range.

[00085] For L1 and R1, the filter coefficient is [4, 5, 4, 3]/16, and based on this L1'=clip((L2*4+L1*5+L0*4+R0*3+8) >> 4), and R1'=clip((R2*4+R1*5+R0*4+L0*3+8) >> 4).

[00086] For L2 and R2, the filter coefficient is [2, 2, 2, 1, 1]/8, and thus L2'=clip((L3*2+L2*2+L1*2+L0*1 +R0*1+4) >> 3) and R2'=clip((R3*2+R2*2+R1*2+R0* 1+L0* 1+4) >> 3).

[00087] 1.2.4.2 If BS=3, filtering is performed on two pixels on each of both sides of the border:

[00088] For L0 and R0, the filter coefficient is [1, 4, 6, 4, 1]/16, so L0'=clip(L2*1+L1*4+L0*6+R0*4+R1*1+ 8) >> 4 and R0'=clip(R2*1+R1*4+R0*6+L0*4+L1*1+8) >> 4.

[00089] For L1 and R1, the filter coefficient is [3, 8, 4, 1]/16 and thus L1'=clip((L2*3+L1*8+L0*4+R0*1+8) >> 4) and R1'=clip((R2*3+R1*8+R0*4+L0*1+8) >> 4).

[00090] 1.2.4.3 If BS=2, filtering is performed on one pixel on each of both sides of the border:

[00091] For L0 and R0, the filter coefficient is [3, 10, 3]/16, and based on this, L0'=clip(L1*3+L0*10+R0*3+8) >> 4 and R0'= clip(R1*3+R0*10+L0*3+8) >> 4.

[00092] 1.2.4.4 If BS=1, filtering is performed on one pixel on each of both sides of the border: for L0 and R0, the filter coefficient is [3, 1]/4, and thus L0'=clip(L0* 3+R0*1+2)»2, and R0'=clip(R0*3+L0*1+2)»2.

[00093] 1.2.4.5 If BS=0, no filtering is performed, namely, no filtering is performed on the pixels on either side of the boundary.

[00094] 2. When the value of the edge condition is 2, chrominance filtering is performed on the 16x16 block boundary, namely, chrominance component filtering is performed on the 16x16 block boundary. The chroma component filtering process is described below:

[00095] 2.1 First, it is determined whether to perform filtering, and the process is similar to the process of luminance component filtering and will not be repeated here.

[00096] 2.2 If filtering is necessary (ie the filtering process is not skipped), then FL and FR are calculated respectively, then FS is obtained from FL and FR, and then BS is obtained from FS. This process is also similar to the process of filtering the luminance component, so it will not be repeated here.

[00097] 2.3 The obtained BS value (for example, 4, 3, 2, 1, 0, etc.) of the chrominance component is reduced by 1, namely, the BS value may be 3, 2, 1 or 0. Component filtering process The chromaticities are performed based on the BS value in the following process.

[00098] If BS=3, filtering is performed on two pixels on each of both sides of the border: for L0 and R0, the filter coefficient is [3, 10, 3]/16, so L0'=clip(L1*3+L0 *10+R0*3+8) >> 4 and R0'=clip(R1*3+R0*10+L0*3+8) >> 4. For L1 and R1, the filter coefficient is [3, 8, 3, 2]/16, and thus L1'=clip((L2*3+L1*8+L0*3+R0*2+8) >> 4) and R1'=clip((R2*3+R1 *8+R0*3+L0*2+8) >> 4).

[00099] If BS=2 or BS=1, filtering is performed on one pixel on each of both sides of the border: for L0 and R0 the filter factor is [3, 10, 3]/16, and thus L0'=clip (L1*3+L0*10+R0*3+8) >> 4 and R0'=clip(R1*3+R0*10+L0*3+8) >> 4. If BS=0, no filtering is performed , namely, filtering is not performed for pixels on either side of the border.

[000100] In some embodiments, Alpha and Beta in the process described above are related to the average QP value of the blocks on both sides of the boundary, namely the average QP value of the current block and the left block of the current block (for a vertical DBF filter) or the average QP value the current block and the top block of the current block (for a horizontal DBF filter). Alpha and Beta values can be obtained by searching the table, but are not limited to this.

[000101] In step S13, with the size 4*4 as the unit (filtering is performed with the size 8*8 as the unit, and information such as the value of the boundary condition is stored with the size 4*4 as the unit), horizontal filtering for all blocks are completed, and the implementation is similar to step S12 and is not repeated here.

[000102] In related fields, filtering technologies such as DBF, SAO and ALF perform classification based on the pixel value of the current pixel point or based on the relationship between the pixel value of the current pixel point and the pixel value of the surrounding pixel point, and then perform various filtering operations on based on different classes. In this case, the phenomenon of over-filtering may occur, namely, the values of the filtered pixels are much larger or much smaller than the values of the unfiltered pixels, and much larger or much smaller than the original pixel values. Thus, problems such as poor filtering effect and poor encoding performance occur.

[000103] In this regard, embodiments of the present disclosure provide an encoding and decoding method in which the original pixel value of the current pixel point is refined based on the gradient value of the current pixel point to make the refined pixel value of the current pixel point closer to the original pixel, to improve coding performance. In the filtering process, if the current pixel point in the current block satisfies the condition of enabling the advanced refinement mode, the original pixel value of the current pixel point is refined based on the gradient value of the current pixel point to improve the filtering effect and encoding performance.

[000104] In combination with specific embodiments, the encoding and decoding method in the embodiments of the present disclosure will be described in detail below.

[000105] Embodiment 1: An embodiment of the present disclosure provides an encoding and decoding method that is applied to an encoder or decoder. In fig. 4 is a flowchart illustrating an encoding and decoding method. The encoding and decoding method may include the following steps.

[000106] At step 401, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, the gradient value of the current pixel point is determined based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point.

[000107] In some embodiments of the invention, the gradient value of the current pixel point can be determined based on the difference between the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point, namely, the gradient value of the current pixel point reflects the difference between the two pixel values.

[000108] In some embodiments of the invention, the surrounding pixel point of the current pixel point may be an adjacent pixel point to the current pixel point, or a pixel point that is not adjacent to the current pixel point. The surrounding pixel point of the current pixel point may be one or more pixel points located in the current block, or one or more pixel points located in the adjacent block of the current block. For example, the surrounding pixel point of the current pixel point may be a pixel point to the left of the current pixel point, or a pixel point to the right of the current pixel point, or a pixel point on the upper side of the current pixel point, or a pixel point on the lower side of the current pixel point. In embodiments of the invention, the position of the surrounding pixel point of the current pixel point is not limited here.

[000109] For example, as shown in FIG. 3, if the current pixel point is R0 in the current block, the surrounding pixel point of the current pixel point may be L0 in the left adjacent block of the current block. If the current pixel point is the pixel point of the first row and second column in the current block, the surrounding pixel point of the current pixel point may be the pixel point of the eighth row and second column in the top adjacent block of the current block.

[000110] At step 402, the refined pixel value of the current pixel point is determined based on the gradient value of the current pixel point and the original pixel value of the current pixel point. For example, the refined pixel value of the current pixel point may be determined based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value, and the second refinement offset value.

[000111] In one possible implementation, if the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value. For example, based on the sum of the original pixel value of the current pixel point and the first refinement offset value, the refined pixel value of the current pixel point is determined. If the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. For example, based on the sum of the original pixel value of the current pixel point and the second refinement offset value, the refined pixel value of the current pixel point is determined. In some embodiments of the invention, the first refinement threshold and the second refinement threshold may be opposite to each other. Of course, the first refinement threshold value and the second refinement threshold value also may not be opposite numbers to each other and may be set arbitrarily.

[000112] In one possible implementation, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, a pixel reference point corresponding to the current pixel point can be determined from an adjacent block of the current block, and the gradient value of the pixel reference point is determined based on the original the pixel value of the pixel reference point and the original pixel value of the surrounding pixel point of the pixel reference point; based on the gradient value of the pixel reference point and the original pixel value of the pixel reference point, a refined pixel value of the pixel reference point is determined.

[000113] In some embodiments of the invention, the reference pixel point may be a pixel point adjacent to the current pixel point in an adjacent block, or a pixel point not adjacent to the current pixel point in an adjacent block, but is not limited to this. For example, as shown in FIG. 3, if the current pixel point is R0 in the current block, the pixel reference point may be L0 in the left adjacent block of the current block, or L1, or L2, etc. in the left adjacent block of the current block, which is not limited here. If the current pixel point is R1 in the current block, the reference pixel point may be L0 in the left adjacent block of the current block, or L1 or L2, etc. in the left adjacent block of the current block, which is not limited here. If the current pixel point is the first row and second column pixel point in the current block, the pixel reference point may be the eighth row and second column pixel point in the top adjacent block of the current block, or the seventh row and second column pixel point in the top adjacent block of the current block. which is not limited here.

[000114] In some embodiments of the invention, the gradient value of a pixel reference point may be determined based on the difference between the original pixel value of the pixel reference point and the original pixel value of the surrounding pixel reference point of the pixel, namely, the gradient value reflects the difference between the two pixel values.

[000115] In some embodiments of the invention, the surrounding pixel point of a pixel reference point may be an adjacent pixel point to the pixel reference point, or a pixel point that is not adjacent to the pixel reference point. The surrounding pixel point for a pixel reference point may be a pixel point located in the block where the pixel reference point is located, or a pixel point located in an adjacent block of the block where the pixel reference point is located. For example, the surrounding pixel point for a pixel anchor point may be a pixel point to the left of the pixel anchor point, or a pixel point to the right of the pixel anchor point, or a pixel point on the upper side of the pixel anchor point, or a pixel point on the lower side of the pixel anchor point. In embodiments of the invention, the position of the surrounding pixel point for the reference pixel point is not limited here.

[000116] In one possible implementation, the surrounding pixel point for a pixel reference point may be the current pixel point in the current block, and similarly, the surrounding pixel point of the current pixel point may be the reference pixel point in an adjacent block of the current block.

[000117] In some embodiments, based on the pixel reference point gradient value and the pixel reference point's original pixel value, determining the refined pixel reference point pixel value may include, but is not limited to: based on the pixel reference point gradient value and the pixel reference point's original pixel value , a third refinement threshold (same as or different from the first refinement threshold), a fourth refinement threshold (same as or different from the second refinement threshold), a third refinement offset value (same as a first refinement offset value, or different therefrom) and a fourth refinement offset value (the same as or different from the third refinement offset value), determining a refined pixel value of the pixel reference point.

[000118] For example, if the pixel reference point gradient value is greater than the third refinement threshold value, the refined pixel reference point pixel value is determined based on the original pixel reference point pixel value and the third refinement offset value, for example, the refined pixel reference point pixel value is determined based on the sum the original pixel value of the pixel reference point and the third refinement offset value. If the pixel reference point gradient value is less than the fourth refinement threshold value, the refined pixel reference point pixel value is determined based on the original pixel reference point pixel value and the fourth refinement offset value, for example, the refined pixel reference point pixel value is determined based on the sum of the original reference point pixel value pixel and a fourth refinement offset value.

[000119] In some embodiments of the invention, the third refinement threshold value and the fourth refinement threshold value may be opposite numbers to each other. Of course, the third refinement threshold value and the fourth refinement threshold value also may not be opposite numbers to each other and can be set arbitrarily.

[000120] In one possible implementation, a first refinement threshold, a second refinement threshold, a first refinement offset value, a second refinement offset value, a third refinement threshold, a fourth refinement threshold, a third refinement offset value, and a fourth refinement offset value corresponding to the current block , is determined from high-level syntax. Optionally, a first refinement threshold value, a first refinement offset value, a second refinement offset value, a third refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block are determined from the high-level syntax. Optionally, a second refinement threshold value, a first refinement offset value, a second refinement offset value, a third refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block are determined from the high-level syntax. Optionally, a first refinement threshold value, a first refinement offset value, a second refinement offset value, a fourth refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block are determined from the high-level syntax. Optionally, a second refinement threshold value, a first refinement offset value, a second refinement offset value, a fourth refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block are determined from the high-level syntax.

[000121] In some embodiments of the invention, if the first refinement threshold value and the second refinement threshold value are opposite numbers of each other, the second refinement threshold value may be obtained after the first refinement threshold value is determined from the high-level syntax; and the first refinement threshold may be obtained after determining the second refinement threshold from the high-level syntax. If the third refinement threshold value and the fourth refinement threshold value are opposite numbers of each other, the fourth refinement threshold value can be obtained after determining the third refinement threshold value from the high-level syntax; and the third refinement threshold value may be obtained after determining the fourth refinement threshold value from the high-level syntax.

[000122] In one possible implementation, determining that the current pixel point in the current block satisfies the condition for enabling the enhanced refinement mode may include, but is not limited to, the following: if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the condition enabling the extended refinement mode, determining that the current pixel point satisfies the condition for enabling the extended refinement mode. For example, if the boundary strength of the boundary to be filtered corresponding to the current pixel point is a predetermined first value, it is determined that the boundary strength of the boundary to be filtered satisfies the condition for enabling the advanced refinement mode. In some embodiments of the invention, the predetermined first value may be 0. Of course, the predetermined first value may also be another number.

[000123] Optionally, if the property information corresponding to the current block satisfies the extended refinement mode enabling condition, it is determined that the current pixel point in the current block satisfies the extended refinement mode enabling condition. In some embodiments of the invention, the property information corresponding to the current block satisfies the condition for enabling the extended refinement mode, which means that if it is determined that a filtering operation is not allowed (deblocking filtering operation, etc.) for the current block based on the property information corresponding to the current block, it is determined that the property information corresponding to the current block satisfies the condition for enabling the extended refinement mode.

[000124] In some embodiments, before it is determined that the current pixel point in the current block satisfies the enhanced refinement mode enable condition, an enhanced refinement enable flag corresponding to the current block may be obtained. If the enhanced refinement mode enable flag corresponding to the current block allows the current block to enable the enhanced refinement mode, it is determined whether the current pixel point in the current block satisfies the enhanced refinement enable condition, i.e. determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode or does not satisfy the condition for enabling the extended refinement mode.

[000125] Optionally, if the enhanced refinement mode enable flag corresponding to the current block prohibits the current block from enabling the enhanced refinement mode, it is directly determined that the current pixel point in the current block does not satisfy the enhanced refinement mode enable condition.

[000126] In some embodiments, for a decoder, an extended refinement mode enable flag corresponding to a current block is determined from high-level syntax, and then based on the extended refinement enable flag, it is determined whether to allow the current block to enable extended refinement mode.

[000127] For example, if the value of the extended refinement mode enable flag is the first value (eg, 1), then the extended refinement mode enable flag allows the current block to enable the extended refinement mode; if the value of the extended refinement mode enable flag is the second value (eg, 0), then the extended refinement mode enable flag prevents the current block from enabling extended refinement mode.

[000128] In one possible implementation, if the encoding and decoding method is applied to a prediction process (eg, intra prediction or inter prediction), the original pixel value of the current pixel point may be the prediction value obtained by intra prediction or inter prediction, and the refined pixel value the current pixel point is taken as the target pixel value of the current pixel point (the final pixel value of the prediction process). If the encoding and decoding method is applied to the filtering process, the original pixel value of the current pixel point may be the prediction value before filtering, and the refined pixel value of the current pixel point is taken as the target pixel value of the current pixel point (the final pixel value of the filtering process).

[000129] From the above technical solutions, it can be seen that in embodiments of the present disclosure, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, the refined pixel value of the current pixel point can be determined based on the gradient value of the current pixel point and the original value pixel of the current pixel point, namely, refinement is performed on the original pixel value of the current pixel point based on the gradient value of the current pixel point, to ensure that the refined pixel value of the current pixel point is closer to the original pixel, which improves encoding performance. In filtering processes such as DBF, SAO and ALF, if the current pixel point in the current block satisfies the condition of enabling the advanced refinement mode, refinement can be performed on the original pixel value of the current pixel point based on the gradient value of the current pixel point to improve the filtering effect and performance coding.

[000130] In one possible implementation, if the current pixel point in the current block satisfies the general filtering mode enable condition, deblocking filtering (DBF filtering) may also be performed on the original pixel value of the current pixel point to obtain a filtered pixel value of the current pixel point. Of course, deblocking filtering is only an example, and thus another filtering mode can be used to perform filtering on the original pixel value of the current pixel point. For example, SAO filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point. Alternatively, ALF filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point.

[000131] In some embodiments of the invention, with deblocking filtering as an example, with reference to steps S11-13, deblocking filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point, which is here does not repeat.

[000132] From the continuous consideration of steps S11-13, it can be seen that if the blocks on both sides of the boundary are non-internal mode blocks with no residues and consistent motion, the filtering process will be skipped, otherwise it will be executed. When the filtering process is to be performed, the BS value can also be obtained. If the BS value is 0, no filtering is performed, namely, no filtering is performed on the pixels on either side of the border. If the BS value is greater than 0, filtering is performed on pixels on both sides of the border. In conclusion, if the blocks on both sides of the boundary are non-internal mode blocks with no residuals and motion consistent, the current pixel point in the current block does not satisfy the condition for enabling the general filtering mode. If the condition that the blocks on both sides of the boundary are non-internal mode blocks, with no residues and with coordinated movement, is not satisfied (i.e., the blocks on both sides of the boundary are not non-internal mode blocks, or blocks on both sides of the border have residuals or the movements of the blocks on both sides of the border are not consistent) and BS is equal to 0, the current pixel point in the current block does not satisfy the condition for enabling the general filtering mode. If the condition that the blocks on either side of the boundary are non-inner mode, no residue, and motion-consistent blocks is not met, and BS is greater than 0, the current pixel point in the current block satisfies the general filtering mode enable condition.

[000133] It should be noted that if the current pixel point in the current block satisfies the general filter mode enable condition, the current pixel point in the current block does not satisfy the advanced refinement mode enable condition; if the current pixel point in the current block satisfies the condition for enabling the advanced refinement mode, the current pixel point in the current block does not satisfy the condition for enabling the general filtering mode.

[000134] Based on the fact that the current pixel point satisfies the general filtering mode enable condition and deblocking filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point, it is also necessary to determine whether the current pixel point satisfies current block, the condition for enabling the advanced filtering mode. If the current pixel point in the current block satisfies the condition for enabling the extended filtering mode, the refined pixel value of the current pixel point is determined based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point, and the refined pixel value of the current pixel point is taken as the target pixel value current pixel point (the final pixel value of the deblocking filtering process). If the current pixel point in the current block does not satisfy the condition for enabling the advanced filtering mode, the filtered pixel value of the current pixel point is not adjusted, but is taken as the target pixel value of the current pixel point (the final pixel value of the filtering process for deblocking).

[000135] In some embodiments of the invention, if the current pixel point in the current block satisfies the advanced filtering mode enable condition, the refined pixel value of the current pixel point is determined based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point, which may include, without limitation: based on the filtered pixel value of the current pixel point, the original pixel value of the current pixel point, the first filtering threshold value, the second filtering threshold value, the first filtering offset value and the second filtering offset value, determining the refined pixel value of the current pixel point.

[000136] In some embodiments of the invention, the first filtering threshold and the second filtering threshold may have opposite values. Of course, the first filter threshold value and the second filter threshold value also may not be opposite numbers to each other and can be set arbitrarily.

[000137] In one possible implementation, if the current pixel point in the current block satisfies the general filtering mode enable condition, the pixel reference point corresponding to the current pixel point can also be determined from an adjacent block of the current block, and deblocking filtering (DBF filtering) ) is performed on the original pixel value of the pixel reference point to obtain the filtered pixel value of the pixel reference point. Of course, deblocking filtering is only an example, and another filtering mode may be used to perform filtering on the original pixel value of the pixel reference point. For example, SAO filtering or ALF filtering is performed on the original pixel value of the pixel reference point to obtain the filtered pixel value of the pixel reference point.

[000138] In some embodiments of the invention, with deblocking filtering as an example, with reference to steps S11-13, deblocking filtering is performed on the original pixel value of the pixel reference point to obtain the filtered pixel value of the pixel reference point, which is here does not repeat.

[000139] In some embodiments of the invention, the reference pixel point may be a pixel point adjacent to the current pixel point in an adjacent block, or a pixel point not adjacent to the current pixel point in an adjacent block, but is not limited to this.

[000140] Based on the fact that the current pixel point satisfies the general filtering mode enable condition and deblocking filtering is performed on the original pixel value of the pixel reference point to obtain the filtered pixel value of the pixel reference point, it is also necessary to determine whether the current pixel point satisfies current block, the condition for enabling the advanced filtering mode. If the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, the refined pixel value of the pixel reference point is determined based on the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point, and the refined pixel value of the pixel reference point is taken as the target pixel value pixel reference point (the final pixel value of the filtering process for deblocking). If the current pixel point in the current block does not satisfy the condition for enabling the advanced filtering mode, the filtered pixel value of the pixel reference point is not adjusted, and the filtered pixel value of the pixel reference point is taken as the target pixel value of the pixel reference point (the final pixel value of the deblocking filtering process) .

[000141] In some embodiments of the invention, determining a refined pixel reference point pixel value based on the filtered pixel reference point pixel value and the original pixel reference point pixel value may include, but is not limited to: based on the filtered pixel reference point pixel value, the original value pixel reference point pixel, a third filter threshold value, a fourth filter threshold value, a third filter offset value and a fourth filter offset value, determining a refined pixel reference point pixel value, where the third filter threshold value and the fourth filter threshold value may be opposite numbers to each other . Of course, the third filter threshold value and the fourth filter threshold value also may not be opposite numbers to each other and can be set arbitrarily.

[000142] In one possible implementation, a first filtering threshold, a second filtering threshold, a first filtering offset value, a second filtering offset value, a third filtering threshold, a fourth filtering threshold, a third filtering offset value, and a fourth filtering offset value corresponding to the current block , is determined from high-level syntax. Optionally, a first filtering threshold value, a first filtering offset value, a second filtering offset value, a third filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block are determined from the high-level syntax. Optionally, a second filtering threshold value, a first filtering offset value, a second filtering offset value, a third filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block are determined from the high-level syntax. Optionally, a first filtering threshold value, a first filtering offset value, a second filtering offset value, a fourth filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block are determined from the high-level syntax. Optionally, a second filtering threshold value, a first filtering offset value, a second filtering offset value, a fourth filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block are determined from the high-level syntax.

[000143] In some embodiments of the invention, if the first filtering threshold value and the second filtering threshold value are opposite numbers of each other, the second filtering threshold value may be obtained after the first filtering threshold value is determined from the high-level syntax; and the first filtering threshold value may be obtained after determining the second filtering threshold value from the high-level syntax. If the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the fourth filtering threshold value can be obtained after the third filtering threshold value is determined from the high-level syntax; and the third filtering threshold value may be obtained after the fourth filtering threshold value is determined from the high-level syntax.

[000144] In one possible implementation, determining that the current pixel point in the current block satisfies the condition for enabling the enhanced filtering mode may include, but is not limited to, the following: if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the condition enable the advanced filtering mode, and the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point is greater than a predetermined threshold value (the threshold value is a positive value, which is not limited herein; for example, if the first filtering threshold value and the second filtering threshold value are opposite numbers to each other; when the first filtering threshold value is a positive value, the predetermined threshold value is the same as the first filtering threshold value; when the second filtering threshold value is a positive value, the predetermined threshold value is the same; , as the second filtering threshold value, and of course the predetermined threshold value can also be another value), determining that the current pixel point satisfies the condition for enabling the advanced filtering mode. In some embodiments of the invention, the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies an advanced filtering mode enable condition, which may include, but is not limited to, the following: if the boundary strength of the boundary to be filtered corresponding to the current pixel point is a predetermined second value (it is different from the predetermined first value, namely not equal to 0, for example, the predetermined second value is greater than 0), determining that the boundary strength of the boundary to be filtered satisfies the condition for enabling the advanced filtering mode.

[000145] In some embodiments of the invention, before it is determined that the current pixel point in the current block satisfies the advanced filtering mode enable condition, an advanced filtering mode enable flag corresponding to the current block may be obtained. If the advanced filter mode enable flag corresponding to the current block allows the current block to enable the advanced filter mode, it is determined whether the current pixel point in the current block satisfies the advanced filter mode enable condition, i.e. determine that the current pixel point in the current block satisfies the condition for enabling the extended filtering mode or does not satisfy the condition for enabling the extended filtering mode.

[000146] Optionally, if the advanced filter mode enable flag corresponding to the current block prohibits the current block from enabling the advanced filter mode, it is directly determined that the current pixel point in the current block does not satisfy the advanced filter mode enable condition.

[000147] In some embodiments, for a decoder, the extended filter mode enable flag corresponding to the current block is parsed from the high-level syntax, and then based on the enhanced filter mode enable flag, it is determined whether to allow the current block to enable the enhanced filter mode.

[000148] For example, if the value of the advanced filtering mode enable flag is the first value (eg, 1), the advanced filtering mode enable flag allows the current block to enable the advanced filtering mode; if the value of the advanced filtering mode enable flag is the second value (for example, 0), then the advanced filtering mode enable flag prevents the current block from enabling the advanced filtering mode.

[000149] In some embodiments, in the above embodiments, the high-level syntax includes, but is not limited to, one of the following syntaxes: high-level sequence parameter set syntax (SPS), high-level image parameter set syntax ( PPS, picture parameter set), high-level picture header syntax, high-level picture syntax, high-level slice header syntax, high-level coding tree unit (CTU) syntax, and high-level coding unit (CU) syntax.

[000150] In some embodiments, in the above embodiments, the pixel value of the current pixel point in the current block may be a luma component or a chrominance component.

[000151] From the above technical solutions, it can be seen that if the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, the refined pixel value of the current pixel point can be determined based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point , namely, refinement is performed on the original pixel value of the current pixel point based on the filtered pixel value of the current pixel point, to ensure that the refined pixel value of the current pixel point is closer to the original pixel, which improves encoding performance. In filtering processes such as DBF, SAO and ALF, if the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, refinement of the original pixel value of the current pixel point based on the filtered pixel value of the current pixel point can be performed to improve the filtering effect and encoding performance .

[000152] Embodiment 2: When filtering is to be performed, it is first determined whether the filtering process should be skipped. For example, if the blocks on both sides of the border (i.e. the current block and the current block's neighbor block, which for a vertical border is the left neighbor block of the current block, and for a horizontal border is the top neighbor block of the current block) are non-inner blocks mode, (namely, neither the current block nor the neighboring block are internal mode blocks), without residuals (no residuals between the current block and the neighboring block), but with motion consistent (the current block and the neighboring block are motion consistent), filtering process skip, otherwise the filtering process is not skipped. Thus, "skip filtering process" can be used as a condition for enabling the advanced refinement mode, namely, if the filtering process is skipped for the current pixel point in the current block, the current pixel point in the current block satisfies the condition for enabling the extended refinement mode. When the current pixel point satisfies the condition for enabling the extended refinement mode, the original pixel value of the current pixel point can be refined based on the extended refinement mode to make the pixel value closer to the original pixel.

[000153] In some embodiments of the invention, if the property information corresponding to the current block satisfies the extended refinement mode enabling condition, it is determined that the current pixel point in the current block satisfies the extended refinement mode enabling condition. Property information corresponding to the current block is used to indicate whether blocks on either side of the boundary are non-internal mode blocks, to indicate whether blocks on both sides of the boundary have no residues, and to indicate whether blocks are on both sides of the border coordinated in movement. As a result, if property information corresponding to the current block is used to indicate that blocks on both sides of the boundary are non-internal mode blocks, to indicate that blocks on both sides of the boundary have no remainders, and to indicate that whether the blocks on both sides of the boundary are motion consistent, indicating that the property information corresponding to the current block satisfies the enhanced refinement mode enabling condition, and determines that the current pixel point in the current block satisfies the enhanced refinement mode enabling condition, namely, each pixel point in the current block satisfies the condition for enabling the extended refinement mode. Optionally, if the property information corresponding to the current block is used to indicate that all blocks on both sides of the boundary are not non-inner mode blocks, and/or the property information corresponding to the current block is used to indicate that that the blocks on both sides of the boundary have remainders, and/or the property information corresponding to the current block is used to indicate that the blocks on both sides of the boundary are not consistent in motion, this indicates that the property information corresponding to the current block is does not satisfy the condition for enabling the extended refinement mode, and it is determined that the current pixel point in the current block does not satisfy the condition for enabling the extended refinement mode, namely, each pixel point in the current block does not satisfy the condition for enabling the extended refinement mode.

[000154] In some embodiments of the invention, when the current pixel point satisfies the enhanced refine mode enable condition, the original pixel value of the current pixel point may be refined based on the extended refine mode. For example, the gradient value of the current pixel point is determined based on the original pixel value of the current pixel point, and the refined pixel value of the current pixel point is determined based on the gradient value of the current pixel point and the original pixel value of the current pixel point. The process of refining the refined pixel value may apply to subsequent embodiments of the invention and will not be repeated here.

[000155] Embodiment 3: When filtering is to be performed, it is first determined whether the filtering process should be skipped. For example, if the blocks on both sides of the boundary are non-internal mode blocks with no residues but consistent movement, the filtering process is skipped, otherwise the filtering process is not skipped. When the filtering process is not skipped, the BS value can also be determined. If the BS value is greater than 0 (eg, the BS value is 1, 2, 3, 4, etc.), filtering can be performed on pixels on both sides of the border. If the BS value is 0, no filtering is performed, namely, no filtering is performed on the pixels on either side of the boundary. Thus, "BS value is 0" can be taken as the condition for enabling the extended refinement mode, namely: if the BS value of the current pixel point in the current block is 0, the current pixel point in the current block satisfies the condition for enabling the extended refinement mode; if the BS value of the current pixel point in the current block is greater than 0, the current pixel point in the current block does not satisfy the condition for enabling the extended refinement mode.

[000156] In some embodiments of the invention, if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enhanced refinement mode enable condition, it is determined that the current pixel point satisfies the enhanced refinement mode enable condition. For example, the edge strength of the edge to be filtered corresponding to the current pixel point is first determined. If the boundary strength is a predetermined first value, it is determined that the boundary strength satisfies the condition for enabling the extended refinement mode. The predetermined first value can be set based on experience, for example, set to 0. Finally, the boundary strength of the boundary to be filtered corresponding to the current pixel point is 0, which indicates that the boundary strength of the boundary to be filtered corresponding to the current pixel point , satisfies the condition for enabling the extended refinement mode, and it is determined that the current pixel point satisfies the condition for enabling the extended refinement mode.

[000157] Optionally, if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block does not satisfy the enhanced refinement mode enabling condition, it is determined that the current pixel point does not satisfy the enhanced refinement mode enabling condition. For example, if the edge strength of the edge to be filtered corresponding to the current pixel point is not a predetermined first value, it is determined that the edge strength does not satisfy the condition for enabling the advanced refinement mode. Thus, it is determined that the current pixel point in the current block does not satisfy the condition for enabling the extended refinement mode.

[000158] In some embodiments of the invention, when the current pixel point satisfies the extended refine mode enable condition, the original pixel value of the current pixel point may be refined based on the extended refine mode to make the pixel value closer to the original pixel. For example, the gradient value of the current pixel point is determined based on the original pixel value of the current pixel point, and the refined pixel value of the current pixel point is determined based on the gradient value of the current pixel point and the original pixel value of the current pixel point. The process of refining the refined pixel value may be applied to subsequent embodiments of the invention.

[000159] Embodiment 4: When filtering is to be performed, it is first determined whether the filtering process should be skipped. For example, if the blocks on both sides of the boundary are non-internal mode blocks with no residues but consistent movement, the filtering process is skipped, otherwise the filtering process is not skipped. When the filtering process is not skipped, the BS value can also be determined. If the BS value is greater than 0 (eg, the BS value is 1, 2, 3, 4, etc.), filtering can be performed on pixels on both sides of the border. If the BS value is 0, no filtering is performed, namely, no filtering is performed on the pixels on either side of the boundary. Thus, “BS value is greater than 0” can be taken as the condition for enabling the general filtering mode, namely: if the BS value of the current pixel point in the current block is greater than 0, the current pixel point in the current block satisfies the condition for enabling the general filtering mode; if the BS value of the current pixel point in the current block is 0, the current pixel point in the current block does not satisfy the condition for enabling the general filtering mode.

[000160] In some embodiments of the invention, if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the general filtering mode enabling condition, it is determined that the current pixel point satisfies the general filtering mode enabling condition. For example, the edge strength of the edge to be filtered corresponding to the current pixel point may first be determined. If the boundary strength is a predetermined second value, it is determined that the boundary strength satisfies the condition for enabling the general filtering mode. The predetermined second value can be set based on experience, for example, it can be set to be greater than 0, such as 1, 2, 3, 4, and the like. In a word, if the edge strength of the edge to be filtered corresponding to the current pixel point is greater than 0 (that is, the edge strength is not equal to 0), this indicates that the edge strength of the edge to be filtered corresponding to the current pixel point satisfies the inclusion condition of the general filtering mode, and determining that the current pixel point satisfies the condition for enabling the general filtering mode.

[000161] Alternatively, if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block does not satisfy the general filtering mode enabling condition, it is determined that the current pixel point does not satisfy the general filtering mode enabling condition. For example, the edge strength (eg, 0) of the edge to be filtered corresponding to the current pixel point is not a predetermined second value, it is determined that the edge strength does not satisfy the condition for enabling the general filtering mode. Thus, it is determined that the current pixel point in the current block does not satisfy the condition for enabling the general filtering mode.

[000162] In some embodiments of the invention, when the current pixel point satisfies the general filtering mode enable condition, deblocking filtering (DBF filtering, which is used here as an example) may be performed on the original pixel value of the current pixel point to obtain a filtered pixel value current pixel point.

[000163] Embodiment 5: Based on the fact that the current pixel point in the current block satisfies the general filtering mode enable condition, and deblocking filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point, also it must be determined whether the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode. For example, it is determined whether the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point exceeds a predetermined threshold value. If the absolute value is greater than a predetermined threshold value, it is determined that the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode; if the absolute value is not greater than a predetermined threshold value, it is determined that the current pixel point in the current block does not satisfy the condition for enabling the advanced filtering mode. Finally, the satisfaction of the advanced filtering mode enabling condition by the current pixel point in the current block may include the following: if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the advanced filtering mode enabling condition, and the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point exceeds a predetermined threshold value, determining that the current pixel point satisfies the condition for enabling the advanced filtering mode.

[000164] In combination with specific embodiments of the invention, the condition for enabling the advanced filtering mode will be described below.

[000165] When filtering is to be performed, it is first determined whether the filtering process should be skipped. When the filtering process is not skipped, the BS value can also be determined. If the BS value is greater than 0, filtering can be performed on pixels on both sides of the border. Therefore, “BS value is greater than 0” is accepted as the condition for enabling the advanced filtering mode, and specifically, “BS value is greater than 0” is accepted as the conditions for enabling the general filtering mode and the advanced filtering mode simultaneously. When the BS value is greater than 0, deblocking filtering must be performed on the original pixel value of the current pixel point to obtain the filtered pixel value of the current pixel point. After obtaining the filtered pixel value of the current pixel point, it is also determined whether the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point is greater than a predetermined threshold value, and "the absolute value of the difference is greater than the predetermined threshold value" is taken as a condition enable advanced filtering mode.

[000166] Finally, if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, and the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point exceeds a predetermined threshold value, determine that the current pixel point satisfies the condition for enabling the advanced filtering mode. Otherwise, it is determined that the current pixel point does not satisfy the condition for enabling the advanced filtering mode. For example, the edge strength of the edge to be filtered corresponding to the current pixel point is first determined. If the boundary strength is a predetermined second value, it is determined that the boundary strength satisfies the condition for enabling the advanced filtering mode. The predetermined second value is set based on experience, for example, it is set to be greater than 0, for example, equal to 1, 2, 3 or 4, etc.

[000167] In some embodiments of the invention, when the current pixel point satisfies the condition for enabling the advanced filtering mode, the refined pixel value of the current pixel point may be determined based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point, and then the refined pixel value of the current pixel point is taken as the target pixel value of the current pixel point (the final pixel value of the deblocking filtering process). If the current pixel point in the current block does not satisfy the condition for enabling the advanced filtering mode, the filtered pixel value of the current pixel point is not adjusted, but is taken as the target pixel value of the current pixel point (the final pixel value of the filtering process for deblocking).

[000168] From the above embodiments 1, 2, 3, 4 and 5, it can be seen that based on the advanced refinement mode, general filtering mode and advanced filtering mode used in the present disclosure, the original pixel value of the current pixel point is processed to obtain the target the pixel value of the current pixel point (i.e. the ending pixel value). For example, if the current pixel point satisfies the condition for enabling the extended refinement mode, the original pixel value of the current pixel point can be refined based on the gradient value of the current pixel point in the extended refinement mode to obtain the refined pixel value of the current pixel point, and the refined pixel value is taken as the target pixel value pixel values. Another example: if the current pixel point satisfies the general filtering mode enable condition but does not satisfy the advanced filtering mode enable condition, the original pixel value of the current pixel point can be filtered in the general filtering mode to obtain the filtered pixel value of the current pixel point, and the filtered pixel value is taken as the target pixel value. In another example, if the current pixel point satisfies both the general filtering mode enable condition and the advanced filtering mode enable condition, the original pixel value of the current pixel point is filtered in the advanced filtering mode to obtain the filtered pixel value of the current pixel point, and the original pixel value of the current point the pixel is refined based on the filtered pixel value of the current pixel point to obtain the refined pixel value of the current pixel point, and then the filtered pixel value is taken as the target pixel value.

[000169] In one possible implementation, deblocking filtering is performed on the current block, the original pixel value of the current pixel point in the current block may be processed based on an advanced refine mode, a general filtering mode, or an advanced filtering mode, namely, an advanced refine mode, a general mode The filtering mode and the advanced filtering mode refer to the deblocking filtering mode, that is, the advanced refinement mode, the general filtering mode and the advanced filtering mode may be sub-modes of the deblocking filtering mode. Based on this, the deblocking filtering mode can determine whether to use the advanced refine mode, or the general filtering mode, or the advanced filtering mode to process the original pixel value of the current pixel point.

[000170] Of course, the advanced refinement mode, the general filtering mode, and the advanced filtering mode may also refer to another type of filtering mode, for example, the SAO filtering mode or the ALF filtering mode, namely, the advanced refinement mode, the general filtering mode, and the advanced filtering mode may be submodes in SAO filtering mode or submodes in ALF filtering mode. Therefore, the SAO filtering mode or the ALF filtering mode may be determined to use the advanced refinement mode or the general filtering mode or the advanced filtering mode to process the original pixel value of the current pixel point.

[000171] In some embodiments of the invention, for example, the advanced refinement mode, the general filtering mode, and the advanced filtering mode refer to the deblocking filtering mode. Thus, the general filtering mode may be called the general mode of the deblocking filtering mode, namely, after the deblocking filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value, the pixel value is no longer adjusted. The advanced filtering mode can be called deblocking refinement mode (DBR), namely, after deblocking filtering is performed on the original pixel value of the current pixel point to obtain the filtered pixel value, pixel value refinement must also be performed. filtered through deblocking filtering. The advanced refinement mode may be referred to as an alternative deblocking refinement mode (ADBR), that is, without performing deblocking filtering on the original pixel value of the current pixel point, the original pixel value of the current pixel point is refined directly.

[000172] Embodiment 6: For Embodiments 1, 2 and 3, the original pixel value of the current pixel point can be refined based on the advanced refinement mode. Refining the original pixel value may include the following steps.

[000173] In step S21, based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point, the gradient value of the current pixel point is determined. For example, the gradient value of the current pixel point is determined based on the difference between the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point, which is not limited here.

[000174] In step S22, the pixel reference point corresponding to the current pixel point is determined from the neighboring block of the current block (for a vertical boundary, the neighboring block is the left neighboring block of the current block, and for a horizontal boundary, the neighboring block is the top neighboring block of the current block), and the value The gradient of the pixel reference point is determined based on the original pixel value of the pixel reference point and the original pixel value of the surrounding pixel point of the pixel reference point. For example, the gradient value of the pixel reference point may be determined based on the difference between the original pixel value of the pixel reference point and the original pixel value of the surrounding pixel point of the pixel reference point, which is not limited herein.

[000175] In some embodiments of the invention, the gradient value of the current pixel point is determined based on the original pixel value of the current pixel point and the original pixel value of the current pixel point's surrounding pixel point (e.g., the surrounding pixel point is the pixel anchor point), and the gradient value of the pixel anchor point determined based on the original pixel value of the surrounding pixel point of the pixel reference point (eg, the surrounding pixel point is the current pixel point) and the original pixel value of the pixel reference point.

[000176] For example, it is assumed that pi indicates the original pixel value of the current pixel point in the current block, that is, the original pixel value of the surrounding pixel point of the reference point of the pixel, and qi indicates the original pixel value of the reference point of the pixel in the adjacent block, namely the original pixel value surrounding the pixel point of the current pixel point, and in other words, pi and qi respectively indicate the original pixel values on both sides of the boundary. The gradient value DPi of the current pixel point pi can be determined as follows: DPi=(pi-qi+2) >> 2. The gradient value DQi of the reference pixel point qi can be determined as follows: DQi=(qi-pi+2) >> 2. Of course, the above is only an example of determining the gradient value of the current pixel point and the gradient value of the anchor pixel point, and no restrictions are made here. Obviously, the gradient value of the current pixel point is determined based on the difference between the original pixel value of the current pixel point and the original pixel value of the reference pixel point, and the gradient value of the pixel reference point is determined based on the difference between the original pixel value of the reference pixel point and the original pixel value of the current pixel point .

[000177] For example, when the current pixel point pi is equal to p0 (corresponding to R0 in FIG. 3) and the reference pixel point qi is equal to q0 (corresponding to L0 in FIG. 3), the gradient value DP0 of the current pixel point p0 is determined as follows: DP0= (p0-q0+2) >> 2; the gradient value DQ0 of the reference point of pixel q0 is determined as follows: DQ0=(q0-p0+2) >> 2. DP0=(p0-q0+2) >> 2 can also be expressed as DP0=(p0-q0+1) >> 1, and DQ0=(q0-p0+2) >> 2 can also be expressed as DQ0=(q0-p0+1) >> 1.

[000178] In step S23, the refined pixel value of the current pixel point is determined based on the gradient value of the current pixel point and the original pixel value of the current pixel point. For example, if the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value (also called the first refinement offset value). If the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. In some embodiments of the invention, the first refinement threshold and the second refinement threshold may be opposite to each other.

[000179] In step S24, the refined pixel value of the pixel reference point is determined based on the gradient value of the pixel reference point and the original pixel value of the pixel reference point. For example, if the gradient value of the pixel reference point is greater than the third refinement threshold value, the refined pixel value of the pixel reference point is determined based on the original pixel value of the pixel reference point and the third refinement offset value (also called the third refinement offset value). If the gradient value of the pixel reference point is smaller than the fourth refinement threshold value, the refined pixel value of the pixel reference point is determined based on the original pixel value of the pixel reference point and the fourth refinement offset value. In the example, the third refinement threshold value and the fourth refinement threshold value may be opposite numbers to each other.

[000180] For example, if the gradient value DPi of the current pixel point pi is greater than alt_dbr_th (alt_dbr_th represents the first refinement threshold value), the refined pixel value Pi of the current pixel point pi can be determined as follows: Pi=clip(pi+alt_dbr_offset0), where alt_dbr_offset0 represents the first refinement offset value. Alternatively, if the gradient value DPi of the current pixel point pi is less than -alt_dbr_th (-alt_dbr_th represents the second refinement threshold), the refined pixel value Pi of the current pixel point pi can be determined as follows: Pi=clip(pi+alt_dbr_offset1), where alt_dbr_offset1 represents the second refinement offset value.

[000181] In the above embodiment, i may be 0, 1 or 2. For example, i is 0, in which case, if DP0>dbr_th then P0=clip(p0+alt_dbr_offset0); if DP0<-dbr_th, then P0=clip(p0+alt_dbr_offset1).

[000182] For example, if the gradient value DQi of the reference point of pixel qi is greater than alt_dbr_th (alt_dbr_th is the third refinement threshold, and the third refinement threshold is the same as the first refinement threshold. In practical applications, the third refinement threshold may be different from the first threshold refinement value), the refined pixel value Qi of the reference point of pixel qi can be determined as follows: Qi=clip(qi+alt_dbr_offset0), where alt_dbr_offset0 represents the third refinement offset value. Here, the third refinement offset value is the same as the first refinement offset value. In practical applications, the third refinement offset value may also differ from the first refinement offset value.

[000183] Alternatively, if the gradient value DQi of the pixel reference point qi is less than alt_dbr_th (alt_dbr_th is the fourth refinement threshold, and the fourth refinement threshold is the same as the second refinement threshold. In practical applications, the fourth refinement threshold may be different from the second refinement threshold value), the refined pixel value Qi of the reference point of pixel qi can be determined as follows: Qi=clip(qi+alt_dbr_offset1), where alt_dbr_offset1 represents the fourth refinement offset value. Here, the fourth refinement offset value is the same as the second refinement offset value. In practical applications, the fourth refinement offset value may also differ from the second refinement offset value.

[000184] In the above embodiment, i can be 0, 1 or 2. For example, when i is 0, if DQ0>dbr_th then Q0=clip(q0+alt_dbr_offset0); if DQ0<dbr_th, then Q0=clip(q0+alt_dbr_offset1).

[000185] In the above embodiment, pi represents the original pixel point of the current pixel point, DPi represents the gradient value of the current pixel point, Pi represents the refined pixel value of the current pixel point, qi represents the original pixel value of the reference point of the pixel, DQi represents the gradient value of the reference point pixel, Qi represents the refined pixel value of the pixel reference point, clip(x) means that x is limited to within [0, 2^(bit depth)-1] (including 0 and 2^(bit depth)-1), a bit depth represents the bit depth of the image and is typically 8, 10, or 12, etc.

[000186] In one possible implementation for a decoder, a first refinement threshold value, a first refinement offset value, a second refinement offset value, a third refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block can be parsed from high-level syntax. Since the first refinement threshold value and the second refinement threshold value are opposite numbers of each other, and the third refinement threshold value and the fourth refinement threshold value are opposite numbers of each other, the decoder can determine the second refinement threshold value and the fourth refinement threshold value.

[000187] In another possible implementation for the decoder, the first refinement threshold value, the first refinement offset value, the second refinement offset value, the fourth refinement threshold value, the third refinement offset value, and the fourth refinement offset value corresponding to the current block can be parsed from the high-level syntax. Since the first refinement threshold value and the second refinement threshold value are opposite numbers of each other, and the third refinement threshold value and the fourth refinement threshold value are opposite numbers of each other, the decoder can determine the second refinement threshold value and the third refinement threshold value.

[000188] In another possible implementation for a decoder, a second refinement threshold value, a first refinement offset value, a second refinement offset value, a third refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block may be parsed from high-level syntax. Since the first refinement threshold value and the second refinement threshold value are opposite numbers of each other, and the third refinement threshold value and the fourth refinement threshold value are opposite numbers of each other, the decoder can determine the first refinement threshold value and the fourth refinement threshold value.

[000189] In another possible implementation for the decoder, the second refinement threshold value, the first refinement offset value, the second refinement offset value, the fourth refinement threshold value, the third refinement offset value, and the fourth refinement offset value corresponding to the current block can be parsed from the high-level syntax. Since the first refinement threshold value and the second refinement threshold value are opposite numbers of each other, and the third refinement threshold value and the fourth refinement threshold value are opposite numbers of each other, the decoder can determine the first refinement threshold value and the third refinement threshold value.

[000190] In another possible implementation for a decoder, a first refinement threshold (or a second refinement threshold, or a third refinement threshold, or a fourth refinement threshold, namely, from one refinement threshold the other three refinement thresholds can be derived), the first refinement offset value (or the third refinement offset value), the second refinement offset value (or the fourth refinement offset value) corresponding to the current block can be parsed from the high-level syntax. Therefore, since the first refinement threshold value and the second refinement threshold value are opposite numbers to each other, the second refinement threshold value can be determined. Since the first refinement threshold and the third refinement threshold are the same, a third refinement threshold can be determined. Since the third refinement offset value and the first refinement offset value are the same, the third refinement offset value can be determined. Since the fourth refinement offset value and the second refinement offset value are the same, the fourth refinement offset value can be determined. Since the third refinement threshold value and the fourth refinement threshold value are opposite numbers to each other, the fourth refinement threshold value can be determined.

[000191] Of course, the above are just a few examples, which are not limited to, provided that the decoder can obtain a first refinement threshold, a second refinement threshold, a third refinement threshold, a fourth refinement threshold, a first refinement offset value, a second value refinement offsets, a third refinement offset value, and a fourth refinement offset value. The values mentioned above can be obtained by analysis or inference.

[000192] In the above embodiment, the high-level syntax includes, but is not limited to, one of the following syntaxes: high-level SPS syntax, high-level PPS syntax, high-level image header syntax, high-level image syntax; high-level slice header syntax, high-level CTU syntax, and high-level CU syntax. Of course, the above are just a few examples of high-level syntaxes, and the types of high-level syntaxes are not limited here as long as the refinement threshold values and refinement offset values corresponding to the current block can be carried by the high-level syntaxes.

[000193] In the embodiments described above, the pixel value of the current pixel point in the current block may be a luma component or a chrominance component.

[000194] In one possible implementation, the extended refinement mode enable flag indicates whether to enable the extended refinement mode. If the enhanced refinement mode enable flag allows the current block to enable enhanced refinement mode, it is required to determine whether the current pixel point in the current block satisfies the enhanced refinement mode enable condition. If the current pixel point satisfies the condition for enabling the extended refinement mode, the original pixel value of the current pixel point is refined based on the extended refinement mode. If the enhanced refinement mode enable flag prohibits the current block from enabling the enhanced refinement mode, it is directly determined that each pixel point in the current block does not satisfy the enhanced refinement mode enable condition, and the original pixel value of the current pixel point is not adjusted based on the enhanced refinement mode. Therefore, if the enhanced refinement mode enable flag corresponding to the current block allows the current block to enable the enhanced refinement mode, it is determined whether the current pixel point in the current block satisfies the enhanced refinement mode enable condition. If the enhanced refinement mode enable flag corresponding to the current block prohibits the current block from enabling the enhanced refinement mode, it is determined that each pixel point in the current block does not satisfy the enhanced refinement enable condition.

[000195] In some embodiments of the invention, for a decoder, the extended refinement mode enable flag corresponding to the current block can be parsed from high-level syntax. For example, if the extended refinement mode enable flag has a first value (eg, 1), this indicates that the extended refinement mode enable flag allows the current block to enable extended refinement mode; if the extended refinement mode enable flag has a second value (eg, 0), this indicates that the extended refinement mode enable flag prevents the current block from enabling extended refinement mode.

[000196] In the above embodiment, the high-level syntax includes, but is not limited to, one of the following syntaxes: high-level SPS syntax, high-level PPS syntax, high-level image header syntax, high-level image syntax; high-level slice header syntax, high-level CTU syntax, and high-level CU syntax. Of course, the above are only a few examples of high-level syntaxes, and the types of high-level syntaxes are not limited here, as long as the extended refinement mode enable flag corresponding to the current block can be carried by high-level syntaxes.

[000197] Embodiment 7: For Embodiments 1 and 5, the original pixel value of the current pixel point can be refined based on the advanced filtering mode. Refining the original pixel value of the current pixel point may include the following steps.

[000198] In step S31, filtering is performed to deblock the original pixel value of the current pixel point to obtain a filtered pixel value of the current pixel point.

[000199] In step S32, the pixel reference point corresponding to the current pixel point is determined from the neighboring block of the current block (for a vertical boundary, the neighboring block is the left neighboring block of the current block, and for a horizontal boundary, the neighboring block is the top neighboring block of the current block), and filtering to deblock, perform on the original pixel value of the pixel reference point to obtain the filtered pixel value of the pixel reference point.

[000200] In some embodiments of the invention, deblocking filtering is performed on the original pixel value of the current pixel point based on deblocking filtering (DBF) to obtain the filtered pixel value of the current pixel point, and deblocking filtering is performed on the original pixel value of the reference pixel point based on DBF to obtain the filtered pixel value of the pixel reference point. Of course, filtering may also be performed on the original pixel value of the current pixel point based on the SAO to obtain a filtered pixel value of the current pixel point, and filtering is performed on the original pixel value of the reference pixel point based on the SAO to obtain the filtered pixel value of the reference pixel point. Alternatively, filtering may be performed on the original pixel value of the current pixel point based on the ALF to obtain a filtered pixel value of the current pixel point, and filtering is performed on the original pixel value of the reference pixel point based on the ALF to obtain the filtered pixel value of the reference pixel point. For ease of description, in subsequent embodiments of the invention, for example, deblocking filtering is performed on the original pixel value of the current pixel point and the reference pixel point based on the DBF.

[000201] With reference to FIG. 3, depending on the position of the current pixel point, only horizontal DBF filtering is performed on the current pixel point and the pixel reference point, or only vertical DBF filtering is performed on the current pixel point and the pixel reference point, or first, vertical DBF filtering is performed on the current pixel point and at the pixel reference point, and then performs horizontal DBF filtering at the current pixel point and at the pixel reference point.

[000202] In step S33, based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point, the refined pixel value of the current pixel point is determined. For example, based on the filtered pixel value of the current pixel point, the original pixel value of the current pixel point, the first filtering threshold value, the second filtering threshold value, the first filtering offset value and the second filtering offset value, the refined pixel value of the current pixel point is determined. The first filter threshold value and the second filter threshold value may be opposite numbers to each other.

[000203] In step S34, based on the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point, the refined pixel value of the pixel reference point is determined. For example, based on the filtered pixel value of the pixel reference point, the original pixel value of the pixel reference point, the third filter threshold value, the fourth filter threshold value, the third filter offset value and the fourth filter offset value, the refined pixel value of the pixel reference point is determined. The third filter threshold value and the fourth filter threshold value may be opposite numbers to each other.

[000204] In some embodiments of the invention, if the current pixel point satisfies only the general filtering mode enable condition but does not satisfy the advanced filtering mode enable condition, steps S31 and S32 are performed to take the filtered pixel value as the target pixel value (final pixel value filtering process to remove blocking). If the current pixel point satisfies both the general filtering mode enable condition and the advanced filtering mode enable condition, steps S31 to S34 are performed to take the refined pixel value as the target pixel value (the final pixel value of the deblocking filtering process).

[000205] In steps S33 and S34, advanced filtering processing may be performed on the original pixel value of the pixel point based on the filtered pixel value and the unfiltered original pixel value, namely, advanced filtering processing is performed on the original pixel value of the pixel point to obtain the advanced filtered refined pixel value, such that the refined pixel value filtered by advanced filtering is closer to the real pixel than the filtered pixel value. Therefore, the filtered pixel value is avoided to be much larger or much smaller than the actual pixel of the pixel point due to excessive filtering, which improves image quality.

[000206] In some embodiments of the invention for step S33, if the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point is greater than the first filtering threshold value, the refined pixel value of the current pixel point may be determined based on the filtered pixel value of the current pixel point. pixel point, the original pixel value of the current pixel point, and the first filter offset value. If the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point is less than the second filtering threshold value, the refined pixel value of the current pixel point can be determined based on the filtered pixel value of the current pixel point, the original pixel value of the current pixel point and the second offset value filtration.

[000207] For example, it is assumed that Y ₁ (i) represents the original pixel value of the current pixel point, Y ₂ (i) represents the filtered pixel value of the current pixel point, Y ₃ (i) represents the refined pixel value of the current pixel point, and Y _v (i)=(Y ₁ (i)+Y ₂ (i)+1) >> 1.

[000208] Thus, if Y ₁ (i)-Y ₂ (i)>T _v , then if Y ₁ (i)-Y ₂ (i)<NT _v , then In the above formulas, T _v represents the first filtering threshold value, represents the first filtering offset value, NT _V represents the second filtering threshold value, represents the second filter offset value, NT _V is usually set to - T _v or other value, clip(x) represents x within a predefined range of values, which is usually [0, 2 ^D - 1], where D is the bit depth of the image . For an 8-bit image, the range is [0, 255], and for a 10-bit image, the range is [0, 1023].

[000209] To prevent the advanced filtered refined pixel value from exceeding the range of pixel values, when the refined pixel value is received, the refined pixel value may be clipped to a predetermined range of values using a Clip operation. When the refined pixel value exceeds the upper limit of the predetermined value range, the refined pixel value is set equal to the upper limit of the predetermined value range; when the refined pixel value is less than the lower limit of the predetermined value range, the refined pixel value is set equal to the lower limit of the predetermined value range. For example, for an 8-bit image, when the refined pixel value is less than 0, the refined pixel value is set to 0; when the refined pixel value is greater than 255, the refined pixel value is set to 255.

[000210] In some embodiments of the invention, for step S34, if the difference between the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point exceeds the third filtering threshold value, the refined pixel value of the pixel reference point is determined based on the filtered pixel value of the pixel reference point, the original pixel value of the pixel reference point and the third filter offset value. If the difference between the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point is less than the fourth filtering threshold value, the refined pixel value of the pixel reference point is determined based on the filtered pixel value of the pixel reference point, the original pixel value of the pixel reference point and the fourth filtering offset value. The method for determining the refined pixel value of a reference pixel point is similar to the method for determining the refined pixel value of the current pixel point and will not be repeated here.

[000211] In some embodiments of the invention, the third filtering threshold and the first filtering threshold may be the same or different; the third filter offset value and the first filter offset value may be the same or different; the fourth filtering threshold value and the second filtering threshold value may be the same or different; and the fourth filter offset value and the second filter offset value may be the same or different.

[000212] In one possible implementation for a decoder, a first filtering threshold value, a first filtering offset value, a second filtering offset value, a third filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block may be parsed from high-level syntax. Since the first filtering threshold value and the second filtering threshold value are opposite numbers to each other, and the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the decoder can determine the second filtering threshold value and the fourth filtering threshold value.

[000213] In another possible implementation for a decoder, a first filtering threshold value, a first filtering offset value, a second filtering offset value, a fourth filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block may be parsed from high-level syntax. Since the first filtering threshold value and the second filtering threshold value are opposite numbers to each other, and the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the decoder can determine the second filtering threshold value and the third filtering threshold value.

[000214] In another possible implementation for a decoder, a second filtering threshold value, a first filtering offset value, a second filtering offset value, a third filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block may be parsed from high-level syntax. Since the first filtering threshold value and the second filtering threshold value are opposite numbers to each other, and the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the decoder can determine the first filtering threshold value and the fourth filtering threshold value.

[000215] In one possible implementation for a decoder, a second filtering threshold value, a first filtering offset value, a second filtering offset value, a fourth filtering threshold value, a third filtering offset value, and a fourth filtering offset value corresponding to the current block may be parsed from high-level syntax. Since the first filtering threshold value and the second filtering threshold value are opposite numbers to each other, and the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the decoder can determine the first filtering threshold value and the third filtering threshold value.

[000216] In another possible implementation for a decoder, a first filtering threshold (or a second filtering threshold, or a third filtering threshold, or a fourth filtering threshold, namely, the other three filtering thresholds may be derived from one filtering threshold), the first filtering offset threshold value (or the third filtering offset value), the second filtering offset value (or the fourth filtering offset value) corresponding to the current block can be parsed from the high-level syntax. Therefore, since the first filtering threshold value and the second filtering threshold value are opposite numbers to each other, the second filtering threshold value can be determined. Since the first filtering threshold value and the third filtering threshold value are the same, a third filtering threshold value can be determined. Since the third filter offset value and the first filter offset value are the same, the third filter offset value can be determined. Since the fourth filter offset value and the second filter offset value are the same, the fourth filter offset value can be determined. Since the third filtering threshold value and the fourth filtering threshold value are opposite numbers to each other, the fourth filtering threshold value can be determined.

[000217] Of course, the above are just a few examples, which are not limited to, provided that the decoder can obtain a first filtering threshold value, a second filtering threshold value, a third filtering threshold value, a fourth filtering threshold value, a first filtering offset value, a second value a filtering offset, a third filtering offset value, and a fourth filtering offset value. The values mentioned above can be obtained by analysis or inference.

[000218] In the above embodiment, the high-level syntax includes, but is not limited to, one of the following syntax: high-level SPS syntax, high-level PPS syntax, high-level image header syntax, high-level image syntax, high-level slice header syntax, high-level CTU syntax, and high-level syntax xis C.U. Of course, the above are only a few examples of high-level syntaxes, and the types of high-level syntaxes are not limited here, as long as the filtering threshold values and filtering offset values corresponding to the current block can be carried by the high-level syntaxes.

[000219] In the above embodiment of the invention, the pixel value of the current pixel point in the current block may be a luma component or a chrominance component.

[000220] In one possible implementation, the advanced filtering mode enable flag indicates whether to enable the advanced filtering mode. If the advanced filtering mode enable flag allows the current block to enable advanced filtering mode, it is necessary to determine whether the current pixel point in the current block satisfies the condition for enabling advanced filtering mode. If the current pixel point satisfies the condition for enabling the advanced filtering mode, the original pixel value of the current pixel point is refined based on the advanced filtering mode. If the advanced filtering mode enable flag prohibits the current block from enabling the advanced filtering mode, it is directly determined that each pixel point in the current block does not satisfy the advanced filtering mode enabling condition, and the original pixel value of the current pixel point is not adjusted based on the advanced filtering mode. Therefore, if the advanced filtering mode enable flag corresponding to the current block allows the current block to enable the advanced filtering mode, it is determined whether the current pixel point in the current block satisfies the advanced filtering mode enabling condition. If the advanced filter mode enable flag corresponding to the current block prohibits the current block from enabling the advanced filter mode, it is determined that each pixel point in the current block does not satisfy the advanced filter mode enable condition.

[000221] For example, for a decoder, the advanced filter mode enable flag corresponding to the current block can be parsed from high-level syntax. For example, if the advanced filtering mode enable flag is the first value (eg, 1), this indicates that the advanced filtering mode enable flag allows the current block to enable the advanced filtering mode; if the advanced filtering mode enable flag has a second value (eg, 0), this indicates that the advanced filtering mode enable flag prevents the current block from enabling the advanced filtering mode.

[000222] In the above embodiment, the high-level syntax includes, but is not limited to, one of the following syntax: high-level SPS syntax, high-level PPS syntax, high-level image header syntax, high-level image syntax, high-level slice header syntax, high-level CTU syntax, and high-level syntax xis C.U. Of course, the above are just a few examples of high-level syntaxes, and the types of high-level syntaxes are not limited here, as long as the advanced filter mode enable flag corresponding to the current block can be carried by high-level syntaxes.

[000223] Embodiment 8: When the general filtering mode enable condition is satisfied, deblocking filtering can be performed on the original pixel value of a pixel point based on the DBF filtering mode (deblocking filtering mode). Since DBF filtering includes vertical DBF filtering and horizontal DBF filtering, deblocking filtering can be performed on the original pixel value of a pixel point in the following steps.

[000224] In step 1, the filtered pixel Y ₂ (i) value is obtained by performing vertical DBF filtering on the original pixel Y ₁ (i) value.

[000225] In step 2, the filtered pixel Y ₃ (i) value is obtained by performing horizontal DBF filtering on the pixel Y ₂ (i) value.

[000226] In some embodiments of the invention, if only vertical DBF filtering is performed on a pixel point, only step 1 is performed to obtain the filtered pixel value for the pixel point; if only horizontal DBF filtering is performed on a pixel point, only step 2 is performed to obtain the filtered pixel value of the pixel point, where the Y ₂ (i) pixel value of step 2 is replaced by the original pixel value of the pixel point. If vertical DBF filtering is performed at a pixel point first, and then horizontal DBF filtering is performed at a pixel point, steps 1 and 2 are performed sequentially.

[000227] When the general filtering mode enable condition and the advanced filtering mode enable condition are both satisfied, deblocking filtering can be performed on the original pixel value of the pixel point based on the DBF filtering (deblocking filtering) mode and then filtered by the deblocking filter the value of the filtered pixel is clarified. Since DBF filtering includes vertical DBF filtering and horizontal DBF filtering, deblocking filtering can be performed on the original pixel value of a pixel point, and the pixel value filtered by the deblocking filter is refined in the following steps.

[000228] In step 1, the filtered pixel Y ₂ (i) value is obtained by performing vertical DBF filtering on the original pixel Y ₁ (i) value.

[000229] In step 2, the refined Y ₃ (i) value of the pixel is obtained based on Y ₂ (i) - Y ₁ (i).

[000230] In step 3, the filtered pixel Y ₄ (i) value is obtained by performing horizontal DBF filtering on the Y ₃ (i) pixel value.

[000231] In step 4, the refined pixel Y ₅ (i) value is obtained based on Y ₄ (i) - Y ₃ (i).

[000232] In some embodiments of the invention, if only vertical DBF filtering is performed on a pixel point, only steps 1 and 2 are performed to obtain a refined pixel value for the pixel point. If only horizontal DBF filtering is performed on a pixel point, only steps 3 and 4 are performed to obtain a refined pixel value for the pixel point, where the pixel Y ₃ (i) value of step 3 is replaced by the original pixel point value. If vertical DBF filtering is performed at a pixel point first, and then horizontal DBF filtering is performed at a pixel point, steps 1, 2, 3, and 4 are performed sequentially. If you first do horizontal DBF filtering at a pixel point and then do vertical DBF filtering at a pixel point, the steps are similar and will not be repeated here.

[000233] In some embodiments, steps 2 and 4 are an advanced filtering mode processing procedure when the advanced filtering mode enable condition is satisfied, namely a process of adjusting the filtered pixel value to obtain a refined pixel value.

[000234] In step 2, it is assumed that Y _v (i)=(Y ₁ (i)+Y ₂ (i)+1) >> 1. If Y ₁ (i)-Y ₂ (i)>T _v , That if Y ₁ (i)-Y ₂ (i)<NT _V , then and otherwise Y ₃ (i)=Y ₂ (i) (in one embodiment, in this case Y ₃ (i) can be obtained by filtering Y ₂ (i), for example,

[000235] In some embodiments, clip(x) represents that x is limited to a predetermined range of image values, which is typically [0, 2 ^D -1], where D represents the bit depth of the image. For an 8-bit image, the range of image values can be [0, 255]; for a 10-bit image, the range of image values is [0, 1023]. The threshold value NT _V is usually set equal to - T _v or other value.

[000236] Similar to step 2, in step 4, assuming that Y _h (i)=(Y ₃ (i)+Y ₄ (i)+1) >> 1, if Y ₄ (i)-Y ₃ ( i)>T _h , then if Y ₁ (i)-Y ₂ (i)<NT _h , then and otherwise Y ₅ (i)=Y ₄ (i) (in one embodiment, in this case Y ₅ (i) can be obtained by filtering Y ₄ (i); for example, where NT _h usually has the value - T _h or other value. [000237] In the above embodiment, Tv and NT _v represent filtering threshold values, f0v, f1v and f2v represent filtering offset values, and clip(x) represents a value of x limited within a predetermined range of values. For example, Tv refers to the above-mentioned first filtering threshold and the third filtering threshold (for example, the first filtering threshold and the third filtering threshold are the same), NTv refers to the above-mentioned second filtering threshold and the fourth filtering threshold (for example, the second filtering threshold and the fourth filtering threshold value are the same), f0v refers to the above-mentioned first filtering offset value and the third filtering offset value (for example, the first filtering offset value and the third filtering offset value are the same), and f1v refers to the above-mentioned second filtering offset value and the fourth filtering offset value (eg, the second filter offset value and the fourth filter offset value are the same). NTv=-Tv, where Tv and NTv are numbers opposite to each other.

[000238] In the above embodiment, Th and NTh are filtering threshold values, f0h, f1h and f2h are filtering offset values, and clip(x) represents that the value of x is limited within a predetermined range of values. For example, Th refers to the above-mentioned first filtering threshold and the third filtering threshold (for example, the first filtering threshold and the third filtering threshold are the same), NTh refers to the above-mentioned second filtering threshold and the fourth filtering threshold (for example, the second filtering threshold and the fourth filtering threshold value are the same), f0h refers to the above-mentioned first filtering offset value and the third filtering offset value (for example, the first filtering offset value and the third filtering offset value are the same), and f1h refers to the above-mentioned second filtering offset value and the fourth filtering offset value (eg, the second filter offset value and the fourth filter offset value are the same). NTh=-Th, where Th and NTh are numbers opposite to each other.

[000239] Embodiment 9: In DBF, if filtering is performed only based on a set rule, over-filtering or under-filtering will occur. For example, if the reconstruction value before DBF is Y1 and the pixel value after DBF is Y2, classification can be performed based on Y2-Y1. Classification based on the filter residual has the following main advantages: For some pixel values that are over-filtered or pseudo-filtered, special expansion can be performed to make the pixels of these classes closer to the original value. Over-filtering refers to Y2 being much larger (or much smaller) than Y1, and therefore Y2 being much larger (or much smaller) than the original pixel value. Pseudo-filtering refers to Y2-Y1 being 0 or close to 0, namely, these pixel values remain unchanged after filtering, so that the filtering effect cannot be achieved. For the above detection, in the present embodiment of the invention, the pixel value of the pixel point can be refined based on the extended refinement mode, namely, if the extended refinement mode is enabled for the current pixel point in the current block, the original pixel value of the current pixel point is refined based on the extended refinement mode. rather than general filtering mode or advanced filtering mode.

[000240] In one possible implementation, the process of refining the original pixel value may include the following steps.

[000241] In step 1, the filtered pixel Y ₂ (i) value is obtained by performing vertical DBF filtering on the original pixel Y ₁ (i) value.

[000242] In step 2, the refined Y ₃ (i) value of the pixel is obtained based on Y ₂ (i) - Y ₁ (i).

[000243] In step 3, the filtered pixel Y ₄ (i) value is obtained by performing horizontal DBF filtering on the pixel Y ₃ (i) value.

[000244] In step 4, the refined pixel value Y ₅ (i) is obtained based on Y ₄ (i)-Y ₃ (i).

[000245] In step 2, the following two cases are possible: abs(Y ₂ (i)-Y ₁ (i))< threshold value and abs(Y ₂ (i)-Y ₁ (i)) not less than the threshold value. If abs(Y ₂ (i)-Y ₁ ((i))< threshold value, the following two cases may occur: BS is equal to 0 and BS is greater than 0. In some embodiments of the invention, the threshold value may be the above first filtering threshold value or a second filtering threshold value, wherein, for example, the first filtering threshold value and the second filtering threshold value are opposite numbers of each other. If the first filtering threshold value is a positive value, the threshold value may be the first filtering threshold value if the second filtering threshold value is; a positive value, the threshold value may be a second filtering threshold value.

[000246] Finally, the process of refining the original pixel value may include the following three cases.

[000247] Case 1: When BS is 0, no filtering is performed (i.e., Y ₂ (i) is equal to Y ₁ (i), which is equivalent to not performing vertical DBF filtering on the original pixel value Y ₁ (i), namely, step 1), but the original _Y1 (i) value of the pixel can be refined based on the advanced refinement mode to obtain the refined pixel value.

[000248] Case 2: When BS is greater than 0 and abs(Y ₂ (i)-Y ₁ (0) < threshold value, filtering can be performed (i.e., performing vertical DBF filtering on the original Y ₁ (i) pixel value , namely the execution of step 1). Based on the execution of step 1, the filtered pixel Y ₂ (i) value can be refined based on the advanced filtering mode to obtain the refined pixel point Y ₃ (i) value.

[000249] Case 3: When BS is greater than 0 and abs(Y ₂ (i)-Y ₁ (i)) is not less than the threshold value, filtering can be performed (i.e., performing vertical DBF filtering on the original value Y ₁ (i ) pixel, namely the execution of step 1). Based on the execution of step 1, the filtered pixel value Y ₂ (i) is no longer refined based on the advanced filtering mode, and specifically step 2 is no longer performed, that is, Y ₃ (i)=Y ₂ (i).

[000250] In step 4, the following two cases are possible: abs(Y4(i)-Y3(i))< threshold value and abs(Y4(i)-Y3(i)) not less than threshold value. If abs(Y4(i)-Y3(i))<threshold value, then the following two cases are possible: BS is equal to 0 and BS is greater than 0.

[000251] Finally, the process of refining the original pixel value may include the following three cases.

[000252] Case 1: When BS is 0, no filtering is performed (i.e., Y ₄ (i) is equal to Y ₃ (i), which is equivalent to not performing horizontal DBF filtering on the original pixel value Y ₃ (i), namely step 3), but the original Y ₃ (i) value of the pixel can be refined based on the advanced refinement mode to obtain the refined pixel value.

[000253] Case 2: When BS is greater than 0 and abs(Y4(i)-Y3(i))<threshold, filtering can be performed (i.e., performing horizontal DBF filtering on the original Y value ₃ (i) pixel , namely the execution of step 3). Based on the execution of step 3, the filtered pixel value _Y4 (i) of the pixel point can be refined based on the advanced filtering mode to obtain the refined pixel value Y3(i) of the pixel point.

[000254] Case 3: When BS is greater than 0 and abs(Y4(i)-Y3(i)) is not less than the threshold value, filtering can be performed (i.e., performing horizontal DBF filtering on the original value Y ₃ (i) pixel, namely, performing step 3). Based on the execution of step 3, the filtered pixel value Y ₄ (i) is not adjusted based on the advanced filtering mode, namely, step 4 is not performed, that is, Y ₅ (i)=Y ₄ (i).

[000255] Finally, if BS is 0, processing is performed based on the extended refinement mode, namely, filtering may not be performed, that is, Y ₂ (i)=and Y ₄ (i)=Y ₃ (i). Based on this, Y ₁ (i) can be refined based on the extended refinement mode, and Y ₃ (i) can also be refined based on the extended refinement mode. Therefore, DBF filtering can be performed in the following steps.

[000256] In step 1, a filtered pixel Y ₂ (i) value is obtained by performing vertical DBF filtering on the original pixel Y ₁ (ii) value.

[000257] In step 2, if BS is 0, Y ₁ (i) is refined based on the extended refine mode to obtain a refined pixel Y ₃ (i) value. If BS is greater than 0 and abs(Y ₂ (i)-Y ₁ (i)<< threshold value, enable advanced filtering mode to obtain a refined Y ₃ (i) pixel value based on Y ₂ (i)-Y1(i), as shown in Step 2 of Embodiment 8. If BS is greater than 0 and abs(Y ₂ (i)-Y ₁ (i)) is not less than the threshold value, the general filtering mode is enabled to no longer refine the filtered pixel value Y ₂ ( i), namely Y ₃ (i)=Y ₂ (i).

[000258] In some embodiments of the invention, if BS is 0, the step is not actually performed, namely, the filtered Y ₂ (i) pixel value is not required to be obtained.

[000259] In step 3, the filtered pixel Y ₄ (i) value is obtained by performing horizontal DBF filtering on the pixel Y ₃ (i) value.

[000260] In step 4, if BS is 0, Y ₃ (i) refinement is performed based on the extended refine mode to obtain the refined pixel Y ₅ (i) value. If BS is greater than 0 and abs(Y4(i)-Y3(i))< threshold value, enable advanced filtering mode to obtain refined _Y3 (i) value of pixel based on _Y4 (i) _-Y3 (i) as shown in step 4 of embodiment 8 of the invention. If BS is greater than 0 and abs(Y4(i)-Y3(i)) is not less than the threshold value, turn on the general filtering mode so as not to further refine the filtered value Y ₄ (i) of the pixel, namely Y ₅ (i)=Y ₄ (i).

[000261] In some embodiments of the invention, if BS is 0, step 3 is not actually performed, namely, the filtered pixel Y ₄ (i) value is not required to be obtained.

[000262] In another possible implementation, if BS is greater than 0, filtering is performed, but abs(Y ₂ (i)-Y ₁ (i)) < threshold value after filtering. In this case, an advanced filtering mode is used for processing, namely DBF filtering can be performed in the following stages.

[000263] In step 1, a filtered pixel Y ₂ (i) value is obtained by performing vertical DBF filtering on the original pixel Y ₁ (i) value.

[000264] In step 2, if BS is greater than 0 when abs(Y ₂ (i)-Y ₁ (i))<threshold value is still satisfied after performing vertical DBF filtering on Y ₁ (i), the refined Y value is obtained ₃ (i) pixels based on advanced filtering mode. For example, Y ₃ (i) is obtained as Y ₁ (i) plus the compensation value. Otherwise, if abs(Y ₂ (i)-Y ₁ (i)) is not less than the threshold, Y ₃ (i)=Y ₂ (i).

[000265] In step 3, the filtered pixel Y ₄ (i) value is obtained by performing horizontal DBF filtering on the pixel Y ₃ (i) value.

[000266] In step 4, if BS is greater than 0 when abs(Y ₄ (i)-Y ₃ (i))< threshold value is still satisfied after performing horizontal DBF filtering on Y ₃ (i), the refined Y value is obtained ₅ (i) pixels based on advanced filtering mode. For example, Y ₅ (i) is obtained as Y ₃ (i) plus the compensation value. Otherwise, if abs(Y4(i)-Y3(i)) is not less than the threshold value, then Y ₅ (i)=Y ₄ (i).

[000267] Embodiment 10: For Embodiment 9, if BS is 0, Y ₁ (i) is refined based on the advanced refine mode to obtain a refined pixel Y ₃ (i) value. The specific refinement process can be provided in the following steps. If BS is 0, Y ₃ (i) is refined based on the extended refine mode to obtain a refined pixel Y ₃ (i) value. This process is similar to the process of obtaining the refined Y ₃ (i) pixel value and therefore will not be repeated here.

[000268] First, the gradient value Y ₁ (i) is determined, where Y ₁ (i) may be the original pixel value of the current pixel point or the original pixel value of the reference pixel point. For a vertical boundary, the value of the horizontal gradient DY ₁ (i) for Y ₁ (i) can be calculated; for a horizontal boundary, the value of the vertical gradient DY ₁ (i) for Y ₁ (i) can be calculated. For example, if pi and qi respectively represent the original pixel value of the current pixel point and the original pixel value of the reference pixel point (corresponding to Y ₁ (i)), the gradient value DP0 of the original pixel value pi of the current pixel point is calculated by the following formula: DP0=(pi- qi+2) >>2; the gradient value DQ0 of the original pixel value qi of the pixel reference point is calculated using the following formula: DQ0=(qi-pi+2)>>2.

[000269] Next, based on the size of DY ₁ (i), Y ₃ (i) is obtained by refining the compensation. For example, the refined value Pi of a pixel corresponding to the original value pi of the current pixel point is determined as follows: if DPi>alt_dbr_th, then Pi=clip(pi+alt_dbr_offset0); if DPi<alt_dbr_th, then Pi=clip(pi+alt_dbr_offset1), where i is 0, 1, 2, etc. The refined pixel Qi value corresponding to the original pixel qi value of the pixel reference point is determined as follows: if DQi>alt_dbr_th, then Qi=clip(qi+alt_dbr_offset0); if DQi<-alt_dbr_th, then Qi=clip(qi+alt_dbr_offset1), where i is 0, 1 or 2.

[000270] In the above formulas, alt_dbr_th refers to the first refinement threshold and the third refinement threshold (e.g., the third refinement threshold and the first refinement threshold are the same), alt_dbr_offset0 refers to the first refinement offset value and the third refinement offset value (e.g., the first the refinement offset value and the third refinement offset value are the same), alt_dbr_offset1 refers to the second refinement offset value and the fourth refinement offset value (for example, the second refinement offset value and the fourth refinement offset value are the same), -alt_dbr_th refers to the second refinement threshold value and the fourth refinement value refinements (for example, the second refinement threshold and the fourth refinement threshold are the same), and -alt_dbr_th and alt_dbr_th are opposite numbers to each other.

[000271] Embodiment 11: The extended refinement mode is controlled to be enabled by high-level syntax (eg, high-level SPS syntax). For example, the adbr_enable_flag is encoded/decoded in the sequence header, namely, the encoder encodes the adbr_enable_flag flag in the sequence header, and the decoder decodes the adbrenableflag flag in the sequence header, adbrenableflag is a binary variable, with a value of "1" indicating the availability of the extended refinement mode. and a value of "0" indicates that advanced refinement mode is not available. The AdbrEnableFlag value is adbr_enable_flag. If there is no adbr_enable_flag in the bitstream, the value of AdbrEnableFlag is 0.

[000272] Finally, for the decoder, the advanced refinement mode enable flag (ie, AdbrEnableFlag) corresponding to the current block can be parsed from high-level syntax. If the value of the extended refinement mode enable flag is 1, this indicates that the extended refinement mode enable flag allows the current block to enable the extended refinement mode; If the value of the extended refinement mode enable flag is 0, this indicates that the extended refinement mode enable flag prevents the current block from enabling the extended refinement mode.

[000273] Embodiment 12: The extended filter mode and the extended refine mode are controlled simultaneously so that they can be enabled using high-level syntax (eg, high-level SPS syntax). For example, the dbr_enable_flag is encoded/decoded in the sequence header, namely, the encoder encodes the dbr_enable_flag in the sequence header, and the decoder decodes the dbr_enable_flag in the sequence header.

[000274] dbr_enable_flag is a binary variable where a value of "1" indicates the use of the advanced filtering mode and enabling the advanced refinement mode, and a value of "0" indicates the use of the advanced filtering mode and disabling the advanced refinement mode. The value of DbrEnableFlag is dbr_enable_flag. If there is no dbr_enable_flag in the bitstream, the value of DbrEnableFlag is 0.

[000275] Finally, for the decoder, the extended filtering mode enable flag and the extended refinement mode enable flag (i.e., DbrEnableFlag, which is used as the extended filtering mode enable flag and the extended refinement mode enable flag at the same time) corresponding to the current block can be analyzed from high-level syntax. If the value of DbrEnableFlag is 1, it indicates that the current block is allowed to enable advanced filtering mode and advanced refinement mode; if the value of DbrEnableFlag is 0, it indicates that the current block is not allowed to enable advanced filtering mode and advanced refinement mode.

[000276] Embodiment 13: Reference may be made to Table 1 to express high-level syntax (for example, high-level image header syntax), for example, the image header encoding/decoding syntax shown in Table 1. The encoder encodes in the image header the syntax shown in Table 1, and the decoder decodes in the picture header the syntax shown in Table 1.

[000277] The meanings of the corresponding syntaxes in Table 1 are described below.

[000278] The image-level vertical deblocking refinement enable flag is represented as picture_dbr_v_enable_flag, which is a binary variable where a value of "1" indicates that the current image enables vertical deblocking filtering refinement and a value of "0" indicates that the current image prohibits the use of vertical filtering refinement to remove blocking. The value of Picture_dbr_v_enable_flag is equal to the value of picture_dbr_v_enable_flag. If there is no picture_dbr_v_enable_flag in the bitstream, the value of PhDbrVEnableFlag is 0.

[000279] In some embodiments, for the enhanced refinement mode, Picture_dbr_v_enable_flag corresponds to the enhanced refinement enable flag and is the enhanced refinement enable flag for vertical DBF filtering. In other words, when vertical DBF filtering is to be performed, Picture_dbr_v_enable_flag indicates whether the enhanced refinement mode is enabled or whether the enhanced refinement mode is disabled.

[000280] In some embodiments, for the enhanced filtering mode, Picture_dbr_v_enable_flag corresponds to the enhanced filtering mode enable flag and is the enhanced filtering mode enable flag for vertical DBF filtering. In other words, when vertical DBF filtering is to be performed, Picture_dbr_v_enable_flag indicates whether to enable the advanced filtering mode or to disable the enabling of the advanced filtering mode.

[000281] Finally, Picture_dbr_v_enable_flag may represent an enhanced refine mode enable flag for vertical DBF filtering and an enhanced filter mode enable flag for vertical DBF filtering. In other words, the advanced refinement mode enable flag and the advanced filtering mode enable flag have the same flag, namely, the current image allows the advanced refinement mode and the advanced filtering mode to be turned on at the same time, or disables the advanced refinement mode and the advanced filtering mode to be turned on at the same time.

[000282] The deblocking vertical refinement filtering threshold value is represented as dbr_v_threshold_minus1 and is used to determine the vertical refinement filtering threshold value for deblocking the current image, where the threshold value is in the range from 0 to 1. The value of DbrVThreshold is equal to the value of dbr_v_threshold_minus1+1. If there is no dbr_v_threshold_minus1 in the bitstream, the value of DbrVThreshold is 0.

[000283] In some embodiments of the invention for the advanced refinement mode, DbrVThreshold corresponds to the first refinement threshold (eg, the third refinement threshold and the first refinement threshold are the same) and is the first refinement threshold for vertical DBF filtering. In other words, when vertical DBF filtering is to be performed, DbrVThreshold represents the first refinement threshold value in the above-described embodiment of the invention. In addition, the second refinement threshold value (for example, the fourth refinement threshold value and the second refinement threshold value are the same) and the first refinement threshold value in the above embodiment of the invention are opposite numbers to each other, and thus the second refinement threshold value can be determined based on DbrVThreshold.

[000284] In some embodiments of the invention for the advanced filtering mode, DbrVThreshold corresponds to the first filtering threshold (eg, the third filtering threshold and the first filtering threshold are the same) and is the first filtering threshold for vertical DBF filtering. In other words, when vertical DBF filtering is to be performed, DbrVThreshold represents the first filtering threshold value in the above embodiment. In addition, the second filtering threshold value (for example, the fourth filtering threshold value and the second filtering threshold value are the same) in the above-described embodiment and the first filtering threshold value are opposite numbers to each other, and thus the second filtering threshold value can be determined based on DbrVThreshold.

[000285] Finally, DbrVThreshold may represent a first refinement threshold and a first filtering threshold for vertical DBF filtering, and in other words, the first refinement threshold and the first filtering threshold are the same and may have the same value.

[000286] The deblocking filtering vertical refinement offset value 0 (dbr_v_offset0_minus1) is used to determine the deblocking filtering vertical refinement offset value 0 of the current image, which takes a value from 0 to 3. The value of DbrVOffset0 is equal to a negative value, which is equal to the opposite number of the result amounts dbr_v_offset0_minus1+1. If there is no dbr_v_offset0_minus1 in the bitstream, the value of DbrVOffset0 is 0.

[000287] In some embodiments of the invention for the advanced filtering mode, DbrVOffset0 corresponds to the first filtering offset value (eg, the third filtering offset value and the first filtering offset value are the same) and is the first filtering offset value for vertical DBF filtering. When vertical DBF filtering is to be performed, DbrVOffset0 represents the first filtering offset value in the above-described embodiment of the invention.

[000288] The deblocking filtering vertical refinement offset value 1 (dbr_v_offset1_minus1) is used to determine the deblocking filtering vertical refinement offset value 1 of the current image, which takes values from 0 to 3. The value of DbrVOffset1 is equal to the value of dbr_v_offset1 minus1+1. If there is no dbr_v_offset1_minus1 in the bitstream, the value of DbrVOffset1 is 0.

[000289] In some embodiments, for the advanced filtering mode, DbrVOffset1 corresponds to the second filter offset value (eg, the fourth filter offset value and the second filter offset value are the same) and is the second filter offset value for vertical DBF filtering. When vertical DBF filtering is to be performed, DbrVOffset1 represents the second filtering offset value in the above-described embodiment of the invention.

[000290] The Enhanced Deblocking Filtering Vertical Refinement Offset Value 0 (dbr_v_offset0_minus1) is used to determine the Deblocking Filtering Vertical Refinement Offset value 0 of the current image when the BS value is 0 and the value of dbr_v_offset0_minus1 is between 0 and 3. The DbrVAltOffset0 value is a negative value, which is the opposite number of the sum dbr_v_alt_offset0_minus1+1. If there is no dbr_v_alt_offset0_minus1 in the bitstream, the value of DbrVAltOffset0 is 0.

[000291] In some embodiments of the invention for the advanced refinement mode, DbrVAltOffset0 corresponds to the first refinement offset value (eg, the third refinement offset value and the first refinement offset value are the same) and is the first refinement offset value for vertical DBF filtering. When vertical DBF filtering is to be performed, DbrVAltOffset0 represents the first refinement offset value in the above-described embodiment of the invention.

[000292] The Deblocking Advanced Filtering Vertical Refinement Offset Value 1 (dbr_v_alt_offset1_minus1) is used to determine the Deblocking Filtering Vertical Refinement Offset value 1 of the current image when the BS value is 0 and the value of dbr_v_alt_offset1_minus1 is between 0 and 3. The DbrVAltOffsetl value is value dbr_v_alt_offset1_minus1+1. If there is no dbr_v_alt_offset1 minus1 in the bitstream, the value of DbrVAltOffsetl is 0.

[000293] In some embodiments of the invention for the advanced refinement mode, DbrVAltOffsetl corresponds to the second refinement offset value (eg, the fourth refinement offset value and the second refinement offset value are the same) and is the second refinement offset value for vertical DBF filtering. When vertical DBF filtering is to be performed, DbrVAltOffsetl represents the second refinement offset value in the above-described embodiment of the invention.

[000294] The image-level horizontal deblocking refinement enable flag is represented as picture_dbr_h_enable_flag, which is a binary variable where a value of "1" indicates that the current image allows horizontal deblocking refinement to be used, and a value of "0" indicates that the current image does not allow the use of horizontal filtering refinement to remove blocking. The value of PhDbrHEnableFlag is equal to the value of picture_dbr_h_enable_flag. If there is no picture_dbr_h_enable_flag in the bitstream, the value of PhDbrHEnableFlag is 0.

[000295] In some embodiments, for the advanced refinement mode, PhDbrHEnableFlag corresponds to the advanced refinement enable flag and is the advanced refinement enable flag for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, PhDbrHEnableFlag indicates whether extended refinement mode is enabled or whether enhanced refinement mode is not enabled.

[000296] In some embodiments, for the advanced filtering mode, PhDbrHEnableFlag corresponds to the advanced filtering mode enable flag and is the advanced filtering mode enable flag for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, PhDbrHEnableFlag indicates whether the advanced filtering mode is enabled or whether the advanced filtering mode is disabled.

[000297] Finally, PhDbrHEnableFlag may represent an advanced refinement mode enable flag for horizontal DBF filtering and an advanced filter mode enable flag for horizontal DBF filtering. In other words, the advanced refinement mode enable flag and the advanced filtering mode enable flag share the same flag, namely, the current image enables the advanced refinement mode and the advanced filtering mode to be enabled simultaneously, or disables the enabling of the advanced refinement mode and the advanced filtering mode simultaneously.

[000298] The horizontal refinement filtering threshold value for deblocking is represented as dbr_h_threshold_minus1, which is used to determine the horizontal refinement filtering threshold value for deblocking the current image, where the threshold value takes a value between 0 and 1. The value of DbrHThreshold is equal to the value dbr_h_threshold_minus1+1. If there is no dbr_h_threshold_minus1 in the bitstream, the value of DbrHThreshold is 0.

[000299] In some embodiments of the invention for the advanced refinement mode, DbrHTreshold corresponds to the first refinement threshold (eg, the third refinement threshold and the first refinement threshold are the same) and is the first refinement threshold for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, DbrHThreshold represents the first refinement threshold value in the above-described embodiment of the invention. In addition, the second refinement threshold value (for example, the fourth refinement threshold value and the second refinement threshold value are the same) in the above-described embodiment of the invention and the first refinement threshold value are opposite numbers to each other, and thus the second refinement threshold value can be determined based on DbrHThreshold.

[000300] In some embodiments of the invention for the advanced filtering mode, DbrHTreshold corresponds to the first filtering threshold (eg, the third filtering threshold and the first filtering threshold are the same) and is the first filtering threshold for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, DbrHThreshold represents the first filtering threshold value in the above-described embodiment of the invention. In addition, the second filtering threshold value (for example, the fourth filtering threshold value and the second filtering threshold value are the same) in the above-described embodiment and the first filtering threshold value are opposite numbers to each other, and thus the second filtering threshold value can be determined based on DbrHThreshold.

[000301] Finally, DbrHTreshold may represent a first refinement threshold and a first filtering threshold for horizontal DBF filtering, namely, the first refinement threshold and the first filtering threshold are the same and have the same value.

[000302] The horizontal deblocking filter refinement offset value 0 (dbr h offset0 minus1) is used to determine the horizontal deblocking filter refinement offset value 0 of the current image, where the offset value is in the range 0 to 3. The value of DbrHOffset0 is a negative value , which is the opposite number of the sum dbr_h_offset0_minus1+1. If there is no dbr_h_offset0_minus1 in the bitstream, the value of DbrHOffset0 is 0.

[000303] In some embodiments of the invention for the advanced filtering mode, DbrHOffset0 corresponds to the first filtering offset value (eg, the third filtering offset value and the first filtering offset value are the same) and is the first filtering offset value for horizontal DBF filtering. When horizontal DBF filtering is to be performed, DbrHOffset0 represents the first filtering offset value in the above-described embodiment of the invention.

[000304] The deblocking horizontal filter refinement offset value 1 (dbr_h_offset1_minus1) is used to determine the deblocking horizontal filter refinement offset value 1 of the current image, where the offset value is in the range from 0 to 3. The value of DbrHOffset1 is equal to the value of dbr_h_offset1_minus1+1. If there is no dbr_h_offset1_minus1 in the bitstream, the value of DbrHOffset1 is 0.

[000305] In some embodiments, for the advanced filtering mode, DbrHOffset1 corresponds to the second filter offset value (eg, the fourth filter offset value and the second filter offset value are the same) and is the second filter offset value for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, DbrHOffset1 represents the second filtering offset value in the above-described embodiment of the invention.

[000306] The advanced deblocking filtering horizontal refinement offset value 0 (dbr_h_alt_offset0_minus1) is used to determine the deblocking filtering horizontal refinement offset value 0 of the current image when the BS value is 0, with the value of dbr_h_alt_offset0_minus1 being in the range of 0 to 3. The value DbrHAltOffset0 is equal to a negative value, which is the opposite number of the sum dbrhaltoffset0minus1+1. If there is no dbr_h_alt_offset0_minus1 in the bitstream, the value of DbrHAltOffset0 is 0.

[000307] In some embodiments of the invention for the advanced refinement mode, DbrHAltOffset0 corresponds to the first refinement offset value (eg, the third refinement offset value and the first refinement offset value are the same) and is the first refinement offset value for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, DbrHAltOffset0 represents the first refinement offset value in the above-described embodiment of the invention.

[000308] Advanced Deblocking Filtering Horizontal Refinement Offset Value 1 (dbr_h_alt_offset1_minus1) is used to determine Deblocking Filtering Horizontal Refinement Offset Value 1 of the current image when the BS value is 0 and the value of dbr_h_alt_offset1_minus1 is between 0 and 3. The DbrHAltOffsetl value is value dbr_h_alt_offset1_minus1+1. If there is no dbr_h_alt_offset1_minus1 in the bitstream, the value of DbrHAltOffsetl is 0.

[000309] In some embodiments of the invention for the extended refinement mode, DbrHAltOffsetl corresponds to the second refinement offset value (eg, the fourth refinement offset value and the second refinement offset value are the same) and is the second refinement offset value for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, DbrHAltOffset1 represents the second refinement offset value in the above-described embodiment of the invention.

[000310] Embodiment 14: Reference may be made to Table 2 to express high-level syntax (eg, high-level image header syntax), such as the image header encoding/decoding syntax shown in Table 2. The encoder encodes into the image header the syntax shown in Table 2, and the decoder decodes in the picture header the syntax shown in Table 2.

[000311] The meanings of the corresponding syntaxes in Table 2 are described below.

[000312] The image-level enhanced vertical enhancement enable flag is represented as picture_alt_dbr_v_enable_flag, which is a binary variable where a value of "1" indicates that the current image enables enhanced vertical enhancement and a value of "0" indicates that the current image prohibits the use of extended vertical refinement. The PictureAltDbrVEnableFlag value is equal to the picture_alt_dbr_v_enable_flag value. If there is no picture_alt_dbr_v_enable_flag in the bitstream, the value of PhAltDbrVEnableFlag is 0.

[000313] In some embodiments, for the advanced refinement mode, PictureAltDbrVEnableFlag corresponds to the enhanced refinement enable flag and is the enhanced refinement enable flag for vertical DBF filtering. In other words, when vertical DBF filtering is to be performed, PictureAltDbrVEnableFlag indicates whether the enhanced refinement mode is enabled or whether the enhanced refinement mode is disabled.

[000314] Unlike PictureAltDbrVEnableFlag in Embodiment 13, PictureAltDbrVEnableFlag is only an advanced refinement mode enable flag for vertical DBF filtering, and not an advanced filter mode enable flag for vertical DBF filtering.

[000315] The image-level enhanced horizontal enhancement enable flag is represented as picture_alt_dbr_h_enable_flag, which is a binary variable where a value of "1" indicates that the current image enables enhanced horizontal enhancement and a value of "0" indicates that the current image prohibits the use of extended horizontal refinement. The PictureAltDbrHEnableFlag value is equal to the picture_alt_dbr_h_enable_flag value. If the bitstream does not have picture_alt_dbr_h_enable_flag, the value of PhAltDbrHEnableFlag is 0.

[000316] In some embodiments of the invention for the extended refinement mode, PhAltDbrHEnableFlag corresponds to the enhanced refinement enable flag and is the enhanced refinement enable flag for horizontal DBF filtering. In other words, when horizontal DBF filtering is to be performed, PhAltDbrHEnableFlag indicates whether the enhanced refinement mode is enabled or whether the enhanced refinement mode is disabled.

[000317] Unlike the PhAltDbrHEnableFlag in Embodiment 13, the PhAltDbrHEnableFlag is only an advanced refinement mode enable flag for horizontal DBF filtering, and not an advanced filter mode enable flag for horizontal DBF filtering.

[000318] The meanings of the other syntaxes in Table 2 are the same as the meanings of the corresponding syntaxes in Table 1 and therefore are not repeated here.

[000319] Embodiment 15: For Embodiment 11, adbr_enable_flag can be encoded and decoded only when the deblocking filtering mode is enabled. Namely, it can first be determined whether to enable the deblocking filtering mode, and if the deblocking filtering mode is enabled, the adbr_enable_flag can be encoded/decoded in the sequence header, and if the deblocking filtering mode is not enabled, the adbr_enable_flag is not enabled. encode/decode in the sequence header. In short, advanced refinement mode (adbr_enable_flag is used to control whether advanced refinement mode is enabled) is a submode of the deblocking filtering mode that is only allowed to be enabled when the deblocking filtering mode is enabled.

[000320] For embodiment 12, the dbr_enable_flag can be encoded and decoded only when the deblocking filtering mode is enabled. Namely, it can first be determined whether to enable the deblocking filtering mode, and if the deblocking filtering mode is enabled, the dbr_enable_flag can be encoded/decoded in the sequence header, and if the deblocking filtering mode is not enabled, the dbr_enable_flag is not enabled. encode/decode in the sequence header. In short, the advanced filtering mode (dbr_enable_flag is used to control whether the advanced filtering mode is enabled) is a submode of the deblocking filtering mode that is only allowed to be enabled when the deblocking filtering mode is enabled.

[000321] For embodiment 13, the high-level syntaxes (used to control the enablement of the extended filtering mode and the extended refinement mode) shown in Table 1 encode and decode only when the deblocking filtering mode is enabled. Namely, it can first be determined whether to enable the deblocking filtering mode, and if the deblocking filtering mode is enabled, the high-level syntaxes shown in Table 1 encode/decode in the image header, and if the deblocking filtering mode is not enabled ,The high-level syntaxes shown in Table 1 do not encode/decode ,in the image header.

[000322] For embodiment 14, the high-level syntaxes (used to control the enablement of the extended filtering mode and the extended refinement mode) shown in Table 2 encode and decode only when the deblocking filtering mode is enabled. Namely, it can first be determined whether the deblocking filtering mode is enabled, and, if the deblocking filtering mode is enabled, the high-level syntaxes shown in Table 2 encode/decode in the image header, and if the deblocking filtering mode is not enabled ,The high-level syntaxes shown in Table 2 do not encode/decode ,in the image header.

[000323] Embodiment 16: For a filtering process to deblock a luminance component (ie, the current block is a luminance component), for example, the luminance component is refined based on an advanced refinement mode or an advanced filtering mode.

[000324] The luminance component DBR parameters are obtained in the following process:

[000325] If the current border to be filtered is a vertical border and the value of PhAltDbrVEnableFlag is 1, or the current border to be filtered is a horizontal border and the value of PhAltDbrHEnableFlag is 1, the value of Picture DbrEnableFlag is 1; otherwise, the value of PictureDbrEnableFlag is 0. If the current border to be filtered is a vertical border and the value of PictureAltDbrVEnableFlag is 1, or the current border to be filtered is a horizontal border and the value of PictureAltDbrHEnableFlag is 1, the value of Picture AltDbrEnableFlag is 1, otherwise In this case, the PictureAltDbrEnableFlag value is 0.

[000326] Using the following method, you can get dbr_th, dbr_offset0, dbr_offset1, alt_dbr_offset0 and alt_dbr_offset1:

[000327] For the vertical boundary, dbr_th=DbrVThreshold, dbr_offset0=DbrVOffset0, dbr_offset1=DbrVGffsetl, alt_dbr_offset0=DbrVAltOffset0 and alt_dbr_offset1=DbrVAltOffset1.

[000328] For a horizontal boundary, dbr_th=DbrHTreshold, dbr_offset0=DbrHOffset0, dbr_offset1=DbrHOffset1, alt_dbr_offset0=DbrHAltOffset0 and alt_dbr__offset1=DbrHAltOffset1.

[000329] (1) The edge filtering process when the luminance component BS value is 4 is as follows (using advanced filtering mode for processing):

[000330] When the BS value is 4, the filter calculation processes for p0, p1, p2 and q0, q1, q2 are as follows:

[000331] P0=(p2*3+p1*8+p0*10+q0*8+q1*3+16) >> 5;

[000332] P1=(p2*4+p1*5+p0*4+q0*3+8) >> 4;

[000333] P2=(p3*2+p2*2+p1*2+p0*1+q0*1+4) >> 3;

[000334] Q0=(p1*3+p0*8+q0*10+q1*8+q2 * 3+16)>> 5;

[000335] Q1=(p0*3+q0*4+q1*5+q2*4+8) >> 4;

[000336] Q2=(p0*1+q0*1+q1*2+q2*2+q3*2+4) >> 3.

[000337] P0, P1, P2 and Q0, Q1, Q2 filtered values (filtered pixel values).

[000338] After receiving P0, P1, P2 and Q0, Q1, Q2, if the value of PhDbrEnableFlag is 1, then,

[000339] if pi>Pi+dbr_th, then Pi'=clip((Pi+pi+1) >> 1+dbr_offset0); otherwise, if pi<Pi dbr_th, then Pi-clip((Pi+pi+1) >> 1+dbr_offset1), where i=0, 1 or 2;

[000340] if qi>Qi+dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbr_offset0); otherwise, if qi<Qi-dbr_th then Qi'=clip((Qi+qi+1) >> 1+dbr_offset1), where i=0, 1 or 2.

[000341] In the above formulas, pi may represent the original pixel value, qi may represent the original pixel value, Pi may represent the filtered pixel value, Qi may represent the filtered pixel value, Pi' may represent the refined pixel value, and Qi' may represent is a refined pixel value.

[000342] (2) The edge filtering process when the luminance component BS value (using advanced filtering mode for processing) is 3 is as follows:

[000343] When the value of BS is 3, the filter calculation processes for p0, p1 and q0, q1 are as follows:

[000344] P0=(p2+(p1 << 2)+(p0 << 2)+(p0 << 1)+(q0 << 2)+q1+8) >> 4;

[000345] P1=((p2 << 1)+p2+(p1 << 3)+(p0 << 2)+q0+8) >> 4;

[000346] Q0=(p1+(p0 << 2)+(q0 << 2)+(q0 << 1)+(q1 << 2)+q2+8) >> 4;

[000347] Q1=((q2 << 1)+q2+(q1 << 3)+(q0 << 2)+p0+8) >> 4.

[000348] P0, P1 and Q0, Q1 are filtered values (filtered pixel values).

[000349] After receiving P0, P1 and Q0, Q1, if the value of PhDbrEnableFlag is 1, then,

[000350] if pi>Pi+dbr_th, then Pi'=clip((Pi+pi+1) >> 1+dbr_offset0); otherwise, if pi<Pi -dbr_th, then Pi -clip((Pi+pi+1) >> 1+dbr_offset1), where i=0, 1;

[000351] if qi>Qi+dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbr_offset0); otherwise, if qi<Qi-dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbr_offset1), where i=0, 1.

[000352] In the above formulas, pi may represent the original pixel value, qi may represent the original pixel value, Pi may represent the filtered pixel value, Qi may represent the filtered pixel value, Pi' may represent the refined pixel value, and Qi' may represent the refined value pixel.

[000353] (3) The edge filtering process when the luminance component BS value is 2 (using the advanced filtering mode for processing) is as follows:

[000354] When the value of BS is 2, the filter calculation processes for p0 and q0 are as follows:

[000355] P0=((p1 << 1)+p1+(p0 << 3)+(p0 << 1)+(q0 << 1)+q0+8) >> 4;

[000356] Q0=((p0 << 1)+p0+(q0 << 3)+(q0 << 1)+(q1 << 1)+q1+8) >> 4.

[000357] P0 and Q0 are both filtered values (filtered pixel values).

[000358] After receiving P0 and Q0, if the value of PhDbrEnableFlag is 1, then:

[000359] if pi>Pi+dbr_th, then Pi'=clip((Pi+pi+1) >> 1+dbr_offset0); otherwise, if pi<Pi -dbr_th, then Pi-clip((Pi+pi+1) >> 1+dbr_offset1), where i=0;

[000360] if qi>Qi+dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbroffset0); otherwise, if qi<Qi-dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbr_offset1), where i=0.

[000361] In the above formulas, pi may represent the original pixel value, qi may represent the original pixel value, Pi may represent the filtered pixel value, Qi may represent the filtered pixel value, Pi' may represent the refined pixel value, and Qi' may represent the refined value pixel.

[000362] (4) The edge filtering process when the luminance component BS value is 1 (using the advanced filtering mode for processing) is as follows:

[000363] When the value of BS is 1, the filter calculation processes for p0 and q0 are as follows:

[000364] P0=((p0 << 1)+p0+q0+2) >> 2;

[000365] Q0=((q0 << 1)+q0+p0+2) >> 2.

[000366] P0 and Q0 are filtered values (filtered pixel values).

[000367] After receiving P0 and Q0, if the value of PhDbrEnableFla is 1, then:

[000368] if pi>Pi+dbr_th, then Pi'=clip((Pi+pi+1) >> 1+dbr_offset0); otherwise, if pi<Pi -dbr_th, then Pi-clip((Pi+pi+1) >> 1+dbr_offset1), where i=0;

[000369] if qi>Qi+dbr_th, then Qi'=clip((Qi+qi+1) >> 1+dbr_offset0); otherwise, if qi<Qi-dbr_th, then Qi-clip((Qi+qi+1) >> 1+dbr_offset1), where i=0.

[000370] In the above formulas, pi may represent the original pixel value, qi may represent the original pixel value, Pi may represent the filtered pixel value, Qi may represent the filtered pixel value, Pi' may represent the refined pixel value, and Qi' may represent the refined value pixel.

[000371] (5) The edge filtering process when the luminance component BS value is 0 is performed in Method 1 (using the advanced refine mode for processing):

[000372] When the value of BS is 0, the filtering calculation processes for pi and qi are as follows:

[000373] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, DPi=(pi-qi+2) >> 2 and DQi=(qi-pi+2) >> 2, or DPi=(pi-qi+1) >> 1 and DQi=(qi-pi+1 ) >> 1.

[000374] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000375] if DPi>dbr_th, then Pi=clip(pi+alt_dbr_offset0); otherwise, if DPi<dbr_th, then Pi=clip(pi+alt_dbr_offset1);

[000376] if DQi>dbr_th, then Qi=clip(qi+alt_dbr_offset0); otherwise, if DQi<-dbr_th, then Qr=clip(qi+alt_dbr_offset1).

[000377] In the above formulas, i may be equal to 0 or may be equal to 0, 1, 2, etc., which is not limited here.

[000378] In the above formulas, pi may represent an original pixel value, qi may represent an original pixel value, DPi may represent a gradient value, DQi may represent a gradient value, Pi may represent a refined pixel value, and Qi may represent a refined pixel value.

[000379] (6) The edge filtering process when the luminance component BS value is 0 is performed in method 2 (using the advanced refinement mode for processing):

[000380] When the value of BS is 0, the filter calculation processes for pi and qi are as follows:

[000381] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, DPi=(pi-qi+1) >> 1 and DQi=(qi-pi+1) >> 1.

[000382] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000383] if DPi>2*dbr_th, then Pr=clip(pi+alt_dbr_offset0); otherwise, if DPi<-2*dbr_th, then Pr=clip(pi+alt_dbr_offset1);

[000384] if DQi>2*dbr_th, then Qi=clip(qi+alt_dbr_offset0); otherwise, if DQi<2*dbr_th, then Qi=clip(qi+alt_dbr_offset1).

[000385] In the above formulas, 2*dbr_th and 2*dbr_th may be refinement thresholds in the embodiments described above.

[000386] In the above formulas, i may be equal to 0 or may be equal to 0, 1, 2, etc., which is not limited here.

[000387] In the above formulas, pi may represent an original pixel value, qi may represent an original pixel value, DPi may represent a gradient value, DQi may represent a gradient value, Pi may represent a refined pixel value, and Qi may represent a refined pixel value.

[000388] (7) The edge filtering process when the luminance component BS value is 0 is performed in method 3 (using the advanced refinement mode for processing):

[000389] When the value of BS is 0, the filtering calculation processes for pi and qi are as follows:

[000390] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, the gradient value DPi and the gradient value DQi can be defined as follows: DPi=((pi << 1)+pi+qi+2) >> 2 and DQi=((qi << 1)+qi+pi+2 ) >> 2.

[000391] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000392] if pi>DPi+dbr_th, then Pi=clip(pi+alt_dbr_offset0); otherwise, if pi<DPi-dbr_th then Pi=clip(pi+alt_dbr_offset1);

[000393] if qi>DQi+dbr_th, then Qi=clip(qi+alt_dbr_offset0); otherwise, if qi<DQi-dbr_th then Qi=clip(qi+alt_dbr_offset1).

[000394] In one possible implementation, the above expression may be equivalent to the following form of the expression:

[000395] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, the gradient value DPi and the gradient value DQi can be defined as follows: DPi=pi -(((pi << 1)+pi+qi+2) >> 2) and DQi=qi- (((qi << 1) +qi+pi+2) >> 2).

[000396] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000397] if DPi>dbr_th, then Pi=clip(pi+alt_dbr_offset0); otherwise, if DPi<dbr_th, then Pi=clip(pi+alt_dbr_offset1);

[000398] if DQi>dbr_th, then Qi=clip(qi+alt_dbr_offset0); otherwise, if DQi<-dbr_th, then Qr=clip(qi+alt_dbr_offset1).

[000399] In the above formulas, i may be equal to 0 or may be equal to 0, 1, 2, etc., which is not limited here.

[000400] In the above formulas, pi may represent an original pixel value, qi may represent an original pixel value, DPi may represent a gradient value, DQi may represent a gradient value, Pi may represent a refined pixel value, and Qi may represent a refined pixel value.

[000401] In the above embodiment, clip(x) represents that x is limited to within [0, 2^(bit depth)-1] (the range includes 0 and 2^(bit depth)-1), where bit depth represents the bit depth of the image, which is usually 8, 10, 12, or the like.

[000402] (8) The edge filtering process when the luminance component BS value is 0 is performed in method 4 (using the advanced refinement mode for processing):

[000403] When the value of BS is 0, the filtering calculation processes for pi and qi are as follows:

[000404] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, the gradient value DPi and the gradient value DQi can be defined as follows: DPi=(qi-pi+2) >> 2 and DQi=(pi-qi+2) >> 2.

[000405] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000406] if DPi<dbr_th, then Pi=clip(pi+dbraltoffset0); otherwise, if DPi>-dbr_th, then Pi=clip(pi+dbraltoffset1);

[000407] if DQKdbr_th, then Qi=clip(qi+alt_dbr_offset0); otherwise, if DQi>dbr_th, then Qi=clip(qi+dbr alt offset1).

[000408] In the above formulas, i may be equal to 0 or may be equal to 0, 1, 2, etc., which is not limited here.

[000409] In the above formulas, pi may represent an original pixel value, qi may represent an original pixel value, DPi may represent a gradient value, DQi may represent a gradient value, Pi may represent a refined pixel value, and Qi may represent a refined pixel value.

[000410] (9) The edge filtering process when the luminance component BS value is 0 is performed in Method 5 (using the advanced refine mode for processing):

[000411] When the value of BS is 0, the filtering calculation processes for pi and qi are as follows:

[000412] The gradient value DPi for pi and the gradient value DQi for qi are determined. For example, the gradient value DPi and the gradient value DQi can be defined as follows: DPi=pi - (((pi << 1)+pi+qi+2) >> 2), i.e. DPi=(pi-qi -2) >> 2, and DQi=qi - (((qi << 1)+qi+pi+2) >> 2), i.e. DQi=(qi-pi - 2) >> 2.

[000413] After receiving DPi and DQi, if the value of PhAltDbrEnableFlag is 1, then:

[000414] if DPi>dbr_th, then Pi=clip (pi+dbr alt offset0); otherwise, if DPi<- dbr_th, then Pi=clip (pi+dbr alt offset1);

[000415] if DQi>dbr_th, then Qi=clip (qi+dbr alt offset0); otherwise, if DQi<-dbr_th, then Qi=clip (qi+dbr alt offset1).

[000416] In the above formulas, i may be equal to 0 or may be equal to 0, 1, 2, etc., which is not limited here.

[000417] In the above formulas, pi may represent an original pixel value, qi may represent an original pixel value, DPi may represent a gradient value, DQi may represent a gradient value, Pi may represent a refined pixel value, and Qi may represent a refined pixel value.

[000418] Embodiment 17: For Embodiments 11 and 12, the high-level SPS syntax may be replaced by the high-level PPS syntax, or the high-level image header syntax, or the high-level image syntax, or the high-level slice header syntax, or the high-level CTU syntax, or the high-level CU syntax , and the types of high-level syntaxes are not limited here, provided that high-level syntaxes can pass dbr_enable_flag or adbr_enable_flag. For Embodiments 13 and 14, the high-level image header syntax may be replaced by high-level SPS syntax, or high-level PPS syntax, or high-level image syntax, or high-level slice header syntax, or high-level CTU syntax, or high-level CU syntax, and the types of high-level syntaxes are not limited herein. , if the high-level syntaxes can convey the contents of Table 1 and Table 2, namely, the high-level syntaxes can convey the advanced refinement mode enable flag, the advanced filtering mode enable flag, the first refinement threshold, the first filtering threshold, the first filtering offset value, the second offset value filtering, the first refinement offset value, the second refinement offset value, etc., wherein the specific implementation is similar to the implementation of embodiments 13 and 14 of the invention and is not repeated here.

[000419] For embodiments 13 and 14, the high-level image header syntax may be replaced by a high-level CTU syntax that conveys DBR-related parameters, wherein the DBR-related parameters include a first refinement threshold, a first filtering threshold, a first value a filtering offset value, a second filtering offset value, a first refinement offset value, a second refinement offset value, and the like, as shown in Embodiments 13 and 14 of the invention. Alternatively, the high-level image header syntax may be replaced by a high-level CU syntax that conveys DBR-related parameters, wherein the DBR-related parameters include a first refinement threshold value, a first filtering threshold value, a first filtering offset value, a second filtering offset value, a first refinement offset value, a second refinement offset value, and the like, as shown in Embodiments 13 and 14 of the invention.

[000420] Embodiment 18: For Embodiment 16, this is a deblocking filtering process for the luminance component; further, the luma component may be replaced by a chrominance component, and a deblocking filtering process is performed on the chrominance component (ie, the current block is a chrominance component). The filtering process for deblocking the chrominance component is similar to the filtering process for deblocking the luminance component as shown in Embodiment 16, and redundant descriptions are not given here.

[000421] In some embodiments, Embodiments 1 to 18 described above may be implemented separately or in combinations, for example, Embodiment 1 and Embodiment 2 may be combined, Embodiment 1 and Embodiment 2 may be combined, 3 embodiments of the invention, Embodiment 1 and Embodiment 4 may be combined, Embodiment 1 and Embodiment 5 may be combined, and Embodiment 1 and at least one of Embodiments 8 to 5 may be combined. 18; at least two embodiments 8 to 18 may be optionally combined; Embodiment 2 and at least one of Embodiments 8 to 18 may be combined; embodiment 3 and at least one of embodiments 8 to 18 may be combined; embodiment 4 and at least one of embodiments 8 to 18 may be combined; Embodiment 5 and at least one of Embodiments 8 to 18 may be combined; Embodiment 6 and at least one of Embodiments 8 to 18 may be combined; Embodiment 7 and at least one of Embodiments 8 to 18 may be combined. Of course, the above are just a few combination examples, and at least any two embodiments from Embodiments 1 to 18 may be combined to implement the corresponding process.

[000422] In some embodiments of the invention, the description of the encoder in each of the embodiments described above may be applied to the decoder, and the decoder may perform processing in the same manner. The decoder description can be applied to the encoder, and the encoder can perform processing in the same way.

[000423] Embodiment 19: Based on the same application idea as the method described above, an embodiment of the present disclosure provides a decoding apparatus that is used in a decoder. The decoding device includes: a memory configured to store video data; a decoder configured to implement the encoding and decoding method shown in Embodiments 1 to 18, namely, to implement a decoder processing flow.

[000424] For example, in one possible implementation, the decoder is configured to do the following:

[000425] if the current pixel point in the current block satisfies the condition of enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining a refined pixel value of the current pixel point.

[000426] Based on the same application idea as the method described above, an embodiment of the present disclosure provides an encoding device that is used in an encoder. The encoding device includes: a memory configured to store video data; an encoder configured to implement the encoding and decoding method shown in Embodiments 1 to 18, namely, to implement an encoder processing flow.

[000427] For example, in one possible implementation, the encoder is configured to do the following:

[000428] if the current pixel point in the current block satisfies the condition of enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[000429] Based on the same application idea as the method described above, an embodiment of the present disclosure provides a decoder device (also called a video decoder). From a hardware level point of view, reference can be made to FIG. 5A, illustrating a hardware architecture diagram of a decoder device that includes: a processor 511 and a computer-readable storage medium 512. The computer-readable storage medium 512 stores computer-readable instructions executable by the processor 511, and the processor 511 is configured to execute the computer-readable instructions to implement the method of the above embodiments 1 to 18. For example, the processor 511 is configured to execute the computer-readable instructions to perform the following steps:

[000430] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; Based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[000431] Based on the same application idea as the method described above, an embodiment of the present disclosure provides an encoder device (also called a video encoder). From a hardware level point of view, reference may be made to FIG. 5B, illustrating a hardware architecture diagram of an encoder device that includes: a processor 521 and a computer-readable storage medium 522. The computer-readable storage medium 522 stores computer-readable instructions executed by the processor 521, and the processor 521 is configured to execute the computer-readable instructions to implement the method of the above embodiments 1 to 18. For example, the processor 521 is configured to execute the computer-readable instructions to perform the following steps:

[000432] if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining the refined pixel value of the current pixel point.

[000433] Based on the same application idea as the method described above, an embodiment of the present disclosure provides a computer-readable storage medium on which computer instructions are stored. Computer instructions are executed by the processor to implement the method disclosed in the above embodiments of the present invention, for example, the encoding and decoding method mentioned in the above embodiments. A computer-readable storage medium may be any electronic, magnetic, optical, or physical storage device and may contain or store information such as executable instructions, data, and the like. For example, a computer-readable storage medium may be a random access memory (RAM, Random Access Memory), volatile memory, non-volatile memory, flash memory, a storage device (eg, a hard disk), a solid state hard drive, any type of storage disk (eg, a compact disk). disc, digital video disc (DVD, Digital Video Disk)) or similar storage medium, or a combination thereof.

[000434] Based on the same application idea as the method described above, an embodiment of the present disclosure provides a computer application program that is executed by a processor to implement an encoding and decoding method as disclosed in the above embodiments.

[000435] Based on the same application idea as the method described above, an embodiment of the present disclosure provides an encoding and decoding apparatus that is applied to an encoder or decoder. The encoding and decoding device contains:

[000436] a determination module configured to, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determine the gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; and a processing module configured to determine, based on the gradient value of the current pixel point and the original pixel value of the current pixel point, a refined pixel value of the current pixel point.

[000437] In some embodiments of the invention, the processing module, when determining the refined pixel value of the current pixel point based on the gradient value of the current pixel point and the original pixel value of the current pixel point, is configured to do the following:

[000438] based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value and the second refinement offset value, determining the refined pixel value of the current pixel point.

[000439] In some embodiments of the invention, a processing module configured, based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value, and the second refinement offset value, to determine the refined pixel value of the current pixel point is configured to: if the gradient value of the current pixel point is greater than the first refinement threshold value, determine the refined pixel value of the current pixel point based on the original pixel value of the current pixel point and the first refinement offset value;

[000440] If the gradient value of the current pixel point is less than the second refinement threshold value, determine the refined pixel value of the current pixel point based on the original pixel value of the current pixel point and the second refinement offset value.

[000441] In one possible implementation, if the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, the determination module is also configured to determine a reference pixel point corresponding to the current pixel point from an adjacent block of the current block and, based on the original pixel value of the reference pixel point and the original pixel value of the surrounding pixel point of the pixel reference point, determining the gradient value of the pixel reference point; the processing module is also configured to determine the refined pixel value of the pixel reference point based on the gradient value of the pixel reference point and the original pixel value of the pixel reference point.

[000442] In some embodiments of the invention, the processing module, when determining the refined pixel value of a pixel reference point based on the gradient value of the pixel reference point and the original pixel value of the pixel reference point, is configured to do the following:

[000443] based on the pixel reference point gradient value, the original pixel reference point pixel value, the third refinement threshold value, the fourth refinement threshold value, the third refinement offset value and the fourth refinement offset value, determining the refined pixel reference point pixel value.

[000444] In some embodiments of the invention, a processing module configured, based on a pixel reference point gradient value, a pixel reference point original pixel value, a third refinement threshold value, a fourth refinement threshold value, a third refinement offset value, and a fourth refinement offset value, to determine the refined pixel reference point pixel value is configured to: if the pixel reference point gradient value is greater than the third refinement threshold value, determine the refined pixel reference point pixel value based on the original pixel reference point pixel value and the third refinement offset value;

[000445] If the pixel reference point gradient value is less than the fourth refinement threshold value, determine the refined pixel reference point pixel value based on the original pixel reference point pixel value and the fourth refinement offset value.

[000446] In one possible implementation, the determination module, when determining that the current pixel point in the current block satisfies the enhanced refine mode enable condition, is configured to do the following: if the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enable condition extended refinement mode, determining that the current pixel point satisfies the condition for enabling the extended refinement mode; or, if the property information corresponding to the current block satisfies the enhanced refinement mode enablement condition, determining that the current pixel point in the current block satisfies the enhanced refinement mode enablement condition.

[000447] In some embodiments of the invention, the processing module is also configured to: if the current pixel point in the current block satisfies the general filtering mode enable condition, perform filtering to deblock the original pixel value of the current pixel point to obtain a filtered pixel value of the current pixel point ; if the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, determine the refined pixel value of the current pixel point based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point.

[000448] In some embodiments of the invention, the processing module, when determining the refined pixel value of the current pixel point based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point, is configured to do the following: based on the filtered pixel value of the current pixel point, the original pixel value the current pixel point, the first filtering threshold value, the second filtering threshold value, the first filtering offset value and the second filtering offset value, determining the refined pixel value of the current pixel point, wherein the first filtering threshold value and the second filtering threshold value are numbers opposite to each other.

[000449] In some embodiments of the invention, if the current pixel point in the current block satisfies the general filtering mode enable condition, the processing module is also configured to determine a pixel reference point corresponding to the current pixel point from an adjacent block of the current block and perform deblocking filtering for an original pixel value of the pixel reference point to obtain a filtered pixel value of the pixel reference point;

[000450] If the current pixel point in the current block satisfies the condition of enabling the advanced filtering mode, determining the refined pixel value of the pixel reference point based on the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point.

[000451] In some embodiments of the invention, the processing module, when determining the refined pixel value of a pixel reference point based on the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point, is configured to do the following: based on the filtered pixel value of the pixel reference point, the original pixel value a pixel reference point, a third filtering threshold value, a fourth filtering threshold value, a third filtering offset value and a fourth filtering offset value, determining a refined pixel value of the pixel reference point, wherein the third filtering threshold value and the fourth filtering threshold value are numbers opposite to each other.

[000452] The systems, devices, modules or blocks described in the above embodiments of the invention may be implemented as computer chips or objects, or as products with certain functions. A typical implementation device is a computer, and a computer, in a specific form, may be a personal computer, laptop computer, cell phone, camera phone, smartphone, personal digital assistant, media player, navigation equipment, email transceiver, game console, tablet computer, wearable device or combinations of any number of these devices. For convenience of description, the above device is divided into various blocks according to function when described. Of course, in implementing the present disclosure, the functions of each block may be implemented in one or more software and/or hardware.

[000453] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present disclosure may take the form of a pure hardware embodiment, a pure software embodiment, or an embodiment combining software and hardware. In addition, embodiments of the present disclosure may take the form of a computer program product embodied on one or more computer-accessible storage media (including, but not limited to, disk storage devices, CD-ROMs, optical storage devices, etc.) comprising computer-accessible program codes.

[000454] The present description is presented with reference to flowcharts and/or block diagrams of the methods, devices (systems), and computer program products disclosed in embodiments of the present disclosure. It should be understood that each flow and/or block in the block diagrams and/or block diagrams and combinations of threads and/or blocks in the block diagrams and/or block diagrams can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, a special purpose computer, an embedded processor, or other programmable data processing equipment to create a machine, such that the instructions executed by the processor or other programmable data processing equipment provide an apparatus for implementing the functions specified in one or more threads in a block diagram and/or in one or more blocks in a block diagram.

[000455] These computer program instructions may also be stored in computer readable memory capable of controlling a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory create an industrial product, including a device for executing the instructions, where the device to execute instructions, implements functions specified in one or more threads in a block diagram and/or in one or more blocks in a block diagram. These computer program instructions may also be loaded into a computer or other programmable processing device such that a sequence of operating steps may be performed on the computer or other programmable device to create computer-implemented processing, and thus the instructions are executed on the computer or other programmable device. programmable device, provide steps for implementing a function specified in one or more flows in a block diagram and/or in one or more blocks in a block diagram. The above are only some examples of the present disclosure, which do not limit the present invention. For those skilled in the art, the present disclosure is subject to various changes and modifications. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the invention are within the scope of the claims.

Claims (68)

1. A decoding method, including: in response to determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining a gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining a refined pixel value of the current pixel point; wherein determining that the current pixel point in the current block satisfies the enhanced refinement mode enabling condition includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enhanced refinement mode enabling condition, determining that the current pixel point satisfies the condition for enabling the extended refinement mode; wherein determining the refined pixel value of the current pixel point based on the gradient value of the current pixel point and the original pixel value of the current pixel point includes: based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value and the second refinement offset value, determining the refined pixel value of the current pixel point; wherein, in response to determining that the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value; in response to determining that the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. 2. The method of claim 1, wherein determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the condition for enabling the enhanced refinement mode includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point is a predetermined first value, determining that the boundary strength of the boundary to be filtered satisfies the condition for enabling the advanced refinement mode; in this case, the predetermined first value is 0. 3. The method according to claim 1, in which, in response to determining that the current pixel point in the current block satisfies the enhanced refine mode enable condition, the method also includes: determining a pixel reference point corresponding to the current pixel point from a neighboring block of the current block and, based on the original pixel value of the pixel reference point and the original pixel value of the surrounding pixel point of the pixel reference point, determining a gradient value of the pixel reference point; based on the gradient value of the pixel reference point, the original pixel value of the pixel reference point, the third refinement threshold value, the fourth refinement threshold value, the third refinement offset value and the fourth refinement offset value, determining the refined pixel value of the pixel reference point; wherein, in response to determining that the gradient value of the pixel reference point is greater than the third refinement threshold value, the refined pixel value of the pixel reference point is determined based on the original pixel value of the pixel reference point and the third refinement offset value; in response to determining that the gradient value of the pixel reference point is less than the fourth refinement threshold value, the refined pixel value of the pixel reference point is determined based on the original pixel value of the pixel reference point and the fourth refinement offset value. 4. Method according to any one of paragraphs. 1-3, also including: determining a first refinement threshold value, a first refinement offset value, a second refinement offset value, a third refinement threshold value, a third refinement offset value, and a fourth refinement offset value corresponding to the current block from a high-level syntax; wherein, before determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, the method also includes: in response to determining that the enhanced refinement mode enable flag corresponding to the current block allows the current block to enable the enhanced refinement mode, determining whether the current pixel point in the current block satisfies the enhanced refinement mode enable condition; wherein the method also includes: determining an extended refinement mode enable flag corresponding to the current block from the high-level syntax. 5. The method according to claim 1, also including: in response to determining that the current pixel point satisfies the general filtering mode enable condition, performing deblocking filtering on the original pixel value of the current pixel point to obtain a filtered pixel value of the current pixel point; And in response to determining that the current pixel point satisfies the condition for enabling the extended filtering mode, determining a refined pixel value of the current pixel point based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point; and/or wherein determining the refined pixel value of the current pixel point based on the filtered pixel value of the current pixel point and the original pixel value of the current pixel point includes: based on the filtered pixel value of the current pixel point, the original pixel value of the current pixel point, the first filtering threshold value, the second filtering threshold value, the first filtering offset value and the second filtering offset value, determining a refined pixel value of the current pixel point; wherein the first filtering threshold value and the second filtering threshold value are numbers opposite to each other; and/or wherein the pixel value of the current pixel point in the current block is a luma component or a chrominance component; and/or the method also includes: in response to determining that the advanced filtering mode enable flag corresponding to the current block allows the current block to enable the advanced filtering mode, determining whether the current pixel point satisfies the advanced filtering mode enabling condition. 6. The method of claim 5, further comprising, in response to determining that the current pixel point satisfies the general filtering mode enable condition: determining a pixel reference point corresponding to the current pixel point from an adjacent block of the current block, and performing deblocking filtering on the original pixel value of the pixel reference point to obtain a filtered pixel value of the pixel reference point; wherein, in response to determining that the current pixel point satisfies the advanced filtering mode enable condition, the method also includes: determining a refined pixel value of the pixel reference point based on the filtered pixel value of the pixel reference point and an original pixel value of the pixel reference point. 7. The method of claim 6, wherein determining the refined pixel value of the pixel reference point based on the filtered pixel value of the pixel reference point and the original pixel value of the pixel reference point includes: based on the filtered pixel value of the pixel reference point, the original pixel value of the pixel reference point, the third filtering threshold value, the fourth filtering threshold value, the third filtering offset value and the fourth filtering offset value, determining the refined pixel value of the pixel reference point, wherein the third filtering threshold value and the fourth filtering threshold value are numbers opposite to each other; wherein the first filtering threshold value, the first filtering offset value, the second filtering offset value, the third filtering threshold value, the third filtering offset value and the fourth filtering offset value corresponding to the current block are determined from the high-level syntax. 8. The method of claim 5, wherein determining that the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the condition for enabling the advanced filtering mode, and the absolute value of the difference between the filtered pixel value of the current pixel point and the original pixel value of the current pixel point exceeds a predetermined threshold value , determining that the current pixel point satisfies the condition for enabling the advanced filtering mode. 9. The method of claim 8, wherein determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point satisfies the condition for enabling the advanced filtering mode includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point is a predetermined second value, determining that the boundary strength of the boundary to be filtered satisfies the condition for enabling the advanced filtering mode. 10. Coding method, including: in response to determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determining a gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current pixel point; based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determining a refined pixel value of the current pixel point; wherein determining that the current pixel point in the current block satisfies the enhanced refinement mode enabling condition includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enhanced refinement mode enabling condition, determining that the current pixel point satisfies the condition for enabling the extended refinement mode; wherein determining the refined pixel value of the current pixel point based on the gradient value of the current pixel point and the original pixel value of the current pixel point includes: based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value and the second refinement offset value, determining the refined pixel value of the current pixel point; wherein, in response to determining that the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value; in response to determining that the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. 11. A decoding device comprising: a determination module configured to, in response to determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determine a gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current point pixel; And a processing module configured to, based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determine a refined pixel value of the current pixel point; wherein determining that the current pixel point in the current block satisfies the enhanced refinement mode enabling condition includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enhanced refinement mode enabling condition, determining that the current pixel point satisfies the condition for enabling the extended refinement mode; wherein determining the refined pixel value of the current pixel point based on the gradient value of the current pixel point and the original pixel value of the current pixel point includes: based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value and the second refinement offset value, determining the refined pixel value of the current pixel point; wherein, in response to determining that the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value; in response to determining that the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. 12. An encoding device containing: a determination module configured to, in response to determining that the current pixel point in the current block satisfies the condition for enabling the extended refinement mode, determine a gradient value of the current pixel point based on the original pixel value of the current pixel point and the original pixel value of the surrounding pixel point of the current point pixel; And a processing module configured to, based on the gradient value of the current pixel point and the original pixel value of the current pixel point, determine a refined pixel value of the current pixel point; wherein determining that the current pixel point in the current block satisfies the enhanced refinement mode enabling condition includes: in response to determining that the boundary strength of the boundary to be filtered corresponding to the current pixel point in the current block satisfies the enhanced refinement mode enabling condition, determining that the current pixel point satisfies the condition for enabling the extended refinement mode; wherein determining the refined pixel value of the current pixel point based on the gradient value of the current pixel point and the original pixel value of the current pixel point includes: based on the gradient value of the current pixel point, the original pixel value of the current pixel point, the first refinement threshold value, the second refinement threshold value, the first refinement offset value and the second refinement offset value, determining the refined pixel value of the current pixel point; wherein, in response to determining that the gradient value of the current pixel point is greater than the first refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the first refinement offset value; in response to determining that the gradient value of the current pixel point is less than the second refinement threshold value, the refined pixel value of the current pixel point is determined based on the original pixel value of the current pixel point and the second refinement offset value. 13. A decoder device comprising a processor and a computer-readable storage medium, wherein the computer-readable storage medium stores computer-readable instructions executable by the processor; the processor is configured to execute machine-readable instructions for implementing the method of any one of claims. 1-9. 14. An encoder device comprising a processor and a computer-readable storage medium, wherein the computer-readable storage medium stores computer-readable instructions executable by the processor; the processor is configured to execute machine-readable instructions for implementing the method of claim 10. 15. A computer-readable storage medium on which computer-readable instructions executable by the processor are stored, wherein the processor is configured to execute the computer-readable instructions for implementing the method of any one of claims. 1-9.