Patent US4592571A successfully refreshed from Google Patents.
Patent US5694170A successfully refreshed from Google Patents.
US5694170A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Video compression using multiple computing agents
Assignee: International Business Machines Corp
•
Filing: 1995-04-06
•
Granted: 1997-12-02
•
Expires: 2015-04-06
Abstract
Abstract A system and method of using multiple processors to perform video compression is provided. A video sequence is partitioned into subsequences and processing assignments for the subsequences are distributed among a plurality of processors. A picture type is then determined for each picture in each subsequence and the encoding complexity of each picture is modeled, based on the picture type. Based on the modeling, a number of bits is allocated to each picture. Each picture is then compressed in accordance with the bits allocated. Another aspect provides for encoding of pictures in a video sequence using dynamic modeling of the encoding complexity of future pictures in the video sequence. Bits are allocated to the encoding of a current picture in the video sequence based on the dynamic model. The current picture is then encoded based on the bits allocated.
Inventors
- 👤 Prasoon Tiwari
- 👤 Eric Viscito
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 12:45
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/42; H04N19/436; H04N19/10; H04N19/102; H04N19/103; H04N19/114; H04N19/124; H04N19/134; H04N19/136; H04N19/137; H04N19/14; H04N19/142; H04N19/146; H04N19/149; H04N19/157; H04N19/159; H04N19/169; H04N19/17; H04N19/172; H04N19/177; H04N19/50; H04N19/503; H04N19/51; H04N19/60; H04N19/61; H04N19/152; H04N19/30
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
100 words
A method of using multiple processors to perform video compression, comprising the steps of: partitioning a video sequence into subsequences; distributing processing assignments for the subsequences among a plurality of processors; determining a picture type for each picture in each subsequence; modeling an encoding complexity of each picture based on the picture type of a number of past, current, and future pictures in the subsequence; allocating a number of bits to each picture based on the modeling; compressing each picture in accordance with the bits allocated; and concatenating the bit streams for each subsequence to construct a compressed video stream.
Claim 2
Independent Claim
100 words
A method of using multiple processors to perform video compression, comprising the steps of: partitioning a video sequence into subsequences; distributing processing assignments for the subsequences among a plurality of processors; determining a picture type for each picture in each subsequence; modeling an encoding complexity of each picture based on the picture type of a number of past, current, and future pictures in the subsequence; allocating a number of bits to each picture based on the modeling; compressing each picture in accordance with the bits allocated; and concatenating the bit streams for each subsequence to construct a compressed video stream.
Claim 3
Dependent Claim
27 words
The method of claim 1 wherein the modeling, allocating and compressing of all pictures in a subsequence are performed by a given processor assigned to the subsequence.
Claim 4
Dependent Claim
20 words
The method of claim 2 wherein the concatenating is performed by only one of the processors at a given time.
Claim 5
Dependent Claim
15 words
The method of claim 1 wherein each of the subsequences is an I partition unit.
Claim 6
Dependent Claim
15 words
The method of claim 1 wherein each of the subsequences is a bit allocation unit.
Claim 7
Dependent Claim
17 words
The method of claim 1 wherein the picture type is determined by way of a look-up table.
Claim 8
Dependent Claim
141 words
A video compression system, comprising: a preprocessor for receiving a video sequence and for partitioning the video sequence into subsequences; means, coupled to the preprocessor, for determining a picture type for each picture in each subsequence; an encoder connected to receive the subsequences from the preprocessor, the encoder including: a plurality of processors; means for distributing processing assignments for the subsequences among the processors; means for modeling an encoding complexity of each picture based on the picture type of a number of past, current, and future pictures in the subsequence, to obtain a model of the picture; means for allocating a number of bits to each picture based on the model of the picture; means for compressing each picture in accordance with the bits allocated; and means for concatenating the bit streams for each subsequence to construct a compressed video stream.
Claim 9
Dependent Claim
141 words
A video compression system, comprising: a preprocessor for receiving a video sequence and for partitioning the video sequence into subsequences; means, coupled to the preprocessor, for determining a picture type for each picture in each subsequence; an encoder connected to receive the subsequences from the preprocessor, the encoder including: a plurality of processors; means for distributing processing assignments for the subsequences among the processors; means for modeling an encoding complexity of each picture based on the picture type of a number of past, current, and future pictures in the subsequence, to obtain a model of the picture; means for allocating a number of bits to each picture based on the model of the picture; means for compressing each picture in accordance with the bits allocated; and means for concatenating the bit streams for each subsequence to construct a compressed video stream.
Claim 10
Dependent Claim
34 words
The system of claim 7, wherein the means for distributing processing assignments assigns the modeling, the allocating and the compressing of all pictures in a subsequence to a given processor assigned to the subsequence.
Claim 11
Dependent Claim
37 words
The system of claim 8, wherein the means for distributing processing assignments assigns the concatenating to only one of the processors at a given time and changes the processor assigned to the concatenating from time to time.
Claim 12
Dependent Claim
15 words
The system of claim 7 wherein each of the subsequences is an I partition unit.
Claim 13
Dependent Claim
15 words
The system of claim 7 wherein each of the subsequences is a bit allocation unit.
Claim 14
Dependent Claim
30 words
The method of claim 7 wherein each processor includes a look-up table formed in a random access memory and means for accessing the look-up table to determine the picture type.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-12-01 | 2001-06-02 | 2001-12-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-12-01 | 2005-06-02 | 2005-12-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-12-01 | 2009-06-02 | 2009-12-02 | $7700.00 | Window Closed / Lapsed |