US 12,225,202 B2
Encoding method, encoding apparatus, and program
Yuya Omori, Musashino (JP); Ken Nakamura, Musashino (JP); Daisuke Kobayashi, Musashino (JP); and Hiroe Iwasaki, Musashino (JP)
Assigned to Nippon Telegraph and Telephone Corporation, Tokyo (JP)
Appl. No. 17/796,528
Filed by Nippon Telegraph and Telephone Corporation, Tokyo (JP)
PCT Filed Feb. 25, 2020, PCT No. PCT/JP2020/007453
§ 371(c)(1), (2) Date Jul. 29, 2022,
PCT Pub. No. WO2021/171360, PCT Pub. Date Sep. 2, 2021.
Prior Publication US 2023/0053579 A1, Feb. 23, 2023
Int. Cl. H04N 19/119 (2014.01); H04N 19/137 (2014.01); H04N 19/176 (2014.01); H04N 19/96 (2014.01)
CPC H04N 19/137 (2014.11) [H04N 19/176 (2014.11); H04N 19/96 (2014.11)] 6 Claims
OG exemplary drawing
 
1. A coding method executed by a coding apparatus comprising at least one processor or at least one circuit, the method comprising:
partitioning a first block having a predetermined size in an original image into a group of second blocks each being a block serving as a unit for coding, by quad tree, ternary tree, or binary tree; and
predicting movement for each of the second blocks,
wherein the partitioning includes first sub-partitioning and second sub-partitioning,
the first sub-partitioning includes partitioning a whole of the first block by any one of the quad tree, the ternary tree, or the binary tree,
the second sub-partitioning includes further partitioning, by any one of the quad tree, the ternary tree, or the binary tree not selected in the first sub-partitioning, parts of the first block partitioned, to generate the second blocks, and
the predicting includes executing accurate prediction processing for each of the second blocks by progressively increasing the kinds of multiple reference lines to three as a final stage of the partitioning is approaching.