Checking order of motion candidates in LUT
AssigneesBeijing Bytedance Network Technology Co., Ltd., Bytedance Inc.
InventorsLi Zhang, Kai Zhang, Hongbin Liu, Yue Wang
Life of this patent
Estimating the term…
Abstract
A method of video processing includes maintaining tables, wherein each table includes a set of motion candidates and each motion candidate is associated with corresponding motion information; and performing a conversion between a first video block and a bitstream representation of a video including the first video block based on at least some of tables, the performing including checking motion candidates in a table in an order defined in a rule until a checking termination criteria is met.
Claims25
A video processing method, comprising:
- maintaining one or more tables, wherein each table includes one or more candidates derived from one or more video blocks that have been coded;
- constructing a candidate list for a current video block of a video, wherein at least one candidate in the table is checked in an order of at least one index of the at least one candidate;
- determining motion information of the current video block using the candidate list;
- and
- coding the current video block based on the determined motion information, and
- wherein K candidates from the table which have indices equal to a0, a0−T0, a0−T0−T1−T2, . . . a0−T0−T1−T2− . . . −TK−1 are checked in an order of K indices wherein a0 and Ti are integer values, i being 0 . . . K−1.
A video processing apparatus comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to:
- maintain one or more tables, wherein each table includes one or more candidates derived from one or more video blocks that have been coded;
- construct a candidate list for a current video block of a video, wherein at least one candidate in the table is checked in an order of at least one index of the at least one candidate;
- determine motion information of the current video block using the candidate list;
- and
- code the current video block based on the determined motion information, and
- wherein K candidates from the table which have indices equal to a0, a0−T0, a0−T0−T1−T2, . . . a0−T0−T1−T2− . . . −TK−1 are checked in an order of K indices wherein a0 and Ti are integer values, i being 0 . . . K−1.
A non-transitory computer-readable storage medium storing instructions that cause a processor to:
- maintain one or more tables, wherein each table includes one or more candidates derived from one or more video blocks that have been coded;
- construct a candidate list for a current video block of a video, wherein at least one candidate in the table is checked in an order of at least one index of the at least one candidate;
- determine motion information of the current video block using the candidate list;
- and
- code the current video block based on the determined motion information, and
- wherein K candidates from the table which have indices equal to a0, a0−T0, a0−T0−T1−T2, . . . a0−T0−T1−T2− . . . −TK−1 are checked in an order of K indices wherein a0 and Ti are integer values, i being 0 . . . K−1.
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 one or more tables, wherein each table includes one or more candidates derived from one or more video blocks that have been coded;
- constructing a candidate list for a current video block of a video, wherein at least one candidate in the table is checked in an order of at least one index of the at least one candidate;
- determining motion information of the current video block using the candidate list;
- and
- coding the current video block based on the determined motion information, and
- wherein K candidates from the table which have indices equal to a0, a0−T0, a0−T0−T1−T2, . . . a0−T0−T1−T2− . . . −TK−1 are checked in an order of K indices wherein a0 and Ti are integer values, i being 0 . . . K−1.
Dependencies are inferred from the claim text.