Partial/full pruning when adding a HMVP candidate to merge/AMVP
A method of video processing is provided to include: maintaining a set of tables, wherein each table includes motion candidates and each motion candidate is associated with corresponding motion information; updating a motion candidate list based on motion candidates in one or more tables using a pruning operation on the motion candidates; and performing a conversion between a first video block and a bitstream representation of a video including the first video block using the constructed motion candidate list.
1. A method for video processing, comprising:
maintaining a table, wherein the table comprises one or more candidates derived from one or more video blocks that have been coded, and arrangement of the candidates in the table is based on a sequence of addition of the candidates into the table;
constructing a candidate list, wherein at least one first candidate in the table is checked during the constructing, wherein a pruning operation is utilized for the at least one first candidate to determine whether to add the first candidate into the candidate list;
deriving motion information using the candidate list;
coding the current video block based on the motion information,
wherein the at least one first candidate is pruned with at least one second candidate which has been included in the candidate list, and each one of the at least one second candidate is selected from the candidate list based on where the each one is derived from, and the second candidate is a spatial candidate which is derived from a given spatial neighboring block of the current video block; and
wherein a total number of the at least one second candidate is K, wherein K is equal to or less than 2.
2. The method of claim 1 , wherein the at least one second candidate comprises first one candidate or N candidates in the candidate list, N being an integer greater than 1.
3. The method of claim 1 , wherein the at least one second candidate comprises at least one of: a spatial candidate derived from block A 1 or a spatial candidate derived from block B 1 ; wherein block A 1 is a left neighboring block relative to the current video block and block B 1 is an above neighboring block relative to the current video block.
4. The method of claim 1 , wherein the at least one second candidate is a part of candidates that have been in the candidate list.
5. The method of claim 4 , wherein the part of candidates in the candidate list is a part of spatial candidates.
6. The method of claim 1 , wherein if a candidate of the at least one first candidate is different from any one of the at least one second candidate, the candidate is added into the candidate list.
7. The method of claim 1 , wherein the at least one second candidate excludes a sub-block based candidate.
8. The method of claim 1 , wherein the pruning operation is not invoked when adding a candidate from the table to the candidate list.
9. The method of claim 1 , wherein the candidate in the table is associated with motion information including at least one of: a prediction direction, a reference picture index, motion vector values, an intensity compensation flag, an affine flag, a motion vector difference precision, or motion vector difference value.
10. The method of claim 1 , wherein the method further comprises:
updating the table using the motion information of the current video block.
11. The method of claim 10 , wherein a candidate in the table is deleted if the table is full before a candidate corresponding to the motion information is added into the list.
12. The method of claim 1 , wherein the candidate list is a merge candidate list.
13. The method of claim 1 , wherein the coding comprises encoding the current video block into a bitstream.
14. The method of claim 1 , wherein the coding comprises decoding the current video block from a bitstream.
15. An apparatus for coding video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to:
maintain a table, wherein the table comprises one or more candidates derived from one or more previously coded video blocks that are coded prior to a current video block, and arrangement of the candidates in the table is based on a sequence of addition of the candidates into the table;
construct a candidate list wherein during the constructing using the table, a pruning operation is utilized for at least one first candidate in the table to determine whether to add the first candidate into the candidate list;
derive motion information using the candidate list;
code the current video block based on the motion information,
wherein the at least one first candidate is pruned with at least one second candidate which has been included in the candidate list, and each one of the at least one second candidate is selected from the candidate list based on where the each one is derived from, and the second candidate is a spatial candidate which is derived from a given spatial neighboring block of the current video block; and
wherein a total number of the at least one second candidate is K, wherein K is equal to or less than 2.
16. A non-transitory computer-readable storage medium storing instructions that cause a processor to:
maintain a table, wherein the table comprises one or more candidates derived from one or more previously coded video blocks that are coded prior to a current video block, and arrangement of the candidates in the table is based on a sequence of addition of the candidates into the table;
construct a candidate list wherein during the constructing using the table, a pruning operation is utilized for at least one first candidate in the table to determine whether to add the first candidate into the candidate list;
derive motion information using the candidate list;
code the current video block based on the motion information,
wherein the at least one first candidate is pruned with at least one second candidate which has been included in the candidate list, and each one of the at least one second candidate is selected from the candidate list based on where the each one is derived from, and the second candidate is a spatial candidate which is derived from a given spatial neighboring block of the current video block; and
wherein a total number of the at least one second candidate is K, wherein K is equal to or less than 2.
17. The method of claim 1 , wherein checking is terminated when a number of candidates in the candidate list reaches a maximally allowed candidate number of the candidate list minus a threshold, wherein the threshold is a positive integer.
18. A non-transitory computer-readable recording medium storing a bitstream representation which is generated by a method with a video processing apparatus, wherein the method comprises:
maintaining a table, wherein the table comprises one or more candidates derived from one or more video blocks that have been coded, and arrangement of the candidates in the table is based on a sequence of addition of the candidates into the table;
constructing a candidate list, wherein at least one first candidate in the table is checked during the constructing, wherein a pruning operation is utilized for the at least one first candidate to determine whether to add the first candidate into the candidate list;
deriving motion information using the candidate list;
coding the current video block based on the motion information
wherein the at least one first candidate is pruned with at least one second candidate which has been included in the candidate list, and each one of the at least one second candidate is selected from the candidate list based on where the each one is derived from, and the second candidate is a spatial candidate which is derived from a given spatial neighboring block of the current video block; and
wherein a total number of the at least one second candidate is K, wherein K is equal to or less than 2.