Method for coding sequences of pictures

Patent No. US7724818 (titled "Method for coding sequences of pictures") on Apr 30, 2003. The application was issued on May 25, 2010.

What is this patent about?

’818 is related to the field of video compression and transmission, specifically addressing how control parameters are organized and signaled within a bitstream. In modern video codecs, pictures are often divided into smaller segments called slices, each requiring specific settings for proper decoding. Traditional standards often suffered from redundant data transmission or rigid header structures that made it difficult to manage parameters that change at different rates, such as those applying to an entire video sequence versus those specific to a single frame.

The underlying idea behind ’818 is the hierarchical decoupling of video parameters based on their expected rate of change and functional persistency. Instead of repeating all configuration data in every slice or picture header, the invention categorizes parameters into distinct structures: a sequence parameter set for global settings, a picture parameter set for frame-level settings, and slice headers for highly localized data. This tiered approach allows the decoder to maintain a state for long-term parameters while only updating more volatile information as needed, significantly reducing bitstream overhead.

The claims of ’818 focus on a multi-level signaling method that defines parameters across three specific tiers: a sequence parameter set, a picture parameter set, and a slice header. Crucially, the independent claims require that at least one picture-related parameter be defined within the slice header itself, with the strict constraint that this specific parameter must remain constant across all slice headers belonging to the same picture. This ensures that while the parameter is delivered at the slice level, it maintains picture-wide consistency for the decoding process.

In practice, this architecture allows an encoder to transmit a sequence parameter set once at the beginning of a session or out-of-band, while picture parameter sets are referenced by an ID within the slice headers. By placing certain picture-level parameters in the slice header but requiring them to be invariant across slices, the system provides a mechanism to update frame-specific information without the overhead of a full parameter set update, while still ensuring the decoder has a stable configuration for the entire frame.

This approach differs from prior solutions by moving away from monolithic headers that were often tied to the physical order of the video data. By using parameter set identifiers, the invention enables out-of-band signaling and improves error resilience, as the decoder can refer back to previously stored configurations even if a specific header is lost. The specific requirement for intra-picture parameter consistency in slice headers provides a hybrid solution that balances the flexibility of slice-based delivery with the stability required for frame-level decoding operations.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2000s when ’818 was filed, video coding systems were transitioning toward more modular architectures to accommodate both conversational and streaming applications. At a time when video bitstreams were typically implemented using rigid, multi-layered hierarchies—such as sequence, group of pictures, and picture layers—the transmission of control information was often tightly coupled with the video data itself. When systems commonly relied on fixed headers that repeated configuration data at every sequence or picture boundary, managing transmission overhead and error resilience was difficult. Hardware and software constraints made the reliable delivery of global configuration parameters non-trivial, particularly in packet-oriented networks where the loss of a single header could render an entire sequence undecodable.

Prosecution Position

The disclosed invention represents a meaningful technical advancement through an architectural shift in how configuration metadata is organized and signaled within a bitstream. By partitioning global parameters into distinct sequence parameter sets and picture parameter sets based on their expected rate of change, the system enables a more granular and efficient signaling mechanism. This integration allows for the decoupling of infrequently changing sequence-level data from more dynamic picture-level data, overcoming the technical constraint of redundant data transmission. The resulting capability enables decoders to maintain multiple parameter set instances, reducing latency and improving compression efficiency by eliminating the need to repeat static parameters when only picture-specific values require updating.

Claims

This patent contains 24 claims, with claims 1, 6, 10, 11, 12, 14, 15, 16, 20, 21, 22, and 23 serving as the independent claims. These independent claims focus on methods, devices, systems, and storage media for encoding and decoding video sequences by organizing parameters into sequence sets, picture sets, and slice headers, specifically ensuring certain picture parameter values remain constant across all slice headers of a single picture. The dependent claims serve to further define the technical implementation by specifying references between parameter sets, identifying specific data types such as frame numbers or picture order counts, and detailing the frequency of parameter set transmission.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Bitstream
(Claim 1, Claim 6, Claim 10, Claim 11, Claim 12, Claim 14, Claim 15, Claim 16, Claim 20, Claim 21, Claim 22, Claim 23)
Conventional video coding standards have specified a structure for an elementary bitstream, i.e., a self-containing bitstream that decoders can parse. The bitstream has consisted of several layers, typically including several of the following: a sequence layer, a group of pictures (GOP) layer, a picture layer, a slice layer, a macroblock layer, and a block layer. The bitstream for each layer typically comprises a header and associated data.A sequence of bits representing coded pictures, where parameters are organized into hierarchical structures including parameter sets and slice headers to facilitate decoding.
Parameter set
(Claim 1, Claim 6, Claim 10, Claim 11, Claim 12, Claim 14, Claim 15, Claim 16, Claim 20, Claim 21, Claim 22, Claim 23)
An instance of a parameter set includes all picture, GOP, and sequence level data such as picture size, display window, optional coding modes employed, macroblock allocation map, and others. Each parameter set instance includes a unique identifier. Each slice header includes a reference to a parameter set identifier, and the parameter values of the referred parameter set are used when decoding the slice.A mechanism that replaces traditional headers by grouping picture, GOP, and sequence level data into an identifiable instance that can be transmitted out-of-band or in-band.
Picture parameter set
(Claim 1, Claim 6, Claim 10, Claim 11, Claim 12, Claim 14, Claim 15, Claim 16, Claim 20, Claim 21, Claim 22, Claim 23)
If it is probable that a parameter remains unchanged in multiple pictures but is allowed to change in every picture, such parameter is included in a picture parameter set. The present invention improves compression efficiency. It is likely that the number of picture parameter sets is larger than the number of sequence parameter sets and the frequency of updating picture parameter sets is higher than the frequency of updating sequence parameter sets.A syntax structure containing parameters that are allowed to change between pictures but are likely to remain unchanged across multiple pictures, distinct from sequence-level and slice-level parameters.
Sequence parameter set
(Claim 1, Claim 6, Claim 10, Claim 11, Claim 12, Claim 14, Claim 15, Claim 16, Claim 20, Claim 21, Claim 22, Claim 23)
Such parameters which are not allowed to change in a coded video sequence are included in the sequence parameter set. Some non-restrictive examples of such parameters are picture order count, frame number and identifier of an independently decodable picture. Now that the sequence parameter set structure is specified, it is clear that all picture parameter sets that are referred to within a sequence must refer to the same sequence parameter set.A syntax structure containing parameters that are not allowed to change within a coded video sequence, such as picture size or frame number, decoupling these infrequently changing values from picture boundaries.
Slice header
(Claim 1, Claim 6, Claim 10, Claim 11, Claim 12, Claim 14, Claim 15, Claim 16, Claim 20, Claim 21, Claim 22, Claim 23)
Parameters whose value may change in every slice or whose value is likely to change in every picture, are included in the slice header. Moreover, it is clear that all slices of a picture must refer to the same picture parameter set. The output of the VCL are slices: a bit string that contains the macroblock data of an integer number of macroblocks, and the information of the slice header.A part of a coded slice that contains parameters that may change in every slice or every picture, including specific picture parameters that must remain constant for all slices within a single picture.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
0:24-cv-04269Nov 25, 2024Element Television Company, Llc V. Nokia Corporation
1:23-cv-01237Oct 31, 2023Nokia Technologies Oy V. Hp, Inc.
1:23-cv-01236Oct 31, 2023Nokia Technologies Oy V. Amazon.Com, Inc.

Patent Family

Patent Family

File Wrapper

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.

  • Get instant alerts for new documents

US7724818

SEP
Application Number
US10426928A
Filing Date
Apr 30, 2003
Status
Expired
Publication Date
May 25, 2010
External Links
Slate, USPTO , Google Patents