Grouping of image frames in video coding

Patent No. US8204134 (titled "Grouping of image frames in video coding") on Jan 25, 2006. The application was issued on Jun 19, 2012.

What is this patent about?

’134 is related to the field of compressed video decoding, specifically addressing the management of reference picture buffers during the playback of streaming multimedia. In modern video compression, decoders rely on a sequence of numbered frames to maintain synchronization and perform temporal prediction. However, when frames are intentionally omitted—such as during bit rate adjustments, scene transitions, or the insertion of secondary content like commercials—the resulting gaps in frame numbering often trigger erroneous error-correction routines or buffer synchronization failures in standard decoders.

The underlying idea behind ’134 is to provide a signaling mechanism that distinguishes between accidental packet loss and intentional frame removal, allowing the decoder to maintain a synchronized state without performing unnecessary recovery actions. By embedding an explicit indication of an intentional discontinuity within the bitstream, the inventor realized that a decoder could be instructed to proactively manage its buffer state. This insight ensures that the reference picture indexing remains consistent between the encoder and decoder, even when the physical transmission of certain frames is bypassed to save bandwidth or handle network congestion.

The claims of ’134 focus on a method and apparatus for decoding a video sequence by identifying an indication of an intentional numbering discontinuity and reconfiguring a buffer memory in response. Specifically, the independent claims cover the process of decoding this indication from the bitstream and subsequently configuring the buffer to provide a specific number of frames that correspond to the gap in numbering. These provided frames are then utilized within the decoding process to ensure that subsequent inter-predicted frames can correctly reference the expected indices in the buffer.

In practice, when the decoder encounters the intentional discontinuity signal, it populates its buffer with filler frames or memory indicators designated as invalid. This prevents the decoder from interpreting the missing sequence numbers as a protocol error or a network failure. By filling these gaps with placeholder data, the sliding window or adaptive memory control remains aligned with the encoder’s state. This mechanism is particularly useful in scalable coding environments where enhancement layers or specific sub-sequences are dropped to match the available transmission bandwidth or the processing limits of the terminal device.

This approach differs from prior solutions that relied on rigid, consecutive frame numbering where any gap was treated as a transmission failure requiring retransmission or complex error concealment. By utilizing sub-sequence identifiers and intentional discontinuity flags, the invention allows for flexible traffic shaping at the server or network level without breaking the decoder's temporal prediction chain. This ensures a fluid playback experience even during drastic scene transitions or bit rate fluctuations, as the decoder is always aware of the structural integrity of the received frame sequence.

How does this patent fit in bigger picture?

Technical Landscape

In the early 2000s when ’134 was filed, video streaming was typically implemented using motion-compensated temporal prediction where sequences were organized into independent groups of pictures to manage spatial and temporal redundancies. At a time when systems commonly relied on fixed image numbering to detect packet loss and maintain synchronization between encoders and decoders, hardware and software constraints made the insertion of external content—such as advertisements—non-trivial due to the resulting discontinuities in frame sequences. During this era, video coding standards often required strict adherence to arithmetic frame numbering, meaning that any intentional removal of frames for bit-rate control or reference picture selection was difficult to distinguish from transmission errors without extensive buffering and parsing.

Prosecution Position

The disclosed invention represents a meaningful technical advancement by introducing a signaling mechanism that explicitly indicates intentional discontinuities in image frame numbering within a compressed video sequence. This architectural shift allows a decoder to differentiate between protocol errors and deliberate frame omissions, such as those occurring during the insertion of secondary video sequences or the removal of non-essential reference frames. By decoding this indication, the system enables the buffer memory to be configured to provide filler frames or memory markers that maintain synchronization between the encoder and decoder. This integration overcomes the technical constraint of unnecessary error correction actions and re-transmission requests, ensuring that reference picture selection processes remain fluent even when the bit rate is dynamically adjusted or content is spliced.

Claims

The patent contains 22 claims, with claims 1, 9, and 16 being independent. These independent claims focus on a method, a video decoder, and a computer program product for decoding compressed video sequences by identifying intentional discontinuities in frame numbering and configuring a buffer memory to account for these gaps during the decoding process. The dependent claims serve to specify technical implementations such as the use of filler frames, sliding window buffering, memory indications to avoid data entry, and error detection based on the missing frame references.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Buffer memory
(Claim 1, Claim 9, Claim 16)
The buffer memories of the encoder and the decoder can be kept in synchronism, which enables a fluent operation of the process of reference picture selection. According to an embodiment, a number of filler frames corresponding to the discontinuities in the numbering of the image frames is entered into the buffer memory. According to an embodiment, the step of configuring the buffer memory to provide a number of image frames corresponding to the discontinuities in the numbering of the image frames is carried out by memory indications, whereby no data is entered into the buffer memory.A storage area used during the decoding process to hold image frames, including those generated to fill gaps, to maintain synchronization for temporal prediction.
Decoding process
(Claim 1, Claim 9, Claim 16)
The image frames in the buffer memory are used in the decoding process. The missing image frames cause discontinuities in the numbering of the image frames. The receiving terminal may therefore interpret the deviating image numbering as a signal of lost image frames and start unnecessary actions to reconstruct the image frames suspected as lost or to request a re-transmission thereof.The sequence of operations that converts a compressed video bitstream into viewable image frames, utilizing buffered frames for motion-compensated temporal prediction.
Indication
(Claim 1, Claim 9, Claim 16)
An advantage of the procedure of the invention is that it provides the decoder with the information, which gaps in the image frame numbering are intentional, whereby the decoder does not start unnecessary error correction actions. The video sequence includes an indication relating to at least one discontinuity in the numbering of the image frames, which indication is decoded from the video sequence. In response to the indication, the buffer memory is configured to provide a number of image frames corresponding to a discontinuity in the numbering of the image frames.A specific signal or data element embedded within the compressed video bitstream that alerts the decoder that a gap in frame numbering is purposeful rather than an error.
Intentional discontinuity of numbering
(Claim 1, Claim 9, Claim 16)
The invention is based on the idea of decoding a compressed video sequence, wherein image frames are entered into a buffer memory in connection with the decoding. The video sequence includes an indication relating to at least one discontinuity in the numbering of the image frames, which indication is decoded from the video sequence. Preferably, said indication informs that at least one discontinuity in the numbering of the image frames in the video sequence are intentional, and the number of image frames generated in the buffer memory are used in place of image frames that do not exist at a decoder.A deliberate gap or non-sequential jump in the numerical identifiers assigned to successive image frames in a video bitstream, which is not caused by transmission error or packet loss.
Number of image frames corresponding to at least one discontinuity
(Claim 1, Claim 9, Claim 16)
A number of filler frames corresponding to the discontinuities in the numbering of the image frames is entered into the buffer memory. The number of image frames generated in the buffer memory are used in place of image frames that do not exist at a decoder. These filler frames may be designated by an identifier indicating that the filler frames do not belong to the actual video sequence.A set of generated or placeholder frames (such as filler frames) that account for the specific quantity of missing frames identified by the intentional numbering gap.

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.

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

US8204134

SEP
Application Number
US11338996A
Filing Date
Jan 25, 2006
Status
Granted
Publication Date
Jun 19, 2012
External Links
Slate, USPTO , Google Patents