WO2019143602A1 - Motion compensated bi-prediction based on local illumination compensation - Google Patents

Motion compensated bi-prediction based on local illumination compensation Download PDF

Info

Publication number
WO2019143602A1
WO2019143602A1 PCT/US2019/013623 US2019013623W WO2019143602A1 WO 2019143602 A1 WO2019143602 A1 WO 2019143602A1 US 2019013623 W US2019013623 W US 2019013623W WO 2019143602 A1 WO2019143602 A1 WO 2019143602A1
Authority
WO
WIPO (PCT)
Prior art keywords
current
block
template samples
samples
sub
Prior art date
Application number
PCT/US2019/013623
Other languages
English (en)
French (fr)
Inventor
Xiaoyu XIU
Yuwen He
Yan Ye
Saurav Bandyopadhyay
Original Assignee
Vid Scale, 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 Vid Scale, Inc. filed Critical Vid Scale, Inc.
Priority to US16/960,455 priority Critical patent/US11368676B2/en
Priority to CN202410707311.5A priority patent/CN118646861A/zh
Priority to EP19703499.4A priority patent/EP3741115A1/en
Priority to MX2020007355A priority patent/MX2020007355A/es
Priority to JP2020537618A priority patent/JP7125486B2/ja
Priority to CN201980007961.6A priority patent/CN111630855B/zh
Publication of WO2019143602A1 publication Critical patent/WO2019143602A1/en
Priority to US17/732,466 priority patent/US11962759B2/en
Priority to JP2022128796A priority patent/JP7448600B2/ja
Priority to JP2024029997A priority patent/JP2024059911A/ja
Priority to US18/635,719 priority patent/US20240267511A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/103Selection of coding mode or of prediction mode
    • H04N19/105Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/18Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/132Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/136Incoming video signal characteristics or properties
    • H04N19/137Motion inside a coding unit, e.g. average field, frame or block difference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/157Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/17Methods 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/176Methods 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/186Methods 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 a colour or a chrominance component
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/30Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/577Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51Motion estimation or motion compensation
    • H04N19/583Motion compensation with overlapping blocks

Definitions

  • Video coding systems may be used to compress video signals, e.g., to reduce the storage space and/or transmission bandwidth of such signals.
  • video coding systems There may be various types of video coding systems, such as block-based, wavelet-based, object-based systems, block-based hybrid video coding systems, and/or the like.
  • Block-based video coding systems may support international video coding standards such as MP EG 1/2/4 part 2, H.264/MPEG-4 part 10 AVC, VC-1, and/or High Efficiency Video Coding (HEVC).
  • HEVC High Efficiency Video Coding
  • LIC local illumination compensation
  • a video CU may be processed.
  • a video CU may be or may include a coding block or a sub-block.
  • a sub-block may be derived by dividing the regular coding block.
  • a current CU may be received in a video bitstream.
  • a current CU may be bi-predicted. Whether the current CU is bi-predicted may be determined. If the current CU is bi-predicted, reference template samples associated with the current CU may be identified. For example, reference template samples may neighbor temporal reference CUs of the current CU. The reference template samples may correspond to template samples for the current CU that neighbor the current CU. For example, the template samples for the current CU may be neighboring samples of the current CU. The reference template samples neighboring temporal reference CUs may be identified, for example based on motion vectors of the current CU.
  • Bi-predicted reference template samples may be generated based on the reference template samples.
  • the bi-predicted reference template samples may be generated based on averaging the reference template samples neighboring the temporal reference CUs.
  • Reference template samples for a current CU may be identified.
  • the reference template samples may neighbor temporal reference CUs of the current CU that correspond to template samples for the current CU.
  • Bi-predicted reference template samples may be used to calculate LIC parameters.
  • LIC parameters may be calculated based on the generated bi-predicted reference template samples and the template samples for the current CU.
  • the LIC parameters may be calculated by minimizing the differences between the bi-predicted reference template samples and the template samples for the current CU. The differences between the bi-predicted reference template samples and the template samples for the current CU may be minimized based on a least mean square error (LMSE) approach.
  • LMSE least mean square error
  • the LIC parameters may be calculated based on a linear model approach using a minimum value and a maximum value associated with the bi-predicted reference template samples and the template samples for the current CU. The calculated LIC parameters may be applied to the bi-predicted CU and generate an adjusted bi- predicted current CU.
  • LIC parameters may be applied at an overlapped block motion compensation (OBMC) stage. For example, whether a sub-block of the current CU is at a boundary of the current CU may be determined. If the sub-block of the current CU is at the boundary of the current CU, one or more neighboring sub-blocks of the sub-block may be identified. One or more motion vectors associated with the neighboring sub-blocks may be applied to a sample in the sub-block to derive one or more template reference samples. An OBMC-predicted sample may be generated based on the template reference samples. For example, an OBMC-predicted sample may be generated based on averaging the template reference samples. LIC parameters may be applied to the generated OBMC-predicted sample.
  • OBMC overlapped block motion compensation
  • the LIC parameters calculated at motion compensation stage may be cached in a memory or a buffer and may be used at the OBMC stage.
  • the LIC parameters may be fetched from the memory or the buffer and may be used at the OBMC stage.
  • template samples for the current CU may be identified.
  • the template samples may be subsampled.
  • LIC parameters may be calculated based on the subsampled template samples. For example, template samples for the current CU may be identified among the subsampled template samples.
  • reference template samples used for LIC parameter calculation may be identified.
  • the reference template samples may neighbor temporal reference CUs that correspond to template samples for the current CU.
  • the reference template samples may be subsampled.
  • LIC parameters may be calculated based on the subsampled reference template samples.
  • the reference template samples used for the LIC calculation (e.g., neighboring temporal reference CUs that correspond to the template samples for the current CU) may be identified from the subsampled reference template samples.
  • FIG. 1 is a diagram illustrating an example of a block-based hybrid video encoding system.
  • FIG. 2 is a diagram illustrating an example of a block-based video decoder.
  • FIG. 3 is a diagram illustrating an example local illumination compensation (LIC) process.
  • LIC local illumination compensation
  • FIG. 4 is a diagram illustrating example advanced temporal motion vector prediction (ATMVP) operations.
  • ATMVP advanced temporal motion vector prediction
  • FIG. 5 is a diagram illustrating example spatial-temporal motion vector prediction (STMVP) operations.
  • STMVP spatial-temporal motion vector prediction
  • FIG. 6A is a diagram illustrating example frame-rate up conversion (FRUC) operations using template-matching.
  • FRUC frame-rate up conversion
  • FIG. 6B is a diagram illustrating example FRUC operations using bilateral-matching.
  • FIG. 7 is a diagram illustrating example overlapped block motion compensation (OBMC) operations.
  • OBMC overlapped block motion compensation
  • FIGs. 8A-8B are diagrams illustrating example motion compensation operations associated with generating a prediction signal for a coding block when LIC is applied.
  • FIG. 9 is a diagram illustrating example bi-directional LIC operations.
  • FIGs. 10A-10B are diagrams illustrating example motion compensation operations when bidirectional LIC is applied.
  • FIGs. 11A-11B are diagrams illustrating example motion compensation operations when LIC parameters are derived once at an OBMC stage.
  • FIGs. 12A-12B are diagrams illustrating example motion compensation operations during which LIC parameters derived from regular motion compensation may be reused for OBMC.
  • FIGs. 13A-13B are diagrams illustrating example motion compensation operations in which LIC is performed after prediction signals for OBMC have been generated.
  • FIGs. 14A-14B are diagrams illustrating example motion compensation operations in which LIC parameters are derived at a regular motion compensation stage and LIC-based sample adjustment is performed after OBMC.
  • FIG. 15 illustrates an example block diagram of a video encoder with generalized bi-predictJon (GBi) support
  • FIG. 16 illustrates an example block diagram of a GBi module.
  • FIG. 17 illustrates an example block diagram of a video decoder that supports the GBi module.
  • FIG. 18 illustrates an example block diagram of a GBi module.
  • FIG. 19A is a system diagram illustrating an example communications system in which one or more disclosed embodiments may be implemented.
  • FIG. 19B is a system diagram illustrating an example wireless transmit/receive unit (WTRU) that may be used within the communications system illustrated in FIG. 19A according to an embodiment
  • WTRU wireless transmit/receive unit
  • FIG. 19C is a system diagram illustrating an example radio access network (RAN) and an example core network (CN) that may be used within the communications system illustrated in FIG. 19A according to an embodiment
  • RAN radio access network
  • CN core network
  • FIG. 19D is a system diagram illustrating a further example RAN and a further example CN that may be used within the communications system illustrated in FIG. 19A according to an embodiment
  • Video coding systems may compress digital video signals, for example, to reduce the storage space and/or transmission bandwidth associated with the storage and/or delivery of such signals.
  • Video coding systems may include a block-based system, a wavelet-based system, an object-based system, and/or the like.
  • Block-based video coding systems may support international video coding standards, such as MPEG-1/2/4 part 2, H.264/MPEG-4 part 10 AVC, VC-1, and/or High Efficiency Video Coding (HEVC).
  • international video coding standards such as MPEG-1/2/4 part 2, H.264/MPEG-4 part 10 AVC, VC-1, and/or High Efficiency Video Coding (HEVC).
  • HEVC High Efficiency Video Coding
  • HEVC may provide bit-rate saving (e.g., an approximately 50%) or equivalent perceptual quality compared to a prior generation of video coding techniques (e.g., H.264/MPEG AVC). Superior coding efficiency may be achieved (e.g., with additional coding tools) over HEVC.
  • Software codebases such as Joint Exploration Model (JEM) may be based on an HEVC Model (HM). Coding tools may be integrated into JEM software and may be tested, for example, using JVET common test conditions (CTCs). HM and/or JEM software may be based on a block-based hybrid video coding framework.
  • JEM Joint Exploration Model
  • CTCs JVET common test conditions
  • FIG. 1 shows an example of a block-based hybrid video encoding system 600.
  • Input video signal 602 may be processed on a coding unit (CU) basis.
  • a CU may include one or more video blocks or sub- blocks.
  • a CU e.g., a video block or sub-block
  • a CU may be associated with a specific size (e.g., number of pixels) and may be used (e.g., in HEVC) to compress high resolution (e.g., 1080p and beyond) video signals.
  • a CU may include, for example, 64x64 pixels.
  • a CU may be partitioned (e.g., into prediction units (PU)). Separate (e.g. the same or different) prediction procedures may be applied to PUs.
  • Spatial prediction 660 and/or temporal prediction 662 may be performed, for example, for an (e.g., each) input video block (e.g., a macroblock (MB) or a CU).
  • MB
  • Spatial prediction may predict a current video block, for example, by using pixels from samples of one or more already coded neighboring blocks (e.g., reference samples). The current video block and the one or more already coded neighboring blocks may be in a same video picture or video slice. Spatial prediction may reduce spatial redundancy that may be inherent in a video signal.
  • Temporal prediction e.g., inter prediction, motion compensated prediction, etc.
  • Temporal prediction may predict a current video block, for example, by using reconstructed pixels from one or more already coded video pictures. Temporal prediction may reduce temporal redundancy that may be inherent in a video signal.
  • a temporal prediction signal for a given video block may be signaled, for example, by one or more motion vectors (MVs), which may indicate an amount of motion and/or a direction of motion between a current block and a reference block.
  • MVs motion vectors
  • a reference picture index may be sent (e.g., for each video block), for example, when multiple reference pictures may be supported (e.g., for H.264/AVC or HEVC).
  • a reference index may be used to identify a reference picture (e.g., in reference picture store 664) from which a temporal prediction signal may be derived.
  • a mode decision and control logic unit 680 in an encoder may (e.g., after spatial and/or temporal prediction) choose a (e.g. the best) prediction mode based on, for example, a rate-distortion optimization procedure.
  • a prediction block may be subtracted from a current video block 616.
  • a prediction residual may be de-correlated (e.g., at a transform unit 604) and quantized (e.g., at a quantization unit 606).
  • Quantized residual coefficients may be inverse quantized (e.g., at 610) and inverse transformed (e.g., at 612), e.g., to form reconstructed residuals.
  • Reconstructed residuals may be added back to the prediction block 626, for example, to form a reconstructed video block.
  • In-loop filtering e.g. de-blocking filter and/or Adaptive Loop Filters
  • the reconstructed video block may be used to code future video blocks.
  • the coding mode information e.g., inter or intra
  • prediction mode information e.g., motion information, and/or quantized residual coefficients
  • One or more of the information may be compressed and packed by the entropy coding unit 608 into an output bitstream 620.
  • FIG. 2 shows an example of a block-based video decoding system (e.g., a video decoder).
  • a video bit-stream 202 may be unpacked and entropy decoded at an entropy decoding unit 208.
  • Coding mode and/or prediction mode information may be sent to a spatial prediction unit 260 (e.g., when intra coded) or to a temporal prediction unit such as a motion compensated prediction unit 262 (e.g., when inter coded), for example, to form a prediction block.
  • Residual transform coefficients may be provided to an inverse quantization unit 210 and an inverse transform unit 212, e.g., to reconstruct a residual block.
  • the prediction block and residual block may be added together, e.g., via a summation operation at 226.
  • In-loop filtering 266 may be applied to the reconstructed block, for example, before it is stored in a reference picture store 264.
  • the reconstructed video 220 may be sent out (e.g., from the reference picture store 264) to drive a display device and/or to predict future video blocks.
  • a coding system may implement the example encoding/decoding workflows shown in FIGs. 1 and 2.
  • a coding system may include one or more of the functional units shown in FIGs. 1 and 2, such as a spatial prediction unit (e.g., for intra prediction), a temporal prediction unit (e.g., for inter prediction), a transform unit, a quantization unit an entropy coding unit, and/or a loop filter.
  • motion information e.g., motion vector (MV) and/or reference picture index
  • MV motion vector
  • reference picture index e.g., for each inter-coded block
  • Multiple modes e.g., two modes
  • the modes may include a merge mode and a non-merge mode, for example.
  • a MV may be coded (e.g., differentially coded) using a MV predictor and the difference between the MV and the MV predictor may be transmitted to a decoder.
  • the motion information of the block may be derived from spatial and/or temporal neighboring blocks, and a competition based scheme may be applied to select a motion (e.g., the best motion) based on a group of candidate blocks.
  • the index of the selected motion (e.g., the best candidate) may be sent to re-establish the same motion information at a decoder.
  • LIC Local illumination compensation
  • the local illumination changes may exist among temporal neighboring pictures, for example.
  • LIC may be based on a linear model.
  • LIC may apply a scaling factor and an offset to reference samples.
  • LIC may apply a scaling factor and an offset to reference samples and may obtain the prediction samples of a current block.
  • LIC may be represented by a mathematical equation such as the following:
  • P(x, y) may be a prediction signal of a current block at coordinates
  • may represent a scaling factor and an offset respectively, that may be applied to the reference block.
  • FIG. 3 is a diagram illustrating example LIC operations.
  • a least mean square error (LMSE) approach may be employed to derive the LIC parameters (e.g., a and ⁇ ).
  • the process may include minimizing the differences between neighboring samples of a current block (e.g., template samples in template ⁇ , as shown in FIG. 3) and their corresponding reference samples in one or more temporal reference pictures (e.g., reference template samples such as TO and/or T1, as shown in FIG. 3).
  • the process may minimize the difference between template samples for a current block and reference template samples neighboring temporal reference CUs that correspond to the template samples for the current CU. This may be illustrated by equations (2) and (3):
  • parameter N may represent the number of template samples that may be used to derive the LIC parameters. may represent a template sample of the current block at coordinates (3 ⁇ 4, y t ).
  • the template samples e.g., for the current CU
  • the reference template samples e.g., that are neighboring temporal reference CUs
  • may be subsampled e.g. via 2:1 subsampling
  • the shaded samples shown in FIG. 3 may be used to derive LIC parameters.
  • LIC parameters may be derived and applied for prediction directions, e.g., LO and L1.
  • LIC parameters when LIC is applied to bi-directional blocks or when a current block is predicted by two temporal prediction blocks, LIC parameters may be derived and applied for prediction directions, e.g., LO and L1.
  • the LIC parameters may be derived and applied (e.g., derived and applied separately) for different directions.
  • FIG. 3 shows that based on the two motion vectors MVO and MV1, two reference template samples TO and T1 may be obtained.
  • a bi-directional prediction signal (e.g., a bi-directional predicted signal) of the current block may be generated by combining two LIC uni-prediction blocks, as illustrated below: where a 0 and ⁇ 0 may be the LIC parameters associated with the LO motion vector a x and #, may be the LIC parameters associated with the L1 motion vector ) and
  • Motion compensation may be sub-block based.
  • Sub-block level motion compensation approaches may include advanced temporal motion vector prediction (ATMVP), spatial-temporal motion vector prediction
  • a coding block may be associated with a motion vector for a prediction direction.
  • a coding block may (e.g., in one or more of the aforementioned coding modes) be further split into multiple small sub-blocks, and motion information for a
  • a coding unit referenced herein may be or may include a coding block or a sub-block.
  • a CU may include multiple video processing and distribution units (VPDUs).
  • VPDUs video processing and distribution units
  • VPDUs depending on its size.
  • VPDU may process a region (e.g., 64x64 square region) before starting the processing of other regions (e.g., other 64x64 square regions).
  • the VPDU may be included in a hardware implementation.
  • the VPDU may impose one or more CU-sp!it restrictions. For example, if the size of a parent block has greater than 64 samples in one direction, triple tree (TT) splitting may not be allowed. For example, if the size of a resulting child CU is smaller than 64 in one direction and greater than 64 in the other direction, binary tree (BT) splitting may not be allowed.
  • TT triple tree
  • BT binary tree
  • temporal motion vector prediction may be improved, for example, by allowing a block to derive multiple motion information (e.g., information relating to motion vectors and reference indices) for sub- blocks in a current block.
  • the motion information for the sub-blocks may be derived, for example, from corresponding small blocks of a temporal neighboring picture of the current picture.
  • One or more of the following may be performed.
  • a block, such as a collocated block, corresponding to the current block may be identified in a temporal reference picture (e.g., a collocated picture).
  • the current block may be split into one or more sub-blocks.
  • Motion information of the sub-blocks may be derived based on corresponding small blocks in the collocated picture.
  • FIG. 4 is a diagram illustrating example ATMVP operations.
  • a collocated block and a collocated picture may be identified, for example, based on motion information associated with one or more spatial neighboring blocks of a current block.
  • the first available candidate in a merge candidate list may be considered, as illustrated in FIG. 4.
  • a block A may be assumed to be the first available merge candidate of the current block based on a scanning order of a merge candidate list associated with the current block.
  • a corresponding motion vector of block A e.g., MVA
  • the location of the collocated block in the collocated picture may be determined, for example, by adding the motion vector of block A (e.g., MVA) to coordinates of the current block.
  • Motion information associated with a sub-block of the current block may be derived, e.g., based on a corresponding small block of the sub-block (e.g., as indicated by the short arrows in FIG. 4) in the collocated block. This may occur for one or more sub-blocks in the current block.
  • Identified motion information of the (e.g., each) small block in the collocated block may be converted to a motion vector and a reference index for a corresponding sub-block in the current block. The conversion may be performed in a similar manner as temporal motion vector prediction (TMVP), for example where temporal motion vector scaling may be applied.
  • TMVP temporal motion vector prediction
  • FIG. 5 is a diagram illustrating example STMVP operations.
  • a current block may include four sub-blocks (e.g.. A, B, C. and D).
  • Neighboring small blocks (e.g., sub-blocks) of a current sub-block A may be labeled a, b, c, and d (e.g., shaded blocks shown in FIG. 5).
  • the neighboring small blocks may have (e.g., each have) a same size as the current sub-block A.
  • Motion derivation for the sub-block A may identify its spatial neighbors (e.g., two spatial neighbors).
  • a first neighbor may be small block c, which may be located above the current sub-block A. If small block c is not available or is intra coded, one or more other neighboring small blocks (e.g., those above the current block) may be checked in a specific order (e.g., from left to right).
  • a second neighbor of sub-block A may be small block b, which may be located to the left of the current sub-block A. If small block b is not available or is intra coded, one or more other neighboring small blocks (e.g., those to the left of the current block) may be checked in a specific order (e.g. from top to bottom). Motion information associated with the one or more spatial neighbors of the sub-block A may be fetched. Motion information associated with one or more temporal neighbors of the sub-block A may be obtained, for example, by following a procedure similar to a TMVP process. Motion information associated with available spatial and temporal neighbors (e.g., up to three) may be averaged and used as motion information for the sub-block A.
  • the STMVP process described herein may be repeated to derive motion information for the sub- blocks in the current video block.
  • the STMVP process may be repeated based on a raster scan order to derive motion information for the sub-blocks in the current video block.
  • FRUC may be performed, e.g., for inter-coded blocks.
  • signaling motion information e.g., information associated with motion vectors and/or reference indices
  • Motion information may be derived at a decoder side, for example, using template-matching and/or bilateral-matching techniques.
  • a merge candidate list associated with a current block and/or a set of preliminary motion vectors may be checked (e.g., during a motion derivation procedure at a decoder) to identify a candidate that may provide a minimum sum of absolute differences (SAD).
  • SAD minimum sum of absolute differences
  • the set of preliminary motion vectors may be generated based on one or more motion vectors associated with one or more temporal collocated blocks of the current block.
  • the candidate may be selected as a starting point
  • a local search around the starting point may be performed.
  • a local search may be based on template-matching, bilateral-matching, and/or the like.
  • a MV that may result in the minimum SAD may be taken as an MV for the entire current block.
  • Motion information may be refined at a sub-block level.
  • FIG. 6A and FIG. 6B are diagrams illustrating examples of FRUC.
  • FIG. 6A shows an example of template-matching.
  • FIG. 6B shows an example of bilateral-matching.
  • Template-matching (e.g.. as shown in FIG. 6A) may be used to derive motion information of a current block, for example, by finding a match (e.g., the best match) between a template (e.g., top and/or left neighboring blocks of the current block) in a current picture and a block (e.g., which have the same size as the template) in a reference picture.
  • Bilateral-matching e.g., as shown in FIG.
  • motion vectors e.g., MVO and MV1
  • pointing to reference blocks may be proportional to the temporal distances between a current picture and a (e.g., each) reference picture (e.g., TO and/or T1).
  • a FRUC motion search (e.g., in the context of template-matching and bilateral-matching) may be performed.
  • a CU-levei motion search may be performed.
  • An initial MV may be derived for a whole CU (e.g., a current CU).
  • Motion information associated with the CU may be refined at a sub-block level, for example, using the derived CU-ievel MV as a starting point.
  • the current CU may be split into one or more sub-blocks (e.g., Mx M sub-blocks).
  • the value of M may be calculated, for example, in accordance with equation (5) below:
  • Parameter D may be a predefined splitting depth, which may, for example, be set to 3 and signaled in a sequence parameter set (SPS).
  • SPS sequence parameter set
  • Overlapped block motion compensation may be applied to remove blocking artifact at the motion compensation stage.
  • OBMC may be performed for one or more (e.g., all) inter block boundaries except the right and bottom boundaries of a block.
  • OBMC may be performed for one or more of the sub- block's boundaries (e.g., all four of the sub-block ' s boundaries).
  • FIG. 7 is a diagram illustrating example OBMC operations.
  • OBMC may be applied to a sub-block (e.g., sub-block A in FIG. 7 and/or to the motion vector associated with the current sub-block). If OBMC is applied to a sub-block, motion vectors associated with neighboring sub-blocks (e.g., up to four neighboring sub-blocks) may be used to derive a prediction signal of the current sub-block. Prediction blocks using the motion vectors associated with the neighboring sub-blocks may be averaged to generate the prediction signal for the current sub-block.
  • a sub-block e.g., sub-block A in FIG. 7 and/or to the motion vector associated with the current sub-block.
  • motion vectors associated with neighboring sub-blocks e.g., up to four neighboring sub-blocks
  • Prediction blocks using the motion vectors associated with the neighboring sub-blocks may be averaged to generate the prediction signal for the current sub-block.
  • a weighted average may be used in OBMC to generate a prediction signal for a block.
  • a prediction signal using the motion vector of a neighboring sub-block may be denoted as PN.
  • a prediction signal using the motion vector of a current sub-block A may be denoted as PC.
  • the samples (e.g., when OBMC is applied) in certain rows and/or columns (e.g., first and/or last four rows/columns) of PN may be weight averaged with the samples at the same positions in PC.
  • the samples to which weight averaging is applied may be determined for a corresponding neighboring sub-block. For example, the samples to which weight averaging is applied may be determined for a corresponding neighboring sub-block based on the location of the neighboring sub- block.
  • the samples in the first X rows of the current sub-block may be adjusted.
  • the samples in the last X rows of the current sub-block may be adjusted, in examples, when a neighboring sub-block is to the left of the current sub-block (e.g., such as sub-block a in FIG. 7), the samples in the first X columns of the current block may be adjusted.
  • the samples in the last X columns of the current sub-block may be adjusted.
  • the values of X and/or the weights may be determined based on the coding mode used to code the current block.
  • weighting factors ⁇ 1/4, 1/8, 1/16, 1/32 ⁇ may be used for the first four rows/columns of PN and weighting factors ⁇ 3/4, 7/8, 15/16, 31/32 ⁇ may be used for the first four rows/columns of PC.
  • the first two rows/columns e.g., only the first two rows/columns
  • weighting factors ⁇ 1/4, 1/8 ⁇ may be used for PN and weighting factors ⁇ 3/4, 7/8 ⁇ may be used for PC.
  • GBi Generalized bi-prediction
  • prediction signal at sample x as shown in equation (6) may be calculated by:
  • P[x] may denote prediction signal (e.g., resulting prediction signal) of a sample x located at a picture position x.
  • ⁇ ] may indicate motion-compensated prediction signal of x using the motion vector (MV) v, for i-ih list (e.g., list 0, list 1).
  • Parameters m and w. may indicate weight values shared across one or more (e.g., all) the samples in a block.
  • one or more prediction signals may be obtained, e.g., by adjusting the weight value, such as m and w-...
  • the weight values m and/or m may be configured to imply the same prediction as uni-prediction and bi-prediction.
  • Weight value wi may be discretized, e.g font ⁇ -1/4, 1/4, 3/8, 1/2, 5/8, 3/4, 5/4 ⁇ .
  • a weight value may be indicated by an index value within a range (e.g., a small limited range).
  • FIG. 15 illustrates an example block diagram of a video encoder with GBi support
  • spatial prediction and temporal prediction may be the two pixel-domain prediction modules in the video encoder shown in FIG. 15.
  • the spatial prediction module may be similar (e.g., the same) as the one introduced in FIG. 1.
  • the temporal prediction module for motion prediction in FIG. 1 may be enhanced with GBi support, e.g., by allowing bi-prediction to combine two separate prediction signals in a weighted-averaging manner.
  • the selected weight index may be signaled in a bitstream.
  • FIG. 16 illustrates an example block diagram of a bi-prediction module. As depicted in FIG.
  • a GBi estimation module may include a process to generate inter prediction signal.
  • the GBi estimation module may perform motion estimation in a reference picture(s). For example, the GBi estimation module may search two motion vectors (MVs) (e.g., two optimal MVs) pointing to two reference blocks and may search for the weight index (e.g., optimal weight index), for example, to minimize the weighted bi-prediction error between the current video block and bi-prediction prediction.
  • MVs motion vectors
  • weight index e.g., optimal weight index
  • the prediction signal of the generalized bi-prediction may be computed, e.g., as a weighted average of the two prediction blocks.
  • FIG. 17 illustrates an example block diagram of a video decoder that supports the GBi module and decodes a bitstream produced by a video encoder (e.g., shown in FIG. 15).
  • the coding mode and prediction information may be used to derive the prediction signal, e.g., using spatial prediction or motion compensated prediction (e.g., with generalized bi-prediction support).
  • the block motion information and weight value e.g., in the form of an index indicating the weight value
  • the generalized bi-prediction module may compute the prediction signal of generalized bi-prediction, e.g., as a weighted average of the two motion compensated prediction blocks.
  • FIG. 18 illustrates an example block diagram of a bi- prediction module.
  • the GBi estimation unit may include a weight value estimation unit and a motion estimation unit
  • the GBi estimation unit may generate inter prediction signal, such as a final inter prediction signal.
  • the weight value estimation unit may search for weight index (e.g., the optimal weight index) to minimize the weighted bi-prediction error between the current video block and bi-prediction prediction.
  • GBi described herein may be or may include bi-predictJve weighted averaging (BPWA).
  • BPWA bi-predictJve weighted averaging
  • FIGs. 8A-8B is a diagram illustrating example motion compensation operations associated with generating a prediction signal for a coding block when LIC is applied.
  • a coding block may be bi-predicted and may include multiple sub-blocks (e.g., the block may be coded in a sub-block mode).
  • the dotted text blocks in FIGs. 8A-8B may describe L!C-reiated operations.
  • LIC when a current block or sub-block is bi-predicted, LIC may be applied to prediction signals in reference lists L0 and L1 separately, e.g.. as shown in equation (4).
  • LIC parameter estimation and/or UC-based sample adjustment (e.g., as shown in equation (1)) may be performed twice to generate a prediction signal for a current block or sub-block.
  • Such approaches e.g., as shown in equations (2) and (3)
  • LIC parameters may be combined with a sub-block coding mode (e.g., such as ATMVP, STMVP, FRUC, and/or the like).
  • a sub-block coding mode e.g., such as ATMVP, STMVP, FRUC, and/or the like.
  • a sub-block coding mode e.g., such as ATMVP, STMVP, FRUC, and/or the like.
  • a sub-block coding mode a block may be divided into one or more (e.g., multiple) sub- blocks and the sub-blocks may be associated with corresponding motion vectors (e.g., unique motion vectors).
  • LIC parameters may be derived for the prediction directions (e.g., L0 and L1) of the sub-blocks.
  • LIC when LIC is applied to a coding block (e.g., as shown in FIGs. 8A-8B), LIC may be enabled at a motion compensation stage (e.g., regular motion compensation stage) and/or an OBMC stage.
  • a motion compensation stage e.g., regular motion compensation stage
  • OBMC stage e.g., OBMC stage
  • LIC may be invocated one or more (e.g., multiple) occasions.
  • LIC may be invocated at the motion compensation stage and/or the OBMC stage.
  • the invoked LIC may generate a prediction signal for a current block.
  • a sub-block inside a coding block may be assigned a motion vector (e.g., its own motion vector).
  • LIC operations e.g., LIC parameter estimation and/or LIC-based sample adjustment
  • FIG. 7 may illustrate an example associated with the approach described herein. If sub-blocks
  • A, a, 6, c, and d in FIG. 7 are bi-predicted, eight LIC operations may be performed at the OBMC stage to generate a prediction signal for the sub-block A.
  • Two of the eight LIC operations may be related to LIC-based motion compensation using motion vectors associated with a neighboring sub-block. If K represents the number of sub-blocks inside a current block, a total of 10 * K LIC invocations (e.g., 2*K LIC invocations associated with regular motion compensation and 2*4*K LiC invocations associated with OBMC) may be performed to generate prediction signals for the current block.
  • LIC may be employed to compensate illumination changes (e.g., at the motion compensation stage) between one or more temporal reference pictures and a current picture.
  • LIC may be applied based on a linear model.
  • scaling factors and/or weights may be estimated (e.g., estimated separately) for the prediction directions when bi-prediction is applied.
  • LIC parameters may be estimated (e.g., estimated once) for a bi-predicted video coding unit (e.g., a block or sub-block).
  • LIC parameters may be estimated by considering the bi-prediction reference template samples (e.g., averaging reference template samples) of template samples associated with a current block or sub-block.
  • the bi-prediction reference template samples e.g., averaging reference template samples
  • fewer LIC operations e.g., one LIC parameter estimation and one UC-based sample adjustment
  • optimization approaches may be used to derive and/or adjust LIC parameters.
  • the scaling factors and offsets associated with lists L0 and L1 may be jointly optimized (e.g., jointly adjusted).
  • a coding block may be split into one or more sub-blocks, and a sub-blocks may be assigned with a motion vector.
  • a coding block may be split into one or more sub-blocks, and a sub-blocks may be assigned with a motion vector.
  • a skilled person in the art will realize that the approaches described herein may be applied to video blocks coded in a different coding mode (e.g., the coding block that may not be split and/or may not have a single motion).
  • a current block and/or a current sub-block may be bi-predicted.
  • LIC parameters may be derived (e.g., separately derived) and applied for reference lists L0 and L1.
  • LIC prediction signals associated with the reference lists may be averaged to generate a prediction signal for a current block or sub-block.
  • LMSE-based LIC derivation may be performed one or more times.
  • Bi-prediction reference template samples may be generated for template samples associated with a current block or sub-block.
  • Reference template samples may be identified, for example, based on one or more motion vectors associated with the current block or sub- block.
  • the reference template samples may neighbor temporal reference CUs of the current CU and may correspond to template samples for the current CU.
  • the reference template samples may be jointly considered (e.g., averaged) in LIC parameter derivation.
  • the identified reference template samples for template samples may be averaged to generate bi-predicted reference template samples.
  • LMSE-based approaches may be applied to derive LIC parameters that may be used to adjust a prediction signal for the current block or sub-block.
  • the LMSE-based approaches may be performed to determine the LIC parameters such that the differences between the bi-predicted reference template reference samples and the template samples for the current CU may be minimized.
  • LIC parameters may be calculated based on using a linear model approach.
  • a linear model approach may use a minimum value and/or a maximum value associated with the bi- predicted reference template samples and the template samples. The minimum and/or maximum values of the template samples and the bi-predicted reference templates samples may be used to determine the LIC parameters.
  • FIG. 9 is a diagram illustrating example LIC operations as described herein (e.g., for bi-directional prediction or bi-predicted CU).
  • T(x, y) may represent a template sample for a current block or sub-block at coordinates ( may respectively represent reference
  • template samples neighboring temporal reference CUs e.g., LO and L1 lists, respectively
  • the reference template samples may be derived based on bidirectional motion vectors (vg, v$) and (y1 ⁇ 2, v$) of the current block or sub-block.
  • a bi-predicted reference template sample of the template samples may be generated.
  • a bi-predicted reference template sample may be generated based on equation (8) by averaging the identified reference template samples (e.g., that are associated with neighboring temporal reference CUs such as LO and L1 shown in FIG. 9) of the template samples for the current CU.
  • LMSE-based approaches may be used to derive LIC parameters, such as a scaling factor and/or an offset associated with LIC.
  • the scaling factors and/or offset associated with LIC may be derived using the LMSE-based approaches, for example, by minimizing the difference between template samples (e.g., for the current CU) and corresponding bi-predicted reference template samples (e.g., bi-directional reference samples), as illustrated by equations (9) and (10).
  • Parameter N may represent the number of template samples associated with a current block/sub-block.
  • LMSE approaches described herein may be an example of deriving LIC parameters.
  • one or more approaches such as linear model approaches described herein, may be used to derive LIC parameters using bi-predicted reference template samples.
  • the derived LIC parameters may be applied to the bi-predicted reference template samples signal of the current block or sub-block based on a linear model, e.g., as illustrated by equation (11).
  • the prediction signal of the current block or sub-block may be the prediction signal of the current block or sub-block.
  • L0 and L1 may be the two reference blocks and/or sub-blocks of the current block or sub-block associated with L0 and L1, respectively.
  • FIGs. 10A-10B are diagrams illustrating example motion compensation operations after the bi-directional LIC described herein is applied.
  • Parameter K may represent the total number of sub-blocks within a current coding block. As illustrated in FIGs. 8A-8B, estimating LIC parameters for one or more prediction directions separately may result in approximately 10*K LIC operations to generate a prediction signal for the current block. Using the approaches illustrated in FIGs. 1QA-10B, approximately 5*K LIC operations may be performed to generate the prediction signals for the current block.
  • the 5*K LIC operations may include, for example, approximately K LIC operations associated with regular motion compensation and approximately 4*K LIC operations associated with OBMC.
  • LIC may be enabled at OBMC stage.
  • LIC may be enabled when LIC is applied to a coding block.
  • Enabling LIC at the OBMC stage may result in one or more (e.g., multiple) LIC invocations and may generate a prediction signal for a current block.
  • a sub-block mode e.g., ATMVP, STMVP.
  • the number of LIC invocations may increase further, e.g., since LIC parameter derivation may be frequently invoked during OBMC-based motion compensation using motion vectors associated with a spatial neighbor of a current sub-block.
  • Reference template samples may be combined to derive LIC parameters at the OBMC stage.
  • LIC operations at the OBMC stage may be simplified.
  • the reference template samples associated with a template sample for a current block or sub-block may be combined (e.g., by averaging the reference template samples).
  • a pair of scaling factor and offset may be estimated.
  • a pair of scaling factor and offset may be estimated by minimizing the differences between the template samples and the combined reference template samples.
  • the pair of scaling factor and offset may be used for OBMC-based motion compensation of the current block or sub-block. Using the example shown in FIG.
  • a combined prediction signal for the template samples of the current sub-block A may be generated by averaging corresponding reference template samples using the motion vectors of the neighboring sub-blocks, e.g., four neighboring sub-blocks such as a, b, c, and d.
  • Averaging reference template samples using the motion vectors of the neighboring sub-blocks may be illustrated by equation (12).
  • a set of LIC parameters may be estimated by applying LMSE-based optimization to minimize the differences between based on equations (9) and (10). The derived
  • values of the LIC parameters may be used for OBMC-based motion compensation from the neighboring sub-blocks a, 6, c, and d (e.g., for one or more OBMC-based motion compensations from the neighboring sub-blocks a, b, c, and d).
  • FIGs. 11A-11B are diagrams illustrating example motion compensation operations when LIC parameters are derived (e.g., derived once) at an OBMC stage.
  • the total number of LIC derivations may be reduced to 2*K (e.g., with K derivations for regular motion compensation and K derivations for OBMC).
  • LIC parameter derivation and sample adjustment may be performed, e.g., for regular motion compensation and/or OBMC.
  • LIC parameters derived during regular motion compensation may be reused for OBMC.
  • LIC parameters may be derived and stored for one or more sub-blocks inside a current block at the regular motion compensation stage.
  • the stored LIC parameters may be reused (e.g., fetched) for OBMC-based motion compensation of a current sub-block.
  • FIGs. 12A-12B are diagrams illustrating example motion compensation operations during which LIC parameters derived from regular motion compensation may be reused for OBMC.
  • the total number of LIC derivations may be reduced to approximately K (e.g., from 2*Kwith K derivations for regular motion compensation and K derivations for OBMC) if the LIC parameters are reused.
  • the number of LIC parameter derivations may be reduced.
  • the total number of LIC-based sample adjustments (e.g., according to equation (1)) that may be performed at the regular motion compensation stage and/or the OBMC stage may be similar to (e.g., the same as), for example that in JEM.
  • approximately 5*K LIC-based sample adjustments e.g., K LIC-based sample adjustment may occur at the regular motion compensation stage and 4*K LIC-based sample adjustments may occur at the OBMC stage
  • K LIC-based sample adjustment may occur at the regular motion compensation stage and 4*K LIC-based sample adjustments may occur at the OBMC stage
  • on-chip memory may be used to store the LIC parameters (e.g., scaling factors a and offsets ⁇ ).
  • scaling factors a and offsets ⁇ For example, a maximum coding tree unit (CTU) size may be 128*128, and a sub-block size may be 4*4.
  • Scaling factor a and offset ⁇ may respectively represent with a precisions of 5-bit and the bit-depth of the input video.
  • LIC-based sample adjustment and the calculation of the weighted-average of multiple prediction samples in OBMC may involve linear operations.
  • the impact of rounding errors e.g., which may be caused by converting floating-point operations to fixed-point operations
  • Coding performances before and after changing the order of LIC-based sample adjustment and OBMC-based sample averaging may be similar to each other.
  • FIGs. 13A-13B depict example motion compensation operations using the approaches described herein.
  • regular motion compensation may be applied to generate a motion-compensated prediction signal for sub-blocks inside a CU.
  • OBMC may be applied to the sub-blocks (e.g., sub-blocks inside the CU) by combining the prediction signal of the sub-block with one or more prediction signals generated using the motion vectors of one or more spatial neighbors.
  • LIC parameters may be derived (e.g., calculated) for one or more sub- block of the CU using the bi-directional LIC parameter derivation approaches described herein.
  • the prediction samples of the sub-block may be adjusted using the derived LIC parameters. For example, as shown in FIGs. 13A-13B, the total number of LIC-based operations for LIC-based parameter derivation and/or LIC-based sample adjustment may be reduced to K.
  • Storage of LIC parameters may be omitted (e.g., since LIC is performed after OBMC) such that memory space (e.g., memory buffers) that would be used to cache the LIC parameters may be saved.
  • LIC parameter derivation and/or LIC-based sample adjustment may be performed after the OBMC of a sub-block is finished. Using this approach, the storing of LIC parameters may be omitted.
  • LIC parameter derivation may be performed at the regular motion compensation stage.
  • the derived LIC parameters may be used for sample adjustment.
  • the derived LIC parameters may be used for sample adjustment after the OBMC of a sub-block is finished and a OBMC prediction signal (e.g., a combined OBMC prediction signal) has been generated.
  • LIC-based sample adjustment may be disabled at the regular motion compensation stage. If LIC-based sample adjustment is disabled at the regular motion compensation stage, the LIC parameters derived at the regular motion compensation stage may not be used to adjust prediction samples generated from the regular motion compensation stage.
  • FIGs. 14A-14B illustrates example motion compensation operations using the approaches described herein (e.g., motion compensation by deriving the LIC parameters at the regular motion compensation stage and performing the LIC-based sample adjustment after the OBMC).
  • LIC parameter derivation and OBMC may be performed in parallel (e.g., the derivation of LIC parameters and the OBMC for a sub-block may be performed simultaneously and/or in parallel).
  • LIC-adjusted prediction samples may be obtained with reduced latency (e.g., minimum latency).
  • LIC simplification process described herein may be implemented in combination with other LIC schemes.
  • the LIC simplification process as described herein may be combined with a LIC design.
  • the LIC parameters may be derived (e.g., derived separately) and applied for prediction lists L0 and L1, e.g., as shown in FIGs. 13A-13B and FIGs. 14A-14B.
  • LIC-adjusted prediction signals may be averaged to generate the prediction signal of a sub-block.
  • two different sets of LIC parameters e.g., which may include scaling factors and offsets
  • LIC operations may be disabled at the OBMC stage. For example, LIC may be skipped during OBMC-based motion compensation of one or more sub-blocks within a current block (e.g., using motion vectors associated with the neighbors of a sub-block). In examples, LIC may be disabled regardless of whether the LIC is applied to the current block during regular motion compensation.
  • LIC operation® may be disabled for the sub-block coding modes (e.g., ATMVP, STMVP, FRUC, and/or the like).
  • the block(s) may be divided (e.g., further divided) into one or more (e.g., multiple) sub-blocks, each with motion vector (e.g., unique motion vector) to generate a fine granularity motion field.
  • motion vector e.g., unique motion vector
  • LIC parameters e.g., LIC scaling factors and offsets
  • reference list LO and reference list L1 may be optimized.
  • LIC parameters may be optimized jointly (e.g., jointly adjusted).
  • a template sample for a current CU and motion-compensated reference template samples e.g., associated with reference lists LO and L1 may be used as inputs to jointly optimize (e.g., jointly adjust) the scaling factors and offsets in LO and L1.
  • the distortion e.g., differences
  • an LMSE estimation may be performed as follows:
  • parameter N may represent a number of template samples associated with a current block or sub- block. Samples may represent reference template
  • Respective sets of LIC parameters may be determined for the reference lists LO and L1 such
  • Such difference may be calculated, for example, by subtracting LIC-adjusted reference samples for both LO and L1 from multiple (e.g., 2) template samples.
  • LIC techniques may be simplified for bi-prediction CUs with GBi. If GBi/BPWA is enabled, a weight index may be signaled for bi-prediction CUs. GBi may be performed on top of LIC. For example, LIC may be applied to the reference lists L0 and L1 for the two prediction blocks (e.g., each of the two prediction blocks). Generalized bi-prediction weights provided for the two illumination compensated prediction blocks for bi- prediction (e.g., each of the two illumination compensated prediction blocks for bi-prediction) may be used to combine the prediction templates. [0101] Generalized bi-prediction may be performed on the template samples from two prediction lists and may produce GBi-based bi-prediction template reference samples.
  • the LIC parameters may be estimated.
  • the LIC parameters may be estimated using the GBi-based bi-prediction template reference samples and the template samples of the current CU.
  • GBi and LIC may be performed (e.g. : GBi followed by LIC) on bi-directional prediction signal of the current block/sub-block.
  • the bidirectional prediction signal of the template may be generated.
  • the bi-directional prediction signal of the template may be generated by weighted averaging two reference samples of the template in LO and L1.
  • [0103] may denote the bi-directional prediction signal of the template.
  • w may denote the GBi weights applied to L0 and L1 reference samples.
  • Linear model parameter derivation such as LMSE-based procedure described herein, may be used to calculate the values of the scaling factor and the offset used for the LIC, e.g., by minimizing the difference between the template samples and the bi-directional reference samples given by equations (9) and (10), where ) calculated using equation (14) may be used in place of T
  • the derived LIC parameters may be applied to the bi-directional prediction signal of the current block/sub-block based on the linear model, e.g.,
  • P(x, y) may indicate the prediction signal of the current block/sub-block.
  • Parameters a i and may indicate the LIC slope and offset parameters.
  • FIG. 19A is a diagram illustrating an example communications system 100 in which one or more disclosed embodiments may be implemented.
  • the communications system 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc., to multiple wireless users.
  • the communications system 100 may enable multiple wireless users to access such content through the sharing of system resources, including wireless bandwidth.
  • the communications systems 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc., to multiple wireless users.
  • the communications system 100 may enable multiple wireless users to access such content through the sharing of system resources, including wireless bandwidth.
  • the communications systems 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc., to multiple wireless users.
  • the communications system 100 may enable multiple wireless users to access such content through the sharing of system resources, including wireless bandwidth.
  • the communications systems 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc.
  • CDMA code division multiple access
  • TDMA time division multiple access
  • FDMA frequency division multiple access
  • OFDMA orthogonal FDMA
  • SC-FDMA single-carrier FDMA
  • ZT UW DTS-s OFDM zero-tail unique-word DFT-Spread OFDM
  • UW-OFDM unique word OFDM
  • FBMC filter bank multicarrier
  • the communications system 100 may include wireless transmit/receive units (WTRUs) 102a, 102b, 102c, 102d, a RAN 104/113, a CN 106/115, a public switched telephone network (PSTN) 108, the Internet 110, and other networks 112, though it will be appreciated that the disclosed embodiments contemplate any number of WTRUs, base stations, networks, and/or network elements.
  • WTRUs 102a, 102b, 102c, 102d may be any type of device configured to operate and/or communicate in a wireless environment.
  • the WTRUs 102a, 102b, 102c, 102d may be configured to transmit and/or receive wireless signals and may include a user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit a pager, a cellular telephone, a personal digital assistant (PDA), a smartphone, a laptop, a netbook, a personal computer, a wireless sensor, a hotspot or Mi-Fi device, an Internet of Things (loT) device, a watch or other wearable, a head-mounted display (HMD), a vehicle, a drone, a medical device and applications (e.g., remote surgery), an industrial device and applications (e.g., a robot and/or other wireless devices operating in an industrial and/or an automated processing chain contexts), a consumer electronics device, a device operating on commercial and/or industrial wireless networks, and the like.
  • UE user equipment
  • PDA personal digital assistant
  • HMD head-mounted display
  • a vehicle a drone,
  • the communications systems 100 may also include a base station 114a and/or a base station 114b.
  • Each of the base stations 114a, 114b may be any type of device configured to wirelessly interface with at least one of the WTRUs 102a, 102b, 102c, 102d to facilitate access to one or more communication networks, such as the CN 106/115, the I nternet 110, and/or the other networks 112.
  • the base stations 114a, 114b may be a base transceiver station (BTS), a Node-B, an eNode B, a Home Node B, a Home eNode B, a gNB, a NR NodeB, a site controller, an access point (AP), a wireless router, and the like. While the base stations 114a, 114b are each depicted as a single element it will be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and/or network elements.
  • the base station 114a may be part of the RAN 104/113, which may also include other base stations and/or network elements (not shown), such as a base station controller (BSC), a radio network controller (RNC). relay nodes, etc.
  • BSC base station controller
  • RNC radio network controller
  • the base station 114a and/or the base station 114b may be configured to transmit and/or receive wireless signals on one or more carrier frequencies, which may be referred to as a cell (not
  • a cell may provide coverage for a wireless service to a specific geographical area that may be relatively fixed or that may change over time.
  • the cell may further be divided into cell sectors.
  • the cell associated with the base station 114a may be divided into three sectors.
  • the base station 114a may include three transceivers, i.e., one for each sector of the cell.
  • the base station 114a may employ multiple-input multiple output (MIMO) technology and may utilize multiple transceivers for each sector of the cell.
  • MIMO multiple-input multiple output
  • beamfonming may be used to transmit and/or receive signals in desired spatial directions.
  • the base stations 114a, 114b may communicate with one or more of the WTRUs 102a, 102b, 102c, 102d over an air interface 116, which may be any suitable wireless communication link (e.g., radio frequency (RF), microwave, centimeter wave, micrometer wave, infrared (IR), ultraviolet (UV), visible light etc.).
  • the air interface 116 may be established using any suitable radio access technology (RAT).
  • RAT radio access technology
  • the communications system 100 may be a multiple access system and may employ one or more channel access schemes, such as CDMA, TDMA, FDMA, OFDMA, SC- FDMA. and the like.
  • the base station 114a in the RAN 104/113 and the WTRUs 102a, 102b, 102c may implement a radio technology such as Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA), which may establish the air interface 115/116/117 using wideband CDMA (WCDMA).
  • WCDMA may include communication protocols such as High-Speed Packet Access (HSPA) and/or Evolved HSPA (HSPA+).
  • HSPA may include High-Speed Downlink (DL) Packet Access (HSDPA) and/or High-Speed UL Packet Access (HSUPA).
  • the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as Evolved UMTS Terrestrial Radio Access (E-UTRA), which may establish the air interface 116 using Long Term Evolution (LTE) and/or LTE-Advanced (LTE-A) and/or LTE-Advanced Pro (LTE-A Pro).
  • E-UTRA Evolved UMTS Terrestrial Radio Access
  • LTE Long Term Evolution
  • LTE-A LTE-Advanced
  • LTE-A Pro LTE-Advanced Pro
  • the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as NR Radio Access , which may establish the air interface 116 using New Radio (NR).
  • a radio technology such as NR Radio Access , which may establish the air interface 116 using New Radio (NR).
  • the base station 114a and the WTRUs 102a, 102b, 102c may implement multiple radio access technologies.
  • the base station 114a and the WTRUs 102a, 102b, 102c may implement LTE radio access and NR radio access together, for instance using dual connectivity (DC) principles.
  • DC dual connectivity
  • the air interface utilized by WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and/or transmissions sent to/from multiple types of base stations (e.g., a eNB and a gNB).
  • the base station 114a and the WTRUs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, interim Standard 2000 (IS- 2000), Interim Standard 95 (IS-95). interim Standard 856 (IS-856), Global System for Mobile communications (GSM), Enhanced Data rates for GSM Evolution (EDGE), GSM EDGE (GERAN), and the like.
  • IEEE 802.11 i.e., Wireless Fidelity (WiFi)
  • IEEE 802.16 i.e., Worldwide Interoperability for Microwave Access (WiMAX)
  • CDMA2000, CDMA2000 1X, CDMA2000 EV-DO interim Standard 2000 (IS- 2000), Interim Standard 95 (IS-95).
  • IS-856 Global System for Mobile communications
  • GSM Global System
  • the base station 114b in FIG. 19A may be a wireless router, Home Node B, Home eNode B, or access point for example, and may utilize any suitable RAT for facilitating wireless connectivity in a localized area, such as a place of business, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a roadway, and the like.
  • the base station 114b and the WTRUs 102c, 102d may implement a radio technology such as IEEE 802.11 to establish a wireless local area network (WLAN).
  • WLAN wireless local area network
  • the base station 114b and the WTRUs 102c, 102d may implement a radio technology such as IEEE 802.15 to establish a wireless personal area network (WPAN).
  • the base station 114b and the WTRUs 102c, 102d may utilize a cellular-based RAT (e.g., WCDMA. CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR etc.) to establish a picocell or femtocell.
  • the base station 114b may have a direct connection to the Internet 110.
  • the base station 114b may not be required to access the Internet 110 via the CN 106/115.
  • the RAN 104/113 may be in communication with the CN 106/115, which may be any type of network configured to provide voice, data, applications, and/or voice over internet protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d.
  • the data may have varying quality of service (QoS) requirements, such as differing throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, and the like.
  • QoS quality of service
  • the CN 106/115 may provide call control, billing services, mobile location-based services, pre-paid calling, Internet connectivity, video distribution, etc., and/or perform high-level security functions, such as user authentication.
  • the RAN 104/113 and/or the CN 106/115 may be in direct or indirect communication with other RANs that employ the same RAT as the RAN 104/113 or a different RAT.
  • the CN 106/115 may also be in communication with another RAN (not shown) employing a GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology.
  • the CN 106/115 may also serve as a gateway for the WTRUs 102a, 102b, 102c, 102d to access the PSTN 108, the Internet 110, and/or the other networks 112.
  • the PSTN 108 may include circuit-switched telephone networks that provide plain old telephone service (POTS).
  • POTS plain old telephone service
  • the Internet 110 may include a global
  • the networks 112 may include wired and/or wireless communications networks owned and/or operated by other service providers.
  • the networks 112 may include another CN connected to one or more RANs, which may employ the same RAT as the RAN 104/113 or a different RAT.
  • Some or all of the WTRUs 102a, 102b, 102c, 102d in the communications system 100 may include multi-mode capabilities (e.g., the WTRUs 102a, 102b, 102c, 102d may include multiple transceivers for communicating with different wireless networks over different wireless links).
  • the WTRU 102c shown in FIG. 19A may be configured to communicate with the base station 114a, which may employ a cellular-based radio technology, and with the base station 114b, which may employ an IEEE 802 radio technology.
  • FIG. 19B is a system diagram illustrating an example WTRU 102.
  • the WTRU 102 may include a processor 118, a transceiver 120, a transmit/receive element 122, a speaker/microphone 124, a keypad 126, a display/touchpad 128, non-removable memory 130, removable memory 132, a power source 134, a global positioning system (GPS) chipset 136, and/or other peripherals 138, among others.
  • GPS global positioning system
  • the processor 118 may be a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors in association with a DSP core, a controller, a microcontroller, Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) circuits, any other type of integrated circuit (IC), a state machine, and the like.
  • the processor 118 may perform signal coding, data processing, power control, input/Output processing, and/or any other functionality that enables the WTRU 102 to operate in a wireless environment
  • the processor 118 may be coupled to the transceiver 120, which may be coupled to the transmit/receive element 122. While FIG. 19B depicts the processor 118 and the transceiver 120 as separate components, it will be appreciated that the processor 118 and the transceiver 120 may be integrated together in an electronic package or chip.
  • the transmit/receive element 122 may be configured to transmit signals to, or receive signals from, a base station (e.g., the base station 114a) over the air interface 116.
  • a base station e.g., the base station 114a
  • the transmit/receive element 122 may be an antenna configured to transmit and/or receive RF signals.
  • the transmit/receive element 122 may be an emitter/detector configured to transmit and/or
  • the transmit/receive element 122 may be configured to transmit and/or receive both RF and light signals. It will be appreciated that the transmit/receive element 122 may be configured to transmit and/or receive any combination of wireless signals.
  • the WTRU 102 may include any number of transmit/receive elements 122. More specifically, the WTRU 102 may employ MIMO technology. Thus, in one embodiment the WTRU 102 may include two or more transmit/receive elements 122 (e.g., multiple antennas) for transmitting and receiving wireless signals over the air interface 116.
  • the transceiver 120 may be configured to modulate the signals that are to be transmitted by the transmit/receive element 122 and to demodulate the signals that are received by the transmit/receive element 122.
  • the WTRU 102 may have multi-mode capabilities.
  • the transceiver 120 may include multiple transceivers for enabling the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11, for example.
  • the processor 118 of the WTRU 102 may be coupled to, and may receive user input data from, the speaker/microphone 124, the keypad 126, and/or the display/touchpad 128 (e.g., a liquid crystal display (LCD) display unit or organic light-emitting diode (OLED) display unit).
  • the processor 118 may also output user data to the speaker/microphone 124, the keypad 126, and/or the display/touchpad 128.
  • the processor 118 may access information from, and store data in, any type of suitable memory, such as the non-removable memory 130 and/or the removable memory 132.
  • the non-removable memory 130 may include random-access memory (RAM), read-only memory (ROM), a hard disk, or any other type of memory storage device.
  • the removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like.
  • SIM subscriber identity module
  • SD secure digital
  • the processor 118 may access infonmation from, and store data in, memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).
  • the processor 118 may receive power from the power source 134. and may be configured to distribute and/or control the power to the other components in the WTRU 102.
  • the power source 134 may be any suitable device for powering the WTRU 102.
  • the power source 134 may include one or more dry cell batteries (e.g., nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel metal hydride (NiMH), lithium-ion (Li- ion), etc.), solar cells, fuel cells, and the like.
  • the processor 118 may also be coupled to the GPS chipset 136, which may be configured to provide location information (e.g., longitude and latitude) regarding the current location of the WTRU 102. In addition to, or in lieu of, the information from the GPS chipset 136, the WTRU 102 may receive location information (e.g., longitude and latitude) regarding the current location of the WTRU 102. In addition to, or in lieu of, the information from the GPS chipset 136, the WTRU 102 may receive location
  • the WTRU 102 may acquire location information by way of any suitable location-determination method while remaining consistent with an embodiment.
  • the processor 118 may further be coupled to other peripherals 138, which may include one or more software and/or hardware modules that provide additional features, functionality and/or wired or wireless connectivity.
  • the peripherals 138 may include an accelerometer, an e-compass, a satellite transceiver, a digital camera (for photographs and/or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands free headset, a Bluetooth® module, a frequency modulated (FM) radio unit, a digital music player, a media player, a video game player module, an Internet browser, a Virtual Reality and/or Augmented Reality (VR/AR) device, an activity tracker, and the like.
  • FM frequency modulated
  • the peripherals 138 may include one or more sensors, the sensors may be one or more of a gyroscope, an accelerometer, a hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor, and/or a humidity sensor.
  • a gyroscope an accelerometer, a hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor, and/or a humidity sensor.
  • the WTRU 102 may include a full duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for both the UL (e.g., for transmission) and downlink (e.g., for reception) may be concurrent and/or simultaneous.
  • the full duplex radio may include an interference management unit to reduce and or substantially eliminate self-interference via either hardware (e.g., a choke) or signal processing via a processor (e.g., a separate processor (not shown) or via processor 118).
  • the WRTU 102 may include a half-duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for either the UL (e.g., for transmission) or the downlink (e.g., for reception)).
  • a half-duplex radio for which transmission and reception of some or all of the signals (e.g., associated with particular subframes for either the UL (e.g., for transmission) or the downlink (e.g., for reception)).
  • FIG. 19C is a system diagram illustrating the RAN 104 and the CN 106 according to an embodiment
  • the RAN 104 may employ an E-UTRA radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116.
  • the RAN 104 may also be in commu nication with the CN 106.
  • the RAN 104 may include eNode-Bs 160a, 160b, 160c, though it will be appreciated that the RAN 104 may include any number of eNode-Bs while remaining consistent with an embodiment.
  • the eNode-Bs 160a, 160b, 160c may each include one or more transceivers tor communicating with the WTRUs 102a, 102b, 102c over the air interface 116.
  • the eNode-Bs 160a. 160b, 160c may implement MIMO
  • the eNode-B 160a may use multiple antennas to transmit wireless signals to, and/or receive wireless signals from, the WTRU 102a.
  • Each of the eNode-Bs 160a, 160b, 160c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in the UL and/or DL, and the like. As shown in FIG. 19C, the eNode-Bs 160a, 160b, 160c may communicate with one another over an X2 interface.
  • the CN 106 shown in FIG. 19C may include a mobility management entity (MME) 162, a serving gateway (SGW) 164, and a packet data network (PDN) gateway (or PGW) 166. While each of the foregoing elements are depicted as part of the CN 106, it will be appreciated that any of these elements may be owned and/or operated by an entity other than the CN operator.
  • MME mobility management entity
  • SGW serving gateway
  • PGW packet data network gateway
  • the MME 162 may be connected to each of the eNode-Bs 162a. 162b, 162c in the RAN 104 via an S1 interface and may serve as a control node.
  • the MME 162 may be responsible for
  • the MME 162 may provide a control plane function for switching between the RAN 104 and other RANs (not shown) that employ other radio technologies, such as GSM and/or WCDMA.
  • the SGW 164 may be connected to each of the eNode Bs 160a, 160b, 160c in the RAN 104 via the S1 interface.
  • the SGW 164 may generally route and forward user data packets to/from the WTRUs 102a, 102b, 102c.
  • the SGW 164 may perform other functions, such as anchoring user planes during inter-eNode B handovers, triggering paging when DL data is available for the WTRUs 102a, 102b, 102c, managing and storing contexts of the WTRUs 102a, 102b, 102c, and the like.
  • the SGW 164 may be connected to the PGW 166, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices.
  • packet-switched networks such as the Internet 110
  • the CN 106 may facilitate communications with other networks.
  • the CN 106 may provide the WTRUs 102a, 102b, 102c with access to circuit-switched networks, such as the PSTN 108, to facilitate communications between the WTRUs 102a, 102b, 102c and traditional land-line communications devices.
  • the CN 106 may include, or may communicate with, an IP gateway (e.g., an IP multimedia subsystem (IMS) server) that serves as an interface between the CN 106 and the PSTN 108.
  • IMS IP multimedia subsystem
  • the CN 106 may provide the WTRUs 102a, 102b, 102c with access to the other networks 112, which may include other wired and/or wireless networks that are owned and/or operated by other service providers.
  • the WTRU is described in FIGs. 19A-19D as a wireless terminal, it is contemplated that in certain representative embodiments that such a terminal may use (e.g., temporarily or permanently) wired communication interfaces with the communication network.
  • the other network 112 may be a WLAN.
  • a WLAN in Infrastructure Basic Service Set (BSS) mode may have an Access Point (AP) for the BSS and one or more stations (STAs) associated with the AP.
  • the AP may have an access or an interface to a Distribution System (DS) or another type of wired/wireless network that carries traffic in to and/or out of the BSS.
  • Traffic to STAs that originates from outside the BSS may arrive through the AP and may be delivered to the STAs.
  • Traffic originating from STAs to destinations outside the BSS may be sent to the AP to be delivered to respective destinations.
  • Traffic between STAs within the BSS may be sent through the AP, for example, where the source STA may send traffic to the AP and the AP may deliver the traffic to the destination STA.
  • the traffic between STAs within a BSS may be considered and/or referred to as peer-to-peer traffic.
  • the peer-to- peer traffic may be sent between (e.g., directly between) the source and destination STAs with a direct link setup (DLS).
  • the DLS may use an 802.11e DLS or an 802.11z tunneled DLS (TDLS).
  • a WLAN using an Independent BSS (!BSS) mode may not have an AP, and the STAs (e.g., all of the STAs) within or using the IBSS may communicate directly with each other.
  • communication may sometimes be referred to herein as an "ad-hoc" mode of communication.
  • the AP may transmit a beacon on a fixed channel, such as a primary channel.
  • the primary channel may be a fixed width (e.g., 20 MHz wide bandwidth) or a dynamically set width via signaling.
  • the primary channel may be the operating channel of the BSS and may be used by the STAs to establish a connection with the AP.
  • Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) may be implemented, for example in in 802.11 systems.
  • the STAs e.g., every STA, including the AP, may sense the primary channel. If the primary channel is sensed/detected and/or determined to be busy by a particular STA, the particular STA may back off.
  • One STA (e.g., only one station) may transmit at any given time in a given BSS.
  • High Throughput (HT) STAs may use a 40 MHz wide channel for communication, for example, via a combination of the primary 20 MHz channel with an adjacent or nonadjacent 20 MHz channel to form a 40 MHz wide channel.
  • VHT STAs may support 20MHz, 40 MHz. 80 MHz, and/or 160 MHz wide channels.
  • the 40 MHz, and/or 80 MHz, channels may be formed by combining contiguous 20 MHz channels.
  • a 160 MHz channel may be formed by combining 8 contiguous 20 MHz channels, or by combining two noncontiguous 80 MHz channels, which may be referred to as an 80+80 configuration.
  • 80+80 For the 80+80
  • the data after channel encoding, may be passed through a segment parser that may divide the data into two streams.
  • the streams may be mapped on to the two 80 MHz channels, and the data may be transmitted by a transmitting STA.
  • the above described operation for the 80+80 configuration may be reversed, and the combined data may be sent to the Medium Access Control (MAC).
  • MAC Medium Access Control
  • Sub 1 GHz modes of operation are supported by 802.11 af and 802.11 ah.
  • the channel operating bandwidths, and carriers, are reduced in 802.11 af and 802.11 ah relative to those used in 802.11 n, and 802.11ac.
  • 802.11af supports 5 MHz, 10 MHz and 20 MHz bandwidths in the TV White Space (TVWS) spectrum
  • 802.11 ah supports 1 MHz, 2 MHz, 4 MHz, 8 MHz, and 16 MHz bandwidths using non-TVWS spectrum.
  • 802.11 ah may support Meter Type Control/Machine- Type Communications, such as MTC devices in a macro coverage area.
  • MTC devices may have certain capabilities, for example, limited capabilities including support for (e.g., only support for) certain and/or limited bandwidths.
  • the MTC devices may include a battery with a battery life above a threshold (e.g., to maintain a very long battery life).
  • WLAN systems which may support multiple channels, and channel bandwidths, such as 802.11 n, 802.11ac, 802.11af. and 802.11 ah, include a channel which may be designated as the primary channel.
  • the primary channel may have a bandwidth equal to the largest common operating bandwidth supported by all STAs in the BSS.
  • the bandwidth of the primary channel may be set and/or limited by a STA, from among all STAs in operating in a BSS, which supports the smallest bandwidth operating mode.
  • the primary channel may be 1 MHz wide for STAs (e.g., MTC type devices) that support (e.g., only support) a 1 MHz mode, even if the AP, and other STAs in the BSS support 2 MHz, 4 MHz, 8 MHz, 16 MHz, and/or other channel bandwidth operating modes.
  • Carrier sensing and/or Network Allocation Vector (NAV) settings may depend on the status of the primary channel. If the primary channel is busy, for example, due to a STA (which supports only a 1 MHz operating mode), transmitting to the AP, the entire available frequency bands may be considered busy even though a majority of the frequency bands remains idle and may be available.
  • STAs e.g., MTC type devices
  • NAV Network Allocation Vector
  • the available frequency bands which may be used by 802.11 ah, are from 902 MHz to 928 MHz. In Korea, the available frequency bands are from 917.5 MHz to 923.5 MHz. In Japan, the available frequency bands are from 916.5 MHz to 927.5 MHz. The total bandwidth available tor 802.11 ah is 6 MHz to 26 MHz depending on the country code.
  • FIG. 19D is a system diagram illustrating the RAN 113 and the CN 115 according to an embodiment
  • the RAN 113 may employ an NR radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116.
  • the RAN 113 may also be in communication with the CN 115.
  • the RAN 113 may include gNBs 180a, 180b, 180c, though it will be appreciated that the RAN 113 may include any number of gNBs while remaining consistent with an embodiment
  • the gNBs 180a, 180b, 180c may each include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116.
  • the gNBs 180a, 180b, 180c may implement MIMO technology.
  • gNBs 180a, 108b may utilize beamforming to transmit signals to and/or receive signals from the gNBs 180a, 180b, 180c.
  • the gNB 180a may use multiple antennas to transmit wireless signals to, and/or receive wireless signals from, the WTRU 102a.
  • the gNBs 180a, 180b, 180c may implement carrier aggregation technology.
  • the gNB 180a may transmit multiple component carriers to the WTRU 102a (not shown). A subset of these component earners may be on unlicensed spectrum while the remaining component carriers may be on licensed spectrum.
  • the gNBs 180a, 180b. 180c may implement Coordinated Multi-Point (CoMP) technology.
  • WTRU 102a may receive coordinated transmissions from gNB 180a and gNB 180b (and/or gNB 180c).
  • CoMP Coordinated Multi-Point
  • the WTRUs 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c using transmissions associated with a scalable numerology. For example, the OFDM symbol spacing and/or OFDM subcarrier spacing may vary for different transmissions, different cells, and/or different portions of the wireless transmission spectrum.
  • the WTRUs 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c using subframe or transmission time intervals (TTIs) of various or scalable lengths (e.g., containing varying number of OFDM symbols and/or lasting varying lengths of absolute time).
  • TTIs subframe or transmission time intervals
  • the gNBs 180a, 180b, 180c may be configured to communicate with the WTRUs 102a, 102b. 102c in a standalone configuration and/or a non-standalone configuration. In the standalone configuration, WTRUs
  • 102a, 102b, 102c may communicate with gNBs 180a, 180b, 180c without also accessing other RANs (e.g., such as eNode-Bs 160a, 160b, 160c).
  • WTRUs 102a, 102b, 102c may utilize one or more of gNBs 180a, 180b, 180c as a mobility anchor point
  • WTRUs may utilize one or more of gNBs 180a, 180b, 180c as a mobility anchor point.
  • 102a. 102b, 102c may communicate with gNBs 180a, 180b, 180c using signals in an unlicensed band.
  • gNBs 180a, 180b, 180c may communicate with gNBs 180a, 180b, 180c using signals in an unlicensed band.
  • VVTRUs 102a, 102b, 102c may communicate with/connect to gNBs 180a, 180b, 180c while also communicating with/connecting to another RAN such as eNode-Bs 160a, 160b, 160c.
  • WTRUs 102a, 102b, 102c may implement DC principles to communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c substantially simultaneously.
  • eNode-Bs 160a, 160b, 160c may serve as a mobility anchor for WTRUs 102a, 102b, 102c and gNBs 180a, 180b, 180c may provide additional coverage and/or throughput for servicing WTRUs 102a, 102b, 102c.
  • Each of the gNBs 180a, 180b, 180c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in the UL and/or DL, support of network slicing, dual connectivity, interworking between NR and E-UTRA, routing of user plane data towards User Plane Function (UPF) 184a, 184b, routing of control plane information towards Access and Mobility Management Function (AMF) 182a, 182b and the like. As shown in FIG. 19D, the gNBs 180a, 180b, 180c may communicate with one another over an Xn interface.
  • UPF User Plane Function
  • AMF Access and Mobility Management Function
  • the CN 115 shown in FIG. 19D may include at least one AMF 182a, 182b, at least one UPF 184a, 184b, at least one Session Management Function (SMF) 183a, 183b, and possibly a Data Network (DN) 185a, 185b. While each of the foregoing elements are depicted as part of the CN 115, it will be appreciated that any of these elements may be owned and/or operated by an entity other than the CN operator.
  • SMF Session Management Function
  • the AMF 182a, 182b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via an N2 interface and may serve as a control node.
  • the AMF 182a, 182b may be responsible for authenticating users of the WTRUs 102a, 102b, 102c, support for network slicing (e.g., handling of different PDU sessions with different requirements), selecting a particular SMF 183a, 183b, management of the registration area, termination of NAS signaling, mobility management and the like.
  • Network slicing may be used by the AMF 182a, 182b in order to customize CN support for WTRUs 102a, 102b, 102c based on the types of services being utilized WTRUs 102a, 102b, 102c.
  • different network slices may be established for different use cases such as services relying on ultra-reliable low latency (URLLC) access, services relying on enhanced massive mobile broadband (eMBB) access, services for machine type communication (MTC) access, and/or the like.
  • URLLC ultra-reliable low latency
  • eMBB enhanced massive mobile broadband
  • MTC machine type communication
  • the AMF 162 may provide a control plane function for switching between the RAN 113 and other RANs (not shown) that employ other radio technologies, such as LTE, LTE-A, LTE-A Pro, and/or non-3GPP access technologies such as WiFi.
  • radio technologies such as LTE, LTE-A, LTE-A Pro, and/or non-3GPP access technologies such as WiFi.
  • the SMF 183a, 183b may be connected to an AMF 182a, 182b in the CN 115 via an N11 interface.
  • the SMF 183a, 183b may also be connected to a UPF 184a, 184b in the CN 115 via an N4 interface.
  • 183b may select and control the UPF 184a. 184b and configure the routing of traffic through the UPF 184a, 184b.
  • the SMF 183a, 183b may perform other functions, such as managing and allocating UE IP address, managing PDU sessions, controlling policy enforcement and QoS, providing downlink data notifications, and the like.
  • a PDU session type may be IP-based, non-IP based, Ethernet-based, and the like.
  • the UPF 184a, 184b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via an N3 interface, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP- enabled devices.
  • the UPF 184, 184b may perform other functions, such as routing and forwarding packets, enforcing user plane policies, supporting multi-homed PDU sessions, handling user plane QoS, buffering downlink packets, providing mobility anchoring, and the like.
  • the CN 115 may facilitate communications with other networks.
  • the CN 115 may include, or may communicate with, an IP gateway (e.g., an IP multimedia subsystem (IMS) server) that serves as an interface between the CN 115 and the PSTN 108.
  • an IP gateway e.g., an IP multimedia subsystem (IMS) server
  • IMS IP multimedia subsystem
  • the CN 115 may provide the WTRUs 102a.
  • the WTRUs 102a, 102b, 102c may be connected to a local Data Network (DN) 185a, 185b through the UPF 184a, 184b via the N3 interface to the UPF 184a, 184b and an N6 interface between the UPF 184a, 184b and the DN 185a, 185b.
  • DN local Data Network
  • one or more, or all, of the functions described herein with regard to one or more of: WTRU 102a-d, Base Station 114a-b, eNode-B 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF 182a-b, UPF 184a-b, SMF 183a-b, DN 185a-b, and/or any other device(s) described herein, may be performed by one or more emulation devices (not shown).
  • the emulation devices may be one or more devices configured to emulate one or more, or all, of the functions described herein.
  • the emulation devices may be used to test other devices and/or to simulate network and/or WTRU functions.
  • the emulation devices may be designed to implement one or more tests of other devices in a lab environment and/or in an operator network environment.
  • the one or more emulation devices may perform the one or more, or all, functions while being fully or partially implemented and/or deployed as part of a wired and/or wireless communication network in order to test other devices within the communication network.
  • the one or more emulation devices may perform the one or more, or all, functions while being temporarily implemented/deployed as part of a wired and/or wireless communication network.
  • the emulation device may perform the one or more, or all, functions while being temporarily implemented/deployed as part of a wired and/or wireless communication network.
  • the emulation device may
  • the one or more emulation devices may perform the one or more, including all, functions while not being implemented/deployed as part of a wired and/or wireless communication network.
  • the emulation devices may be utilized in a testing scenario in a testing laboratory and/or a non-deployed (e.g., testing) wired and/or wireless communication network in order to implement testing of one or more components.
  • the one or more emulation devices may be test equipment. Direct RF coupling and/or wireless communications via RF circuitry (e.g., which may include one or more antennas) may be used by the emulation devices to transmit and/or receive data.
  • RF circuitry e.g., which may include one or more antennas

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Operations Research (AREA)
  • Algebra (AREA)
  • Evolutionary Biology (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Circuit Arrangement For Electric Light Sources In General (AREA)
  • Measuring Pulse, Heart Rate, Blood Pressure Or Blood Flow (AREA)
PCT/US2019/013623 2018-01-16 2019-01-15 Motion compensated bi-prediction based on local illumination compensation WO2019143602A1 (en)

Priority Applications (10)

Application Number Priority Date Filing Date Title
US16/960,455 US11368676B2 (en) 2018-01-16 2019-01-15 Motion compensated bi-prediction based on local illumination compensation
CN202410707311.5A CN118646861A (zh) 2018-01-16 2019-01-15 基于局部照明补偿的运动补偿双向预测
EP19703499.4A EP3741115A1 (en) 2018-01-16 2019-01-15 Motion compensated bi-prediction based on local illumination compensation
MX2020007355A MX2020007355A (es) 2018-01-16 2019-01-15 Bipredicción compensada en movimiento basada en compensación de iluminación local.
JP2020537618A JP7125486B2 (ja) 2018-01-16 2019-01-15 局所照明補償に基づいた動き補償双予測
CN201980007961.6A CN111630855B (zh) 2018-01-16 2019-01-15 基于局部照明补偿的运动补偿双向预测
US17/732,466 US11962759B2 (en) 2018-01-16 2022-04-28 Motion compensated bi-prediction based on local illumination compensation
JP2022128796A JP7448600B2 (ja) 2018-01-16 2022-08-12 局所照明補償に基づいた動き補償双予測
JP2024029997A JP2024059911A (ja) 2018-01-16 2024-02-29 局所照明補償に基づいた動き補償双予測
US18/635,719 US20240267511A1 (en) 2018-01-16 2024-04-15 Motion compensated bi-prediction based on local illumination compensation

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US201862617964P 2018-01-16 2018-01-16
US62/617,964 2018-01-16
US201862647273P 2018-03-23 2018-03-23
US62/647,273 2018-03-23
US201862786671P 2018-12-31 2018-12-31
US62/786,671 2018-12-31

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US16/960,455 A-371-Of-International US11368676B2 (en) 2018-01-16 2019-01-15 Motion compensated bi-prediction based on local illumination compensation
US17/732,466 Continuation US11962759B2 (en) 2018-01-16 2022-04-28 Motion compensated bi-prediction based on local illumination compensation

Publications (1)

Publication Number Publication Date
WO2019143602A1 true WO2019143602A1 (en) 2019-07-25

Family

ID=65279711

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2019/013623 WO2019143602A1 (en) 2018-01-16 2019-01-15 Motion compensated bi-prediction based on local illumination compensation

Country Status (7)

Country Link
US (3) US11368676B2 (zh)
EP (1) EP3741115A1 (zh)
JP (3) JP7125486B2 (zh)
CN (2) CN118646861A (zh)
MX (1) MX2020007355A (zh)
TW (1) TWI785188B (zh)
WO (1) WO2019143602A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110446044A (zh) * 2019-08-21 2019-11-12 浙江大华技术股份有限公司 线性模型预测方法、装置、编码器及存储装置
CN113497940A (zh) * 2020-03-20 2021-10-12 腾讯美国有限责任公司 视频解码方法、装置、计算机设备及存储介质
CN114503580A (zh) * 2019-09-23 2022-05-13 北京字节跳动网络技术有限公司 基于虚拟管线数据单元设置帧内块复制虚拟缓冲区
JP7550892B2 (ja) 2020-07-01 2024-09-13 グーグル エルエルシー 暗黙的モデルを伴うインターイントラ予測

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3741115A1 (en) * 2018-01-16 2020-11-25 Vid Scale, Inc. Motion compensated bi-prediction based on local illumination compensation
US11317085B2 (en) * 2018-03-30 2022-04-26 Vid Scale, Inc. Template-based inter prediction techniques based on encoding and decoding latency reduction
US10834409B2 (en) * 2018-04-06 2020-11-10 Arris Enterprises Llc System and method of implementing multiple prediction models for local illumination compensation
WO2019234606A1 (en) 2018-06-05 2019-12-12 Beijing Bytedance Network Technology Co., Ltd. Interaction between ibc and atmvp
CN110636298B (zh) 2018-06-21 2022-09-13 北京字节跳动网络技术有限公司 对于Merge仿射模式和非Merge仿射模式的统一约束
WO2019244118A1 (en) 2018-06-21 2019-12-26 Beijing Bytedance Network Technology Co., Ltd. Component-dependent sub-block dividing
CN117768651A (zh) 2018-09-24 2024-03-26 北京字节跳动网络技术有限公司 处理视频数据的方法、装置、介质、以及比特流存储方法
CN111083484B (zh) 2018-10-22 2024-06-28 北京字节跳动网络技术有限公司 基于子块的预测
CN112913247B (zh) 2018-10-23 2023-04-28 北京字节跳动网络技术有限公司 使用局部照明补偿的视频处理
WO2020084509A1 (en) 2018-10-23 2020-04-30 Beijing Bytedance Network Technology Co., Ltd. Harmonized local illumination compensation and modified inter coding tools
WO2020094150A1 (en) 2018-11-10 2020-05-14 Beijing Bytedance Network Technology Co., Ltd. Rounding in current picture referencing
CN111436227B (zh) 2018-11-12 2024-03-29 北京字节跳动网络技术有限公司 在视频处理中使用组合帧间-帧内预测
JP7241870B2 (ja) 2018-11-20 2023-03-17 北京字節跳動網絡技術有限公司 部分的な位置に基づく差分計算
CN113170097B (zh) 2018-11-20 2024-04-09 北京字节跳动网络技术有限公司 视频编解码模式的编解码和解码
EP4325849A3 (en) 2018-11-22 2024-04-17 Beijing Bytedance Network Technology Co., Ltd. Coordination method for sub-block based inter prediction
EP3915259A4 (en) 2019-03-06 2022-03-30 Beijing Bytedance Network Technology Co., Ltd. USE OF A CONVERTED UNIVERSITY PREDICTION CANDIDATE
WO2020182207A1 (en) 2019-03-13 2020-09-17 Beijing Bytedance Network Technology Co., Ltd. Partitions on sub-block transform mode
KR20230169434A (ko) 2019-04-02 2023-12-15 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 디코더 측 움직임 벡터 유도
KR20220043109A (ko) 2019-08-13 2022-04-05 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 서브 블록 기반 인터 예측의 모션 정밀도
EP4011077A4 (en) 2019-09-13 2022-11-30 Beijing Bytedance Network Technology Co., Ltd. SAMPLE WEIGHTED BIDIRECTIONAL PREDICTION IN VIDEO CODING
CN114424553A (zh) 2019-09-22 2022-04-29 北京字节跳动网络技术有限公司 基于子块的帧间预测的缩放方法
US11284111B2 (en) * 2019-10-10 2022-03-22 Tencent America LLC Techniques and apparatus for inter-channel prediction and transform for point-cloud attribute coding
KR20230145097A (ko) * 2021-02-08 2023-10-17 인터디지털 씨이 페이튼트 홀딩스, 에스에이에스 공간 국소 조명 보상
US20240187567A1 (en) * 2021-04-09 2024-06-06 Beijing Bytedance Network Technology Co., Ltd. Adaptive motion candidate list
US11936877B2 (en) * 2021-04-12 2024-03-19 Qualcomm Incorporated Template matching based affine prediction for video coding
US20230224474A1 (en) * 2022-01-12 2023-07-13 Tencent America LLC Adjustment based local illumination compensation
WO2023198203A1 (en) * 2022-04-14 2023-10-19 FG Innovation Company Limited Method related to illumination compensation and electronic device
WO2023205283A1 (en) * 2022-04-19 2023-10-26 Beijing Dajia Internet Information Technology Co., Ltd. Methods and devices for enhanced local illumination compensation
WO2024010291A1 (ko) * 2022-07-05 2024-01-11 엘지전자 주식회사 휘도 보상(illumination compensation)에 기반한 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장하는 기록 매체
WO2024104420A1 (en) * 2022-11-16 2024-05-23 Douyin Vision Co., Ltd. Improvements for illumination compensation in video coding
WO2024148116A1 (en) * 2023-01-03 2024-07-11 Beijing Dajia Internet Information Technology Co., Ltd. Method and apparatus for adaptive motion compensated filtering
US20240251095A1 (en) * 2023-01-19 2024-07-25 Tencent America LLC Local illumination compensation
WO2024163951A1 (en) * 2023-02-02 2024-08-08 Beijing Dajia Internet Information Technology Co., Ltd. Method and apparatus for adaptive motion compensated filtering

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2515542A2 (en) * 2009-12-20 2012-10-24 LG Electronics Inc. Video signal decoding method and device
US20140112392A1 (en) * 2011-07-01 2014-04-24 Sk Telecom Co., Ltd. Apparatus and method for coding and decoding image
WO2018067729A1 (en) * 2016-10-05 2018-04-12 Qualcomm Incorporated Systems and methods of performing improved local illumination compensation

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2017520994A (ja) 2014-06-20 2017-07-27 寰發股▲ふん▼有限公司HFI Innovation Inc. 3dおよびマルチビュービデオコーディングのサブpu構文シグナリングおよび照明補償方法
US10887597B2 (en) 2015-06-09 2021-01-05 Qualcomm Incorporated Systems and methods of determining illumination compensation parameters for video coding
KR102480191B1 (ko) 2016-05-13 2022-12-21 브이아이디 스케일, 인크. 비디오 코딩을 위한 일반화된 다중-가설 예측 시스템 및 방법
CA3025488A1 (en) * 2016-05-25 2017-11-30 Arris Enterprises Llc Weighted angular prediction for intra coding
WO2018056763A1 (ko) * 2016-09-23 2018-03-29 엘지전자(주) 템플릿 기반 가중치를 이용하여 예측을 수행하는 방법 및 장치
KR20200014913A (ko) * 2017-07-04 2020-02-11 엘지전자 주식회사 인터 예측 기반의 영상 처리 방법 및 이를 위한 장치
EP3741115A1 (en) * 2018-01-16 2020-11-25 Vid Scale, Inc. Motion compensated bi-prediction based on local illumination compensation

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2515542A2 (en) * 2009-12-20 2012-10-24 LG Electronics Inc. Video signal decoding method and device
US20140112392A1 (en) * 2011-07-01 2014-04-24 Sk Telecom Co., Ltd. Apparatus and method for coding and decoding image
WO2018067729A1 (en) * 2016-10-05 2018-04-12 Qualcomm Incorporated Systems and methods of performing improved local illumination compensation

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
C-W SEO ET AL: "Pixel Based Illumination Compensation", 6. JCT-VC MEETING; 97. MPEG MEETING; 14-7-2011 - 22-7-2011; TORINO; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ); URL: HTTP://WFTP3.ITU.INT/AV-ARCH/JCTVC-SITE/,, no. JCTVC-F417, 1 July 2011 (2011-07-01), XP030009440 *
LEE G G ET AL: "AHG 10: Complexity Assessment on Illumination Compensation (IC)", 7. JCT-3V MEETING; 11-1-2014 - 17-1-2014; SAN JOSE; (THE JOINT COLLABORATIVE TEAM ON 3D VIDEO CODING EXTENSION DEVELOPMENT OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ); URL: HTTP://PHENIX.INT-EVRY.FR/JCT2/,, no. JCT3V-G0114-v7, 14 January 2014 (2014-01-14), XP030131886 *
XIU X ET AL: "Description of SDR, HDR and 360° video coding technology proposal by InterDigital Communications and Dolby Laboratories", 10. JVET MEETING; 10-4-2018 - 20-4-2018; SAN DIEGO; (THE JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ); URL: HTTP://PHENIX.INT-EVRY.FR/JVET/,, no. JVET-J0015, 3 April 2018 (2018-04-03), XP030151174 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110446044A (zh) * 2019-08-21 2019-11-12 浙江大华技术股份有限公司 线性模型预测方法、装置、编码器及存储装置
WO2021032171A1 (en) * 2019-08-21 2021-02-25 Zhejiang Dahua Technology Co., Ltd. Linear model prediction method and coder
CN110446044B (zh) * 2019-08-21 2022-08-09 浙江大华技术股份有限公司 线性模型预测方法、装置、编码器及存储装置
CN114503580A (zh) * 2019-09-23 2022-05-13 北京字节跳动网络技术有限公司 基于虚拟管线数据单元设置帧内块复制虚拟缓冲区
CN113497940A (zh) * 2020-03-20 2021-10-12 腾讯美国有限责任公司 视频解码方法、装置、计算机设备及存储介质
CN113497940B (zh) * 2020-03-20 2024-06-28 腾讯美国有限责任公司 视频解码方法、装置、计算机设备及存储介质
JP7550892B2 (ja) 2020-07-01 2024-09-13 グーグル エルエルシー 暗黙的モデルを伴うインターイントラ予測

Also Published As

Publication number Publication date
CN111630855B (zh) 2024-06-21
CN111630855A (zh) 2020-09-04
JP2024059911A (ja) 2024-05-01
TW201941601A (zh) 2019-10-16
JP2021518998A (ja) 2021-08-05
JP2022163175A (ja) 2022-10-25
US11962759B2 (en) 2024-04-16
US20240267511A1 (en) 2024-08-08
TWI785188B (zh) 2022-12-01
JP7448600B2 (ja) 2024-03-12
US11368676B2 (en) 2022-06-21
CN118646861A (zh) 2024-09-13
JP7125486B2 (ja) 2022-08-24
EP3741115A1 (en) 2020-11-25
US20200336738A1 (en) 2020-10-22
MX2020007355A (es) 2020-10-12
US20220272326A1 (en) 2022-08-25

Similar Documents

Publication Publication Date Title
US11962759B2 (en) Motion compensated bi-prediction based on local illumination compensation
US20230188748A1 (en) Bi-directional optical flow method with simplified gradient derivation
US20230156215A1 (en) Sub-block motion derivation and decoder-side motion vector refinement for merge mode
KR102653715B1 (ko) 양방향 광학 흐름에 기반한 모션 보상 예측
US11553206B2 (en) Bl-prediction for video coding
US11425418B2 (en) Overlapped block motion compensation
WO2019006363A1 (en) LOCAL LIGHTING COMPENSATION USING GENERALIZED BI-PREDICTION
AU2019419454A1 (en) Combined inter and intra prediction
EP4032267A1 (en) Adaptive interpolation filter for motion compensation
WO2023194556A1 (en) Implicit intra mode for combined inter merge/intra prediction and geometric partitioning mode intra/inter prediction
WO2024133579A1 (en) Gpm combination with inter tools
EP4454277A1 (en) Adaptive motion vector resolution (amvr) using depth map or motion map
WO2024133007A1 (en) Hmvp candidate reordering
WO2024208633A1 (en) Most probable modes list

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: 19703499

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020537618

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019703499

Country of ref document: EP

Effective date: 20200817