WO2020166556A1 - Systèmes et procédés de réalisation d'interprédiction lors de codage de vidéo - Google Patents

Systèmes et procédés de réalisation d'interprédiction lors de codage de vidéo Download PDF

Info

Publication number
WO2020166556A1
WO2020166556A1 PCT/JP2020/005120 JP2020005120W WO2020166556A1 WO 2020166556 A1 WO2020166556 A1 WO 2020166556A1 JP 2020005120 W JP2020005120 W JP 2020005120W WO 2020166556 A1 WO2020166556 A1 WO 2020166556A1
Authority
WO
WIPO (PCT)
Prior art keywords
video
coding
motion vectors
prediction
initial motion
Prior art date
Application number
PCT/JP2020/005120
Other languages
English (en)
Inventor
Weijia Zhu
Christopher Andrew Segall
Original Assignee
Sharp Kabushiki Kaisha
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 Sharp Kabushiki Kaisha filed Critical Sharp Kabushiki Kaisha
Publication of WO2020166556A1 publication Critical patent/WO2020166556A1/fr

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/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/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/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

Definitions

  • This disclosure relates to video coding and more particularly to techniques for performing inter prediction.
  • Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, laptop or desktop computers, tablet computers, digital recording devices, digital media players, video gaming devices, cellular telephones, including so-called smartphones, medical imaging devices, and the like.
  • Digital video may be coded according to a video coding standard.
  • Video coding standards define the format of a compliant bitstream encapsulating coded video data.
  • a compliant bitstream is data structure that may be received and decoded by a video decoding device to generate reconstructed video data.
  • Video coding standards may incorporate video compression techniques. Examples of video coding standards include ISO/IEC MPEG-4 Visual and ITU-T H.264 (also known as ISO/IEC MPEG-4 AVC) and High-Efficiency Video Coding (HEVC).
  • HEVC High Efficiency Video Coding
  • Extensions and improvements for ITU-T H.265 are currently being considered for the development of next generation video coding standards.
  • ITU-T Video Coding Experts Group (VCEG) and ISO/IEC (Moving Picture Experts Group (MPEG) are working to standardized video coding technology with a compression capability that significantly exceeds that of the current HEVC standard.
  • VCEG Video Coding Experts Group
  • MPEG Moving Picture Experts Group
  • JVET Joint Video Exploration Team
  • JEM 7 Joint Exploration Model 7
  • JEM 7 Algorithm Description of Joint Exploration Test Model 7
  • JEM 7 is implemented in JEM reference software.
  • JEM may collectively refer to algorithms included in JEM 7 and implementations of JEM reference software.
  • VVC Versatile Video Coding
  • Video compression techniques enable data requirements for storing and transmitting video data to be reduced. Video compression techniques may reduce data requirements by exploiting the inherent redundancies in a video sequence. Video compression techniques may sub-divide a video sequence into successively smaller portions (i.e., groups of pictures within a video sequence, a picture within a group of pictures, regions within a picture, sub-regions within regions, etc.). Intra prediction coding techniques (e.g., spatial prediction techniques within a picture) and inter prediction techniques (i.e., inter-picture techniques (temporal)) may be used to generate difference values between a unit of video data to be coded and a reference unit of video data. The difference values may be referred to as residual data. Residual data may be coded as quantized transform coefficients.
  • Intra prediction coding techniques e.g., spatial prediction techniques within a picture
  • inter prediction techniques i.e., inter-picture techniques (temporal)
  • Residual data may be coded as quantized transform coefficients.
  • Syntax elements may relate residual data and a reference coding unit (e.g., intra-prediction mode indices, and motion information). Residual data and syntax elements may be entropy coded. Entropy encoded residual data and syntax elements may be included in data structures forming a compliant bitstream.
  • a method of encoding video data comprising: determining initial motion vectors for a bi-direction prediction of a current video block; determining whether one or both of the initial motion vectors satisfy a condition; and performing a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • a method of decoding video data comprising: determining initial motion vectors for a bi-direction prediction of a current video block; determining whether one or both of the initial motion vectors satisfy a condition; and performing a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • FIG. 1 is a conceptual diagram illustrating an example of a group of pictures coded according to a quad tree multi tree partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 2A is a conceptual diagram illustrating an example of coding a block of video data in accordance with one or more techniques of this disclosure.
  • FIG. 2B is a conceptual diagram illustrating an example of coding a block of video data in accordance with one or more techniques of this disclosure.
  • FIG. 3 is a conceptual diagram illustrating an example of a video component sampling format that may be utilized in accordance with one or more techniques of this disclosure.
  • FIG. 4 is a block diagram illustrating an example of a system that may be configured to encode and decode video data according to one or more techniques of this disclosure.
  • FIG. 1 is a conceptual diagram illustrating an example of a group of pictures coded according to a quad tree multi tree partitioning in accordance with one or more techniques of this disclosure.
  • FIG. 2A is a conceptual diagram illustrating an example of coding a
  • FIG. 5 is a block diagram illustrating an example of a video encoder that may be configured to encode video data according to one or more techniques of this disclosure.
  • FIG. 6 is a block diagram illustrating an example of a video decoder that may be configured to decode video data according to one or more techniques of this disclosure.
  • this disclosure describes various techniques for coding video data.
  • this disclosure describes techniques for determining whether various inter prediction tools are enabled or disabled for coding video. Determining whether various inter prediction tools are enabled or disabled according to the techniques described herein may be particularly useful for efficiently coding video data. It should be noted that although techniques of this disclosure are described with respect to ITU-T H.264, ITU-T H.265, JEM, and JVET-M1001, the techniques of this disclosure are generally applicable to video coding.
  • the coding techniques described herein may be incorporated into video coding systems, (including video coding systems based on future video coding standards) including video block structures, intra prediction techniques, inter prediction techniques, transform techniques, filtering techniques, and/or entropy coding techniques other than those included in ITU-T H.265, JEM, and JVET-M1001.
  • video coding systems including video coding systems based on future video coding standards
  • intra prediction techniques including video coding systems based on future video coding standards
  • inter prediction techniques transform techniques, filtering techniques, and/or entropy coding techniques other than those included in ITU-T H.265, JEM, and JVET-M1001.
  • ITU-T H.264, ITU-T H.265, JEM, and/or JVET-M1001 is for descriptive purposes and should not be construed to limit the scope of the techniques described herein.
  • incorporation by reference of documents herein is for descriptive purposes and should not be construed to limit or create ambiguity with respect
  • a method of coding video data comprising determining initial motion vectors for a bi-direction prediction of a current video block, determining whether one or both of the initial motion vectors satisfy a condition, and performing a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • a device for video coding comprises one or more processors configured to determine initial motion vectors for a bi-direction prediction of a current video block, determine whether one or both of the initial motion vectors satisfy a condition, and perform a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • a non-transitory computer-readable storage medium comprises instructions stored thereon that, when executed, cause one or more processors of a device to determine initial motion vectors for a bi-direction prediction of a current video block, determine whether one or both of the initial motion vectors satisfy a condition, and perform a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • an apparatus comprises means for determining initial motion vectors for a bi-direction prediction of a current video block, means for determining whether one or both of the initial motion vectors satisfy a condition, and means for performing a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • Video content typically includes video sequences comprised of a series of frames (or pictures).
  • a series of frames may also be referred to as a group of pictures (GOP).
  • Each video frame or picture may divided into one or more regions. Regions may be defined according to a base unit (e.g., a video block) and sets of rules defining a region (e.g., a region must be an integer number of video blocks arranged in a rectangle).
  • the term video block may generally refer to an area of a picture or may more specifically refer to the largest array of sample values that may be predictively coded, sub-divisions thereof, and/or corresponding structures.
  • the term current video block may refer to an area of a picture being encoded or decoded.
  • a video block may be defined as an array of sample values that may be predictively coded. It should be noted that in some cases pixel values may be described as including sample values for respective components of video data, which may also be referred to as color components, (e.g., luma (Y) and chroma (Cb and Cr) components or red, green, and blue components). It should be noted that in some cases, the terms pixel value and sample value are used interchangeably. Further, in some cases, a pixel or sample may be referred to as a pel.
  • a video sampling format which may also be referred to as a chroma format, may define the number of chroma samples included in a video block with respect to the number of luma samples included in a video block.
  • FIG. 3 is a conceptual diagram illustrating an example of a 16x16 video block formatted according to a 4:2:0 sample format.
  • FIG. 3 illustrates the relative position of chroma samples with respect to luma samples within a video block.
  • a video block is typically defined according to the number of horizontal and vertical luma samples.
  • a 16x16 video block formatted according to the 4:2:0 sample format includes 16x16 samples of luma components and 8x8 samples for each chroma component.
  • the width of an array of samples for the luma component is twice that of the width of an array of samples for each chroma component, but the height of the array of samples for the luma component is equal to the height of an array of samples for each chroma component.
  • an array of samples for the luma component has the same width and height as an array of samples for each chroma component.
  • Video blocks may be ordered within a picture according to a scan pattern (e.g., a raster scan).
  • a video encoder may perform predictive encoding on video blocks and sub-divisions thereof.
  • Video blocks and sub-divisions thereof may be referred to as nodes.
  • ITU-T H.264 specifies a macroblock including 16x16 luma samples. That is, in ITU-T H.264, a picture is segmented into macroblocks.
  • ITU-T H.265 specifies an analogous Coding Tree Unit (CTU) structure (which may be referred to as a largest coding unit (LCU)). In ITU-T H.265, pictures are segmented into CTUs.
  • CTU Coding Tree Unit
  • a CTU size may be set as including 16x16, 32x32, or 64x64 luma samples.
  • a CTU is composed of respective Coding Tree Blocks (CTB) for each component of video data (e.g., luma (Y) and chroma (Cb and Cr).
  • CTB Coding Tree Blocks
  • Y luma
  • Cb and Cr chroma
  • video having one luma component and the two corresponding chroma components may be described as having two channels, i.e., a luma channel and a chroma channel.
  • a CTU may be partitioned according to a quadtree (QT) partitioning structure, which results in the CTBs of the CTU being partitioned into Coding Blocks (CB). That is, in ITU-T H.265, a CTU may be partitioned into quadtree leaf nodes. According to ITU-T H.265, one luma CB together with two corresponding chroma CBs and associated syntax elements are referred to as a coding unit (CU). In ITU-T H.265, a minimum allowed size of a CB may be signaled. In ITU-T H.265, the smallest minimum allowed size of a luma CB is 8x8 luma samples. In ITU-T H.265, the decision to code a picture area using intra prediction or inter prediction is made at the CU level.
  • QT quadtree
  • a CU is associated with a prediction unit (PU) structure having its root at the CU.
  • PU structures allow luma and chroma CBs to be split for purposes of generating corresponding reference samples. That is, in ITU-T H.265, luma and chroma CBs may be split into respective luma and chroma prediction blocks (PBs), where a PB includes a block of sample values for which the same prediction is applied.
  • PBs luma and chroma prediction blocks
  • a CB may be partitioned into 1, 2, or 4 PBs.
  • ITU-T H.265 supports PB sizes from 64x64 samples down to 4x4 samples.
  • ITU-T H.265 square PBs are supported for intra prediction, where a CB may form the PB or the CB may be split into four square PBs.
  • ITU-T H.265 in addition to the square PBs, rectangular PBs are supported for inter prediction, where a CB may by halved vertically or horizontally to form PBs.
  • ITU-T H.265 for inter prediction, four asymmetric PB partitions are supported, where the CB is partitioned into two PBs at one quarter of the height (at the top or the bottom) or width (at the left or the right) of the CB.
  • Intra prediction data e.g., intra prediction mode syntax elements
  • inter prediction data e.g., motion data syntax elements
  • each video frame or picture may divided into one or more regions.
  • each video frame or picture may be partitioned to include one or more slices and further partitioned to include one or more tiles, where each slice includes a sequence of CTUs (e.g., in raster scan order) and where a tile is a sequence of CTUs corresponding to a rectangular area of a picture.
  • a slice in ITU-T H.265, is a sequence of one or more slice segments starting with an independent slice segment and containing all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit.
  • a slice segment like a slice, is a sequence of CTUs.
  • slice and slice segment may be used interchangeably to indicate a sequence of CTUs arranged in a raster scan order.
  • a tile may consist of CTUs contained in more than one slice and a slice may consist of CTUs contained in more than one tile.
  • ITU-T H.265 provides that one or both of the following conditions shall be fulfilled: (1) All CTUs in a slice belong to the same tile; and (2) All CTUs in a tile belong to the same slice.
  • slices are required to consist of an integer number of complete tiles instead of only being required to consist of an integer number of complete CTUs.
  • FIG. 1 is a conceptual diagram illustrating an example of a group of pictures including tile groups.
  • Pic 3 is illustrated as including two tile groups (i.e., Tile Group 1 and Tile Group 2 ). It should be noted that in some cases, Tile Group 1 and Tile Group 2 may be classified as slices and/or tiles.
  • JEM specifies a CTU having a maximum size of 256x256 luma samples.
  • JEM specifies a quadtree plus binary tree (QTBT) block structure.
  • the QTBT structure enables quadtree leaf nodes to be further partitioned by a binary tree (BT) structure. That is, in JEM, the binary tree structure enables quadtree leaf nodes to be recursively divided vertically or horizontally.
  • BT binary tree
  • JVET-M1001 CTUs are partitioned according a quadtree plus multi-type tree (QTMT) structure.
  • QTMT quadtree plus multi-type tree
  • the multi-type tree may indicate so-called ternary (or triple tree (TT)) splits.
  • a ternary split divides a block vertically or horizontally into three blocks. In the case of a vertical TT split, a block is divided at one quarter of its width from the left edge and at one quarter its width from the right edge and in the case of a horizontal TT split a block is at one quarter of its height from the top edge and at one quarter of its height from the bottom edge.
  • FIG. 1 illustrates an example of a CTU being partitioned into quadtree leaf nodes and quadtree leaf nodes being further partitioned according to a BT split or a TT split. That is, in FIG. 1 dashed lines indicate additional binary and ternary splits in a quadtree.
  • an intra prediction mode may specify the location of reference samples within a picture.
  • defined possible intra prediction modes include a planar (i.e., surface fitting) prediction mode, a DC (i.e., flat overall averaging) prediction mode, and 33 angular prediction modes (predMode: 2-34).
  • defined possible intra-prediction modes include a planar prediction mode, a DC prediction mode, and 65 angular prediction modes. It should be noted that planar and DC prediction modes may be referred to as non-directional prediction modes and that angular prediction modes may be referred to as directional prediction modes. It should be noted that the techniques described herein may be generally applicable regardless of the number of defined possible prediction modes.
  • MV motion vector
  • a current video block may be predicted using reference sample values located in one or more previously coded picture(s) and a motion vector is used to indicate the location of the reference block relative to the current video block.
  • a motion vector may describe, for example, a horizontal displacement component of the motion vector (i.e., MV x ), a vertical displacement component of the motion vector (i.e., MV y ), and a resolution for the motion vector (e.g., one-quarter pixel precision, one-half pixel precision, one-pixel precision, two-pixel precision, four-pixel precision).
  • Previously decoded pictures which may include pictures output before or after a current picture, may be organized into one or more to reference pictures lists and identified using a reference picture index value. Further, in inter prediction coding, uni-prediction refers to generating a prediction using sample values from a single reference picture and bi-prediction refers to generating a prediction using respective sample values from two reference pictures.
  • a single reference picture and corresponding motion vector are used to generate a prediction for a current video block and in bi-prediction, a first reference picture and corresponding first motion vector and a second reference picture and corresponding second motion vector are used to generate a prediction for a current video block.
  • respective sample values are combined (e.g., added, rounded, and clipped, or averaged according to weights) to generate a prediction.
  • Pictures and regions thereof may be classified based on which types of prediction modes may be utilized for encoding video blocks thereof.
  • reference pictures are identified through reference indices. For example, for a P tile, there may be a single reference picture list, RefPicList0 and for a B tile, there may be a second independent reference picture list, RefPicList1, in addition to RefPicList0.
  • RefPicList0 or RefPicList1 may be used to generate a prediction.
  • reference picture list(s) are generated from previously decoded picture stored in a decoded picture buffer (DPB).
  • a coding standard may support various modes of motion vector prediction.
  • Motion vector prediction enables the value of a motion vector for a current video block to be derived based on another motion vector. For example, a set of candidate blocks having associated motion information may be derived from spatial neighboring blocks and temporal neighboring blocks to the current video block. Further, generated (or default) motion information may be used for motion vector prediction. Examples of motion vector prediction include advanced motion vector prediction (AMVP), temporal motion vector prediction (TMVP), so-called “merge” mode, and “skip” and “direct” motion inference. Further, other examples of motion vector prediction include advanced temporal motion vector prediction (ATMVP) and Spatial-temporal motion vector prediction (STMVP).
  • ATMVP advanced temporal motion vector prediction
  • STMVP Spatial-temporal motion vector prediction
  • both a video encoder and video decoder perform the same process to derive a set of candidates.
  • the same set of candidates is generated during encoding and decoding.
  • all motion information i.e., motion vector displacement values, reference picture indices, and reference picture lists
  • an index value included in the bitstream may indicate the selected candidate and thus, the motion information for the current video block.
  • motion vector information for a selected candidate may be used as a motion vector predictor (MVP) for the motion vector of the current video block. That is, at a video encoder, a candidate block is selected from the derived set of candidates and an index value indicating the selected candidate and a delta value (i.e., a motion vector delta (MVD)) indicating the difference between the motion vector predictor and the motion vector for the current PB may be included in the bitstream. Further, for a non-merge mode, syntax elements identifying a reference picture are included in the bitstream.
  • MVP motion vector predictor
  • intra prediction data or inter prediction data is used to produce reference sample values for a block of sample values.
  • the difference between sample values included in a current PB, or another type of picture area structure, and associated reference samples (e.g., those generated using a prediction) may be referred to as residual data.
  • Residual data may include respective arrays of difference values corresponding to each component of video data. Residual data may be in the pixel domain.
  • a transform such as, a discrete cosine transform (DCT), a discrete sine transform (DST), an integer transform, a wavelet transform, or a conceptually similar transform, may be applied to an array of difference values to generate transform coefficients.
  • a CU is associated with a transform unit (TU) structure having its root at the CU level. That is, an array of difference values may be partitioned for purposes of generating transform coefficients (e.g., four 8x8 transforms may be applied to a 16x16 array of residual values). For each component of video data, such sub-divisions of difference values may be referred to as Transform Blocks (TBs).
  • TBs Transform Blocks
  • a core transform and a subsequent secondary transforms may be applied (in the video encoder) to generate transform coefficients. For a video decoder, the order of transforms is reversed.
  • a quantization process may be performed on transform coefficients or residual sample values directly (e.g., in the case, of palette coding quantization).
  • Quantization approximates transform coefficients by amplitudes restricted to a set of specified values.
  • Quantization essentially scales transform coefficients in order to vary the amount of data required to represent a group of transform coefficients.
  • Quantization may include division of transform coefficients (or values resulting from the addition of an offset value to transform coefficients) by a quantization scaling factor and any associated rounding functions (e.g., rounding to the nearest integer).
  • Quantized transform coefficients may be referred to as coefficient level values.
  • Inverse quantization (or “dequantization”) may include multiplication of coefficient level values by the quantization scaling factor, and any reciprocal rounding or offset addition operations.
  • quantization process in some instances may refer to division by a scaling factor to generate level values and multiplication by a scaling factor to recover transform coefficients in some instances. That is, a quantization process may refer to quantization in some cases and inverse quantization in some cases.
  • quantization processes are described with respect to arithmetic operations associated with decimal notation, such descriptions are for illustrative purposes and should not be construed as limiting.
  • the techniques described herein may be implemented in a device using binary operations and the like.
  • multiplication and division operations described herein may be implemented using bit shifting operations and the like.
  • Quantized transform coefficients and syntax elements may be entropy coded according to an entropy coding technique.
  • An entropy coding process includes coding values of syntax elements using lossless data compression algorithms. Examples of entropy coding techniques include content adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), probability interval partitioning entropy coding (PIPE), and the like.
  • Entropy encoded quantized transform coefficients and corresponding entropy encoded syntax elements may form a compliant bitstream that can be used to reproduce video data at a video decoder.
  • An entropy coding process may include performing a binarization on syntax elements.
  • Binarization refers to the process of converting a value of a syntax element into a series of one or more bits. These bits may be referred to as “bins.”
  • Binarization may include one or a combination of the following coding techniques: fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding.
  • binarization may include representing the integer value of 5 for a syntax element as 00000101 using an 8-bit fixed length binarization technique or representing the integer value of 5 as 11110 using a unary coding binarization technique.
  • each of the terms fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding may refer to general implementations of these techniques and/or more specific implementations of these coding techniques.
  • a Golomb-Rice coding implementation may be specifically defined according to a video coding standard.
  • a context provides a most probable state (MPS) value for the bin (i.e., an MPS for a bin is one of 0 or 1) and a probability value of the bin being the MPS or the least probably state (LPS).
  • MPS most probable state
  • LPS least probably state
  • a context may indicate, that the MPS of a bin is 0 and the probability of the bin being 1 is 0.3.
  • a context may be determined based on values of previously coded bins including bins in the current syntax element and previously coded syntax elements. For example, values of syntax elements associated with neighboring video blocks may be used to determine a context for a current bin.
  • FIGS. 2A-2B are conceptual diagrams illustrating examples of coding a block of video data.
  • a current block of video data e.g., a CB corresponding to a video component
  • a current block of video data is encoded by generating a residual by subtracting a set of prediction values from the current block of video data, performing a transformation on the residual, and quantizing the transform coefficients to generate level values.
  • the level values are coded into a bitstream.
  • the current block of video data is decoded by performing inverse quantization on level values, performing an inverse transform, and adding a set of prediction values to the resulting residual. It should be noted that in the examples in FIGS.
  • the sample values of the reconstructed block differs from the sample values of the current video block that is encoded. In this manner, coding may said to be lossy. However, the difference in sample values may be considered acceptable or imperceptible to a viewer of the reconstructed video.
  • coefficient level values are generated using an array of scaling factors.
  • an array of scaling factors is generated by selecting a scaling matrix and multiplying each entry in the scaling matrix by a quantization scaling factor.
  • a scaling matrix is selected based in part on a prediction mode and a color component, where scaling matrices of the following sizes are defined: 4x4, 8x8, 16x16, and 32x32. It should be noted that in some examples, a scaling matrix may provide the same value for each entry (i.e., all coefficients are scaled according to a single value).
  • the value of a quantization scaling factor may be determined by a quantization parameter, QP.
  • the QP can take 52 values from 0 to 51 and a change of 1 for QP generally corresponds to a change in the value of the quantization scaling factor by approximately 12%.
  • a QP value for a set of transform coefficients may be derived using a predictive quantization parameter value (which may be referred to as a predictive QP value or a QP predictive value) and an optionally signaled quantization parameter delta value (which may be referred to as a QP delta value or a delta QP value).
  • a quantization parameter may be updated for each CU and a respective quantization parameter may be derived for each of the luma and chroma channels.
  • JVET-M1001 the QTMT is used to partition a CTU into CUs.
  • a prediction may be generated for a current CU by deriving motion information on a CU-by-CU basis.
  • a prediction may be generated for a current CU by deriving motion information for sub-blocks within a CU.
  • a 32x32 CU may be divided into 64 4x4 sub-blocks and motion information may be derived for each sub-block and the respective motion information for each sub-block may be used to generate a prediction for the CU.
  • sub-block inter prediction Using sub-blocks to generate a prediction for a CU may be referred to as sub-block inter prediction.
  • An example of sub-block inter prediction includes the so-called Bidirectional Optical Flow (BDOF or BIO) tool described in JVET-M1001.
  • BDOF refines the motion vectors on a 4x4 block basis using a gradient computation.
  • the BDOF process is only employed when particular conditions are satisfied. Some of the conditions are as follows: In JVET-M1001, BDOF can only be turned on or off at the sequence level, i.e., using a flag in the sequence parameter set (SPS).
  • SPS sequence parameter set
  • the implementation of the BDOF tool in JVET-M1001 may be less than ideal.
  • the BDOF process can result in a loss in coding efficiency when processing some types of video content (e.g., screen content including graphics). Furthermore, it is anticipated that more sequences and types of sequence categories may not benefit from the BDOF process.
  • FIG. 4 is a block diagram illustrating an example of a system that may be configured to code (i.e., encode and/or decode) video data according to one or more techniques of this disclosure.
  • System 100 represents an example of a system that may perform video coding using techniques described according to one or more examples of this disclosure.
  • system 100 includes source device 102, communications medium 110, and destination device 120.
  • source device 102 may include any device configured to encode video data and transmit encoded video data to communications medium 110.
  • Destination device 120 may include any device configured to receive encoded video data via communications medium 110 and to decode encoded video data.
  • Source device 102 and/or destination device 120 may include computing devices equipped for wired and/or wireless communications and may include set top boxes, digital video recorders, televisions, desktop, laptop, or tablet computers, gaming consoles, mobile devices, including, for example, “smart” phones, cellular telephones, personal gaming devices, and medical imagining devices.
  • Communications medium 110 may include any combination of wireless and wired communication media, and/or storage devices.
  • Communications medium 110 may include coaxial cables, fiber optic cables, twisted pair cables, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that may be useful to facilitate communications between various devices and sites.
  • Communications medium 110 may include one or more networks.
  • communications medium 110 may include a network configured to enable access to the World Wide Web, for example, the Internet.
  • a network may operate according to a combination of one or more telecommunication protocols. Telecommunications protocols may include proprietary aspects and/or may include standardized telecommunication protocols.
  • Examples of standardized telecommunications protocols include Digital Video Broadcasting (DVB) standards, Advanced Television Systems Committee (ATSC) standards, Integrated Services Digital Broadcasting (ISDB) standards, Data Over Cable Service Interface Specification (DOCSIS) standards, Global System Mobile Communications (GSM) standards, code division multiple access (CDMA) standards, 3rd Generation Partnership Project (3GPP) standards, European Telecommunications Standards Institute (ETSI) standards, Internet Protocol (IP) standards, Wireless Application Protocol (WAP) standards, and Institute of Electrical and Electronics Engineers (IEEE) standards.
  • DVD Digital Video Broadcasting
  • ATSC Advanced Television Systems Committee
  • ISDB Integrated Services Digital Broadcasting
  • DOCSIS Data Over Cable Service Interface Specification
  • GSM Global System Mobile Communications
  • CDMA code division multiple access
  • 3GPP 3rd Generation Partnership Project
  • ETSI European Telecommunications Standards Institute
  • IP Internet Protocol
  • WAP Wireless Application Protocol
  • IEEE Institute of Electrical and Electronics Engineers
  • Storage devices may include any type of device or storage medium capable of storing data.
  • a storage medium may include a tangible or non-transitory computer-readable media.
  • a computer readable medium may include optical discs, flash memory, magnetic memory, or any other suitable digital storage media.
  • a memory device or portions thereof may be described as non-volatile memory and in other examples portions of memory devices may be described as volatile memory.
  • Examples of volatile memories may include random access memories (RAM), dynamic random access memories (DRAM), and static random access memories (SRAM).
  • Examples of non-volatile memories may include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories.
  • Storage device(s) may include memory cards (e.g., a Secure Digital (SD) memory card), internal/external hard disk drives, and/or internal/external solid state drives. Data may be stored on a storage device according to a defined file format
  • source device 102 includes video source 104, video encoder 106, and interface 108.
  • Video source 104 may include any device configured to capture and/or store video data.
  • video source 104 may include a video camera and a storage device operably coupled thereto.
  • Video encoder 106 may include any device configured to receive video data and generate a compliant bitstream representing the video data.
  • a compliant bitstream may refer to a bitstream that a video decoder can receive and reproduce video data therefrom. Aspects of a compliant bitstream may be defined according to a video coding standard.
  • video encoder 106 may compress video data. Compression may be lossy (discernible or indiscernible) or lossless.
  • Interface 108 may include any device configured to receive a compliant video bitstream and transmit and/or store the compliant video bitstream to a communications medium.
  • Interface 108 may include a network interface card, such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can send and/or receive information.
  • interface 108 may include a computer system interface that may enable a compliant video bitstream to be stored on a storage device.
  • interface 108 may include a chipset supporting Peripheral Component Interconnect (PCI) and Peripheral Component Interconnect Express (PCIe) bus protocols, proprietary bus protocols, Universal Serial Bus (USB) protocols, I 2 C, or any other logical and physical structure that may be used to interconnect peer devices.
  • PCI Peripheral Component Interconnect
  • PCIe Peripheral Component Interconnect Express
  • USB Universal Serial Bus
  • destination device 120 includes interface 122, video decoder 124, and display 126.
  • Interface 122 may include any device configured to receive a compliant video bitstream from a communications medium.
  • Interface 108 may include a network interface card, such as an Ethernet card, and may include an optical transceiver, a radio frequency transceiver, or any other type of device that can receive and/or send information.
  • interface 122 may include a computer system interface enabling a compliant video bitstream to be retrieved from a storage device.
  • interface 122 may include a chipset supporting PCI and PCIe bus protocols, proprietary bus protocols, USB protocols, I 2 C, or any other logical and physical structure that may be used to interconnect peer devices.
  • Video decoder 124 may include any device configured to receive a compliant bitstream and/or acceptable variations thereof and reproduce video data therefrom.
  • Display 126 may include any device configured to display video data.
  • Display 126 may comprise one of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display.
  • Display 126 may include a High Definition display or an Ultra High Definition display. It should be noted that although in the example illustrated in FIG. 4, video decoder 124 is described as outputting data to display 126, video decoder 124 may be configured to output video data to various types of devices and/or sub-components thereof. For example, video decoder 124 may be configured to output video data to any communication medium, as described herein.
  • FIG. 5 is a block diagram illustrating an example of video encoder 200 that may implement the techniques for encoding video data described herein. It should be noted that although example video encoder 200 is illustrated as having distinct functional blocks, such an illustration is for descriptive purposes and does not limit video encoder 200 and/or sub-components thereof to a particular hardware or software architecture. Functions of video encoder 200 may be realized using any combination of hardware, firmware, and/or software implementations. In one example, video encoder 200 may be configured to encode video data according to the techniques described herein. Video encoder 200 may perform intra prediction coding and inter prediction coding of picture areas, and, as such, may be referred to as a hybrid video encoder. In the example illustrated in FIG. 5, video encoder 200 receives source video blocks.
  • source video blocks may include areas of picture that has been divided according to a coding structure.
  • source video data may include macroblocks, CTUs, CBs, sub-divisions thereof, and/or another equivalent coding unit.
  • video encoder 200 may be configured to perform additional sub-divisions of source video blocks. It should be noted that some techniques described herein may be generally applicable to video coding, regardless of how source video data is partitioned prior to and/or during encoding. In the example illustrated in FIG.
  • video encoder 200 includes summer 202, transform coefficient generator 204, coefficient quantization unit 206, inverse quantization/transform processing unit 208, summer 210, intra prediction processing unit 212, inter prediction processing unit 214, filter unit 216, and entropy encoding unit 218.
  • video encoder 200 receives source video blocks and outputs a bitstream.
  • Video encoder 200 may generate residual data by subtracting a predictive video block from a source video block.
  • Summer 202 represents a component configured to perform this subtraction operation.
  • the subtraction of video blocks occurs in the pixel domain.
  • Transform coefficient generator 204 applies a transform, such as a discrete cosine transform (DCT), a discrete sine transform (DST), or a conceptually similar transform, to the residual block or sub-divisions thereof (e.g., four 8x8 transforms may be applied to a 16x16 array of residual values) to produce a set of residual transform coefficients.
  • DCT discrete cosine transform
  • DST discrete sine transform
  • a conceptually similar transform to the residual block or sub-divisions thereof (e.g., four 8x8 transforms may be applied to a 16x16 array of residual values) to produce a set of residual transform coefficients.
  • Transform coefficient generator 204 may be configured to perform any and all combinations of the transforms included in the family of discrete trigonometric transforms. Transform coefficient generator 204 may output transform coefficients to coefficient quantization unit 206. Coefficient quantization unit 206 may be configured to perform quantization of the transform coefficients. As described above, the degree of quantization may be modified by adjusting a quantization parameter. Coefficient quantization unit 206 may be further configured to determine quantization parameters (QP) and output QP data (e.g., data used to determine a quantization group size and/or delta QP values) that may be used by a video decoder to reconstruct a quantization parameter to perform inverse quantization during video decoding.
  • QP quantization parameters
  • output QP data e.g., data used to determine a quantization group size and/or delta QP values
  • one or more additional or alternative parameters may be used to determine a level of quantization (e.g., scaling factors).
  • the techniques described herein may be generally applicable to determining a level of quantization for transform coefficients corresponding to a component of video data based on a level of quantization for transform coefficients corresponding another component of video data.
  • quantized transform coefficients are output to inverse quantization/transform processing unit 208.
  • Inverse quantization/transform processing unit 208 may be configured to apply an inverse quantization and an inverse transformation to generate reconstructed residual data.
  • reconstructed residual data may be added to a predictive video block.
  • Video encoder 200 may be configured to perform multiple coding passes (e.g., perform encoding while varying one or more of a prediction, transformation parameters, and quantization parameters). The rate-distortion of a bitstream or other system parameters may be optimized based on evaluation of reconstructed video blocks. Further, reconstructed video blocks may be stored and used as reference for predicting subsequent blocks.
  • a video block may be coded using an intra prediction mode.
  • Intra prediction processing unit 212 may be configured to select an intra prediction mode for a current video block.
  • Intra prediction processing unit 212 may be configured to evaluate a frame and/or an area thereof and determine an intra prediction mode to use to encode a current block.
  • intra prediction processing unit 212 outputs intra prediction data (e.g., syntax elements) to entropy encoding unit 218 and transform coefficient generator 204.
  • inter prediction processing unit 214 may be configured to perform inter prediction coding for a current video block.
  • Inter prediction processing unit 214 may be configured to receive source video blocks and calculate motion information for PUs of a video block.
  • a motion vector may indicate the displacement of a PU (or similar coding structure) of a video block within a current video frame relative to a predictive block within a reference frame.
  • Inter prediction coding may use one or more reference pictures.
  • inter prediction processing unit 214 may locate a predictive video block within a frame buffer (not shown in FIG. 5). It should be noted that inter prediction processing unit 214 may further be configured to apply one or more interpolation filters to a reconstructed residual block to calculate sub-integer pixel values for use in motion estimation.
  • motion prediction may be uni-predictive (use one motion vector) or bi-predictive (use two motion vectors).
  • Inter prediction processing unit 214 may be configured to select a predictive block by calculating a pixel difference determined by, for example, sum of absolute difference (SAD), sum of square difference (SSD), or other difference metrics.
  • Inter prediction processing unit 214 may output motion prediction data for a calculated motion vector to entropy encoding unit 218.
  • motion information may be determined and specified according to motion vector prediction techniques.
  • Inter prediction processing unit 214 may be configured to perform motion vector prediction techniques, including for example, those described above.
  • inter prediction processing unit 214 may be configured to perform motion vector prediction according to techniques described above.
  • inter prediction processing unit 214 may be configured to perform sub-block based motion vector prediction, including BDOF. As described above, the implementation of the BDOF tool in JVET-M1001 may be less than ideal.
  • video encoder 200 may be configured such that CTU and/or CU level flag(s) may be used to enable/disable the BDOF process.
  • whether or not such a flag is included in a bitstream may be dependent on if BDOF is allowed for a video sequence. That is, the presence of the flag in the bitstream may be dependent on conditions associated with a video sequence. It should be noted that making the presence of a flag dependent on whether the BDOF process is allowed for a video sequence may improve coding efficiency in some cases but making the presence of the flag independent of whether if BDOF is allowed may have the benefit of simplifying a parsing process.
  • video encoder 200 may be configured such that, the used of a BDOF process is additionally/alternatively conditioned on the value of the motion vector being defined. That is, for example, in one example, BDOF may be skipped, if the initial motion vector is an integer. That is, motion vectors for bi-prediction having integer values are not further refined according to BDOF. In one example, determining whether motion vectors for bi-prediction have integer values may be implemented, by determining if the following four conditions are satisfied, where the last 4 bits of a component of a motion vector belong to the fractional part of a motion vector.
  • BDOF may be skipped, if one or both of the initial motion vector(s) is equal to a particular value (e.g., fixed value, a predetermined value, a derived value). For example, BDOF may be skipped, if one motion vector is equal to (0,0).
  • video encoder 200 represents an example of a device configured to determine initial motion vectors for a bi-direction prediction of a current video block, determine whether one or both of the initial motion vectors satisfy a condition, and perform a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • inter prediction processing unit 214 may receive reconstructed video block via filter unit 216, which may be part of an in-loop filtering process.
  • Filter unit 216 may be configured to perform deblocking, Sample Adaptive Offset (SAO) filtering, and/or Adaptive Loop Filtering (ALF).
  • entropy encoding unit 218 receives quantized transform coefficients and predictive syntax data (i.e., intra prediction data, motion prediction data, QP data, etc.).
  • Entropy encoding unit 218 may be configured to perform entropy encoding according to one or more of the techniques described herein.
  • Entropy encoding unit 218 may be configured to output a compliant bitstream, i.e., a bitstream that a video decoder can receive and reproduce video data therefrom.
  • FIG. 6 is a block diagram illustrating an example of a video decoder that may be configured to decode video data according to one or more techniques of this disclosure.
  • video decoder 300 may be configured to reconstruct video data based on one or more of the techniques described above. That is, video decoder 300 may operate in a reciprocal manner to video encoder 200 described above.
  • Video decoder 300 may be configured to perform intra prediction decoding and inter prediction decoding and, as such, may be referred to as a hybrid decoder.
  • video decoder 300 includes an entropy decoding unit 302, inverse quantization unit 304, inverse transformation processing unit 306, intra prediction processing unit 308, inter prediction processing unit 310, summer 312, filter unit 314, and reference buffer 316.
  • Video decoder 300 may be configured to decode video data in a manner consistent with a video encoding system, which may implement one or more aspects of a video coding standard. It should be noted that although example video decoder 300 is illustrated as having distinct functional blocks, such an illustration is for descriptive purposes and does not limit video decoder 300 and/or sub-components thereof to a particular hardware or software architecture. Functions of video decoder 300 may be realized using any combination of hardware, firmware, and/or software implementations.
  • entropy decoding unit 302 receives an entropy encoded bitstream.
  • Entropy decoding unit 302 may be configured to decode quantized syntax elements and quantized coefficients from the bitstream according to a process reciprocal to an entropy encoding process.
  • Entropy decoding unit 302 may be configured to perform entropy decoding according any of the entropy coding techniques described above.
  • Entropy decoding unit 302 may parse an encoded bitstream in a manner consistent with a video coding standard.
  • Video decoder 300 may be configured to parse an encoded bitstream where the encoded bitstream is generated based on the techniques described above.
  • Inverse quantization unit 304 receives quantized transform coefficients (i.e., level values) and quantization parameter data from entropy decoding unit 302.
  • Quantization parameter data may include any and all combinations of delta QP values and/or quantization group size values and the like described above.
  • Video decoder 300 and/or inverse quantization unit 304 may be configured to determine QP values used for inverse quantization based on values signaled by a video encoder and/or through video properties and/or coding parameters. That is, inverse quantization unit 304 may operate in a reciprocal manner to coefficient quantization unit 206 described above.
  • Inverse quantization unit 304 may be configured to apply an inverse quantization.
  • Inverse transform processing unit 306 may be configured to perform an inverse transformation to generate reconstructed residual data.
  • inverse quantization unit 304 and inverse transform processing unit 306 may be similar to techniques performed by inverse quantization/transform processing unit 208 described above.
  • Inverse transform processing unit 306 may be configured to apply an inverse DCT, an inverse DST, an inverse integer transform, Non-Separable Secondary Transform (NSST), or a conceptually similar inverse transform processes to the transform coefficients in order to produce residual blocks in the pixel domain. Further, as described above, whether a particular transform (or type of particular transform) is performed may be dependent on an intra prediction mode. As illustrated in FIG. 6, reconstructed residual data may be provided to summer 312. Summer 312 may add reconstructed residual data to a predictive video block and generate reconstructed video data.
  • a predictive video block may be determined according to a predictive video technique (i.e., intra prediction and inter frame prediction).
  • Intra prediction processing unit 308 may be configured to receive intra prediction syntax elements and retrieve a predictive video block from reference buffer 316.
  • Reference buffer 316 may include a memory device configured to store one or more frames of video data.
  • Intra prediction syntax elements may identify an intra prediction mode, such as the intra prediction modes described above.
  • intra prediction processing unit 308 may reconstruct a video block using according to one or more of the intra prediction coding techniques described herein.
  • Inter prediction processing unit 310 may receive inter prediction syntax elements and generate motion vectors to identify a prediction block in one or more reference frames stored in reference buffer 316.
  • Inter prediction processing unit 310 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used for motion estimation with sub-pixel precision may be included in the syntax elements. Inter prediction processing unit 310 may use interpolation filters to calculate interpolated values for sub-integer pixels of a reference block. Further, video decoder 300 may conditionally perform BDOF according to the techniques described above.
  • video decoder 300 represents an example of a device configured to determine initial motion vectors for a bi-direction prediction of a current video block, determine whether one or both of the initial motion vectors satisfy a condition, and perform a refinement of the initial motion vectors according to a bidirectional optical flow process based on whether one or both of the initial motion vectors satisfy a condition.
  • Filter unit 314 may be configured to perform filtering on reconstructed video data.
  • filter unit 314 may be configured to perform deblocking and/or SAO filtering, as described above with respect to filter unit 216.
  • filter unit 314 may be configured to perform proprietary discretionary filter (e.g., visual enhancements).
  • proprietary discretionary filter e.g., visual enhancements
  • Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol.
  • Computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2)a communication medium such as a signal or carrier wave.
  • Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure.
  • a computer program product may include a computer-readable medium.
  • such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer.
  • any connection is properly termed a computer-readable medium.
  • a computer-readable medium For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium.
  • DSL digital subscriber line
  • Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
  • processors such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable logic arrays
  • processors may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein.
  • the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.
  • the techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set).
  • IC integrated circuit
  • a set of ICs e.g., a chip set.
  • Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.
  • each functional block or various features of the base station device and the terminal device used in each of the aforementioned embodiments may be implemented or executed by a circuitry, which is typically an integrated circuit or a plurality of integrated circuits.
  • the circuitry designed to execute the functions described in the present specification may comprise a general-purpose processor, a digital signal processor (DSP), an application specific or general application integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic, or a discrete hardware component, or a combination thereof.
  • the general-purpose processor may be a microprocessor, or alternatively, the processor may be a conventional processor, a controller, a microcontroller or a state machine.
  • the general-purpose processor or each circuit described above may be configured by a digital circuit or may be configured by an analogue circuit. Further, when a technology of making into an integrated circuit superseding integrated circuits at the present time appears due to advancement of a semiconductor technology, the integrated circuit by this technology is also able to be used.

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é d'encodage de données de vidéo. Le procédé consiste à : déterminer des vecteurs de mouvement initiaux pour une prédiction bidirectionnelle d'un bloc de vidéo actuel ; déterminer si un ou les deux vecteurs de mouvement initiaux respectent une condition ; et effectuer un affinement des vecteurs de mouvement initiaux selon un processus de flux optique bidirectionnel selon qu'un ou les deux vecteurs de mouvement initiaux respectent une condition.
PCT/JP2020/005120 2019-02-12 2020-02-10 Systèmes et procédés de réalisation d'interprédiction lors de codage de vidéo WO2020166556A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201962804582P 2019-02-12 2019-02-12
US62/804,582 2019-02-12

Publications (1)

Publication Number Publication Date
WO2020166556A1 true WO2020166556A1 (fr) 2020-08-20

Family

ID=72044847

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2020/005120 WO2020166556A1 (fr) 2019-02-12 2020-02-10 Systèmes et procédés de réalisation d'interprédiction lors de codage de vidéo

Country Status (1)

Country Link
WO (1) WO2020166556A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130315309A1 (en) * 2011-01-22 2013-11-28 Huawei Technologies Co., Ltd. Motion prediction or compensation method
US20180262773A1 (en) * 2017-03-13 2018-09-13 Qualcomm Incorporated Inter prediction refinement based on bi-directional optical flow (bio)

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130315309A1 (en) * 2011-01-22 2013-11-28 Huawei Technologies Co., Ltd. Motion prediction or compensation method
US20180262773A1 (en) * 2017-03-13 2018-09-13 Qualcomm Incorporated Inter prediction refinement based on bi-directional optical flow (bio)

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
B. BROSS, J. CHEN, S. LIU (EDITORS): "Versatile Video Coding (Draft 4)", 13. JVET MEETING; 20190109 - 20190118; MARRAKECH; (THE JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), 1 February 2019 (2019-02-01), pages 1 - 142, XP030202562 *

Similar Documents

Publication Publication Date Title
AU2017397390B2 (en) Systems and methods for scaling transform coefficient level values
WO2020262396A1 (fr) Systèmes et procédés permettant de réduire une erreur de reconstruction dans un codage vidéo sur la base d'une corrélation inter-composantes
WO2019194147A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs vidéo durant un codage vidéo
WO2020184637A1 (fr) Systèmes et procédés d'exécution d'intracodage en codage vidéo
WO2021049126A1 (fr) Systèmes et procédés permettant de réduire une erreur de reconstruction dans un codage vidéo sur la base d'une corrélation inter-composantes
US11706437B2 (en) Systems and methods for performing inter prediction in video coding
AU2019381454B2 (en) Systems and methods for deriving a motion vector prediction in video coding
WO2020141598A1 (fr) Systèmes et procédés de réalisation de codage de prédiction intra
US12010318B2 (en) Systems and methods for reference offset signaling in video coding
WO2018180841A1 (fr) Systèmes et procédés de filtrage de données vidéo reconstruites à l'aide de techniques de filtrage bilatéral
WO2020017513A1 (fr) Systèmes et procédés de génération de blocs de prédiction pour un codage de données vidéo
WO2021045171A1 (fr) Systèmes et procédés permettant d'effectuer un codage de prédiction inter dans un codage vidéo
WO2020262470A1 (fr) Systèmes et procédés d'exécution de codage de prédiction intra dans un codage vidéo
WO2021070427A1 (fr) Systèmes et procédés permettant de réduire une erreur de reconstruction dans un codage vidéo sur la base d'une corrélation d'inter-composantes
WO2020262176A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs vidéo durant un codage vidéo
WO2020149298A1 (fr) Systèmes et procédés de dérivation de paramètres de quantification pour des blocs vidéo durant un codage vidéo
WO2020166556A1 (fr) Systèmes et procédés de réalisation d'interprédiction lors de codage de vidéo
WO2020262524A1 (fr) Systèmes et procédés permettant d'appliquer des filtres de déblocage à des données vidéo reconstruites
US11818342B2 (en) Systems and methods for applying deblocking filters to reconstructed video data
WO2019181818A1 (fr) Systèmes et procédés de partitionnement adaptatif de blocs vidéo 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: 20756388

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20756388

Country of ref document: EP

Kind code of ref document: A1