WO2019199152A1 - Procédé et dispositif de traitement de signal vidéo par prédiction affine - Google Patents

Procédé et dispositif de traitement de signal vidéo par prédiction affine Download PDF

Info

Publication number
WO2019199152A1
WO2019199152A1 PCT/KR2019/004528 KR2019004528W WO2019199152A1 WO 2019199152 A1 WO2019199152 A1 WO 2019199152A1 KR 2019004528 W KR2019004528 W KR 2019004528W WO 2019199152 A1 WO2019199152 A1 WO 2019199152A1
Authority
WO
WIPO (PCT)
Prior art keywords
control point
motion vector
block
prediction
current block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/KR2019/004528
Other languages
English (en)
Korean (ko)
Inventor
남정학
박내리
이재호
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LG Electronics Inc
Original Assignee
LG Electronics 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 LG Electronics Inc filed Critical LG Electronics Inc
Publication of WO2019199152A1 publication Critical patent/WO2019199152A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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/53—Multi-resolution motion estimation; Hierarchical motion estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/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

  • the present invention relates to a method and apparatus for encoding / decoding a video signal, and more particularly, to a method and apparatus for adaptively performing affine prediction.
  • Compression coding refers to a series of signal processing techniques for transmitting digitized information through a communication line or for storing in a form suitable for a storage medium.
  • Media such as an image, an image, an audio, and the like may be a target of compression encoding.
  • a technique of performing compression encoding on an image is called video image compression.
  • Next-generation video content will be characterized by high spatial resolution, high frame rate and high dimensionality of scene representation. Processing such content would result in a tremendous increase in terms of memory storage, memory access rate, and processing power.
  • motion prediction is performed in units of prediction blocks during inter prediction.
  • a prediction block of various sizes is supported to find an optimal prediction block for the current block, only the parallel-based block-based prediction method is applied, thereby lowering the prediction accuracy.
  • An object of the present invention is to propose an affine motion prediction method that performs encoding / decoding using an affine motion model.
  • An aspect of the present invention provides a method of decoding a video signal based on an Affine prediction mode, comprising: searching for a block encoded in an affine prediction mode among blocks neighboring a current block; A first control point motion vector of the upper left control point of the current block and an upper right control point of the current block by using an affine motion model of the block encoded in the affine prediction mode Deriving a second control point motion vector; Determining a motion compensation region for affine prediction within a reference picture of the current block; Updating the first control point motion vector and the second control point motion vector based on the motion compensation region; And using the updated one control point motion vector and the updated second control point motion vector, deriving a motion vector of a sub-block unit within the current block.
  • the determining of the motion compensation region may include: deriving a third control point motion vector at the center position of the current block by using the first control point motion vector and the second control point motion vector; And determining the motion compensation region by using the third control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold value is a header of a sequence parameter set, a picture parameter set, a tile group header, or a network abstract layer unit. Signaled from the encoder via.
  • the updating of the first control point motion vector and the second control point motion vector may be performed such that a position specified by at least one of the first control point motion vector and the second control point motion vector is outside the motion compensation region.
  • the operation may be performed by updating at least one of the first control point motion vector and the second control point motion vector to be included in the motion compensation region.
  • the determining of the motion compensation region may further include determining the motion compensation region by using the first control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold value is a header of a sequence parameter set, a picture parameter set, a tile group header, or a network abstract layer unit. Signaled from the encoder via.
  • the motion compensation region is determined to be a block having a predefined size specified by the first control point motion vector, and updating the first control point motion vector and the second control point motion vector comprises:
  • the second control point motion vector may be updated to be included in the motion compensation region.
  • Another aspect of the present invention provides a method of decoding a video signal based on an affine prediction mode, wherein the affine searches for a block encoded in an affine prediction mode among blocks neighboring a current block.
  • a coding block search unit ; A first control point motion vector of the upper left control point of the current block and an upper right control point of the current block by using an affine motion model of the block encoded in the affine prediction mode
  • a control point motion vector derivation unit for deriving a second control point motion vector;
  • a motion compensation region determiner configured to determine a motion compensation region for affine prediction within a reference picture of the current block;
  • a control point motion vector updating unit which updates the first control point motion vector and the second control point motion vector based on the motion compensation region;
  • a sub-block motion vector derivation unit for deriving a motion vector of a sub-block unit in the current block by using the updated one control point motion vector and the updated second control point motion vector.
  • the motion compensation region determiner is configured to derive a third control point motion vector at a central position of the current block by using the first control point motion vector and the second control point motion vector, and the third control point motion vector and motion
  • the compensation region threshold may be used to determine the motion compensation region.
  • the motion compensation bandwidth threshold value is a header of a sequence parameter set, a picture parameter set, a tile group header, or a network abstract layer unit. Signaled from the encoder via.
  • control point motion vector updating unit when the position specified by at least one of the first control point motion vector and the second control point motion vector is out of the motion compensation region, the first control point motion vector and the first At least one of two control point motion vectors may be updated to be included in the motion compensation region.
  • the motion compensation region determiner may determine the motion compensation region by using the first control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold value is a header of a sequence parameter set, a picture parameter set, a tile group header, or a network abstract layer unit. Signaled from the encoder via.
  • the motion compensation region is set to a block having a predefined size specified by the first control point motion vector
  • the control point motion vector updating unit is configured to position the motion specified by the second control point motion vector.
  • the second control point motion vector may be updated to be included in the motion compensation region.
  • the prediction accuracy may be improved by reflecting image distortion by processing an inter prediction based image using an affine transform.
  • FIG. 1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.
  • FIG. 2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.
  • FIG. 3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.
  • FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.
  • FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.
  • FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.
  • FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.
  • FIG. 8 and 9 illustrate an inter prediction based video / image encoding method and an inter prediction unit in an encoding apparatus according to an embodiment of the present invention.
  • FIGS. 10 and 11 illustrate an inter prediction based video / image decoding method and an inter prediction unit in a decoding apparatus according to an embodiment of the present invention.
  • FIG. 12 is a diagram for describing a neighboring block used in a merge mode or a skip mode as an embodiment to which the present invention is applied.
  • FIG. 13 is a flowchart illustrating a merge candidate list construction method according to an embodiment to which the present invention is applied.
  • FIG. 14 is a flowchart illustrating a merge candidate list construction method according to an embodiment to which the present invention is applied.
  • FIG. 15 is a diagram for describing an affine motion model as an embodiment to which the present invention is applied.
  • 16 and 17 illustrate embodiments to which the present invention is applied and illustrate an affine motion prediction method using a control point motion vector.
  • FIG. 18 is a diagram for describing a motion vector field indicating a motion vector set of a coding block according to an embodiment to which the present invention is applied.
  • 19 is a flowchart illustrating a method of encoding an image based on an inter prediction mode according to an embodiment to which the present invention is applied.
  • 20 is a flowchart illustrating a method of decoding an image based on an inter prediction mode according to an embodiment to which the present invention is applied.
  • 21 and 22 are diagrams for describing a method of determining a control point motion vector prediction value candidate when an affine inter mode is applied as an embodiment to which the present invention is applied.
  • 23 and 24 are diagrams for explaining a motion estimation / compensation method when an affine merge mode is applied as an embodiment to which the present invention is applied.
  • FIG. 25 is a diagram illustrating a method of performing affine prediction using a defined motion compensation region according to an embodiment to which the present invention is applied.
  • FIG. 26 is a flowchart illustrating a motion compensation method through affine prediction according to an embodiment to which the present invention is applied.
  • FIG. 27 is a diagram for describing a method of deriving a control point motion vector of a center position of a current block according to an embodiment to which the present invention is applied.
  • FIG. 28 is a diagram for explaining a method of determining a motion compensation region defined using a control point motion vector at a central position according to an embodiment to which the present invention is applied.
  • FIG. 29 is a diagram for describing a method of performing affine prediction using a defined motion compensation region according to an embodiment to which the present invention is applied.
  • FIG. 30 is a view illustrating a method of limiting a motion compensation region based on a control point motion vector as an embodiment to which the present invention is applied.
  • 31 is a flowchart illustrating a method of generating an inter prediction block according to an embodiment to which the present invention is applied.
  • FIG. 32 is a diagram illustrating an inter prediction apparatus according to an embodiment to which the present invention is applied.
  • FIG. 34 is a diagram illustrating the structure of a content streaming system according to an embodiment to which the present invention is applied.
  • the 'processing unit' refers to a unit in which a process of encoding / decoding such as prediction, transformation, and / or quantization is performed.
  • the processing unit may be referred to as a 'processing block' or 'block'.
  • the processing unit may be interpreted to include a unit for the luma component and a unit for the chroma component.
  • the processing unit may correspond to a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), or a Transform Unit (TU).
  • CTU Coding Tree Unit
  • CU Coding Unit
  • PU Prediction Unit
  • TU Transform Unit
  • the processing unit may be interpreted as a unit for a luma component or a unit for a chroma component.
  • the processing unit may be a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a luma component. May correspond to. Or, it may correspond to a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a chroma component.
  • CTB coding tree block
  • CB coding block
  • PU prediction block
  • TB transform block
  • the present invention is not limited thereto, and the processing unit may be interpreted to include a unit for a luma component and a unit for a chroma component.
  • processing unit is not necessarily limited to square blocks, but may also be configured in a polygonal form having three or more vertices.
  • a pixel, a pixel, and the like are referred to collectively as samples.
  • using a sample may mean using a pixel value or a pixel value.
  • FIG. 1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.
  • the encoding apparatus 100 may include an image splitter 110, a subtractor 115, a transformer 120, a quantizer 130, an inverse quantizer 140, an inverse transformer 150,
  • the adder 155, the filter 160, the memory 170, the inter predictor 180, the intra predictor 185, and the entropy encoder 190 may be configured.
  • the inter predictor 180 and the intra predictor 185 may be collectively referred to as a predictor.
  • the predictor may include an inter predictor 180 and an intra predictor 185.
  • the transform unit 120, the quantization unit 130, the inverse quantization unit 140, and the inverse transform unit 150 may be included in the residual processing unit.
  • the residual processing unit may further include a subtracting unit 115.
  • the image divider 110, the subtractor 115, the transformer 120, the quantizer 130, the inverse quantizer 140, the inverse transformer 150, and the adder 155 may be described.
  • the filtering unit 160, the inter prediction unit 180, the intra prediction unit 185, and the entropy encoding unit 190 may be configured by one hardware component (eg, an encoder or a processor).
  • the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.
  • DPB decoded picture buffer
  • the image divider 110 may divide the input image (or picture or frame) input to the encoding apparatus 100 into one or more processing units.
  • the processing unit may be called a coding unit (CU).
  • the coding unit may be recursively divided according to a quad-tree binary-tree (QTBT) structure from a coding tree unit (CTU) or a largest coding unit (LCU).
  • QTBT quad-tree binary-tree
  • CTU coding tree unit
  • LCU largest coding unit
  • one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad tree structure and / or a binary tree structure.
  • the quad tree structure may be applied first and the binary tree structure may be applied later.
  • the binary tree structure may be applied first.
  • the coding procedure according to the present invention may be performed based on the final coding unit that is no longer split.
  • the maximum coding unit may be used as the final coding unit immediately based on coding efficiency according to the image characteristic, or if necessary, the coding unit is recursively divided into coding units of lower depths and optimized.
  • a coding unit of size may be used as the final coding unit.
  • the coding procedure may include a procedure of prediction, transform, and reconstruction, which will be described later.
  • the processing unit may further include a prediction unit (PU) or a transform unit (TU).
  • the prediction unit and the transform unit may be partitioned or partitioned from the aforementioned final coding unit, respectively.
  • the prediction unit may be a unit of sample prediction
  • the transformation unit may be a unit for deriving a transform coefficient and / or a unit for deriving a residual signal from the transform coefficient.
  • an M ⁇ N block may represent a set of samples or transform coefficients composed of M columns and N rows.
  • a sample may generally represent a pixel or a value of a pixel, and may only represent pixel / pixel values of the luma component, or only pixel / pixel values of the chroma component.
  • a sample may be used as a term corresponding to one picture (or image) for a pixel or a pel.
  • the encoding apparatus 100 subtracts the prediction signal (predicted block, prediction sample array) output from the inter prediction unit 180 or the intra prediction unit 185 from the input image signal (original block, original sample array).
  • a signal may be generated (residual signal, residual block, residual sample array), and the generated residual signal is transmitted to the converter 120.
  • a unit that subtracts a prediction signal (prediction block, prediction sample array) from an input image signal (original block, original sample array) in the encoder 100 may be called a subtraction unit 115.
  • the prediction unit may perform a prediction on a block to be processed (hereinafter, referred to as a current block) and generate a predicted block including prediction samples for the current block.
  • the prediction unit may determine whether intra prediction or inter prediction is applied on a current block or CU basis. As described later in the description of each prediction mode, the prediction unit may generate various information related to prediction, such as prediction mode information, and transmit the generated information to the entropy encoding unit 190. The information about the prediction may be encoded in the entropy encoding unit 190 and output in the form of a bitstream.
  • the intra predictor 185 may predict the current block by referring to the samples in the current picture.
  • the referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • Non-directional mode may include, for example, DC mode and planner mode (Planar mode).
  • the directional mode may include, for example, 33 directional prediction modes or 65 directional prediction modes according to the degree of detail of the prediction direction. However, as an example, more or less directional prediction modes may be used depending on the setting.
  • the intra predictor 185 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
  • the inter predictor 180 may derive the predicted block with respect to the current block based on the reference block (reference sample array) specified by the motion vector on the reference picture.
  • the motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of the motion information between the neighboring block and the current block.
  • the motion information may include a motion vector and a reference picture index.
  • the motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture.
  • the reference picture including the reference block and the reference picture including the temporal neighboring block may be the same or different.
  • the temporal neighboring block may be referred to as a collocated reference block, a collocated CU (colCU), and the like, and a reference picture including the temporal neighboring block is called a collocated picture (colPic). It may be.
  • the inter prediction unit 180 constructs a motion information candidate list based on neighboring blocks and provides information indicating which candidates are used to derive a motion vector and / or a reference picture index of the current block. Can be generated. Inter prediction may be performed based on various prediction modes.
  • the inter prediction unit 180 may use motion information of a neighboring block as motion information of a current block.
  • the residual signal may not be transmitted.
  • the motion vector of the neighboring block is used as a motion vector predictor and the motion vector difference is signaled by signaling a motion vector difference. Can be directed.
  • the prediction signal generated by the inter predictor 180 or the intra predictor 185 may be used to generate a reconstruction signal or to generate a residual signal.
  • the transformer 120 may apply transform techniques to the residual signal to generate transform coefficients.
  • the transformation technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a karhunen-loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT).
  • DCT discrete cosine transform
  • DST discrete sine transform
  • KLT karhunen-loeve transform
  • GBT graph-based transform
  • CNT conditionally non-linear transform
  • GBT means a conversion obtained from this graph when the relationship information between pixels is represented by a graph.
  • CNT refers to a transform that is generated based on and generates a prediction signal using all previously reconstructed pixels.
  • the conversion process may be applied to pixel blocks having the same size as the square, or may be applied to blocks of variable size rather than square.
  • the quantization unit 130 quantizes the transform coefficients and transmits them to the entropy encoding unit 190.
  • the entropy encoding unit 190 encodes the quantized signal (information about the quantized transform coefficients) and outputs the bitstream. have.
  • the information about the quantized transform coefficients may be referred to as residual information.
  • the quantization unit 130 may rearrange block quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and quantize the quantized transform coefficients based on the quantized transform coefficients in the one-dimensional vector form. Information about transform coefficients may be generated.
  • the entropy encoding unit 190 may perform various encoding methods such as, for example, exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), and the like.
  • the entropy encoding unit 190 may encode information necessary for video / image reconstruction other than quantized transform coefficients (for example, values of syntax elements) together or separately.
  • Encoded information eg, encoded video / image information
  • NALs network abstraction layer
  • the network may include a broadcasting network and / or a communication network
  • the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like.
  • the signal output from the entropy encoding unit 190 may include a transmitting unit (not shown) for transmitting and / or a storing unit (not shown) for storing as an internal / external element of the encoding apparatus 100, or the transmitting unit It may be a component of the entropy encoding unit 190.
  • the quantized transform coefficients output from the quantization unit 130 may be used to generate a prediction signal.
  • the quantized transform coefficients may be reconstructed in the residual signal by applying inverse quantization and inverse transform through inverse quantization unit 140 and inverse transform unit 150 in a loop.
  • the adder 155 adds the reconstructed residual signal to the predicted signal output from the inter predictor 180 or the intra predictor 185 so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) is added. Can be generated. If there is no residual for the block to be processed, such as when the skip mode is applied, the predicted block may be used as the reconstructed block.
  • the adder 155 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.
  • the filtering unit 160 may improve subjective / objective image quality by applying filtering to the reconstruction signal.
  • the filtering unit 160 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture is stored in the memory 170, specifically, the DPB of the memory 170.
  • the various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like.
  • the filtering unit 160 may generate various information about the filtering and transmit the generated information to the entropy encoding unit 190.
  • the filtering information may be encoded in the entropy encoding unit 190 and output in the form of a bitstream.
  • the modified reconstructed picture transmitted to the memory 170 may be used as the reference picture in the inter predictor 180.
  • the encoding apparatus may avoid prediction mismatch between the encoding apparatus 100 and the decoding apparatus, and may improve encoding efficiency.
  • FIG. 2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.
  • the decoding apparatus 200 includes an entropy decoding unit 210, an inverse quantizer 220, an inverse transform unit 230, an adder 235, a filter 240, a memory 250, and an inter
  • the prediction unit 260 and the intra prediction unit 265 may be configured.
  • the inter predictor 260 and the intra predictor 265 may be collectively called a predictor. That is, the predictor may include an inter predictor 180 and an intra predictor 185.
  • the inverse quantization unit 220 and the inverse transform unit 230 may be collectively called a residual processing unit. That is, the residual processing unit may include an inverse quantization unit 220 and an inverse transformation unit 230.
  • the entropy decoder 210, the inverse quantizer 220, the inverse transformer 230, the adder 235, the filter 240, the inter predictor 260, and the intra predictor 265 are described in the embodiment. Can be configured by one hardware component (eg, decoder or processor).
  • the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.
  • DPB decoded picture buffer
  • the decoding apparatus 200 may reconstruct an image corresponding to a process in which video / image information is processed in the encoding apparatus of FIG. 1.
  • the decoding apparatus 200 may perform decoding using a processing unit applied in the encoding apparatus.
  • the processing unit of decoding may be a coding unit, for example, which may be split along a quad tree structure and / or a binary tree structure from a coding tree unit or a maximum coding unit.
  • the reconstructed video signal decoded and output through the decoding apparatus 200 may be reproduced through the reproducing apparatus.
  • the decoding apparatus 200 may receive a signal output from the encoding apparatus of FIG. 1 in the form of a bitstream, and the received signal may be decoded through the entropy decoding unit 210.
  • the entropy decoding unit 210 may parse the bitstream to derive information (eg, video / image information) necessary for image reconstruction (or picture reconstruction).
  • the entropy decoding unit 210 decodes information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, quantized values of syntax elements required for image reconstruction, and transform coefficients for residuals. Can be output.
  • the CABAC entropy decoding method receives a bin corresponding to each syntax element in a bitstream, and decodes syntax element information and decoding information of neighboring and decoding target blocks or information of symbols / bins decoded in a previous step.
  • the context model may be determined using the context model, the probability of occurrence of a bin may be predicted according to the determined context model, and arithmetic decoding of the bin may be performed to generate a symbol corresponding to the value of each syntax element. have.
  • the CABAC entropy decoding method may update the context model by using the information of the decoded symbol / bin for the context model of the next symbol / bean after determining the context model.
  • the information related to the prediction among the information decoded by the entropy decoding unit 2110 is provided to the prediction unit (the inter prediction unit 260 and the intra prediction unit 265), and the entropy decoding performed by the entropy decoding unit 210 is performed. Dual values, that is, quantized transform coefficients and related parameter information, may be input to the inverse quantizer 220.
  • information on filtering among information decoded by the entropy decoding unit 210 may be provided to the filtering unit 240.
  • a receiver (not shown) that receives a signal output from the encoding apparatus may be further configured as an internal / external element of the decoding apparatus 200, or the receiver may be a component of the entropy decoding unit 210.
  • the inverse quantization unit 220 may dequantize the quantized transform coefficients and output the transform coefficients.
  • the inverse quantization unit 220 may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the reordering may be performed based on the coefficient scan order performed by the encoding apparatus.
  • the inverse quantization unit 220 may perform inverse quantization on quantized transform coefficients using a quantization parameter (for example, quantization step size information), and may obtain transform coefficients.
  • a quantization parameter for example, quantization step size information
  • the inverse transformer 230 inversely transforms the transform coefficients to obtain a residual signal (residual block, residual sample array).
  • the prediction unit may perform prediction on the current block and generate a predicted block including prediction samples for the current block.
  • the prediction unit may determine whether intra prediction or inter prediction is applied to the current block based on the information about the prediction output from the entropy decoding unit 210, and may determine a specific intra / inter prediction mode.
  • the intra predictor 265 may predict the current block by referring to samples in the current picture.
  • the referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • the intra predictor 265 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
  • the inter prediction unit 260 may derive the predicted block for the current block based on the reference block (reference sample array) specified by the motion vector on the reference picture.
  • the motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of the motion information between the neighboring block and the current block.
  • the motion information may include a motion vector and a reference picture index.
  • the motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture.
  • the inter prediction unit 260 may construct a motion information candidate list based on neighboring blocks and derive a motion vector and / or a reference picture index of the current block based on the received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information about the prediction may include information indicating a mode of inter prediction for the current block.
  • the adder 235 adds the obtained residual signal to the predictive signal (predicted block, predictive sample array) output from the inter predictor 260 or the intra predictor 265 to restore the reconstructed signal (reconstructed picture, reconstructed block). , Restore sample array). If there is no residual for the block to be processed, such as when the skip mode is applied, the predicted block may be used as the reconstructed block.
  • the adder 235 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.
  • the filtering unit 240 may improve subjective / objective image quality by applying filtering to the reconstruction signal.
  • the filtering unit 240 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture may be stored in the memory 250, specifically, the DPB of the memory 250. Can be sent to.
  • the various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like.
  • the (modified) reconstructed picture stored in the DPB of the memory 250 may be used as the reference picture in the inter predictor 260.
  • the memory 250 may store the motion information of the block from which the motion information in the current picture is derived (or decoded) and / or the motion information of the blocks in the picture that are already reconstructed.
  • the stored motion information may be transmitted to the inter predictor 260 to use the motion information of the spatial neighboring block or the motion information of the temporal neighboring block.
  • the memory 170 may store reconstructed samples of reconstructed blocks in the current picture, and transfer the reconstructed samples to the intra predictor 265.
  • the embodiments described by the filtering unit 160, the inter prediction unit 180, and the intra prediction unit 185 of the encoding apparatus 100 are respectively the filtering unit 240 and the inter prediction of the decoding apparatus 200. The same may also apply to the unit 260 and the intra predictor 265.
  • the video / image coding method according to this document may be performed based on various detailed techniques, and each detailed technique will be described as follows. Techniques described below include prediction, residual processing ((inverse) transformation, (inverse) quantization, etc.), syntax element coding, filtering, partitioning / division, etc. in the video / image encoding / decoding procedures described above and / or described below. It will be apparent to those skilled in the art that they may be involved in related procedures.
  • the block partitioning procedure according to this document may be performed by the image splitter 110 of the encoding apparatus described above, and the partitioning related information may be processed (encoded) by the entropy encoding unit 190 and transmitted to the decoding apparatus in the form of a bitstream. .
  • the entropy decoding unit 210 of the decoding apparatus derives a block partitioning structure of the current picture based on the partitioning related information obtained from the bitstream, and based on this, a series of procedures (eg, prediction and residual) for image decoding. Processing, block reconstruction, in-loop filtering, etc.).
  • the CTU may correspond to a coding tree block (CTB).
  • CTB coding tree block
  • the CTU may include a coding tree block of luma samples and two coding tree blocks of corresponding chroma samples.
  • the CTU may include an N ⁇ N block of luma samples and two corresponding blocks of chroma samples.
  • the maximum allowable size of the CTU for coding and prediction may be different from the maximum allowable size of the CTU for transform.
  • the maximum allowable size of the luma block in the CTU may be 128x128.
  • the CTU may be divided into CUs based on a quad-tree (QT) structure.
  • the quadtree structure may be referred to as a quaternary tree structure. This is to reflect various local characteristics.
  • the CTU may be divided based on a multitype tree structure partition including a binary tree (BT) and a ternary tree (TT) as well as a quad tree.
  • the QTBT structure may include a quadtree and binary tree based partition structure
  • the QTBTTT may include a quadtree, binary tree, and ternary tree based partition structure.
  • the QTBT structure may include a quadtree, binary tree and ternary tree based partitioning structure.
  • a coding tree structure a CU may have a square or rectangular shape.
  • the CTU may first be divided into quadtree structures. After that, the leaf nodes of the quadtree structure may be further divided by the multitype tree structure.
  • FIG. 3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.
  • the multitype tree structure may include four partition types as shown in FIG.
  • the four types of split include vertical binary splitting (SPLIT_BT_VER), horizontal binary splitting (SPLIT_BT_HOR), vertical ternary splitting (SPLIT_TT_VER), and horizontal ternary splitting (SPLIT_TT_HOR). ) May be included.
  • Leaf nodes of the multitype tree structure may be called CUs. These CUs can be used for prediction and transform procedures.
  • CU, PU, and TU may have the same block size in this document. However, when the maximum supported transform length is smaller than the width or height of the color component of the CU, the CU and the TU may have different block sizes.
  • FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.
  • the CTU is treated as the root of the quadtree, and is partitioned for the first time into a quadtree structure.
  • Each quadtree leaf node may then be further partitioned into a multitype tree structure.
  • a first flag (ex. Mtt_split_cu_flag) is signaled to indicate whether the node is additionally partitioned.
  • a second flag (ex. Mtt_split_cu_verticla_flag) may be signaled to indicate the splitting direction.
  • a third flag (ex. Mtt_split_cu_binary_flag) may be signaled to indicate whether the partition type is binary partition or ternary partition.
  • a multi-type tree splitting mode (MttSplitMode) of a CU may be derived as shown in Table 1 below.
  • FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.
  • the CU may correspond to a coding block (CB).
  • the CU may include a coding block of luma samples and two coding blocks of corresponding chroma samples.
  • the size of a CU may be as large as CTU, or may be cut by 4 ⁇ 4 in luma sample units. For example, in the 4: 2: 0 color format (or chroma format), the maximum chroma CB size may be 64x64 and the minimum chroma CB size may be 2x2.
  • the maximum allowable luma TB size may be 64x64 and the maximum allowable chroma TB size may be 32x32. If the width or height of the CB divided according to the tree structure is larger than the maximum transform width or height, the CB may be automatically (or implicitly) split until the TB size limit in the horizontal and vertical directions is satisfied.
  • the following parameters may be defined and identified as SPS syntax elements.
  • CTU size the root node size of a quaternary tree
  • MinQTSize the minimum allowed quaternary tree leaf node size
  • MaxBtSize the maximum allowed binary tree root node size
  • MaxTtSize the maximum allowed ternary tree root node size
  • MaxMttDepth the maximum allowed hierarchy depth of multi-type tree splitting from a quadtree leaf
  • MinBtSize the minimum allowed binary tree leaf node size
  • MinTtSize the minimum allowed ternary tree leaf node size
  • the CTU size may be set to 64x64 blocks of 128x128 luma samples and two corresponding chroma samples (in 4: 2: 0 chroma format).
  • MinOTSize can be set to 16x16
  • MaxBtSize to 128x128, MaxTtSzie to 64x64
  • MinBtSize and MinTtSize (for both width and height) to 4x4, and MaxMttDepth to 4.
  • Quarttree partitioning may be applied to the CTU to generate quadtree leaf nodes.
  • the quadtree leaf node may be called a leaf QT node.
  • Quadtree leaf nodes may have a 128x128 size (i.e. the CTU size) from a 16x16 size (i.e. the MinOTSize). If the leaf QT node is 128x128, it may not be additionally divided into a binary tree / a ternary tree. This is because in this case, even if split, it exceeds MaxBtsize and MaxTtszie (i.e. 64x64). In other cases, leaf QT nodes may be further partitioned into a multitype tree. Therefore, the leaf QT node is the root node for the multitype tree, and the leaf QT node may have a multitype tree depth (mttDepth) 0 value.
  • mttDepth multitype tree depth
  • FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.
  • TT partitioning may be limited in certain cases. For example, when the width or height of the luma coding block is greater than a predetermined specific value (eg, 32 and 64), TT partitioning may be limited as shown in FIG. 6.
  • a predetermined specific value e.g, 32 and 64
  • the coding tree scheme may support that the luma and chroma blocks have separate block tree structures.
  • luma and chroma CTBs in one CTU may be limited to have the same coding tree structure.
  • luma and chroma blocks may have a separate block tree structure from each other. If an individual block tree mode is applied, the luma CTB may be split into CUs based on a particular coding tree structure, and the chroma CTB may be split into chroma CUs based on another coding tree structure. This may mean that a CU in an I slice may consist of a coding block of a luma component or coding blocks of two chroma components, and a CU of a P or B slice may be composed of blocks of three color components.
  • a quadtree coding tree structure involving a multitype tree has been described, but a structure in which a CU is divided is not limited thereto.
  • the BT structure and the TT structure may be interpreted as a concept included in a multiple partitioning tree (MPT) structure, and the CU may be interpreted to be divided through the QT structure and the MPT structure.
  • MPT multiple partitioning tree
  • a syntax element eg, MPT_split_type
  • MPT_split_mode a syntax element that contains information about which direction is divided into and horizontally.
  • the CU may be partitioned in a different way than the QT structure, BT structure or TT structure. That is, according to the QT structure, the CU of the lower depth is divided into 1/4 size of the CU of the upper depth, or the CU of the lower depth is divided into 1/2 size of the CU of the upper depth according to the BT structure, or according to the TT structure. Unlike the CU of the lower depth is divided into 1/4 or 1/2 size of the CU of the upper depth, the CU of the lower depth is sometimes 1/5, 1/3, 3/8, 3 of the CU of the upper depth. It can be divided into / 5, 2/3 or 5/8 size, the way in which the CU is divided is not limited to this.
  • the tree node block is placed so that all samples of all coded CUs are located within the picture boundaries. May be limited. In this case, for example, the following division rule may be applied.
  • the block is forced to be split with QT split mode.
  • the block is forced to be split with SPLIT_BT_HOR mode
  • the block is forced to be split with QT split mode.
  • the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_HOR mode.
  • the block is forced to be split with SPLIT_BT_HOR mode.
  • the block is forced to be split with QT split mode.
  • the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_VER mode.
  • the block is forced to be split with SPLIT_BT_VER mode.
  • the quadtree coded block structure with the multi-type tree described above can provide a very flexible block partitioning structure. Because of the partition types supported in a multitype tree, different partition patterns can sometimes lead to potentially identical coding block structure results. By limiting the occurrence of such redundant partition patterns, the data amount of partitioning information can be reduced. It demonstrates with reference to the following drawings.
  • FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.
  • two levels of consecutive binary splits in one direction have the same coding block structure as the binary split for the center partition after the ternary split.
  • the binary tree split in the given direction for the center partition of the ternary tree split may be limited. This restriction can be applied for CUs of all pictures. If this particular partitioning is restricted, the signaling of the corresponding syntax elements can be modified to reflect this limited case, thereby reducing the number of bits signaled for partitioning. For example, as shown in FIG.
  • the mtt_split_cu_binary_flag syntax element indicating whether the split is a binary split or a tenary split is not signaled, and its value is Can be inferred by the decoder to zero.
  • the decoded portion of the current picture or other pictures in which the current processing unit is included may be used to reconstruct the current processing unit in which decoding is performed.
  • Intra picture or I picture which uses only the current picture for reconstruction, i.e. performs only intra picture prediction, predicts a picture (slice) using at most one motion vector and reference index to predict each unit
  • a picture using a predictive picture or P picture (slice), up to two motion vectors, and a reference index (slice) may be referred to as a bi-predictive picture or a B picture (slice).
  • Intra prediction means a prediction method that derives the current processing block from data elements (eg, sample values, etc.) of the same decoded picture (or slice). That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in the current picture.
  • data elements eg, sample values, etc.
  • Inter prediction (or inter screen prediction)
  • Inter prediction means a prediction method of deriving a current processing block based on data elements (eg, sample values or motion vectors, etc.) of pictures other than the current picture. That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in other reconstructed pictures other than the current picture.
  • data elements eg, sample values or motion vectors, etc.
  • Inter prediction (or inter picture prediction) is a technique for removing redundancy existing between pictures, and is mostly performed through motion estimation and motion compensation.
  • the present invention describes the detailed description of the inter prediction method described above with reference to FIGS. 1 and 2, and the decoder may be represented by the inter prediction-based video / image decoding method of FIG. 10 described later and the inter prediction unit in the decoding apparatus of FIG. 11. .
  • the encoder may be represented by the inter prediction based video / video encoding method of FIG. 8 and the inter prediction unit in the encoding apparatus of FIG. 9.
  • the data encoded by FIGS. 8 and 9 may be stored in the form of a bitstream.
  • the prediction unit of the encoding apparatus / decoding apparatus may derive the prediction sample by performing inter prediction on a block basis.
  • Inter prediction may represent prediction derived in a manner dependent on data elements (e.g. sample values, motion information, etc.) of the picture (s) other than the current picture.
  • data elements e.g. sample values, motion information, etc.
  • a predicted block (prediction sample array) for the current block is derived based on a reference block (reference sample array) specified by a motion vector on the reference picture indicated by the reference picture index. Can be.
  • the motion information of the current block may be predicted in units of blocks, subblocks, or samples based on the correlation of the motion information between the neighboring block and the current block.
  • the motion information may include a motion vector and a reference picture index.
  • the motion information may further include inter prediction type (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture.
  • the reference picture including the reference block and the reference picture including the temporal neighboring block may be the same or different.
  • the temporal neighboring block may be referred to as a collocated reference block, a collocated CU (colCU), and the like, and a reference picture including the temporal neighboring block is called a collocated picture (colPic). It may be.
  • a motion information candidate list may be constructed based on neighboring blocks of the current block, and a flag indicating which candidate is selected (used) to derive a motion vector and / or a reference picture index of the current block. Or index information may be signaled.
  • Inter prediction may be performed based on various prediction modes.
  • the motion information of the current block may be the same as the motion information of the selected neighboring block.
  • the residual signal may not be transmitted.
  • a motion vector prediction (MVP) mode a motion vector of a selected neighboring block is used as a motion vector predictor, and a motion vector difference may be signaled.
  • the motion vector of the current block may be derived using the sum of the motion vector predictor and the motion vector difference.
  • MVP motion vector prediction
  • FIG. 8 and 9 illustrate an inter prediction based video / image encoding method and an inter prediction unit in an encoding apparatus according to an embodiment of the present invention.
  • S801 may be performed by the inter prediction unit 180 of the encoding apparatus, and S802 may be performed by the residual processing unit of the encoding apparatus.
  • S802 may be performed by the subtraction unit 115 of the encoding apparatus.
  • the prediction information may be derived by the inter prediction unit 180 and encoded by the entropy encoding unit 190.
  • the residual information may be derived by the residual processor and encoded by the entropy encoding unit 190.
  • the residual information is information about the residual samples.
  • the residual information may include information about quantized transform coefficients for the residual samples.
  • the residual samples may be derived as transform coefficients through the transform unit 120 of the encoding apparatus, and the transform coefficients may be derived as transform coefficients quantized through the quantization unit 130.
  • Information about the quantized transform coefficients may be encoded by the entropy encoding unit 190 through a residual coding procedure.
  • the encoding apparatus performs inter prediction on the current block (S801).
  • the encoding apparatus may derive inter prediction mode and motion information of the current block and generate prediction samples of the current block.
  • the inter prediction mode determination, the motion information derivation, and the prediction samples generation procedure may be performed simultaneously, or one procedure may be performed before the other.
  • the inter prediction unit 180 of the encoding apparatus may include a prediction mode determination unit 181, a motion information derivation unit 182, and a prediction sample derivation unit 183, and the prediction mode determination unit 181.
  • a prediction mode for the current block may be determined
  • motion information derivation unit 182 may derive motion information of the current block
  • prediction sample derivation unit 183 may derive motion samples of the current block.
  • the inter prediction unit 180 of the encoding apparatus searches for a block similar to the current block in a predetermined area (search area) of reference pictures through motion estimation, and a difference from the current block is determined.
  • Reference blocks that are minimum or below a certain criterion may be derived.
  • a reference picture index indicating a reference picture in which the reference block is located may be derived, and a motion vector may be derived based on a position difference between the reference block and the current block.
  • the encoding apparatus may determine a mode applied to the current block among various prediction modes.
  • the encoding apparatus may compare RD costs for the various prediction modes and determine an optimal prediction mode for the current block.
  • the encoding apparatus constructs a merge candidate list to be described later, and among the reference blocks indicated by merge candidates included in the merge candidate list.
  • a reference block having a difference from the current block that is smaller than or equal to a predetermined criterion may be derived.
  • a merge candidate associated with the derived reference block is selected, and merge index information indicating the selected merge candidate may be generated and signaled to the decoding apparatus.
  • the motion information of the current block may be derived using the motion information of the selected merge candidate.
  • the encoding apparatus constructs a (A) MVP candidate list to be described later, and among the mvp (motion vector predictor) candidates included in the (A) MVP candidate list.
  • the motion vector of the selected mvp candidate may be used as mvp of the current block.
  • a motion vector indicating a reference block derived by the above-described motion estimation may be used as the motion vector of the current block, and the difference with the motion vector of the current block is smallest among the mvp candidates.
  • An mvp candidate with a motion vector may be the selected mvp candidate.
  • a motion vector difference (MVD) which is a difference obtained by subtracting the mvp from the motion vector of the current block may be derived.
  • the information about the MVD may be signaled to the decoding device.
  • the value of the reference picture index may be configured with reference picture index information and separately signaled to the decoding apparatus.
  • the encoding apparatus may derive residual samples based on the prediction samples (S802).
  • the encoding apparatus may derive the residual samples by comparing the original samples of the current block with the prediction samples.
  • the encoding apparatus encodes image information including prediction information and residual information (S803).
  • the encoding apparatus may output the encoded image information in the form of a bitstream.
  • the prediction information may include prediction mode information (eg, skip flag, merge flag or mode index) and information on motion information as information related to the prediction procedure.
  • the information about the motion information may include candidate selection information (eg, merge index, mvp flag or mvp index) that is information for deriving a motion vector.
  • the information about the motion information may include the above-described information about the MVD and / or reference picture index information.
  • the information about the motion information may include information indicating whether L0 prediction, L1 prediction, or bi prediction is applied.
  • the residual information is information about the residual samples.
  • the residual information may include information about quantized transform coefficients for the residual samples.
  • the output bitstream may be stored in a (digital) storage medium and delivered to the decoding device, or may be delivered to the decoding device via a network.
  • the encoding apparatus may generate a reconstructed picture (including the reconstructed samples and the reconstructed block) based on the reference samples and the residual samples. This is because the encoding apparatus derives the same prediction result as that performed in the decoding apparatus, and thus the coding efficiency can be increased. Accordingly, the encoding apparatus may store a reconstructed picture (or reconstructed samples, a reconstructed block) in a memory and use it as a reference picture for inter prediction. As described above, an in-loop filtering procedure may be further applied to the reconstructed picture.
  • FIGS. 10 and 11 illustrate an inter prediction based video / image decoding method and an inter prediction unit in a decoding apparatus according to an embodiment of the present invention.
  • the decoding apparatus may perform an operation corresponding to the operation performed by the encoding apparatus.
  • the decoding apparatus may perform prediction on the current block and derive prediction samples based on the received prediction information.
  • S1001 to S1003 may be performed by the inter prediction unit 260 of the decoding apparatus, and the residual information of S1004 may be obtained from the bitstream by the entropy decoding unit 210 of the decoding apparatus.
  • the residual processor of the decoding apparatus may derive residual samples for the current block based on the residual information.
  • the inverse quantization unit 220 of the residual processing unit performs dequantization on the basis of the quantized transform coefficients derived based on the residual information to derive transform coefficients and inverse transform unit of the residual processing unit ( 230 may derive residual samples for the current block by performing an inverse transform on the transform coefficients.
  • S1005 may be performed by the adder 235 or the reconstruction unit of the decoding apparatus.
  • the decoding apparatus may determine a prediction mode for the current block based on the received prediction information (S1001).
  • the decoding apparatus may determine which inter prediction mode is applied to the current block based on the prediction mode information in the prediction information.
  • inter prediction mode candidates may include a skip mode, a merge mode, and / or (A) MVP mode, or may include various inter prediction modes described below.
  • the decoding apparatus derives motion information of the current block based on the determined inter prediction mode (S1002). For example, when a skip mode or a merge mode is applied to the current block, the decoding apparatus may construct a merge candidate list to be described later, and select one merge candidate among merge candidates included in the merge candidate list. The selection may be performed based on the above merge information.
  • the motion information of the current block may be derived using the motion information of the selected merge candidate.
  • the motion information of the selected merge candidate may be used as motion information of the current block.
  • the decoding apparatus constructs (A) MVP candidate list to be described later, and among (m) mvp (motion vector predictor) candidates included in the (A) MVP candidate list.
  • the motion vector of the selected mvp candidate may be used as mvp of the current block.
  • the selection may be performed based on the above-described selection information (mvp flag or mvp index).
  • the MVD of the current block may be derived based on the information on the MVD
  • the motion vector of the current block may be derived based on mvp and the MVD of the current block.
  • a reference picture index of the current block may be derived based on the reference picture index information.
  • a picture indicated by the reference picture index in the reference picture list for the current block may be derived as a reference picture referred for inter prediction of the current block.
  • motion information of the current block may be derived without constructing a candidate list, and in this case, motion information of the current block may be derived according to a procedure disclosed in a prediction mode to be described later.
  • the candidate list structure as described above may be omitted.
  • the decoding apparatus may generate prediction samples for the current block based on the motion information of the current block (S1003).
  • the reference picture may be derived based on the reference picture index of the current block, and the prediction samples of the current block may be derived using the samples of the reference block indicated by the motion vector of the current block on the reference picture.
  • a prediction sample filtering procedure for all or some of the prediction samples of the current block may be further performed.
  • the inter prediction unit 260 of the decoding apparatus may include a prediction mode determination unit 261, a motion information derivation unit 262, and a prediction sample derivation unit 263, and the prediction mode determination unit 261 may be used. Determining a prediction mode for the current block based on the prediction mode information received in the step, and based on the information on the motion information received from the motion information derivation unit 262, motion information (motion vector and / or A reference picture index, etc.), and the prediction sample derivation unit 263 may derive the prediction samples of the current block.
  • the decoding apparatus generates residual samples for the current block based on the received residual information (S1004).
  • the decoding apparatus may generate reconstructed samples for the current block based on the prediction samples and the residual samples, and may generate a reconstructed picture based on the prediction samples (S1005). After that, the in-loop filtering procedure may be further applied to the reconstructed picture as described above.
  • the inter prediction procedure may include determining an inter prediction mode, deriving motion information according to the determined prediction mode, and performing prediction based on the derived motion information (prediction sample generation).
  • inter prediction modes may be used for prediction of the current block in the picture.
  • various modes such as merge mode, skip mode, MVP mode, and affine mode
  • DMVR Decoder side motion vector refinement
  • AMVR adaptive motion vector resolution
  • the affine mode may be called an affine motion prediction mode.
  • MVP mode may be referred to as advanced motion vector prediction (AMVP) mode.
  • Prediction mode information indicating the inter prediction mode of the current block may be signaled from the encoding device to the decoding device.
  • the prediction mode information may be included in the bitstream and received by the decoding apparatus.
  • the prediction mode information may include index information indicating one of a plurality of candidate modes.
  • the inter prediction mode may be indicated through hierarchical signaling of flag information.
  • the prediction mode information may include one or more flags.
  • a skip flag is signaled to indicate whether a skip mode is applied, and if a skip mode is not applied, a merge flag is signaled to indicate whether a merge mode is applied, and if a merge mode is not applied, an MVP mode is applied. Or may further signal a flag for additional classification.
  • the affine mode may be signaled in an independent mode, or may be signaled in a mode dependent on a merge mode or an MVP mode.
  • the affine mode may be configured with one candidate of a merge candidate list or an MVP candidate list as described below.
  • Inter prediction may be performed using motion information of the current block.
  • the encoding apparatus may derive optimal motion information for the current block through a motion estimation procedure. For example, the encoding apparatus may search for a similar reference block having a high correlation using the original block in the original picture for the current block in fractional pixel units within a predetermined search range in the reference picture, thereby deriving motion information. Can be. Similarity of blocks can be derived based on the difference of phase based sample values. For example, the similarity of the blocks may be calculated based on the SAD between the current block (or template of the current block) and the reference block (or template of the reference block). In this case, motion information may be derived based on a reference block having the smallest SAD in the search area. The derived motion information may be signaled to the decoding apparatus according to various methods based on the inter prediction mode.
  • FIG. 12 is a diagram for describing a neighboring block used in a merge mode or a skip mode as an embodiment to which the present invention is applied.
  • the motion information of the current prediction block is not directly transmitted, and the motion information of the current prediction block is derived using the motion information of the neighboring prediction block. Accordingly, the motion information of the current prediction block can be indicated by transmitting flag information indicating that the merge mode is used and a merge index indicating which neighboring prediction blocks are used.
  • the encoder may search for merge candidate blocks used to derive motion information of the current prediction block to perform the merge mode. For example, up to five merge candidate blocks may be used, but the present invention is not limited thereto.
  • the maximum number of merge candidate blocks may be transmitted in a slice header (or tile group header), but the present invention is not limited thereto.
  • the encoder may generate a merge candidate list, and select the merge candidate block having the smallest cost among them as the final merge candidate block.
  • the present invention provides various embodiments of a merge candidate block constituting the merge candidate list.
  • the merge candidate list may use, for example, five merge candidate blocks. For example, four spatial merge candidates and one temporal merge candidate may be used. As a specific example, in the case of the spatial merge candidate, the blocks shown in FIG. 12 may be used as the spatial merge candidate.
  • FIG. 13 is a flowchart illustrating a merge candidate list construction method according to an embodiment to which the present invention is applied.
  • the coding apparatus inserts spatial merge candidates derived by searching for spatial neighboring blocks of the current block to the merge candidate list (S1301).
  • the spatial neighboring blocks may include a lower left corner peripheral block, a left peripheral block, a right upper corner peripheral block, an upper peripheral block, and an upper left corner peripheral block of the current block.
  • additional peripheral blocks such as a right peripheral block, a lower peripheral block, and a lower right peripheral block may be further used as the spatial peripheral blocks.
  • the coding apparatus may search for the spatial neighboring blocks based on priority, detect available blocks, and derive motion information of the detected blocks as the spatial merge candidates.
  • the encoder and the decoder may search the five blocks shown in FIG. 12 in the order of A1, B1, B0, A0, and B2, and index the available candidates sequentially to form a merge candidate list.
  • the coding apparatus inserts the temporal merge candidate derived by searching the temporal neighboring block of the current block into the merge candidate list (S1302).
  • the temporal neighboring block may be located on a reference picture that is a picture different from the current picture in which the current block is located.
  • the reference picture in which the temporal neighboring block is located may be called a collocated picture or a col picture.
  • the temporal neighboring block may be searched in the order of the lower right corner peripheral block and the lower right center block of the co-located block with respect to the current block on the col picture.
  • the constant storage unit may be predetermined, for example, 16x16 sample units, 8x8 sample units, or the like, or size information about the constant storage unit may be signaled from the encoder to the decoder.
  • motion information of the temporal neighboring block may be replaced with representative motion information of the predetermined storage unit in which the temporal neighboring block is located.
  • the temporal merge candidate may be derived based on the motion information of the covering prediction block. For example, when the constant storage unit is 2nx2n sample units, if the coordinates of the temporal neighboring block are (xTnb, yTnb), the modified positions ((xTnb >> n) ⁇ n) and (yTnb >> The motion information of the prediction block located at n) ⁇ n)) may be used for the temporal merge candidate.
  • the modified position is ((xTnb >> 4) ⁇ 4), ( The motion information of the prediction block located at yTnb >> 4) ⁇ 4)) may be used for the temporal merge candidate.
  • the constant storage unit is an 8x8 sample unit, if the coordinates of the temporal neighboring block are (xTnb, yTnb), the modified position is ((xTnb >> 3) ⁇ 3), (yTnb> The motion information of the prediction block located at > 3) ⁇ 3) can be used for the temporal merge candidate.
  • the coding apparatus may check whether the number of current merge candidates is smaller than the number of maximum merge candidates (S1303).
  • the maximum number of merge candidates may be predefined or signaled at the encoder to the decoder. For example, the encoder may generate information about the maximum number of merge candidates, encode the information, and transmit the encoded information to the decoder in the form of a bitstream. If the maximum number of merge candidates is filled up, the subsequent candidate addition process may not proceed.
  • the coding apparatus inserts an additional merge candidate into the merge candidate list (S1304).
  • the additional merge candidate may include, for example, ATMVP, combined bi-predictive merge candidate (when the slice type of the current slice is B type) and / or zero vector merge candidate.
  • the coding apparatus may terminate the construction of the merge candidate list.
  • the encoder may select an optimal merge candidate among merge candidates constituting the merge candidate list based on a rate-distortion (RD) cost, and signal selection information (ex. Merge index) indicating the selected merge candidate to the decoder. can do.
  • the decoder may select the optimal merge candidate based on the merge candidate list and the selection information.
  • the motion information of the selected merge candidate may be used as the motion information of the current block, and the prediction samples of the current block may be derived based on the motion information of the current block.
  • An encoder may derive residual samples of the current block based on the prediction samples, and may signal residual information about the residual samples to a decoder.
  • the decoder may generate reconstructed samples based on the residual samples derived from the residual information and the prediction samples, and generate a reconstructed picture based on the same.
  • the motion information of the current block may be derived in the same manner as when the merge mode is applied. However, when the skip mode is applied, the residual signal for the corresponding block is omitted, and thus prediction samples may be used as reconstructed samples.
  • FIG. 14 is a flowchart illustrating a merge candidate list construction method according to an embodiment to which the present invention is applied.
  • the motion vector and / or the temporal neighboring block (or Col block) of the restored spatial neighboring block (for example, may be the neighboring block described above with reference to FIG. 12).
  • a motion vector predictor candidate list may be generated. That is, the motion vector of the reconstructed spatial neighboring block and / or the motion vector corresponding to the temporal neighboring block may be used as a motion vector predictor candidate.
  • the information about the prediction may include selection information (eg, MVP flag or MVP index) indicating an optimal motion vector predictor candidate selected from the motion vector predictor candidates included in the list.
  • the prediction unit may select the motion vector predictor of the current block from among the motion vector predictor candidates included in the motion vector candidate list using the selection information.
  • the prediction unit of the encoding apparatus may obtain a motion vector difference (MVD) between the motion vector of the current block and the motion vector predictor, and may encode the output vector in a bitstream form. That is, MVD may be obtained by subtracting the motion vector predictor from the motion vector of the current block.
  • MVP flag or MVP index indicating an optimal motion vector predictor candidate selected from the motion vector predictor candidates included in the list.
  • the prediction unit of the decoding apparatus may obtain a motion vector difference included in the information about the prediction, and derive the motion vector of the current block by adding the motion vector difference and the motion vector predictor.
  • the prediction unit of the decoding apparatus may obtain or derive a reference picture index or the like indicating the reference picture from the information about the prediction.
  • the motion vector predictor candidate list may be configured as shown in FIG. 14.
  • FIG. 15 is a diagram for describing an affine motion model as an embodiment to which the present invention is applied.
  • a general image coding technique uses a translation motion model to represent the motion of a coding block.
  • the translation motion model represents a parallel-based block-based prediction method. That is, the motion information of the coding block is represented using one motion vector.
  • the optimal motion vector for each pixel in the actual coding block may be different. If the optimal motion vector can be determined for each pixel or subblock unit with only a little information, coding efficiency can be increased.
  • the present invention proposes an inter prediction based image processing method that reflects various motions of an image as well as a block based prediction method that is parallel moved to increase the performance of the inter prediction.
  • the present invention proposes a method of increasing the accuracy of the prediction and the compression performance by reflecting the motion information in the sub-block or pixel unit.
  • the present invention proposes an affine motion prediction method that performs coding / decoding using an affine motion model.
  • the affine motion model represents a prediction method of deriving a motion vector on a pixel basis or a sub block basis using a motion vector of a control point.
  • various methods may be used to represent distortion of an image as motion information.
  • the affine motion model may express four motions illustrated in FIG. 5.
  • the affine motion model can model any image distortion caused, including translation of the image, scaling of the image, rotation of the image, and shear of the image. have.
  • the affine motion model can be represented in various ways, but in the present invention, the distortion is displayed (or identified) using motion information at a specific reference point (or reference pixel / sample) of the block, and the inter prediction is used using the same. Suggest how to do it.
  • the reference point may be referred to as a control point (CP) (or control pixel, control sample), and the motion vector at this reference point may be referred to as a control point motion vector (CPMV).
  • CP control point
  • CPMV control point motion vector
  • the degree of distortion that can be expressed may vary depending on the number of such control points.
  • the affine motion model can be expressed using six parameters (a, b, c, d, e, f) as shown in Equation 1 below.
  • (x, y) represents the position of the upper left pixel of the coding block.
  • v_x and v_y represent the motion vector in (x, y), respectively.
  • 16 and 17 illustrate embodiments to which the present invention is applied and illustrate an affine motion prediction method using a control point motion vector.
  • the upper left control point (CP0) 1602 (hereinafter, referred to as a first control point) of the current block 1601, and the upper right control point (CP1) 1603 (hereinafter, referred to as the first control point).
  • a second control point) and a lower left control point (CP2) 1604 (hereinafter referred to as a third control point) may each have independent motion information.
  • This may be expressed as CP0, CP1, and CP2, respectively.
  • this corresponds to one embodiment of the present invention, and the present invention is not limited thereto.
  • various control points may be defined, such as a lower right control point, a center control point, and other control points for each position of a subblock.
  • At least one of the first to third control points may be a pixel included in the current block.
  • at least one of the first to third control points may be a pixel adjacent to the current block not included in the current block.
  • Motion information for each pixel or sub-block of the current block 1601 may be derived using motion information of one or more of the control points.
  • an affine motion model using motion vectors of the upper left control point 1602, the upper right control point 1603, and the lower left control point 1604 of the current block 1601 may be defined as in Equation 2 below. .
  • v_0 is a motion vector of the upper left control point 1602
  • v_1 is a motion vector of the upper right control point 1603
  • v_2 is a motion vector of the lower left control point 1604
  • v_0 ⁇ v_0x, v_0y ⁇
  • v_1 ⁇ v_1x, v_1y ⁇
  • v_2 ⁇ v_2x, v_2y ⁇ .
  • w denotes a width of the current block 1601
  • h denotes a height of the current block 1601.
  • v ⁇ v_x, v_y ⁇ represents a motion vector at the ⁇ x, y ⁇ position.
  • an affine motion model that expresses three motions of translation, scale, and rotation among motions that can be expressed by an affine motion model may be defined.
  • this is referred to as a simplified affine motion model or a simple affine motion model.
  • the simple affine motion model may be expressed using four parameters (a, b, c, d) as shown in Equation 3 below.
  • ⁇ v_x, v_y ⁇ represents a motion vector at the ⁇ x, y ⁇ position, respectively.
  • AF4 an affine motion model using four parameters.
  • the present invention is not limited thereto, and when six parameters are used, it is called AF6, and the above embodiments may be applied in the same manner.
  • v_0 a motion vector of the upper left control point 1701 of the current block
  • v_1 a motion vector of the right upper control point 1702
  • v_0 ⁇ v_0x, v_0y ⁇
  • v_1 ⁇ v_1x, v_1y ⁇
  • the affine motion model of AF4 may be defined as in Equation 4 below.
  • Equation 4 w denotes the width of the current block, and h denotes the height of the current block.
  • v ⁇ v_x, v_y ⁇ represents the motion vector of the ⁇ x, y ⁇ position, respectively.
  • the encoder or decoder may determine (or derive) the motion vector of each pixel position using the control point motion vector (eg, the motion vectors of the upper left control point 1701 and the upper right control point 1702).
  • a set of motion vectors determined through affine motion prediction may be defined as an affine motion vector field.
  • the affine motion vector field may be determined using at least one of Equations 1 to 4.
  • the motion vector through the affine motion prediction may be determined in units of pixels or in units of predefined (or preset) blocks (or subblocks). For example, when determined in units of pixels, a motion vector may be derived based on each pixel in a block, and when determined in units of subblocks, a motion vector may be derived based on units of each subblock in a current block. As another example, when it is determined in units of sub blocks, the motion vector of the corresponding sub block may be derived based on the upper left pixel or the center pixel.
  • the motion vector through the affine motion prediction is determined in units of 4x4 blocks.
  • the present invention is not limited thereto, and the present invention is not limited thereto. It can be applied in units of blocks of different sizes.
  • FIG. 18 is a diagram for describing a motion vector field indicating a motion vector set of a coding block according to an embodiment to which the present invention is applied.
  • the encoder or decoder may determine the motion vector in units of 4 ⁇ 4 subblocks using the motion vectors of the upper left control point 1801 and the upper right control point 1802 of the current block.
  • the motion vector of the corresponding subblock may be determined based on the central pixel value of each subblock.
  • an arrow displayed at the center of each subblock indicates a motion vector obtained by an Affine motion model.
  • Affine motion prediction may be used in an affine merge mode (hereinafter referred to as an "AF merge mode”) and an affine inter mode (hereinafter referred to as an "AF inter mode"). Similar to the skip mode or the merge mode, the AF merge mode is a method of encoding or decoding two control point motion vectors without encoding motion vector differences.
  • the AF inter mode is a method of encoding or decoding a control point motion vector difference after determining a control point motion vector predictor and a control point motion vector.
  • 19 is a flowchart illustrating a method of encoding an image based on an inter prediction mode according to an embodiment to which the present invention is applied.
  • the encoder performs (or applies) a skip mode, a merge mode, and an inter mode with respect to a current processing block (S1901).
  • the encoder performs an AF merge mode on the current processing block (S1902) and performs an AF inter mode (S1903). In this case, the execution order of steps S1901 to S1903 may be changed.
  • the encoder selects an optimal mode applied to the current processing block among the modes performed in steps S1901 to S1903 (S1904).
  • the encoder can determine the optimal mode based on the minimum rate-distortion value.
  • 20 is a flowchart illustrating a method of decoding an image based on an inter prediction mode according to an embodiment to which the present invention is applied.
  • the decoder determines whether the AF merge mode is applied to the current processing block (S2001). As a result of the determination in step S2001, when the AF merge mode is applied to the current processing block, decoding is performed based on the AF merge mode (S2002). When the AF merge mode is applied, the decoder may generate a control point motion vector predictor candidate and determine a candidate determined based on the index (or flag) value received from the encoder as the control point motion vector.
  • step S2001 when the AF merge mode is not applied to the current processing block, the decoder determines whether the AF inter mode is applied (S2003). As a result of the determination in step S2003, when the AF inter mode is applied to the current processing block, the decoder performs decoding based on the AF inter mode (S2004). When the AF inter mode is applied, the decoder generates a control point motion vector prediction value candidate, determines the candidate using an index (or flag) value received from the encoder, and then adds the difference values of the motion vector prediction values received from the encoder. The control point motion vector can be determined.
  • step S2003 when the AF inter mode is not applied to the current processing block, the decoder performs decoding based on a mode other than the AF merge / AF inter mode (S2005).
  • control point motion vector prediction value may be composed of two motion vector pairs of the first control point and the second control point, and two control point motion vector prediction value candidates may be configured.
  • the encoder may signal an optimal control point motion vector prediction value index and control point motion vector difference value among two candidates to the decoder. A method of determining two control point motion vector prediction value candidates will be described in detail with reference to the following drawings.
  • 21 and 22 are diagrams for describing a method of determining a control point motion vector prediction value candidate when an affine inter mode is applied as an embodiment to which the present invention is applied.
  • the encoder / decoder generates a combined motion vector prediction value combining motion vector prediction values of a first control point, a second control point, and a third control point (S2101).
  • the encoder / decoder may generate up to 12 combined motion vector prediction values by combining motion vectors of neighboring blocks adjacent to the control points, respectively.
  • the encoder / decoder may use the motion vectors of the upper left neighboring block A, the upper neighboring block B, and the left neighboring block C of the first control point 2201 as the motion vector combination candidate of the first control point 2201. have.
  • the encoder / decoder may use the upper neighboring block D and the right upper neighboring block E of the second control point 2202 as the motion vector combination candidates of the second control point 2202.
  • the encoder / decoder may use the left neighboring block F and the lower left neighboring block G of the third control point 2203 as the motion vector combination candidate of the third control point 2203.
  • the neighboring blocks of each control point may be a 4x4 block.
  • the motion vector combination of the neighboring blocks adjacent to the control points may be expressed by Equation 5 below.
  • the encoder / decoder lists (or arranges) the combined motion vector prediction values generated in step S2101 in order of decreasing divergence of the motion vectors of the control point (S2102).
  • the motion vectors of the control points may indicate the same or similar directions.
  • the degree of divergence of the motion vectors may be determined using Equation 6 below.
  • the encoder / decoder determines (or adds) the upper two of the combined motion vector prediction values listed in step S2102 as a motion vector prediction value candidate list (hereinafter, may be referred to as a candidate list) (S2103).
  • the encoder / decoder adds candidates of the AMVP candidate list to the candidate list (S2104).
  • the encoder / decoder may add the top two candidates of the AMVP candidate list to the candidate list.
  • the encoder / decoder may add the first candidate of the AMVP candidate list to the candidate list.
  • the AMVP candidate list may be generated by applying the method described with reference to FIGS. 12 to 14.
  • the encoder determines a control point motion vector for each of the two candidate lists, compares the RD cost, selects candidates and / or control point motion vectors with small values, and converts the index and control point motion vector differences to the decoder. Can transmit
  • 23 and 24 are diagrams for explaining a motion estimation / compensation method when an affine merge mode is applied as an embodiment to which the present invention is applied.
  • an encoder will be mainly described.
  • the encoding method in the AF merge mode proposed in this embodiment may be applied to the decoder in the same manner.
  • the encoder may scan blocks A, B, C, D, and E of size 4x4 around the current block in alphabetical order.
  • the encoder searches for the block encoded in the first affine prediction mode based on the scanning order, and determines the found block as the AF merge candidate block.
  • the encoder may search / determine a plurality of AF merge candidates on a scanning order basis.
  • the encoder determines the affine motion model of the current block using the determined control point motion vector of the candidate block.
  • the control point motion vector of the current block and the motion vector field of the current block may be determined according to the affine motion model of the candidate block.
  • the encoder may determine block A as a candidate block.
  • the encoder may derive the affine motion model of the A block using the control point motion vectors of the A block, v_2 and v_3 (or v_2, v_3, v_4).
  • the encoder may derive (or generate or determine) the control point motion vectors v_0 and v_1 of the current block based on the derived affine motion model.
  • the encoder may encode syntax information indicating the AF merge mode.
  • syntax used in the method described above with reference to FIGS. 15 to 23 may be represented as Table 2 below.
  • the decoder may check whether there is a block encoded in the affine mode (or the affine prediction mode) among neighboring blocks. In this case, if there is a block encoded in the affine mode, a true value may be returned and affine_flag may be parsed.
  • FIG. 25 is a diagram illustrating a method of performing affine prediction using a defined motion compensation region according to an embodiment to which the present invention is applied.
  • the affine motion vector field may be determined in a pixel unit or a predefined block unit. If it is determined in units of pixels, the encoder / decoder can obtain a motion vector based on each pixel value. If it is determined in units of blocks, the motion vector of the corresponding subblock is determined based on the center pixel value of each subblock. Can be obtained.
  • the motion vector field of the current block may be determined using the motion vector of the first control point representing the upper left control point of the current block and the motion vector of the second control point representing the right upper control point.
  • the defined motion compensation region (defined MC region) representing the motion compensation region in the sub-block unit according to the affine prediction in the reference picture. May be determined as shown in FIG. 25.
  • the defined motion compensation region refers to the total memory size of the reference picture region required for performing motion compensation in the decoding process of the current block.
  • the motion compensation region defined above is not limited to the name.
  • the defined motion compensation region may include a predefined motion compensation region, a motion compensation region, an affine motion compensation region, a search region (or search range), a defined search region (or search range), a predefined It may be referred to as a search region (or search range), an affine search region (or search range), a motion vector field, a defined motion vector field, a predefined motion vector field, and the like.
  • the present invention proposes a method of limiting the range for deriving a motion vector when predicting affine motion in order to improve this problem.
  • FIG. 26 is a flowchart illustrating a motion compensation method through affine prediction according to an embodiment to which the present invention is applied.
  • FIG. 26 it illustrates a method of limiting the motion compensation region proposed in the present invention.
  • the decoder first derives motion vectors of the first control point and the second control point in the AF merge mode or the AF inter mode (S2601).
  • the control point motion vector derived in step S2601 may be referred to as an initial control point motion vector.
  • the decoder calculates a control point motion vector with respect to the center position (or the position of the center pixel) of the current block (S2602).
  • the control point motion vector of the central position may be referred to as a central control point and a fourth control point.
  • the method for calculating the central control point will be described later with reference to the following drawings.
  • the decoder updates the motion compensation region defined using the motion vector of the central control point calculated in step S2602 (S2603). This will be described later in detail.
  • the decoder derives the first control point and the second control point by performing affine prediction in the motion compensation region updated in step S2603 (S2604).
  • the decoder derives the motion vector of the current block in units of subblocks by using the affine motion model of the current block derived by the first control point and the second control point (S2605).
  • FIG. 27 is a diagram for describing a method of deriving a control point motion vector of a center position of a current block according to an embodiment to which the present invention is applied.
  • the encoder / decoder is a control point motion vector of the center position of the current block, that is, the center of the current block based on the motion vectors of the first control point CP_0 and the second control point CP_1.
  • the control point motion vector CPMV_C may be derived.
  • the encoder / decoder may use Equation 7 below.
  • Equation 7 h means the height of the current block, w means the width of the current block.
  • v_0 represents a motion vector of the first control point
  • v_1 represents a motion vector of the second control point
  • v_2 represents a motion vector of the third control point representing the lower left control point
  • v_2 ⁇ v_2x, v_2y ⁇ .
  • the encoder / decoder may set (or reset or update) a motion compensation region defined based on the calculated central control point motion vector.
  • the defined motion compensation region may be determined using a predefined motion compensation bandwidth threshold value MC_BW_TH or a current block size.
  • FIG. 28 is a diagram for explaining a method of determining a motion compensation region defined using a control point motion vector at a central position according to an embodiment to which the present invention is applied.
  • the defined motion compensation region when the defined motion compensation region is determined using the motion compensation bandwidth threshold value, the defined motion compensation region may be determined as shown in FIG. 28.
  • the upper left position of the defined motion compensation region may be derived (or determined) by the coordinates of Equation 8 below, and the lower right position may be derived by the coordinates of Equation 9 below.
  • MC_BW_TH represents a motion compensation bandwidth threshold.
  • the MC_BW_TH is a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Slice Header (SH) (or Tile Group Header, TGH). Or may be transmitted through a header of a network abstract layer (NAL) unit, etc.
  • the MC_BW_TH may be defined as the same value in the encoder and the decoder.
  • the MC_BW_TH value may be replaced with w (h) or w / 2 (h / 2) of the current block.
  • the determination of w representing the width of the current block or h representing the height of the current block can be adaptively selected according to the shape of the current block.
  • FIG. 29 is a diagram for describing a method of performing affine prediction using a defined motion compensation region according to an embodiment to which the present invention is applied.
  • the encoder / decoder may derive (or update, adjust) motion vectors of the first control point and the second control point again based on the defined (or updated) defined motion compensation region. That is, the motion vectors of the first control point and the second control point may be limited not to exceed the defined motion compensation region.
  • the encoder / decoder may not use the candidate for affine motion prediction.
  • the encoder / decoder clips to the control point motion vector to fall within the defined motion compensation region. Can be performed.
  • the encoder / decoder may calculate (or derive) an affine motion vector field in sub-block units using the updated motion vectors of the first control point and the second control point.
  • FIG. 30 is a view illustrating a method of limiting a motion compensation region based on a control point motion vector as an embodiment to which the present invention is applied.
  • control point motion vector of the center position is derived using the initial first control point motion vector and the initial second control point motion vector, and a defined motion compensation region is set based thereon. (Or reset or update).
  • the AF merge candidate may be derived using a defined motion compensation region determined based on the motion vector of the first control point, which is the upper left control point.
  • the encoder / decoder may scan blocks A, B, C, D, and E of a neighboring 4x4 size of the current coding block in alphabetical order.
  • the encoder may search for the block encoded in the first affine prediction mode based on the scanning order, and determine the searched block as an AF merge candidate block.
  • the encoder / decoder may derive the motion vector of the first control point using an affine model of a block encoded in the affine prediction mode among neighboring blocks.
  • the encoder / decoder may set (or define) a motion compensation region based on the derived first control point motion vector.
  • the encoder / decoder derives the second control point motion vector, when the region (or pixel) specified by the motion vector of the second control point is included in the set motion compensation region, the encoder / decoder is encoded in the affine prediction mode.
  • a block can be added as an AF merge candidate.
  • the encoder / decoder may derive the upper left position of the defined motion compensation region using Equation 10 below.
  • the encoder / decoder may derive the lower right position of the defined motion compensation region using Equation 11 below.
  • MC_BW_TH represents a motion compensation bandwidth threshold.
  • the MC_BW_TH is a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Slice Header (SH) (or Tile Group Header, TGH). Or may be transmitted through a header of a network abstract layer (NAL) unit, etc.
  • the MC_BW_TH may be defined as the same value in the encoder and the decoder.
  • the MC_BW_TH value may be replaced with w (h) or w / 2 (h / 2) of the current block.
  • the determination of w representing the width of the current block or h representing the height of the current block can be adaptively selected according to the shape of the current block.
  • the neighboring block A and the neighboring block C are blocks encoded in the affine prediction mode.
  • the motion compensation region defined based on the first control point motion vector by the affine model of block A is set, the position indicated by the second control point motion vector by the affine model of block A is defined above. It is not included in the compensation area.
  • the affine model of block A may not be considered as an AF merge candidate.
  • the position indicated by the second control point motion vector by the affine model of block C is defined above. It may be included in the motion compensation region.
  • the affine model of block C can be used as an AF merge candidate.
  • the defined motion compensation region according to the embodiment proposed by the present invention may be set to a block of a predefined size specified by the first control point motion vector. That is, the defined motion compensation region may be set to a region of a predefined size, and the upper left pixel position of the region of the predefined size may be determined by the first control point motion vector. If the defined motion compensation region is set and the pixel (or region, sample) specified by the second control point motion vector is out of the defined motion compensation region, the second control point motion vector is the defined motion compensation region. It may be clipped (or modified, adjusted, updated) to be included within.
  • Embodiments of the present invention described above may be implemented independently, or one or more embodiments may be implemented in combination.
  • 31 is a flowchart illustrating a method of generating an inter prediction block according to an embodiment to which the present invention is applied.
  • a decoder is described for convenience of description, but the present invention is not limited thereto, and the method of generating an inter prediction block using affine prediction according to an embodiment of the present invention is performed in the same manner in the encoder and the decoder. Can be.
  • the decoder searches for blocks encoded in the affine prediction mode among blocks neighboring the current block (S3101).
  • the decoder uses an affine motion model of the block encoded in the affine prediction mode to form a first control point motion vector of a top left control point of the current block and a top right side of the current block.
  • a second control point motion vector of the control point is derived (S3102).
  • the decoder determines a motion compensation region for affine prediction in the reference picture of the current block (S3103).
  • the decoder updates the first control point motion vector and the second control point motion vector based on the motion compensation region (S3104).
  • the decoder derives a motion vector of a sub-block unit in the current block by using the updated one control point motion vector and the updated second control point motion vector (S3105).
  • the step S3103 may include: deriving a third control point motion vector of the center position of the current block by using the first control point motion vector and the second control point motion vector; And determining the motion compensation region by using the third control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold may include a sequence parameter set, a picture parameter set, a tile group header, or a network abstraction layer.
  • Abstract Layer may be signaled from an encoder through a header of a unit.
  • step S3104 when the position specified by at least one of the first control point motion vector and the second control point motion vector is out of the motion compensation region, The control may be performed by updating at least one of a first control point motion vector and the second control point motion vector to be included in the motion compensation region.
  • the step S3103 may further include determining the motion compensation region by using the first control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold may include a sequence parameter set, a picture parameter set, a tile group header, or a network abstraction layer.
  • Abstract Layer may be signaled from an encoder through a header of a unit.
  • the motion compensation region is determined as a block having a predetermined size specified by the first control point motion vector, and in step S3104, the motion compensation region is specified by the second control point motion vector.
  • the position becomes out of the motion compensation region it may be performed by updating the second control point motion vector to be included in the motion compensation region.
  • FIG. 32 is a diagram illustrating an inter prediction apparatus according to an embodiment to which the present invention is applied.
  • the inter prediction unit is illustrated as one block for convenience of description, but the inter prediction unit may be implemented in a configuration included in the encoder and / or the decoder.
  • the inter prediction unit implements the functions, processes, and / or methods proposed in FIGS. 8 to 31.
  • the inter prediction unit is the affine coded block search unit 3201, the control point motion vector derivation unit 3202, the motion compensation region determiner 3203, the control point motion vector updater 3204, and the sub block motion vector derivation unit 3205. It may be configured to include.
  • the affine coding block search unit 3201 searches for a block encoded in the affine prediction mode among blocks neighboring the current block.
  • the control point motion vector derivation unit 3202 is configured to generate a first control point motion vector of an upper left control point of the current block by using an affine motion model of the block encoded in the affine prediction mode, and A second control point motion vector of the right upper control point of the current block is derived.
  • the motion compensation region determiner 3203 determines a motion compensation region for affine prediction in the reference picture of the current block.
  • the control point motion vector updater 3204 updates the first control point motion vector and the second control point motion vector based on the motion compensation region.
  • the subblock motion vector derivation unit 3205 derives a motion vector of each subblock in the current block by using the updated one control point motion vector and the updated second control point motion vector.
  • the motion compensation region determiner 3203 may use the first control point motion vector and the second control point motion vector to control the third control point motion vector at the center position of the current block.
  • the motion compensation region may be determined using the third control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold may include a sequence parameter set, a picture parameter set, a tile group header, or a network abstraction layer.
  • Abstract Layer may be signaled from an encoder through a header of a unit.
  • control point motion vector updating unit 3204 may determine a position specified by at least one of the first control point motion vector and the second control point motion vector. In the case of, the at least one of the first control point motion vector and the second control point motion vector may be updated to be included in the motion compensation region.
  • the motion compensation region determiner 3203 may determine the motion compensation region by using the first control point motion vector and the motion compensation bandwidth threshold.
  • the motion compensation bandwidth threshold may include a sequence parameter set, a picture parameter set, a tile group header, or a network abstraction layer.
  • Abstract Layer may be signaled from an encoder through a header of a unit.
  • the motion compensation region is set to a block having a predetermined size specified by the first control point motion vector
  • the control point motion vector updating unit 3204 is configured to perform the second control operation.
  • the second control point motion vector may be updated to be included in the motion compensation region.
  • the video coding system can include a source device and a receiving device.
  • the source device may deliver the encoded video / image information or data to a receiving device through a digital storage medium or network in a file or streaming form.
  • the source device may include a video source, an encoding apparatus, and a transmitter.
  • the receiving device may include a receiver, a decoding apparatus, and a renderer.
  • the encoding device may be called a video / image encoding device, and the decoding device may be called a video / image decoding device.
  • the transmitter may be included in the encoding device.
  • the receiver may be included in the decoding device.
  • the renderer may include a display unit, and the display unit may be configured as a separate device or an external component.
  • the video source may acquire the video / image through a process of capturing, synthesizing, or generating the video / image.
  • the video source may comprise a video / image capture device and / or a video / image generation device.
  • the video / image capture device may include, for example, one or more cameras, video / image archives including previously captured video / images, and the like.
  • Video / image generation devices may include, for example, computers, tablets and smartphones, and may (electronically) generate video / images.
  • a virtual video / image may be generated through a computer or the like. In this case, the video / image capturing process may be replaced by a process of generating related data.
  • the encoding device may encode the input video / image.
  • the encoding apparatus may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency.
  • the encoded data (encoded video / image information) may be output in the form of a bitstream.
  • the transmitter may transmit the encoded video / video information or data output in the form of a bitstream to the receiver of the receiving device through a digital storage medium or a network in the form of a file or streaming.
  • the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like.
  • the transmission unit may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast / communication network.
  • the receiver may extract the bitstream and transmit the extracted bitstream to the decoding apparatus.
  • the decoding apparatus may decode the video / image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding apparatus.
  • the renderer may render the decoded video / image.
  • the rendered video / image may be displayed through the display unit.
  • FIG. 34 is a diagram illustrating the structure of a content streaming system according to an embodiment to which the present invention is applied.
  • a content streaming system to which the present invention is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user device, and a multimedia input device.
  • the encoding server compresses content input from multimedia input devices such as a smartphone, a camera, a camcorder, etc. into digital data to generate a bitstream and transmit the bitstream to the streaming server.
  • multimedia input devices such as smart phones, cameras, camcorders, etc. directly generate a bitstream
  • the encoding server may be omitted.
  • the bitstream may be generated by an encoding method or a bitstream generation method to which the present invention is applied, and the streaming server may temporarily store the bitstream in the process of transmitting or receiving the bitstream.
  • the streaming server transmits the multimedia data to the user device based on the user's request through the web server, and the web server serves as a medium for informing the user of what service.
  • the web server delivers it to a streaming server, and the streaming server transmits multimedia data to the user.
  • the content streaming system may include a separate control server.
  • the control server plays a role of controlling a command / response between devices in the content streaming system.
  • the streaming server may receive content from a media store and / or an encoding server. For example, when the content is received from the encoding server, the content may be received in real time. In this case, in order to provide a smooth streaming service, the streaming server may store the bitstream for a predetermined time.
  • Examples of the user device include a mobile phone, a smart phone, a laptop computer, a digital broadcasting terminal, a personal digital assistant (PDA), a portable multimedia player (PMP), navigation, a slate PC, Tablet PCs, ultrabooks, wearable devices (e.g., smartwatches, glass glasses, head mounted displays), digital TVs, desktops Computer, digital signage, and the like.
  • PDA personal digital assistant
  • PMP portable multimedia player
  • slate PC slate PC
  • Tablet PCs ultrabooks
  • wearable devices e.g., smartwatches, glass glasses, head mounted displays
  • digital TVs desktops Computer
  • digital signage digital signage
  • Each server in the content streaming system may be operated as a distributed server, in which case data received from each server may be distributed.
  • the embodiments described herein may be implemented and performed on a processor, microprocessor, controller, or chip.
  • the functional units shown in each drawing may be implemented and performed on a computer, processor, microprocessor, controller, or chip.
  • the decoder and encoder to which the present invention is applied include a multimedia broadcasting transmitting and receiving device, a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video chat device, a real time communication device such as video communication, a mobile streaming device, Storage media, camcorders, video on demand (VoD) service providing devices, OTT video (Over the top video) devices, Internet streaming service providing devices, three-dimensional (3D) video devices, video telephony video devices, and medical video devices. It can be used to process video signals or data signals.
  • the OTT video device may include a game console, a Blu-ray player, an internet access TV, a home theater system, a smartphone, a tablet PC, a digital video recorder (DVR), and the like.
  • the processing method to which the present invention is applied can be produced in the form of a program executed by a computer, and stored in a computer-readable recording medium.
  • Multimedia data having a data structure according to the present invention can also be stored in a computer-readable recording medium.
  • the computer readable recording medium includes all kinds of storage devices and distributed storage devices in which computer readable data is stored.
  • the computer-readable recording medium may be, for example, a Blu-ray disc (BD), a universal serial bus (USB), a ROM, a PROM, an EPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical disc. It may include a data storage device.
  • the computer-readable recording medium also includes media embodied in the form of a carrier wave (eg, transmission over the Internet).
  • the bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network.
  • an embodiment of the present invention may be implemented as a computer program product by program code, which may be performed on a computer by an embodiment of the present invention.
  • the program code may be stored on a carrier readable by a computer.
  • Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof.
  • an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • processors controllers, microcontrollers, microprocessors, and the like.
  • an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above.
  • the software code may be stored in memory and driven by the processor.
  • the memory may be located inside or outside the processor, and may exchange data with the processor by various known means.

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é de décodage d'un signal vidéo, et un dispositif associé. En particulier, un procédé de décodage d'un signal vidéo sur la base d'un mode de prédiction affine peut comprendre les étapes consistant à : rechercher un bloc codé dans un mode de prédiction affine, parmi des blocs voisins d'un bloc actuel; déduire un premier vecteur de mouvement de point de commande d'un point de commande du côté supérieur gauche du bloc actuel et un second vecteur de mouvement de point de commande d'un point de commande du côté supérieur droit du bloc actuel, au moyen d'un modèle de mouvement affine du bloc codé dans le mode de prédiction affine; déterminer une zone de compensation de mouvement pour une prédiction affine dans une image de référence du bloc actuel; mettre à jour le premier vecteur de mouvement de point de commande et le second vecteur de mouvement de point de commande sur la base de la zone de compensation de mouvement; et déduire un vecteur de mouvement d'unités de sous-bloc dans le bloc actuel au moyen du premier vecteur de mouvement de point de commande mis à jour et du second vecteur de mouvement de point de commande mis à jour.
PCT/KR2019/004528 2018-04-14 2019-04-15 Procédé et dispositif de traitement de signal vidéo par prédiction affine Ceased WO2019199152A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862657725P 2018-04-14 2018-04-14
US62/657,725 2018-04-14

Publications (1)

Publication Number Publication Date
WO2019199152A1 true WO2019199152A1 (fr) 2019-10-17

Family

ID=68164311

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/004528 Ceased WO2019199152A1 (fr) 2018-04-14 2019-04-15 Procédé et dispositif de traitement de signal vidéo par prédiction affine

Country Status (1)

Country Link
WO (1) WO2019199152A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630601A (zh) * 2021-06-29 2021-11-09 杭州未名信科科技有限公司 一种仿射运动估计方法、装置、设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120163461A1 (en) * 2010-12-23 2012-06-28 Electronics And Telecommunications Research Institute Motion estimation apparatus and method
WO2017171107A1 (fr) * 2016-03-28 2017-10-05 엘지전자(주) Procédé de traitement d'image basé sur un mode d'inter-prédiction, et appareil associé
US20170332095A1 (en) * 2016-05-16 2017-11-16 Qualcomm Incorporated Affine motion prediction for video coding
US20180070102A1 (en) * 2015-05-15 2018-03-08 Huawei Technologies Co., Ltd. Adaptive Affine Motion Compensation Unit Determing in Video Picture Coding Method, Video Picture Decoding Method, Coding Device, and Decoding Device
KR20180035881A (ko) * 2015-08-29 2018-04-06 후아웨이 테크놀러지 컴퍼니 리미티드 이미지 예측 방법 및 장치

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120163461A1 (en) * 2010-12-23 2012-06-28 Electronics And Telecommunications Research Institute Motion estimation apparatus and method
US20180070102A1 (en) * 2015-05-15 2018-03-08 Huawei Technologies Co., Ltd. Adaptive Affine Motion Compensation Unit Determing in Video Picture Coding Method, Video Picture Decoding Method, Coding Device, and Decoding Device
KR20180035881A (ko) * 2015-08-29 2018-04-06 후아웨이 테크놀러지 컴퍼니 리미티드 이미지 예측 방법 및 장치
WO2017171107A1 (fr) * 2016-03-28 2017-10-05 엘지전자(주) Procédé de traitement d'image basé sur un mode d'inter-prédiction, et appareil associé
US20170332095A1 (en) * 2016-05-16 2017-11-16 Qualcomm Incorporated Affine motion prediction for video coding

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630601A (zh) * 2021-06-29 2021-11-09 杭州未名信科科技有限公司 一种仿射运动估计方法、装置、设备及存储介质
CN113630601B (zh) * 2021-06-29 2024-04-02 杭州未名信科科技有限公司 一种仿射运动估计方法、装置、设备及存储介质

Similar Documents

Publication Publication Date Title
WO2020004990A1 (fr) Procédé de traitement d'image sur la base d'un mode de prédiction inter et dispositif correspondant
WO2019216714A1 (fr) Procédé de traitement d'image fondé sur un mode de prédiction inter et appareil correspondant
WO2019194514A1 (fr) Procédé de traitement d'image fondé sur un mode de prédiction inter et dispositif associé
WO2020055107A1 (fr) Procédé et appareil de décodage d'image basé sur une prédiction de mouvement affine à l'aide d'une liste de candidats mvp affine dans un système de codage d'image
WO2020262931A1 (fr) Procédé et dispositif de signalisation permettant de fusionner une syntaxe de données dans un système de codage vidéo/image
WO2019235822A1 (fr) Procédé et dispositif de traitement de signal vidéo à l'aide de prédiction de mouvement affine
WO2020262900A1 (fr) Procédé de décodage d'image pour dériver un échantillon prédit à l'aide d'un candidat à la fusion et dispositif associé
WO2020013569A1 (fr) Procédé et appareil de décodage d'image sur la base d'une prédiction de mouvement affine dans un système de codage d'image
WO2020185045A1 (fr) Procédé et dispositif de codage/décodage vidéo utilisant une limitation de segmentation pour un bloc de chrominance, et procédé de transmission de flux binaire
WO2019194463A1 (fr) Procédé de traitement d'image et appareil associé
WO2020256487A1 (fr) Procédé et dispositif de codage d'image sur la base d'une prédiction de mouvement
WO2020262930A1 (fr) Procédé et dispositif pour éliminer une syntaxe redondante d'une syntaxe de données de fusion
WO2020251257A1 (fr) Procédé et dispositif de décodage d'image pour la dérivation d'informations d'indice de pondération pour la production d'échantillon de prédiction
WO2021040410A1 (fr) Procédé de décodage vidéo pour codage résiduel et dispositif associé
WO2020262929A1 (fr) Procédé et dispositif de signalisation de syntaxe dans un système de codage d'image/de vidéo
WO2021141227A1 (fr) Procédé de décodage d'image et dispositif associé
WO2020262902A1 (fr) Procédé de décodage vidéo utilisant une bi-prédiction et dispositif associé
WO2020256493A1 (fr) Procédé et dispositif pour coder une image sur la base d'une inter-prédiction
WO2020256453A1 (fr) Procédé de décodage d'image comprenant la génération d'échantillons de prédiction par application d'un mode de prédiction déterminé, et dispositif associé
WO2020256492A1 (fr) Procédé et dispositif d'élimination de signalisation se chevauchant dans un système de codage de vidéo/d'images
WO2021145673A1 (fr) Procédé et dispositif de prédiction pondérée pour codage d'image/vidéo
WO2021158051A1 (fr) Procédé de décodage d'image associé à un codage résiduel et dispositif associé
WO2021145669A1 (fr) Procédé et appareil d'inter-prédiction dans un système de codage vidéo
WO2020251258A1 (fr) Procédé et appareil de décodage d'image permettant de dériver des informations d'indice de pondération destinées à une moyenne pondérée lorsqu'une bi-prédiction est appliquée
WO2020262962A1 (fr) Procédé et appareil pour coder/décoder une vidéo en utilisant une limitation de taille maximale de bloc de transformée de saturation, et procédé de transmission de flux binaire

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

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

Country of ref document: EP

Kind code of ref document: A1