# US 12,113,977 B2 · Method and apparatus for encoding/decoding image by using boundary processing, and recording medium for storing bitstream > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,113,977 B2 - Document ID: US12113977B2 - Status: Granted - Kind: B2 - Application number: 18/317,785 - Filed: 2023-05-15 - Published: 2023-09-28 - Granted: 2024-10-08 - Earliest claimed: 2018-09-19 - Assignees: Electronics and Telecommunications Research Institute - Applicants: Electronics and Telecommunications Research Institute - Inventors: Sung Chang Lim; Jung Won Kang; Ha Hyun Lee; Jin Ho Lee; Hui Yong Kim - Web page: https://patentgrep.com/patent/US12113977B2 ## CPC - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/136: Incoming video signal characteristics or properties - H04N 19/157: Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/96: Tree coding, e.g. quad-tree coding - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract There is provided a method and apparatus of encoding/decoding an image. The method comprises decoding information on block partitioning of a current block included in a current picture from a bitstream; determining a partitioning method of the current block on the basis of the information; and partitioning the current block by using the determined partitioning method, wherein the partitioning method is determined on the basis of whether or not the current block includes a predetermined boundary. ## Claims ### Claim 1 A method of decoding an image, the method comprising: decoding information on block partitioning of a current block included in a current picture from a bitstream; determining a partitioning method of the current block on the basis of the information; and partitioning the current block by using the determined partitioning method, wherein the partitioning method is determined on the basis of whether or not the current block includes a predetermined boundary, and wherein when the current block includes a right boundary and a bottom boundary of the current picture and a width of the current block is greater than a size of a smallest quadtree block, the partitioning method is determined as quad-tree partitioning. ### Claim 2 (depends on 1) The method of claim 1, wherein the information on block partitioning includes at least one of information on a size of the current block, information on a depth of the current block, or information on whether or not to perform partitioning. ### Claim 3 (depends on 1) The method of claim 1, wherein the partitioning method includes at least one of quad-tree partitioning, horizontal binary-tree partitioning, vertical binary-tree partitioning, horizontal ternary-tree partitioning, or vertical ternary-tree partitioning. ### Claim 4 (depends on 1) The method of claim 1, wherein the predetermined boundary includes at least one of a right boundary, a bottom boundary, a left boundary, or a top boundary of at least one of a picture, a sub-picture, a slice, a tile, or a brick to which the current block belongs. ### Claim 5 A method of encoding an image, the method comprising: determining a partitioning method of a current block included in a current picture; partitioning the current block by using the determined partitioning method; and encoding information on block partitioning of the partitioning method, wherein the partitioning method is determined on the basis of whether or not the current block includes a predetermined boundary, and wherein when the current block includes a right boundary and a bottom boundary of the current picture and a width of the current block is greater than a size of a smallest quadtree block, the partitioning method is determined as quad-tree partitioning. ### Claim 6 (depends on 5) The method of claim 5, wherein the information on block partitioning includes at least one of information on a size of the current block, information on a depth of the current block, or information on whether or not to perform partitioning. ### Claim 7 (depends on 5) The method of claim 5, wherein the partitioning method includes at least one of quad-tree partitioning, horizontal binary-tree partitioning, vertical binary-tree partitioning, horizontal ternary-tree partitioning, or vertical ternary-tree partitioning. ### Claim 8 (depends on 5) The method of claim 5, wherein the predetermined boundary includes at least one of a right boundary, a bottom boundary, a left boundary, or a top boundary of at least one of a picture, a sub-picture, a slice, a tile, or a brick to which the current block belongs. ### Claim 9 A non-transitory computer-readable medium storing a bitstream generated by an encoding method, the method comprising: determining a partitioning method of a current block included in a current picture; partitioning the current block by using the determined partitioning method; and encoding information on block partitioning of the partitioning method, wherein the partitioning method is determined on the basis of whether or not the current block includes a predetermined boundary, and wherein when the current block includes a right boundary and a bottom boundary of the current picture and a width of the current block is greater than a size of a smallest quadtree block, the partitioning method is determined as quad-tree partitioning. ### Claim 10 (depends on 9) The non-transitory computer-readable medium of claim 9, wherein the information on block partitioning includes at least one of information on a size of the current block, information on a depth of the current block, or information on whether or not to perform partitioning. ### Claim 11 (depends on 9) The non-transitory computer-readable medium of claim 9, wherein the partitioning method includes at least one of quad-tree partitioning, horizontal binary-tree partitioning, vertical binary-tree partitioning, horizontal ternary-tree partitioning, or vertical ternary-tree partitioning. ### Claim 12 (depends on 9) The non-transitory computer-readable medium of claim 9, wherein the predetermined boundary includes at least one of a right boundary, a bottom boundary, a left boundary, or a top boundary of at least one of a picture, a sub-picture, a slice, a tile, or a brick to which the current block belongs.