US 12,143,576 B2
Method and device for encoding/decoding image, and recording medium in which bitstream is stored
Jin Ho Lee, Daejeon (KR); Jung Won Kang, Daejeon (KR); Hyun Suk Ko, Daejeon (KR); Sung Chang Lim, Daejeon (KR); Ha Hyun Lee, Seoul (KR); Dong San Jun, Daejeon (KR); and Hui Yong Kim, Daejeon (KR)
Assigned to LX Semicon Co., Ltd., Daejeon (KR)
Filed by LX Semicon Co., Ltd., Seoul (KR)
Filed on Jul. 17, 2023, as Appl. No. 18/222,566.
Application 18/222,566 is a continuation of application No. 16/628,850, granted, now 11,743,456, previously published as PCT/KR2018/007016, filed on Jun. 21, 2018.
Claims priority of application No. 10-2017-0086113 (KR), filed on Jul. 6, 2017; and application No. 10-2017-0171377 (KR), filed on Dec. 13, 2017.
Prior Publication US 2024/0031561 A1, Jan. 25, 2024
Int. Cl. H04N 19/11 (2014.01); H04N 19/105 (2014.01); H04N 19/117 (2014.01); H04N 19/176 (2014.01); H04N 19/593 (2014.01)
CPC H04N 19/11 (2014.11) [H04N 19/105 (2014.11); H04N 19/117 (2014.11); H04N 19/176 (2014.11); H04N 19/593 (2014.11)] 11 Claims
OG exemplary drawing
 
1. An image decoding method performed by a decoding apparatus, the method comprising:
receiving partition information for a coding tree unit and size information;
partitioning a split target block in the coding tree unit into a plurality of coding units based on the partition information; and
performing intra prediction for each of the plurality of coding units,
wherein a partition type for the coding tree unit includes at least one of quad tree split, binary tree split and ternary tree split,
wherein the partition information includes quad tree split information for the quad tree split and multi-type tree split information for the binary tree split and the ternary tree split,
wherein the size information includes minimum size information of the quad tree split and information related to a maximum size of the binary tree split or a maximum size of the ternary tree split,
wherein based on a size of the split target block being equal to a minimum size of binary tree, the split target block is not split into the binary tree, and
wherein based on the size of the split target block being equal to two times as large as a minimum size of ternary tree, the split target block is not split into the ternary tree.