Method for encoding and decoding image information and device using same

• US 10,257,535 B2
• Filed: 01/30/2018
• Issued: 04/09/2019
• Est. Priority Date: 01/07/2011
• Status: Active Grant

• Current Assignee: LG Electronics, Inc. (LG Corporation)
• Original Assignee: LG Electronics, Inc. (LG Corporation)
• Inventors: Park, Seungwook, Lim, Jaehyun, Jeon, Yongjoon, Hendry, Hendry, Choi, Younghee, Sung, Jaewon, Kim, Jungsun, Jeon, Byeongmoon, Park, Joonyoung
• Primary Examiner(s): Geroleo, Francis
• Application Number:
  US15/883,280
• Publication Number:
  US 20180160137A1
• Time in Patent Office: 434 Days
• CPC Class Codes: H04N 19/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
• CPC Class Codes: H04N 19/11 among a plurality of spatial predictive coding modes
• CPC Class Codes: H04N 19/139 Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/503 involving temporal prediction adaptive coding with adaptive selection between spatial and temporal predictive coding H04N19/107; adaptive coding with adaptive selection among a plurality of temporal predictive coding modes H04N19/109
• CPC Class Codes: H04N 19/513 Processing of motion vectors
• CPC Class Codes: H04N 19/517 by encoding
• CPC Class Codes: H04N 19/56 Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
• CPC Class Codes: H04N 19/573 Motion compensation with multiple frame prediction using two or more reference frames in a given prediction direction
• CPC Class Codes: H04N 19/58 Motion compensation with long-term prediction, i.e. the reference frame for a current frame not being the temporally closest one H04N19/23 takes precedence
• CPC Class Codes: H04N 19/593 involving spatial prediction techniques

Abstract

The present invention relates to the encoding and decoding of image information. According to the present invention, the decoding method comprises the steps of: entropy-decoding received information; performing inter prediction on a current block based on the entropy-decoded information; and restoring images by using the prediction results, wherein, in the inter prediction step, a skip mode or merge mode is applied to the current block and movement information of the current block may be determined based on the movement information of a neighboring block of the current block.

Claims

1. A method for an inter prediction, the method comprising:

receiving, by a decoding apparatus, inter prediction mode information and merge index information for a current block;

determining, by the decoding apparatus, a merge mode is used as an inter prediction mode for the current block based on the inter prediction mode information;

configuring, by the decoding apparatus, merge candidates including spatial merge candidates and a temporal merge candidate based on spatial neighboring blocks and a temporal neighboring block of the current block, wherein the temporal neighboring block is located in a collocated picture;

selecting, by the decoding apparatus, a merge candidate from the configured merge candidates for the merge mode based on the merge index information;

deriving, by the decoding apparatus, motion information for the selected merge candidate as motion information of the current block, wherein the motion information of the current block includes a motion vector and a reference picture index; and

generating, by the decoding apparatus, prediction samples of the current block using the motion vector and a reference picture indicated by the reference picture index,

wherein motion information for a spatial merge candidate is derived from motion information of a spatial neighboring block of the current block,

wherein a motion vector for the temporal merge candidate is derived from a motion vector of the temporal neighboring block,

wherein a reference picture index for the temporal merge candidate is set equal to 0 regardless of any of values of reference picture indexes of the spatial neighboring blocks and the temporal neighboring block.

2. The method of claim 1, wherein the temporal neighboring block is determined as unavailable when K spatial neighboring blocks are available and K is a maximum number of the merge candidates.

3. The method of claim 1, wherein the spatial neighboring blocks includes a left neighboring block and a bottom left neighboring block of the current block, and

wherein the left neighboring block is determined as unavailable when the current block is a second partition of a coding unit block comprising vertically long rectangular partitions.

4. The method of claim 3, wherein the left neighboring block is determined as unavailable when the current block is the second partition of the coding unit block, wherein a partition type of the current block is PART_N×

2N, PART_nL×

2N or PART_nR×

2N.

5. The method of claim 1, wherein the spatial neighboring blocks includes a top left neighboring block, a top neighboring block, and a top right neighboring block of the current block, and

wherein the top neighboring block is determined as unavailable when current block is a second partition of a coding unit block comprising horizontally long rectangular partitions.

6. The method of claim 5, wherein the top neighboring block is determined as unavailable when the current block is the second partition of the coding unit block, wherein a partition type of the current block is PART_2N×

N, PART_2N×

nU or PART_2N×

nD.

11. The apparatus of claim 1, wherein the spatial neighboring blocks includes a top left neighboring block, a top neighboring block, and a top right neighboring block of the current block, and

wherein the top neighboring block is determined as unavailable when current block is a second partition of a coding unit block comprising horizontally long rectangular partitions.

12. The apparatus of claim 11, wherein the top neighboring block is determined as unavailable when the current block is the second partition of the coding unit block, wherein a partition type of the current block is PART_2N×

N, PART_2N×

nU or PART_2N×

nD.

7. A decoding apparatus, comprising:

an entropy decoder for receiving inter prediction mode information and merge index information for a current block; and

a predictor for determining a merge mode is used as an inter prediction mode for the current block based on the inter prediction mode information, for configuring merge candidates including spatial merge candidates and a temporal merge candidate based on spatial neighboring blocks and a temporal neighboring block of the current block, wherein the temporal neighboring block is located in a collocated picture, for selecting a merge candidate from the configured merge candidates for the merge mode based on the merge index information, for deriving motion information for the selected merge candidate as motion information of the current block, wherein the motion information of the current block includes a motion vector and a reference picture index, and for generating prediction samples of the current block using the motion vector and a reference picture indicated by the reference picture index,

wherein motion information for a spatial merge candidate is derived from motion information of a spatial neighboring block of the current block,

wherein a motion vector for the temporal merge candidate is derived from a motion vector of the temporal neighboring block,

wherein a reference picture index for the temporal merge candidate is set equal to 0 regardless of any of values of reference picture indexes of the spatial neighboring blocks and the temporal neighboring block.

8. The apparatus of claim 7, wherein the temporal neighboring block is determined as unavailable when K spatial neighboring blocks are available and K is a maximum number of the merge candidates.

9. The apparatus of claim 7, wherein the spatial neighboring blocks includes a left neighboring block and a bottom left neighboring block of the current block, and

wherein the left neighboring block is determined as unavailable when the current block is a second partition of a coding unit block comprising vertically long rectangular partitions.

10. The apparatus of claim 9, wherein the left neighboring block is determined as unavailable when the current block is the second partition of the coding unit block, wherein a partition type of the current block is PART_N×

2N, PART_nL×

2N or PART_nR×

2N.