US 11,902,594 B2
Apparatus and method for video encoding or decoding
Jeong-yeon Lim, Seoul (KR); Jae-seob Shin, Seoul (KR); Se-hoon Son, Seoul (KR); and Sun-young Lee, Seoul (KR)
Assigned to SK TELECOM CO., LTD., Seoul (KR)
Filed by SK TELECOM CO., LTD., Seoul (KR)
Filed on Jan. 20, 2023, as Appl. No. 18/099,393.
Application 18/099,393 is a continuation of application No. 17/380,419, filed on Jul. 20, 2021, granted, now 11,595,700.
Application 17/380,419 is a continuation of application No. 16/505,080, filed on Jul. 8, 2019, granted, now 11,102,517, issued on Aug. 24, 2021.
Application 16/505,080 is a continuation of application No. PCT/KR2018/000264, filed on Jan. 5, 2018.
Claims priority of application No. 10-2017-0003156 (KR), filed on Jan. 9, 2017; and application No. 10-2018-0001062 (KR), filed on Jan. 4, 2018.
Prior Publication US 2023/0156240 A1, May 18, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 7/12 (2006.01); H04N 19/96 (2014.01); H04N 19/103 (2014.01); H04N 19/176 (2014.01); H04N 19/122 (2014.01); H04N 19/119 (2014.01); H04N 19/12 (2014.01); H04N 19/64 (2014.01)
CPC H04N 19/96 (2014.11) [H04N 19/103 (2014.11); H04N 19/119 (2014.11); H04N 19/12 (2014.11); H04N 19/122 (2014.11); H04N 19/176 (2014.11); H04N 19/647 (2014.11)] 7 Claims
OG exemplary drawing
 
1. An apparatus for decoding video data, comprising:
a decoder configured to
receive a bitstream including a coding tree unit (CTU) of encoded video data and split information related to a tree split structure of the CTU of the video data, wherein the bitstream includes information on maximum block size allowed for the root node of a binary tree,
determine a square or rectangular shaped coding block to be decoded, wherein the coding block is a block which is split from the CTU in the tree split structure using the split information and corresponds to a leaf node of the tree split structure, the tree split structure allowing, depending on the split information, a quadtree having multi-depth of consecutive quadtree divisions and a binary tree having multi-depth of consecutive binary tree divisions, wherein the tree split structure is configured such that the binary tree is rooted from a leaf node of the quadtree when a size of a block corresponding to the leaf node of the quadtree is not greater than the maximum block size, and
after determining the coding block to be decoded by splitting the CTU in the tree split structure, determine a prediction partition mode for the coding block corresponding to the leaf node of the tree split structure among a plurality of prediction partition modes using mode type information included in the bitstream, the plurality of prediction partition modes including at least one prediction partition mode allowing the coding block to be predicted by being split into two equal-sized triangles; and
a reconstructor configured to reconstruct the coding block corresponding to the leaf node according to the determined prediction partition mode,
wherein the reconstructor is configured to reconstruct the coding block which is split into the two triangles, by performing a process comprising:
configuring a plurality of merge candidates comprised of motion vectors of pre-decoded blocks neighboring to the coding block,
reconstructing, from the bitstream, two merge indexes which respectively correspond to the two triangles, wherein each of the merge indexes is used for indicating one of the plurality of merge candidates,
setting motion vectors respectively corresponding to the two triangles equal to merge candidates which are respectively indicated by the two merge indexes among the plurality of merge candidates, and
inter-predicting the coding block which is split into the two triangles, by using the set motion vectors,
wherein the at least one prediction partition mode includes a down-right diagonal split type and an up-right diagonal split type.