Geometry-based priority for the construction of candidate lists

Patent metadata

Field	Value
Publication number	US-2018070100-A1
Application number	US-201715695606-A
Country	US
Kind code	A1
Filing date	Sep 5, 2017
Priority date	Sep 6, 2016
Publication date	Mar 8, 2018
Grant date	—

Abstract

In one example, a device includes a memory configured to store the video data; and one or more processors implemented in circuitry and configured to determine a plurality of distances between a first representative point of a current block of video data and a plurality of second representative points of neighboring blocks to the current block, add one or more of the neighboring blocks as candidates to a candidate list of the current block in an order according to the distances between the first representative point and the second representative points, and code the current block using the candidate list. The candidate list may be, for example, a merge list, an AMVP list, or a most probable mode list. Alternatively, the candidate list may be a list of candidates from which to determine context information for context-adaptive binary arithmetic coding (CABAC).

First claim

What is claimed is:

1 . A method of coding video data, the method comprising:
determining a plurality of distances between a first representative point of a current block of video data and a plurality of second representative points of neighboring blocks to the current block; adding one or more of the neighboring blocks as candidates to a candidate list of the current block in an order according to the distances between the first representative point and the second representative points; and coding the current block using the candidate list.

2 . The method of claim 1 , wherein the candidate list comprises one of a merge candidate list, an advanced motion vector prediction (AMVP) candidate list, or an intra most probable mode (MPM) list.

3 . The method of claim 2 , wherein the candidate list comprises the merge candidate list, and wherein coding the current block comprises coding motion information for the current block according to merge mode using a candidate of the merge candidate list.

4 . The method of claim 2 , wherein the candidate list comprises the AMVP candidate list, and wherein coding the current block comprises coding motion information for the current block according to AMVP mode using a candidate of the AMVP candidate list.

5 . The method of claim 2 , wherein the candidate list comprises the intra MPM list, and wherein coding the current block comprises coding an indication of an intra-prediction mode used to intra-predict the current block using the intra MPM list, and intra-predicting the current block using the intra-prediction mode.

6 . The method of claim 1 , wherein at least one of the neighboring blocks comprises a sub-prediction unit (sub-PU), and wherein the one of the second representative points associated with the sub-PU comprises a center point of the sub-PU.

7 . The method of claim 1 , wherein the first representative point of the current block comprises a center point of the current block and the second representative points of the neighboring blocks comprise respective center points of the neighboring blocks.

8 . The method of claim 1 , wherein the first representative point of the current block comprises a top-left point of the current block and the second representative points of the neighboring blocks comprise respective top-left points of the neighboring blocks.

9 . The method of claim 1 , wherein the neighboring blocks comprise one or more of spatially neighboring blocks to the current block or temporally neighboring blocks to the current block.

10 . The method of claim 1 , wherein the candidate list comprises a list of candidates from which to determine context information for context-adaptive binary arithmetic coding (CABAC) of a value for a syntax element of the current block, and wherein coding the current block comprises CABAC coding the value for the syntax element of the current block using the context information determined from the list of candidates.

11 . The method of claim 10 , wherein the syntax element comprises one of a coding unit transquant bypass flag, a coding unit skip flag, a coded block flag, a prediction mode flag, a residual quadtree transform root coded block flag, a merge index, a merge flag, a coded block flag for a luminance block, or a coded block flag for a chrominance block.

12 . The method of claim 10 , further comprising determining the context information, comprising weighting contributions of values from the neighboring blocks according to the distances between the first representative point and the second representative points.

13 . The method of claim 1 , wherein coding comprises encoding the current block using the candidate list.

14 . The method of claim 1 , wherein coding comprises decoding the current block using the candidate list.

15 . A device for coding video data, the device comprising:
a memory configured to store the video data; and one or more processors implemented in circuitry and configured to:
determine a plurality of distances between a first representative point of a current block of video data and a plurality of second representative points of neighboring blocks to the current block;
add one or more of the neighboring blocks as candidates to a candidate list of the current block in an order according to the distances between the first representative point and the second representative points; and
code the current block using the candidate list.

16 . The device of claim 15 , wherein the candidate list comprises one of a merge candidate list, an advanced motion vector prediction (AMVP) candidate list, or an intra most probable mode (MPM) list.

17 . The device of claim 15 , wherein at least one of the neighboring blocks comprises a sub-prediction unit (sub-PU), and wherein the one of the second representative points associated with the sub-PU comprises a center point of the sub-PU.

18 . The device of claim 15 , wherein the first representative point of the current block comprises a center point of the current block and the second representative points of the neighboring blocks comprise respective center points of the neighboring blocks.

19 . The device of claim 15 , wherein the candidate list comprises a list of candidates from which to determine context information for context-adaptive binary arithmetic coding (CABAC) of a value for a syntax element of the current block, and wherein the one or more processors are configured to CABAC code the value for the syntax element of the current block using the context information determined from the list of candidates.

20 . The device of claim 15 , wherein the device comprises one of a video encoder configured to encode the current block or a video decoder configured to decode the current block.

21 . A device for coding video data, the device comprising:
means for determining a plurality of distances between a first representative point of a current block of video data and a plurality of second representative points of neighboring blocks to the current block; means for adding one or more of the neighboring blocks as candidates to a candidate list of the current block in an order according to the distances between the first representative point and the second representative points; and means for coding the current block using the candidate list.

22 . The device of claim 21 , wherein the candidate list comprises one of a merge candidate list, an advanced motion vector prediction (AMVP) candidate list, or an intra most probable mode (MPM) list.

23 . The device of claim 21 , wherein at least one of the neighboring blocks comprises a sub-prediction unit (sub-PU), and wherein the one of the second representative points associated with the sub-PU comprises a center point of the sub-PU.

24 . The device of claim 21 , wherein the first representative point of the current block comprises a center point of the current block and the second representative points of the neighboring blocks comprise respective center points of the neighboring blocks.

25 . The device of claim 21 , wherein the candidate list comprises a list of candidates from which to determine context information for context-adaptive binary arithmetic coding (CABAC) of a value for a syntax element of the current block, and wherein the means for coding the current block comprise means for CABAC coding the value for the syntax element of the current block using the context information determi

Assignees

• Qualcomm Inc

Inventors

• Chen Yi-Wen
• Chien Wei-Jung
• Zhang Li
• Zhang Kai
• Karczewicz Marta

Classifications

• H04N19/13 Primary

  Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC] · CPC title

• H04N19/139

  Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability · CPC title

• H04N19/52 Primary

  by predictive encoding · CPC title

• H04N19/189

  characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding · CPC title

• H04N19/174

  the region being a slice, e.g. a line of blocks or a group of blocks · CPC title