# US 2023/0053392 A1 · Method and apparatus for processing video signal > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2023/0053392 A1 - Document ID: US20230053392A1 - Status: Published application - Kind: A1 - Application number: 17/970,934 - Filed: 2022-10-21 - Published: 2023-02-23 - Earliest claimed: 2016-08-03 - Assignees: Kt Corporation - Applicants: Kt Corporation - Inventors: Bae Keun LEE - Web page: https://patentgrep.com/patent/US20230053392A1 ## CPC - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/103: Selection of coding mode or of prediction mode - H04N 19/105: Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction - H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635) - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/186: the unit being a colour or a chrominance component - H04N 19/44: Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder - H04N 19/51: Motion estimation or motion compensation - H04N 19/52: by predictive encoding - H04N 19/55: Motion estimation with spatial constraints, e.g. at image or region borders - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - H04N 19/80: Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation (H04N19/635, H04N19/86 take precedence) - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract A method for decoding a video according to the present invention may comprise: deriving a spatial merge candidate for a current block, generating a merge candidate list for the current block based on the spatial merge candidate, obtaining motion information for the current block based on the merge candidate list, and performing motion compensation for the current block using the motion information. Herein, if the current block does not have a pre-defined shape or does not have a size equal to or greater than a pre-defined size, the spatial merge candidate of the current block is derived based on a block having the pre-defined shape or having a size equal to or greater than the pre-defined size, the block comprising the current block. ## Claims ### Claim at position 1 1-13. (canceled) ### Claim 14 A method of decoding a video with a decoding apparatus, comprising: dividing, based on two vertical lines or two horizontal lines, a first coding block into three second coding blocks; dividing a second coding block into two partitions; and decoding the second coding block including the two partitions, wherein, in response to a case where the second coding block is asymmetrically divided into the two partitions based on one vertical line or one horizontal line, the two partitions share a merge candidate list for inter prediction of the second coding block. ### Claim 15 (depends on 14) The method of claim 14, wherein the two partitions share the merge candidate list only when a size of the second coding block is greater than or equal to a pre-defined size in the decoding apparatus. ### Claim 16 (depends on 14) The method of claim 14, wherein the second coding block is non-square, and wherein, in response to a case where the second coding block is divided into the two partitions based on the one vertical line, a first partition of the two partitions has a width less than a second partition of the two partitions. ### Claim 17 (depends on 16) The method of claim 16, wherein, in response to the first partition being a left partition of the two partitions, the merge candidate list for the first partition includes a plurality of spatial merge candidates, and wherein the plurality of spatial merge candidates includes a first spatial merge candidate derived from a top neighboring block which is adjacent to the second partition but is not adjacent to the first partition. ### Claim 18 (depends on 17) The method of claim 17, wherein the plurality of spatial merge candidates further includes a second spatial merge candidate derived from a left neighboring block which is adjacent to the first partition but is not adjacent to the second partition. ### Claim 19 (depends on 14) The method of claim 14, wherein the second coding block is non-square, and wherein, in response to a case where the second coding block is divided into the two partitions based on the one horizontal line, a first partition of the two partitions has a height less than a second partition of the two partitions. ### Claim 20 (depends on 19) The method of claim 19, wherein, in response to the first partition being a top partition of the two partitions, the merge candidate list for the first partition includes a plurality of spatial merge candidates, and wherein the plurality of spatial merge candidates includes a first spatial merge candidate derived from a bottom-left neighboring block which is adjacent to the second partition but is not adjacent to the first partition. ### Claim 21 (depends on 20) The method of claim 20, wherein the plurality of spatial merge candidates further includes a second spatial merge candidate derived from a top-right neighboring block which is adjacent to the first partition but is not adjacent to the second partition. ### Claim 22 A method of encoding a video with an encoding apparatus, comprising: dividing, based on two vertical lines or two horizontal lines, a first coding block into three second coding blocks; dividing a second coding block into two partitions; and encoding the second coding block including the two partitions, wherein, in response to a case where the second coding block is asymmetrically divided into the two partitions based on one vertical line or one horizontal line, the two partitions share a merge candidate list for inter prediction of the second coding block. ### Claim 23 A non-transitory computer-readable medium for storing data associated with a video signal, comprising: a data stream stored in the non-transitory computer-readable medium, the data stream being generated by an encoding method comprising: dividing, based on two vertical lines or two horizontal lines, a first coding block into three second coding blocks; dividing a second coding block into two partitions; and encoding the second coding block including the two partitions, wherein, in response to a case where the second coding block is asymmetrically divided into the two partitions based on one vertical line or one horizontal line, the two partitions share a merge candidate list for inter prediction of the second coding block.