WO2019194498A1 - Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé - Google Patents

Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé Download PDF

Info

Publication number
WO2019194498A1
WO2019194498A1 PCT/KR2019/003804 KR2019003804W WO2019194498A1 WO 2019194498 A1 WO2019194498 A1 WO 2019194498A1 KR 2019003804 W KR2019003804 W KR 2019003804W WO 2019194498 A1 WO2019194498 A1 WO 2019194498A1
Authority
WO
WIPO (PCT)
Prior art keywords
motion information
block
current block
flag
candidate list
Prior art date
Application number
PCT/KR2019/003804
Other languages
English (en)
Korean (ko)
Inventor
장형문
남정학
박내리
Original Assignee
엘지전자 주식회사
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 엘지전자 주식회사 filed Critical 엘지전자 주식회사
Publication of WO2019194498A1 publication Critical patent/WO2019194498A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/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/513—Processing of motion vectors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/56—Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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 still image or moving image processing method, and more particularly, to a method for encoding / decoding a still image or moving image based on an inter prediction mode, and an apparatus supporting the same.
  • 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 have features such as high spatial resolution, high frame rate, and high dimensionality of scene representation. Processing such content will result in a tremendous increase in terms of memory storage, memory access rate, and processing power.
  • An object of the present invention is to propose a method for limiting the number of reference pictures for a motion vector derivation process.
  • an object of the present invention is to propose a method for improving merge prediction candidates (3 ⁇ 4) (MCR) for a fixed reference picture.
  • An object of the present invention is to propose a memory patch sequence for motion compensation.
  • An object of the invention is to propose a cost calculation method for deriving motion information candidates in a decoder, i.
  • An object of the present invention is to propose a method for deriving / signaling an Illumination Compensation (1C) flag.
  • motion information of a spatial neighboring block or a temporal neighboring block of the current block is included.
  • IC illumination compensation
  • the cost calculation method may be determined by any one of a sum of absolute difference (SAD) method and a tuned SAD method.
  • SAD sum of absolute difference
  • the tuned SAD scheme comprises the difference between the average value of the template of the current block and the sample value of the current block and the average value of the template of the reference block specified by the candidate and the sample of the reference block.
  • the template of the current block includes reconstructed samples adjacent to the left and top of the current block, and the template of the reference block reconstructed samples adjacent to the left and top of the reference block It may include.
  • the determining of the cost calculation method comprises: when there is at least one candidate having the 1C flag value of 1 among the candidates included in the motion information candidate list, the cost of the tuned SAD method for the candidates. If it is determined by a calculation method and at least one candidate having the 1C flag value is 1 among the candidates included in the motion information candidate list, ⁇ ⁇ 02019/194498 1 > 0 '/ 1? 2019/003804
  • the determining of the cost calculation method may include: when there is at least one candidate having a 1C flag value of 1 among candidates included in the motion information candidate list, and applying 1C to the current block is allowed;
  • the tuned SAD method is determined as a cost calculation method for the candidates, and at least one candidate having the 1C flag value of 1 is among the candidates included in the motion information candidate list, or 1C application is allowed to the current block. If not, the SAD scheme may be determined as a costing scheme for the candidates.
  • the method further includes parsing a syntax element indicating whether 1C application is allowed in the current block, wherein the syntax element indicating whether 1C application is allowed is a video parameter set, a sequence.
  • the signal may be signaled through a sequence parameter set, a picture parameter set (PPS), or a tile group header syntax.
  • An aspect of the present invention provides a method of decoding an image based on an inter prediction mode, the method comprising: generating a motion information candidate list of the current block based on motion information of a spatial neighboring block or a temporal neighboring block of the current block; Checking whether a candidate having an IC (Illumination Compensation) flag having a value of 1 exists among candidates included in the motion information candidate list; And whether 1C is applied to the current block based on the check result.
  • IC Interference Compensation
  • the step of deriving the IC flag when there is a candidate having a 1C flag with a value of 1 among candidates included in the motion information candidate list, the 1C flag value of the candidate is 1C flag of the current block.
  • the value may be set, and if there is no candidate having a 1C flag having a value of 1 among candidates included in the motion information candidate list, the 1C flag value of the current block may be set to 0.
  • the step of deriving the 1C flag if there is a candidate having a 1C flag with a value of 1 among candidates included in the motion information candidate list, the 1C flag value of the candidate is 1C flag of the current block. Setting to a value; And parsing an IC flag of the current block when a candidate having a 1C flag having a value of 1 does not exist among candidates included in the motion information candidate list.
  • a method of encoding an image based on an inter prediction mode comprising: a motion information candidate list generator configured to generate a motion information candidate list of the current block based on motion information of a spatial neighboring block or a temporal neighboring block of the current block; A cost calculation method determination unit configured to determine a cost calculation method for the candidates based on an illumination flag (IC) of the candidates included in the motion information candidate list; A cost calculator configured to calculate cost values of the candidates based on the determined cost calculation method, and selecting an optimal candidate for inter prediction of the current block from the motion information candidate list based on the calculated cost values It can include a candidate selector.
  • An apparatus for decoding an image based on an inter prediction mode comprising: A motion information candidate list generator for generating a motion information candidate list of the current block based on motion information of a spatial neighboring block or a temporal neighboring block; A 1C flag candidate identification unit for identifying whether a candidate having an IC (Illumination Compensation) clag of 1 among the candidates included in the motion information candidate list exists; And a 1C flag derivation unit for deriving a 1C flag indicating whether 1C is applied to the current block based on the check result.
  • a motion information candidate list generator for generating a motion information candidate list of the current block based on motion information of a spatial neighboring block or a temporal neighboring block
  • a 1C flag candidate identification unit for identifying whether a candidate having an IC (Illumination Compensation) clag of 1 among the candidates included in the motion information candidate list exists
  • a 1C flag derivation unit for deriving a 1C flag indicating whether 1C is applied to the current block based on
  • the compression efficiency can be improved by improving the memory patch.
  • 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 an embodiment to which the present invention is applied, and decoding of a video / image signal is performed.
  • a schematic block diagram of the encoding apparatus performed is shown.
  • 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? Into multiple CUs based on a quadtree and a 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 partitioning 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.
  • 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.
  • 15 is a flowchart illustrating a method of generating an inter prediction block by applying a DMVR as an embodiment to which the present invention may be applied.
  • FIG. 16 is a diagram illustrating a problem occurring in a conventional inter prediction method as an embodiment to which the present invention may be applied.
  • 17 is a diagram illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied.
  • FIG. 18 is a diagram illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied.
  • FIG. 19 and 20 are diagrams illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied.
  • FIG. 21 is a diagram illustrating a method of refinement of a motion vector derived using neighboring blocks as an embodiment to which the present invention is applied.
  • 22 is a diagram illustrating a method of using a fixed number of reference pictures to perform motion estimation / compensation according to an embodiment to which the present invention is applied.
  • FIG. 23 is a diagram illustrating a method of using a fixed number of reference pictures to perform motion estimation / compensation according to an embodiment to which the present invention is applied.
  • FIG. 24 illustrates an embodiment to which the present invention may be applied, in which an improved prediction predictor is derived using an illumination compensation (IC). 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • FIG. 9 is a diagram for explaining the method.
  • FIG. 25 illustrates an embodiment of a motion information candidate according to an embodiment of the present invention.
  • FIG. 4 is a diagram illustrating a method of performing motion correction / compensation based on whether or not it is performed.
  • FIG. 2 is a diagram illustrating a method of performing motion correction / compensation based on whether a motion information candidate is applied as an embodiment to which the present invention is applied.
  • FIG. 21 is a diagram illustrating a method of motion correction / compensation based on whether 10 motion information candidates are applied as an embodiment to which the present invention is applied.
  • FIG. 28 is a diagram illustrating a method of motion estimation / compensation based on whether motion information candidates are applied with I ⁇ according to an embodiment to which the present invention is applied.
  • 29 illustrates an embodiment of a processing block based on whether motion information candidates are applied according to an embodiment to which the present invention is applied.
  • FIG. 30 is an embodiment to which the present invention may be applied, based on whether a motion information candidate is applied or not; It is a figure which illustrates the method of determining whether to apply.
  • FIG. 31 is a view illustrating a motion information candidate as an embodiment to which the present invention is applied.
  • FIG. 1 is a diagram illustrating a method of determining whether to apply 1 (:) of a processing block based on whether or not.
  • 32 is a diagram illustrating an example of a processing block based on whether 10 motion information candidates are applied according to an embodiment to which the present invention is applied. It is a figure which illustrates the method of determining whether to apply.
  • 33 is a view based on inter prediction mode according to an embodiment to which the present invention is applied 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • FIG. 10 is a flowchart illustrating the encoding method.
  • 34 is a flowchart illustrating an inter prediction mode based image decoding method according to an embodiment to which the present invention is applied.
  • 35 is a diagram illustrating an inter prediction apparatus according to an embodiment to which the present invention is applied.
  • 36 is a diagram illustrating an inter prediction apparatus according to an embodiment to which the present invention is applied.
  • FIG. 37 shows a video coding system to which the present invention is applied.
  • FIG. 38 illustrates a structure diagram 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), that is, 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 the luma component or a unit for the chroma component.
  • the processing unit may be a Coding Tree Block (CTB), Coding Block (CB), Prediction Block (PU) or Transform Block (TB) for luma components. May correspond to. Or coding for chroma components 2019/194498 1 »(: 1/10 ⁇ 019/003804
  • CTBs 12 tree blocks
  • CBs coding blocks
  • PUs prediction blocks
  • US transform blocks
  • the present invention is not limited thereto, and the processing unit includes units and chromas for luminance components. It may also be interpreted to include a unit for the component.
  • processing unit is not necessarily limited to square blocks,
  • It may be configured in the form of a polygon having three or more vertices.
  • a pixel, a pixel, and the like are referred to collectively as a sample.
  • using a sample may mean using a pixel value or a pixel value round.
  • 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 11, a transform unit 120, a quantization unit 130, an inverse quantization unit 140, an inverse transform unit 150,
  • the adder 15 may include an adder 15, a filter 160, a memory 170, an inter predictor 180, an intra predictor 185, and an entropy encoder 190.
  • the intra prediction unit 185 may be collectively referred to as a prediction unit, that is, the prediction unit may include an inter prediction unit 180 and an intra prediction unit 185.
  • the inverse quantization unit 140 and the inverse transform unit 150 may be included in the residual processing unit, and the residual processing unit may further include a subtraction unit 115.
  • the above-described image may be included.
  • the 13 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 an input image (or a picture or a 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 can be performed based on the final coding unit, which 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 be a Prediction Unit (PU) or a Conversion Unit (TU).
  • Transform Unit may be further included.
  • the eg unit and the transformation Units may be partitioned or partitioned from the last coding unit described above, 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 sample of M columns and N rows or a set of transform coefficients.
  • the sample may generally indicate a pixel or a value of a pixel, and may represent only a pixel / pixel value of a luma component or only a pixel / pixel value of a chroma 0 component.
  • a sample may be used as a term corresponding to one picture (or image) for a pixel or 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 residual signal, residual 5 blocks, residual sample array
  • the generated residual signal is transmitted to the converter 120.
  • a unit for subtracting the prediction signal (prediction block, prediction sample array) from the 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 0, that is, 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.
  • the prediction unit will be described later in the description of each prediction mode.
  • various kinds of information related to prediction such as prediction mode information, may be generated and transmitted 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 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 18 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 infer an example block for the current block f based on a reference block (reference sample array) specified by a motion vector on the reference picture.
  • the motion information may be predicted in units of blocks, sub-blocks, 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 additive motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information.
  • the neighboring block is a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • 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 called a co-located reference block, a co-located CU (cc ⁇ LCU), and the like, and a reference picture including the temporal neighboring block is collocated picture (colPic). It may be called.
  • 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 18 may use the motion information of the neighboring block as the motion information of the current block.
  • a residual signal may not be transmitted
  • MVP motion vector prediction
  • the motion vector of a neighboring block is used by using a motion vector predictor £-.
  • 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 transform unit 120 may generate transform coefficients # by applying a transform technique to the residual signal.
  • the transform schemes are Discrete Cosine Transform (DCT) and Discrete Sine. 0 2019/194498 1> (: 1/1 ( ⁇ 2019/003804
  • KLT Kerhunen ⁇ Loeve Transform
  • GBT Graph-Based
  • CNT Conditionally Non-linear Transform
  • GBT refers to a conversion obtained from this graph when the relationship information between pixels is represented by a graph.
  • CNT means a transform that is generated using and based on all previously reconstructed pixels, i.e., a signal.
  • the conversion process may be applied to a pixel block having the same size as a square, or may be applied to a block having a variable size rather than a square.
  • the quantization unit 13 may quantize transform coefficients and transmit them to the entropy encoding unit 190.
  • the entropy encoding unit 190 may encode and output a quantized signal (information about the quantized transform coefficients) as a bitstream.
  • the information about the quantized transform coefficients may be referred to as residual information, and the quantization unit 130 may reorder the quantized transform coefficients in block form into a one-dimensional vector form based on a coefficient scan order.
  • the information on the quantized transform coefficients may be generated based on the quantized transform coefficients in the form of the one-dimensional vector.
  • the entropy encoding unit 190 may include, for example, an exponential Golomb and a CAVLC ( various encoding methods such as context-adaptive variable length coding (CAC), context-adaptive binary arithmetic coding (CABAC), and the like.
  • CAC context-adaptive variable length coding
  • CABAC context-adaptive binary arithmetic coding
  • information necessary for video / image reconstruction for example, values of syntax elements, etc.
  • NAL network abstraction layer
  • NAL network abstraction layer
  • the bitstream may be transmitted over a network or may be stored in a digital storage medium.
  • the network may include a broadcasting network and / or a communication network, and 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 prediction 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. For example, the filtering unit 160 performs various filtering on the reconstructed picture. The method may be applied to generate a modified reconstructed picture, and the modified reconstructed picture may be stored in the memory 170, specifically, in 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. As described later in the description of each filtering method, 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.
  • the memory 170 DPB may store the modified reconstructed picture for use as a reference picture in the inter predictor 180.
  • the memory 170 may store the motion information of the block from which the motion information in the current picture is derived (or encoded) 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 180 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 185.
  • FIG. 2 is an embodiment to which the present invention is applied, and decoding of a video / image signal is performed.
  • a schematic block diagram of the decoding apparatus to be performed is shown.
  • the decoding apparatus 200 includes an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, an adder 23 23, a filter 240, a memory 250, and an interoperator.
  • the prediction unit 260 and the intra prediction unit 265 may be configured to include the inter prediction unit 260 and the intra prediction unit 265. 180) and an intra predictor 18.
  • the inverse quantizer 220 and the inverse transformer 230 may be collectively referred to as a residual processor.
  • the inverse transform unit 230 may include the entropy decoding unit 210, the inverse quantization unit 220, the inverse transform unit 230, the adder 23 23, the filter unit 240, and the inter prediction unit 260.
  • the intra prediction unit 265 may be configured by one hardware component (eg, a decoder or a processor) according to an embodiment.
  • One 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 encode the encoding of FIG. The apparatus may reconstruct an image corresponding to a process in which video / image information is processed, for example, the decoding apparatus 200 may perform decoding using a processing unit applied in the encoding apparatus.
  • the unit may be a coding unit, for example, and the coding unit may be divided along the quad tree structure and / or the binary tree structure from the coding tree unit or the largest coding unit, and decoded and output via the decoding apparatus 200.
  • the restored video signal can be reproduced through the reproducing apparatus.
  • the decoding device 200 bitstreams a signal output from the encoding device of FIG. It may be received in the form, 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 the information in the 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 the bitstream, and decodes the syntax element information and decoding information of the neighboring and decoding target blocks or information of the symbol / bin decoded in the previous step.
  • a context model may be determined using the context model, the probability of occurrence of a bin may be predicted according to the determined context module, 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 a prediction unit (the inter prediction unit 26 and the intra prediction unit 265), and the register where the entropy decoding is 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 quantization unit 220. Also, information about filtering among information decoded by the entropy decoding unit 210 may be transmitted to the filtering unit 240. Meanwhile, a receiver (not shown) for receiving 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 configured of the entropy decoding unit 210. May be an element have.
  • 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 22 may perform inverse quantization on quantized transform coefficients using a quantization parameter (for example, quantization step size information), and obtain transform coefficients.
  • a quantization parameter for example, quantization step size information
  • the inverse transform unit 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 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.
  • the intra predictor 26 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
  • the inter prediction unit 2 6 is a reference specified by a motion vector on the reference picture ⁇ ⁇ 02019/194498 1 > 0 '/ 1? 2019/003804
  • 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 predicate 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 23 is configured to add 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). 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 block to be processed in the current picture, and may be filtered to inter prediction of a next picture as described below. 2019/194498 1 »(: 1/102019/003804
  • the filtering unit 240 may improve subjective / objective picture quality by applying filtering to the reconstruction signal. For example, the filtering unit 240 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 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, and a bilateral filter.
  • 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 25 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 have already been reconstructed.
  • the stored motion information may be the motion information of the spatial neighboring block.
  • the memory 170 may store reconstructed samples of reconstructed blocks in the current picture, and transmit the intra reconstructed sample to the intra prediction unit 265 to use the motion information of the temporal neighboring block. .
  • 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.
  • Block Partitioning 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 partitioner 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 a 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.).
  • a series of procedures eg, prediction and residual
  • 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.
  • Partitioniq of the CTUs using a tree structure CTU can be partitioned into examples based on a quad-tree (QT) structure.
  • the quadtree structure may be called 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.
  • BT binary tree
  • TT ternary 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 partition 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 split types 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.
  • the leaf nodes of the multitype tree structure may be called sons. Such 0 2019/194498 1 > (171 1 ⁇ 019/003804
  • CU, PU in the present document may have the same block size. 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 TU7 ⁇ 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 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) 7> is signaled to indicate whether the node is additionally partitioned. If the corresponding node is additionally partitioned, a second flag (ex. Mtt_split_cu_verticla_flag) may be signaled to indicate the splitting direction. Thereafter, a third flag (ex.
  • Mtt_split_cu_binary_flag may be signaled to indicate whether the partition type is a binary partition or a ternary partition. For example, based on the mtt_split__cu_vertical_flag and the mtt_split_cu_binary_flag, a multi-type tree splitting mode (MttSplitMode) of may be derived as shown in Table 1 below.
  • FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple ones according to an embodiment to which the present invention may be applied based on a quadtree and a accompanying multi-type tree structure.
  • 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 case of 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. 2019/194498 1 »(: 1/10 ⁇ 019/003804
  • CTU size the root node size of a quaternary tree
  • MaxBtSize the maximum allowed binary tree root node size
  • MinBtSize the minimum allowed binary 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 is set to 16x16
  • MaxBtSize is set to 128x128 and '
  • MaxTtSzie is set to 64x64
  • MinBtSize and MinTtSize is a 4x4
  • MaxMttDepth can be set to four.
  • 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 range from 16x16 size (ie the MinOTSize) to 128x128 size (ie the CTU You can have it. If the leaf node is 128x128, it may not be further divided into a binary tree / a ternary tree. This is because in this case even if split, it exceeds MaxBtsize and MaxTtszie (ie 64 64). 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 map (mttDepth) 0 value. If the multitype tree depth reaches MaxMttdepth (ex.
  • the stock price split may no longer be considered. If the width of the multitype tree node is equal to MinBtSize and less than or equal to 2xMinTtSize, then no further horizontal split may be considered. If the height of the multitype tree node is equal to MinBtSize and is less than or equal to 2xMinTtSize, then the main vertical split may no longer be considered.
  • FIG. 6 is a diagram illustrating a method of limiting ternary-tree partitioning 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, 64), TT partitioning may be limited as shown in FIG. 6.
  • a predetermined specific value e.g, 32, 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. Can be.
  • luma and chroma blocks may have a separate blocktree structure from each other. If an individual block tree mode is applied, the luma CTB may be divided into CUs based on a specific coding tree structure, and the chroma may be divided into chroma CUs based on another coding tree structure. This may mean that (in I slice is composed of a coding block of luma component or coding blocks of two chroma components, and a CU of P or B slice may be composed of blocks of three color components).
  • Partitionig of the CTUs using a tree structure has been described with reference to a quadtree coding tree structure accompanied by an ash multitype tree, but a structure in which a CU is divided is not limited thereto.
  • a BT structure and a TT structure may be interpreted as a concept included in a multiple partitioning tree (MPT) structure, and a CU may be interpreted as being divided through a QT structure and an MPT structure.
  • MPT multiple partitioning tree
  • a syntax element eg, MPT_split_type
  • MPT_split_type a syntax element that contains information about how many blocks the leaf node of the QT structure is divided into and the leaf node of the QT structure are vertical
  • a syntax element that contains information about which direction is split, horizontal or horizontal for example,
  • MPT_split_mode is signaled so that the partition structure can be determined.
  • 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 map is divided into one-fourth the size of the CU of the upper depth, or the CU of the lower map is divided into one-half size of the example of the upper map according to the BT structure, or the lower according to the TT structure Maps CU7> Unlike subdivision to one-quarter or one-half the size of the CUs of the parent map, the parent of the child maps, if known 2019/194498 1 »(: 1/10 ⁇ 019/003804
  • the tree node block restricts all coded its samples to be placed within the picture boundaries. Can be. 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 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 are sometimes potentially the same coding block. Can result in structure. 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.
  • 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.
  • a picture (slice) using a picture (predictive picture) or a P picture (slice), up to two motion vectors, and a reference index may be referred to as a pair, that is, a picture (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 example)
  • Inter prediction means an example, that is, a 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 eliminating redundancy existing between pictures, and is mostly performed through motion estimation and motion compensation.
  • the decoder may be represented by the inter prediction based video / image decoding method of FIG. 10 and the inter prediction unit of the decoding apparatus of FIG.
  • 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 is the data elements of picture (s) other than the current picture. Predictions that are guided in a manner dependent on 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 refers to the same location
  • a block may be referred to as a collocated reference block, a co-located CU (colCU), or the like.
  • a reference picture including the temporal neighboring block may be called a collocated picture (colPic).
  • a motion information candidate-list may be constructed based on neighboring blocks of the current block, indicating which candidates are selected (used) to derive the motion vector and / or reference picture index of the current block. Flag 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.
  • the motion vector of the 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.
  • 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. Specifically, S802 is determined by the subtracting unit 115 of the encoding apparatus. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • the prediction policy is derived by the inter prediction unit 180 and may be encoded by the entropy encoding unit 190.
  • the residual information may be derived by the residual processing unit 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 in an entropy encoding unit 19 through a residual coding procedure.
  • the encoding apparatus performs inter prediction on the current block (3801).
  • 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 may be used.
  • the prediction mode for the current block may be determined
  • the motion information derivation unit 182 may derive the motion information of the current block
  • the prediction sample derivation unit 183 may derive the motion samples of the current block.
  • the inter prediction unit 180 of the encoding apparatus estimates the motion !! Through estimation, a block similar to the current block may be searched in a predetermined area (search area) of reference pictures, and a reference block having a difference from the current block is less than or equal to a predetermined criterion. Based on this, 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 the RD cost for the various example modes and determine the 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) MVP candidate list to be described later, and among (A) Mvp (motion vector predictor) candidates included in the 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 motion estimation may be used as the motion vector of the current block, and among the mvp candidates
  • An mvp candidate having a motion vector having the smallest difference from the motion vector may be the selected mvp candidate.
  • Motion vector difference (MVD) which is the difference of the motion vector of the current block minus mvp Can 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 guide residual samples based on the above-described 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 about 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), which is information to guide a motion vector.
  • the information about the motion information may include the information on the above-described MVD and / or reference picture index information.
  • the information about the motion information may include information indicating whether L0 prediction, L1 prediction, or pair (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 is stored in a (digital) storage medium and transmitted to a decoding device. 0 2019/194498 1 > (: 1 '/ 1? 2019/003804
  • 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. Therefore, 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 are diagrams illustrating an inter prediction based video / image decoding method according to an embodiment of the present invention, and an inter-example part 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 yes or yes on the current block based on the received prediction information and may eg sample.
  • 31001 to 31003 may be performed by the inter prediction unit 260 of the decoding apparatus, and residual information of 004 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 performs an inverse transform on the transform coefficients to obtain residual samples for the current block. Can be derived.
  • 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 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 the 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 is included in the (A) MVP candidate list.
  • the motion vector of the selected mvp candidate among the motion vector predictor (mvp) candidates may be used as the 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 about the MVD
  • the motion vector of the current block may be derived based on mvp and the MVD of the current block.
  • the reference picture index of the current block may be derived based on the reference picture index information.
  • the 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 determiner 261, a motion information derivation unit 262, and a prediction sample derivation unit 263.
  • the prediction mode for the current block is determined based on the prediction mode information received by the mode determining unit 261, and the motion information of the current block is based on the information about the motion information received by the motion information deriving unit 262. (A motion vector and / or a reference picture index, etc.) may be derived, 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 generate a reconstructed picture based on the reconstructed picture.
  • the procedure may be further applied as described above.
  • the inter prediction process may include an inter prediction mode determination step, motion information derivation step according to the determined prediction mode, and prediction execution (prediction sample generation) step based on the derived motion information. Determination of inter prediction mode Various inter prediction modes may be used for prediction of a current block in a picture. For example, various modes, such as merge mode, skip mode, MVP mode, and affine mode, may be used. Decoder side motion vector refinement (DMVR) mode, adaptive motion vector resolution (AMVR) mode, and the like may be further used as a secondary mode. The affine mode may be called an affine motion prediction mode.
  • MVP mode may be called an affine motion prediction mode.
  • AMVP Advanced mot ⁇ on vector prediction
  • 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.
  • the skip flag is signaled to indicate whether to apply the skip mode, and if the skip mode is not applied, the merge flag is signaled to indicate whether to apply the merge mode, and if the merge mode is not applied, the 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. Derivation of motion information according to inter prediction mode
  • 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, Through this, motion information can be derived. 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. Merge mode and skip 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, but the motion information of the current prediction block is derived using the motion information 1 ⁇ 2 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 can search the merge candidate block 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 a tile group header), but the present invention is not limited thereto.
  • the encoder is a merge candidate A list may be generated, and the merge candidate block having the smallest cost among them may be selected 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
  • One temporal merge candidate can be used.
  • 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 corner 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 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 decoder search the five blocks shown in FIG. 12 in the order of Al, Bl, BO, AO, and B2 to obtain the available stubs. 0 2019/194498 1 »( ⁇ / 10 ⁇ 2019/003804
  • It can be indexed 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, that is, the corner peripheral block and the lower right corner 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 of 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 based on the motion information of the covering prediction block Candidates can be derived.
  • the constant storage unit is 2nx2n sample units
  • the modified positions ((xTnb >> n) ⁇ n) and (yTnb >> n) motion information of a block located at ⁇ n)
  • the temporal merge candidate may be used for the temporal merge candidate.
  • the constant storage unit is a 16x16 sample unit
  • the coordinates of the temporal neighboring block are (xTnb, yTnb), the modified position ((xTnb »4) « 4), (yTnb> Motion information of the prediction block located at ⁇ 4 >) < ⁇ 4) can be used for the temporal merge candidate.
  • the constant storage unit is 8x8 sample units
  • the coordinate of the temporal neighboring block is (xTnb, yTnb), the modified position ((xTnb »3) « 3)
  • 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.
  • 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. After the maximum number of merge candidates has been 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 be, for example, ATMVP, combined bi-predictive merge turbo (if the slice type of the current slice is type B). 2019/194498 1 »(: 1/10 ⁇ 019/003804
  • 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 thereon.
  • the motion vector and / or the temporal neighboring block (or Col block) of the reconstructed spatial neighboring block (for example, may be the neighboring block described above with reference to FIG. 12).
  • a motion vector predictor (mvp) 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 bitstram 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 may 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.
  • motion vector predictor candidate The list may be configured as shown in FIG. 14.
  • the DMVR is a method of performing a motion example, ie, refinement of motion information obtained from neighboring blocks at a decoder.
  • a motion example ie, refinement of motion information obtained from neighboring blocks at a decoder.
  • the decoder improves through cost comparison based on the example block (or example sample array, eg template) generated using the motion information of the neighboring blocks in the merge / skip mode.
  • Refined motion information # can be derived.
  • the encoder / decoder may apply a DMVR process to improve the motion vector to correct this error.
  • the DMVR process can be invoked to improve the accuracy of the initial motion compensation prediction (ie motion compensation prediction through merge / skip mode).
  • 15 is a flowchart illustrating a method of generating an inter prediction block by applying a DMVR as an embodiment to which the present invention may be applied.
  • a decoder is mainly described for convenience of description, but the present invention is not limited thereto.
  • the method of generating an inter prediction block according to an embodiment of the present invention may be performed in the same manner in the encoder and the decoder.
  • the decoder is to apply bidirectional prediction to the current block, the first block of the current block A initial motion vector and a second initial motion vector are derived (501).
  • the decoder when the bidirectional prediction is applied to the current block, and the current picture is located between two reference picture lists based on a picture order count (POC) indicating an output order of the pictures, the decoder
  • the DMVR process according to the embodiment of the present invention may be applied.
  • the decoder applies bidirectional prediction to the current block, the current picture is located between two reference pictures based on the POC, and the distance between the two reference pictures and the current picture is the same, an embodiment of the present invention DMVR process can be applied.
  • the decoder derives the first final motion vector (or the improved motion vector) and the second final motion vector (or the improved motion vector) by improving the first initial motion vector and the second initial motion vector (S1502).
  • the decoder may improve the first initial motion vector and the second initial motion vector by using a motion vector offset value that is symmetric with respect to the reference list direction.
  • the motion vector offset value represents a value added (or subtracted) to the initial motion vector, and may be referred to as a motion vector difference value.
  • the decoder generates a first example block using the first final motion vector, and generates a second example block using the second final motion vector (S1503).
  • the decoder generates a third prediction block representing the prediction block of the current block by using the first prediction block and the second prediction block (S1504).
  • Example 1
  • an object of the present invention is to propose a method for improving the decoding complexity due to a memory patch while maintaining an improved compression efficiency through a motion vector derivation technique at the decoder side.
  • MPCR merge prediction candidate reordering
  • the encoder / decoder may derive a motion vector using a limited number of reference pictures.
  • FIG. 16 is a diagram for describing a problem occurring in a conventional inter prediction method as an embodiment to which the present invention may be applied.
  • candidates configured by using motion information of neighboring blocks may have different reference pictures, as shown in FIG. 16.
  • a predictor ie, inter predicted sample, block
  • a predictor may be more effective when generated based on many reference pictures.
  • this causes a problem that requires frequent memory patches.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures. It demonstrates with reference to the following drawings.
  • 17 is a diagram illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures.
  • the fixed number is one, but the present invention is not limited thereto, and a specific number of reference pictures may be fixed.
  • the fixed reference picture (which may be referred to as a target reference picture in the present invention) is a second reference picture.
  • the encoder / decoder may derive four motion prediction candidates for motion estimation / compensation.
  • the encoder / decoder may use only a candidate referring to the second reference picture which is a fixed reference picture as the final motion prediction candidate.
  • the encoder / decoder may derive four motion prediction candidates for motion estimation / compensation.
  • the encoder / decoder is a fixed reference
  • a candidate referring to a second reference picture that is a picture a corresponding motion vector is used as it is, and a motion vector of a candidate referring to a picture other than the second reference picture is scaled by the second reference picture to obtain a scaled motion vector.
  • the branch may constitute a final motion prediction candidate as a candidate.
  • the scaling may be performed based on a difference of a picture order count (POC) from the current picture.
  • POC picture order count
  • FIG. 18 is a diagram illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures.
  • the fixed number is one, but the present invention is not limited thereto, and a specific number of reference pictures may be fixed.
  • the fixed reference picture is a collocated located picture.
  • the collocated picture may be referred to as a col picture.
  • the encoder / decoder may derive four motion prediction candidates for motion estimation / compensation.
  • the encoder / decoder may configure a final motion prediction candidate as a candidate having a scaled motion vector by scaling the motion vectors of four motion prediction candidates with the call picture. As an example, the scaling may be performed based on a POC difference with the current picture.
  • the method described above with reference to FIGS. 17 and 18 may be applied to derive an ATMVP candidate. That is, to derive motion information from a temporal reference picture When derived at the side, multiple reference pictures can be referenced. in this case, The motion vector can be scaled from temporal motion information to the target reference picture.
  • the target reference picture may be explicitly selected (or determined) by syntax signaling or may be implicitly selected (or determined) by the POC.
  • the method described above with reference to FIGS. 17 and 18 can be applied to derive unilateral motion information.
  • This embodiment can be adopted in a unidirectional way.
  • the unidirectional motion information method can derive a motion vector from the motion of the reference picture through reverse mapping, and since this method can also have many reference pictures, the proposed method can be applied.
  • Example 1-2
  • a motion vector refinement process by merge prediction candidate reordering may be applied to one fixed reference picture. That is, the improvement process of the MPCR may be applied to the reference picture referenced by the candidate.
  • this process introduces memory bandwidth issues.
  • the reference picture may be predefined (or syntax signaling), and a refinement process may be applied to the predefined reference picture.
  • the encoder / decoder may scale the motion data of the candidate with a predefined reference picture. It demonstrates with reference to the following drawings. 19 and 20 are diagrams illustrating a method of using a fixed number of reference pictures in performing motion estimation / compensation according to an embodiment to which the present invention is applied. Referring to FIG. 19, the encoder / decoder may construct a motion information candidate list using motion information of neighboring blocks A, C, and E of the current block. In this case, it is assumed that the neighboring blocks A, C, and E refer to a first reference picture, a second reference picture, and a third reference picture, respectively.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures.
  • the fixed number is assumed to be 1, but the present invention is not limited thereto, and a specific number of reference pictures may be fixed.
  • the fixed reference picture is a call picture.
  • the encoder / decoder scales the motion vector of the motion prediction candidate derived in FIG. 19 to the call picture to form a final motion prediction candidate as a candidate having a scaled motion vector for motion estimation / compensation.
  • the motion information of A, C, and E candidates included in the final motion information candidate list may include a scaled motion vector and a call picture, respectively.
  • the scaling may be performed based on a POC difference with the current picture.
  • FIG. 21 is a diagram for describing a method of refining a motion vector derived using a neighboring block as an embodiment to which the present invention is applied.
  • the encoder / decoder may scale a motion vector derived from a neighboring block to a call picture, as in the examples of FIGS. 19 and 21, and initialize the position specified by the scaled motion vector. to the initial point You can configure and perform the ref inement process.
  • the encoder / decoder may derive the improved motion vector based on the cost value of the template region as shown in FIG. 21.
  • the cost value may be calculated using a difference value between the template region around the block to which the reference picture is specified and the template region around the current block.
  • the template region may include a block left region and an upper region.
  • the encoder / decoder may search for a motion vector having a minimum cost value by using bi linear interpolation filtering.
  • the reference picture may be defined by POC or syntax signaling.
  • POC Physical Organic Chemical Vapor Characterization
  • the nearest picture may be selected as the reference picture.
  • the syntax of Table 2 below may be used.
  • col located_f rom_10_f lag is a syntax element indicating whether a call picture used for temporal motion vector prediction is derived from reference picture list 0.
  • FIG. collocated re f idx is a time motion vector 2019/194498 1 »(1 ⁇ 1 ⁇ 2019/003804
  • Example 1-3 A syntax element indicating a reference picture index of a call picture used for 60.
  • a memory patch method using a limited reference picture is proposed to improve memory burden.
  • the decoder may apply decoder-side motion compensation by random motion. This can lead to frequent memory patching processes.
  • 22 is a diagram illustrating a method of using a fixed number of reference pictures to perform motion estimation / compensation according to an embodiment to which the present invention is applied.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures.
  • the fixed number is one, but the present invention is not limited thereto, and a specific number of reference pictures may be fixed.
  • the encoder / decoder may derive motion prediction candidates using neighboring blocks for motion estimation / compensation.
  • the encoder / decoder may scale the motion vector of the derived candidates to the set reference picture. That is, the encoder / decoder may use candidates referring to the target picture which is a fixed reference picture as the final motion prediction candidate.
  • the encoder / decoder since a candidate can be configured using one reference picture, the encoder / decoder is not shown in FIG. 22 but is different from each other's reference pictures in order to perform motion estimation / compensation. Only fixed reference pictures can be patched. If the search area in the motion vector improvement processor If a range) is predefined, the encoder / decoder may patch only the search area determined based on the motion vector (scaled motion vector) of the candidates in the reference picture. As a result, according to the present embodiment, the compression efficiency can be improved by improving the memory patch.
  • the encoder / decoder may determine the priority for the motion / estimation compensation process of candidates based on the similarity of the motion vectors. For example, as shown in FIG. 22, the range of motion compensation for four candidates may be concentrated and the range of motion compensation for one candidate may be isolated. In this case, since the predicted block can be generated in a more frequent cache hit, the encoder / decoder can apply the motion compensation process for the four candidates sequentially first, thereby improving memory efficiency. .
  • FIG. 23 is a diagram illustrating a method of using a fixed number of reference pictures to perform motion estimation / compensation according to an embodiment to which the present invention is applied.
  • the encoder / decoder may perform motion estimation / compensation using a fixed number of reference pictures. In FIG. 22, it is assumed that the fixed number is two.
  • the encoder / decoder may determine the priority for the motion / estimation compensation process of candidates based on the similarity of the motion vectors.
  • FIG. 23 it is assumed that three candidates refer to a first reference picture and two candidates refer to a second reference picture.
  • the encoder / decoder assigns a higher priority for the motion / estimation compensation process to the three candidates referencing the first reference picture, and the second Two candidates referencing the reference picture may be assigned a lower priority for the motion / estimation compensation process.
  • Example 2
  • An object of the present invention is to propose a cost calculation method for deriving a motion information candidate at the decoder side.
  • An object of the present invention is to propose a method of deriving / signaling an Illumination Compensation (1C) flag.
  • the 1C flag may be derived without additional syntax at the decoder side and may be signaled separately from the encoder. If the motion information is derived without the 1C flag signaled at the decoder side, it may be influenced by the cost calculation method. Therefore, the present invention proposes a method for solving this problem by selecting an effective cost calculation method.
  • an illumination compensation (IC) (or local illumination compensation) method for deriving a motion information candidate at a decoder side is proposed.
  • 1C is a method of improving a prediction value based on a linear model of illuminance change.
  • Equation 1 may be used to generate an improved predictor.
  • Equation 1 a represents a scaling factor and b represents an offset value. Each parameter may be derived at the decoder side.
  • x represents a prediction sample (or prediction block) of the reference picture, and Y represents a prediction sample improved by applying 1C.
  • the decoder may use a template as shown in FIG. 24 to derive the a and b values.
  • the decoder may use an already reconstructed area (or reconstructed sample) around the current block as a template (or a template area).
  • the decoder may use a reconstructed region (or reconstructed sample) corresponding to the same position in the reference picture as a template.
  • the decoder may induce a and b values using Equation 2 below based on the reconstructed sample value of the template.
  • Example 2-2 It can be set to either width or height, and 3 ⁇ 4 represents a correlation constant.
  • Example 2-2 It can be set to either width or height, and 3 ⁇ 4 represents a correlation constant.
  • a cost calculation method for deriving a motion information candidate is proposed.
  • the encoder / decoder may select a cost calculation method from a sum of absolute difference (SAD) and a tuned-SAD (SAD) according to a predetermined condition.
  • SAD represents the sum of absolute value differences.
  • the SAD may be calculated using a sum of absolute difference values of pixel values between templates.
  • the tuned-SAD may be calculated based on the difference value between the average value of the template and the pixel value in order to significantly reduce the computational complexity.
  • the tuned-SAD may be referred to as Mean Sum of Absolute Difference (MRSAD).
  • MRSAD Mean Sum of Absolute Difference
  • the cost value using tuned-SAD may be calculated using the following equation.
  • the cost value using 1: 11] 1601-3 yo0 is obtained by subtracting the average value (average value of the template of the current block) from the sample value of the template in the current block and the sample in the template of the reference block. It can be calculated as the sum of the absolute differences between the values subtracted from the mean value (mean value of the template of the reference block).
  • the technique may compensate for the luminance difference on the decoder side based on the weight and the offset.
  • this motion estimation / compensation Applying the technology can increase the complexity overhead.
  • the encoder / decoder is designed to maintain an improved effect without increasing complexity. Applicable Detailed embodiments will be described below.
  • FIG. 25 is a diagram illustrating a method of performing motion estimation / compensation based on whether a motion information candidate is applied to 1 (:) as an embodiment to which the present invention is applied.
  • the encoder / decoder constructs a motion information candidate list (or motion prediction candidate list), and the candidate in the candidate list has Indicating whether or not Motion estimation / compensation may be performed based on the flag value.
  • the encoder / decoder has at least one candidate Whether or not the flag value is 1 may determine the cost calculation method for the candidate.
  • the encoder / decoder constructs (or generates) a motion information candidate list (32501).
  • the motion information candidate list may be referred to by various names according to the inter prediction mode, but the present invention is not limited thereto.
  • the motion information candidate list may include a merge candidate list, (or It may be referred to as a candidate list, a subblock merge candidate list, an affine merge candidate list, or the like.
  • the motion information candidate list according to the present invention may include a merge candidate list, ⁇ ⁇ 02019/194498 1 »0 '/ 1? 2019/003804
  • ⁇ It may include a grave (or a 7 / US candidate list, a subblock merge candidate list, an affine merge candidate list, and the like).
  • the encoder / decoder checks whether there is a candidate having a 10 flag with a value of 1 among candidates included in the motion information candidate list (32502).
  • the encoder / decoder calculates the calculated cost value and selects the optimal motion information.
  • the encoder / decoder calculates the cost value of all candidates in the motion information candidate list using large) (£ 2506, 32507).
  • the encoder / decoder selects the optimal motion information by calculating the calculated cost value (2508).
  • the encoder / decoder applies steps £ 2502 to £ 2508 for all candidates in the motion information candidate list, and selects the best candidate (k 2509, 32510).
  • FIG. 26 illustrates an embodiment to which the present invention is applied and includes a motion information candidate.
  • FIG. 9 is a diagram illustrating a method of performing motion estimation / compensation based on whether or not.
  • an encoder / decoder constructs a motion information candidate list (or a motion prediction candidate list), and a candidate in the candidate list Indicating whether or not Motion estimation / compensation may be performed based on the flag value.
  • the encoder / decoder may determine a cost calculation method for the candidate according to whether the flag value of at least one or more candidates is one.
  • FIG. 26 repeated descriptions with FIG. 25 described above will be omitted.
  • Higher level syntax which indicates whether 1C technology is allowed for the conditions in step S2602, may also be considered.
  • the encoder / decoder constructs (or generates) a motion information candidate list (S2601), and among the candidates included in the motion information candidate list, whether there is a candidate having a 1C flag having a value of 1, and through a higher level syntax.
  • Check whether the 1C technology being signaled is allowed (S2602).
  • the syntax (or syntax element) indicating whether the above-described 1C technology is allowed may include a video parameter set (VVS), a sequence parameter set (SPS), a picture parameter set (Picture Parameter). Set, PPS), Slice Header (SH) (or Tile Group Header (TGH) syntax) can be signaled via syntax.
  • the encoder / decoder uses tuned-SAD to determine the cost values of all candidates in the motion information candidate list. (S2603, S2604).
  • the encoder / decoder selects the optimal motion information by calculating the calculated cost value (S260 ⁇ ).
  • an encoder / decoder using the SAD and calculates the cost values of all the candidates in a motion information candidate list (S2606, S2607).
  • the encoder / decoder selects the optimal motion information by calculating the calculated cost value (S2608).
  • the best candidates can be selected from the candidate list, and an improvement process can be applied at the decoder side to obtain improved motion information based on the selected candidate.
  • FIG. 27 is a diagram illustrating a method of motion estimation / compensation based on whether 1C of a motion information candidate is applied as an embodiment to which the present invention is applied.
  • the encoder / decoder selects (or determines) an optimal candidate in a motion information reporting list (or a motion prediction candidate list) and performs motion estimation / compensation based on a 1C flag value of the selected candidate.
  • the encoder / decoder may determine a cost calculation method for the candidate according to whether the 1C flag value of the selected candidate is one.
  • the encoder / decoder constructs (or generates) a motion information candidate list (S2701).
  • the motion information candidate list may be referred to by various names according to the inter prediction mode, but the present invention is not limited thereto.
  • the motion information candidate list may be referred to as a merge candidate list, an MVP (or AMVP) candidate _ list, a subblock merge candidate list, an affine merge candidate list, and the like.
  • the motion information candidate list of the present invention may include a merge candidate list, an MVP (or AMVP) candidate list, a subblock merge candidate list, an affine merge candidate list, and the like. 02019/194498 1 »(1 ⁇ 1 ⁇ 2019/003804
  • the encoder / decoder selects an optimal candidate from the motion information candidate list through the motion estimation / compensation process (32703, 32704).
  • the encoder / decoder has the selected candidate Checks whether the flag value is 1 (2705).
  • the encoder / decoder calculates the cost value of the candidate using pre- (32706).
  • the encoder / decoder Calculate the cost value of the candidate (32707).
  • FIG. 28 is a diagram illustrating a method of motion estimation / compensation based on whether a motion information candidate is applied as an embodiment to which the present invention is applied.
  • the encoder / decoder selects (or determines) an optimal candidate in a motion information candidate list (or a motion prediction candidate list), and performs motion estimation / compensation based on 10 flag values of the selected candidate. can do.
  • the encoder / decoder may determine a cost calculation method for the candidate according to whether the flag value of at least one candidate in the motion information candidate list is 1 or not.
  • a description overlapping with the description of FIG. 27 will be omitted.
  • Steps 32801 to 32804 may be performed in the same manner as steps 32701 to £ 2704 of FIG. 27.
  • the encoder / decoder has a value of 1 in the motion information candidate list. Checks whether the number of candidates with flags is greater than zero.
  • the encoder / decoder calculates the cost value of the candidate using the staple-size! (32706). If it is less than 0, 02019/194498 1 »(1 ⁇ 1 ⁇ 2019/003804
  • the 70 encoder / decoder uses the size to calculate the cost value of the street candidate (£ 2807).
  • the encoder / decoder is a motion information candidate. Of the current block based on the flags Can be signaled or derived.
  • FIG. 29 is a diagram for describing a method of determining whether to apply 1 (:) of a processing block based on whether a motion information candidate is applied according to an embodiment to which the present invention is applied.
  • the encoder / decoder constructs (or generates) a motion information candidate list (32901).
  • the motion information candidate list may be referred to by various names according to the inter prediction mode, but the present invention is not limited thereto.
  • the motion information candidate list may include a merge candidate list, (Or a candidate list, a sub-block merge candidate list, an affine merge candidate list, etc.)
  • the motion information candidate list according to the present invention may include a merge candidate list, (Or a candidate list, a sub-block merge candidate list, an affine merge candidate list, etc.).
  • the encoder / decoder checks whether a candidate exists in the motion information candidate list (M2902). As a result of the check, if a candidate exists, an index indicating a specific candidate used for inter prediction of the current block is parsed from the motion information candidate list (32903). The encoder / decoder sets the compare flag value of the candidate indicated by the index to the flag value of the current block (32904). That is, whether the encoder / decoder is applied to the candidate used for inter prediction of the current block. It may be determined whether to apply 1C to the current block.
  • FIG. 30 is a diagram illustrating a method of determining whether a processing block is applied to 1C based on whether 1C of a motion information candidate is applied according to an embodiment to which the present invention is applied.
  • steps S2901 to S2903 are described with reference to FIG. 29.
  • the encoder / decoder parses a 1C flag indicating whether 1C is applied to the current block (S3004).
  • FIG. 31 is a diagram for explaining a method of determining whether a processing block is applied to 1C based on whether a motion information candidate is applied to 1C according to an embodiment to which the present invention is applied.
  • the 1C flag may be derived by applying the 1C flag condition described above with reference to FIG. 25 or 26.
  • the encoder / decoder constructs (or generates) a motion information candidate list (S3101), and among the candidates included in the motion information candidate list, whether there is a candidate having a 1C flag having a value of 1 and through high level syntax. It is checked whether the 1C technology being signaled is allowed (S3102).
  • the syntax (or syntax element) indicating whether the above-described 1C technology is allowed may include a video parameter set (VVS), a sequence parameter set (SPS), a picture parameter set (Picture Parameter).
  • the encoder / decoder sets the candidate's 1C flag value to the 1C flag value of the current block. (S3103).
  • the encoder / decoder sets the 1C flag value of the current block to 0 (S3104).
  • the encoder / decoder applies steps S3102 to S3104 for all candidates in the motion information candidate list, and selects an optimal candidate (S3105, S3106).
  • 32 is a diagram illustrating a method of determining whether a processing block is applied to 1C based on whether 1C of a motion information candidate is applied according to an embodiment to which the present invention is applied.
  • the 1C flag may be derived by applying the 1C flag condition described above with reference to FIG. 25 or 26.
  • the encoder / decoder constructs (or generates) a motion information candidate list (S3201).
  • the encoder / decoder checks whether the 1C technology signaled through the high level syntax is allowed (S3202).
  • the syntax (or syntax element) indicating whether the above-described 1C technology is allowed may include a video parameter set (VVS), a sequence parameter set (SPS), a picture parameter set (Picture Parameter). Set, PPS), Slice Header (SH) (or Tile Group Header (Tile Group Header, TGH)) can be signaled via syntax. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • the encoder / decoder has a value of 1 among the candidates included in the motion information candidate list. Check whether there is a candidate with a flag (3203).
  • the value is 1 If there is a candidate with a flag, the encoder / decoder sets the candidate's 10 flags of the current block. Set by flag (£ 3204).
  • the value is 1 If there are no candidates with flags, the encoder / decoder Parse the flag (33206) and return the current block Set the value parsed by the flags.
  • the encoder / decoder applies steps 33202 to £ 3208 for all candidates in the motion information candidate list, and selects an optimal candidate (M3205, 33209).
  • an optimal candidate M3205, 33209.
  • FIG. 33 is a flowchart illustrating an inter prediction mode based image encoding method according to an embodiment to which the present invention is applied.
  • the description will be made based on the encoder.
  • the present invention is not limited thereto, and the inter prediction mode based image processing method according to the embodiment of the present invention may be performed in the same manner in the encoder and the decoder. .
  • the encoder generates a motion information candidate list of the current block based on the motion information of the spatial neighboring block or the temporal neighboring block of the current block (33301).
  • the encoder has candidates included in the motion information candidate list.
  • a cost calculation method for the candidates is determined based on an Illumination Compensation (1C) flag (S3302).
  • the encoder calculates cost values of the candidates based on the determined cost calculation method (S3303).
  • the encoder selects an optimal candidate for inter prediction of the current block from the motion information candidate list based on the calculated cost value (S3304).
  • the cost calculation method may be determined by any one of a sum of absolute difference (SAD) method and a tuned SAD method.
  • SAD sum of absolute difference
  • the tuned SAD scheme may include a difference value between an average value of a template of the current block and a sample value of the current block and a template of a reference block specified by the candidate.
  • the template of the current block includes reconstructed samples adjacent to the left and top sides of the current block, and the template of the reference block is the left side of the reference block And a reconstructed sample adjacent to the upper side.
  • the method described in Equation 3 may be used.
  • the determining of the cost calculation method may include: when the at least one candidate having the 1C flag value is 1 among the candidates included in the motion information candidate list, the tuned SAD method. Is determined as a cost calculation method for the candidates, and at least one candidate having the 1C flag value of 1 is selected from the candidates included in the motion information candidate list. If not, the SAD method may be determined as a cost calculation method for the candidates.
  • the tuned The SAD method is determined as a cost calculation method for the candidates, and at least one candidate having the 1C flag value of 1 is not among the candidates included in the motion information candidate list, or 1C application is not allowed to the current block.
  • the SAD method may be determined as a cost calculation method for the candidates.
  • the method may further include parsing a syntax element indicating whether 1C application is allowed in the current block, wherein the syntax element indicating whether the 1C application is allowed is a video parameter set ( It may be signaled through a Video Parameter Set, a Sequence Parameter Set, a Picture Parameter Set (PPS), or a Tile Group Header syntax.
  • a syntax element indicating whether 1C application is allowed is a video parameter set ( It may be signaled through a Video Parameter Set, a Sequence Parameter Set, a Picture Parameter Set (PPS), or a Tile Group Header syntax.
  • 34 is a flowchart illustrating an inter prediction mode based image decoding method according to an embodiment to which the present invention is applied.
  • a decoder is mainly described, but the present invention is not limited thereto, and the inter prediction mode based image processing method according to the embodiment of the present invention may be performed in the same manner in the encoder and the decoder. .
  • the decoder generates a motion information candidate list of the current block based on the motion information of the spatial neighboring block or the temporal neighboring block of the current block (S3401).
  • the decoder checks whether a candidate having an IC (Illumination Compensation) flag having a value of 1 exists among candidates included in the motion information candidate list (S3402).
  • the decoder derives a 1C flag indicating whether 1C is applied to the current block based on the verification result (S3402).
  • the 1C flag of the candidate if a candidate having a 1C flag having a value of 1 exists among candidates included in the motion information candidate list, the 1C flag of the candidate is present. A value is set to a 1C flag value of the current block, and if there is no candidate having a 1C flag having a value of 1 among candidates included in the motion information candidate list, a 1C flag value of the current block is set to 0. This can be done by.
  • the 1C flag of the candidate is present. Setting a value to a 1C flag value of the current block; And parsing a 1C flag of the current block when a candidate having a 1C flag having a value of 1 does not exist among candidates included in the motion information candidate list.
  • 35 is a diagram illustrating an inter prediction apparatus according to an embodiment to which the present invention is applied.
  • FIG. 35 illustrates an inter predictor as one block for convenience of description. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • the inter prediction unit may be implemented in a configuration included in an encoder and / or a decoder.
  • the inter prediction unit implements the functions, processes, and / or methods proposed in FIGS. 8 to 31.
  • the inter predictor may include a motion information candidate list generator 3501, a cost calculation method determiner 3502, a cost calculator 3503, and a candidate selector 3504.
  • the motion information candidate list generator 3501 generates a motion information candidate list of the current block based on the motion information of the space out block or the temporal neighboring block of the current block.
  • the cost calculation method determination unit 3502 determines a cost calculation method for the candidates based on a 1C (Illustration Compensation) flag of the candidates included in the motion information candidate list.
  • the cost calculator 3503 calculates cost values of the candidates based on the determined cost calculation method.
  • a candidate selector 3504 may generate the motion based on the calculated cost value . From the information candidate list, select the best candidate for inter prediction of the current block. As described above, as an embodiment, the cost calculation method may be determined by any one of a sum of absolute difference (SAD) method and a tuned SAD method.
  • SAD sum of absolute difference
  • the tuned SAD scheme may include a difference value between an average value of a template of the current block and a sample value of the current block and a template of a reference block specified by the candidate.
  • the template of the current block includes reconstructed samples adjacent to the left and top sides of the current block, and the template of the reference block reconstructs adjacent to the left and top sides of the reference block Samples may be included.
  • the method described in Equation 3 above may be used.
  • the cost calculation method determination unit 3502 may include a flag value of 1 ( :) among the candidates included in the motion information candidate list.
  • the tuned A method is determined as a cost calculation method for the candidates, and among the candidates included in the motion information candidate list. If there is at least one candidate having a flag value of 1, the 3 3 method may be determined as a cost calculation method for the candidates.
  • the cost calculation method determination unit 3502 may be configured to select from among the candidates included in the motion information candidate list. Flag value
  • At least one candidate is present in the current block If the application is allowed, the tuned Determining how the cost calculation method for dicing group candidates, and wherein from among the candidates included in the above motion information candidate list At least one candidate with a flag value of 1 does not exist or is present in the current block. If application is not allowed, The method can be determined by the cost calculation method for the candidates.
  • the decoder is configured to A syntax element indicating whether application is allowed may be parsed, and The syntax element that indicates whether application is allowed is a video parameter set ( ⁇ Zideo
  • the signal may be signaled through a Parameter Set, a Sequence Parameter Set, a Picture Parameter Set (PPS), or a Tile Group Header syntax.
  • 36 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 35.
  • the inter prediction unit may include a motion information candidate list generation unit 3601, a 1C flag candidate identification unit 3602, and a 1C flag derivation unit 3603.
  • the motion information candidate list generation unit 3601 generates a motion information candidate list of the current block based on the motion information of the spatial neighboring block or the temporal neighboring block of the current block.
  • the 1C flag candidate confirming unit 3602 checks whether a candidate having a 1C (Illumination Compensation) slag having a value of 1 among candidates included in the motion information candidate list exists.
  • the 1C flag derivation unit 3603 derives a 1C flag indicating whether 1C is applied to the current block based on the confirmation result.
  • the method described above with reference to FIGS. 24 and / or Equations 1 and 2 may be applied.
  • the 1C flag derivation unit 3603 when there is a candidate having a 1C flag having a value of 1 among the candidates included in the motion information candidate list, the 1C flag of the candidate By setting a value to the 1C flag value of the current block, and if there is no candidate having the 1C flag of the value 1 among the candidates included in the motion information candidate list, by setting the 1C flag value of the current block to 0 Can be performed.
  • the 1C flag derivation unit 3603 when there is a candidate having a 1C flag having a value of 1 among the candidates included in the motion information candidate list, the 1C flag value of the candidate. Setting to 1C flag value of the current block; And parsing a 1C flag of the current block when a candidate having a 1C flag having a value of 1 does not exist among candidates included in the motion information candidate list.
  • FIG. 37 shows a video coding system to which the present invention is applied.
  • the video coding system can include a source device and a receiving device.
  • the source device may transmit the encoded video / image information or data to a receiving device through a digital storage medium or a network in the form of a file or streaming.
  • the source device may include a video source, an encoding apparatus, and a transmitter.
  • the receiving device includes a receiver, a decoding apparatus and a tender. It may include.
  • the encoding device may be called a video / image encoding device, and the decoding device may be called a video / image decoding device. Can be.
  • 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 generating devices include, for example, computers, tablets and smartphones. Can be created and (electronically) generated video / video.
  • 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 bitstreams.
  • 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.
  • Digital storage media may include a variety of storage media, such as USB, SD, CD, DVD, Blu-ray, HDD, SSD.
  • 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. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • 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. 38 shows a structure diagram 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 smart phone, 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.
  • the streaming server sends the multimedia data to the user.
  • the content streaming system may include a separate control server, in which case the control server serves to control the command / response between each device 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), a navigation device, a slate PC, Tablet PC, ultrabook, wearable device (e.g., smartwatch, smart glass, head mounted display), digital TV, desktop Computer, digital signage, and the like.
  • 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 providers, 0TT video (over the top video) devices, internet streaming service providers, 3D (3D) video devices, video telephony video devices, and medical video devices.
  • VoD video on demand
  • 3D 3D
  • the OTT video (Over the top 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.
  • a game console a Blu-ray player
  • an Internet access TV a home theater system
  • a smartphone a tablet PC
  • DVR digital video recorder
  • the processing method to which the present invention is applied can be produced in the form of a program executed by a computer, and can be 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 recording medium readable by the true computer includes media embodied in the form of a carrier wave (for example, transmission through 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. 2019/194498 1 »(: 1 ⁇ 1 ⁇ 2019/003804
  • an embodiment of the present invention may be implemented as a computer program product by program code, which may be executed on a computer by an embodiment of the present invention.
  • the program code may be stored on a carrier readable by a computer.
  • each component or feature is to be considered optional unless stated otherwise.
  • Each component or feature may be embodied in a form that is not combined with other components or features. It is also possible to combine some of the components and / or features to form an embodiment of the invention.
  • the order of the operations described in the embodiments of the present invention may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment. It is obvious that the claims may be combined to form an embodiment by combining claims that do not have an explicit citation relationship in the claims or as new claims by post-application correction.
  • Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof.
  • one 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
  • an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the above-described functions or operations.
  • 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'une image sur la base d'un mode d'inter-prédiction peut comprendre les étapes consistant à : dériver un vecteur initial de mouvement d'un bloc en cours en fonction d'informations de mouvement d'un bloc voisin spatial ou d'un bloc voisin temporel du bloc en cours ; dériver une valeur différentielle de vecteur de mouvement indiquant une valeur différentielle, entre une position initiale spécifiée par le vecteur initial de mouvement et une position affinée dans une plage de recherche prédéfinie ; dériver un vecteur affiné de mouvement du bloc en cours par addition de la valeur différentielle de vecteur de mouvement au vecteur initial de mouvement ; et générer un bloc de prédiction du bloc en cours à l'aide du vecteur affiné de mouvement.
PCT/KR2019/003804 2018-04-01 2019-04-01 Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé WO2019194498A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201862651228P 2018-04-01 2018-04-01
US201862651221P 2018-04-01 2018-04-01
US62/651,221 2018-04-01
US62/651,228 2018-04-01

Publications (1)

Publication Number Publication Date
WO2019194498A1 true WO2019194498A1 (fr) 2019-10-10

Family

ID=68101096

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/003804 WO2019194498A1 (fr) 2018-04-01 2019-04-01 Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé

Country Status (1)

Country Link
WO (1) WO2019194498A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114762348A (zh) * 2019-12-03 2022-07-15 夏普株式会社 运动图像解码装置
CN115428448A (zh) * 2020-02-25 2022-12-02 Lg电子株式会社 基于帧间预测的图像编码/解码方法和设备及存储比特流的记录介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20140085300A (ko) * 2012-12-26 2014-07-07 삼성전자주식회사 프레임간 인터 예측에서 로컬 조도 불일치의 적응적 보상을 기초로 다시점 비디오 시퀀스를 인코딩/디코딩하는 방법
KR20140124919A (ko) * 2013-04-15 2014-10-28 인텔렉추얼디스커버리 주식회사 객체 기반 적응적 밝기 보상 방법 및 장치
KR20150034213A (ko) * 2012-07-03 2015-04-02 삼성전자주식회사 추가 파라미터들(변형들)의 전송 없이, 참조 프레임들의 적응적 국부 조명 보정에 기반한, 멀티-뷰 비디오 시퀀스 코딩/디코딩 방법
KR20160072120A (ko) * 2013-10-18 2016-06-22 엘지전자 주식회사 3d 비디오 부호화/복호화 방법 및 장치
KR20180016390A (ko) * 2015-06-09 2018-02-14 퀄컴 인코포레이티드 비디오 코딩을 위한 조명 보상 상태를 결정하는 시스템들 및 방법들

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20150034213A (ko) * 2012-07-03 2015-04-02 삼성전자주식회사 추가 파라미터들(변형들)의 전송 없이, 참조 프레임들의 적응적 국부 조명 보정에 기반한, 멀티-뷰 비디오 시퀀스 코딩/디코딩 방법
KR20140085300A (ko) * 2012-12-26 2014-07-07 삼성전자주식회사 프레임간 인터 예측에서 로컬 조도 불일치의 적응적 보상을 기초로 다시점 비디오 시퀀스를 인코딩/디코딩하는 방법
KR20140124919A (ko) * 2013-04-15 2014-10-28 인텔렉추얼디스커버리 주식회사 객체 기반 적응적 밝기 보상 방법 및 장치
KR20160072120A (ko) * 2013-10-18 2016-06-22 엘지전자 주식회사 3d 비디오 부호화/복호화 방법 및 장치
KR20180016390A (ko) * 2015-06-09 2018-02-14 퀄컴 인코포레이티드 비디오 코딩을 위한 조명 보상 상태를 결정하는 시스템들 및 방법들

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114762348A (zh) * 2019-12-03 2022-07-15 夏普株式会社 运动图像解码装置
CN115428448A (zh) * 2020-02-25 2022-12-02 Lg电子株式会社 基于帧间预测的图像编码/解码方法和设备及存储比特流的记录介质

Similar Documents

Publication Publication Date Title
KR102476280B1 (ko) 인트라 예측 기반 영상/비디오 코딩 방법 및 그 장치
CN111971960B (zh) 用于基于帧间预测模式处理图像的方法及其装置
US11997300B2 (en) Method and apparatus for video encoding/decoding using IBC mode, and method for transmitting bitstream
JP7477495B2 (ja) インター予測モードに基づいた映像処理方法及びそのための装置
CN111448800B (zh) 在图像编码系统中使用仿射mvp候选列表的基于仿射运动预测的图像解码方法及设备
KR102545728B1 (ko) 서브블록 단위의 시간적 움직임 정보 예측을 위한 인터 예측 방법 및 그 장치
CN112385213B (zh) 基于帧间预测模式处理图像的方法和用于该方法的设备
JP7477536B2 (ja) ビデオ／映像コーディングシステムにおけるマージデータシンタックスのシグナリング方法及び装置
JP7462094B2 (ja) ビデオ／映像コーディングシステムにおける重複シグナリング除去方法及び装置
WO2019194497A1 (fr) Procédé de traitement d'image basé sur un mode d'inter-prédiction et appareil associé
WO2019194502A1 (fr) Procédé de traitement d'image basé sur un mode d'inter-prédiction, et appareil associé
CN111903123B (zh) 基于帧间预测模式的图像处理方法和用于该方法的装置
KR20210158402A (ko) 현재 블록에 대하여 최종적으로 예측 모드를 선택하지 못하는 경우 인터 예측을 수행하는 영상 디코딩 방법 및 그 장치
WO2019194498A1 (fr) Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé
WO2019194499A1 (fr) Procédé de traitement d'image basé sur un mode de prédiction inter et dispositif associé
KR20210158401A (ko) 결정된 예측 모드를 적용하여 예측 샘플들을 생성하는 영상 디코딩 방법 및 그 장치
CN113273210B (zh) 用于编译关于合并数据的信息的方法和装置
EP4087244A1 (fr) Procédé et appareil de codage/décodage d'image en vue de la réalisation d'une prédiction sur la base d'un type de mode de prédiction reconfiguré d'un noeud terminal, 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: 19781227

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

Country of ref document: EP

Kind code of ref document: A1