# US 2026/0075217 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 2026/0075217 A1
- Document ID: US20260075217A1
- Status: Published application
- Kind: A1
- Application number: 19/392,068
- Filed: 2025-11-17
- Published: 2026-03-12
- Earliest claimed: 2016-08-03
- Assignees: Kt Corporation
- Applicants: Kt Corporation
- Inventors: Bae Keun LEE
- Web page: https://patentgrep.com/patent/US20260075217A1

## 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, the method comprising:
determining whether to split a parent node coding block based on quad-tree partitioning;
determining whether to split the parent node coding block based on binary-tree partitioning when it is determined that the parent node coding block is not split based on the quad-tree partitioning, the parent node coding block being partitioned into a first coding block and a second coding block which have the same size by using either of a horizontal line or a vertical line when it is determined to split the parent node coding block based on the binary-tree partitioning;
deriving motion information for the first coding blocks; and
performing motion compensation for the first coding block based on the derived motion information,
wherein:
the motion information of the non-square coding block is derived from a merge candidate list comprising at least one merge candidate,
if the second coding block is included in the same region with the first coding block, motion information of the second coding block is determined unavailable as a merge candidate, and if the parent coding block is one of partitions generated by partitioning an ancient coding block horizontally, a binary-tree partitioning type using the horizontal line is unavailable for the parent coding block.

### Claim 15 (depends on 14)

The method of claim 14, wherein the ancient coding block has a square shape of 128×128.

### Claim 16 (depends on 14)

The method of claim 14, wherein the region has a square shape or a non-square shape.

### Claim 17

A method of encoding a video, the method comprising:
determining whether to split a parent node coding block based on quad-tree partitioning;
determining whether to split the parent node coding block based on binary-tree partitioning when it is determined that the parent node coding block is not split based on the quad-tree partitioning, the parent node coding block being partitioned into a first coding block and a second coding block which have the same size by using either of a horizontal line or a vertical line when it is determined to split the parent node coding block based on the binary-tree partitioning;
deriving motion information for the first coding blocks; and
performing motion compensation for the first coding block based on the derived motion information,
wherein:
the motion information of the non-square coding block is derived from a merge candidate list comprising at least one merge candidate,
if the second coding block is included in the same region with the first coding block, motion information of the second coding block is determined unavailable as a merge candidate, and
if the parent coding block is one of partitions generated by partitioning an ancient coding block horizontally, a binary-tree partitioning type using the horizontal line is unavailable for the parent coding block.

### Claim 18 (depends on 17)

The method of claim 17, wherein the ancient coding block has a square shape of 128×128.

### Claim 19 (depends on 17)

The method of claim 17, wherein the region has a square shape or a non-square shape.

### Claim 20

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 encoded by an encoding method which comprising:
determining whether to split a parent node coding block based on quad-tree partitioning;
determining whether to split the parent node coding block based on binary-tree partitioning when it is determined that the parent node coding block is not split based on the quad-tree partitioning, the parent node coding block being partitioned into a first coding block and a second coding block which have the same size by using either of a horizontal line or a vertical line when it is determined to split the parent node coding block based on the binary-tree partitioning;
deriving motion information for the first coding blocks; and
performing motion compensation for the first coding block based on the derived motion information,
wherein:
the motion information of the non-square coding block is derived from a merge candidate list comprising at least one merge candidate,
if the second coding block is included in the same region with the first coding block, motion information of the second coding block is determined unavailable as a merge candidate, and
if the parent coding block is one of partitions generated by partitioning an ancient coding block horizontally, a binary-tree partitioning type using the horizontal line is unavailable for the parent coding block.
