US20200213612A1 - Syntax reuse for affine mode with adaptive motion vector resolution - Google Patents

Syntax reuse for affine mode with adaptive motion vector resolution Download PDF

Info

Publication number
US20200213612A1
US20200213612A1 US16/814,840 US202016814840A US2020213612A1 US 20200213612 A1 US20200213612 A1 US 20200213612A1 US 202016814840 A US202016814840 A US 202016814840A US 2020213612 A1 US2020213612 A1 US 2020213612A1
Authority
US
United States
Prior art keywords
motion
mode
block
affine
syntax element
Prior art date
Legal status (The legal status 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 status listed.)
Abandoned
Application number
US16/814,840
Other languages
English (en)
Inventor
Hongbin Liu
Li Zhang
Kai Zhang
Yue Wang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing ByteDance Network Technology Co Ltd
ByteDance Inc
Original Assignee
Beijing ByteDance Network Technology Co Ltd
ByteDance Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing ByteDance Network Technology Co Ltd, ByteDance Inc filed Critical Beijing ByteDance Network Technology Co Ltd
Assigned to BYTEDANCE INC. reassignment BYTEDANCE INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ZHANG, KAI, ZHANG, LI
Assigned to BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD. reassignment BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LIU, HONGBIN, WANG, YUE
Publication of US20200213612A1 publication Critical patent/US20200213612A1/en
Priority to US17/326,616 priority Critical patent/US20210289225A1/en
Priority to US18/350,554 priority patent/US20240015320A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H04N19/517—Processing of motion vectors by encoding
    • H04N19/52—Processing of motion vectors by encoding by predictive encoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/117—Filters, e.g. for pre-processing or post-processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/132—Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/174—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a slice, e.g. a line of blocks or a group of blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/184—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/186—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a colour or a chrominance component
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/527—Global motion vector estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/53—Multi-resolution motion estimation; Hierarchical motion estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/537—Motion estimation other than block-based
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/56—Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/20—Analysis of motion
    • G06T7/223—Analysis of motion using block-matching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
    • H04N19/139—Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/523—Motion estimation or motion compensation with sub-pixel accuracy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/567—Motion estimation based on rate distortion criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

  • This patent document relates to video processing techniques, devices and systems.
  • Devices, systems and methods related to digital video coding, and specifically, to motion vector predictor derivation and signaling for affine mode with adaptive motion vector resolution (AMVR) are described.
  • the described methods may be applied to both the existing video coding standards (e.g., High Efficiency Video Coding (HEVC)) and future video coding standards or video codecs.
  • HEVC High Efficiency Video Coding
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, for a conversion between a coded representation of a current block of a video and the current block, a motion vector difference (MVD) precision to be used for the conversion from a set of allowed multiple MVD precisions applicable to a video region containing the current video block; and performing the conversion based on the MVD precision.
  • MVD motion vector difference
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, a usage of multiple motion vector difference (MVD) precisions for the conversion of the one or more video blocks in the video region; and performing the conversion based on the determining.
  • VMD motion vector difference
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, whether to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video; and performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, how to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video; and performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, based on a coding mode of a parent coding unit of a current coding unit that uses an affine coding mode or a rate-distortion (RD) cost of the affine coding mode, a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block; and performing the conversion according to a result of the determining.
  • RD rate-distortion
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block that uses an advanced motion vector prediction (AMVP) coding mode, the determining based on a rate-distortion (RD) cost of the AMVP coding mode; and performing the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • AMVP advanced motion vector prediction
  • RD rate-distortion
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes generating, for a conversion between a coded representation of a current block of a video and the current block, a set of MV (Motion Vector) precisions using a 4-parameter affine model or 6-parameter affine model; and performing the conversion based on the set of MV precisions.
  • MV Motion Vector
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, based on a coding mode of a parent block of a current block that uses an affine coding mode, whether an adaptive motion vector resolution (AMVR) tool is used for a conversion, wherein the AMVR tool is used to refine motion vector resolution during decoding; and performing the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • the disclosed technology may be used to provide a method for video processing.
  • This method includes determining, based on a usage of MV precisions for previous blocks that has been previously coded using an affine coding mode, a termination of a rate-distortion (RD) calculations of MV precisions for a current block that uses the affine coding mode for a conversion between a coded representation of the current block and the current block; and performing the conversion according to a result of the determining.
  • RD rate-distortion
  • the above-described method is embodied in the form of processor-executable code and stored in a computer-readable program medium.
  • a device that is configured or operable to perform the above-described method.
  • the device may include a processor that is programmed to implement this method.
  • a video decoder apparatus may implement a method as described herein.
  • FIG. 1 shows an example of constructing a merge candidate list.
  • FIG. 2 shows an example of positions of spatial candidates.
  • FIG. 3 shows an example of candidate pairs subject to a redundancy check of spatial merge candidates.
  • FIGS. 4A and 4B show examples of the position of a second prediction unit (PU) based on the size and shape of the current block.
  • FIG. 5 shows an example of motion vector scaling for temporal merge candidates.
  • FIG. 6 shows an example of candidate positions for temporal merge candidates.
  • FIG. 7 shows an example of generating a combined bi-predictive merge candidate.
  • FIG. 8 shows an example of constructing motion vector prediction candidates.
  • FIG. 9 shows an example of motion vector scaling for spatial motion vector candidates.
  • FIG. 10 shows an example of motion prediction using the alternative temporal motion vector prediction (ATMVP) algorithm for a coding unit (CU).
  • ATMVP alternative temporal motion vector prediction
  • FIG. 11 shows an example of a coding unit (CU) with sub-blocks and neighboring blocks used by the spatial-temporal motion vector prediction (STMVP) algorithm.
  • CU coding unit
  • STMVP spatial-temporal motion vector prediction
  • FIG. 12 shows an example flowchart for encoding with different MV precisions.
  • FIGS. 13A and 13B show example snapshots of sub-block when using the overlapped block motion compensation (OBMC) algorithm.
  • OBMC overlapped block motion compensation
  • FIG. 14 shows an example of neighboring samples used to derive parameters for the local illumination compensation (LIC) algorithm.
  • LIC local illumination compensation
  • FIG. 15 shows an example of a simplified affine motion model.
  • FIG. 16 shows an example of an affine motion vector field (MVF) per sub-block.
  • FIG. 17 shows an example of motion vector prediction (MVP) for the AF_INTER affine motion mode.
  • MVP motion vector prediction
  • FIGS. 18A and 18B show examples of the 4-parameter and 6-parameter affine models, respectively.
  • FIGS. 19A and 19B show example candidates for the AF_MERGE affine motion mode.
  • FIG. 20 shows an example of bilateral matching in pattern matched motion vector derivation (PMMVD) mode, which is a special merge mode based on the frame-rate up conversion (FRUC) algorithm.
  • PMMVD pattern matched motion vector derivation
  • FRUC frame-rate up conversion
  • FIG. 21 shows an example of template matching in the FRUC algorithm.
  • FIG. 22 shows an example of unilateral motion estimation in the FRUC algorithm.
  • FIG. 23 shows an example of an optical flow trajectory used by the bi-directional optical flow (BIO) algorithm.
  • FIGS. 24A and 24B show example snapshots of using of the bi-directional optical flow (BIO) algorithm without block extensions.
  • FIG. 25 shows an example of the decoder-side motion vector refinement (DMVR) algorithm based on bilateral template matching.
  • FIGS. 26A-261 show flowcharts of example methods for video processing based on some implementations of the disclosed technology.
  • FIG. 27 is a block diagram of an example of a hardware platform for implementing a visual media decoding or a visual media encoding technique described in the present document.
  • FIG. 28 shows an example of symmetrical mode.
  • FIG. 29 shows another block diagram of an example of a hardware platform for implementing a video processing system described in the present document.
  • Video codecs typically include an electronic circuit or software that compresses or decompresses digital video, and are continually being improved to provide higher coding efficiency.
  • a video codec converts uncompressed video to a compressed format or vice versa.
  • the compressed format usually conforms to a standard video compression specification, e.g., the High Efficiency Video Coding (HEVC) standard (also known as H.265 or MPEG-H Part 2), the Versatile Video Coding standard to be finalized, or other current and/or future video coding standards.
  • HEVC High Efficiency Video Coding
  • MPEG-H Part 2 the Versatile Video Coding standard to be finalized, or other current and/or future video coding standards.
  • Embodiments of the disclosed technology may be applied to existing video coding standards (e.g., HEVC, H.265) and future standards to improve compression performance. Section headings are used in the present document to improve readability of the description and do not in any way limit the discussion or the embodiments (and/or implementations) to the respective sections only.
  • Video coding standards have significantly improved over the years, and now provide, in part, high coding efficiency and support for higher resolutions.
  • Recent standards such as HEVC and H.265 are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized.
  • Each inter-predicted PU has motion parameters for one or two reference picture lists.
  • motion parameters include a motion vector and a reference picture index.
  • the usage of one of the two reference picture lists may also be signaled using inter_pred_idc.
  • motion vectors may be explicitly coded as deltas relative to predictors.
  • a merge mode is specified whereby the motion parameters for the current PU are obtained from neighboring PUs, including spatial and temporal candidates.
  • the merge mode can be applied to any inter-predicted PU, not only for skip mode.
  • the alternative to merge mode is the explicit transmission of motion parameters, where motion vector, corresponding reference picture index for each reference picture list and reference picture list usage are signaled explicitly per each PU.
  • the PU When signaling indicates that one of the two reference picture lists is to be used, the PU is produced from one block of samples. This is referred to as ‘uni-prediction’. Uni-prediction is available both for P-slices and B-slices.
  • Bi-prediction When signaling indicates that both of the reference picture lists are to be used, the PU is produced from two blocks of samples. This is referred to as ‘bi-prediction’. Bi-prediction is available for B-slices only.
  • Step 1 Initial candidates derivation
  • Step 2 Additional candidates insertion
  • FIG. 1 shows an example of constructing a merge candidate list based on the sequence of steps summarized above.
  • For spatial merge candidate derivation a maximum of four merge candidates are selected among candidates that are located in five different positions.
  • temporal merge candidate derivation a maximum of one merge candidate is selected among two candidates. Since constant number of candidates for each PU is assumed at decoder, additional candidates are generated when the number of candidates does not reach to maximum number of merge candidate (MaxNumMergeCand) which is signalled in slice header. Since the number of candidates is constant, index of best merge candidate is encoded using truncated unary binarization (TU). If the size of CU is equal to 8, all the PUs of the current CU share a single merge candidate list, which is identical to the merge candidate list of the 2N ⁇ 2N prediction unit.
  • TU truncated unary binarization
  • a maximum of four merge candidates are selected among candidates located in the positions depicted in FIG. 2 .
  • the order of derivation is A 1 , B 1 , B 0 , A 0 and B 2 .
  • Position B 2 is considered only when any PU of position A 1 , B 1 , B 0 , A 0 is not available (e.g. because it belongs to another slice or tile) or is intra coded.
  • candidate at position A 1 is added, the addition of the remaining candidates is subject to a redundancy check which ensures that candidates with same motion information are excluded from the list so that coding efficiency is improved.
  • FIGS. 4A and 4B depict the second PU for the case of N ⁇ 2N and 2N ⁇ N, respectively.
  • candidate at position A 1 is not considered for list construction.
  • adding this candidate may lead to two prediction units having the same motion information, which is redundant to just have one PU in a coding unit.
  • position B 1 is not considered when the current PU is partitioned as 2N ⁇ N.
  • a scaled motion vector is derived based on co-located PU belonging to the picture which has the smallest POC difference with current picture within the given reference picture list.
  • the reference picture list to be used for derivation of the co-located PU is explicitly signaled in the slice header.
  • FIG. 5 shows an example of the derivation of the scaled motion vector for a temporal merge candidate (as the dotted line), which is scaled from the motion vector of the co-located PU using the POC distances, tb and td, where tb is defined to be the POC difference between the reference picture of the current picture and the current picture and td is defined to be the POC difference between the reference picture of the co-located picture and the co-located picture.
  • the reference picture index of temporal merge candidate is set equal to zero. For a B-slice, two motion vectors, one is for reference picture list 0 and the other is for reference picture list 1, are obtained and combined to make the bi-predictive merge candidate.
  • the position for the temporal candidate is selected between candidates C 0 and C 1 , as depicted in FIG. 6 . If PU at position C 0 is not available, is intra coded, or is outside of the current CTU, position C 1 is used. Otherwise, position C 0 is used in the derivation of the temporal merge candidate.
  • merge candidates there are two additional types of merge candidates: combined bi-predictive merge candidate and zero merge candidate.
  • Combined bi-predictive merge candidates are generated by utilizing spatio-temporal merge candidates.
  • Combined bi-predictive merge candidate is used for B-Slice only.
  • the combined bi-predictive candidates are generated by combining the first reference picture list motion parameters of an initial candidate with the second reference picture list motion parameters of another. If these two tuples provide different motion hypotheses, they will form a new bi-predictive candidate.
  • FIG. 7 shows an example of this process, wherein two candidates in the original list ( 710 , on the left), which have mvL0 and refIdxL0 or mvL1 and refIdxL1, are used to create a combined bi-predictive merge candidate added to the final list ( 720 , on the right).
  • Zero motion candidates are inserted to fill the remaining entries in the merge candidates list and therefore hit the MaxNumMergeCand capacity. These candidates have zero spatial displacement and a reference picture index which starts from zero and increases every time a new zero motion candidate is added to the list. The number of reference frames used by these candidates is one and two for uni- and bi-directional prediction, respectively. In some embodiments, no redundancy check is performed on these candidates.
  • motion estimation can be performed in parallel whereby the motion vectors for all prediction units inside a given region are derived simultaneously.
  • the derivation of merge candidates from spatial neighborhood may interfere with parallel processing as one prediction unit cannot derive the motion parameters from an adjacent PU until its associated motion estimation is completed.
  • a motion estimation region may be defined.
  • the size of the MER may be signaled in the picture parameter set (PPS) using the “log_2_parallel_merge_level_minus2” syntax element.
  • AMVP exploits spatio-temporal correlation of motion vector with neighboring PUs, which is used for explicit transmission of motion parameters. It constructs a motion vector candidate list by firstly checking availability of left, above temporally neighboring PU positions, removing redundant candidates and adding zero vector to make the candidate list to be constant length. Then, the encoder can select the best predictor from the candidate list and transmit the corresponding index indicating the chosen candidate. Similarly with merge index signaling, the index of the best motion vector candidate is encoded using truncated unary. The maximum value to be encoded in this case is 2 (see FIG. 8 ). In the following sections, details about derivation process of motion vector prediction candidate are provided.
  • FIG. 8 summarizes derivation process for motion vector prediction candidate, and may be implemented for each reference picture list with refidx as an input.
  • motion vector candidate two types are considered: spatial motion vector candidate and temporal motion vector candidate.
  • spatial motion vector candidate derivation two motion vector candidates are eventually derived based on motion vectors of each PU located in five different positions as previously shown in FIG. 2 .
  • one motion vector candidate is selected from two candidates, which are derived based on two different co-located positions. After the first list of spatio-temporal candidates is made, duplicated motion vector candidates in the list are removed. If the number of potential candidates is larger than two, motion vector candidates whose reference picture index within the associated reference picture list is larger than 1 are removed from the list. If the number of spatio-temporal motion vector candidates is smaller than two, additional zero motion vector candidates is added to the list.
  • a maximum of two candidates are considered among five potential candidates, which are derived from PUs located in positions as previously shown in FIG. 2 , those positions being the same as those of motion merge.
  • the order of derivation for the left side of the current PU is defined as A 0 , A 1 , and scaled A 0 , scaled A 1 .
  • the order of derivation for the above side of the current PU is defined as B 0 , B 1 , B 2 , scaled B 0 , scaled B 1 , scaled B 2 .
  • the no-spatial-scaling cases are checked first followed by the cases that allow spatial scaling. Spatial scaling is considered when the POC is different between the reference picture of the neighbouring PU and that of the current PU regardless of reference picture list. If all PUs of left candidates are not available or are intra coded, scaling for the above motion vector is allowed to help parallel derivation of left and above MV candidates. Otherwise, spatial scaling is not allowed for the above motion vector.
  • the motion vector of the neighbouring PU is scaled in a similar manner as for temporal scaling.
  • One difference is that the reference picture list and index of current PU is given as input; the actual scaling process is the same as that of temporal scaling.
  • the reference picture index is signaled to the decoder.
  • JEM Joint Exploration Model
  • affine prediction alternative temporal motion vector prediction
  • STMVP spatial-temporal motion vector prediction
  • BIO bi-directional optical flow
  • FRUC Frame-Rate Up Conversion
  • LAMVR Locally Adaptive Motion Vector Resolution
  • OBMC Overlapped Block Motion Compensation
  • LIC Local Illumination Compensation
  • DMVR Decoder-side Motion Vector Refinement
  • each CU can have at most one set of motion parameters for each prediction direction.
  • two sub-CU level motion vector prediction methods are considered in the encoder by splitting a large CU into sub-CUs and deriving motion information for all the sub-CUs of the large CU.
  • Alternative temporal motion vector prediction (ATMVP) method allows each CU to fetch multiple sets of motion information from multiple blocks smaller than the current CU in the collocated reference picture.
  • STMVP spatial-temporal motion vector prediction
  • motion vectors of the sub-CUs are derived recursively by using the temporal motion vector predictor and spatial neighbouring motion vector.
  • the motion compression for the reference frames may be disabled.
  • the temporal motion vector prediction (TMVP) method is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks smaller than the current CU.
  • FIG. 10 shows an example of ATMVP motion prediction process for a CU 1000 .
  • the ATMVP method predicts the motion vectors of the sub-CUs 1001 within a CU 1000 in two steps.
  • the first step is to identify the corresponding block 1051 in a reference picture 1050 with a temporal vector.
  • the reference picture 1050 is also referred to as the motion source picture.
  • the second step is to split the current CU 1000 into sub-CUs 1001 and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU.
  • a reference picture 1050 and the corresponding block is determined by the motion information of the spatial neighboring blocks of the current CU 1000 .
  • the first merge candidate in the merge candidate list of the current CU 1000 is used.
  • the first available motion vector as well as its associated reference index are set to be the temporal vector and the index to the motion source picture. This way, the corresponding block may be more accurately identified, compared with TMVP, wherein the corresponding block (sometimes called collocated block) is always in a bottom-right or center position relative to the current CU.
  • a corresponding block of the sub-CU 1051 is identified by the temporal vector in the motion source picture 1050 , by adding to the coordinate of the current CU the temporal vector.
  • the motion information of its corresponding block e.g., the smallest motion grid that covers the center sample
  • the motion information of a corresponding N ⁇ N block is identified, it is converted to the motion vectors and reference indices of the current sub-CU, in the same way as TMVP of HEVC, wherein motion scaling and other procedures apply.
  • the decoder checks whether the low-delay condition (e.g.
  • motion vector MVx e.g., the motion vector corresponding to reference picture list X
  • motion vector MVy e.g., with X being equal to 0 or 1 and Y being equal to 1 ⁇ X
  • FIG. 11 shows an example of one CU with four sub-blocks and neighboring blocks.
  • an 8 ⁇ 8 CU 1100 that includes four 4 ⁇ 4 sub-CUs A ( 1101 ), B ( 1102 ), C ( 1103 ), and D ( 1104 ).
  • the neighboring 4 ⁇ 4 blocks in the current frame are labelled as a ( 1111 ), b ( 1112 ), c ( 1113 ), and d ( 1114 ).
  • the motion derivation for sub-CU A starts by identifying its two spatial neighbors.
  • the first neighbor is the N ⁇ N block above sub-CU A 1101 (block c 1113 ). If this block c ( 1113 ) is not available or is intra coded the other N ⁇ N blocks above sub-CU A ( 1101 ) are checked (from left to right, starting at block c 1113 ).
  • the second neighbor is a block to the left of the sub-CU A 1101 (block b 1112 ). If block b ( 1112 ) is not available or is intra coded other blocks to the left of sub-CU A 1101 are checked (from top to bottom, staring at block b 1112 ).
  • TMVP temporal motion vector predictor
  • the sub-CU modes are enabled as additional merge candidates and there is no additional syntax element required to signal the modes.
  • Two additional merge candidates are added to merge candidates list of each CU to represent the ATMVP mode and STMVP mode. In other embodiments, up to seven merge candidates may be used, if the sequence parameter set indicates that ATMVP and STMVP are enabled.
  • the encoding logic of the additional merge candidates is the same as for the merge candidates in the HM, which means, for each CU in P or B slice, two more RD checks may be needed for the two additional merge candidates.
  • all bins of the merge index are context coded by CABAC (Context-based Adaptive Binary Arithmetic Coding). In other embodiments, e.g., HEVC, only the first bin is context coded and the remaining bins are context by-pass coded.
  • CABAC Context-based Adaptive Binary Arithmetic Coding
  • motion vector differences (between the motion vector and predicted motion vector of a PU) are signalled in units of quarter luma samples when use_integer_mv_flag is equal to 0 in the slice header.
  • LAMVR locally adaptive motion vector resolution
  • MVD can be coded in units of quarter luma samples, integer luma samples or four luma samples.
  • the MVD resolution is controlled at the coding unit (CU) level, and MVD resolution flags are conditionally signalled for each CU that has at least one non-zero MVD components.
  • a first flag is signalled to indicate whether quarter luma sample MV precision is used in the CU.
  • the first flag (equal to 1) indicates that quarter luma sample MV precision is not used, another flag is signalled to indicate whether integer luma sample MV precision or four luma sample MV precision is used.
  • the quarter luma sample MV resolution is used for the CU.
  • the MVPs in the AMVP candidate list for the CU are rounded to the corresponding precision.
  • CU-level RD checks are used to determine which MVD resolution is to be used for a CU. That is, the CU-level RD check is performed three times for each MVD resolution.
  • the following encoding schemes are applied in the JEM:
  • the encoding process is shown in FIG. 12 .
  • 1 ⁇ 4 pel MV is tested and the RD cost is calculated and denoted as RDCost0, then integer MV is tested and the RD cost is denoted as RDCost1. If RDCost1 ⁇ th*RDCost0 (wherein th is a positive valued threshold), then 4-pel MV is tested; otherwise, 4-pel MV is skipped.
  • RDCost1 ⁇ th*RDCost0 wherein th is a positive valued threshold
  • 4-pel MV is tested; otherwise, 4-pel MV is skipped.
  • motion information and RD cost etc. are already known for 1 ⁇ 4 pel MV when checking integer or 4-pel MV, which can be reused to speed up the encoding process of integer or 4-pel MV.
  • motion vector accuracy is one-quarter pel (one-quarter luma sample and one-eighth chroma sample for 4:2:0 video).
  • JEM the accuracy for the internal motion vector storage and the merge candidate increases to 1/16 pel.
  • the higher motion vector accuracy ( 1/16 pel) is used in motion compensation inter prediction for the CU coded with skip/merge mode.
  • the integer-pel or quarter-pel motion is used for the CU coded with normal AMVP mode.
  • SHVC upsampling interpolation filters which have same filter length and normalization factor as HEVC motion compensation interpolation filters, are used as motion compensation interpolation filters for the additional fractional pel positions.
  • the chroma component motion vector accuracy is 1/32 sample in the JEM, the additional interpolation filters of 1/32 pel fractional positions are derived by using the average of the filters of the two neighbouring 1/16 pel fractional positions.
  • OBMC Overlapped Block Motion Compensation
  • OBMC can be switched on and off using syntax at the CU level.
  • the OBMC is performed for all motion compensation (MC) block boundaries except the right and bottom boundaries of a CU. Moreover, it is applied for both the luma and chroma components.
  • an MC block corresponds to a coding block.
  • sub-CU mode includes sub-CU merge, affine and FRUC mode
  • each sub-block of the CU is a MC block.
  • OBMC is performed at sub-block level for all MC block boundaries, where sub-block size is set equal to 4 ⁇ 4, as shown in FIGS. 13A and 13B .
  • FIG. 13A shows sub-blocks at the CU/PU boundary, and the hatched sub-blocks are where OBMC applies.
  • FIG. 13B shows the sub-Pus in ATMVP mode.
  • motion vectors of four connected neighboring sub-blocks are also used to derive prediction block for the current sub-block. These multiple prediction blocks based on multiple motion vectors are combined to generate the final prediction signal of the current sub-block.
  • Prediction block based on motion vectors of a neighboring sub-block is denoted as PN, with N indicating an index for the neighboring above, below, left and right sub-blocks and prediction block based on motion vectors of the current sub-block is denoted as PC.
  • PN is based on the motion information of a neighboring sub-block that contains the same motion information to the current sub-block, the OBMC is not performed from PN. Otherwise, every sample of PN is added to the same sample in PC, i.e., four rows/columns of PN are added to PC.
  • weighting factors ⁇ 1 ⁇ 4, 1 ⁇ 8, 1/16, 1/32 ⁇ are used for PN and the weighting factors ⁇ 3 ⁇ 4, 7 ⁇ 8, 15/16, 31/32 ⁇ are used for PC.
  • the exception are small MC blocks, (i.e., when height or width of the coding block is equal to 4 or a CU is coded with sub-CU mode), for which only two rows/columns of PN are added to PC.
  • weighting factors ⁇ 1 ⁇ 4, 1 ⁇ 8 ⁇ are used for PN and weighting factors ⁇ 3 ⁇ 4, 7 ⁇ 8 ⁇ are used for PC.
  • For PN generated based on motion vectors of vertically (horizontally) neighboring sub-block samples in the same row (column) of PN are added to PC with a same weighting factor.
  • a CU level flag is signaled to indicate whether OBMC is applied or not for the current CU.
  • OBMC is applied by default.
  • the prediction signal formed by OBMC using motion information of the top neighboring block and the left neighboring block is used to compensate the top and left boundaries of the original signal of the current CU, and then the normal motion estimation process is applied.
  • LIC is based on a linear model for illumination changes, using a scaling factor a and an offset b. And it is enabled or disabled adaptively for each inter-mode coded coding unit (CU).
  • FIG. 14 shows an example of neighboring samples used to derive parameters of the IC algorithm. Specifically, and as shown in FIG. 14 , the subsampled (2:1 subsampling) neighbouring samples of the CU and the corresponding samples (identified by motion information of the current CU or sub-CU) in the reference picture are used. The IC parameters are derived and applied for each prediction direction separately.
  • the LIC flag is copied from neighboring blocks, in a way similar to motion information copy in merge mode; otherwise, an LIC flag is signaled for the CU to indicate whether LIC applies or not.
  • LIC When LIC is enabled for a picture, an additional CU level RD check is needed to determine whether LIC is applied or not for a CU.
  • MR-SAD mean-removed sum of absolute difference
  • MR-SATD mean-removed sum of absolute Hadamard-transformed difference
  • FIG. 15 shows an example of an affine motion field of a block 1400 described by two control point motion vectors V 0 and V 1 .
  • the motion vector field (MVF) of the block 1400 can be described by the following equation:
  • (v 0x , v 0y ) is motion vector of the top-left corner control point
  • (v 1x , v 1y ) is motion vector of the top-right corner control point.
  • sub-block based affine transform prediction can be applied.
  • the sub-block size M ⁇ N is derived as follows:
  • MvPre is the motion vector fraction accuracy (e.g., 1/16 in JEM).
  • (v 2x , v 2y ) is motion vector of the bottom-left control point, calculated according to Eq. (1).
  • M and N can be adjusted downward if necessary to make it a divisor of w and h, respectively.
  • FIG. 16 shows an example of affine MVF per sub-block for a block 1500 .
  • the motion vector of the center sample of each sub-block can be calculated according to Eq. (1), and rounded to the motion vector fraction accuracy (e.g., 1/16 in JEM).
  • the motion compensation interpolation filters can be applied to generate the prediction of each sub-block with derived motion vector.
  • the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.
  • AF_INTER mode In the JEM, there are two affine motion modes: AF_INTER mode and AF_MERGE mode. For CUs with both width and height larger than 8, AF_INTER mode can be applied. An affine flag in CU level is signaled in the bitstream to indicate whether AF_INTER mode is used.
  • AF_INTER mode a candidate list with motion vector pair ⁇ (v 0 , v 1 )
  • FIG. 17 shows an example of motion vector prediction (MVP) for a block 1600 in the AF_INTER mode.
  • v 0 is selected from the motion vectors of the sub-block A, B, or C.
  • the motion vectors from the neighboring blocks can be scaled according to the reference list.
  • the motion vectors can also be scaled according to the relationship among the Picture Order Count (POC) of the reference for the neighboring block, the POC of the reference for the current CU, and the POC of the current CU.
  • POC Picture Order Count
  • the approach to select v 1 from the neighboring sub-block D and E is similar. If the number of candidate list is smaller than 2, the list is padded by the motion vector pair composed by duplicating each of the AMVP candidates.
  • the candidates can be firstly sorted according to the neighboring motion vectors (e.g., based on the similarity of the two motion vectors in a pair candidate). In some implementations, the first two candidates are kept.
  • a Rate Distortion (RD) cost check is used to determine which motion vector pair candidate is selected as the control point motion vector prediction (CPMVP) of the current CU.
  • An index indicating the position of the CPMVP in the candidate list can be signaled in the bitstream. After the CPMVP of the current affine CU is determined, affine motion estimation is applied and the control point motion vector (CPMV) is found. Then the difference of the CPMV and the CPMVP is signaled in the bitstream.
  • CPMV control point motion vector
  • the MV may be derived as follows, e.g., it predicts mvd 1 and mvd 2 from mvd 0 .
  • mv 1 mv 1 +mvd 1 +mvd 0
  • mv 2 mv 2 +mvd 2 +mvd 0
  • the addition of two motion vectors e.g., mvA(xA, yA) and mvB(xB, yB)
  • MV of 2 or 3 control points needs to be determined jointly. Directly searching the multiple MVs jointly is computationally complex.
  • a fast affine ME algorithm is proposed and is adopted into VTM/BMS.
  • the affine parameters may be derived as:
  • the motion vectors can be rewritten in vector form as:
  • the MVD of AF_INTER may be derived iteratively.
  • MV i (P) the MV derived in the ith iteration for position P
  • dMV C i the delta updated for MV C in the ith iteration.
  • Pic ref (Q+A(P)*(dMV C i ) T ) may be rewritten, as an approximation based on a 1-st order Taylor expansion, as:
  • Pic ref ′ ⁇ ( Q ) [ dPic ref ⁇ ( Q ) dx ⁇ dPic ref ⁇ ( Q ) dy ] .
  • dMV C i may be derived by setting the derivative of the error function to zero, and then computing delta MV of the control points (0, 0) and (0, w) according to A(P)*(dMV C i ) T , as follows:
  • this MVD derivation process may be iterated n times, and the final MVD may be calculated as follows:
  • FIG. 19A shows an example of the selection order of candidate blocks for a current CU 1800 .
  • the selection order can be from left ( 1801 ), above ( 1802 ), above right ( 1803 ), left bottom ( 1804 ) to above left ( 1805 ) of the current CU 1800 .
  • FIG. 19B shows another example of candidate blocks for a current CU 1800 in the AF_MERGE mode. If the neighboring left bottom block 1801 is coded in affine mode, as shown in FIG.
  • the motion vectors v 2 , v 3 and v 4 of the top left corner, above right corner, and left bottom corner of the CU containing the sub-block 1801 are derived.
  • the motion vector v 0 of the top left corner on the current CU 1800 is calculated based on v2, v3 and v4.
  • the motion vector v1 of the above right of the current CU can be calculated accordingly.
  • the MVF of the current CU can be generated.
  • an affine flag can be signaled in the bitstream when there is at least one neighboring block is coded in affine mode.
  • the PMMVD mode is a special merge mode based on the Frame-Rate Up Conversion (FRUC) method. With this mode, motion information of a block is not signaled but derived at decoder side.
  • FRUC Frame-Rate Up Conversion
  • a FRUC flag can be signaled for a CU when its merge flag is true.
  • a merge index can be signaled and the regular merge mode is used.
  • an additional FRUC mode flag can be signaled to indicate which method (e.g., bilateral matching or template matching) is to be used to derive motion information for the block.
  • the decision on whether using FRUC merge mode for a CU is based on RD cost selection as done for normal merge candidate. For example, multiple matching modes (e.g., bilateral matching and template matching) are checked for a CU by using RD cost selection. The one leading to the minimal cost is further compared to other CU modes. If a FRUC matching mode is the most efficient one, FRUC flag is set to true for the CU and the related matching mode is used.
  • multiple matching modes e.g., bilateral matching and template matching
  • motion derivation process in FRUC merge mode has two steps: a CU-level motion search is first performed, then followed by a Sub-CU level motion refinement.
  • CU level an initial motion vector is derived for the whole CU based on bilateral matching or template matching.
  • a list of MV candidates is generated and the candidate that leads to the minimum matching cost is selected as the starting point for further CU level refinement.
  • a local search based on bilateral matching or template matching around the starting point is performed.
  • the MV results in the minimum matching cost is taken as the MV for the whole CU.
  • the motion information is further refined at sub-CU level with the derived CU motion vectors as the starting points.
  • the following derivation process is performed for a W ⁇ H CU motion information derivation.
  • MV for the whole W ⁇ H CU is derived.
  • the CU is further split into M ⁇ M sub-CUs.
  • the value of M is calculated as in Eq. (3), D is a predefined splitting depth which is set to 3 by default in the JEM. Then the MV for each sub-CU is derived.
  • FIG. 20 shows an example of bilateral matching used in the Frame-Rate Up Conversion (FRUC) method.
  • the bilateral matching is used to derive motion information of the current CU by finding the closest match between two blocks along the motion trajectory of the current CU ( 1900 ) in two different reference pictures ( 1910 , 1911 ).
  • the motion vectors MV 0 ( 1901 ) and MV 1 ( 1902 ) pointing to the two reference blocks are proportional to the temporal distances, e.g., TD 0 ( 1903 ) and TD 1 ( 1904 ), between the current picture and the two reference pictures.
  • the bilateral matching becomes mirror based bi-directional MV.
  • FIG. 21 shows an example of template matching used in the Frame-Rate Up Conversion (FRUC) method.
  • Template matching can be used to derive motion information of the current CU 2000 by finding the closest match between a template (e.g., top and/or left neighboring blocks of the current CU) in the current picture and a block (e.g., same size to the template) in a reference picture 2010 .
  • a template e.g., top and/or left neighboring blocks of the current CU
  • a block e.g., same size to the template
  • AMVP has two candidates.
  • a new candidate can be derived.
  • the newly derived candidate by template matching is different to the first existing AMVP candidate, it is inserted at the very beginning of the AMVP candidate list and then the list size is set to two (e.g., by removing the second existing AMVP candidate).
  • the list size is set to two (e.g., by removing the second existing AMVP candidate).
  • the MV candidate set at CU level can include the following: (1) original AMVP candidates if the current CU is in AMVP mode, (2) all merge candidates, (3) several MVs in the interpolated MV field (described later), and top and left neighboring motion vectors.
  • each valid MV of a merge candidate can be used as an input to generate a MV pair with the assumption of bilateral matching.
  • one valid MV of a merge candidate is (MVa, ref a ) at reference list A.
  • the reference picture ref b of its paired bilateral MV is found in the other reference list B so that ref a and ref b are temporally at different sides of the current picture. If such a ref b is not available in reference list B, ref b is determined as a reference which is different from ref a and its temporal distance to the current picture is the minimal one in list B.
  • MVb is derived by scaling MVa based on the temporal distance between the current picture and ref a , ref b .
  • four MVs from the interpolated MV field can also be added to the CU level candidate list. More specifically, the interpolated MVs at the position (0, 0), (W/2, 0), (0, H/2) and (W/2, H/2) of the current CU are added.
  • the original AMVP candidates are also added to CU level MV candidate set.
  • 15 MVs for AMVP CUs and 13 MVs for merge CUs can be added to the candidate list.
  • the MV candidate set at sub-CU level includes an MV determined from a CU-level search, (2) top, left, top-left and top-right neighboring MVs, (3) scaled versions of collocated MVs from reference pictures, (4) one or more ATMVP candidates (e.g., up to four), and (5) one or more STMVP candidates (e.g., up to four).
  • the scaled MVs from reference pictures are derived as follows. The reference pictures in both lists are traversed. The MVs at a collocated position of the sub-CU in a reference picture are scaled to the reference of the starting CU-level MV.
  • ATMVP and STMVP candidates can be the four first ones.
  • one or more MVs are added to the candidate list.
  • interpolated motion field is generated for the whole picture based on unilateral ME. Then the motion field may be used later as CU level or sub-CU level MV candidates.
  • the motion field of each reference pictures in both reference lists is traversed at 4 ⁇ 4 block level.
  • FIG. 22 shows an example of unilateral Motion Estimation (ME) 2100 in the FRUC method.
  • ME Motion Estimation
  • the motion of the reference block is scaled to the current picture according to the temporal distance TD 0 and TD 1 (the same way as that of MV scaling of TMVP in HEVC) and the scaled motion is assigned to the block in the current frame. If no scaled MV is assigned to a 4 ⁇ 4 block, the block's motion is marked as unavailable in the interpolated motion field.
  • bi-linear interpolation instead of regular 8-tap HEVC interpolation can be used for both bilateral matching and template matching.
  • the matching cost is a bit different at different steps.
  • the matching cost can be the absolute sum difference (SAD) of bilateral matching or template matching.
  • SAD absolute sum difference
  • the matching cost C of bilateral matching at sub-CU level search is calculated as follows:
  • w is a weighting factor.
  • w can be empirically set to 4.
  • MV and MVS indicate the current MV and the starting MV, respectively.
  • SAD may still be used as the matching cost of template matching at sub-CU level search.
  • MV is derived by using luma samples only. The derived motion will be used for both luma and chroma for MC inter prediction. After MV is decided, final MC is performed using 8-taps interpolation filter for luma and 4-taps interpolation filter for chroma.
  • MV refinement is a pattern based MV search with the criterion of bilateral matching cost or template matching cost.
  • two search patterns are supported—an unrestricted center-biased diamond search (UCBDS) and an adaptive cross search for MV refinement at the CU level and sub-CU level, respectively.
  • UMBDS center-biased diamond search
  • the MV is directly searched at quarter luma sample MV accuracy, and this is followed by one-eighth luma sample MV refinement.
  • the search range of MV refinement for the CU and sub-CU step are set equal to 8 luma samples.
  • bi-prediction is applied because the motion information of a CU is derived based on the closest match between two blocks along the motion trajectory of the current CU in two different reference pictures.
  • the encoder can choose among uni-prediction from list0, uni-prediction from list1, or bi-prediction for a CU. The selection ca be based on a template matching cost as follows:
  • cost0 is the SAD of list0 template matching
  • cost1 is the SAD of list1 template matching
  • costBi is the SAD of bi-prediction template matching.
  • the value of factor is equal to 1.25, it means that the selection process is biased toward bi-prediction.
  • the inter prediction direction selection can be applied to the CU-level template matching process.
  • the bi-directional optical flow (BIO) method is a sample-wise motion refinement performed on top of block-wise motion compensation for bi-prediction.
  • the sample-level motion refinement does not use signaling.
  • ⁇ I (k) / ⁇ x and ⁇ I (k) / ⁇ y the horizontal and vertical components of the I (k) gradient, respectively.
  • the motion vector field (v x , v y ) is given by:
  • FIG. 23 shows an example optical flow trajectory in the Bi-directional Optical flow (BIO) method.
  • ⁇ 0 and ⁇ 1 denote the distances to the reference frames.
  • the motion vector field (v x , v y ) is determined by minimizing the difference ⁇ between values in points A and B.
  • FIGS. 9A-9B show an example of intersection of motion trajectory and reference frame planes. Model uses only first linear term of a local Taylor expansion for ⁇ :
  • the JEM uses a simplified approach making first a minimization in the vertical direction and then in the horizontal direction. This results in the following:
  • v x ( s 1 + r ) > m ? clip ⁇ ⁇ ⁇ 3 ⁇ ( - thBIO , thBIO , - s 3 ( s 1 + r ) ) ⁇ : ⁇ 0 Eq . ⁇ ( 9 )
  • v y ( s 5 + r ) > m ? clip ⁇ ⁇ 3 ⁇ ( - thBIO , thBIO , - s 6 - v x ⁇ s 2 ⁇ / ⁇ 2 ( s 5 + r ) ) ⁇ : ⁇ 0 ⁇ ⁇ ⁇ where , Eq .
  • d is bit depth of the video samples.
  • FIG. 24A shows an example of access positions outside of a block 2300 .
  • 2M+1) ⁇ (2M+1) square window ⁇ centered in currently predicted point on a boundary of predicted block needs to accesses positions outside of the block.
  • values of I (k) , ⁇ I (k) / ⁇ x, ⁇ I (k) / ⁇ y outside of the block are set to be equal to the nearest available value inside the block. For example, this can be implemented as a padding area 2301 , as shown in FIG. 24B .
  • BIO it is possible that the motion field can be refined for each sample.
  • a block-based design of BIO is used in the JEM.
  • the motion refinement can be calculated based on a 4 ⁇ 4 block.
  • the values of s n in Eq. (9) of all samples in a 4 ⁇ 4 block can be aggregated, and then the aggregated values of s n in are used to derived BIO motion vectors offset for the 4 ⁇ 4 block. More specifically, the following formula can used for block-based BIO derivation:
  • b k denotes the set of samples belonging to the k-th 4 ⁇ 4 block of the predicted block.
  • s n in Eq (9) and Eq (10) are replaced by ((s n,bk )>>4) to derive the associated motion vector offsets.
  • MV regiment of BIO may be unreliable due to noise or irregular motion. Therefore, in BIO, the magnitude of MV regiment is clipped to a threshold value.
  • the threshold value is determined based on whether the reference pictures of the current picture are all from one direction. For example, if all the reference pictures of the current picture are from one direction, the value of the threshold is set to 12 ⁇ 2 14-d ; otherwise, it is set to 12 ⁇ 2 13-d .
  • Gradients for BIO can be calculated at the same time with motion compensation interpolation using operations consistent with HEVC motion compensation process (e.g., 2D separable Finite Impulse Response (FIR)).
  • the input for the 2D separable FIR is the same reference frame sample as for motion compensation process and fractional position (fracX, fracY) according to the fractional part of block motion vector.
  • fracX, fracY fractional position
  • fracX, fracY fractional position
  • fracX, fracY fractional position
  • fracX, fracY fractional position
  • a signal is first interpolated vertically using BIOfilterS corresponding to the fractional position fracY with de-scaling shift d ⁇ 8.
  • Gradient filter BIOfilterG is then applied in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18 ⁇ d.
  • a gradient filter is applied vertically using BIOfilterG corresponding to the fractional position fracY with de-scaling shift d ⁇ 8.
  • the signal displacement is then performed using BIOfilterS in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18 ⁇ d.
  • the length of interpolation filter for gradients calculation BIOfilterG and signal displacement BIOfilterF can be shorter (e.g., 6-tap) in order to maintain reasonable complexity.
  • Table 1 shows example filters that can be used for gradients calculation of different fractional positions of block motion vector in BIO.
  • Table 2 shows example interpolation filters that can be used for prediction signal generation in BIO.
  • BIO can be applied to all bi-predicted blocks when the two predictions are from different reference pictures.
  • BIO can be disabled.
  • BIO is applied for a block after normal MC process.
  • BIO may not be applied during the OBMC process. This means that BIO is applied in the MC process for a block when using its own MV and is not applied in the MC process when the MV of a neighboring block is used during the OBMC process.
  • a bi-prediction operation for the prediction of one block region, two prediction blocks, formed using a motion vector (MV) of list0 and a MV of list1, respectively, are combined to form a single prediction signal.
  • the two motion vectors of the bi-prediction are further refined by a bilateral template matching process.
  • the bilateral template matching applied in the decoder to perform a distortion-based search between a bilateral template and the reconstruction samples in the reference pictures in order to obtain a refined MV without transmission of additional motion information.
  • a bilateral template is generated as the weighted combination (i.e. average) of the two prediction blocks, from the initial MV 0 of list0 and MV 1 of list1, respectively, as shown in FIG. 25 .
  • the template matching operation consists of calculating cost measures between the generated template and the sample region (around the initial prediction block) in the reference picture. For each of the two reference pictures, the MV that yields the minimum template cost is considered as the updated MV of that list to replace the original one.
  • nine MV candidates are searched for each list. The nine MV candidates include the original MV and 8 surrounding MVs with one luma sample offset to the original MV in either the horizontal or vertical direction, or both.
  • the two new MVs i.e., MV 0 ′ and MV 1 ′ as shown in FIG. 25 , are used for generating the final bi-prediction results.
  • a sum of absolute differences (SAD) is used as the cost measure.
  • DMVR is applied for the merge mode of bi-prediction with one MV from a reference picture in the past and another from a reference picture in the future, without the transmission of additional syntax elements.
  • JEM when LIC, affine motion, FRUC, or sub-CU merge candidate is enabled for a CU, DMVR is not applied.
  • Symmetric motion vector difference (SMVD) is proposed to encode the MVD more efficiently.
  • variables BiDirPredFlag, RefIdxSymL0 and RefIdxSymL1 are derived as follows:
  • the forward reference picture in reference picture list 0 which is nearest to the current picture is searched. If found, RefIdxSymL0 is set equal to the reference index of the forward picture.
  • the backward reference picture in reference picture list 1 which is nearest to the current picture is searched. If found, RefIdxSymL1 is set equal to the reference index of the backward picture.
  • BiDirPredFlag is set equal to 1.
  • the backward reference picture in reference picture list 0 which is nearest to the current one is searched. If found, RefIdxSymL0 is set equal to the reference index of the backward picture.
  • the forward reference picture in reference picture list 1 which is nearest to the current one is searched. If found, RefIdxSymL1 is set equal to the reference index of the forward picture.
  • BiDirPredFlag is set equal to 1. Otherwise, BiDirPredFlag is set equal to 0.
  • a symmetrical mode flag indicating whether symmetrical mode is used or not is explicitly signaled if the prediction direction for the CU is bi-prediction and BiDirPredFlag is equal to 1.
  • MVD0 When the flag is true, only mvp_l0_flag, mvp_l1_flag and MVD0 are explicitly signaled.
  • the reference indices are set equal to RefIdxSymL0, RefIdxSymL1 for list 0 and list 1, respectively.
  • MVD1 is just set equal to ⁇ MVD0.
  • the final motion vectors are shown in below formula.
  • FIG. 28 shows examples of symmetrical mode.
  • CABAC Context-Adaptive Binary Arithmetic Coding
  • n (offsetIdx ⁇ 3) ⁇ 16 (35)
  • the two values assigned to pStateIdx and valMps for the initialization are derived from the luma's quantization parameter of slice denoted by SliceQpY. Given the variables m and n, the initialization is specified as follows:
  • preCtxState Clip3(1,126,(( m *Clip3(0,51,Slice QpY ))>>4)+ n )
  • Inputs to this process are the current pStateIdx, the decoded value binVal and valMps values of the context variable associated with ctxTable and ctxIdx.
  • Outputs of this process are the updated pStateIdx and valMps of the context variable associated with ctxIdx.
  • the context-adaptive binary arithmetic coder (BAC) in VVC has been changed in VVC which is different from that in HEVC in terms of both context updating process and arithmetic coder.
  • n VVC two values assigned to pStateIdx0 and pStateIdx1 for the initialization are derived from SliceQpY. Given the variables m and n, the initialization is specified as follows:
  • preCtxState Clip3(0,127,(( m *Clip3(0,51,Slice QpY ))>>4)+ n )
  • Inputs to this process are the current pStateIdx0 and pStateIdx1, and the decoded value binVal.
  • Outputs of this process are the updated pStateIdx0 and pStateIdx1 of the context variable associated with ctxIdx.
  • p StateIdx0 p StateIdx0 ⁇ ( p StateIdx0>>shift0)+(1023*binVal>>shift0)
  • p StateIdx1 p StateIdx1 ⁇ ( p StateIdx1>>shift1)+(16383*binVal>>shift1) (40)
  • MV/MV difference (MVD) could be selected from a set of multiple MV/MVD precisions for affine coded blocks, it remains uncertain how more accurate motion vectors may be obtained.
  • the MV/MVD precision information also plays an important role in determination of the overall coding gain of AMVR applied to affine mode, but achieving this goal remains uncertain.
  • Embodiments of the presently disclosed technology overcome the drawbacks of existing implementations, thereby providing video coding with higher coding efficiencies.
  • the derivation and signaling of motion vector predictors for affine mode with adaptive motion vector resolution (AMVR), based on the disclosed technology, may enhance both existing and future video coding standards, is elucidated in the following examples described for various implementations.
  • the examples of the disclosed technology provided below explain general concepts, and are not meant to be interpreted as limiting. In an example, unless explicitly indicated to the contrary, the various features described in these examples may be combined.
  • the following examples may be applied to affine mode or normal mode when AMVR is applied.
  • a precision Prec i.e., MV is with 1/(2 ⁇ circumflex over ( ) ⁇ Prec) precision
  • MVPred e.g., inherited from a neighboring block MV
  • MVPred MVPred
  • sps_affine_amvr_enabled_flag 1 specifies that adaptive motion vector difference resolution is used in motion vector coding of affine inter mode.
  • amvr_enabled_flag 0 specifies that adaptive motion vector difference resolution is not used in motion vector coding of affine inter mode.
  • Syntax of the affine AMVR mode information may reuse that for the AMVR mode information (applied to normal inter mode). Alternatively, different syntax elements may be utilized. Affine AMVR mode information may be conditionally signaled. Different embodiments below show some examples of the conditions.
  • conditionsA is defined as follows:
  • conditionsA is defined as follows:
  • X is being 0 or 1.
  • conditionsA is defined as follows:
  • conditionsB is defined as follows:
  • conditionsB is defined as follows:
  • amvr_flag[x0][y0] specifies the resolution of motion vector difference.
  • the array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture.
  • amvr_flag[x0][y0] 0 specifies that the resolution of the motion vector difference is 1 ⁇ 4 of a luma sample.
  • amvr_flag[x0][y0] equal to 1 specifies that the resolution of the motion vector difference is further specified by amvr_coarse_precisoin_flag[x0][y0].
  • inter_affine_flag[x0][y0] is equal to 1
  • the variable MvShift is set equal to (affine_amvr_coarse_precisoin_flag? (affine_amvr_coarse_precisoin_flag ⁇ 1):( ⁇ (affine_amvr_flag ⁇ 1))).
  • the rounding process is modified that when the given rightShift value is equal to 0 (which happens for 1/16-pel precision), the rounding offset is set to 0 instead of (1 ⁇ (rightShift ⁇ 1)).
  • Output of this process is the rounded motion vector mvX.
  • the rounding process invoked in the affine motion vector derivation process are performed with the input of (MvShift+2) instead of being fixed to be 2.
  • the number of control point motion vector predictor candidates in the list numCpMvpCandLX is set equal to 0.
  • variable availableFlagA is set equal to TRUE
  • variable availableFlagB is set equal to TRUE
  • the derivation process for temporal luma motion vector prediction as specified in clause 8.4.2.11 is with the luma coding block location (xCb, yCb), the luma coding block width cbWidth, the luma coding block height cbHeight and refIdxLX as inputs, and with the output being the availability flag availableFlagLXCol and the temporal motion vector predictor mvLXCol.
  • the affine control point motion vector predictor cpMvpLX with X being 0 or 1 is derived as follows:
  • cpMvpLX cpMvpListLX[mvp_1 X _flag[ xCb ][ yCb ]] (8-642)
  • the first (top-left) control point motion vector cpMvLX[0] and the availability flag availableFlagLX[0] are derived in the following ordered steps:
  • the sample locations (xNbB2, yNbB2), (xNbB3, yNbB3) and (xNbA2, yNbA2) are set equal to (xCb ⁇ 1, yCb ⁇ 1), (xCb, yCb ⁇ 1) and (xCb ⁇ 1, yCb), respectively.
  • the availability flag availableFlagLX[0] is set equal to 0 and both components of cpMvLX[0] are set equal to 0.
  • the availability derivation process for a coding block as specified in clause is invoked with the luma coding block location (xCb, yCb), the luma coding block width cbWidth, the luma coding block height cbHeight, the luma location (xNbY, yNbY) set equal to (xNbTL, yNbTL) as inputs, and the output is assigned to the coding block availability flag availableTL.
  • the second (top-right) control point motion vector cpMvLX[1] and the availability flag availableFlagLX[1] are derived in the following ordered steps:
  • the sample locations (xNbB1, yNbB1) and (xNbB0, yNbB0) are set equal to (xCb+cbWidth ⁇ 1, yCb ⁇ 1) and (xCb+cbWidth, yCb ⁇ 1), respectively.
  • the availability flag availableFlagLX[1] is set equal to 0 and both components of cpMvLX[1] are set equal to 0.
  • the availability derivation process for a coding block as specified in clause 6.4.X is invoked with the luma coding block location (xCb, yCb), the luma coding block width cbWidth, the luma coding block height cbHeight, the luma location (xNbY, yNbY) set equal to (xNbTR, yNbTR) as inputs, and the output is assigned to the coding block availability flag availableTR.
  • the third (bottom-left) control point motion vector cpMvLX[2] and the availability flag availableFlagLX[2] are derived in the following ordered steps:
  • sample locations (xNbA1, yNbA1) and (xNbA0, yNbA0) are set equal to (xCb ⁇ 1, yCb+cbHeight ⁇ 1) and (xCb ⁇ 1, yCb+cbHeight), respectively.
  • the availability flag availableFlagLX[2] is set equal to 0 and both components of cpMvLX[2] are set equal to 0.
  • context increasement offset ctxInc (condL && availableL)+(condA && availableA)+ctxSetIdx*3.
  • ctxInc ((condL && availableL) II (condA && availableA))+ctxSetIdx*3.
  • FIG. 26A shows a flowchart of an exemplary method for video processing.
  • the method 2610 includes, at step 2610 , determining, for a conversion between a coded representation of a current block of a video and the current block, a motion vector difference (MVD) precision to be used for the conversion from a set of allowed multiple MVD precisions applicable to a video region containing the current video block.
  • the method 2610 includes, at step 2614 , performing the conversion based on the MVD precision.
  • MVD motion vector difference
  • FIG. 26B shows a flowchart of an exemplary method for video processing.
  • the method 2610 as shown in FIG. 26B includes, at step 2612 , determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, a usage of multiple motion vector difference (MVD) precisions for the conversion of the one or more video blocks in the video region.
  • the method 2610 includes, at step 2614 , performing the conversion based on the determination.
  • FIG. 26C shows a flowchart of an exemplary method for video processing.
  • the method 2620 as shown in FIG. 26C includes, at step 2622 , determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, whether to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video.
  • the method 2620 includes, at step 2624 , performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • FIG. 26D shows a flowchart of an exemplary method for video processing.
  • the method 2630 as shown in FIG. 26D includes, at step 2632 , determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, how to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video.
  • the method 2630 includes, at step 2634 , performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • FIG. 26E shows a flowchart of an exemplary method for video processing.
  • the method 2640 as shown in FIG. 26E includes, at step 2642 , determining, based on a coding mode of a parent coding unit of a current coding unit that uses an affine coding mode or a rate-distortion (RD) cost of the affine coding mode, a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block.
  • the method 2640 includes, at step 2644 , performing, the conversion according to a result of the determining.
  • FIG. 26F shows a flowchart of an exemplary method for video processing.
  • the method 2650 as shown in FIG. 26F includes, at step 2652 , determining a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block that uses an advanced motion vector prediction (AMVP) coding mode, the determining based on a rate-distortion (RD) cost of the AMVP coding mode.
  • the method 2650 includes, at step 2654 , performing, the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • AMVP advanced motion vector prediction
  • RD rate-distortion
  • FIG. 26G shows a flowchart of an exemplary method for video processing.
  • the method 2660 as shown in FIG. 26G includes, at step 2662 , generating, for a conversion between a coded representation of a current block of a video and the current block, a set of MV (Motion Vector) precisions using a 4-parameter affine model or 6-parameter affine model.
  • the method 2660 includes, at step 2664 , performing, the conversion based on the set of MV precisions.
  • MV Motion Vector
  • FIG. 26H shows a flowchart of an exemplary method for video processing.
  • the method 2670 as shown in FIG. 26H includes, at step 2672 , determining, based on a coding mode of a parent block of a current block that uses an affine coding mode, whether an adaptive motion vector resolution (AMVR) tool is used for a conversion, wherein the AMVR tool is used to refine motion vector resolution during decoding.
  • the method 2670 includes, at step 2674 , performing the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • FIG. 26I shows a flowchart of an exemplary method for video processing.
  • the method 2680 as shown in FIG. 26I includes, at step 2682 , determining, based on a usage of MV precisions for previous blocks that has been previously coded using an affine coding mode, a termination of a rate-distortion (RD) calculations of MV precisions for a current block that uses the affine coding mode for a conversion between a coded representation of the current block and the current block.
  • the method 2680 includes, at step 2684 , performing the conversion according to a result of the determining.
  • FIG. 27 is an example of a block diagram of a video processing apparatus 2700 .
  • the apparatus 2700 may be used to implement one or more of the methods described herein.
  • the apparatus 2700 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on.
  • the apparatus 2700 may include one or more processors 2702 , one or more memories 2704 and video processing hardware 2706 .
  • the processor(s) 2702 may be configured to implement one or more methods (including, but not limited to, methods 2610 to 2680 ) described in the present document.
  • the memory (memories) 2704 may be used for storing data and code used for implementing the methods and techniques described herein.
  • the video processing hardware 2706 may be used to implement, in hardware circuitry, some techniques described in the present document.
  • FIG. 29 is another example of a block diagram of a video processing system in which disclosed techniques may be implemented.
  • FIG. 29 is a block diagram showing an example video processing system 2900 in which various techniques disclosed herein may be implemented.
  • the system 2900 may include input 2902 for receiving video content.
  • the video content may be received in a raw or uncompressed format, e.g., 8 or 10 bit multi-component pixel values, or may be in a compressed or encoded format.
  • the input 2902 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as Wi-Fi or cellular interfaces.
  • the system 2900 may include a coding component 2904 that may implement the various coding or encoding methods described in the present document.
  • the coding component 2904 may reduce the average bitrate of video from the input 2902 to the output of the coding component 2904 to produce a coded representation of the video.
  • the coding techniques are therefore sometimes called video compression or video transcoding techniques.
  • the output of the coding component 2904 may be either stored, or transmitted via a communication connected, as represented by the component 2906 .
  • the stored or communicated bitstream (or coded) representation of the video received at the input 2902 may be used by the component 2908 for generating pixel values or displayable video that is sent to a display interface 2910 .
  • the process of generating user-viewable video from the bitstream representation is sometimes called video decompression.
  • video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.
  • peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or Displayport, and so on.
  • storage interfaces include SATA (serial advanced technology attachment), PCI, IDE interface, and the like.
  • the video processing methods may be implemented using an apparatus that is implemented on a hardware platform as described with respect to FIG. 27 or 29 .
  • the first set of clauses use some of the techniques described in the previous section, including, for example, items 1, 2, and 13-15 in the previous section.
  • a method of video processing comprising: determining, for a conversion between a coded representation of a current block of a video and the current block, a motion vector difference (MVD) precision to be used for the conversion from a set of allowed multiple MVD precisions applicable to a video region containing the current video block; and performing the conversion based on the MVD precision.
  • MVD motion vector difference
  • a context for MVD precision indications is determined based on a size, shape, or MVD precisions of neighboring blocks, a temporal layer index, or prediction directions.
  • a syntax element equal to 1 specifies a requirement to conform the coded representation, the requirement requiring that both of a first syntax element to indicate whether a first set of multiple MVD precisions is enabled for a non-affine mode and a second syntax element to indicate whether a second set of multiple MVD precisions is enabled for the affine-mode are 0.
  • An apparatus in a video system comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to implement the method in any one of clauses 1 to 41.
  • a computer program product stored on a non-transitory computer readable media including program code for carrying out the method in any one of clauses 1 to 41.
  • the second set of clauses use some of the techniques described in the previous section, including, for example, items 3, 4, and 12 in the previous section.
  • a method of video processing comprising: determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, a usage of multiple motion vector difference (MVD) precisions for the conversion of the one or more video blocks in the video region; and performing the conversion based on the determining.
  • VMD motion vector difference
  • a method of video processing comprising: determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, whether to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video; and performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • a method of video processing comprising: determining, for a video region comprising one or more video blocks of a video and a coded representation of the video, how to apply an adaptive motion vector resolution (AMVR) process to a current video block for a conversion between the current video block and the coded representation of the video; and performing the conversion based on the determining.
  • AMVR adaptive motion vector resolution
  • An apparatus in a video system comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to implement the method in any one of clauses 1 to 15.
  • a computer program product stored on a non-transitory computer readable media including program code for carrying out the method in any one of clauses 1 to 15.
  • the third set of clauses use some of the techniques described in the previous section, including, for example, items 5-10 and 13 in the previous section.
  • a method of video processing comprising: determining, based on a coding mode of a parent coding unit of a current coding unit that uses an affine coding mode or a rate-distortion (RD) cost of the affine coding mode, a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block; and performing the conversion according to a result of the determining.
  • RD rate-distortion
  • a method of video processing comprising: determining a usage of an adaptive motion vector resolution (AMVR) for a conversion between a coded representation of a current block of a video and the current block that uses an advanced motion vector prediction (AMVP) coding mode, the determining based on a rate-distortion (RD) cost of the AMVP coding mode; and performing the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • AMVP advanced motion vector prediction
  • a method of video processing comprising: generating, for a conversion between a coded representation of a current block of a video and the current block, a set of MV (Motion Vector) precisions using a 4-parameter affine model or 6-parameter affine model; and performing the conversion based on the set of MV precisions.
  • MV Motion Vector
  • a method of video processing comprising: determining, based on a coding mode of a parent block of a current block that uses an affine coding mode, whether an adaptive motion vector resolution (AMVR) tool is used for a conversion, wherein the AMVR tool is used to refine motion vector resolution during decoding; and performing the conversion according to a result of the determining.
  • AMVR adaptive motion vector resolution
  • a method of video processing comprising: determining, based on a usage of MV precisions for previous blocks that has been previously coded using an affine coding mode, a termination of a rate-distortion (RD) calculations of MV precisions for a current block that uses the affine coding mode for a conversion between a coded representation of the current block and the current block; and performing the conversion according to a result of the determining.
  • RD rate-distortion
  • An apparatus in a video system comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to implement the method in any one of clauses 1 to 22.
  • a computer program product stored on a non-transitory computer readable media the computer program product including program code for carrying out the method in any one of claims 1 to 22 .
  • Implementations of the subject matter and the functional operations described in this patent document can be implemented in various systems, digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible and non-transitory computer readable medium for execution by, or to control the operation of, data processing apparatus.
  • the computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them.
  • data processing unit or “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers.
  • the apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.
  • a computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
  • a computer program does not necessarily correspond to a file in a file system.
  • a program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code).
  • a computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
  • the processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output.
  • the processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
  • processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer.
  • a processor will receive instructions and data from a read only memory or a random access memory or both.
  • the essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data.
  • a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks.
  • mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks.
  • a computer need not have such devices.
  • Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices.
  • semiconductor memory devices e.g., EPROM, EEPROM, and flash memory devices.
  • the processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
US16/814,840 2018-09-19 2020-03-10 Syntax reuse for affine mode with adaptive motion vector resolution Abandoned US20200213612A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US17/326,616 US20210289225A1 (en) 2018-09-19 2021-05-21 Syntax reuse for affine mode with adaptive motion vector resolution
US18/350,554 US20240015320A1 (en) 2018-09-19 2023-07-11 Syntax reuse for affine mode with adaptive motion vector resolution

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
CNPCT/CN2018/106513 2018-09-19
CN2018106513 2018-09-19
CN2019074433 2019-02-01
CNPCT/CN2019/074433 2019-02-01
PCT/IB2019/057897 WO2020058890A1 (en) 2018-09-19 2019-09-19 Syntax reuse for affine mode with adaptive motion vector resolution

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2019/057897 Continuation WO2020058890A1 (en) 2018-09-19 2019-09-19 Syntax reuse for affine mode with adaptive motion vector resolution

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/326,616 Continuation US20210289225A1 (en) 2018-09-19 2021-05-21 Syntax reuse for affine mode with adaptive motion vector resolution

Publications (1)

Publication Number Publication Date
US20200213612A1 true US20200213612A1 (en) 2020-07-02

Family

ID=68051876

Family Applications (5)

Application Number Title Priority Date Filing Date
US16/814,832 Active US11265573B2 (en) 2018-09-19 2020-03-10 Syntax reuse for affine mode with adaptive motion vector resolution
US16/814,840 Abandoned US20200213612A1 (en) 2018-09-19 2020-03-10 Syntax reuse for affine mode with adaptive motion vector resolution
US17/204,448 Active US11653020B2 (en) 2018-09-19 2021-03-17 Fast algorithms for adaptive motion vector resolution in affine mode
US17/326,616 Abandoned US20210289225A1 (en) 2018-09-19 2021-05-21 Syntax reuse for affine mode with adaptive motion vector resolution
US18/350,554 Pending US20240015320A1 (en) 2018-09-19 2023-07-11 Syntax reuse for affine mode with adaptive motion vector resolution

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US16/814,832 Active US11265573B2 (en) 2018-09-19 2020-03-10 Syntax reuse for affine mode with adaptive motion vector resolution

Family Applications After (3)

Application Number Title Priority Date Filing Date
US17/204,448 Active US11653020B2 (en) 2018-09-19 2021-03-17 Fast algorithms for adaptive motion vector resolution in affine mode
US17/326,616 Abandoned US20210289225A1 (en) 2018-09-19 2021-05-21 Syntax reuse for affine mode with adaptive motion vector resolution
US18/350,554 Pending US20240015320A1 (en) 2018-09-19 2023-07-11 Syntax reuse for affine mode with adaptive motion vector resolution

Country Status (7)

Country Link
US (5) US11265573B2 (zh)
EP (2) EP3827586A1 (zh)
JP (2) JP7212150B2 (zh)
KR (2) KR20240005178A (zh)
CN (4) CN110933420B (zh)
TW (3) TW202025737A (zh)
WO (3) WO2020058886A1 (zh)

Cited By (42)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11082721B2 (en) * 2017-09-07 2021-08-03 Lg Electronics Inc. Method and apparatus for entropy-encoding and entropy-decoding video signal
US11089317B2 (en) * 2017-08-03 2021-08-10 Lg Electronics Inc. Method and apparatus for processing video signal using affine prediction
US20210266584A1 (en) 2018-11-16 2021-08-26 Beijing Bytedance Network Technology Co., Ltd. Usage for history-based affine parameters
US11172196B2 (en) 2018-09-24 2021-11-09 Beijing Bytedance Network Technology Co., Ltd. Bi-prediction with weights in video coding and decoding
US11178399B2 (en) * 2019-03-12 2021-11-16 Qualcomm Incorporated Probability initialization for video coding
US11178396B2 (en) * 2018-11-14 2021-11-16 Tencent America LLC Constrained intra prediction and unified most probable mode list generation
US11197003B2 (en) 2018-06-21 2021-12-07 Beijing Bytedance Network Technology Co., Ltd. Unified constrains for the merge affine mode and the non-merge affine mode
US11197007B2 (en) 2018-06-21 2021-12-07 Beijing Bytedance Network Technology Co., Ltd. Sub-block MV inheritance between color components
US11202081B2 (en) 2018-06-05 2021-12-14 Beijing Bytedance Network Technology Co., Ltd. Interaction between IBC and BIO
US20220053206A1 (en) * 2019-05-15 2022-02-17 Wilus Institute Of Standards And Technology Inc. Video signal processing method and apparatus using adaptive motion vector resolution
US11265573B2 (en) 2018-09-19 2022-03-01 Beijing Bytedance Network Technology Co., Ltd. Syntax reuse for affine mode with adaptive motion vector resolution
US20220116662A1 (en) * 2019-03-11 2022-04-14 Interdigital Vc Holdings, Inc. Entropy coding for video encoding and decoding
US11310508B2 (en) 2018-12-21 2022-04-19 Beijing Bytedance Network Technology Co., Ltd. Motion vector precision in merge with motion vector difference mode
US11330289B2 (en) 2019-01-31 2022-05-10 Beijing Bytedance Network Technology Co., Ltd. Context for coding affine mode adaptive motion vector resolution
US11356697B2 (en) 2019-04-19 2022-06-07 Beijing Bytedance Network Technology Co., Ltd. Gradient calculation in different motion vector refinements
US11368711B2 (en) 2019-04-19 2022-06-21 Beijing Bytedance Network Technology Co., Ltd. Applicability of prediction refinement with optical flow process
US11418794B2 (en) 2019-04-25 2022-08-16 Beijing Bytedance Network Technology Co., Ltd. Restrictions on motion vector difference
US11431965B2 (en) 2018-09-08 2022-08-30 Beijing Bytedance Network Technology Co., Ltd. Affine mode in video coding and decoding
US20220295089A1 (en) * 2021-03-12 2022-09-15 Lemon Inc. Motion candidate derivation
US11463703B2 (en) 2019-04-28 2022-10-04 Beijing Bytedance Network Technology Co., Ltd. Symmetric motion vector difference coding
WO2022214244A1 (en) * 2021-04-09 2022-10-13 Interdigital Vc Holdings France, Sas Intra block copy with template matching for video encoding and decoding
US11477458B2 (en) 2018-06-19 2022-10-18 Beijing Bytedance Network Technology Co., Ltd. Mode dependent motion vector difference precision set
US11483567B2 (en) * 2018-09-22 2022-10-25 Lg Electronics Inc. Method and apparatus for processing video signals on basis of inter prediction
US11516497B2 (en) 2019-04-02 2022-11-29 Beijing Bytedance Network Technology Co., Ltd. Bidirectional optical flow based video coding and decoding
US20220385910A1 (en) * 2019-11-11 2022-12-01 Hfi Innovation Inc. Method and Apparatus of Signaling Adaptive Motion Vector Difference Resolution in Video Coding
US11546601B2 (en) 2018-09-23 2023-01-03 Beijing Bytedance Network Technology Co., Ltd. Utilization of non-sub block spatial-temporal motion vector prediction in inter mode
US11570462B2 (en) 2019-04-19 2023-01-31 Beijing Bytedance Network Technology Co., Ltd. Delta motion vector in prediction refinement with optical flow process
US11582451B2 (en) 2019-09-09 2023-02-14 Beijing Bytedance Network Technology Co., Ltd. Coefficient scaling for high precision image and video coding
US20230147701A1 (en) * 2020-04-02 2023-05-11 Sharp Kabushiki Kaisha Video decoding apparatus and video decoding method
US11671616B2 (en) 2021-03-12 2023-06-06 Lemon Inc. Motion candidate derivation
US11677973B2 (en) 2018-11-15 2023-06-13 Beijing Bytedance Network Technology Co., Ltd Merge with MVD for affine
US11683500B2 (en) 2019-09-21 2023-06-20 Beijing Bytedance Network Technology Co., Ltd Precision transform coefficient scaling and quantization for image and video coding
US11706443B2 (en) 2018-11-17 2023-07-18 Beijing Bytedance Network Technology Co., Ltd Construction of affine candidates in video processing
US11778226B2 (en) 2018-10-22 2023-10-03 Beijing Bytedance Network Technology Co., Ltd Storage of motion information for affine mode
US11792421B2 (en) 2018-11-10 2023-10-17 Beijing Bytedance Network Technology Co., Ltd Rounding in pairwise average candidate calculations
US11805259B2 (en) 2018-09-23 2023-10-31 Beijing Bytedance Network Technology Co., Ltd Non-affine blocks predicted from affine motion
WO2023207649A1 (en) * 2022-04-29 2023-11-02 Mediatek Inc. Method and apparatus for decoder-side motion derivation in video coding system
US11812028B2 (en) 2019-06-25 2023-11-07 Beijing Bytedance Network Technology Co., Ltd. Restrictions on motion vector difference
US11863784B2 (en) 2019-02-22 2024-01-02 Beijing Bytedance Network Technology Co., Ltd Sub-table for history-based affine mode
US11870974B2 (en) 2018-09-23 2024-01-09 Beijing Bytedance Network Technology Co., Ltd Multiple-hypothesis affine mode
US12010321B2 (en) 2019-01-10 2024-06-11 Beijing Bytedance Network Technology Co., Ltd Affine based merge with MVD
US12022087B2 (en) 2018-06-19 2024-06-25 Beijing Bytedance Network Technology Co., Ltd Mode dependent motion vector difference precision set

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2497256C1 (ru) * 2012-06-07 2013-10-27 Федеральное государственное бюджетное образовательное учреждение высшего профессионального образования "Новосибирский государственный технический университет" Устройство дифференциальной защиты силового трансформатора
CA3090562C (en) * 2018-02-12 2023-03-14 Mediatek Inc. Method and apparatus of current picture referencing for video coding using adaptive motion vector resolution and sub-block prediction mode
CN111698515B (zh) * 2019-03-14 2023-02-14 华为技术有限公司 帧间预测的方法及相关装置
WO2020233661A1 (en) 2019-05-21 2020-11-26 Beijing Bytedance Network Technology Co., Ltd. Syntax signaling in sub-block merge mode
WO2020263646A1 (en) * 2019-06-24 2020-12-30 Interdigital Vc Holdings, Inc. Method and apparatus for signaling decoding data using high level syntax elements
WO2021001220A1 (en) * 2019-07-01 2021-01-07 Interdigital Vc Holdings France, Sas Bi-directional optical flow refinement of affine motion compensation
JP7482220B2 (ja) 2019-10-18 2024-05-13 北京字節跳動網絡技術有限公司 サブピクチャのパラメータセットシグナリングにおける構文制約
WO2021202104A1 (en) * 2020-03-29 2021-10-07 Alibaba Group Holding Limited Enhanced decoder side motion vector refinement
WO2021207055A1 (en) * 2020-04-05 2021-10-14 Bytedance Inc. High level control of filtering in video coding
WO2021248115A1 (en) * 2020-06-06 2021-12-09 Alibaba Group Holding Limited Angular weighted prediction for inter prediction
CN114071147B (zh) * 2020-07-29 2023-04-11 四川大学 一种基于双线性模型的vvc运动补偿方法
CN113242427B (zh) * 2021-04-14 2024-03-12 中南大学 一种基于vvc中自适应运动矢量精度的快速方法及装置
US11917165B2 (en) * 2021-08-16 2024-02-27 Tencent America LLC MMVD signaling improvement
US20230103405A1 (en) * 2021-10-04 2023-04-06 Tencent America LLC Method and apparatus for intra block copy prediction with sample padding
CN114157868B (zh) * 2022-02-07 2022-07-19 杭州未名信科科技有限公司 视频帧的编码模式筛选方法、装置及电子设备
US20230300364A1 (en) * 2022-03-15 2023-09-21 Tencent America LLC Temporal based subblock type motion vector predictor
US20230328225A1 (en) * 2022-04-11 2023-10-12 Tencent America LLC Bilateral matching with affine motion
US20240137539A1 (en) * 2022-10-18 2024-04-25 Tencent America LLC Method and apparatus for affine motion refinement
CN116866638B (zh) * 2023-07-31 2023-12-15 联通沃音乐文化有限公司 一种基于影像的智能视频处理方法和系统

Family Cites Families (123)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3651941B2 (ja) 1994-11-28 2005-05-25 キヤノン株式会社 画像再生装置
KR100962759B1 (ko) 2002-01-24 2010-06-09 가부시키가이샤 히타치세이사쿠쇼 동화상 신호의 부호화 방법 및 복호화 방법
WO2007003340A2 (en) 2005-07-01 2007-01-11 Nero Ag Video encoder and video decoder
US20070025442A1 (en) * 2005-07-28 2007-02-01 Sanyo Electric Co., Ltd. Coding method for coding moving images
JP2009089332A (ja) 2007-10-03 2009-04-23 Sony Corp 動き予測方法及び動き予測装置
US8542727B2 (en) 2007-12-31 2013-09-24 Intel Corporation Systems and apparatuses for performing CABAC parallel encoding and decoding
KR101377530B1 (ko) 2009-08-21 2014-03-27 에스케이텔레콤 주식회사 적응적 움직임 벡터 해상도를 이용한 영상 부호화/복호화 방법 및 장치
US20110176611A1 (en) * 2010-01-15 2011-07-21 Yu-Wen Huang Methods for decoder-side motion vector derivation
US9237355B2 (en) 2010-02-19 2016-01-12 Qualcomm Incorporated Adaptive motion resolution for video coding
US8837592B2 (en) 2010-04-14 2014-09-16 Mediatek Inc. Method for performing local motion vector derivation during video coding of a coding unit, and associated apparatus
JP2012060208A (ja) 2010-09-06 2012-03-22 Nippon Telegr & Teleph Corp <Ntt> 動画像符号化方法，動画像符号化装置，動画像復号方法，動画像復号装置およびそれらのプログラム
KR101952103B1 (ko) 2010-10-08 2019-02-27 지이 비디오 컴프레션, 엘엘씨 블록 분할 및 블록 병합을 지원하는 픽처 코딩
US10327008B2 (en) 2010-10-13 2019-06-18 Qualcomm Incorporated Adaptive motion vector resolution signaling for video coding
WO2012134246A2 (ko) 2011-04-01 2012-10-04 엘지전자 주식회사 엔트로피 디코딩 방법 및 이를 이용하는 디코딩 장치
US10123053B2 (en) 2011-05-23 2018-11-06 Texas Instruments Incorporated Acceleration of bypass binary symbol processing in video coding
CN106791834B (zh) 2011-06-14 2020-07-10 三星电子株式会社 对图像进行解码的方法和设备
KR101492104B1 (ko) 2011-08-29 2015-02-11 주식회사 아이벡스피티홀딩스 동영상 복호화 장치
CN102291581B (zh) 2011-09-09 2013-09-25 西安电子科技大学 支持帧场自适应运动估计的实现方法
US9736489B2 (en) 2011-09-17 2017-08-15 Qualcomm Incorporated Motion vector determination for video coding
US9088796B2 (en) 2011-11-07 2015-07-21 Sharp Kabushiki Kaisha Video decoder with enhanced CABAC decoding
US20130177084A1 (en) 2012-01-10 2013-07-11 Qualcomm Incorporated Motion vector scaling in video coding
US9325991B2 (en) 2012-04-11 2016-04-26 Qualcomm Incorporated Motion vector rounding
US9538172B2 (en) 2012-04-11 2017-01-03 Qualcomm Incorporated Grouping bypass coded syntax elements in video coding
JP5613846B2 (ja) 2012-05-09 2014-10-29 パナソニック インテレクチュアル プロパティ コーポレーション オブアメリカＰａｎａｓｏｎｉｃ Ｉｎｔｅｌｌｅｃｔｕａｌ Ｐｒｏｐｅｒｔｙ Ｃｏｒｐｏｒａｔｉｏｎ ｏｆ Ａｍｅｒｉｃａ 動きベクトル予測方法及び動きベクトル予測装置
CN106851275A (zh) 2012-05-29 2017-06-13 寰发股份有限公司 视频数据的自适应采样点偏移的处理装置及方法
US9635356B2 (en) 2012-08-07 2017-04-25 Qualcomm Incorporated Multi-hypothesis motion compensation for scalable video coding and 3D video coding
US9319684B2 (en) 2012-08-21 2016-04-19 Qualcomm Incorporated Alternative transform in scalable video coding
US9313500B2 (en) 2012-09-30 2016-04-12 Microsoft Technology Licensing, Llc Conditional signalling of reference picture list modification information
WO2014120367A1 (en) 2013-01-30 2014-08-07 Intel Corporation Content adaptive parametric transforms for coding for next generation video
WO2015069734A1 (en) 2013-11-05 2015-05-14 Arris Enterprises, Inc. Bit depth variable for high precision data in weighted prediction syntax and semantics
CN103561263B (zh) 2013-11-06 2016-08-24 北京牡丹电子集团有限责任公司数字电视技术中心 基于运动矢量约束和加权运动矢量的运动补偿预测方法
US20150189321A1 (en) 2014-01-02 2015-07-02 Mediatek Inc. Method of Binarization and Context Adaptive Binary Arithmetic Coding of Depth Coding Syntax
US9749642B2 (en) 2014-01-08 2017-08-29 Microsoft Technology Licensing, Llc Selection of motion vector precision
US10531116B2 (en) 2014-01-09 2020-01-07 Qualcomm Incorporated Adaptive motion vector resolution signaling for video coding
US10924746B2 (en) * 2014-01-29 2021-02-16 Mediatek Inc. Method and apparatus for adaptive motion vector precision
US10567789B2 (en) 2014-06-16 2020-02-18 Qualcomm Incorporated Simplified shifting merge candidate and merge list derivation in 3D-HEVC
US10327001B2 (en) 2014-06-19 2019-06-18 Qualcomm Incorporated Systems and methods for intra-block copy
CA2961681C (en) 2014-09-30 2022-08-09 Hfi Innovation Inc. Method of adaptive motion vetor resolution for video coding
US9918105B2 (en) 2014-10-07 2018-03-13 Qualcomm Incorporated Intra BC and inter unification
CN104363451B (zh) * 2014-10-27 2019-01-25 华为技术有限公司 图像预测方法及相关装置
CN111741310B (zh) 2014-10-31 2024-03-19 三星电子株式会社 用于对运动矢量进行编码/解码的方法和装置
SG11201703454XA (en) 2014-11-18 2017-06-29 Mediatek Inc Method of bi-prediction video coding based on motion vectors from uni-prediction and merge candidate
CA3074097C (en) * 2014-11-20 2021-10-26 Hfi Innovation Inc. Method of motion vector and block vector resolution control
CN107809642B (zh) 2015-02-16 2020-06-16 华为技术有限公司 用于视频图像编码和解码的方法、编码设备和解码设备
US10200711B2 (en) 2015-03-27 2019-02-05 Qualcomm Incorporated Motion vector derivation in video coding
US20160323600A1 (en) 2015-04-30 2016-11-03 Zhan Ma Methods and Apparatus for Use of Adaptive Prediction Resolution in Video Coding
CN109005407B (zh) * 2015-05-15 2023-09-01 华为技术有限公司 视频图像编码和解码的方法、编码设备和解码设备
US10368072B2 (en) 2015-05-29 2019-07-30 Qualcomm Incorporated Advanced arithmetic coder
GB2539212A (en) * 2015-06-08 2016-12-14 Canon Kk Handling of non-correct block vectors generated for intra block copy coding mode
TWI816224B (zh) 2015-06-08 2023-09-21 美商Ｖｉｄ衡器股份有限公司 視訊解碼或編碼方法及裝置
CN106331722B (zh) 2015-07-03 2019-04-26 华为技术有限公司 图像预测方法和相关设备
CN108965869B (zh) * 2015-08-29 2023-09-12 华为技术有限公司 图像预测的方法及设备
WO2017041271A1 (en) * 2015-09-10 2017-03-16 Mediatek Singapore Pte. Ltd. Efficient context modeling for coding a block of data
KR20180059443A (ko) 2015-09-24 2018-06-04 엘지전자 주식회사 영상 코딩 시스템에서 움직임 벡터 정제 기반 인터 예측 방법 및 장치
US10547847B2 (en) * 2015-09-24 2020-01-28 Lg Electronics Inc. AMVR-based image coding method and apparatus in image coding system
US10812822B2 (en) 2015-10-02 2020-10-20 Qualcomm Incorporated Intra block copy merge mode and padding of unavailable IBC reference region
US10560699B2 (en) 2015-11-13 2020-02-11 Lg Electronics Inc. Method and apparatus for adaptively predicting image using threshold value in image coding system
US20190028731A1 (en) * 2016-01-07 2019-01-24 Mediatek Inc. Method and apparatus for affine inter prediction for video coding system
WO2017134957A1 (ja) 2016-02-03 2017-08-10 シャープ株式会社 動画像復号装置、動画像符号化装置、および予測画像生成装置
EP3414900A4 (en) * 2016-03-15 2019-12-11 Mediatek Inc. METHOD AND DEVICE FOR VIDEO CODING WITH AFFINE MOTION COMPENSATION
WO2017156705A1 (en) * 2016-03-15 2017-09-21 Mediatek Inc. Affine prediction for video coding
KR102480088B1 (ko) 2016-03-17 2022-12-23 삼성디스플레이 주식회사 양자점 발광 소자
JP6895645B2 (ja) 2016-03-25 2021-06-30 パナソニックＩｐマネジメント株式会社 信号依存型適応量子化を用いて動画像を符号化及び復号するための方法及び装置
US10911773B2 (en) 2016-05-13 2021-02-02 Telefonaktiebolaget Lm Ericsson (Publ) Motion vector difference coding and decoding
US10560712B2 (en) 2016-05-16 2020-02-11 Qualcomm Incorporated Affine motion prediction for video coding
JPWO2017204185A1 (ja) 2016-05-27 2019-03-22 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカＰａｎａｓｏｎｉｃ Ｉｎｔｅｌｌｅｃｔｕａｌ Ｐｒｏｐｅｒｔｙ Ｃｏｒｐｏｒａｔｉｏｎ ｏｆ Ａｍｅｒｉｃａ 符号化装置、復号装置、符号化方法、および復号方法
EP3264768A1 (en) * 2016-06-30 2018-01-03 Thomson Licensing Method and apparatus for video coding with adaptive motion information refinement
KR20190045904A (ko) * 2016-09-12 2019-05-03 소니 주식회사 화상 처리 장치 및 화상 처리 방법
WO2018049594A1 (en) * 2016-09-14 2018-03-22 Mediatek Inc. Methods of encoder decision for quad-tree plus binary tree structure
US10462462B2 (en) 2016-09-29 2019-10-29 Qualcomm Incorporated Motion vector difference coding technique for video coding
US11356693B2 (en) 2016-09-29 2022-06-07 Qualcomm Incorporated Motion vector coding for video coding
US10778999B2 (en) 2016-09-30 2020-09-15 Qualcomm Incorporated Frame rate up-conversion coding mode with affine motion model
EP3301918A1 (en) * 2016-10-03 2018-04-04 Thomson Licensing Method and apparatus for encoding and decoding motion information
EP4075798A1 (en) * 2016-10-04 2022-10-19 HFI Innovation Inc. Method and apparatus for intra chroma coding in image and video coding
US10979732B2 (en) * 2016-10-04 2021-04-13 Qualcomm Incorporated Adaptive motion vector precision for video coding
US10448010B2 (en) 2016-10-05 2019-10-15 Qualcomm Incorporated Motion vector prediction for affine motion models in video coding
WO2018095313A1 (en) 2016-11-22 2018-05-31 Mediatek Inc. Method and apparatus for motion vector sign prediction in video coding
CN117528108A (zh) * 2016-11-28 2024-02-06 英迪股份有限公司 图像编码方法、图像解码方法及用于传送比特流的方法
US10694202B2 (en) 2016-12-01 2020-06-23 Qualcomm Incorporated Indication of bilateral filter usage in video coding
CN108235007B (zh) 2016-12-12 2023-06-27 上海天荷电子信息有限公司 各模式使用不同精度同种编码参数的数据压缩方法和装置
WO2018110203A1 (ja) 2016-12-16 2018-06-21 シャープ株式会社 動画像復号装置、および動画像符号化装置
CN116320480A (zh) 2016-12-22 2023-06-23 株式会社Kt 对视频进行解码或编码的方法和发送视频数据的方法
US10757412B2 (en) 2017-01-03 2020-08-25 Avago Technologies International Sales Pte. Limited Architecture flexible binary arithmetic coding system
US10523964B2 (en) 2017-03-13 2019-12-31 Qualcomm Incorporated Inter prediction refinement based on bi-directional optical flow (BIO)
US10595035B2 (en) 2017-03-22 2020-03-17 Qualcomm Incorporated Constraining motion vector information derived by decoder-side motion vector derivation
US10609414B2 (en) 2017-05-08 2020-03-31 Qualcomm Incorporated Context modeling for transform coefficient coding
US11272207B2 (en) 2017-06-12 2022-03-08 Futurewei Technologies, Inc. Selection and signaling of motion vector (MV) precisions
US10602180B2 (en) * 2017-06-13 2020-03-24 Qualcomm Incorporated Motion vector prediction
US20210127112A1 (en) 2017-07-04 2021-04-29 Samsung Electronics Co., Ltd. Image encoding method and apparatus, and image decoding method and apparatus
US11006117B2 (en) 2017-07-14 2021-05-11 Mediatek Inc. Method and apparatus for range derivation in context adaptive binary arithmetic coding
CN109391814B (zh) * 2017-08-11 2023-06-06 华为技术有限公司 视频图像编码和解码的方法、装置及设备
US10609384B2 (en) 2017-09-21 2020-03-31 Futurewei Technologies, Inc. Restriction on sub-block size derivation for affine inter prediction
CN111543055A (zh) 2017-10-03 2020-08-14 日本电气株式会社 视频编码设备、视频解码设备、视频编码方法、视频解码方法、程序和视频系统
US11172201B2 (en) 2017-12-18 2021-11-09 Panasonic Intellectual Property Corporation Of America Encoder, decoder, encoding method, and decoding method
US11172229B2 (en) 2018-01-12 2021-11-09 Qualcomm Incorporated Affine motion compensation with low bandwidth
US10757417B2 (en) 2018-01-20 2020-08-25 Qualcomm Incorporated Affine motion compensation in video coding
US11012715B2 (en) 2018-02-08 2021-05-18 Qualcomm Incorporated Intra block copy for video coding
CN116962717A (zh) 2018-03-14 2023-10-27 Lx 半导体科技有限公司 图像编码/解码方法、存储介质和发送方法
US10873748B2 (en) * 2018-05-12 2020-12-22 Qualcomm Incorporated Storage of high precision motion vectors in video coding
US11509924B2 (en) 2018-06-01 2022-11-22 Panasonic Intellectual Property Corporation Of America Encoder, decoder, encoding method, and decoding method
JP7104186B2 (ja) 2018-06-05 2022-07-20 北京字節跳動網絡技術有限公司 Ｉｂｃとａｔｍｖｐとの間でのインタラクション
KR102493418B1 (ko) 2018-06-07 2023-01-31 주식회사 윌러스표준기술연구소 적응적 모션 벡터 레졸루션을 이용하는 비디오 신호 처리 방법 및 장치
US11303923B2 (en) 2018-06-15 2022-04-12 Intel Corporation Affine motion compensation for current picture referencing
CN110620928B (zh) 2018-06-19 2022-12-09 北京字节跳动网络技术有限公司 不同精度的多个候选
US20190387247A1 (en) 2018-06-19 2019-12-19 Qualcomm Incorporated Signaling sub-prediction unit motion vector predictor
US20190045193A1 (en) 2018-06-29 2019-02-07 Intel Corporation Region-based motion estimation and modeling for accurate region-based motion compensation for efficient video processing or coding
WO2020009446A1 (ko) 2018-07-02 2020-01-09 엘지전자 주식회사 어파인 예측을 이용하여 비디오 신호를 처리하기 위한 방법 및 장치
WO2020031062A1 (en) 2018-08-04 2020-02-13 Beijing Bytedance Network Technology Co., Ltd. Interaction between different dmvd models
EP3844955A1 (en) 2018-08-29 2021-07-07 Vid Scale, Inc. Adaptive motion vector precision for affine motion model based video coding
CN110891175B (zh) 2018-09-08 2023-04-07 北京字节跳动网络技术有限公司 视频编解码和解码中的仿射模式
PL3700216T3 (pl) 2018-09-10 2022-12-19 Lg Electronics Inc. Kodowanie obrazu oparte na predykcji ruchu afinicznego z wykorzystaniem listy kandydatów predyktora wektorów ruchu afinicznego (MVP)
EP3827586A1 (en) 2018-09-19 2021-06-02 Beijing Bytedance Network Technology Co. Ltd. Syntax reuse for affine mode with adaptive motion vector resolution
KR20240000644A (ko) 2018-09-22 2024-01-02 엘지전자 주식회사 인터 예측을 기반으로 비디오 신호를 처리하기 위한 방법 및 장치
KR20230161543A (ko) 2018-09-23 2023-11-27 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 적응적 움직임 벡터 해상도를 갖는 움직임 벡터 수정
CN111357291A (zh) 2018-10-23 2020-06-30 北京字节跳动网络技术有限公司 从相邻块推导运动信息
KR102607097B1 (ko) 2018-11-05 2023-11-29 베이징 바이트댄스 네트워크 테크놀로지 컴퍼니, 리미티드 리파인먼트를 이용한 인터 예측을 위한 보간
CN113366851A (zh) 2019-01-31 2021-09-07 北京字节跳动网络技术有限公司 对称运动矢量差编解码模式的快速算法
WO2020156516A1 (en) 2019-01-31 2020-08-06 Beijing Bytedance Network Technology Co., Ltd. Context for coding affine mode adaptive motion vector resolution
CN113383548A (zh) * 2019-02-03 2021-09-10 北京字节跳动网络技术有限公司 Mv精度和mv差编解码之间的相互作用
JP2022525597A (ja) * 2019-03-11 2022-05-18 インターデイジタル ヴィーシー ホールディングス インコーポレイテッド ビデオエンコードおよびデコードのためのエントロピー符号化
CN113711609B (zh) * 2019-04-19 2023-12-01 北京字节跳动网络技术有限公司 利用光流的预测细化过程中的增量运动矢量
EP3959873A4 (en) 2019-04-25 2022-08-10 OP Solutions, LLC EFFICIENT CODING OF GLOBAL MOTION VECTORS
BR112022021916A2 (pt) * 2020-05-01 2023-02-14 Beijing Bytedance Network Tech Co Ltd Método para processar vídeo, aparelho para processar dados de vídeo, e, meios de armazenamento e de gravação legíveis por computador não transitórios

Cited By (72)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11089317B2 (en) * 2017-08-03 2021-08-10 Lg Electronics Inc. Method and apparatus for processing video signal using affine prediction
US20210329282A1 (en) * 2017-08-03 2021-10-21 Lg Electronics Inc. Method and apparatus for processing video signal using affine prediction
US11736707B2 (en) * 2017-08-03 2023-08-22 Lg Electronics Inc. Method and apparatus for processing video signal using affine prediction
US11700398B2 (en) 2017-09-07 2023-07-11 Lg Electronics Inc. Method and apparatus for entropy-encoding and entropy-decoding video signal
US11082721B2 (en) * 2017-09-07 2021-08-03 Lg Electronics Inc. Method and apparatus for entropy-encoding and entropy-decoding video signal
US11831884B2 (en) 2018-06-05 2023-11-28 Beijing Bytedance Network Technology Co., Ltd Interaction between IBC and BIO
US11973962B2 (en) 2018-06-05 2024-04-30 Beijing Bytedance Network Technology Co., Ltd Interaction between IBC and affine
US11509915B2 (en) 2018-06-05 2022-11-22 Beijing Bytedance Network Technology Co., Ltd. Interaction between IBC and ATMVP
US11202081B2 (en) 2018-06-05 2021-12-14 Beijing Bytedance Network Technology Co., Ltd. Interaction between IBC and BIO
US11523123B2 (en) 2018-06-05 2022-12-06 Beijing Bytedance Network Technology Co., Ltd. Interaction between IBC and ATMVP
US12022087B2 (en) 2018-06-19 2024-06-25 Beijing Bytedance Network Technology Co., Ltd Mode dependent motion vector difference precision set
US11477458B2 (en) 2018-06-19 2022-10-18 Beijing Bytedance Network Technology Co., Ltd. Mode dependent motion vector difference precision set
US11968377B2 (en) 2018-06-21 2024-04-23 Beijing Bytedance Network Technology Co., Ltd Unified constrains for the merge affine mode and the non-merge affine mode
US11659192B2 (en) 2018-06-21 2023-05-23 Beijing Bytedance Network Technology Co., Ltd Sub-block MV inheritance between color components
US11197007B2 (en) 2018-06-21 2021-12-07 Beijing Bytedance Network Technology Co., Ltd. Sub-block MV inheritance between color components
US11895306B2 (en) 2018-06-21 2024-02-06 Beijing Bytedance Network Technology Co., Ltd Component-dependent sub-block dividing
US11197003B2 (en) 2018-06-21 2021-12-07 Beijing Bytedance Network Technology Co., Ltd. Unified constrains for the merge affine mode and the non-merge affine mode
US11477463B2 (en) 2018-06-21 2022-10-18 Beijing Bytedance Network Technology Co., Ltd. Component-dependent sub-block dividing
US11431965B2 (en) 2018-09-08 2022-08-30 Beijing Bytedance Network Technology Co., Ltd. Affine mode in video coding and decoding
US11729377B2 (en) 2018-09-08 2023-08-15 Beijing Bytedance Network Technology Co., Ltd Affine mode in video coding and decoding
US11265573B2 (en) 2018-09-19 2022-03-01 Beijing Bytedance Network Technology Co., Ltd. Syntax reuse for affine mode with adaptive motion vector resolution
US11653020B2 (en) 2018-09-19 2023-05-16 Beijing Bytedance Network Technology Co., Ltd Fast algorithms for adaptive motion vector resolution in affine mode
US11483567B2 (en) * 2018-09-22 2022-10-25 Lg Electronics Inc. Method and apparatus for processing video signals on basis of inter prediction
US11870974B2 (en) 2018-09-23 2024-01-09 Beijing Bytedance Network Technology Co., Ltd Multiple-hypothesis affine mode
US11575903B2 (en) 2018-09-23 2023-02-07 Beijing Bytedance Network Technology Co., Ltd. 8-parameter affine mode
US11778194B2 (en) 2018-09-23 2023-10-03 Beijing Bytedance Network Technology Co., Ltd MV planar mode with block level
US11909953B2 (en) 2018-09-23 2024-02-20 Beijing Bytedance Network Technology Co., Ltd Representation of affine model
US11546601B2 (en) 2018-09-23 2023-01-03 Beijing Bytedance Network Technology Co., Ltd. Utilization of non-sub block spatial-temporal motion vector prediction in inter mode
US11805259B2 (en) 2018-09-23 2023-10-31 Beijing Bytedance Network Technology Co., Ltd Non-affine blocks predicted from affine motion
US11616945B2 (en) 2018-09-24 2023-03-28 Beijing Bytedance Network Technology Co., Ltd. Simplified history based motion vector prediction
US11202065B2 (en) 2018-09-24 2021-12-14 Beijing Bytedance Network Technology Co., Ltd. Extended merge prediction
US11172196B2 (en) 2018-09-24 2021-11-09 Beijing Bytedance Network Technology Co., Ltd. Bi-prediction with weights in video coding and decoding
US11778226B2 (en) 2018-10-22 2023-10-03 Beijing Bytedance Network Technology Co., Ltd Storage of motion information for affine mode
US11792421B2 (en) 2018-11-10 2023-10-17 Beijing Bytedance Network Technology Co., Ltd Rounding in pairwise average candidate calculations
US11949850B2 (en) 2018-11-14 2024-04-02 Tencent America LLC Constrained intra prediction and unified most probable mode list generation
US11178396B2 (en) * 2018-11-14 2021-11-16 Tencent America LLC Constrained intra prediction and unified most probable mode list generation
US11677973B2 (en) 2018-11-15 2023-06-13 Beijing Bytedance Network Technology Co., Ltd Merge with MVD for affine
US11985340B2 (en) 2018-11-16 2024-05-14 Beijing Bytedance Network Technology Co., Ltd History-based affine parameters inheritance
US11856211B2 (en) 2018-11-16 2023-12-26 Beijing Bytedance Network Technology Co., Ltd Usage for history-based affine parameters
US11902550B2 (en) 2018-11-16 2024-02-13 Beijing Bytedance Network Technology Co., Ltd Pruning method for history-based affine parameters
US20210266584A1 (en) 2018-11-16 2021-08-26 Beijing Bytedance Network Technology Co., Ltd. Usage for history-based affine parameters
US11831901B2 (en) 2018-11-17 2023-11-28 Beijing Bytedance Network Technology Co., Ltd Generalized bi directional prediction mode in video processing
US11706443B2 (en) 2018-11-17 2023-07-18 Beijing Bytedance Network Technology Co., Ltd Construction of affine candidates in video processing
US11310508B2 (en) 2018-12-21 2022-04-19 Beijing Bytedance Network Technology Co., Ltd. Motion vector precision in merge with motion vector difference mode
US12010321B2 (en) 2019-01-10 2024-06-11 Beijing Bytedance Network Technology Co., Ltd Affine based merge with MVD
US11330289B2 (en) 2019-01-31 2022-05-10 Beijing Bytedance Network Technology Co., Ltd. Context for coding affine mode adaptive motion vector resolution
US11863784B2 (en) 2019-02-22 2024-01-02 Beijing Bytedance Network Technology Co., Ltd Sub-table for history-based affine mode
US11962807B2 (en) * 2019-03-11 2024-04-16 Interdigital Vc Holdings, Inc. Entropy coding for video encoding and decoding
US20220116662A1 (en) * 2019-03-11 2022-04-14 Interdigital Vc Holdings, Inc. Entropy coding for video encoding and decoding
US11178399B2 (en) * 2019-03-12 2021-11-16 Qualcomm Incorporated Probability initialization for video coding
US11516497B2 (en) 2019-04-02 2022-11-29 Beijing Bytedance Network Technology Co., Ltd. Bidirectional optical flow based video coding and decoding
US11997303B2 (en) 2019-04-02 2024-05-28 Beijing Bytedance Network Technology Co., Ltd Bidirectional optical flow based video coding and decoding
US11570462B2 (en) 2019-04-19 2023-01-31 Beijing Bytedance Network Technology Co., Ltd. Delta motion vector in prediction refinement with optical flow process
US11368711B2 (en) 2019-04-19 2022-06-21 Beijing Bytedance Network Technology Co., Ltd. Applicability of prediction refinement with optical flow process
US11356697B2 (en) 2019-04-19 2022-06-07 Beijing Bytedance Network Technology Co., Ltd. Gradient calculation in different motion vector refinements
US11924463B2 (en) 2019-04-19 2024-03-05 Beijing Bytedance Network Technology Co., Ltd Gradient calculation in different motion vector refinements
US11418794B2 (en) 2019-04-25 2022-08-16 Beijing Bytedance Network Technology Co., Ltd. Restrictions on motion vector difference
US11909982B2 (en) 2019-04-25 2024-02-20 Beijing Bytedance Network Technology Co., Ltd. Restrictions on motion vector difference
US11463703B2 (en) 2019-04-28 2022-10-04 Beijing Bytedance Network Technology Co., Ltd. Symmetric motion vector difference coding
US11792406B2 (en) 2019-04-28 2023-10-17 Beijing Bytedance Network Technology Co., Ltd Symmetric motion vector difference coding
US20220053206A1 (en) * 2019-05-15 2022-02-17 Wilus Institute Of Standards And Technology Inc. Video signal processing method and apparatus using adaptive motion vector resolution
US11812028B2 (en) 2019-06-25 2023-11-07 Beijing Bytedance Network Technology Co., Ltd. Restrictions on motion vector difference
US11985317B2 (en) 2019-09-09 2024-05-14 Beijing Bytedance Network Technology Co., Ltd. Coefficient scaling for high precision image and video coding
US11582451B2 (en) 2019-09-09 2023-02-14 Beijing Bytedance Network Technology Co., Ltd. Coefficient scaling for high precision image and video coding
US11683500B2 (en) 2019-09-21 2023-06-20 Beijing Bytedance Network Technology Co., Ltd Precision transform coefficient scaling and quantization for image and video coding
US20220385910A1 (en) * 2019-11-11 2022-12-01 Hfi Innovation Inc. Method and Apparatus of Signaling Adaptive Motion Vector Difference Resolution in Video Coding
US20230147701A1 (en) * 2020-04-02 2023-05-11 Sharp Kabushiki Kaisha Video decoding apparatus and video decoding method
US11936899B2 (en) * 2021-03-12 2024-03-19 Lemon Inc. Methods and systems for motion candidate derivation
US20220295089A1 (en) * 2021-03-12 2022-09-15 Lemon Inc. Motion candidate derivation
US11671616B2 (en) 2021-03-12 2023-06-06 Lemon Inc. Motion candidate derivation
WO2022214244A1 (en) * 2021-04-09 2022-10-13 Interdigital Vc Holdings France, Sas Intra block copy with template matching for video encoding and decoding
WO2023207649A1 (en) * 2022-04-29 2023-11-02 Mediatek Inc. Method and apparatus for decoder-side motion derivation in video coding system

Also Published As

Publication number Publication date
KR20240005178A (ko) 2024-01-11
TWI827681B (zh) 2024-01-01
JP2022500909A (ja) 2022-01-04
CN110933420B (zh) 2023-09-01
CN110933427A (zh) 2020-03-27
CN116546213A (zh) 2023-08-04
WO2020058890A1 (en) 2020-03-26
WO2020058886A1 (en) 2020-03-26
EP4325859A3 (en) 2024-05-15
TWI815967B (zh) 2023-09-21
JP2023052336A (ja) 2023-04-11
US11653020B2 (en) 2023-05-16
KR102635047B1 (ko) 2024-02-07
US20200213594A1 (en) 2020-07-02
CN110933427B (zh) 2023-05-12
TW202025781A (zh) 2020-07-01
US20210289225A1 (en) 2021-09-16
US20240015320A1 (en) 2024-01-11
EP4325859A2 (en) 2024-02-21
US20210211707A1 (en) 2021-07-08
CN110933421A (zh) 2020-03-27
TW202025737A (zh) 2020-07-01
KR20210059708A (ko) 2021-05-25
US11265573B2 (en) 2022-03-01
EP3827586A1 (en) 2021-06-02
CN110933420A (zh) 2020-03-27
WO2020058888A1 (en) 2020-03-26
CN110933421B (zh) 2023-06-30
JP7212150B2 (ja) 2023-01-24
TW202025736A (zh) 2020-07-01

Similar Documents

Publication Publication Date Title
US11653020B2 (en) Fast algorithms for adaptive motion vector resolution in affine mode
US11451819B2 (en) Clipping of updated MV or derived MV
US10841609B1 (en) Modification of motion vector with adaptive motion vector resolution
US20220150508A1 (en) Restrictions on decoder side motion vector derivation based on coding information
US11178422B2 (en) Sub-block based decoder side motion vector derivation
US11778170B2 (en) Temporal gradient calculations in bio
US11330289B2 (en) Context for coding affine mode adaptive motion vector resolution
US11729377B2 (en) Affine mode in video coding and decoding
US20210360279A1 (en) Fast algorithms for symmetric motion vector difference coding mode
WO2020156525A1 (en) Multiple syntax elements for adaptive motion vector resolution
WO2020192747A1 (en) Motion information precision alignment in affine advanced motion vector prediction
WO2020070730A2 (en) Size restriction based on affine motion information

Legal Events

Date Code Title Description
AS Assignment

Owner name: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD., CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LIU, HONGBIN;WANG, YUE;REEL/FRAME:052074/0065

Effective date: 20190905

Owner name: BYTEDANCE INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ZHANG, LI;ZHANG, KAI;REEL/FRAME:052074/0058

Effective date: 20190905

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: ADVISORY ACTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION