# US 2019/0246109 A1 · Rate control for video splicing applications

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

- Number: US 2019/0246109 A1
- Document ID: US20190246109A1
- Status: Published application
- Kind: A1
- Application number: 16/386,207
- Filed: 2019-04-16
- Published: 2019-08-08
- Earliest claimed: 2012-03-13
- Assignees: Dolby Laboratories Licensing Corporation
- Applicants: Dolby Laboratories Licensing Corporation
- Inventors: Athanasios LEONTARIS; Alexandros TOURAPIS
- Web page: https://patentgrep.com/patent/US20190246109A1

## CPC

- H04N 19/146: Data rate or code amount at the encoder output
- H04N 19/102: characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N 19/115: Selection of the code volume for a coding unit prior to coding
- H04N 19/14: Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence)
- H04N 19/154: Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion (use of rate-distortion criteria H04N19/147)
- H04N 19/177: the unit being a group of pictures [GOP]
- H04N 19/192: the adaptation method, adaptation tool or adaptation type being iterative or recursive
- H04N 19/436: using parallelised computational arrangements
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Rate control techniques are provided for encoding an input video sequence into a compressed coded bitstream with multiple coding passes. The final coding pass may comprise final splices with non-overlapping frames that do not extend into neighboring final splices. A final splice in the final coding pass may correspond to at least one non-final splice in a non-final coding pass. A non-final splice may have overlapping frames that extend into neighboring final splices in the final coding pass. The overlapping frames in the non-final splice may be used to derive complexity information about the neighboring final splices. The complexity information about the neighboring final splices, as derived from the overlapping frames, may be used to allocate or improve rate control related budgets in encoding the final splice into the compressed coded bitstream in the final coding pass.

## Claims

### Claim 1

A method to communicate a video sequence, the method comprising:
accessing at least one non-transitory storage medium; the at least one non-transitory storage medium storing:
(i) a first compressed segment for a first period of the video sequence, the first compressed segment compressed at a first bit rate constraint;
(ii) a second compressed segment for the first period of the video sequence, the second compressed segment compressed at a second bit rate constraint; and
(iii) a third compressed segment for a second period of the video sequence; and
communicating the second and third compressed segments in a high dynamic range image format,
wherein:
the first and second periods are non-overlapping, the first and second bit rate constraints differ,
and
wherein the first compressed segment includes more frames than the second compressed segment.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first bit rate constraint is one or more of a first bit rate value, a first bit rate maximum value, and a first bit rate maximum average value, and the second bit rate constraint is one or more of a second bit rate value, a second bit rate maximum value, and a second bit rate maximum average value.

### Claim 3 (depends on 2)

The method of claim 2, wherein the first bit rate constraint comprises the first bit rate maximum value, and the first bit rate maximum value is 768 kbps.

### Claim 4 (depends on 1)

The method of claim 1, further comprising using information from multiple non-final coding passes to meet bit rate constraints in a final coding p