WO2020228662A1 - Détermination d'intensité de frontière pour filtres de dégroupage en traitement vidéo - Google Patents

Détermination d'intensité de frontière pour filtres de dégroupage en traitement vidéo Download PDF

Info

Publication number
WO2020228662A1
WO2020228662A1 PCT/CN2020/089558 CN2020089558W WO2020228662A1 WO 2020228662 A1 WO2020228662 A1 WO 2020228662A1 CN 2020089558 W CN2020089558 W CN 2020089558W WO 2020228662 A1 WO2020228662 A1 WO 2020228662A1
Authority
WO
WIPO (PCT)
Prior art keywords
filter
video block
sub
boundary
block
Prior art date
Application number
PCT/CN2020/089558
Other languages
English (en)
Inventor
Li Zhang
Weijia Zhu
Kai Zhang
Hongbin Liu
Jizheng Xu
Original Assignee
Beijing Bytedance Network Technology Co., Ltd.
Bytedance Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Bytedance Network Technology Co., Ltd., Bytedance Inc. filed Critical Beijing Bytedance Network Technology Co., Ltd.
Priority to CN202080035419.4A priority Critical patent/CN114041285B/zh
Publication of WO2020228662A1 publication Critical patent/WO2020228662A1/fr
Priority to US17/524,477 priority patent/US20220070455A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/117—Filters, e.g. for pre-processing or post-processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/132—Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/1883—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit relating to sub-band structure, e.g. hierarchical level, directional tree, e.g. low-high [LH], high-low [HL], high-high [HH]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
    • H04N19/635—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets characterised by filter definition or implementation details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/80—Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation
    • H04N19/82—Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation involving filtering within a prediction loop

Definitions

  • This patent document relates to video coding/decoding techniques, devices and systems.
  • Devices, systems and methods related to video coding/decoding technologies, and specifically, to deblocking filter in image/video coding are described.
  • the described methods may be applied to the standard under development, e.g. Versatile Video Coding and future video coding standards or video codec.
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining whether a pair of adjacent blocks of visual media data are both intra block copy (IBC) coded; and selectively applying, based on the determination, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of the pair of adjacent blocks, calculating a boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the boundary strength of the filter is dependent on a motion vector difference between motion vectors associated with the pair of adjacent blocks.
  • IBC intra block copy
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining whether a pair of adjacent blocks of visual media data are both intra block copy (IBC) coded; and selectively applying, based on the determination, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of the pair of adjacent blocks, calculating a boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the boundary strength of the filter is independent of a motion vector difference between motion vectors associated with the pair of adjacent blocks.
  • IBC intra block copy
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining a boundary strength on P-side and/or Q-side of a current video block of visual media data, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block; and selectively applying, based on the determination, a deblocking filter (DB) process at the P-side and/or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and one or both of: a P-side video block or a Q-side video block, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining that a video block on at least one of P-side or Q-side of a current video block of visual media data is coded using a residue differential pulse-code modulation (RDPCM) technique, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block; and selectively applying, based on the determining, a deblocking filter (DB) process at the P-side and/or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and the video block on at least one of the P-side or the Q-side, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the video block on at least one of the P-side or the Q-side of the current video block is treated as an intra block in the deblocking filter (DB)
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining a diagonal edge in a triangle mode coded video block of visual media data; and selectively applying, based on the determining, a deblocking filter (DB) process on the diagonal edge by identifying boundaries between blocks, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining whether at least one video block located at P-side or Q-side of a current video block is palette coded, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block; and selectively applying, based on the determining, a deblocking filter (DB) process at the P-side or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and the video block on at least one of the P-side or the Q-side, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the DB process is applied on at least one side of the current video block if the at least one video block located at the P-side of the current video block or the Q-side of the current video block is palette coded.
  • DB deblocking filter
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining one or more sub-regions within a current video block of visual media data, wherein the current video block makes use of a decoder-side motion refinement coding tool; and selectively applying, based on the determining, a deblocking filter (DB) process on the boundaries of the one or more sub-regions within the current video block by identifying vertical and/or horizontal edges, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining whether a secondary transform is applied on a video block of visual media data; and selectively applying, based on the determining, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of two video blocks, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • the disclosed technology may be used to provide a method for visual media processing.
  • This method includes determining whether at least one of interweave prediction, prediction refinement with optical flow (PROF) , and phase-variant affine subblock motion compensation is applied to a current video block of visual media data; and selectively applying, based on the determining, a deblocking filter (DB) process by identifying boundaries between blocks at vertical and horizontal edges, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case filter is turned on.
  • DB deblocking filter
  • the above-described method is embodied in the form of processor-executable code and stored in a computer-readable program medium.
  • a device that is configured or operable to perform the above-described method.
  • the device may include a processor that is programmed to implement this method.
  • a video decoder apparatus may implement a method as described herein.
  • a video encoder apparatus may implement a method as described herein.
  • FIG. 1 shows an example of encoder block diagram of versatile video coding (VVC) .
  • FIG. 2 shows an example processing flow of deblocking filter process.
  • FIG. 3 shows how the boundary strength (BS) value is calculated based on the intra coding mode, existence of non-zero transform coefficients and motion information, reference picture, number of motion vectors and motion vector difference.
  • FIG. 4 shows an example of referred information for BS calculation at CTU boundary.
  • FIG. 5 shows examples of the pixels involving in filter on/off decision.
  • FIG. 6A shows an example of division of 4 ⁇ 8 and 8 ⁇ 4 blocks.
  • FIG. 6B shows an example of division of all blocks except 4 ⁇ 8, 8 ⁇ 4 and 4 ⁇ 4.
  • FIG. 7A shows an example of affine linear weighted intra prediction (ALWIP) for 4 ⁇ 4 blocks.
  • FIG. 7B shows an example of ALWIP for 8 ⁇ 8 blocks.
  • FIG. 7C shows an example of ALWIP for 8 ⁇ 4 blocks.
  • FIG. 7D shows an example of ALWIP for 16 ⁇ 16 blocks.
  • FIG. 8 shows an example of secondary transform in JEM.
  • FIG. 9 shows an example of reduced secondary transform (RST) based on an embodiment of the disclosed technology.
  • FIG. 10 shows an example of sub-block transform modes SBT-V and SBT-H.
  • FIG. 11 shows an example of Sub-block MV VSB and pixel ⁇ v (i, j) .
  • FIG. 12 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 13 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 14 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 15 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 16 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 17 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 18 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 19 shows a flowchart of example methods for video processing based on some embodiments of the disclosed technology.
  • FIG. 20 is a block diagram of an example of a hardware platform for implementing a visual media decoding or a visual media encoding technique described in the present document.
  • FIG. 21 is a block diagram of an example video processing system in which disclosed techniques may be implemented.
  • FIG. 22 shows a flowchart of an example method for visual media processing.
  • FIG. 23 shows a flowchart of an example method for visual media processing.
  • FIG. 24 shows a flowchart of an example method for visual media processing.
  • FIG. 25 shows a flowchart of an example method for visual media processing.
  • FIG. 26 shows a flowchart of an example method for visual media processing.
  • FIG. 27 shows a flowchart of an example method for visual media processing.
  • FIG. 28 shows a flowchart of an example method for visual media processing.
  • FIG. 29 shows a flowchart of an example method for visual media processing.
  • FIG. 30 shows a flowchart of an example method for visual media processing.
  • Video codecs typically include an electronic circuit or software that compresses or decompresses digital video, and are continually being improved to provide higher coding efficiency.
  • a video codec converts uncompressed video to a compressed format or vice versa.
  • the compressed format usually conforms to a standard video compression specification, e.g., the High Efficiency Video Coding (HEVC) standard (also known as H. 265 or MPEG-H Part 2) , the Versatile Video Coding (VVC) standard to be finalized, or other current and/or future video coding standards.
  • HEVC High Efficiency Video Coding
  • VVC Versatile Video Coding
  • JEM Joint Exploration Model
  • affine prediction alternative temporal motion vector prediction
  • STMVP spatial-temporal motion vector prediction
  • BIO bi-directional optical flow
  • FRUC Frame-Rate Up Conversion
  • LAMVR Locally Adaptive Motion Vector Resolution
  • OBMC Overlapped Block Motion Compensation
  • LIC Local Illumination Compensation
  • DMVR Decoder-side Motion Vector Refinement
  • Embodiments of the disclosed technology may be applied to existing video coding standards (e.g., HEVC, H. 265) and future standards to improve runtime performance.
  • Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion or the embodiments (and/or implementations) to the respective sections only.
  • FIG. 1 shows an example of encoder block diagram of VVC, which contains three in-loop filtering blocks: deblocking filter (DF) , sample adaptive offset (SAO) and ALF.
  • DF deblocking filter
  • SAO sample adaptive offset
  • ALF utilize the original samples of the current picture to reduce the mean square errors between the original samples and the reconstructed samples by adding an offset and by applying a finite impulse response (FIR) filter, respectively, with coded side information signaling the offsets and filter coefficients.
  • FIR finite impulse response
  • ALF is located at the last processing stage of each picture and can be regarded as a tool trying to catch and fix artifacts created by the previous stages.
  • a deblocking filter process is performed for each CU in the same order as the decoding process. First, vertical edges are filtered (horizontal filtering) , then horizontal edges are filtered (vertical filtering) . Filtering is applied to 8x8 block boundaries which are determined to be filtered, for both luma and chroma components. 4x4 block boundaries are not processed in order to reduce the complexity.
  • FIG. 2 illustrates the overall processing flow of deblocking filter process.
  • a boundary can have three filtering status: no filtering, weak filtering and strong filtering.
  • Each filtering decision is based on boundary strength, BS, and threshold values, ⁇ and t C .
  • CU boundary which are outer edges of CU, are always involved in the filtering since CU boundaries are always also TU boundary or PU boundary.
  • PU shape is 2NxN (N > 4) and RQT depth is equal to 1
  • TU boundary at 8x8 block grid and PU boundary between each PU inside CU are involved in the filtering.
  • the boundary is not filtered.
  • FIG. 3 illustrates a flow chart for BS calculation.
  • boundary strength reflects how strong filtering is needed for the boundary. If BS is large, strong filtering should be considered.
  • P and Q be defined as blocks which are involved in the filtering, where P represents the block located in left (vertical edge case) or above (horizontal edge case) side of the boundary and Q represents the block located in right (vertical edge case) or above (horizontal edge case) side of the boundary.
  • FIG. 3 illustrates how the BS value is calculated based on the intra coding mode, existence of non-zero transform coefficients and motion information, reference picture, number of motion vectors and motion vector difference.
  • BS is calculated on a 4x4 block basis, but it is re-mapped to an 8x8 grid.
  • the maximum of the two values of BS which correspond to 8 pixels consisting of a line in the 4x4 grid is selected as the BS for boundaries in the 8x8 grid.
  • FIG. 4 shows an example of referred information for BS calculation at CTU boundary.
  • information in every second block (4x4 grid) in left or above side is re-used as depicted in FIG. 4.
  • Threshold values ⁇ and tC which involving in filter on/off decision, strong and weak filter selection and weak filtering process are derived based on luma quantization parameter of P and Q blocks, QPP and QPQ, respectively.
  • Q used to derive ⁇ and tC is calculated as follows.
  • variable ⁇ is derived as shown in Table 1, based on Q. If BS is greater than 1, the variable tC is specified as Table 1 with Clip3 (0, 55, Q + 2) as input. Otherwise (BS is equal or less than 1) , the variable tC is specified as Table 1 with Q as input.
  • Table 1 Derivation of threshold variables ⁇ and tC from input Q
  • FIG. 5 shows examples of the pixels involving in filter on/off decision.
  • pNM denotes the left-side N-th sample in the M-th row relative to the vertical edge or the top-side N-th sample in the M-th column relative to the horizontal edge
  • qNM denotes the right-side N-th sample in the M-th row relative to the vertical edge or the bottom-side N-th sample in the M-th column relative to the horizontal edge.
  • An example of pNM and qNM is depicted in FIG. 5.
  • pN denotes the left-side N-th sample in a row relative to the vertical edge or the top-side N-th sample in a column relative to the horizontal edge
  • qN denotes the right-side N-th sample in a row relative to the vertical edge or the bottom-side N-th sample in a column relative to the horizontal edge.
  • Filter on/off decision is done for four lines as a unit.
  • FIG. 5 illustrates the pixels involving in filter on/off decision.
  • the 6 pixels in the two red boxes for the first four lines are used to determine filter on/off for 4 lines.
  • the 6 pixels in two red boxes for the second 4 lines are used to determine filter on/off for the second four lines.
  • dp0
  • , dp3
  • , dp4
  • , dp7
  • dE, dEp1 and dEp2 are derived for weak filtering process.
  • the variable dE is set equal to 1. If dp0 + dp3 ⁇ ( ⁇ + ( ⁇ >> 1) ) >> 3, the variable dEp1is set equal to 1. If dq0 + dq3 ⁇ ( ⁇ + ( ⁇ >> 1) ) >> 3, the variable dEq1 is set equal to 1. For the second four lines, decision is made in a same fashion with above.
  • strong filter is used for filtering of the second 4 lines. Otherwise, weak filter is used for filtering.
  • ⁇ p Clip3 (- (t C >>1) , t C >>1, ( ( (p 2 +p 0 +1) >>1) –p 1 + ⁇ ) >>1)
  • BS of chroma filtering is inherited from luma. If BS> 1 or if coded chroma coefficient existing case, chroma filtering is performed. No other filtering decision is there. And only one filter is applied for chroma. No filter selection process for chroma is used.
  • the filtered sample values p0′ and q0′ are derived as follows.
  • VTM-4.0 the deblocking scheme described in JVET-M0471 is used.
  • the vertical edges in a picture are filtered first.
  • the horizontal edges in a picture are filtered with samples modified by the vertical edge filtering process as input.
  • the vertical and horizontal edges in the CTBs of each CTU are processed separately on a coding unit basis.
  • the vertical edges of the coding blocks in a coding unit are filtered starting with the edge on the left-hand side of the coding blocks proceeding through the edges towards the right-hand side of the coding blocks in their geometrical order.
  • the horizontal edges of the coding blocks in a coding unit are filtered starting with the edge on the top of the coding blocks proceeding through the edges towards the bottom of the coding blocks in their geometrical order.
  • Filtering is applied to 8x8 block boundaries. In addition, it must be a transform block boundary or a coding subblock boundary (e.g., due to usage of Affine motion prediction, ATMVP) . For those which are not such boundaries, filter is disabled.
  • bS [xD i ] [yD j ] is set equal to 2.
  • bS [xD i ] [yD j ] is set equal to 1.
  • the coding subblock containing the sample p 0 and the coding subblock containing the sample q 0 are both coded in IBC prediction mode, and the absolute difference between the horizontal or vertical component of the motion vectors used in the prediction of the two coding subblocks is greater than or equal to 4 in units of quarter luma samples.
  • One motion vector is used to predict the coding subblock containing the sample p0 and one motion vector is used to predict the coding subblock containing the sample q0, and the absolute difference between the horizontal or vertical component of the motion vectors used is greater than or equal to 4 in units of quarter luma samples.
  • Two motion vectors and two different reference pictures are used to predict the coding subblock containing the sample p 0
  • two motion vectors for the same two reference pictures are used to predict the coding subblock containing the sample q 0 and the absolute difference between the horizontal or vertical component of the two motion vectors used in the prediction of the two coding subblocks for the same reference picture is greater than or equal to 4 in units of quarter luma samples.
  • Two motion vectors for the same reference picture are used to predict the coding subblock containing the sample p 0
  • two motion vectors for the same reference picture are used to predict the coding subblock containing the sample q 0 and both of the following conditions are true:
  • the absolute difference between the horizontal or vertical component of list 0 motion vectors used in the prediction of the two coding subblocks is greater than or equal to 4 in quarter luma samples, or the absolute difference between the horizontal or vertical component of the list 1 motion vectors used in the prediction of the two coding subblocks is greater than or equal to 4 in units of quarter luma samples.
  • the absolute difference between the horizontal or vertical component of list 0 motion vector used in the prediction of the coding subblock containing the sample p 0 and the list 1 motion vector used in the prediction of the coding subblock containing the sample q 0 is greater than or equal to 4 in units of quarter luma samples, or the absolute difference between the horizontal or vertical component of the list 1 motion vector used in the prediction of the coding subblock containing the sample p 0 and list 0 motion vector used in the prediction of the coding subblock containing the sample q 0 is greater than or equal to 4 in units of quarter luma samples.
  • variable bS [xD i ] [yD j ] is set equal to 0.
  • Table 2 and Table 3 summarize the BS calculation rules.
  • the condition 1 is the “large block condition” . This condition detects whether the samples at P-side and Q-side belong to large blocks, which are represented by the variable bSidePisLargeBlk and bSideQisLargeBlk respectively.
  • the bSidePisLargeBlk and bSideQisLargeBlk are defined as follows.
  • condition 1 Based on bSidePisLargeBlk and bSideQisLargeBlk, the condition 1 is defined as follows.
  • Condition1 and Condition2 are valid, whether any of the blocks uses sub-blocks is further checked:
  • condition 3 the large block strong filter condition
  • Bilinear filter is used when samples at either one side of a boundary belong to a large block.
  • the bilinear filter is listed below.
  • ⁇ tcPD ⁇ _i and ⁇ tcPD ⁇ _j ⁇ term is a position dependent clipping described in Section 3.6 and g_j, f_i, ⁇ Middle ⁇ _ ⁇ s, t ⁇ , P_s ⁇ and Q_s ⁇ are given below:
  • the chroma strong filters are used on both sides of the block boundary.
  • the chroma filter is selected when both sides of the chroma edge are greater than or equal to 8 (chroma position) , and the following decision with three conditions are satisfied: the first one is for decision of boundary strength as well as large block.
  • the proposed filter can be applied when the block width or height which orthogonally crosses the block edge is equal to or larger than 8 in chroma sample domain.
  • the second and third one is basically the same as for HEVC luma deblocking decision, which are on/off decision and strong filter decision, respectively.
  • boundary strength (bS) is modified for chroma filtering as shown in Table 2.
  • Table 2 The conditions in Table 2 are checked sequentially. If a condition is satisfied, then the remaining conditions with lower priorities are skipped.
  • Chroma deblocking is performed when bS is equal to 2, or bS is equal to 1 when a large block boundary is detected.
  • the second and third condition is basically the same as HEVC luma strong filter decision as follows.
  • the second condition is basically the same as HEVC luma strong filter decision as follows.
  • d is then derived as in HEVC luma deblocking.
  • the second condition will be TRUE when d is less than ⁇ .
  • dpq is derived as in HEVC.
  • StrongFilterCondition (dpq is less than ( ⁇ >> 2) , sp3 + sq3 is less than ( ⁇ >> 3) , and Abs (p0 -q0) is less than (5 *tC + 1) >> 1) .
  • the proposed chroma filter performs deblocking on a 4x4 chroma sample grid.
  • the position dependent clipping tcPD is applied to the output samples of the luma filtering process involving strong and long filters that are modifying 7, 5 and 3 samples at the boundary. Assuming quantization error distribution, it is proposed to increase clipping value for samples which are expected to have higher quantization noise, thus expected to have higher deviation of the reconstructed sample value from the true sample value.
  • position dependent threshold table is selected from two tables (i.e., Tc7 and Tc3 tabulated below) that are provided to decoder as a side information:
  • Tc7 ⁇ 6, 5, 4, 3, 2, 1, 1 ⁇ ;
  • Tc3 ⁇ 6, 4, 2 ⁇ ;
  • position dependent threshold For the P or Q boundaries being filtered with a short symmetrical filter, position dependent threshold of lower magnitude is applied:
  • Tc3 ⁇ 3, 2, 1 ⁇ ;
  • filtered p′i and q′i sample values are clipped according to tcP and tcQ clipping values
  • p′′ i Clip3 (p′ i + tcP i , p′ i –tcP i , p′ i ) ;
  • q′′ j Clip3 (q′ j + tcQ j , q′ j –tcQ j , q′ j ) ;
  • p′i and q′i are filtered sample values
  • p′′i and q′′j are output sample value after the clipping
  • tcPi, tcQi are clipping thresholds that are derived from the VVC tc parameter and tcPD and tcQD.
  • the function Clip3 is a clipping function as it is specified in VVC.
  • the long filters is restricted to modify at most 5 samples on a side that uses sub-block deblocking (AFFINE or ATMVP or DMVR) as shown in the luma control for long filters. Additionally, the sub-block deblocking is adjusted such that that sub-block boundaries on an 8x8 grid that are close to a CU or an implicit TU boundary is restricted to modify at most two samples on each side.
  • AFFINE or ATMVP or DMVR sub-block deblocking
  • edge equal to 0 corresponds to CU boundary
  • edge equal to 2 or equal to orthogonalLength-2 corresponds to sub-block boundary 8 samples from a CU boundary etc.
  • FIG. 6A shows an example of division of 4 ⁇ 8 and 8 ⁇ 4 blocks.
  • FIG. 6B shows an example of division of all blocks except 4 ⁇ 8, 8 ⁇ 4 and 4 ⁇ 4.
  • ISP ISP is proposed, which divides luma intra-predicted blocks vertically or horizontally into 2 or 4 sub-partitions depending on the block size dimensions, as shown in Table 3.
  • FIG. 6A and FIG. 6B show examples of the two possibilities. All sub-partitions fulfill the condition of having at least 16 samples. For block sizes, 4 ⁇ N or N ⁇ 4 (with N>8) , if allowed, the 1 ⁇ N or N ⁇ 1 sub-partition may exist.
  • a residual signal is generated by entropy decoding the coefficients sent by the encoder and then invert quantizing and invert transforming them. Then, the sub-partition is intra predicted and finally the corresponding reconstructed samples are obtained by adding the residual signal to the prediction signal. Therefore, the reconstructed values of each sub-partition will be available to generate the prediction of the next one, which will repeat the process and so on. All sub-partitions share the same intra mode.
  • Affine linear weighted intra prediction (ALWIP, a.k.a. Matrix based intra prediction (MIP) ) is proposed in JVET-N0217.
  • the neighboring reference samples are firstly down-sampled via averaging to generate the reduced reference signal bdry red .
  • the reduced prediction signal pred red is computed by calculating a matrix vector product and adding an offset:
  • pred red A ⁇ bdry red +b.
  • b is a vector of size W red ⁇ H red .
  • FIGS. 7A-7D The entire process of averaging, matrix vector multiplication and linear interpolation is illustrated for different shapes in FIGS. 7A-7D. Note, that the remaining shapes are treated as in one of the depicted cases.
  • FIG. 7A shows an example of affine linear weighted intra prediction (ALWIP) for 4 ⁇ 4 blocks.
  • ALWIP affine linear weighted intra prediction
  • Given a 4 ⁇ 4 block, ALWIP takes two averages along each axis of the boundary. The resulting four input samples enter the matrix vector multiplication. The matrices are taken from the set S 0 . After adding an offset, this yields the 16 final prediction samples. Linear interpolation is not necessary for generating the prediction signal. Thus, a total of (4 ⁇ 16) / (4 ⁇ 4) 4 multiplications per sample are performed.
  • FIG. 7B shows an example of ALWIP for 8 ⁇ 8 blocks.
  • ALWIP takes four averages along each axis of the boundary.
  • the resulting eight input samples enter the matrix vector multiplication.
  • the matrices are taken from the set S 1 . This yields 16 samples on the odd positions of the prediction block.
  • these samples are interpolated vertically by using the reduced top boundary. Horizontal interpolation follows by using the original left boundary.
  • FIG. 7C shows an example of ALWIP for 8 ⁇ 4 blocks.
  • ALWIP takes four averages along the horizontal axis of the boundary and the four original boundary values on the left boundary.
  • the resulting eight input samples enter the matrix vector multiplication.
  • the matrices are taken from the set S 1 . This yields 16 samples on the odd horizontal and each vertical positions of the prediction block.
  • FIG. 7D shows an example of ALWIP for 16 ⁇ 16 blocks.
  • ALWIP takes four averages along each axis of the boundary.
  • the resulting eight input samples enter the matrix vector multiplication.
  • the matrices are taken from the set S 2 . This yields 64 samples on the odd positions of the prediction block.
  • these samples are interpolated vertically by using eight averages of the top boundary. Horizontal interpolation follows by using the original left boundary. The interpolation process, in this case, does not add any multiplications. Therefore, totally, two multiplications per sample are required to calculate ALWIP prediction.
  • the procedure is essentially the same and it is easy to check that the number of multiplications per sample is less than four.
  • VTM4 large block-size transforms, up to 64 ⁇ 64 in size, are enabled, which is primarily useful for higher resolution video, e.g., 1080p and 4K sequences.
  • High frequency transform coefficients are zeroed out for the transform blocks with size (width or height, or both width and height) equal to 64, so that only the lower-frequency coefficients are retained.
  • M size
  • N the block height
  • transform skip mode is used for a large block, the entire block is used without zeroing out any values.
  • a Multiple Transform Selection (MTS) scheme is used for residual coding both inter and intra coded blocks. It uses multiple selected transforms from the DCT8/DST7.
  • the newly introduced transform matrices are DST-VII and DCT-VIII. Table 7 shows the basis functions of the selected DST/DCT.
  • the transform matrices are quantized more accurately than the transform matrices in HEVC.
  • the transform matrices are quantized more accurately than the transform matrices in HEVC.
  • MTS In order to control MTS scheme, separate enabling flags are specified at SPS level for intra and inter, respectively.
  • a CU level flag is signalled to indicate whether MTS is applied or not.
  • MTS is applied only for luma.
  • the MTS CU level flag is signalled when the following conditions are satisfied.
  • MTS CU flag is equal to zero, then DCT2 is applied in both directions. However, if MTS CU flag is equal to one, then two other flags are additionally signalled to indicate the transform type for the horizontal and vertical directions, respectively.
  • Transform and signalling mapping table as shown in Table 8.
  • 8-bit primary transform cores are used. Therefore, all the transform cores used in HEVC are kept as the same, including 4-point DCT-2 and DST-7, 8-point, 16-point and 32-point DCT-2. Also, other transform cores including 64-point DCT-2, 4-point DCT-8, 8-point, 16-point, 32-point DST-7 and DCT-8, use 8-bit primary transform cores.
  • Table 8 Mapping of decoded value of tu_mts_idx and corresponding transform matrices for the horizontal and vertical directions
  • VVC To reduce the complexity of large size DST-7 and DCT-8, High frequency transform coefficients are zeroed out for the DST-7 and DCT-8 blocks with size (width or height, or both width and height) equal to 32. Only the coefficients within the 16x16 lower-frequency region are retained.
  • VVC also supports a mode called transform skip (TS) which is like the concept of TS in the HEVC.
  • TS is treated as a special case of MTS.
  • ISP ISP, SBT, and MTS enabled but with implicit signaling are all treated as implicit MTS.
  • the implicitMtsEnabled is used to define whether implicit MTS is enabled.
  • variable implicitMtsEnabled is derived as follows:
  • IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT
  • cu_sbt_flag is equal to 1 and Max (nTbW, nTbH) is less than or equal to 32
  • sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag are both equal to 0 and CuPredMode [xTbY] [yTbY] is equal to MODE_INTRA
  • implicitMtsEnabled is set equal to 0.
  • variable trTypeHor specifying the horizontal transform kernel and the variable trTypeVer specifying the vertical transform kernel are derived as follows:
  • trTypeHor and trTypeVer are set equal to 0.
  • IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT, trTypeHor and trTypeVer are specified in Table 8-15 depending on intraPredMode.
  • trTypeHor and trTypeVer are specified in Table 8-14 depending on cu_sbt_horizontal_flag and cu_sbt_pos_flag.
  • trTypeHor and trTypeVer are derived as follows:
  • trTypeHor and trTypeVer are specified in Table 8-13 depending on tu_mts_idx [xTbY] [yTbY] .
  • FIG. 8 shows an example of secondary transform in JEM.
  • secondary transform is applied between forward primary transform and quantization (at encoder) and between de-quantization and invert primary transform (at decoder side) .
  • 4x4 (or 8x8) secondary transform is performed depends on block size.
  • 4x4 secondary transform is applied for small blocks (i.e., min (width, height) ⁇ 8) and 8x8 secondary transform is applied for larger blocks (i.e., min (width, height) > 4) per 8x8 block.
  • non-separable transform Application of a non-separable transform is described as follows using input as an example. To apply the non-separable transform, the 4x4 input block X
  • the non-separable transform is calculated as where indicates the transform coefficient vector, and T is a 16x16 transform matrix.
  • the 16x1 coefficient vector is subsequently re-organized as 4x4 block using the scanning order for that block (horizontal, vertical or diagonal) .
  • the coefficients with smaller index will be placed with the smaller scanning index in the 4x4 coefficient block.
  • the mapping from the intra prediction mode to the transform set is pre-defined.
  • the selected non-separable secondary transform (NSST) candidate is further specified by the explicitly signalled secondary transform index.
  • the index is signalled in a bit-stream once per Intra CU after transform coefficients.
  • FIG. 9 shows an example of reduced secondary transform (RST) based on an embodiment of the disclosed technology.
  • the RST Low Frequency Non-Separable Transform (LFNST)
  • LFNST Low Frequency Non-Separable Transform
  • 16x48 and 16x16 matrices are employed for 8x8 and 4x4 blocks, respectively.
  • the 16x48 transform is denoted as RST8x8 and the 16x16 one as RST4x4.
  • RST The selection of RST is defined as follows:
  • cu_sbt_flag may be signaled to indicate whether the whole residual block or a sub-part of the residual block is decoded.
  • inter MTS information is further parsed to determine the transform type of the CU.
  • a part of the residual block is coded with inferred adaptive transform and the other part of the residual block is zeroed out.
  • the SBT is not applied to the combined inter-intra mode.
  • FIG. 10 shows an example of sub-block transform modes SBT-V and SBT-H.
  • position-dependent transform is applied on luma transform blocks in SBT-V and SBT-H (chroma TB always using DCT-2) .
  • the two positions of SBT-H and SBT-V are associated with different core transforms.
  • the horizontal and vertical transforms for each SBT position is specified in FIG. 10.
  • the horizontal and vertical transforms for SBT-V position 0 is DCT-8 and DST-7, respectively.
  • the sub-block transform jointly specifies the TU tiling, cbf, and horizontal and vertical transforms of a residual block, which may be considered a syntax shortcut for the cases that the major residual of a block is at one side of the block.
  • the joint residual mode is indicated with a flag in the bitstream if the coded block flags (cbf) for both Cb and Cr are true. If the mode is activated, a single residual block is decoded. The bitstream syntax and decoding process of joint residual blocks follow those of the Cb residual in VTM-4. The residuals of the Cr blocks are generated by negating the decoded joint residual. As a single residual is used to represent residuals of two blocks, it may often be desirable for this mode to use a QP lower than what is used for separate coding of chrominance residuals. In the CE tests a chroma QP offset of -1 was used for the joint mode and +1 was used for separate chroma coding (as specified in the JVET common test conditions) .
  • This contribution proposes a method to refine the sub-block based affine motion compensated prediction with optical flow. After the sub-block based affine motion compensation is performed, prediction sample is refined by adding a difference derived by the optical flow equation, which is referred as prediction refinement with optical flow (PROF) .
  • the proposed method can achieve inter prediction in pixel level granularity without increasing the memory access bandwidth.
  • this contribution proposes a method to refine the sub-block based affine motion compensated prediction with optical flow. After the sub-block based affine motion compensation is performed, luma prediction sample is refined by adding a difference derived by the optical flow equation.
  • the proposed PROF prediction refinement with optical flow
  • Step 1) The sub-block-based affine motion compensation is performed to generate sub-block prediction I (i, j) .
  • Step2 The spatial gradients g x (i, j) and g y (i, j) of the sub-block prediction are calculated at each sample location using a 3-tap filter [-1, 0, 1] .
  • FIG. 11 shows an example of Sub-block MV VSB and pixel ⁇ v (i, j) .
  • the sub-block prediction is extended by one pixel on each side for the gradient calculation. To reduce the memory bandwidth and complexity, the pixels on the extended borders are copied from the nearest integer pixel position in the reference picture. Therefore, additional interpolation for padding region is avoided.
  • Step 3 The luma prediction refinement (denoted ⁇ I) as is calculated by the optical flow equation.
  • ⁇ I (i, j) g x (i, j) * ⁇ v x (i, j) +g y (i, j) * ⁇ v y (i, j)
  • delta MV (denoted as ⁇ v (i, j) ) is the difference between pixel MV computed for sample location (i, j) , denoted by v (i, j) , and the sub-block MV of the sub-block to which pixel (i, j) belongs, as shown in FIG. 11.
  • ⁇ v (i, j) can be calculated for the first sub-block, and reused for other sub-blocks in the same CU.
  • x and y be the horizontal and vertical offset from the pixel location to the center of the sub-block, ⁇ v (x, y) can be derived by the following equation,
  • Step 4) Finally, the luma prediction refinement is added to the sub-block prediction I (i, j) .
  • the final prediction I′ is generated as the following equation.
  • I′ (i, j) I (i, j) + ⁇ I (i, j)
  • BDOF refines each prediction sample. Therefore, it may be not needed to filter them again in the deblocking process.
  • Embodiments of the presently disclosed technology overcome the drawbacks of existing implementations, thereby providing video coding with higher coding efficiencies.
  • the improvement of deblocking filtering (DB) based on the disclosed technology, may enhance both existing and future video coding standards, is elucidated in the following examples described for various implementations.
  • the examples of the disclosed technology provided below explain general concepts, and are not meant to be interpreted as limiting. In an example, unless explicitly indicated to the contrary, the various features described in these examples may be combined.
  • deblocking filter DB
  • SAO in-loop filtering
  • ALF post-reconstruction filters
  • bilateral filter diffusion filter
  • Hadamard transform domain filter which applied to prediction signal or reconstruction signal before deblocking filter
  • chroma components may represent the Cb/Cr colour components, or B/R colour components for the RGB format.
  • Cb/Cr the chroma components
  • B/R colour components for the RGB format.
  • Example 1 Whether to enable DB and/or how to apply filtering in the DB process may depend on usage of BDOF and/or other coding tools that use optical flow to refine motion/prediction samples/reconstruction samples.
  • boundary strength/filter strength may depend on the usage of BDOF.
  • a weaker filter may be applied for samples located within a BDOF coded block.
  • Example 2 Whether to enable DB and/or how to apply filtering in the DB process may depend on the transform matrix type (e.g., DCT-II, DST-VII, DCT-VIII, transform skip mode (with identify matrix) , coding methods which doesn’t apply transform such as RDPCM/QR-BDPCM mode) .
  • transform matrix type e.g., DCT-II, DST-VII, DCT-VIII, transform skip mode (with identify matrix)
  • coding methods which doesn’t apply transform such as RDPCM/QR-BDPCM mode
  • the position dependent clipping may be disabled for samples to be filtered located at blocks coded with certain transform type (e.g., transform skip-coded blocks) .
  • the position dependent clipping parameters may be dependent on the basis of transform matrices applied to that block.
  • DB may not be performed on the block that of transform skip mode or coding methods which doesn’t apply transform such as RDPCM mode.
  • Example 3 The clipping operation and/or the position dependent clipping may be disabled based on:
  • Video contents e.g. screen contents or natural contents
  • Example 4 Whether to enable DB and/or how to apply filtering in the DB process may depend on usage of Combined Intra-Inter Prediction (CIIP) .
  • CIIP Combined Intra-Inter Prediction
  • CIIP coded blocks may be treated similarly as intra coded blocks.
  • the boundary strength is set to 2.
  • the boundary strength (BS) of IBC-coded blocks may be independent from the motion vector difference.
  • BS is dependent on whether the horizonal and/or vertical MV difference is greater than M0/M1-pels (M>1) .
  • M0 and M1 are both set to 4.
  • M0 is set to the minimum CU width for MV difference of the horizontal component
  • M1 is set to the minimum CU height for MV difference of the horizontal component.
  • M0 is set to the minimum allowed IBC-coded CU width for MV difference of the horizontal component
  • M1 is set to the minimum allowed IBC-coded CU height for MV difference of the horizontal component.
  • DB may not be applied for boundaries between two IBC-coded blocks.
  • DB may not be applied on samples of a IBC-coded block.
  • Example 6 The boundary strength (BS) value at the P-side or Q-side may be different
  • the blocks at P-side or Q-side may have its own boundary strength.
  • the deblocking performed at P-side and Q-side may be based on the BS values at P-side and Q-side respectively.
  • the deblocking conditions may be checked at the P-side and the deblocking maybe only performed at P-side.
  • the BS for P-side and Q-side may depend on the QPs of the two sides.
  • the BS for P-side and Q-side may depend on the LMCS coefficients used in the two sides.
  • Example 7 A RDPCM-coded block may be treated as an intra block in the deblocking process.
  • the boundary strength (BS) value may be set to 1 or 2 if a RDPCM-coded block is at the P-side and/or Q-side.
  • Example 8 The diagonal edge in a triangle mode coded block may be deblocked
  • the deblocking filters and/or the deblocking control logic in the current VVC may be also applied on diagonal edge in a triangle mode coded block.
  • Example 9 The deblocking may be applied on one-side if a palette coded block is at P-side or Q-side.
  • the deblocking may be applied on P-side if a palette coded block is at Q-side and a block not coded in the palette mode is at the P-side.
  • the deblocking may be applied on Q-side if a palette coded block is at P-side and a block not coded in the palette mode is at the Q-side.
  • Sub-regions within one block coded with DMVR or other decoder side motion refinement coding tools may be treated as sub-block boundaries and may be filtered.
  • the sub-region is defined to be sub-unit that motion vector refinement is applied on.
  • the sub-region is defined to be the MxN sub-block within a DMVR coded block, wherein M and N may be set to 64 or 16.
  • filtering e.g., deblocking filter, SAO, ALF
  • SAO deblocking filter
  • ALF ALF
  • whether to filter samples at one or more boundaries of one sub-region may be dependent on the location of the sub-region.
  • filtering may be applied for samples located at one or more bottom boundaries of one sub-region wherein the bottom boundary (s) of the sub-region is also the bottom boundary of a CTU.
  • filtering may be disabled.
  • filtering may be enabled.
  • filtering may be enabled for samples located at one or more right boundaries of one sub-region, but the bottom boundary (s) of the sub-region is not the bottom boundary of a CTU.
  • filtering may be disabled.
  • whether to use refined or unrefined motion information for a sub-region in the filtering process may depend on the location of sub-regions.
  • filtering may be dependent on the refined motion information.
  • filtering may be dependent on the unrefined motion information.
  • the proposed methods may be applied to DMVR/PROF/BDOF/other kinds of decoder side motion derivation or refinement coding tools.
  • Example 11 Whether to enable DB and/or how to apply filtering in the DB process may depend on whether secondary transform (a.k.a NSST or RST or LFNST) is applied or not.
  • secondary transform a.k.a NSST or RST or LFNST
  • boundaries of sub-regions wherein RST are applied may be treated as transform block boundaries or coding subblock boundaries.
  • samples located at the RST applied sub-regions may be also filtered.
  • the position dependent clipping may be disabled for RST applied sub-regions.
  • Example 12 Whether deblocking is performed on subblock boundaries within an affine mode block (e.g., inner subblock boundaries) may depend on whether interweave prediction or/and PROF or/and phase-variant affine subblock motion compensation is applied to the block or not.
  • deblocking may be disabled when interweave prediction or/and PROF or/and phase-variant affine subblock motion compensation is applied to the block.
  • deblocking may be enabled when interweave prediction or/and PROF or/and phase-variant affine subblock motion compensation is not applied to the block.
  • FIG. 12 shows a flowchart of an example method 1200 for video processing based on some embodiments of the disclosed technology.
  • the method 1200 for video processing includes, at step 1210, performing a determination of a coding scheme applicable to a conversion between a video block and a bitstream representation of the video block, at step 1220, determining, based on the determination of the coding scheme, a mode of an in-loop filtering process including at least one of a deblocking filter (DB) process, a sample adaptive offset (SAO) , and an adaptive loop filtering (ALF) , and, at step 1230, performing the conversion using the mode of the in-loop filtering.
  • DB deblocking filter
  • SAO sample adaptive offset
  • ALF adaptive loop filtering
  • FIG. 13 shows a flowchart of another example method 1300 for video processing based on some embodiments of the disclosed technology.
  • the method 1300 for video processing includes, at step 1310, determining that a combined intra-inter prediction (CIIP) coding is applicable to a current block, and, at step1320, performing a conversion between the current block and a bitstream representation of the current block, and, based on usage of the CIIP, performing a deblocking filter (DB) process by: identifying boundaries between blocks and vertical and horizontal edges; calculating a boundary strength; deciding whether to turn on or off a filter; and selecting a strength of the filter. Additional features relating to the method 1300 for video processing can be found at Example 4 discussed above.
  • CIIP intra-inter prediction
  • DB deblocking filter
  • FIG. 14 shows a flowchart of another example method 1400 for video processing based on some embodiments of the disclosed technology.
  • the method 1400 for video processing includes, at step 1410, determining whether adjacent blocks are both intra block copy (IBC) coded, and, at step 1420, performing, based on the determination, a deblocking filter (DB) process by identifying boundaries between blocks and vertical and horizontal edges, calculating a boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter.
  • the boundary strength is independent from the motion vector difference. Additional features relating to the method 1400 for video processing can be found at Example 5 discussed above.
  • FIG. 15 shows a flowchart of another example method 1500 for video processing based on some embodiments of the disclosed technology.
  • the method 1500 for video processing includes, at step 1510, determining a boundary strength at P-side and Q-side, and, at step 1520, performing, based on the determination, a deblocking filter (DB) process at P-side and Q-side by identifying boundaries between blocks and vertical and horizontal edges, calculating the boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter. Additional features relating to the method 1500 for video processing can be found at Example 6discussed above.
  • DB deblocking filter
  • FIG. 16 shows a flowchart of another example method 1600 for video processing based on some embodiments of the disclosed technology.
  • the method 1600 for video processing includes, at step 1610, determining a residue differential pulse-code modulation (RDPCM) coded block, and, at step 1620, performing, based on the determination, a deblocking filter (DB) process at P-side and Q-side by identifying boundaries between blocks and vertical and horizontal edges, calculating the boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter.
  • the RDPCM coded block is treated as an intra block in the deblocking filter (DB) process. Additional features relating to the method 1600 for video processing can be found at Example 7 discussed above.
  • FIG. 17 shows a flowchart of another example method 1700 for video processing based on some embodiments of the disclosed technology.
  • the method 1700 for video processing includes, at step 1710, determining a diagonal edge in a triangle mode coded block, and, at step 1720, performing, based on the determination, a deblocking filter (DB) process on the diagonal edge by identifying boundaries between blocks and vertical and horizontal edges, calculating the boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter. Additional features relating to the method 1700 for video processing can be found at Example 8 discussed above.
  • DB deblocking filter
  • FIG. 18 shows a flowchart of another example method 1800 for video processing based on some embodiments of the disclosed technology.
  • the method 1800 for video processing includes, at step 1810, determining whether a palette coded block is at P-side or Q-side, and, at step 1820, performing, based on the determination, a deblocking filter (DB) process on the diagonal edge by identifying boundaries between blocks and vertical and horizontal edges, calculating the boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter.
  • the deblocking filter (DB) process is applied on one-side in case a palette coded block is at P-side or Q-side. Additional features relating to the method 1800 for video processing can be found at Example 9 discussed above.
  • FIG. 19 shows a flowchart of another example method 1900 for video processing based on some embodiments of the disclosed technology.
  • the method 1900 for video processing includes, at step 1910, determining sub-regions within one block coded with decoder-side motion vector refinement (DMVR) or other decoder side motion refinement coding tools, and, at step 1920, performing, based on the determination, a deblocking filter (DB) process on the sub-regions by identifying boundaries between blocks and vertical and horizontal edges, calculating the boundary strength, deciding whether to turn on or off a filter, and selecting a strength of the filter. Additional features relating to the method 1900 for video processing can be found at Example 10 discussed above.
  • DMVR decoder-side motion vector refinement
  • DB deblocking filter
  • FIG. 20 is a block diagram of a video processing apparatus 2000.
  • the apparatus 2000 may be used to implement one or more of the methods described herein.
  • the apparatus 2000 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on.
  • the apparatus 2000 may include one or more processors 2002, one or more memories 2004 and video processing circuitry 2006.
  • the processor (s) 2002 may be configured to implement one or more methods (including, but not limited to, methods 1200-1900) described in the present document.
  • the memory (memories) 2004 may be used for storing data and code used for implementing the methods and techniques described herein.
  • the video processing circuitry 2006 may be used to implement, in hardware circuitry, some techniques described in the present document.
  • the video coding methods may be implemented using an apparatus that is implemented on a hardware platform as described with respect to FIG. 20.
  • FIG. 21 is a block diagram showing an example video processing system 2100 in which various techniques disclosed herein may be implemented.
  • the system 2100 may include input 2102 for receiving video content.
  • the video content may be received in a raw or uncompressed format, e.g., 8 or 10 bit multi-component pixel values, or may be in a compressed or encoded format.
  • the input 2102 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON) , etc. and wireless interfaces such as Wi-Fi or cellular interfaces.
  • PON passive optical network
  • the system 2100 may include a coding component 2104 that may implement the various coding or encoding methods described in the present document.
  • the coding component 2104 may reduce the average bitrate of video from the input 2102 to the output of the coding component 2104 to produce a coded representation of the video.
  • the coding techniques are therefore sometimes called video compression or video transcoding techniques.
  • the output of the coding component 2104 may be either stored, or transmitted via a communication connected, as represented by the component 2106.
  • the stored or communicated bitstream (or coded) representation of the video received at the input 2102 may be used by the component 2108 for generating pixel values or displayable video that is sent to a display interface 2110.
  • the process of generating user-viewable video from the bitstream representation is sometimes called video decompression.
  • certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by
  • peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or Displayport, and so on.
  • storage interfaces include SATA (serial advanced technology attachment) , PCI, IDE interface, and the like.
  • FIG. 22 shows a flowchart of an example method for visual media processing. Steps of this flowchart are in connection with Example 5b discussed in this document.
  • the process determines whether a pair of adjacent blocks of visual media data are both intra block copy (IBC) coded.
  • the process selectively applies, based on the determination, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of the pair of adjacent blocks, calculating a boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the boundary strength of the filter is dependent on a motion vector difference between motion vectors associated with the pair of adjacent blocks.
  • DB deblocking filter
  • FIG. 23 shows a flowchart of an example method for visual media processing. Steps of this flowchart are in connection with Example 5 discussed in this document.
  • the process determines whether a pair of adjacent blocks of visual media data are both intra block copy (IBC) coded.
  • the process selectively applies, based on the determination, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of the pair of adjacent blocks, calculating a boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the boundary strength of the filter is independent of a motion vector difference between motion vectors associated with the pair of adjacent blocks.
  • DB deblocking filter
  • FIG. 24 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 6 in Section 12 of this document.
  • the process determines a boundary strength on P-side and/or Q-side of a current video block of visual media data, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block.
  • the process selectively applies, based on the determination, a deblocking filter (DB) process at the P-side and/or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and one or both of: a P-side video block or a Q-side video block, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • FIG. 25 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 7 in Section 12 of this document.
  • the process determines that a video block on at least one of P-side or Q-side of a current video block of visual media data is coded using a residue differential pulse-code modulation (RDPCM) technique, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block.
  • RPCM residue differential pulse-code modulation
  • the process selectively applies, based on the determining, a deblocking filter (DB) process at the P-side and/or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and the video block on at least one of the P-side or the Q-side, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the video block on at least one of the P-side or the Q-side of the current video block is treated as an intra block in the deblocking filter (DB) process.
  • DB deblocking filter
  • FIG. 26 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 8 in Section 12 of this document.
  • the process determines a diagonal edge in a triangle mode coded video block of visual media data.
  • the process selectively applies, based on the determining, a deblocking filter (DB) process on the diagonal edge by identifying boundaries between blocks, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • FIG. 27 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 9in Section 12 of this document.
  • the process determines whether at least one video block located at P-side or Q-side of a current video block is palette coded, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block.
  • the process selectively applies, based on the determining, a deblocking filter (DB) process at the P-side or the Q-side by identifying a boundary at a vertical edge and/or a horizontal edge of the current video block and the video block on at least one of the P-side or the Q-side, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on, wherein the DB process is applied on at least one side of the current video block if the at least one video block located at the P-side of the current video block or the Q-side of the current video block is palette coded.
  • DB deblocking filter
  • FIG. 28 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 10 in Section 12 of this document.
  • the process determines one or more sub-regions within a current video block of visual media data, wherein the current video block makes use of a decoder-side motion refinement coding tool.
  • the process selectively applies, based on the determining, a deblocking filter (DB) process on the boundaries of the one or more sub-regions within the current video block by identifying vertical and/or horizontal edges, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • FIG. 29 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 11 in Section 12 of this document.
  • the process determines whether a secondary transform is applied on a video block of visual media data.
  • the process selectively applies, based on the determining, a deblocking filter (DB) process by identifying a boundary at a vertical edge and/or a horizontal edge of two video blocks, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case the filter is turned on.
  • DB deblocking filter
  • FIG. 30 shows a flowchart of an example method for visual media processing. Steps of this flowchart are discussed in connection with Example 12 in Section 12 of this document.
  • the process determines whether at least one of interweave prediction, prediction refinement with optical flow (PROF) , and phase-variant affine subblock motion compensation is applied to a current video block of visual media data.
  • the process selectively applies, based on the determining, a deblocking filter (DB) process by identifying boundaries between blocks at vertical and horizontal edges, calculating the boundary strength of a filter, deciding whether to turn on or off the filter, and selecting a strength of the filter in case filter is turned on.
  • DB deblocking filter
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • a method for visual media processing comprising:
  • P-side and Q-side denote a video block to the left and a video block to the right of the current video block
  • a deblocking filter DB
  • DB deblocking filter
  • a method for visual media processing comprising:
  • determining that a video block on at least one of P-side or Q-side of a current video block of visual media data is coded using a residue differential pulse-code modulation (RDPCM) technique, where P-side and Q-side denote a video block to the left and a video block to the right of the current video block; and
  • RPCM residue differential pulse-code modulation
  • a deblocking filter DB
  • DB deblocking filter
  • the video block on at least one of the P-side or the Q-side of the current video block is treated as an intra block in the deblocking filter (DB) process.
  • DB deblocking filter
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • the DB process is applied on at least one side of the current video block if the at least one video block located at the P-side of the current video block or the Q-side of the current video block is palette coded.
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • the decoder-side motion refinement coding tool includes a decoder-side motion vector refinement (DMVR) technique, a prediction refinement with optical flow (PROF) technique, or a Bi-directional optical flow (BDOF) technique.
  • DMVR decoder-side motion vector refinement
  • PROF prediction refinement with optical flow
  • BDOF Bi-directional optical flow
  • CTU coding tree unit
  • CTU coding tree unit
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • the secondary transform includes at least one of: a reduced secondary transform (RST) , a non-separable secondary transform (NSST) , and a low frequency non-separable transform (LFNST) .
  • RST reduced secondary transform
  • NSST non-separable secondary transform
  • LFNST low frequency non-separable transform
  • RST reduced secondary transform
  • a method for visual media processing comprising:
  • a deblocking filter DB
  • DB deblocking filter
  • the conversion includes generating pixel values of a video block from the bitstream representation.
  • a video encoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses X1-H3.
  • a video decoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses X1-H3.
  • video processing or “visual media processing” may refer to video encoding, video decoding, video compression or video decompression.
  • video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa.
  • the bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax.
  • a block may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream.
  • a block may represent a grouping of pixels and may be, for example, a coding unit, a transform unit, a prediction unit and so on.
  • a decoder may parse a bitstream with the knowledge that some fields may be present, or absent, based on the determination, as is described in the above solutions.
  • an encoder may determine that certain syntax fields are or are not to be included and generate the coded representation accordingly by including or excluding the syntax fields from the coded representation.
  • Implementations of the subject matter and the functional operations described in this patent document can be implemented in various systems, digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible and non-transitory computer readable medium for execution by, or to control the operation of, data processing apparatus.
  • the computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them.
  • data processing unit or “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers.
  • the apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.
  • a computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
  • a computer program does not necessarily correspond to a file in a file system.
  • a program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document) , in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code) .
  • a computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
  • the processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output.
  • the processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit) .
  • processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer.
  • a processor will receive instructions and data from a read only memory or a random access memory or both.
  • the essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data.
  • a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks.
  • mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks.
  • a computer need not have such devices.
  • Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices.
  • semiconductor memory devices e.g., EPROM, EEPROM, and flash memory devices.
  • the processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

Dans un aspect donné à titre d'exemple, l'invention concerne un procédé de traitement de média visuel qui consiste à déterminer si une paire de blocs adjacents de données de média visuel sont tous les deux codés par copie de bloc intra (IBC) ; et à appliquer sélectivement, sur la base de la détermination, un processus de filtre de dégroupage (DB) par identification d'une frontière au niveau d'un bord vertical et/ou d'un bord horizontal de la paire de blocs adjacents, calcul d'une intensité de frontière d'un filtre, décision quant à l'activation ou la désactivation du filtre, et sélection d'une intensité du filtre dans le cas où le filtre est activé, l'intensité de frontière du filtre dépendant d'une différence de vecteur de mouvement entre des vecteurs de mouvement associés à la paire de blocs adjacents.
PCT/CN2020/089558 2019-05-11 2020-05-11 Détermination d'intensité de frontière pour filtres de dégroupage en traitement vidéo WO2020228662A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202080035419.4A CN114041285B (zh) 2019-05-11 2020-05-11 视频处理中去方块滤波器的边界强度确定
US17/524,477 US20220070455A1 (en) 2019-05-11 2021-11-11 Boundary strength determination for deblocking filters in video processing

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN2019086488 2019-05-11
CNPCT/CN2019/086488 2019-05-11
CNPCT/CN2019/094965 2019-07-07
CN2019094965 2019-07-07

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/524,477 Continuation US20220070455A1 (en) 2019-05-11 2021-11-11 Boundary strength determination for deblocking filters in video processing

Publications (1)

Publication Number Publication Date
WO2020228662A1 true WO2020228662A1 (fr) 2020-11-19

Family

ID=73289582

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/089558 WO2020228662A1 (fr) 2019-05-11 2020-05-11 Détermination d'intensité de frontière pour filtres de dégroupage en traitement vidéo

Country Status (3)

Country Link
US (1) US20220070455A1 (fr)
CN (1) CN114041285B (fr)
WO (1) WO2020228662A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102496622B1 (ko) * 2018-01-08 2023-02-07 삼성전자주식회사 부호화 방법 및 그 장치, 복호화 방법 및 그 장치
WO2020228661A1 (fr) 2019-05-11 2020-11-19 Beijing Bytedance Network Technology Co., Ltd. Filtre de déblocage destiné à un codage vidéo

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140369428A1 (en) * 2011-11-04 2014-12-18 Lg Electronics Inc. Method and apparatus for encoding/decoding image information
CN106464866A (zh) * 2014-05-29 2017-02-22 佳能株式会社 用于对视频样本的块进行去块的方法、设备和系统
WO2018132043A1 (fr) * 2017-01-10 2018-07-19 Telefonaktiebolaget Lm Ericsson (Publ) Commande de filtrage de déblocage

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140369428A1 (en) * 2011-11-04 2014-12-18 Lg Electronics Inc. Method and apparatus for encoding/decoding image information
CN106464866A (zh) * 2014-05-29 2017-02-22 佳能株式会社 用于对视频样本的块进行去块的方法、设备和系统
WO2018132043A1 (fr) * 2017-01-10 2018-07-19 Telefonaktiebolaget Lm Ericsson (Publ) Commande de filtrage de déblocage

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ANDERSSON， K. ET AL.: "CE11-related: On MV threshold for deblocking（JVET-N0359_r1）", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 14TH MEETING: GENEVA， CH， 19–27 MARCH 2019, 27 March 2019 (2019-03-27), DOI: 20200718212736A *
SETHURAMAN， SRIRAM: "CE9-related: Results for use of DMVR refined MVs from top and top-left CTUs for spatial MV prediction and CU boundary de-blocking （JVET-N0314-v2）", JOINT VIDEO EXPERTS TEAM (JVET) OF ITU-T SG 16 WP 3 AND ISO/IEC JTC 1/SC 29/WG 11 14TH MEETING: GENEVA， CH， 19–27 MARCH 2019, 27 March 2019 (2019-03-27), DOI: 20200718212525A *

Also Published As

Publication number Publication date
CN114041285A (zh) 2022-02-11
CN114041285B (zh) 2024-04-19
US20220070455A1 (en) 2022-03-03

Similar Documents

Publication Publication Date Title
WO2020228673A1 (fr) Utilisation conditionnelle d'une transformée secondaire réduite pour un traitement vidéo
KR20220073745A (ko) 비디오 처리에서 크로마 잔차 및 필터링의 공동 코딩
WO2020244656A1 (fr) Signalisation conditionnelle d'une transformée secondaire réduite pour flux bianires de vidéo
WO2020228717A1 (fr) Réglages de dimension de bloc du mode de saut de transformation
EP4014495A1 (fr) Paramètre de quantification de chrominance dans un codage vidéo
US20220070455A1 (en) Boundary strength determination for deblocking filters in video processing
CN113826405B (zh) 多个颜色分量的变换量化旁路模式的使用
WO2020233664A1 (fr) Utilisation basée sur un sous-bloc de mode de saut de transformée
CN114270848A (zh) 在去方块滤波中使用边界强度
WO2020228661A1 (fr) Filtre de déblocage destiné à un codage vidéo
CN114868391B (zh) 编解码块或子块边界处的去方块滤波
WO2023213298A1 (fr) Commutateur de forme de filtre pour filtre à boucle adaptatif dans codage vidéo
WO2020221213A1 (fr) Partitionnement de sous-bloc intra et sélection de transformée multiple
CN114503597A (zh) 视频编解码中的色度去方块
CN113906763A (zh) 用于视频编解码的色度去方块协调

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20806760

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 09/03/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 20806760

Country of ref document: EP

Kind code of ref document: A1