# US 6,731,812 B2 · Data compression

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

- Number: US 6,731,812 B2
- Document ID: US6731812B2
- Status: Granted
- Kind: B2
- Application number: 09/300,698
- Filed: 1999-04-27
- Published: 2003-03-06
- Granted: 2004-05-04
- Earliest claimed: 1998-04-30
- Assignees: Koninklijke Philips Electronics N.V.
- Inventors: Nicolas Bailleul
- Web page: https://patentgrep.com/patent/US6731812B2

## CPC

- H04N 19/00: Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N 19/124: Quantisation
- H04N 19/137: Motion inside a coding unit, e.g. average field, frame or block difference
- H04N 19/152: by measuring the fullness of the transmission buffer
- H04N 19/172: the region being a picture, frame or field
- H04N 19/192: the adaptation method, adaptation tool or adaptation type being iterative or recursive
- H04N 19/196: being specially adapted for the computation of encoding parameters, e.g. by averaging previously computed encoding parameters (processing of motion vectors H04N19/513)
- H04N 19/197: {including determination of the initial value of an encoding parameter (H04N19/56 takes precedence)}
- H04N 19/40: using video transcoding, i.e. partial or full decoding of a coded input stream followed by re-encoding of the decoded output stream
- H04N 19/60: using transform coding
- H04N 19/61: in combination with predictive coding
- H04N 21/23608: {Remultiplexing multiplex streams, e.g. involving modifying time stamps or remapping the packet identifiers}
- H04N 21/23655: {Statistical multiplexing, e.g. by controlling the encoder to alter its bitrate to optimize the bandwidth utilization}
- H04N 21/4344: {Remultiplexing of multiplex streams, e.g. by modifying time stamps or remapping the packet identifiers}
- H04N 19/146: Data rate or code amount at the encoder output
- H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Data (D) is compressed in dependence on a compression parameter (CPAR). An example of such data compression is coding a sequence of pictures in accordance with a standard defined by the Moving Pictures Experts Group. In the process of compressing the data (D), the following three steps are repetitively carried out. In a prediction step (PRD), it is predicted, on the basis of an initial value (VALint) of the compression parameter (CPAR), which amount of compressed data Xprd will have been obtained at a future instant of time (Tfut). In an adaptation step (ADP), the initial value (VALint) is adapted on the basis of a difference (ΔX) between the predicted amount of data (Xprd) and a desired amount of data (Xdes), so as to obtain an adapted value (VALadp) of the compression parameter (CPAR). In an application step (APL), the adapted value (VALadp) of the compression parameter (CPAR) is applied until a subsequent prediction step (PRD) followed by a subsequent adaptation step (ADP) is carried out. Such data compression yields a better quality in terms of loss of information.

## Claims

### Claim 1

A method of compressing data in dependence on a compression parameter (CPAR), the following steps are repetitively carried out:
predicting (PRD), on the basis of an initial value (VALint) of the compression parameter (CPAR), which amount of compressed data (Xprd) will have been obtained at a future instant of time (Tfut) just before an expected substantial increase (INC) in compressed data;
adapting (ADP) the initial value (VALint) on the basis of a difference (ΔX) between the predicted amount of data (Xprd) and a desired amount of data (Xdes), so as to obtain an adapted value (VALadp) of the compression parameter (CPAR);
applying (APL) the adapted value (VALadp) of the compression parameter (CPAR) until a subsequent prediction step followed by a subsequent adaptation step is carried out.

### Claim 2 (depends on 1)

A method of processing data as claimed in claim 1, wherein the compression parameter (CPAR) relates to an amount of compressed data (Xgrp) to be provided over a time interval (ΔTgrp) in which three steps (PRD, ADP, APL) will be carried out at least once more.

### Claim 3 (depends on 1)

A computer program product for use in a data compressor, the computer program product comprising a set of instructions for carrying out the method as claimed in claim 1.

### Claim 4

A data compressor, comprising:
a transformer for transforming data into transform coefficients;
a quantizer for dividing the transform coefficients by an adapted value (VALadp) of a compression parameter (CPAR);
a controller (CON) for predicting (PRD), on the basis of an initial value (VALint) of the compression parameter (CPAR), which amount of compressed data (Xprd) will have been obtained at a future instant of time (Tfut) just before an expected substantial increase (INC) in compressed data, adapting (ADP) the initial value (VALint) on the basis of a difference (ΔX) between the predicted amount of data (Xprd) and a desired amount of data (Xdes), so as to obtained the adapted value (VALadp) of the compression parameter (CPAR).
