# US 11,451,810 B2 · Merge candidate reorder based on global motion vector

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

- Number: US 11,451,810 B2
- Document ID: US11451810B2
- Status: Granted
- Kind: B2
- Application number: 17/006,732
- Filed: 2020-08-28
- Published: 2020-12-17
- Granted: 2022-09-20
- Earliest claimed: 2019-06-03
- Assignees: OP Solutions, LLC
- Applicants: OP Solutions, LLC
- Inventors: Borivoje Furht; Hari Kalva; Velibor Adzic
- Web page: https://patentgrep.com/patent/US11451810B2

## CPC

- H04N 19/44: Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
- H04N 19/52: by predictive encoding
- 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/129: Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/184: the unit being bits, e.g. of the compressed video stream
- H04N 19/527: Global motion vector estimation
- H04N 19/54: using feature points or meshes
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A decoder includes circuitry configured to receive a bitstream; construct, for a current block, a motion vector candidate list including a motion vector candidate having motion information that characterizes a global motion vector; reorder the motion vector candidate list such that the motion vector candidate having the motion information that characterizes the global motion vector is first in the reordered motion vector candidate list; and reconstruct pixel data of the current block and using the reordered motion vector candidate list. Related apparatus, systems, techniques and articles are also described.

## Claims

### Claim 1

A decoder, the decoder comprising circuitry configured to:
receive a bitstream including a coded picture, the coded picture including a first region having a first plurality of coding units and a second region having a second plurality of coding units;
construct for each coding unit in the first region a motion vector candidate list, each motion vector candidate list having a common motion vector, wherein the order of the motion vector candidates in each motion vector candidate list is determined without regard to frequency of use and the motion vector candidate lists are ordered such that the common motion vector is first;
decode the first plurality of coding units using the common motion vector from the motion vector candidate lists, whereby a picture region with common motion is reconstructed in the first region;
ascertain from the bitstream individually determined motion vectors for each coding unit of the second region, wherein adjacent coding units in the second region have different individually determined motion vectors, each individually determined motion vector being one of a translational motion vector or a control point motion vector for four parameter or six parameter affine motion; and
decode the second plurality of coding units using the individually determined motion vectors, whereby local motion in the second region is reconstructed.

### Claim 2 (depends on 1)

The decoder of claim 1, the decoder configured to determine global motion is indicated for the coded picture.

### Claim 3 (depends on 1)

The decoder of claim 1, wherein the common motion vector includes a control point motion vector.

### Claim 4 (depends on 3)

The decoder of claim 3, wherein the control point motion vector is a translational motion vector.

### Claim 5 (depends on 3)

The decoder of claim 3, wherein the control point motion vector is a vector of a four parameter affine motion model.

### Claim 6 (depends on 3)

The decoder of claim 3, wherein the control point motion vector is a vector of a six parameter affine motion model.

### Claim 7 (depends on 1)

The decoder of claim 1, the decoder further comprising:
an entropy decoder processor configured to receive the bit stream and decode the bitstream into quantized coefficients;
an inverse quantization and inverse transformation processor configured to process the quantized coefficients including performing an inverse discrete cosine;
a deblocking filter;
a frame buffer; and
an intra prediction processor.

### Claim 8 (depends on 1)

The decoder of claim 1, wherein at least a coding unit of the first plurality of coding units forms part of a quadtree plus binary decision tree.

### Claim 9 (depends on 1)

The decoder of claim 1, wherein at least a coding unit of the first plurality of coding units is a coding tree unit.

### Claim 10 (depends on 1)

The decoder of claim 1, wherein at least a coding unit of the first plurality of coding units is a coding unit.

### Claim 11

A method comprising:
receiving, by a decoder comprising circuitry, a bitstream including a coded picture, the coded picture including a first region having a first plurality of coding units and a second region having a second plurality of coding units;
constructing, by the decoder, for each coding unit in the first region a motion vector candidate list, each motion vector candidate list having a common motion vector, wherein the order of the motion vector candidates in each motion vector candidate list is determined without regard to frequency of use and the motion vector candidate lists are ordered such that the common motion vector is first;
decoding, by the decoder, the first plurality of coding units using the common motion vector from the motion vector candidate lists, whereby a picture region with common motion is reconstructed in the first region;
ascertaining, by the decoder, from the bitstream individually determined motion vectors for each coding unit of the second region, wherein adjacent coding units in the second region have different individually determined motion vectors, each individually determined motion vector being one of a translational motion vector or a control point motion vector for four parameter or six parameter affine motion; and
decoding, by the decoder, the second plurality of coding units using the individually determined motion vectors, whereby local motion in the second region is reconstructed.

### Claim 12 (depends on 11)

The method of claim 11 further comprising determining that global motion is indicated for the current picture.

### Claim 13 (depends on 11)

The method of claim 11, wherein the common motion vector includes a control point motion vector.

### Claim 14 (depends on 13)

The method of claim 13, wherein the control point motion vector is a translational motion vector.

### Claim 15 (depends on 13)

The method of claim 13, wherein the control point motion vector is a vector of a four parameter affine motion model.

### Claim 16 (depends on 13)

The method of claim 13, wherein the control point motion vector is a vector of a six parameter affine motion model.

### Claim 17 (depends on 11)

The method of claim 11, the decoder further comprising:
an entropy decoder processor configured to receive the bit stream and decode the bitstream into quantized coefficients;
an inverse quantization and inverse transformation processor configured to process the quantized coefficients including performing an inverse discrete cosine;
a deblocking filter;
a frame buffer; and
an intra prediction processor.

### Claim 18 (depends on 11)

The method of claim 11, wherein at least a coding unit of the first plurality of coding units forms part of a quadtree plus binary decision tree.

### Claim 19 (depends on 11)

The method of claim 11, wherein at least a coding unit of the first plurality of coding units is a coding tree unit.

### Claim 20 (depends on 11)

The method of claim 11, wherein at least a coding unit of the first plurality of coding units is a coding unit.

### Claim 21 (depends on 1)

The decoder of claim 1, wherein the common motion vector is a translational motion vector.

### Claim 22 (depends on 11)

The method of claim 11, wherein the common motion vector is a translational motion vector.
