US5854857A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Using encoding cost data for segmentation and background suppression in JPEG-compressed images
Assignee: Xerox Corp
•
Filing: 1996-09-26
•
Granted: 1998-12-29
•
Expires: 2016-09-26
Abstract
Abstract An enhancement to the standard JPEG image data compression technique includes a step of recording the length of each string of bits corresponding to each block of pixels in the original image at the time of compression. The list of lengths of each string of bits in the compressed image data is retained as an "encoding cost map" or ECM. The ECM, which is considerably smaller than the compressed image data, can be transmitted or retained in memory separate from the compressed image data along with some other accompanying information and is used as a "key" for editing or segmentation of the compressed image data. The ECM, in combination with a map of DC components of the compressed image, can also be used for substituting background portions of the image with blocks of pure white data, in order to compress certain types of images even further.
Inventors
- 👤 Ricardo L. de Queiroz
- 👤 Reiner Eschbach
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 13:59
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/40062; H04N19/00; H04N19/10; H04N19/102; H04N19/124; H04N19/126; H04N19/85; H04N19/20; H04N19/60
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
139 words
A method of processing compressed digital data derived from an original image, the data being organized as a set of blocks, each block comprising a string of bits corresponding to an area of the original image, comprising the steps of: counting a number of bits in each string of bits; deriving a cost function for each string of bits, said cost function being a number related to the number of bits in each string of bits; deriving an encoding cost map from the cost functions of the original image; applying an image segmentation technique to the encoding cost map; and interpolating the encoding cost map to the original image, thereby identifying a first portion of the original image as being of a first type and identifying a second portion of the original image as being of a second type.
Claim 2
Independent Claim
139 words
A method of processing compressed digital data derived from an original image, the data being organized as a set of blocks, each block comprising a string of bits corresponding to an area of the original image, comprising the steps of: counting a number of bits in each string of bits; deriving a cost function for each string of bits, said cost function being a number related to the number of bits in each string of bits; deriving an encoding cost map from the cost functions of the original image; applying an image segmentation technique to the encoding cost map; and interpolating the encoding cost map to the original image, thereby identifying a first portion of the original image as being of a first type and identifying a second portion of the original image as being of a second type.
Claim 3
Dependent Claim
44 words
The method of claim 1, the applying step including the steps of thresholding each cost function derived from the compressed digital data, wherein each cost function not more than a predetermined first threshold is changed to zero, thereby yielding a thresholded encoding cost map.
Claim 4
Dependent Claim
21 words
The method of claim 1, the applying step including the step of applying an order-statistic screen to the encoding cost map.
Claim 5
Dependent Claim
23 words
The method of claim 1, the applying step including the step of applying a connected-components analysis to blocks to the encoding cost map.
Claim 6
Independent Claim
148 words
A method of processing compressed digital data forming an original image, the data being organized as a set of blocks, each block comprising a string of bits corresponding to an area of the original image, each string of bits including data related to a DC component of the block, comprising the steps of: obtaining a DC component for each block; deriving a cost function for each string of bits, said cost function being a number related to the number of bits in each string of bits; for each block, identifying the block as a background block if the DC component is not less than a first predetermined threshold and if the cost function is not more than a second predetermined threshold; and for each identified background block, replacing the string of bits for the background block with a predetermined fixed string of bits in the compressed image data.
Claim 7
Independent Claim
148 words
A method of processing compressed digital data forming an original image, the data being organized as a set of blocks, each block comprising a string of bits corresponding to an area of the original image, each string of bits including data related to a DC component of the block, comprising the steps of: obtaining a DC component for each block; deriving a cost function for each string of bits, said cost function being a number related to the number of bits in each string of bits; for each block, identifying the block as a background block if the DC component is not less than a first predetermined threshold and if the cost function is not more than a second predetermined threshold; and for each identified background block, replacing the string of bits for the background block with a predetermined fixed string of bits in the compressed image data.
Claim 8
Dependent Claim
19 words
The method of claim 5, wherein the predetermined fixed string of bits is consistent with a pure white image.
Claim 9
Dependent Claim
30 words
The method of claim 5, further comprising the step of transmitting strings of bits for each block, including transmitting fixed predetermined strings of bits corresponding to each identified background block.
References Cited (Backward Citations)
US4504972A
Cited
US4400738A
Cited
US5048096A
Cited
US5229864A
Cited
US5020121A
Cited
US5566255A
Cited
US5257113A
Cited
US5327248A
Cited
US5379122A
Cited
US5625460A
Cited
US5521718A
Cited
US5541919A
Cited
US5751862A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-12-28 | 2002-06-29 | 2002-12-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-12-28 | 2006-06-29 | 2006-12-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-12-28 | 2010-06-29 | 2010-12-29 | $7700.00 | Window Closed / Lapsed |