Method and apparatus for processing a video signal

• US 10,666,947 B2
• Filed: 12/19/2018
• Issued: 05/26/2020
• Est. Priority Date: 05/04/2010
• Status: Active Grant

• Current Assignee: LG Electronics, Inc. (LG Corporation)
• Original Assignee: LG Electronics, Inc. (LG Corporation)
• Inventors: Park, Seungwook, Park, Joonyoung, Kim, Jungsun, Choi, Younghee, Jeon, Yongjoon, Sung, Jaewon, Jeon, Byeongmoon, Lim, Jaehyun
• Primary Examiner(s): Holder, Anner N
• Application Number:
  US16/225,858
• Publication Number:
  US 20190124336A1
• Time in Patent Office: 524 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/139 Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability
• CPC Class Codes: H04N 19/159 Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
• CPC Class Codes: H04N 19/167 Position within a video image, e.g. region of interest [ROI]
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/51 Motion estimation or motion compensation
• CPC Class Codes: H04N 19/513 Processing of motion vectors
• CPC Class Codes: H04N 19/521 for estimating the reliability of the determined motion vectors or motion vector field, e.g. for smoothing the motion vector field or for correcting motion vectors
• 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/61 in combination with predictive coding
• CPC Class Codes: H04N 19/70 characterised by syntax aspects related to video coding, e.g. related to compression standards
• CPC Class Codes: H04N 19/96 Tree coding, e.g. quad-tree coding

Abstract

The present invention discloses a method and apparatus for encoding or decoding a video signal. The method for processing a video signal according to the present invention uses a merging mode in which prediction information on a neighbor unit is used instead of transmitting prediction information on the present unit, so as to improve coding efficiency. In this case, the number of available candidate units for merging among the units in a predetermined position is determined, and information for the merging mode is acquired on the basis of the number of the available candidate units for merging. The unit to be merged is determined using the information for the merging mode, and prediction information on the unit to be merged is acquired. The prediction value for the present unit is acquired using the prediction information on the unit to be merged, and the present unit is restored using the acquired prediction value.

Claims

1. A method for decoding a bitstream for a video signal comprising at least one coding block by a decoding apparatus, the method comprising:

obtaining, by the decoding apparatus, merge flag information of a current prediction block of a plurality of prediction blocks from the bitstream, the plurality of prediction blocks being partitioned from the coding block; and

based on the merge flag information indicating that prediction information of the current prediction block is determined by prediction information of one of merging candidates, decoding, by the decoding apparatus, the current prediction block based on prediction information of a merging candidate selected from among the merging candidates,

wherein, based on the coding block being partitioned into two prediction blocks each of which has a horizontal size greater than a vertical size and the current prediction block being a bottom prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a top prediction block of the two prediction blocks.

2. The method of claim 1, wherein each of the prediction information comprises reference index information and motion vector information of a corresponding prediction block.

3. The method of claim 1, wherein the current prediction block is coded in an inter-prediction mode.

4. The method of claim 1, wherein each of the at least one neighboring prediction block is coded in an inter-prediction mode.

5. The method of claim 1, wherein based on the coding block being partitioned into two prediction blocks each of which has a vertical size greater than a horizontal size and the current prediction block being a right prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a left prediction block of the two prediction blocks.

6. The method of claim 1, wherein the at least one neighboring prediction block includes at least one of a left neighboring prediction block, a top-left neighboring prediction block, a top-right neighboring prediction block, or a bottom-left neighboring prediction block.

7. The method of claim 1, further comprising:

obtaining, by the decoding apparatus, merge index information from the bitstream,

wherein the merge index information indicates the selected merging candidate from among the merging candidates.

8. The method of claim 1, wherein the merging candidates include up to five neighboring prediction blocks adjacent to the current prediction block.

9. A decoding apparatus for decoding a bitstream for a video signal comprising at least one coding block, the decoding apparatus comprising:

an entropy decoding unit configured to obtain merge flag information of a current prediction block of a plurality of prediction blocks from the bitstream, the plurality of prediction blocks being partitioned from the coding block; and

an inter prediction unit configured to, based on the merge flag information indicating that prediction information of the current prediction block is determined by prediction information of one of merging candidates, decode the current prediction block based on prediction information of a merging candidate selected from among the merging candidates,

wherein, based on the coding block being partitioned into two prediction blocks each of which has a horizontal size greater than a vertical size and the current prediction block being a bottom prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a top prediction block of the two prediction blocks.

10. The decoding apparatus of claim 9, wherein each of the prediction information comprises reference index information and motion vector information of a corresponding prediction block.

11. The decoding apparatus of claim 9, wherein the current prediction block is coded in an inter-prediction mode.

12. The decoding apparatus of claim 9, wherein each of the at least one neighboring prediction block is coded in an inter-prediction mode.

13. The decoding apparatus of claim 9, wherein based on the coding block being partitioned into two prediction blocks each of which has a vertical size greater than a horizontal size and the current prediction block being a right prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a left prediction block of the two prediction blocks.

14. The decoding apparatus of claim 9, wherein the at least one neighboring prediction block includes at least one of a left neighboring prediction block, a top-left neighboring prediction block, a top-right neighboring prediction block, or a bottom-left neighboring prediction block.

15. The decoding apparatus of claim 9, wherein the entropy decoding unit is further configured to obtain merge index information from the bitstream,

wherein the merge index information indicates the selected merging candidate from among the merging candidates.

16. The decoding apparatus of claim 9, wherein the merging candidates include up to five neighboring prediction blocks adjacent to the current prediction block.

17. A method for encoding a bitstream for a video signal comprising at least one coding block by an encoding apparatus, the method comprising:

encoding, by the encoding apparatus, merge flag information of a current prediction block of a plurality of prediction blocks into the bitstream, the plurality of prediction blocks being partitioned from the coding block; and

based on the merge flag information indicating that prediction information of the current prediction block is determined by prediction information of one of merging candidates, encoding, by the encoding apparatus, the current prediction block based on prediction information of a merging candidate selected from among the merging candidates,

wherein, based on the coding block being partitioned into two prediction blocks each of which has a horizontal size greater than a vertical size and the current prediction block being a bottom prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a top prediction block of the two prediction blocks.

18. A non-transitory computer-readable medium in which the bitstream generated by the method of claim 17 is stored.

19. An encoding apparatus for encoding a bitstream for a video signal comprising at least one coding block, the encoding apparatus comprising:

an entropy coding unit configured to encode merge flag information of a current prediction block of a plurality of prediction blocks into the bitstream, the plurality of prediction blocks being partitioned from the coding block; and

an inter prediction unit configured to, based on the merge flag information indicating that prediction information of the current prediction block is determined by prediction information of one of merging candidates, encode the current prediction block based on prediction information of a merging candidate selected from among the merging candidates,

wherein, based on the coding block being partitioned into two prediction blocks each of which has a horizontal size greater than a vertical size and the current prediction block being a bottom prediction block of the two prediction blocks, the merging candidates comprise at least one neighboring prediction block adjacent to the current prediction block other than a top prediction block of the two prediction blocks.