Patent US5828788A successfully refreshed from Google Patents.
US5828788A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for processing data in variable segments and with variable data resolution
Assignee: Vantiva SA
•
Filing: 1995-12-14
•
Granted: 1998-10-27
•
Expires: 2015-12-14
Abstract
Abstract A dynamically configurable video signal processing system partitions and encodes data using a variable number of data segments and variable data resolution. The system partitions data into a variable number of data segments by predicting, as a function of the data rate, first and second distortion factors for the data partitioned into first and second numbers of data segments. The first and second distortion factors are mutually compared and the data is partitioned into the number of data segments which exhibits the lower distortion factor value. First and second distortion factors for the data encoded with first and second data resolutions are also predicted. The first and second distortion factors are similarly compared and the data is encoded with the resolution exhibiting the lower distortion factor value.
Inventors
- 👤 Tihao Chiang
- 👤 Huifang Sun
- 👤 Joel Walter Zdepski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 21:18
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/20; H04N19/23; H04N19/30; H04N19/37; H04N19/10; H04N19/134; H04N19/157; H04N19/159; H04N19/42
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
135 words
A method of partitioning data, comprising the steps of: (a) predicting a first distortion factor for a first number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (b) predicting a second distortion factor for a second number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second number of segments exhibits the lower distortion factor value, based on said mutual comparison; and (e) partitioning said data into said determined number of data segments, said step of partitioning of said data being performed in the spatial domain.
Claim 2
Independent Claim
135 words
A method of partitioning data, comprising the steps of: (a) predicting a first distortion factor for a first number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (b) predicting a second distortion factor for a second number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second number of segments exhibits the lower distortion factor value, based on said mutual comparison; and (e) partitioning said data into said determined number of data segments, said step of partitioning of said data being performed in the spatial domain.
Claim 3
Dependent Claim
26 words
A method according to claim 1 wherein in steps (a) and (b) said predicting step is a function of a predetermined quality requirement of partitioned data.
Claim 4
Dependent Claim
50 words
A method according to claim 1 wherein, said predicting step (a) includes the step of predictively arranging said data in the form of said first number of segments; and said predicting step (b) includes the step of predictively arranging said data in the form of said second number of segments.
Claim 5
Dependent Claim
15 words
A method according to claim 3 further including the step of (f) compressing partitioned data.
Claim 6
Dependent Claim
124 words
A method according to claim 1 wherein said predicting step (a) includes the steps of: selecting a first number of data segments; predictively forming said data into hierarchically ordered data segments of said first number; computing a first distortion factor for said data in the form of said first number of hierarchically ordered data segments as a function of the data rate of said data; and said predicting step (b) includes the steps of: selecting a second number of data segments; predictively forming said data into hierarchically ordered data segments of said second number; computing a second distortion factor for said data in the form of said second number of hierarchically ordered data segments as a function of the data rate of said data.
Claim 7
Dependent Claim
38 words
A method according to claim 1 wherein said data is image data and further including the step of repeating steps (a) to (e) on a periodic basis for partitioning said data into data segments of variable data rate.
Claim 8
Dependent Claim
23 words
A method according to claim 5 wherein, said forming steps predictively form said data into one or more hierarchical layers of compressed data.
Claim 9
Dependent Claim
21 words
A method according to claim 7 wherein, said computing steps predictively compute distortion factors for decompressed hierarchical layers of compressed data.
Claim 10
Independent Claim
126 words
A method of encoding input data, comprising the steps of: (a) predicting a first distortion factor for said input data having a first spatial data resolution, said predicting step being performed in the spatial domain as a function of the data rate of said input data; (b) predicting a second distortion factor for said input data having a second spatial data resolution, said predicting step being performed in the spatial domain as a function of the data rate of said input data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second data resolutions exhibits the lowest distortion factor value, based on said mutual comparison; and (e) encoding said input data at said determined spatial data resolution.
Claim 11
Independent Claim
126 words
A method of encoding input data, comprising the steps of: (a) predicting a first distortion factor for said input data having a first spatial data resolution, said predicting step being performed in the spatial domain as a function of the data rate of said input data; (b) predicting a second distortion factor for said input data having a second spatial data resolution, said predicting step being performed in the spatial domain as a function of the data rate of said input data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second data resolutions exhibits the lowest distortion factor value, based on said mutual comparison; and (e) encoding said input data at said determined spatial data resolution.
Claim 12
Dependent Claim
108 words
A method according to claim 9 wherein, said predicting step (a) includes the steps of: selecting said first spatial data resolution; predictively converting said input data to said first spatial data resolution; computing a first distortion factor for said data having said first spatial data resolution as a function of the data rate of said input data; and said predicting step (b) includes the steps of: selecting a second spatial data resolution; predictively converting said input data to said second spatial data resolution; computing a second distortion factor for said data having said second spatial data resolution as a function of the data rate of said input data.
Claim 13
Dependent Claim
41 words
A method according to claim 9 wherein said input data is image data and further including the step of repeating steps (a) to (e) on a periodic basis for encoding said input data at spatial data resolutions of variable data rate.
Claim 14
Dependent Claim
20 words
A method according to claim 9 wherein, said encoding step compresses said input data at said determined spatial data resolution.
Claim 15
Dependent Claim
27 words
A method according to claim 9 wherein in steps (a) and (b) said predicting step is a function of a predetermined quality requirement of encoded input data.
Claim 16
Dependent Claim
20 words
A method according to claim 1 wherein said spatial domain of steps (a), (b) and (e) comprises a spatiotemporal domain.
Claim 17
Dependent Claim
19 words
A method according to claim 9 wherein said spatial domain of steps (a), and (b) comprises a spatiotemporal domain.
Claim 18
Dependent Claim
36 words
A method according to claim 6 wherein said periodic basis comprises one of: a) a pixel block repetition rate; b) a field repetition rate; c) a frame repetition rate; d) a group of frames repetition rate.
Claim 19
Dependent Claim
36 words
A method according to claim 11 wherein said periodic basis comprises one of: a) a pixel block repetition rate; b) a field repetition rate; c) a frame repetition rate; d) a group of frames repetition rate.
Claim 20
Independent Claim
181 words
A method of partitioning data, comprising the steps of: (a) predicting a first distortion factor for a first number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (b) predicting a second distortion factor for a second number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second number of segments exhibits the lower distortion factor value, based on said mutual comparison; (e) partitioning said data into said determined number of data segments suitable for communication on an output channel, said step of partitioning of said data being performed in the spatial domain; and (f) repeating steps (a) to (e) to dynamically partition said data into different numbers of data segments on a periodic basis and to dynamically allocate the data rate of said different numbers of data segments on said periodic basis.
Claim 21
Independent Claim
181 words
A method of partitioning data, comprising the steps of: (a) predicting a first distortion factor for a first number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (b) predicting a second distortion factor for a second number of segments of said data, said predicting step being performed in the spatial domain as a function of the data rate of said data; (c) mutually comparing said first and said second distortion factors; (d) determining which of said first and said second number of segments exhibits the lower distortion factor value, based on said mutual comparison; (e) partitioning said data into said determined number of data segments suitable for communication on an output channel, said step of partitioning of said data being performed in the spatial domain; and (f) repeating steps (a) to (e) to dynamically partition said data into different numbers of data segments on a periodic basis and to dynamically allocate the data rate of said different numbers of data segments on said periodic basis.
References Cited (Backward Citations)
US5038389A
Cited
US5235420A
Cited
US5144425A
Cited
US5253058A
Cited
US5467132A
Cited
EP0634871A2
Cited
EP0644695A2
Cited
US5446806A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-26 | 2002-04-27 | 2002-10-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-26 | 2006-04-27 | 2006-10-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-26 | 2010-04-27 | 2010-10-27 | $7700.00 | Window Closed / Lapsed |