US5734677A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for compression of loss-tolerant video image data from multiple sources
Assignee: Chinese University of Hong Kong
•
Filing: 1995-03-15
•
Granted: 1998-03-31
•
Expires: 2015-03-15
Abstract
Abstract Data as may be employed in telecommunication is segmented into blocks, each block having associated therewith a metric of distortion as a function of the number of bits in the block to represent the quality of the data contained in the block. Within the blocks, bits are ordered according to significance. The blocks are then ranked according to the distortion metric, then the lowest significant bits of blocks having the lowest distortion metrics are dropped and bits are allocated to other blocks having the highest distortion metrics in order to redistribute the quality or distortion of each of the blocks for transmission (or subsequent compressed storage). Each of the blocks can thus be transmitted at substantially the same level of distortion within a channel which is bandwidth restricted compared to the maximum possible resolution of the data, thus minimizing imbalances in quality among the blocks of data and maximizing channel efficiency. A particular application of this data compression technique is in video data compression wherein each of the data blocks contains the coefficients of a discrete cosine transform, wherein the quality of the data actually needs to be substantially equal among all the blocks of data and wherein the data itself is loss-tolerant within each of the blocks of data. The invention has particular application in an MPEG block encoding and decoding scheme. A further application of this data compression technique is in the multiplexing of blocks of data from different images into a common channel for transmission.
Inventors
- 👤 Soung Chang Liew
- 👤 Chi-Yin Tse
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:02
CPC Classifications
H; H04; H04B; H04B14/00; H04B14/02; H04B14/04; H04B14/046; H04N; H04N19/00; H04N19/10; H04N19/102; H04N19/103; H04N19/107; H04N19/115; H04N19/134; H04N19/146; H04N19/147; H04N19/149; H04N19/154; H04N19/169; H04N19/17; H04N19/176; H04N19/60; H04N19/61; H04N19/80; H04N19/82; H04N21/00; H04N21/20; H04N21/23; H04N21/234; H04N21/2343; H04N21/234327; H04N21/236; H04N21/2365; H04N21/23655
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
163 words
A method for compression of loss-tolerant video image data derived from multiple sources for conveyance at a predetermined fixed rate, said method comprising the steps of: segmenting said video image data of each one of said multiple sources into corresponding video blocks, each one of said blocks corresponding to a single one of said sources, each block having a ranking based on source data, which source data is ranked in an order according to at least a first criterion, each said block having associated therewith a distortion metric to represent quality of the source data contained in the corresponding block; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; and allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics.
Claim 2
Independent Claim
163 words
A method for compression of loss-tolerant video image data derived from multiple sources for conveyance at a predetermined fixed rate, said method comprising the steps of: segmenting said video image data of each one of said multiple sources into corresponding video blocks, each one of said blocks corresponding to a single one of said sources, each block having a ranking based on source data, which source data is ranked in an order according to at least a first criterion, each said block having associated therewith a distortion metric to represent quality of the source data contained in the corresponding block; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; and allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics.
Claim 3
Dependent Claim
20 words
The method according to claim 1 wherein said first portions and said second portions each comprise separately addressable grouped bits.
Claim 4
Dependent Claim
16 words
The method according to claim 1 wherein said first portions and said second portions comprise codewords.
Claim 5
Dependent Claim
24 words
The method according to claim 1 wherein said first portions comprise least significant bits and said second portions comprise other than least significant bits.
Claim 6
Dependent Claim
18 words
The method according to claim 1 wherein said first portions comprise bits and said second portions comprise bits.
Claim 7
Dependent Claim
32 words
The method according to claim 1 wherein said at least one criterion comprises distortion as a function of the number of bits in the block, and wherein said function provides a ranking.
Claim 8
Dependent Claim
23 words
The method according to claim 6 wherein said at least one criterion further comprises value of data within selected locations of an image.
Claim 9
Dependent Claim
22 words
The method according to claim 1 wherein said at least one criterion comprises values of data within selected locations of an image.
Claim 10
Dependent Claim
46 words
The method according to claim 1 wherein said at least one criterion comprises values of data within selected locations of different images, wherein said first portions comprise data of a subset of the images and said second portions comprise data of the rest of the images.
Claim 11
Dependent Claim
28 words
The method according to claim 1 wherein said at least one criterion varies across an image in accordance with variably acceptable distortion levels within locations of said image.
Claim 12
Dependent Claim
25 words
The method according to claim 10 wherein said at least one criterion comprises a function of value of data at selected locations in an image.
Claim 13
Dependent Claim
16 words
The method according to claim 1, wherein each block is pre-allocated a minimum number of bits.
Claim 14
Dependent Claim
16 words
The method according to claim 1, wherein each block is pre-allocated a minimum number of codewords.
Claim 15
Dependent Claim
18 words
The method according to claim 1, wherein each block is pre-allocated a minimum level of spatial frequency components.
Claim 16
Dependent Claim
26 words
The method according to claim 1 wherein each block is pre-allocated a minimum level of information and further including the step of partially compressing said information.
Claim 17
Dependent Claim
30 words
The method according to claim 1 further including the step of: employing all of said data in a current frame as a reference for interframe encoding of a future frame.
Claim 18
Dependent Claim
29 words
The method according to claim 1 further including the step of: employing all said data in a current frame as a reference for interpolative encoding of a future frame.
Claim 19
Dependent Claim
36 words
The method according to claim 1 further including the step of: employing only said data in a current frame which was retained after said dropping step as a reference for interframe encoding of a future frame.
Claim 20
Dependent Claim
36 words
The method according to claim 1 further including the step of: employing only said data in a current frame which was retained after said dropping step as a reference for interpolative encoding of a future frame.
Claim 21
Dependent Claim
21 words
The method according to claim 1 further including integrating said compression with other compression schemes for seamless primary and secondary compression.
Claim 22
Dependent Claim
28 words
The method according to claim 1 further including the step of dynamically varying said at least one criterion in time in accordance with a variable bit rate input.
Claim 23
Independent Claim
150 words
A method for compression of loss-tolerant data comprising the steps of: segmenting data into blocks, each block having data ranked in an order according to at least one criterion, each block being pre-allocated a minimum level of information and each block having associated therewith a distortion metric to represent quality of the data contained in the block; partially compressing said information; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and employing only said data in a current frame which was pre-allocated as a minimum level of information as a reference for interframe encoding of a frame.
Claim 24
Independent Claim
150 words
A method for compression of loss-tolerant data comprising the steps of: segmenting data into blocks, each block having data ranked in an order according to at least one criterion, each block being pre-allocated a minimum level of information and each block having associated therewith a distortion metric to represent quality of the data contained in the block; partially compressing said information; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and employing only said data in a current frame which was pre-allocated as a minimum level of information as a reference for interframe encoding of a frame.
Claim 25
Independent Claim
150 words
A method for compression of loss-tolerant data comprising the steps of: segmenting data into blocks, each block having data ranked in an order according to at least one criterion, each block being pre-allocated a minimum level of information and each block having associated therewith a distortion metric to represent quality of the data contained in the block; partially compressing said information; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and employing only said data in a current frame which was pre-allocated as a minimum level of information as a reference for interpolative encoding of a frame.
Claim 26
Independent Claim
150 words
A method for compression of loss-tolerant data comprising the steps of: segmenting data into blocks, each block having data ranked in an order according to at least one criterion, each block being pre-allocated a minimum level of information and each block having associated therewith a distortion metric to represent quality of the data contained in the block; partially compressing said information; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and employing only said data in a current frame which was pre-allocated as a minimum level of information as a reference for interpolative encoding of a frame.
Claim 27
Independent Claim
140 words
A method for compression of loss-tolerant video image data derived from disparate multiple sources for conveyance at a predetermined fixed rate, said method comprising the steps of: segmenting data from said disparate multiple sources into video blocks, each block being associated with one source and having data in bits ranked in order of significance, each block having associated therewith a distortion metric as a function of the number of bits in the block to represent the quality of the data contained in the block; ranking said blocks according to the distortion metric of each one of said blocks; dropping the lowest significant bits of selected ones of said blocks having lowest distortion metrics; and allocating bits to other ones of said blocks having highest distortion metrics, in order to redistribute quality and equalize distortion among each one of said blocks.
Claim 28
Independent Claim
140 words
A method for compression of loss-tolerant video image data derived from disparate multiple sources for conveyance at a predetermined fixed rate, said method comprising the steps of: segmenting data from said disparate multiple sources into video blocks, each block being associated with one source and having data in bits ranked in order of significance, each block having associated therewith a distortion metric as a function of the number of bits in the block to represent the quality of the data contained in the block; ranking said blocks according to the distortion metric of each one of said blocks; dropping the lowest significant bits of selected ones of said blocks having lowest distortion metrics; and allocating bits to other ones of said blocks having highest distortion metrics, in order to redistribute quality and equalize distortion among each one of said blocks.
Claim 29
Independent Claim
142 words
A method for communication of video image information over a telecommunications channel, comprising: compressing loss-tolerant data by: segmenting video image data from disparate video sources into blocks, each block having said video image data in bits ranked in order of significance, each block having associated therewith a metric of distortion as a function of the number of bits per block to represent the quality of the video image data contained in each block; ranking said blocks according to the distortion metric of each one of said blocks; dropping the lowest significant bits of selected ones of said blocks having lowest distortion metrics; and allocating available bits to other ones of said blocks having highest distortion metrics, in order to redistribute quality and distortion among each one of said blocks to produce distortion-distributed blocks; and applying said distortion-distributed blocks to the communication channel.
Claim 30
Independent Claim
142 words
A method for communication of video image information over a telecommunications channel, comprising: compressing loss-tolerant data by: segmenting video image data from disparate video sources into blocks, each block having said video image data in bits ranked in order of significance, each block having associated therewith a metric of distortion as a function of the number of bits per block to represent the quality of the video image data contained in each block; ranking said blocks according to the distortion metric of each one of said blocks; dropping the lowest significant bits of selected ones of said blocks having lowest distortion metrics; and allocating available bits to other ones of said blocks having highest distortion metrics, in order to redistribute quality and distortion among each one of said blocks to produce distortion-distributed blocks; and applying said distortion-distributed blocks to the communication channel.
Claim 31
Independent Claim
172 words
A method for compression of loss-tolerant video image data from a plurality of variable bit rate inputs to produce a multiplexed constant bit rate output, said method comprising the steps of: segmenting said video image data from said plurality of inputs into constant-sized blocks suitable for multiplexing in said constant bit rate output, each block having its data ranked in an order according to at least one criterion, each block having associated therewith a distortion metric to represent quality of the data contained in the block; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics and in order to be accommodated within constant-sized blocks; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and multiplexing all of said blocks into a single and constant bit rate data stream.
Claim 32
Independent Claim
172 words
A method for compression of loss-tolerant video image data from a plurality of variable bit rate inputs to produce a multiplexed constant bit rate output, said method comprising the steps of: segmenting said video image data from said plurality of inputs into constant-sized blocks suitable for multiplexing in said constant bit rate output, each block having its data ranked in an order according to at least one criterion, each block having associated therewith a distortion metric to represent quality of the data contained in the block; ranking said blocks according to the distortion metric of each one of said blocks; dropping at least selected first portions of selected ones of said blocks in accordance with said at least one criterion of said distortion metrics and in order to be accommodated within constant-sized blocks; allocating at least selected second portions to other ones of said blocks in accordance with said at least one criterion on said distortion metrics; and multiplexing all of said blocks into a single and constant bit rate data stream.
References Cited (Backward Citations)
US5198940A
Cited
US4802232A
Cited
US4872009A
Cited
US4916537A
Cited
US4951139A
Cited
US4963030A
Cited
US5115309A
Cited
USRE35093E
Cited
US5218650A
Cited
US5509017A
Cited
US5231484A
Cited
US5473378A
Cited
US5339108A
Cited
US5289276A
Cited
US5563960A
Cited
US5473379A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-03-30 | 2001-09-29 | 2002-03-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-30 | 2005-09-29 | 2006-03-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-30 | 2009-09-29 | 2010-03-31 | $7700.00 | Window Closed / Lapsed |