WO2018066927A1 - Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé - Google Patents

Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé Download PDF

Info

Publication number
WO2018066927A1
WO2018066927A1 PCT/KR2017/010964 KR2017010964W WO2018066927A1 WO 2018066927 A1 WO2018066927 A1 WO 2018066927A1 KR 2017010964 W KR2017010964 W KR 2017010964W WO 2018066927 A1 WO2018066927 A1 WO 2018066927A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
current
motion information
merge candidate
adjacent
Prior art date
Application number
PCT/KR2017/010964
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 엘지전자(주)
Priority to US16/339,932 priority Critical patent/US10785477B2/en
Priority to EP17858721.8A priority patent/EP3525460A4/fr
Priority to KR1020197011073A priority patent/KR20190053238A/ko
Priority to CN201780073434.6A priority patent/CN110024384A/zh
Priority to JP2019519004A priority patent/JP2019535202A/ja
Publication of WO2018066927A1 publication Critical patent/WO2018066927A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding
    • 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/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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/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
    • 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/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 be characterized by high spatial resolution, high frame rate and high dimensionality of scene representation. Processing such content would result in a tremendous increase in terms of memory storage, memory access rate, and processing power.
  • An object of the present invention is to propose a method for determining a merge candidate in consideration of the similarity of neighboring motion information according to binary tree structure partitioning in inter prediction (inter prediction).
  • an object of the present invention is to propose a method of using a neighboring block of a block divided into a binary tree structure from a block divided into a quad tree structure as a merge candidate.
  • An aspect of the present invention is a method for processing an image based on an inter prediction mode, the merge candidate list using a spatial merge candidate and a temporal merge candidate of a current block Generating a; Decoding a merge index indicating a specific merge candidate in the merge candidate list; And generating a prediction block of the current block by using motion information of the merge candidate indicated by the merge index, wherein the current block is a leaf node block of a quad tree structure.
  • the spatial merge candidate may be determined to be a block adjacent to the quad tree block boundary.
  • the spatial merge candidate may be determined as at least one of a block adjacent to a lower left boundary, a block adjacent to an upper left boundary, a block adjacent to an upper right boundary, a block adjacent to an upper boundary, or a block adjacent to a left boundary. have.
  • the block adjacent to the upper boundary may be a block including pixels vertically adjacent to the pixel adjacent to the left upper boundary of the current block or a block including pixels vertically adjacent to the upper right pixel of the current block. have.
  • the block adjacent to the left boundary may be a block including pixels horizontally adjacent to the lower left pixel of the current block.
  • generating the merge candidate list comprises adding a first enhanced temporal merge candidate to the merge candidate list representing a block specified by motion information of the spatial merge candidate within a temporal candidate picture;
  • the prediction block of the current block may be generated by using motion information of the first enhanced time merge candidate in sub-block units.
  • the generating of the merge candidate list includes adding a second enhanced time merge candidate to the merge candidate list, wherein the motion information of the second enhanced time merge candidate is included in the current block within a current picture. It may be determined in units of sub-blocks using motion information of a block adjacent to a boundary and motion information of a block collocated with the current block in a time candidate picture.
  • the motion information of the current sub-block of the current block is motion information of the block adjacent to the boundary of the current block in the horizontal and vertical direction of the current sub-block, and the current sub-block in the same location block It may be determined using the motion information of the blocks of the lower and right positions of.
  • a weight may be applied to motion information of adjacent blocks in a horizontal direction or a vertical direction of the current sub block based on the distance from the current sub block.
  • the motion information of the current subblock is motion information of a block adjacent to a boundary of the current block in a horizontal direction of the current subblock. And may be determined using motion information of blocks at upper, lower and right positions of the current sub-block in the same position block.
  • the motion information of the current subblock is motion information of a block adjacent to a boundary of the current block in a vertical direction of the current subblock. And may be determined using motion information of blocks at left, lower, and right positions of the current sub-block in the same location block.
  • Another aspect of the present invention is an apparatus for processing an image based on an inter prediction mode, the merge candidate using a spatial merge candidate and a temporal merge candidate of a current block.
  • a merge candidate list generator generating a list;
  • a merge index decoder which decodes a merge index indicating a specific merge candidate in the merge candidate list;
  • a prediction block generator for generating a prediction block of the current block by using motion information of the merge candidate indicated by the merge index, wherein the current block is a leaf node block of a quad tree structure.
  • the spatial merge candidate may be determined to be a block adjacent to the quad tree block boundary.
  • FIG. 1 is a schematic block diagram of an encoder in which encoding of a still image or video signal is performed according to an embodiment to which the present invention is applied.
  • FIG. 2 is a schematic block diagram of a decoder in which encoding of a still image or video signal is performed according to an embodiment to which the present invention is applied.
  • FIG. 3 is a diagram for describing a partition structure of a coding unit that may be applied to the present invention.
  • FIG. 4 is a diagram for explaining a prediction unit applicable to the present invention.
  • FIG. 5 is a diagram illustrating a direction of inter prediction as an embodiment to which the present invention may be applied.
  • FIG 6 illustrates integer and fractional sample positions for quarter sample interpolation, as an embodiment to which the present invention may be applied.
  • FIG. 7 illustrates a position of a spatial candidate as an embodiment to which the present invention may be applied.
  • FIG. 8 is a diagram illustrating an inter prediction method as an embodiment to which the present invention is applied.
  • FIG. 9 is a diagram illustrating a motion compensation process as an embodiment to which the present invention may be applied.
  • FIG. 10 is a diagram for describing a position of a spatial merge candidate as an embodiment to which the present invention is applied.
  • FIG. 11 is a diagram for describing a position of a time merge candidate as an embodiment to which the present invention is applied.
  • FIG. 12 is a diagram for describing a method of deriving motion information using an advanced temporal motion vector predictor as an embodiment to which the present invention is applied.
  • FIG. 13 and FIG. 14 are diagrams for describing a method of deriving motion information using an enhanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • 15 to 18 are diagrams for explaining a problem occurring when a merge candidate is configured using an existing spatial merge candidate position in a QTBT structure.
  • FIG. 19 is a diagram to describe a method of configuring a spatial merge candidate using blocks adjacent to leaf node block boundaries of a quad tree according to an embodiment to which the present invention is applied.
  • a quadtree block is divided into three depths into a binary tree structure.
  • FIG. 21 is a diagram for describing a method of deriving motion information by using an advanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • FIG. 22 is a diagram for describing a method of deriving motion information by using an advanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • FIG. 23 is a diagram for describing an inter prediction method, according to an embodiment of the present invention.
  • 24 is a diagram illustrating in more detail an inter predictor according to an embodiment of the present invention.
  • the 'processing unit' refers to a unit in which a process of encoding / decoding such as prediction, transformation, and / or quantization is performed.
  • the processing unit may be referred to as a 'processing block' or 'block'.
  • the processing unit may be interpreted to include a unit for the luma component and a unit for the chroma component.
  • the processing unit may correspond to a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), or a Transform Unit (TU).
  • CTU Coding Tree Unit
  • CU Coding Unit
  • PU Prediction Unit
  • TU Transform Unit
  • the processing unit may be interpreted as a unit for a luma component or a unit for a chroma component.
  • the processing unit may be a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a luma component. May correspond to. Or, it may correspond to a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a chroma component.
  • CTB coding tree block
  • CB coding block
  • PU prediction block
  • TB transform block
  • the present invention is not limited thereto, and the processing unit may be interpreted to include a unit for a luma component and a unit for a chroma component.
  • processing unit is not necessarily limited to square blocks, but may also be configured in a polygonal form having three or more vertices.
  • FIG. 1 is a schematic block diagram of an encoder in which encoding of a still image or video signal is performed according to an embodiment to which the present invention is applied.
  • the encoder 100 may include an image divider 110, a subtractor 115, a transform unit 120, a quantizer 130, an inverse quantizer 140, an inverse transform unit 150, and a filtering unit. 160, a decoded picture buffer (DPB) 170, a predictor 180, and an entropy encoder 190.
  • the predictor 180 may include an inter predictor 181 and an intra predictor 182.
  • the image divider 110 divides an input video signal (or a picture or a frame) input to the encoder 100 into one or more processing units.
  • the subtractor 115 subtracts the difference from the prediction signal (or prediction block) output from the prediction unit 180 (that is, the inter prediction unit 181 or the intra prediction unit 182) in the input image signal. Generate a residual signal (or difference block). The generated difference signal (or difference block) is transmitted to the converter 120.
  • the transform unit 120 may convert a differential signal (or a differential block) into a transform scheme (eg, a discrete cosine transform (DCT), a discrete sine transform (DST), a graph-based transform (GBT), and a karhunen-loeve transform (KLT)). Etc.) to generate transform coefficients.
  • a transform scheme eg, a discrete cosine transform (DCT), a discrete sine transform (DST), a graph-based transform (GBT), and a karhunen-loeve transform (KLT)
  • the quantization unit 130 quantizes the transform coefficients and transmits the transform coefficients to the entropy encoding unit 190, and the entropy encoding unit 190 entropy codes the quantized signals and outputs them as bit streams.
  • the quantized signal output from the quantization unit 130 may be used to generate a prediction signal.
  • the quantized signal may recover the differential signal by applying inverse quantization and inverse transformation through an inverse quantization unit 140 and an inverse transformation unit 150 in a loop.
  • a reconstructed signal may be generated by adding the reconstructed difference signal to a prediction signal output from the inter predictor 181 or the intra predictor 182.
  • the filtering unit 160 applies filtering to the reconstruction signal and outputs it to the reproduction apparatus or transmits the decoded picture buffer to the decoding picture buffer 170.
  • the filtered signal transmitted to the decoded picture buffer 170 may be used as the reference picture in the inter prediction unit 181. As such, by using the filtered picture as a reference picture in the inter prediction mode, not only image quality but also encoding efficiency may be improved.
  • the decoded picture buffer 170 may store the filtered picture for use as a reference picture in the inter prediction unit 181.
  • the inter prediction unit 181 performs temporal prediction and / or spatial prediction to remove temporal redundancy and / or spatial redundancy with reference to a reconstructed picture.
  • the inter prediction unit 181 may use backward motion information during inter prediction (or inter picture prediction). Detailed description thereof will be described later.
  • the reference picture used to perform the prediction is a transformed signal that has been quantized and dequantized in units of blocks at the time of encoding / decoding, a blocking artifact or a ringing artifact may exist. have.
  • the inter prediction unit 181 may interpolate the signals between pixels in sub-pixel units by applying a lowpass filter to solve performance degradation due to discontinuity or quantization of such signals.
  • the sub-pixels mean virtual pixels generated by applying an interpolation filter
  • the integer pixels mean actual pixels existing in the reconstructed picture.
  • the interpolation method linear interpolation, bi-linear interpolation, wiener filter, or the like may be applied.
  • the interpolation filter may be applied to a reconstructed picture to improve the precision of prediction.
  • the inter prediction unit 181 generates an interpolation pixel by applying an interpolation filter to integer pixels, and uses an interpolated block composed of interpolated pixels as a prediction block. You can make predictions.
  • the intra predictor 182 predicts the current block by referring to samples in the vicinity of the block to which the current encoding is to be performed.
  • the intra prediction unit 182 may perform the following process to perform intra prediction. First, reference samples necessary for generating a prediction signal may be prepared. The prediction signal may be generated using the prepared reference sample. Then, the prediction mode is encoded. In this case, the reference sample may be prepared through reference sample padding and / or reference sample filtering. Since the reference sample has been predicted and reconstructed, there may be a quantization error. Accordingly, the reference sample filtering process may be performed for each prediction mode used for intra prediction to reduce such an error.
  • the prediction signal (or prediction block) generated by the inter prediction unit 181 or the intra prediction unit 182 is used to generate a reconstruction signal (or reconstruction block) or a differential signal (or differential block). It can be used to generate.
  • FIG. 2 is a schematic block diagram of a decoder in which encoding of a still image or video signal is performed according to an embodiment to which the present invention is applied.
  • the decoder 200 includes an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, an adder 235, a filtering unit 240, and a decoded picture buffer (DPB).
  • Buffer Unit (250) the prediction unit 260 may be configured.
  • the predictor 260 may include an inter predictor 261 and an intra predictor 262.
  • the reconstructed video signal output through the decoder 200 may be reproduced through the reproducing apparatus.
  • the decoder 200 receives a signal (ie, a bit stream) output from the encoder 100 of FIG. 1, and the received signal is entropy decoded through the entropy decoding unit 210.
  • the inverse quantization unit 220 obtains a transform coefficient from the entropy decoded signal using the quantization step size information.
  • the inverse transform unit 230 applies an inverse transform scheme to inverse transform the transform coefficients to obtain a residual signal (or a differential block).
  • the adder 235 outputs the obtained difference signal (or difference block) from the prediction unit 260 (that is, the prediction signal (or prediction block) output from the inter prediction unit 261 or the intra prediction unit 262. ) Generates a reconstructed signal (or a reconstruction block).
  • the filtering unit 240 applies filtering to the reconstructed signal (or the reconstructed block) and outputs the filtering to the reproduction device or transmits the decoded picture buffer unit 250 to the reproduction device.
  • the filtered signal transmitted to the decoded picture buffer unit 250 may be used as a reference picture in the inter predictor 261.
  • the embodiments described by the filtering unit 160, the inter prediction unit 181, and the intra prediction unit 182 of the encoder 100 are respectively the filtering unit 240, the inter prediction unit 261, and the decoder of the decoder. The same may be applied to the intra predictor 262.
  • the inter prediction unit 261 may use backward motion information during inter prediction (or inter picture prediction). Detailed description thereof will be described later.
  • a still image or video compression technique uses a block-based image compression method.
  • the block-based image compression method is a method of processing an image by dividing the image into specific block units, and may reduce memory usage and calculation amount.
  • FIG. 3 is a diagram for describing a partition structure of a coding unit that may be applied to the present invention.
  • the encoder splits one image (or picture) into units of a coding tree unit (CTU) in a rectangular shape.
  • CTU coding tree unit
  • one CTU is sequentially encoded according to a raster scan order.
  • the size of the CTU may be set to any one of 64 ⁇ 64, 32 ⁇ 32, and 16 ⁇ 16.
  • the encoder may select and use the size of the CTU according to the resolution of the input video or the characteristics of the input video.
  • the CTU includes a coding tree block (CTB) for luma components and a CTB for two chroma components corresponding thereto.
  • CTB coding tree block
  • One CTU may be divided into a quad-tree structure. That is, one CTU has a square shape and is divided into four units having a half horizontal size and a half vertical size to generate a coding unit (CU). have. This partitioning of the quad-tree structure can be performed recursively. That is, a CU is hierarchically divided into quad-tree structures from one CTU.
  • CU coding unit
  • the CU refers to a basic unit of coding in which an input image is processed, for example, intra / inter prediction is performed.
  • the CU includes a coding block (CB) for a luma component and a CB for two chroma components corresponding thereto.
  • CB coding block
  • the size of a CU may be set to any one of 64 ⁇ 64, 32 ⁇ 32, 16 ⁇ 16, and 8 ⁇ 8.
  • the root node of the quad-tree is associated with the CTU.
  • the quad-tree is split until it reaches a leaf node, which corresponds to a CU.
  • the CTU may not be divided according to the characteristics of the input image.
  • the CTU corresponds to a CU.
  • a node that is no longer divided ie, a leaf node
  • CU a node that is no longer divided
  • CU a node that is no longer divided
  • CU a node corresponding to nodes a, b, and j are divided once in the CTU and have a depth of one.
  • a node (ie, a leaf node) that is no longer divided in a lower node having a depth of 2 corresponds to a CU.
  • CU (c), CU (h) and CU (i) corresponding to nodes c, h and i are divided twice in the CTU and have a depth of two.
  • a node that is no longer partitioned (ie, a leaf node) in a lower node having a depth of 3 corresponds to a CU.
  • CU (d), CU (e), CU (f), and CU (g) corresponding to nodes d, e, f, and g are divided three times in the CTU, Has depth.
  • the maximum size or the minimum size of the CU may be determined according to characteristics (eg, resolution) of the video image or in consideration of encoding efficiency. Information about this or information capable of deriving the information may be included in the bitstream.
  • a CU having a maximum size may be referred to as a largest coding unit (LCU), and a CU having a minimum size may be referred to as a smallest coding unit (SCU).
  • LCU largest coding unit
  • SCU smallest coding unit
  • a CU having a tree structure may be hierarchically divided with predetermined maximum depth information (or maximum level information).
  • Each partitioned CU may have depth information. Since the depth information indicates the number and / or degree of division of the CU, the depth information may include information about the size of the CU.
  • the size of the SCU can be obtained by using the size and maximum depth information of the LCU. Or conversely, using the size of the SCU and the maximum depth information of the tree, the size of the LCU can be obtained.
  • information indicating whether the corresponding CU is split may be transmitted to the decoder.
  • This split mode is included in all CUs except the SCU. For example, if the flag indicating whether to split or not is '1', the CU is divided into 4 CUs again. If the flag indicating whether to split or not is '0', the CU is not divided further. Processing may be performed.
  • a CU is a basic unit of coding in which intra prediction or inter prediction is performed.
  • HEVC divides a CU into prediction units (PUs) in order to code an input image more effectively.
  • the PU is a basic unit for generating a prediction block, and may generate different prediction blocks in PU units within one CU. However, PUs belonging to one CU are not mixed with intra prediction and inter prediction, and PUs belonging to one CU are coded by the same prediction method (ie, intra prediction or inter prediction).
  • the PU is not divided into quad-tree structures, but is divided once in a predetermined form in one CU. This will be described with reference to the drawings below.
  • FIG. 4 is a diagram for explaining a prediction unit applicable to the present invention.
  • the PU is divided differently according to whether an intra prediction mode or an inter prediction mode is used as a coding mode of a CU to which the PU belongs.
  • FIG. 4A illustrates a PU when an intra prediction mode is used
  • FIG. 4B illustrates a PU when an inter prediction mode is used.
  • N ⁇ N type PU when divided into N ⁇ N type PU, one CU is divided into four PUs, and different prediction blocks are generated for each PU unit.
  • the division of the PU may be performed only when the size of the CB for the luminance component of the CU is the minimum size (that is, the CU is the SCU).
  • one CU has 8 PU types (ie, 2N ⁇ 2N). , N ⁇ N, 2N ⁇ N, N ⁇ 2N, nL ⁇ 2N, nR ⁇ 2N, 2N ⁇ nU, 2N ⁇ nD).
  • PU partitioning in the form of N ⁇ N may be performed only when the size of the CB for the luminance component of the CU is the minimum size (that is, the CU is the SCU).
  • AMP Asymmetric Motion Partition
  • 'n' means a 1/4 value of 2N.
  • AMP cannot be used when the CU to which the PU belongs is a CU of the minimum size.
  • an optimal partitioning structure of a coding unit (CU), a prediction unit (PU), and a transformation unit (TU) is subjected to the following process to perform a minimum rate-distortion. It can be determined based on the value. For example, looking at the optimal CU partitioning process in 64 ⁇ 64 CTU, rate-distortion cost can be calculated while partitioning from a 64 ⁇ 64 CU to an 8 ⁇ 8 CU.
  • the specific process is as follows.
  • the partition structure of the optimal PU and TU that generates the minimum rate-distortion value is determined by performing inter / intra prediction, transform / quantization, inverse quantization / inverse transform, and entropy encoding for a 64 ⁇ 64 CU.
  • the 32 ⁇ 32 CU is subdivided into four 16 ⁇ 16 CUs, and a partition structure of an optimal PU and TU that generates a minimum rate-distortion value for each 16 ⁇ 16 CU is determined.
  • 16 ⁇ 16 blocks by comparing the sum of the rate-distortion values of the 16 ⁇ 16 CUs calculated in 3) above with the rate-distortion values of the four 8 ⁇ 8 CUs calculated in 4) above. Determine the partition structure of the optimal CU within. This process is similarly performed for the remaining three 16 ⁇ 16 CUs.
  • a prediction mode is selected in units of PUs, and prediction and reconstruction are performed in units of actual TUs for the selected prediction mode.
  • the TU means a basic unit in which actual prediction and reconstruction are performed.
  • the TU includes a transform block (TB) for a luma component and a TB for two chroma components corresponding thereto.
  • TB transform block
  • the TUs are hierarchically divided into quad-tree structures from one CU to be coded.
  • the TU divided from the CU can be further divided into smaller lower TUs.
  • the size of the TU may be set to any one of 32 ⁇ 32, 16 ⁇ 16, 8 ⁇ 8, and 4 ⁇ 4.
  • a root node of the quad-tree is associated with a CU.
  • the quad-tree is split until it reaches a leaf node, which corresponds to a TU.
  • the CU may not be divided according to the characteristics of the input image.
  • the CU corresponds to a TU.
  • a node ie, a leaf node
  • TU (a), TU (b), and TU (j) corresponding to nodes a, b, and j are divided once in a CU and have a depth of 1.
  • FIG. 3B TU (a), TU (b), and TU (j) corresponding to nodes a, b, and j are divided once in a CU and have a depth of 1.
  • a node (ie, a leaf node) that is no longer divided in a lower node having a depth of 2 corresponds to a TU.
  • TU (c), TU (h), and TU (i) corresponding to nodes c, h, and i are divided twice in a CU and have a depth of two.
  • a node that is no longer partitioned (ie, a leaf node) in a lower node having a depth of 3 corresponds to a CU.
  • TU (d), TU (e), TU (f), and TU (g) corresponding to nodes d, e, f, and g are divided three times in a CU. Has depth.
  • a TU having a tree structure may be hierarchically divided with predetermined maximum depth information (or maximum level information). Each divided TU may have depth information. Since the depth information indicates the number and / or degree of division of the TU, it may include information about the size of the TU.
  • information indicating whether the corresponding TU is split may be delivered to the decoder.
  • This partitioning information is included in all TUs except the smallest TU. For example, if the value of the flag indicating whether to split is '1', the corresponding TU is divided into four TUs again. If the value of the flag indicating whether to split is '0', the corresponding TU is no longer divided.
  • the decoded portion of the current picture or other pictures in which the current processing unit is included may be used to reconstruct the current processing unit in which decoding is performed.
  • Intra picture or I picture which uses only the current picture for reconstruction, i.e. performs only intra picture prediction, predicts a picture (slice) using at most one motion vector and reference index to predict each unit
  • a picture using a predictive picture or P picture (slice), up to two motion vectors, and a reference index (slice) may be referred to as a bi-predictive picture or a B picture (slice).
  • Intra prediction means a prediction method that derives the current processing block from data elements (eg, sample values, etc.) of the same decoded picture (or slice). That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in the current picture.
  • data elements eg, sample values, etc.
  • Inter Inter prediction (or inter screen prediction)
  • Inter prediction means a prediction method of deriving a current processing block based on data elements (eg, sample values or motion vectors, etc.) of pictures other than the current picture. That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in other reconstructed pictures other than the current picture.
  • data elements eg, sample values or motion vectors, etc.
  • Inter prediction (or inter picture prediction) is a technique for removing redundancy existing between pictures, and is mostly performed through motion estimation and motion compensation.
  • FIG. 5 is a diagram illustrating a direction of inter prediction as an embodiment to which the present invention may be applied.
  • inter prediction includes uni-directional prediction that uses only one past picture or a future picture as a reference picture on a time axis with respect to one block, and bidirectional prediction that simultaneously refers to past and future pictures. Bi-directional prediction).
  • uni-directional prediction includes forward direction prediction using one reference picture displayed (or output) before the current picture in time and 1 displayed (or output) after the current picture in time. It can be divided into backward direction prediction using two reference pictures.
  • the motion parameter (or information) used to specify which reference region (or reference block) is used to predict the current block in the inter prediction process is an inter prediction mode (where
  • the inter prediction mode may indicate a reference direction (i.e., unidirectional or bidirectional) and a reference list (i.e., L0, L1 or bidirectional), a reference index (or reference picture index or reference list index), Contains motion vector information.
  • the motion vector information may include a motion vector, a motion vector prediction (MVP), or a motion vector difference (MVD).
  • the motion vector difference value means a difference value between the motion vector and the motion vector prediction value.
  • motion parameters for one direction are used. That is, one motion parameter may be needed to specify the reference region (or reference block).
  • Bidirectional prediction uses motion parameters for both directions.
  • up to two reference regions may be used.
  • the two reference regions may exist in the same reference picture or may exist in different pictures, respectively. That is, up to two motion parameters may be used in the bidirectional prediction scheme, and two motion vectors may have the same reference picture index or different reference picture indexes. In this case, all of the reference pictures may be displayed (or output) before or after the current picture in time.
  • the encoder performs motion estimation to find the reference region most similar to the current processing block from the reference pictures in the inter prediction process.
  • the encoder may provide a decoder with a motion parameter for the reference region.
  • the encoder / decoder may obtain a reference region of the current processing block using the motion parameter.
  • the reference region exists in a reference picture having the reference index.
  • the pixel value or interpolated value of the reference region specified by the motion vector may be used as a predictor of the current processing block. That is, using motion information, motion compensation is performed to predict an image of a current processing block from a previously decoded picture.
  • a method of acquiring a motion vector prediction value mvp using motion information of previously coded blocks and transmitting only a difference value mvd thereof may be used. That is, the decoder obtains a motion vector prediction value of the current processing block using motion information of other decoded blocks, and obtains a motion vector value for the current processing block using the difference value transmitted from the encoder. In obtaining the motion vector prediction value, the decoder may obtain various motion vector candidate values by using motion information of other blocks that are already decoded, and obtain one of them as the motion vector prediction value.
  • a set of previously decoded pictures are stored in a decoded picture buffer (DPB) for decoding the remaining pictures.
  • DPB decoded picture buffer
  • a reference picture refers to a picture including a sample that can be used for inter prediction in a decoding process of a next picture in decoding order.
  • a reference picture set refers to a set of reference pictures associated with a picture, and is composed of all pictures previously associated in decoding order.
  • the reference picture set may be used for inter prediction of an associated picture or a picture following an associated picture in decoding order. That is, reference pictures maintained in the decoded picture buffer DPB may be referred to as a reference picture set.
  • the encoder may provide the decoder with reference picture set information in a sequence parameter set (SPS) (ie, a syntax structure composed of syntax elements) or each slice header.
  • SPS sequence parameter set
  • a reference picture list refers to a list of reference pictures used for inter prediction of a P picture (or slice) or a B picture (or slice).
  • the reference picture list may be divided into two reference picture lists, and may be referred to as reference picture list 0 (or L0) and reference picture list 1 (or L1), respectively.
  • a reference picture belonging to reference picture list 0 may be referred to as reference picture 0 (or L0 reference picture)
  • a reference picture belonging to reference picture list 1 may be referred to as reference picture 1 (or L1 reference picture).
  • one reference picture list i.e., reference picture list 0
  • two reference picture lists i.e., reference Picture list 0 and reference picture list 1
  • Such information for distinguishing a reference picture list for each reference picture may be provided to the decoder through reference picture set information.
  • the decoder adds the reference picture to the reference picture list 0 or the reference picture list 1 based on the reference picture set information.
  • a reference picture index (or reference index) is used to identify any one specific reference picture in the reference picture list.
  • a sample of the prediction block for the inter predicted current processing block is obtained from the sample value of the corresponding reference region in the reference picture identified by the reference picture index.
  • the corresponding reference region in the reference picture represents the region of the position indicated by the horizontal component and the vertical component of the motion vector.
  • Fractional sample interpolation is used to generate predictive samples for noninteger sample coordinates, except when the motion vector has an integer value. For example, a motion vector of one quarter of the distance between samples may be supported.
  • fractional sample interpolation of luminance components applies an 8-tap filter in the horizontal and vertical directions, respectively.
  • fractional sample interpolation of the color difference component applies a 4-tap filter in the horizontal direction and the vertical direction, respectively.
  • FIG 6 illustrates integer and fractional sample positions for quarter sample interpolation, as an embodiment to which the present invention may be applied.
  • the shaded block in which the upper-case letter (A_i, j) is written indicates the integer sample position
  • the shaded block in which the lower-case letter (x_i, j) is written is the fractional sample position. Indicates.
  • Fractional samples are generated by applying interpolation filters to integer sample values in the horizontal and vertical directions, respectively.
  • an 8-tap filter may be applied to four integer sample values on the left side and four integer sample values on the right side based on the fractional sample to be generated.
  • a merge mode and advanced motion vector prediction may be used to reduce the amount of motion information.
  • Merge mode refers to a method of deriving a motion parameter (or information) from a neighboring block spatially or temporally.
  • the set of candidates available in merge mode is composed of spatial neighbor candidates, temporal candidates and generated candidates.
  • FIG. 7 illustrates a position of a spatial candidate as an embodiment to which the present invention may be applied.
  • each spatial candidate block is available according to the order of ⁇ A1, B1, B0, A0, B2 ⁇ . In this case, when the candidate block is encoded in the intra prediction mode and there is no motion information, or when the candidate block is located outside the current picture (or slice), the candidate block is not available.
  • the spatial merge candidate can be constructed by excluding unnecessary candidate blocks from candidate blocks of the current processing block. For example, when the candidate block of the current prediction block is the first prediction block in the same coding block, the candidate block having the same motion information may be excluded except for the corresponding candidate block.
  • the temporal merge candidate configuration process is performed in the order of ⁇ T0, T1 ⁇ .
  • the block when the right bottom block T0 of the collocated block of the reference picture is available, the block is configured as a temporal merge candidate.
  • the colocated block refers to a block existing at a position corresponding to the current processing block in the selected reference picture.
  • the block T1 located at the center of the collocated block is configured as a temporal merge candidate.
  • the maximum number of merge candidates may be specified in the slice header. If the number of merge candidates is larger than the maximum number, the number of spatial candidates and temporal candidates smaller than the maximum number is maintained. Otherwise, the number of merge candidates is generated by combining the candidates added so far until the maximum number of candidates becomes the maximum (ie, combined bi-predictive merging candidates). .
  • the encoder constructs a merge candidate list in the above manner and performs motion estimation to merge candidate block information selected from the merge candidate list into a merge index (for example, merge_idx [x0] [y0] '). Signal to the decoder.
  • a merge index for example, merge_idx [x0] [y0] '.
  • the B1 block is selected from the merge candidate list.
  • “index 1” may be signaled to the decoder as a merge index.
  • the decoder constructs a merge candidate list similarly to the encoder, and derives the motion information of the current block from the motion information of the candidate block corresponding to the merge index received from the encoder in the merge candidate list.
  • the decoder generates a prediction block for the current processing block based on the derived motion information (ie, motion compensation).
  • the AMVP mode refers to a method of deriving a motion vector prediction value from neighboring blocks.
  • horizontal and vertical motion vector difference (MVD), reference index, and inter prediction modes are signaled to the decoder.
  • the horizontal and vertical motion vector values are calculated using the derived motion vector prediction value and the motion vector difference (MVD) provided from the encoder.
  • the encoder constructs a motion vector predictor candidate list and performs motion estimation to perform a motion estimation flag (ie, candidate block information) selected from the motion vector predictor candidate list (for example, mvp_lX_flag [x0] [y0). ] ') Is signaled to the decoder.
  • the decoder constructs a motion vector predictor candidate list similarly to the encoder, and derives a motion vector predictor of the current processing block using the motion information of the candidate block indicated by the motion reference flag received from the encoder in the motion vector predictor candidate list.
  • the decoder obtains a motion vector value for the current processing block by using the derived motion vector prediction value and the motion vector difference value transmitted from the encoder.
  • the decoder generates a prediction block for the current processing block based on the derived motion information (ie, motion compensation).
  • the first spatial motion candidate is selected from the set of ⁇ A0, A1 ⁇ located on the left side
  • the second spatial motion candidate is selected from the set of ⁇ B0, B1, B2 ⁇ located above.
  • the candidate configuration is terminated, but if less than two, the temporal motion candidate is added.
  • FIG. 8 is a diagram illustrating an inter prediction method as an embodiment to which the present invention is applied.
  • a decoder decodes a motion parameter for a processing block (eg, a prediction unit) (S801).
  • the decoder may decode the merge index signaled from the encoder.
  • the motion parameter of the current processing block can be derived from the motion parameter of the candidate block indicated by the merge index.
  • the decoder may decode horizontal and vertical motion vector difference (MVD), reference index, and inter prediction mode signaled from the encoder.
  • the motion vector prediction value may be derived from the motion parameter of the candidate block indicated by the motion reference flag, and the motion vector value of the current processing block may be derived using the motion vector prediction value and the received motion vector difference value.
  • the decoder performs motion compensation on the prediction unit by using the decoded motion parameter (or information) (S802).
  • the encoder / decoder performs motion compensation that predicts an image of the current unit from a previously decoded picture by using the decoded motion parameter.
  • FIG. 9 is a diagram illustrating a motion compensation process as an embodiment to which the present invention may be applied.
  • FIG. 9 illustrates a case in which a motion parameter for a current block to be encoded in a current picture is unidirectional prediction, a second picture in LIST0, LIST0, and a motion vector (-a, b). do.
  • the current block is predicted using values of positions (ie, sample values of reference blocks) that are separated from the current block by (-a, b) in the second picture of LIST0.
  • another reference list (eg, LIST1), a reference index, and a motion vector difference value are transmitted so that the decoder derives two reference blocks and predicts the current block value based on the reference block.
  • an inter prediction method using merge mode is proposed when block division is performed in a quad tree structure.
  • the encoder and the decoder may generate (or construct) the merge candidate list in the following order until the maximum number of merge candidates is equally satisfied.
  • FIG. 10 is a diagram for describing a position of a spatial merge candidate as an embodiment to which the present invention is applied.
  • the encoder / decoder is number 1 (1), number 2 (2), number 3 (3), number 4 (4), and number 5 (5)
  • the motion information of the neighboring blocks of the current block 1001 can be searched, and the available (or valid) motion information can be used as a merge candidate.
  • the current blocks 1002 and 1003 are non-square blocks such as 2NxN, nLx2N, nRx2N, Nx2N 2NxnU, and 2NxnD blocks
  • the motion information of the neighboring blocks of the current blocks 1002 and 1003 may be searched in the order of (2), 3 (3), and 4 (4), and the available (or valid) motion information may be used as a merge candidate.
  • FIG. 11 is a diagram for describing a position of a time merge candidate as an embodiment to which the present invention is applied.
  • the encoder / decoder is a lower right block or center position of a collocated block 1104 corresponding to the position of the current block 1103 within the temporal candidate picture 1102 of the current picture 1101. Can be used as a time merge candidate.
  • the motion information of the block located at the lower right end of the same position block 1104 is first considered, and if there is no motion information at the corresponding position, the encoder / decoder moves the block located at the center of the same position block 1104.
  • the information can be used as motion information of the merge candidate.
  • the merge candidate selection method considering temporal similarity that is, the time merge candidate may be used in the slice header. If a temporal merge candidate is used, the encoder may transmit a reference direction and a reference picture index of the temporal candidate picture used for temporal merge candidate determination in units of slices to the decoder. In this case, the encoder / decoder may configure a time merge candidate by referring to the same picture in all slices.
  • the maximum number of merge candidates may be specified in the slice header. If, in the slice header, the maximum number of merge candidates is not transmitted, the encoder / decoder may construct a list using five merge candidates. In this case, the merge candidate list may be generated using up to four spatial merge candidates and one temporal merge candidate.
  • the encoder / decoder may select the zero motion vector as the merge candidate.
  • an inter prediction method using merge mode is proposed when block division is performed by a quadtree plus binary tree (QTBT) structure.
  • QTBT refers to a partition structure of a coding block in which a quadtree structure and a binarytree structure are combined.
  • an image is coded in units of CTUs, and the CTU is first divided into quadtrees, and the leaf nodes of the quadtrees are additionally divided into binarytrees.
  • the encoder / decoder may use an advanced temporal motion vector predictor (ATMVP) and an enhanced temporal motion vector predictor extension (ATMVP) in addition to the method of embodiment 1 described above to construct a merge candidate list.
  • ATMVP-ext Advanced Temporal Motion Vector Predictor-extension (AMD) can be applied. This will be described later in detail.
  • the encoder and the decoder When a block is divided into a QTBT structure, the encoder and the decoder generate (or construct) a merge candidate list using spatial merge candidates, temporal merge candidates, ATMVP, ATMVP-ext, combined merge candidates, and / or zero motion vector candidates. )can do.
  • the encoder / decoder may generate (or construct) a merge candidate list in the following order until the maximum number of merge candidates is satisfied.
  • the encoder / decoder first searches for valid motion information on blocks 1, 1, 2, 3, and 4 in the above-described FIG. After determining the spatial merge candidates, ATMVP and ATMVP-ext may be configured. Subsequently, the encoder / decoder may add the spatial merge candidate using the motion information of position 5 in FIG. 10 described above.
  • the maximum number of merge candidates may be specified in the slice header. If a maximum number of merge candidates is not transmitted in the slice header, the encoder / decoder may construct a list using a predetermined number of merge candidates. Preferably, the predetermined number may be one of five to seven.
  • the encoder may signal whether to use (or apply) ATMVP and / or ATMVP-ext to the decoder at a high-level. For example, the encoder may transmit whether to use ATMVP and / or ATMVP-ext to the decoder in units of sequences, pictures, and slices.
  • ATMVP and ATMVP-ext are used, one maximum number of merge candidates may be added depending on whether each of them is used. For example, if the maximum number of merge candidates is not transmitted, the decoder may set the maximum number of merge candidates to five, and if both ATMVP and ATMVP-ext are used, the decoder may increase the maximum number of merge candidates to seven. have.
  • the decoder may set the maximum number of merge candidates to a predetermined number and configure candidates regardless of whether ATMVP or ATMVP-ext is used. For example, if the maximum number of merge candidates is not transmitted from the encoder, the decoder sets the maximum number of merge candidates to 7 and merges using the maximum 7 merge candidates even under conditions where ATMVP and ATMVP-ext are not used.
  • the candidate list can be constructed.
  • ATMVP represents a block (or motion information of a block) specified by motion information of a spatial merge candidate added to a merge candidate list in a temporal candidate picture (or a reference picture).
  • ATMVP may be referred to as a combined (or mixed) merge candidate, a first enhanced time merge candidate, or the like. It demonstrates with reference to the following drawings.
  • FIG. 12 is a diagram for describing a method of deriving motion information using an advanced temporal motion vector predictor as an embodiment to which the present invention is applied.
  • the encoder / decoder first searches for a candidate block 1202 of the current block 1202 in a temporal candidate picture by using motion information 1201 of a spatial merge candidate added to the merge candidate list first. do.
  • the ATMVP candidate block 1202 may be specified by the motion information 1201 of the first spatial merge candidate of the merge candidate list.
  • the motion information of the ATMVP candidate block 1202 may be derived in units of subblocks. Specifically, when the merge index received from the encoder indicates the ATMVP candidate, the prediction block of the current block 1202 uses (or derives) the motion information of the ATMVP candidate in sub-block units to subblock. Can be generated in units.
  • ATMVP-ext represents a method of considering spatial similarity and temporal similarity of motion information in units of sub-blocks divided from the current block.
  • ATMVP-ext may be referred to as a combined (or mixed) merge candidate, a second enhanced time merge candidate, or the like. It demonstrates with reference to the following drawings.
  • FIG. 13 and FIG. 14 are diagrams for describing a method of deriving motion information using an enhanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • the encoder / decoder may divide a current block into a plurality of subblocks and determine (or derive) motion information in units of subblocks.
  • the sub block may be a 4 ⁇ 4 or 8 ⁇ 8 block.
  • the encoder / decoder may use the motion information of subblocks 1302, 1303, 1304, and 1305 adjacent to the current subblock 1301 to derive the motion vector (or motion information) of the current subblock 1301.
  • the encoder / decoder may use motion information of the corresponding area in the current picture.
  • the encoder / decoder is a temporal candidate picture (or a reference picture, a collocated ( collocated) may use movement information of a corresponding position in the picture.
  • the encoder / decoder calculates motion information of two blocks 1302 and 1303 spatially adjacent to the current sub-block 1301 and two blocks 1304 and 1305 that are spatially adjacent to each other, and averages a total of four pieces of motion information. It may be derived from the motion information of 1301.
  • the encoder / decoder uses the motion information of the neighboring subblock in the above-described manner, but outside the boundary of the current block within the current picture. By using the motion information of the can be eliminated the dependency that can occur between the sub-blocks.
  • the encoder / decoder is adjacent to the boundary of the current block within the current picture instead of the subblock immediately to the left of the current subblock 1401.
  • a block 1402 adjacent to the current sub-block 1401 in the horizontal direction may be used.
  • the encoder / decoder may use a neighboring block of a block divided into a quad tree structure from a block divided into a binary tree structure as a merge candidate.
  • the encoder / decoder may determine the merge candidate in consideration of the similarity of the surrounding motion information according to the binary tree structure division.
  • partitioning is first performed in a quad tree structure, and then a leaf node block (hereinafter, referred to as a 'quad tree block') of the quad tree is added to the binary tree structure. Divided. In this case, the similarity of motion information between blocks divided into quadtree blocks into a binary tree may be relatively low. It demonstrates with reference to the following drawings.
  • 15 to 18 are diagrams for explaining a problem occurring when a merge candidate is configured using an existing spatial merge candidate position in a QTBT structure.
  • FIG. 15 illustrates an example in which the quad tree blocks are divided in the vertical direction.
  • FIG. 15 (b) illustrates an example in which the quad tree blocks are divided in the vertical direction and then divided again in the horizontal direction. Illustrated.
  • position 1601 is used as a spatial prediction candidate (i.e., a spatial merge candidate) as shown in FIG. 16 (a)
  • the second binary tree Since the current block 1602, which is a block, uses the same motion information as the first binary tree block, there is a high possibility that the quad tree block is divided as shown in FIG. 16 (b) or binary tree splitting is not performed. .
  • the quad tree block may be used. As shown in Fig. 17B, it is likely to be divided.
  • the motion information is confirmed up to position 5 and configured as the spatial merge candidate means that the motion information at position 1 and the motion information at position 2 are not the same as the motion information at position 5. can do.
  • the quad tree block is efficient in terms of bit allocation of a split flag divided into quad tree structures as shown in FIG. 18 (b).
  • the quad tree block is likely to be divided as shown in FIG. 18B.
  • the similarity of motion information between blocks divided into quadtree blocks into a binary tree may be relatively low. Nevertheless, if the same location as in the conventional method is used, spatial merge candidates having a low selection probability may be included in the merge candidate list, thereby degrading compression performance.
  • the present invention proposes a method of using a block adjacent to a block boundary divided into a quad tree structure as a merge candidate from a block divided into a binary tree structure.
  • FIG. 19 is a diagram to describe a method of configuring a spatial merge candidate using blocks adjacent to leaf node block boundaries of a quad tree according to an embodiment to which the present invention is applied.
  • a spatial merge candidate is a block adjacent to the quad tree block boundary. Can be determined. Specifically, the spatial merge candidates are located at blocks 1 (1), 2 (2), 3 (3), 4 (4), and 5 (5) (or 1 (1), 2 ( 2), 3 (3), 4 (4), and 5 (5) blocks containing pixels.
  • the encoder / decoder sequentially searches for motion information of positions 1 (1), 2 (2), 3 (3), 4 (4), and 5 (5) to sequentially search for the current block 1902, 1902.
  • Space merge candidates can be configured.
  • the compression performance can be improved compared to the conventional method, and since there is no dependency between binary tree blocks in the process of deriving the motion information of the binary tree blocks in the quad tree block, the unit of the quad tree block Parallelism can be performed.
  • the encoder / decoder when the encoder / decoder applies the ATMVP or ATMVP-ext method for deriving motion information in sub-block units, the encoder / decoder is adjacent to a block boundary divided into quad tree structures from a block divided into binary tree structures. Blocks can be used as merge candidates.
  • a problem may occur in that the probability of selecting motion information of neighboring candidates is lowered according to the QTBT block division structure.
  • the ATMVP uses the motion information of the block specified in the temporal candidate picture by the motion information of the neighbor candidates, the problem described in the third embodiment may not occur.
  • the encoder / decoder may configure the ATMVP using motion information of the spatial candidate at the same position as that of the existing (ie, FIG. 10 described above). Specifically, when the current block is a binary tree partitioned block, the encoder / decoder searches for the motion information of the spatial candidate at the position described in FIG. 10 above, and is specified by the first valid (or available) motion information.
  • the motion information of the blocks in the picture may be derived in sub-block units to determine the motion information of the current block.
  • the encoder / decoder may configure the ATMVP using the motion information of the spatial candidate at the same position as that of FIG. 19 described above in consideration of the uniformity or complexity of the method proposed in the third embodiment.
  • the encoder / decoder searches for the motion information of the spatial candidate at the position described in FIG. 19 above, and is specified by the first valid (or available) motion information.
  • the motion information of the blocks in the picture may be derived in sub-block units to determine the motion information of the current block.
  • 20 is a diagram for describing a method of configuring a spatial merge candidate using blocks adjacent to leaf node block boundaries of a quad tree according to an embodiment to which the present invention is applied.
  • a quadtree block is divided into three depths into a binary tree structure.
  • Encoder / decoder is the position shown in Fig. 20 (a) (No. 1 (1), No. 2 (2), No. 3 (3), No. 4 (4), No. 5 (5) for parallelization of quad tree blocks.
  • the merge candidate list may be constructed by using the spatial merge candidates of the "
  • the encoder / decoder may be located at positions 1 (1), 2 (2), 3 (3), 4 (4) and 5 shown in FIG. 20 (b) for parallelization between the same binary tree depth blocks.
  • the merge candidate list can also be constructed using the space merge candidate of ().
  • the encoder may determine the unit in which parallelism is performed and transmit the determined parallelism unit to the decoder through high-level syntax. For example, the encoder may signal a unit in which parallelism is performed to the decoder in units of sequence, picture, and slice. If the parallelization unit is transmitted from the encoder, the decoder may selectively use the spatial candidate position shown in FIG. 20 (a) or 20 (b).
  • ATMVP-ext derives motion information in units of subblocks.
  • the parallelism problem becomes an important issue, and when the parallelization is performed, the reliability of the motion information of neighboring candidate positions may decrease depending on the characteristics of the sub-blocks. .
  • the present embodiment proposes a method of determining the position of the spatial candidate or the temporal candidate used for ATMVP-ext according to the position in the current processing block of each subblock.
  • FIG. 21 is a diagram for describing a method of deriving motion information by using an advanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • the encoder / decoder may determine ATMVP-ext motion information by using motion information of a temporal candidate instead of a spatial candidate at a position that is not a block boundary.
  • the motion information of the current subblock 2101 is in the vertical direction of the current subblock 2101 among the blocks adjacent to the boundary of the current block. It can be determined using the motion information of the adjacent block 2103 and the motion information of the blocks at the left 2102, lower 2104 and right 2105 positions of the current sub-block in the collocated block of the temporal candidate picture. have.
  • FIG. 22 is a diagram for describing a method of deriving motion information by using an advanced temporal motion vector predictor extension as an embodiment to which the present invention is applied.
  • a spatial candidate motion vector adjacent to the current block is used, but is present in the motion vector 2202 of the corresponding spatial candidate.
  • a weight having a relatively small value may be applied.
  • the weight value may have a value smaller than one.
  • the method of constructing the candidate list in the merge mode has been described mainly, but the above-described embodiment may be equally applied to the advanced motion vector prediction (AMVP) mode. That is, when the merge mode is not applied, the AMVP mode is applied.
  • the decoder generates an AMVP candidate list using the method described above, and uses the motion vector difference value and the reference picture index received from the encoder to interleave the data. You can make predictions.
  • FIG. 23 is a diagram for describing an inter prediction method, according to an embodiment of the present invention.
  • a decoder is mainly described for convenience of explanation, but the inter prediction method according to the present embodiment may be equally applied to an encoder and a decoder.
  • the decoder generates a merge candidate list by using a spatial merge candidate and a temporal merge candidate of the current block (S2301).
  • the spatial merge candidates May be determined to be a block adjacent to the quad tree block boundary.
  • the spatial merge candidate may be determined as at least one of a block adjacent to a lower left boundary, a block adjacent to an upper left boundary, a block adjacent to an upper right boundary, a block adjacent to an upper boundary, or a block adjacent to a left boundary.
  • the block adjacent to the upper boundary may be a block including a pixel adjacent in the vertical direction with a pixel adjacent to the left upper boundary of the current block or a block including a pixel adjacent in the vertical direction to the right upper pixel of the current block.
  • the block adjacent to the left boundary may be a block including pixels horizontally adjacent to the lower left pixel of the current block.
  • step S2301 includes adding a first enhanced time merge candidate (ATMVP) representing a block specified by motion information of the spatial merge candidate in the temporal candidate picture to the merge candidate list. can do.
  • ATMVP first enhanced time merge candidate
  • the prediction block of the current block may be generated using motion information of the first enhanced time merge candidate in sub-block units. have.
  • step S2301 may include adding a second enhanced time merge candidate (ATMVP-ext) to the merge candidate list.
  • the motion information of the second enhanced temporal merge candidate is obtained by using motion information of a block adjacent to a boundary of the current block in a current picture and motion information of a block collocated with the current block in a temporal candidate picture. It may be determined in units of sub-blocks.
  • the motion information of the current subblock of the current block includes motion information of a block adjacent to a boundary of the current block in horizontal and vertical directions of the current subblock, and of the current subblock in the same block. It may be determined using the motion information of the blocks of the lower and right positions.
  • a weight may be applied to motion information of adjacent blocks in a horizontal direction or a vertical direction of the current sub block based on the distance from the current sub block.
  • motion information of the current subblock is in a horizontal direction of the current subblock among blocks adjacent to the boundary of the current block.
  • the motion information of the adjacent block and the motion information of the blocks of the upper, lower and right positions of the current sub-block in the same position block may be determined.
  • the motion information of the current subblock is equal to the motion information of the adjacent block in the vertical direction of the current subblock among the blocks adjacent to the current block.
  • the motion information may be determined by using motion information of blocks at left, lower, and right positions of the current subblock in the same location block.
  • the decoder decodes (or extracts) a merge index indicating a specific merge candidate in the merge candidate list (S2302).
  • the decoder generates a prediction block of the current block by using motion information of the merge candidate indicated by the merge index (S2303).
  • 24 is a diagram illustrating in more detail an inter predictor according to an embodiment of the present invention.
  • the inter prediction unit is illustrated as one block for convenience of description, but the intra prediction unit may be implemented as a configuration included in the encoder and / or the decoder.
  • the inter prediction unit implements the functions, processes, and / or methods proposed in FIGS. 5 to 23.
  • the inter prediction unit may include a merge candidate list constructer 2401, a merge index decoder 2402, and a predictive block generator 2403.
  • the merge candidate list construction unit 2401 generates a merge candidate list by using a spatial merge candidate and a temporal merge candidate of the current block.
  • the spatial merge candidates May be determined to be a block adjacent to the quad tree block boundary.
  • the spatial merge candidate may be determined as at least one of a block adjacent to a lower left boundary, a block adjacent to an upper left boundary, a block adjacent to an upper right boundary, a block adjacent to an upper boundary, or a block adjacent to a left boundary.
  • the block adjacent to the upper boundary may be a block including a pixel adjacent in the vertical direction with a pixel adjacent to the left upper boundary of the current block or a block including a pixel adjacent in the vertical direction to the right upper pixel of the current block.
  • the block adjacent to the left boundary may be a block including pixels horizontally adjacent to the lower left pixel of the current block.
  • the merge candidate list construction unit 2401 includes a first enhanced temporal merge candidate (ATMVP) representing a block specified by the motion information of the spatial merge candidate in the temporal candidate picture, to the merge candidate list.
  • ATMVP first enhanced temporal merge candidate
  • the prediction block of the current block may be generated using motion information of the first enhanced time merge candidate in sub-block units. have.
  • the merge candidate list construction unit 2401 may add a second enhanced time merge candidate (ATMVP-ext) to the merge candidate list.
  • the motion information of the second enhanced temporal merge candidate is obtained by using motion information of a block adjacent to a boundary of the current block in a current picture and motion information of a block collocated with the current block in a temporal candidate picture. It may be determined in units of sub-blocks.
  • the motion information of the current subblock of the current block includes motion information of a block adjacent to a boundary of the current block in horizontal and vertical directions of the current subblock, and of the current subblock in the same block. It may be determined using the motion information of the blocks of the lower and right positions.
  • a weight may be applied to motion information of adjacent blocks in a horizontal direction or a vertical direction of the current sub block based on the distance from the current sub block.
  • motion information of the current subblock is in a horizontal direction of the current subblock among blocks adjacent to the boundary of the current block.
  • the motion information of the adjacent block and the motion information of the blocks of the upper, lower and right positions of the current sub-block in the same position block may be determined.
  • the motion information of the current subblock is equal to the motion information of the adjacent block in the vertical direction of the current subblock among the blocks adjacent to the current block.
  • the motion information may be determined by using motion information of blocks at left, lower, and right positions of the current subblock in the same location block.
  • the merge index decoder 2402 decodes (or extracts) a merge index indicating a specific merge candidate in the merge candidate list.
  • the prediction block generator 2403 generates a prediction block of the current block by using motion information of the merge candidate indicated by the merge index.
  • 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.
  • an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • processors controllers, microcontrollers, microprocessors, and the like.
  • an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above.
  • the software code may be stored in memory and driven by the processor.
  • the memory may be located inside or outside the processor, and may exchange data with the processor by various known means.

Abstract

L'invention concerne un procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et un dispositif associé. L'invention concerne plus précisément un procédé de traitement d'une vidéo sur la base d'une inter-prédiction comprenant les étapes consistant à : dériver des informations de mouvement vers l'arrière d'un bloc courant à l'aide d'informations de mouvement d'un bloc dans une image de référence d'une image courante ; ajouter les informations de mouvement vers l'arrière à une liste de candidats d'informations de mouvement du bloc courant ; dériver les informations de mouvement du bloc courant à partir des informations de mouvement sélectionnées parmi les candidats d'informations de mouvement ajoutés à la liste de candidats d'informations de mouvement ; et générer un bloc de prédiction du bloc courant à l'aide des informations de mouvement du bloc courant au moyen des informations de mouvement du bloc courant , le bloc dans l'image de référence pouvant être spécifié par les informations de mouvement vers l'arrière.
PCT/KR2017/010964 2016-10-06 2017-09-29 Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé WO2018066927A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US16/339,932 US10785477B2 (en) 2016-10-06 2017-09-29 Method for processing video on basis of inter prediction mode and apparatus therefor
EP17858721.8A EP3525460A4 (fr) 2016-10-06 2017-09-29 Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé
KR1020197011073A KR20190053238A (ko) 2016-10-06 2017-09-29 인터 예측 모드 기반 영상 처리 방법 및 이를 위한 장치
CN201780073434.6A CN110024384A (zh) 2016-10-06 2017-09-29 基于帧间预测模式处理视频的方法和用于该方法的设备
JP2019519004A JP2019535202A (ja) 2016-10-06 2017-09-29 インター予測モードベースの画像処理方法及びそのための装置

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201662404774P 2016-10-06 2016-10-06
US62/404,774 2016-10-06

Publications (1)

Publication Number Publication Date
WO2018066927A1 true WO2018066927A1 (fr) 2018-04-12

Family

ID=61831827

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2017/010964 WO2018066927A1 (fr) 2016-10-06 2017-09-29 Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé

Country Status (6)

Country Link
US (1) US10785477B2 (fr)
EP (1) EP3525460A4 (fr)
JP (1) JP2019535202A (fr)
KR (1) KR20190053238A (fr)
CN (1) CN110024384A (fr)
WO (1) WO2018066927A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019203610A1 (fr) * 2018-04-19 2019-10-24 엘지전자 주식회사 Procédé de traitement d'images et dispositif pour sa mise en œuvre
US20200059659A1 (en) * 2018-08-17 2020-02-20 Mediatek Inc. Shared Candidate List
WO2020085800A1 (fr) * 2018-10-23 2020-04-30 주식회사 윌러스표준기술연구소 Procédé et dispositif de traitement de signal vidéo à l'aide d'une compensation de mouvement basée sur un sous-bloc
WO2020117016A1 (fr) * 2018-12-06 2020-06-11 엘지전자 주식회사 Procédé et dispositif de traitement de signal vidéo sur la base d'une inter-prédiction
JP2020108083A (ja) * 2018-12-28 2020-07-09 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム
JP2020108082A (ja) * 2018-12-28 2020-07-09 株式会社Ｊｖｃケンウッド 画像復号装置、画像復号方法及び画像復号プログラム
CN111903123A (zh) * 2018-07-02 2020-11-06 Lg电子株式会社 基于帧间预测模式的图像处理方法和用于该方法的装置
CN111971960A (zh) * 2018-06-27 2020-11-20 Lg电子株式会社 用于基于帧间预测模式处理图像的方法及其装置
WO2021071145A1 (fr) * 2019-10-06 2021-04-15 현대자동차주식회사 Procédé et appareil pour coder et décoder une vidéo au moyen d'une inter prédiction
US11503329B2 (en) 2018-08-17 2022-11-15 Hfi Innovation Inc. Method and apparatus of simplified sub-mode for video coding

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3704856A1 (fr) * 2017-11-01 2020-09-09 Vid Scale, Inc. Dérivation de mouvement de sous-bloc et affinement de vecteur de mouvement côté décodeur pour mode de fusion
CN113115046A (zh) 2018-06-21 2021-07-13 北京字节跳动网络技术有限公司 分量相关的子块分割
WO2020043004A1 (fr) * 2018-08-28 2020-03-05 华为技术有限公司 Procédé de construction pour liste d'informations de mouvement candidates, procédé de prédiction entre trames et appareil
EP3861723A4 (fr) * 2018-11-10 2022-04-20 Beijing Bytedance Network Technology Co., Ltd. Arrondissement dans des calculs de candidats à la fusion moyennés et appairés
CN113170198B (zh) 2018-11-22 2022-12-09 北京字节跳动网络技术有限公司 子块时域运动矢量预测
US20220232219A1 (en) * 2019-06-11 2022-07-21 Lg Electronics Inc. Image or video coding based on temporal motion information in units of subblocks
JP7259090B2 (ja) * 2019-06-13 2023-04-17 エルジー エレクトロニクス インコーポレイティド サブブロック単位の時間動きベクトル予測子候補に基づく映像またはビデオコーディング
WO2020251319A1 (fr) 2019-06-13 2020-12-17 엘지전자 주식회사 Codage d'image ou de vidéo basé sur une prédiction inter à l'aide de sbtmvp
KR20240015171A (ko) * 2019-06-13 2024-02-02 엘지전자 주식회사 Sbtmvp 기반 영상 또는 비디오 코딩
JP2022544260A (ja) 2019-08-13 2022-10-17 北京字節跳動網絡技術有限公司 サブブロックに基づくインター予測における動き精度
CN114762330A (zh) 2019-09-22 2022-07-15 北京字节跳动网络技术有限公司 视频的子图片编码和解码
KR20220127938A (ko) * 2020-02-25 2022-09-20 엘지전자 주식회사 인터 예측에 기반한 영상 인코딩/디코딩 방법 및 장치, 그리고 비트스트림을 저장한 기록 매체

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130084314A (ko) * 2010-11-04 2013-07-24 프라운호퍼 게젤샤프트 쭈르 푀르데룽 데어 안겐반텐 포르슝 에. 베. 블록 병합 및 스킵 모드를 지원하는 화상 코딩
KR20140043844A (ko) * 2010-11-25 2014-04-10 엘지전자 주식회사 영상 정보의 시그널링 방법 및 이를 이용한 영상 정보의 복호화 방법
KR20140064944A (ko) * 2011-09-09 2014-05-28 엘지전자 주식회사 인터 예측 방법 및 그 장치
KR20140077919A (ko) * 2011-11-07 2014-06-24 인포브릿지 피티이 엘티디 머지 모드에서의 영상 복호화 방법
KR20160022345A (ko) * 2013-06-17 2016-02-29 퀄컴 인코포레이티드 인터-컴포넌트 필터링

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011091696A (ja) * 2009-10-23 2011-05-06 Victor Co Of Japan Ltd 動きベクトル予測方法
DK2568706T3 (en) * 2010-05-04 2019-03-11 Lg Electronics Inc METHOD AND DEVICE FOR PROCESSING A VIDEO SIGNAL
CN110198449B (zh) * 2011-11-08 2022-01-04 韩国电子通信研究院 用于共享候选者列表的方法和装置
US9521389B2 (en) * 2013-03-06 2016-12-13 Qualcomm Incorporated Derived disparity vector in 3D video coding
US9667990B2 (en) * 2013-05-31 2017-05-30 Qualcomm Incorporated Parallel derived disparity vector for 3D video coding with neighbor-based disparity vector derivation
US9800895B2 (en) * 2013-06-27 2017-10-24 Qualcomm Incorporated Depth oriented inter-view motion vector prediction
KR102071581B1 (ko) * 2014-03-31 2020-04-01 삼성전자주식회사 서브블록 기반 예측을 수행하는 인터 레이어 비디오 복호화 방법 및 그 장치 및 서브블록 기반 예측을 수행하는 인터 레이어 비디오 부호화 방법 및 그 장치
WO2016056779A1 (fr) * 2014-10-08 2016-04-14 엘지전자 주식회사 Procédé et dispositif pour traiter un paramètre de caméra dans un codage de vidéo tridimensionnelle (3d)
KR102254162B1 (ko) * 2016-05-12 2021-05-20 엘지전자 주식회사 비디오 코딩 시스템에서 인트라 예측 방법 및 장치
WO2018021374A1 (fr) * 2016-07-29 2018-02-01 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Dispositif de codage, dispositif de décodage, procédé de codage, et procédé de décodage
US10778999B2 (en) * 2016-09-30 2020-09-15 Qualcomm Incorporated Frame rate up-conversion coding mode with affine motion model

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130084314A (ko) * 2010-11-04 2013-07-24 프라운호퍼 게젤샤프트 쭈르 푀르데룽 데어 안겐반텐 포르슝 에. 베. 블록 병합 및 스킵 모드를 지원하는 화상 코딩
KR20140043844A (ko) * 2010-11-25 2014-04-10 엘지전자 주식회사 영상 정보의 시그널링 방법 및 이를 이용한 영상 정보의 복호화 방법
KR20140064944A (ko) * 2011-09-09 2014-05-28 엘지전자 주식회사 인터 예측 방법 및 그 장치
KR20140077919A (ko) * 2011-11-07 2014-06-24 인포브릿지 피티이 엘티디 머지 모드에서의 영상 복호화 방법
KR20160022345A (ko) * 2013-06-17 2016-02-29 퀄컴 인코포레이티드 인터-컴포넌트 필터링

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3525460A4 *

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11272221B2 (en) 2018-04-19 2022-03-08 Lg Electronics Inc. Method for partitioning block including image and device therefor
US11750849B2 (en) 2018-04-19 2023-09-05 Lg Electronics Inc. Method for partitioning block including image and device therefor
WO2019203610A1 (fr) * 2018-04-19 2019-10-24 엘지전자 주식회사 Procédé de traitement d'images et dispositif pour sa mise en œuvre
JP2022168139A (ja) * 2018-06-27 2022-11-04 エルジー エレクトロニクス インコーポレイティド インター予測モードに基づいた映像処理方法およびそのための装置
JP7141463B2 (ja) 2018-06-27 2022-09-22 エルジー エレクトロニクス インコーポレイティド インター予測モードに基づいた映像処理方法およびそのための装置
CN111971960A (zh) * 2018-06-27 2020-11-20 Lg电子株式会社 用于基于帧间预测模式处理图像的方法及其装置
JP7395683B2 (ja) 2018-06-27 2023-12-11 エルジー エレクトロニクス インコーポレイティド インター予測モードに基づいた映像処理方法およびそのための装置
CN111971960B (zh) * 2018-06-27 2023-08-29 Lg电子株式会社 用于基于帧间预测模式处理图像的方法及其装置
JP2021516502A (ja) * 2018-06-27 2021-07-01 エルジー エレクトロニクス インコーポレイティド インター予測モードに基づいた映像処理方法およびそのための装置
US11653004B2 (en) 2018-06-27 2023-05-16 Lg Electronics Inc. Method for processing image on basis of inter-prediction mode and device therefor
CN111903123B (zh) * 2018-07-02 2024-03-08 Lg电子株式会社 基于帧间预测模式的图像处理方法和用于该方法的装置
CN111903123A (zh) * 2018-07-02 2020-11-06 Lg电子株式会社 基于帧间预测模式的图像处理方法和用于该方法的装置
US11245922B2 (en) * 2018-08-17 2022-02-08 Mediatek Inc. Shared candidate list
US11503329B2 (en) 2018-08-17 2022-11-15 Hfi Innovation Inc. Method and apparatus of simplified sub-mode for video coding
TWI749358B (zh) * 2018-08-17 2021-12-11 聯發科技股份有限公司 共享候選列表
US20200059659A1 (en) * 2018-08-17 2020-02-20 Mediatek Inc. Shared Candidate List
CN112567747A (zh) * 2018-08-17 2021-03-26 联发科技股份有限公司 共享候选列表
WO2020085800A1 (fr) * 2018-10-23 2020-04-30 주식회사 윌러스표준기술연구소 Procédé et dispositif de traitement de signal vidéo à l'aide d'une compensation de mouvement basée sur un sous-bloc
WO2020117016A1 (fr) * 2018-12-06 2020-06-11 엘지전자 주식회사 Procédé et dispositif de traitement de signal vidéo sur la base d'une inter-prédiction
US11570430B2 (en) 2018-12-06 2023-01-31 Lg Electronics Inc. Method and device for processing video signal on basis of inter-prediction
JP2020108083A (ja) * 2018-12-28 2020-07-09 株式会社Ｊｖｃケンウッド 画像符号化装置、画像符号化方法及び画像符号化プログラム
JP2020108082A (ja) * 2018-12-28 2020-07-09 株式会社Ｊｖｃケンウッド 画像復号装置、画像復号方法及び画像復号プログラム
WO2021071145A1 (fr) * 2019-10-06 2021-04-15 현대자동차주식회사 Procédé et appareil pour coder et décoder une vidéo au moyen d'une inter prédiction

Also Published As

Publication number Publication date
KR20190053238A (ko) 2019-05-17
CN110024384A (zh) 2019-07-16
EP3525460A4 (fr) 2020-06-17
US20200045307A1 (en) 2020-02-06
EP3525460A1 (fr) 2019-08-14
US10785477B2 (en) 2020-09-22
JP2019535202A (ja) 2019-12-05

Similar Documents

Publication Publication Date Title
WO2018066927A1 (fr) Procédé de traitement de vidéo sur la base d'un mode d'inter-prédiction et dispositif associé
WO2017065532A1 (fr) Procédé et appareil de codage et de décodage d'un signal vidéo
WO2018062788A1 (fr) Procédé de traitement d'image basé sur un mode de prédiction intra et appareil associé
WO2018056703A1 (fr) Procédé et appareil de traitement de signal vidéo
WO2019050115A1 (fr) Procédé de traitement d'image fondé sur un mode de prédiction inter et appareil correspondant
WO2017086746A1 (fr) Procédé et appareil d'encodage/décodage d'un mode de prédiction intra-écran.
WO2018056763A1 (fr) Procédé et appareil permettant la réalisation d'une prédiction à l'aide d'une pondération fondée sur un modèle
WO2017034089A1 (fr) Procédé de traitement d'image basé sur un mode d'inter-prédiction et appareil associé
WO2013002557A2 (fr) Procédé et appareil pour encoder des informations de mouvement et méthode et appareil pour les décoder
WO2017069505A1 (fr) Procédé de codage/décodage d'image et dispositif correspondant
WO2018070742A1 (fr) Dispositif et procédé de codage et de décodage d'image, et support d'enregistrement dans lequel le flux binaire est stocké
WO2018062950A1 (fr) Procédé de traitement d'image et appareil associé
WO2019066524A1 (fr) Procédé et appareil de codage/ décodage d'image et support d'enregistrement pour stocker un train de bits
WO2012105807A2 (fr) Procédé et appareil de codage/décodage d'images à l'aide d'un vecteur de mouvement
WO2019045392A1 (fr) Procédé et dispositif destiné au traitement des signaux vidéo
WO2016153146A1 (fr) Procédé de traitement d'image sur la base d'un mode de prédiction intra et appareil correspondant
WO2020096425A1 (fr) Procédé de codage/décodage de signal d'image, et dispositif associé
WO2018070713A1 (fr) Procédé et appareil pour dériver un mode de prédiction intra pour un composant de chrominance
WO2017034113A1 (fr) Procédé de traitement d'image basé sur un mode interprédiction et appareil associé
WO2019009498A1 (fr) Procédé de traitement d'image basé sur un mode d'inter-prédiction et dispositif associé
WO2018062880A1 (fr) Procédé de traitement d'image et appareil associé
WO2017086738A1 (fr) Procédé et appareil de codage/décodage d'image
WO2017052250A1 (fr) Procédé de codage/décodage d'images et dispositif afférent
WO2018105759A1 (fr) Procédé de codage/décodage d'image et appareil associé
WO2018066958A1 (fr) Procédé et appareil de traitement de signal vidéo

Legal Events

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

Ref document number: 17858721

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019519004

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20197011073

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2017858721

Country of ref document: EP

Effective date: 20190506