# US 12,015,760 B2 · Video coding for handling different picture sizes

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,015,760 B2
- Document ID: US12015760B2
- Status: Granted
- Kind: B2
- Application number: 17/468,450
- Filed: 2021-09-07
- Published: 2022-01-27
- Granted: 2024-06-18
- Earliest claimed: 2019-03-08
- Assignees: Beijing Dajia Internet Information Technology Co., Ltd.
- Applicants: Beijing Dajia Internet Information Technology Co., Ltd.
- Inventors: Yi-Wen Chen; Xiaoyu Xiu; Tsung-Chuan Ma; Xianglin Wang
- Web page: https://patentgrep.com/patent/US12015760B2

## CPC

- H04N 19/103: Selection of coding mode or of prediction mode
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/172: the region being a picture, frame or field
- 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

Provided is a video coding method comprising that the width of a video picture is set to be a first multiple of a first number M, and the first number M is a positive integer. The height of the picture is set to be a second multiple of a second number N, and the second number N is a positive integer. The first number M and the second number N are predetermined. Additionally, it is determined that a merge sharing node is located outside of the picture. The merge sharing node is corresponding to a first region of the picture, a first set of coding units of the picture are within the first region, and the first set of coding units are coded with a merge mode. A constraint process is then applied such that the boundary of the merge sharing node is aligned with the boundary of the picture.

## Claims

### Claim 1

A video coding method, comprising:
setting a width of a video picture to be a first multiple of a first number M, wherein the first number M is a positive integer;
setting a height of the picture to be a second multiple of a second number N, wherein the second number N is a positive integer, and the first number M and the second number N are predetermined;
determining that the minimum size of a merge sharing node is A×B pixels, wherein A and B are positive integers, the merge sharing node is corresponding to a first region of the picture, a first set of coding units of the picture are within the first region, and the first set of coding units are coded with a merge mode; and
setting the value of the first number M to be one of A and B and setting the value of the second number N to be the other one of A and B such that no boundary of the merge sharing node is located outside the picture.

### Claim 2 (depends on 1)

The method of claim 1, wherein the value of the first number M is identical to the value of the second number N, or
wherein the value of the first number M is different from the value of the second number N.

### Claim 3 (depends on 1)

The method of claim 1, wherein the value of the first number M is 4 and the value of the second number N is 8.

### Claim 4 (depends on 1)

The method of claim 1, wherein the value of the first number M is 8 and the value of the second number N is 4.

### Claim 5 (depends on 1)

The method of claim 1, wherein the value of the first number M is 8 and the value of the second number N is 8.

### Claim 6

A computing device, comprising:
one or more processors;
a non-transitory storage coupled to the one or more processors; and
a plurality of programs stored in the non-transitory storage that, when executed by the one or more processors, cause the computing device to perform acts comprising:
setting a width of a video picture to be a first multiple of a first number M, wherein the first number M is a positive integer;
setting a height of the picture to be a second multiple of a second number N, wherein the second number N is a positive integer, and the first number M and the second number N are predetermined;
determining that the minimum size of a merge sharing node is A×B pixels, wherein A and B are positive integers, the merge sharing node is corresponding to a first region of the picture, a first set of coding units of the picture are within the first region, and the first set of coding units are coded with a merge mode; and
setting the value of the first number M to be one of A and B and setting the value of the second number N to be the other one of A and B such that no boundary of the merge sharing node is located outside the picture.

### Claim 7

A non-transitory computer readable storage medium storing a plurality of programs for execution by a computing device having one or more processors, wherein the plurality of programs, when executed by the one or more processors, cause the computing device to perform acts comprising:
setting a width of a video picture to be a first multiple of a first number M, wherein the first number M is a positive integer;
setting a height of the picture to be a second multiple of a second number N, wherein the second number N is a positive integer, and the first number M and the second number N are predetermined;
determining that the minimum size of a merge sharing node is A×B pixels, wherein A and B are positive integers, the merge sharing node is corresponding to a first region of the picture, a first set of coding units of the picture are within the first region, and the first set of coding units are coded with a merge mode; and
setting the value of the first number M to be one of A and B and setting the value of the second number N to be the other one of A and B such that no boundary of the merge sharing node is located outside the picture.