WO2024088048A1 - Procédé et appareil de prédiction de signe pour une différence de vecteur de bloc dans une copie de bloc intra - Google Patents

Procédé et appareil de prédiction de signe pour une différence de vecteur de bloc dans une copie de bloc intra Download PDF

Info

Publication number
WO2024088048A1
WO2024088048A1 PCT/CN2023/123522 CN2023123522W WO2024088048A1 WO 2024088048 A1 WO2024088048 A1 WO 2024088048A1 CN 2023123522 W CN2023123522 W CN 2023123522W WO 2024088048 A1 WO2024088048 A1 WO 2024088048A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
absolute
bvd
component value
reference block
Prior art date
Application number
PCT/CN2023/123522
Other languages
English (en)
Inventor
Chen-Yen LAI
Ching-Yeh Chen
Tzu-Der Chuang
Original Assignee
Mediatek 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 Mediatek Inc. filed Critical Mediatek Inc.
Publication of WO2024088048A1 publication Critical patent/WO2024088048A1/fr

Links

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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • 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/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • 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/11—Selection of coding mode or of prediction mode among a plurality of spatial 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/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/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

Definitions

  • the present invention relates to video coding using the Intra Block Copy (IBC) coding tool.
  • IBC Intra Block Copy
  • the present invention discloses a scheme to constrain available region for block vector prediction/motion vector prediction to improve the coding performance.
  • VVC Versatile video coding
  • JVET Joint Video Experts Team
  • MPEG ISO/IEC Moving Picture Experts Group
  • ISO/IEC 23090-3 2021
  • Information technology -Coded representation of immersive media -Part 3 Versatile video coding, published Feb. 2021.
  • VVC is developed based on its predecessor HEVC (High Efficiency Video Coding) by adding more coding tools to improve coding efficiency and also to handle various types of video sources including 3-dimensional (3D) video signals.
  • HEVC High Efficiency Video Coding
  • Fig. 1A illustrates an exemplary adaptive Inter/Intra video coding system incorporating loop processing.
  • Intra Prediction the prediction data is derived based on previously coded video data in the current picture.
  • Motion Estimation (ME) is performed at the encoder side and Motion Compensation (MC) is performed based on the result of ME to provide prediction data derived from other picture (s) and motion data.
  • Switch 114 selects Intra Prediction 110 or Inter-Prediction 112 and the selected prediction data is supplied to Adder 116 to form prediction errors, also called residues.
  • the prediction error is then processed by Transform (T) 118 followed by Quantization (Q) 120.
  • T Transform
  • Q Quantization
  • the transformed and quantized residues are then coded by Entropy Encoder 122 to be included in a video bitstream corresponding to the compressed video data.
  • the bitstream associated with the transform coefficients is then packed with side information such as motion and coding modes associated with Intra prediction and Inter prediction, and other information such as parameters associated with loop filters applied to underlying image area.
  • the side information associated with Intra Prediction 110, Inter prediction 112 and in-loop filter 130, are provided to Entropy Encoder 122 as shown in Fig. 1A. When an Inter-prediction mode is used, a reference picture or pictures have to be reconstructed at the encoder end as well.
  • the transformed and quantized residues are processed by Inverse Quantization (IQ) 124 and Inverse Transformation (IT) 126 to recover the residues.
  • the residues are then added back to prediction data 136 at Reconstruction (REC) 128 to reconstruct video data.
  • the reconstructed video data may be stored in Reference Picture Buffer 134 and used for prediction of other frames.
  • incoming video data undergoes a series of processing in the encoding system.
  • the reconstructed video data from REC 128 may be subject to various impairments due to a series of processing.
  • in-loop filter 130 is often applied to the reconstructed video data before the reconstructed video data are stored in the Reference Picture Buffer 134 in order to improve video quality.
  • deblocking filter (DF) may be used.
  • SAO Sample Adaptive Offset
  • ALF Adaptive Loop Filter
  • the loop filter information may need to be incorporated in the bitstream so that a decoder can properly recover the required information. Therefore, loop filter information is also provided to Entropy Encoder 122 for incorporation into the bitstream.
  • DF deblocking filter
  • SAO Sample Adaptive Offset
  • ALF Adaptive Loop Filter
  • Loop filter 130 is applied to the reconstructed video before the reconstructed samples are stored in the reference picture buffer 134.
  • the system in Fig. 1A is intended to illustrate an exemplary structure of a typical video encoder. It may correspond to the High Efficiency Video Coding (HEVC) system, VP8, VP9, H. 264 or VVC.
  • HEVC High Efficiency Video Coding
  • the decoder can use similar or portion of the same functional blocks as the encoder except for Transform 118 and Quantization 120 since the decoder only needs Inverse Quantization 124 and Inverse Transform 126.
  • the decoder uses an Entropy Decoder 140 to decode the video bitstream into quantized transform coefficients and needed coding information (e.g. ILPF information, Intra prediction information and Inter prediction information) .
  • the Intra prediction 150 at the decoder side does not need to perform the mode search. Instead, the decoder only needs to generate Intra prediction according to Intra prediction information received from the Entropy Decoder 140.
  • the decoder only needs to perform motion compensation (MC 152) according to Inter prediction information received from the Entropy Decoder 140 without the need for motion estimation.
  • an input picture is partitioned into non-overlapped square block regions referred as CTUs (Coding Tree Units) , similar to HEVC.
  • CTUs Coding Tree Units
  • Each CTU can be partitioned into one or multiple smaller size coding units (CUs) .
  • the resulting CU partitions can be in square or rectangular shapes.
  • VVC divides a CTU into prediction units (PUs) as a unit to apply prediction process, such as Inter prediction, Intra prediction, etc.
  • CPR Current picture referencing
  • IBC Intra block copy
  • the IBC coding mode requires reference samples from the current picture.
  • the IBC coding of a current block often requires reference samples immediately above or to the left of the current block.
  • a vector name Block Vector BV
  • BVP BV predictor
  • the IBC mode is also adopted by the VVC coding standard with some modifications and improvements.
  • the VVC IBC is also carried into the recent development of next generation video coding ECM6 (Muhammed Coban, et al., “Algorithm description of Enhanced Compression Model 6 (ECM 6) ” , Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 27th Meeting, by teleconference, 13–22 July 2022, Document JVET-AA2025) .
  • ECM6 Marleukin, JVET-6
  • JVET Joint Video Exploration Team
  • ECM6.0 signs of block vector difference (BVD) in IBC blocks are transmitted with equal probability (EP) and signs of motion vector difference (MVD) in INTER blocks are coded by MVD sign prediction.
  • Block vector difference sign prediction can be applied for IBC blocks when the block vector difference contains non-zero component.
  • Possible BVD sign combinations are sorted according to template matching cost, and index corresponding to the true BVD sign is derived and coded with a context model.
  • the BVD signs are derived as following major steps:
  • Step 2 Derive prediction costs of 4 candidate BVs based on template matching and sort them according to the costs.
  • Step 3 Use BVDSP index to select the true BVD sign.
  • Step 4 Add the true BVD to the BVP to get the final BV.
  • Bilinear filter is used in reference template generation.
  • the template matching cost is measured by the SAD (Sum of Absolute Differences) between the neighbouring samples in the template of the current CU and their corresponding reference samples in the template of a corresponding reference block, as illustrated in Fig. 2, where an example of BVDSP for a current IBC-coded PU 210 in the current picture 220 is shown and the BVP 230 of PU 210 points to a location 232 in the current picture.
  • the location of a current PU 210 is identified by the upper-left corner location 212 as shown in Fig. 2.
  • the x-and y-components of BVD are both non-zero in this example.
  • the locations of 4 possible candidate BVs corresponding to 4 possible sign combinations are shown as dots 240, 242, 244 and 246 respectively. Each of these 4 locations identifies the upper-left location of a corresponding reference block for IBC.
  • the templates for the current block and the 4 candidate reference blocks are shown by the L-shape areas on the top and left of the respective blocks.
  • the template matching cost for each candidate reference block is measured using reference samples in the corresponding templates.
  • the template cost for the reference block at location 240 is determined using the L-shaped template at location 240 and the L-shaped template at location 212 (i.e., the current block) .
  • BVD candidates are evaluated ( ⁇
  • a constrained available region for BVP in BVDSP or similar applications is disclosed to improve the coding performance.
  • a method and apparatus for video coding using constrained available region for BVP/MVP sign prediction are disclosed.
  • input data associated with a current block are received, wherein the input data comprise pixel data to be encoded at an encoder side or coded data associated with the current block to be decoded at a decoder side.
  • a block vector predictor (BVP) or a motion vector predictor (MVP) is determined.
  • Absolute x-component value and absolute y-component value for a block vector difference (BVD) or a motion vector difference (MVD) are determined, wherein at least one of the absolute x-component value and the absolute y-component value is non-zero.
  • a set of candidate BVs (block vectors) or candidate MVs (motion vectors) is determined based on the BVP or the MVP combined with the absolute x-component value and the absolute y-component value for the BVD or the MVD and with possible sign combinations for the BVD or the MVD.
  • a set of reference blocks corresponding to the set of candidate BVs or candidate MVs is determined, wherein a member reference block is set as an invalid reference block if any sample of the member reference block or any sample of a template of the member reference block is outside an available region.
  • a target reference block from the set of reference blocks is determined, wherein the set of reference blocks is reordered according to template costs of the set of reference blocks and any invalid reference block is excluded from the set of reference blocks or a high template cost is assigned to said any invalid reference block.
  • True sign for the BVD or the MVD is determined based on a reordered set of reference blocks.
  • the available region is pre-defined. In one embodiment, the available region is related to a picture boundary, subpicture boundary, slice boundary or tile boundary. In another embodiment, the available region is related to CTU boundary, VPDU boundary, CTU row boundary, or processing unit boundary. In another embodiment, the available region excludes the current block. In another embodiment, the available region excludes a part of not-yet encoded or decoded region. In another embodiment, the available region excludes a part of already encoded or decoded region.
  • the method is applied to a coding tool utilising a template matching scheme or a bilateral matching scheme.
  • the coding tool corresponds to regular merge candidate list, BM merge candidate list, or affine candidate list, IBC merge candidate list, MVP candidate list, IBC MVP candidate list.
  • the method comprises reordering the template costs for the set of reference blocks.
  • Fig. 1A illustrates an exemplary adaptive Inter/Intra video coding system incorporating loop processing.
  • Fig. 1B illustrates a corresponding decoder for the encoder in Fig. 1A.
  • Fig. 2 illustrates an example of Block Vector Difference Sign Prediction (BVDSP) process.
  • BVDSP Block Vector Difference Sign Prediction
  • Fig. 3 illustrates a flowchart of an exemplary video coding system that constrains available region for Block Vector Difference Sign Prediction (BVDSP) according to an embodiment of the present invention.
  • BVDSP Block Vector Difference Sign Prediction
  • BVDSP Block Vector Difference Sign Prediction
  • an available region is pre-defined, and if a reference block (pointed by a particular sign value of BVD) or the generated template of a reference block has at least one sample outside the available region, this reference block (corresponding to this BVD’s sign pair) is treated as invalid.
  • the corresponding TM cost should be set to a predefined high cost value (e.g. maximum cost value) so that the candidate will have no chance to be selected due to the high cost value. Accordingly, the TM calculation of the invalid candidate will be skipped.
  • the proposed method not only can be applied to BVD sign prediction, but also be applied to any template-matching related BV or BV cost derivation.
  • the BV merge candidate list reordering with template-matching can set the BV candidate or BV+offset candidate as non-available or set the cost of the BV candidate or BV+offset candidate to a pre-defined high cost if the reference block or the template pointed by the BV candidate or BV+offset candidate covers at least one non-available sample.
  • the pre-defined available region can be related to a picture boundary, subpicture boundary, slice/tile boundary.
  • the pre-defined available region can also be related to CTU boundary (e.g. current CTU and left CTU) , VPDU (Virtual Pipeline Decoding Unit) boundary, CTU row boundary, or processing unit boundary.
  • the non-available region of IBC may contain the current block. In other words, the current block may be excluded from the available region.
  • the non-available region of IBC can also contain the regions that are not encoded/decoded yet. In other words, at least a part of not-yet encoded/decoded region of the current block may be excluded from the available region.
  • the non-available region of IBC can also contain the regions that have been already encoded/decoded (i.e., at least a part of not-yet encoded/decoded region of the current block being excluded from the available region) , but set as not available with some rule, such as the way HEVC-SCC does.
  • the above motioned method can be applied to any tool using template matching for candidate list reordering.
  • the above motioned method can be applied to any of the following tools using template matching for candidate list reordering, such as regular merge candidate list, BM (Bilateral Matching) merge candidate list, or affine candidate list, IBC merge candidate list, MVP candidate list, IBC MVP candidate list.
  • the proposed method can also be applied to the inter mode that uses template matching or bilateral matching.
  • the matching cost is set to a predefined value (e.g. max_value) .
  • the samples outside the picture boundary, outside the padding region of the picture boundary, or outside a determined search region will be treated as not available.
  • the MV is clipped or modified to make all the samples are available.
  • the final MV (MVP + MVD, or BVP + BVD) with a smaller value (or close to the collocated block) is set as higher priority.
  • the template matching method can be replaced by this kind of location-based reordering for BVD/MVD sign prediction.
  • the BV touches an unavailable sample the BV will be set to the lowest priority (e.g. set the cost as max_cost) .
  • choosing a candidate having the larger or smaller value as high priority can depend on the context/content of the neighbouring information, some rule or some algorithm.
  • any of the constrained region for BVP/MVP sign prediction as described above can be implemented in encoders and/or decoders.
  • any of the proposed methods can be implemented in intra and/or inter module (e.g. Intra Pred. 110/Inter Pred. 112 in Fig. 1A and/or Intra Pred. 150/MC 152 in Fig. 1B) of an encoder or a decoder.
  • any of the proposed methods can be implemented as a circuit coupled to the intra/inter coding module of an encoder and/or the decoder.
  • the methods may also be implemented using executable software or firmware codes stored on a media, such as hard disk or flash memory, for a CPU (Central Processing Unit) or programmable devices (e.g. DSP (Digital Signal Processor) or FPGA (Field Programmable Gate Array) ) .
  • a media such as hard disk or flash memory, for a CPU (Central Processing Unit) or programmable devices (e.g. DSP (Digital Signal Processor) or FPGA
  • Fig. 3 illustrates a flowchart of an exemplary video coding system that constrains available region for Block Vector Difference Sign Prediction (BVDSP) according to an embodiment of the present invention.
  • the steps shown in the flowchart may be implemented as program codes executable on one or more processors (e.g., one or more CPUs) at the encoder side.
  • the steps shown in the flowchart may also be implemented based hardware such as one or more electronic devices or processors arranged to perform the steps in the flowchart.
  • input data associated with a current block are received in step 310, wherein the input data comprise pixel data to be encoded at an encoder side or coded data associated with the current block to be decoded at a decoder side.
  • a block vector predictor (BVP) or a motion vector predictor (MVP) is determined in step 320.
  • Absolute x-component value and absolute y-component value for a block vector difference (BVD) or a motion vector difference (MVD) are determined in step 330, wherein at least one of the absolute x-component value and the absolute y-component value is non-zero.
  • a set of candidate BVs (block vectors) or candidate MVs (motion vectors) is determined in step 340 based on the BVP or the MVP combined with the absolute x-component value and the absolute y-component value for the BVD or the MVD and with possible sign combinations for the BVD or the MVD.
  • a set of reference blocks corresponding to the set of candidate BVs or candidate MVs is determined in step 350, wherein a member reference block is set as an invalid reference block if any sample of the member reference block or any sample of a template of the member reference block is outside an available region.
  • a target reference block from the set of reference blocks is determined in step 360, wherein the set of reference blocks is reordered according to template costs of the set of reference blocks, and any invalid reference block is excluded from the set of reference blocks or a high template cost is assigned to said any invalid reference block.
  • True sign for the BVD or the MVD is determined based on a reordered set of reference blocks in step 370.
  • Embodiment of the present invention as described above may be implemented in various hardware, software codes, or a combination of both.
  • an embodiment of the present invention can be one or more circuit circuits integrated into a video compression chip or program code integrated into video compression software to perform the processing described herein.
  • An embodiment of the present invention may also be program code to be executed on a Digital Signal Processor (DSP) to perform the processing described herein.
  • DSP Digital Signal Processor
  • the invention may also involve a number of functions to be performed by a computer processor, a digital signal processor, a microprocessor, or field programmable gate array (FPGA) .
  • These processors can be configured to perform particular tasks according to the invention, by executing machine-readable software code or firmware code that defines the particular methods embodied by the invention.
  • the software code or firmware code may be developed in different programming languages and different formats or styles.
  • the software code may also be compiled for different target platforms.
  • different code formats, styles and languages of software codes and other means of configuring code to perform the tasks in accordance with the invention will not depart from the spirit and scope of the invention.

Landscapes

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

Abstract

L'invention concerne un procédé et un appareil de prédiction de signe BVP/MVP. Selon ce procédé, un BVP/MVP est déterminé. Des valeurs absolues de composante x et de composante y pour un BVD/MVD sont déterminées. Un ensemble de BV/MV candidats est déterminé sur la base du BVP/MVP combiné avec les valeurs absolues de composantes x et de y pour les BVD/MVD et les combinaisons de signes possibles. Un ensemble de blocs de référence correspondant à l'ensemble de BV candidats ou de MV candidats est déterminé, un bloc de référence d'élément étant défini comme un bloc de référence invalide si un échantillon quelconque du bloc de référence d'élément ou tout échantillon d'un modèle du bloc de référence d'élément se trouve à l'extérieur d'une région disponible. Un bloc de référence cible parmi l'ensemble de blocs de référence, qui est réordonné selon des coûts de modèle, est déterminé. Un signe réel pour le BVD ou le MVD est déterminé sur la base d'un ensemble réordonné de blocs de référence.
PCT/CN2023/123522 2022-10-26 2023-10-09 Procédé et appareil de prédiction de signe pour une différence de vecteur de bloc dans une copie de bloc intra WO2024088048A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202263380966P 2022-10-26 2022-10-26
US63/380966 2022-10-26

Publications (1)

Publication Number Publication Date
WO2024088048A1 true WO2024088048A1 (fr) 2024-05-02

Family

ID=90829994

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/123522 WO2024088048A1 (fr) 2022-10-26 2023-10-09 Procédé et appareil de prédiction de signe pour une différence de vecteur de bloc dans une copie de bloc intra

Country Status (1)

Country Link
WO (1) WO2024088048A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018205914A1 (fr) * 2017-05-10 2018-11-15 Mediatek Inc. Procédé et appareil de réordonnancement d'ensemble candidat de prédiction de vecteur de mouvement destiné à un codage vidéo
CN112740672A (zh) * 2018-09-28 2021-04-30 高通股份有限公司 具有自适应方向信息集合的最终运动矢量表达
US11057640B2 (en) * 2017-11-30 2021-07-06 Lg Electronics Inc. Image decoding method and apparatus based on inter-prediction in image coding system
US20220030223A1 (en) * 2019-05-24 2022-01-27 Huawei Technologies Co., Ltd. Encoder, a decoder and corresponding methods using for ibc merge list

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018205914A1 (fr) * 2017-05-10 2018-11-15 Mediatek Inc. Procédé et appareil de réordonnancement d'ensemble candidat de prédiction de vecteur de mouvement destiné à un codage vidéo
US11057640B2 (en) * 2017-11-30 2021-07-06 Lg Electronics Inc. Image decoding method and apparatus based on inter-prediction in image coding system
CN112740672A (zh) * 2018-09-28 2021-04-30 高通股份有限公司 具有自适应方向信息集合的最终运动矢量表达
US20220030223A1 (en) * 2019-05-24 2022-01-27 Huawei Technologies Co., Ltd. Encoder, a decoder and corresponding methods using for ibc merge list

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
M. SALEHIFAR (LGE), S. PALURI (LGE), S. KIM (LGE): "CE8: Unified MVD and Block Vector Difference Coding (CE8-1.2)", 15. JVET MEETING; 20190703 - 20190712; GOTHENBURG; (THE JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), 19 June 2019 (2019-06-19), XP030205682 *

Similar Documents

Publication Publication Date Title
US11089323B2 (en) Method and apparatus of current picture referencing for video coding
WO2020094038A1 (fr) Procédé et appareil de codage ou de décodage de blocs vidéo par un codage de référencement d'image actuelle
US10979707B2 (en) Method and apparatus of adaptive inter prediction in video coding
US20200260102A1 (en) Method and apparatus of motion vector prediction or merge candidate derivation for video coding
US11310520B2 (en) Method and apparatus of motion-vector rounding unification for video coding system
US20220210439A1 (en) Method and Apparatus of Simplified Affine Subblock Process for Video Coding System
US20230232012A1 (en) Method and Apparatus Using Affine Non-Adjacent Candidates for Video Coding
WO2024088048A1 (fr) Procédé et appareil de prédiction de signe pour une différence de vecteur de bloc dans une copie de bloc intra
US20180249155A1 (en) Method and apparatus of prediction offset derived based on neighbouring area in video coding
WO2023221993A1 (fr) Procédé et appareil d'affinement de vecteur de mouvement côté décodeur et de flux optique bidirectionnel pour codage vidéo
WO2023134564A1 (fr) Procédé et appareil dérivant un candidat de fusion à partir de blocs codés affine pour un codage vidéo
WO2023208220A1 (fr) Procédé et appareil pour réordonner des candidats de fusion avec un mode mvd dans des systèmes de codage vidéo
WO2023143325A1 (fr) Procédé et appareil de codage vidéo utilisant un mode fusion avec mvd
WO2024022145A1 (fr) Procédé et appareil d'amvp avec mode de fusion pour codage vidéo
WO2023020390A1 (fr) Procédé et appareil de mise en correspondance de modèles à faible latence dans un système de codage vidéo
WO2023208189A1 (fr) Procédé et appareil pour l'amélioration d'un codage vidéo à l'aide d'une fusion avec un mode mvd avec mise en correspondance de modèles
WO2024027784A1 (fr) Procédé et appareil de prédiction de vecteurs de mouvement temporel basée sur un sous-bloc avec réorganisation et affinement dans un codage vidéo
WO2023208224A1 (fr) Procédé et appareil de réduction de complexité de codage vidéo à l'aide de fusion avec mode mvd
WO2024078331A1 (fr) Procédé et appareil de prédiction de vecteurs de mouvement basée sur un sous-bloc avec réorganisation et affinement dans un codage vidéo
WO2023246408A1 (fr) Procédés et appareil de codage vidéo utilisant une prédiction de vecteur de mouvement non adjacent
WO2023246412A1 (fr) Procédés et appareil de codage vidéo utilisant de multiples tables de prédiction de vecteur de mouvement basées sur l'historique
WO2023020590A1 (fr) Procédé et appareil de mise en correspondance de modèle compatible avec le matériel dans un système de codage vidéo
WO2023143119A1 (fr) Procédé et appareil d'attribution de mv de mode de partition géométrique dans un système de codage vidéo
WO2023222016A1 (fr) Procédé et appareil de réduction de complexité d'un codage vidéo à l'aide d'une fusion avec un mode mvd
WO2024149285A1 (fr) Procédé et appareil de prédiction intra d'appariement modèle-objet pour un codage vidéo

Legal Events

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

Ref document number: 23881627

Country of ref document: EP

Kind code of ref document: A1