US6334001B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Iterative smoothing technique for pre-processing mixed raster content planes to improve the quality of a decompressed image and increase document compression ratios
Assignee: Xerox Corp
•
Filing: 2000-12-07
•
Granted: 2001-12-25
•
Expires: 2020-12-07
Abstract
Abstract A method and apparatus for compressing a mixed raster content image that represents a color or gray scale a document is disclosed. The pixel map is decomposed into a three-plane representation—a reduced-resolution “upper” plane, a reduced-resolution “lower” plane, and a high-resolution binary selector plane. An iterative smoothing technique is then used to pre-process the upper and lower planes using the information contained in the selector plane, thereby reducing the amount of data that will be subjected to further processing.
Inventors
- 👤 Ricardo L. de Queiroz
- 👤 Reiner Eschbach
- 👤 William A. Fuss
- 👤 Robert R. Buckley
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 15:21
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/40062; G; G06; G06T; G06T7/00; G06T7/10; G06T7/11; G06T2207/00; G06T2207/10; G06T2207/10004; G06T2207/10008; G06T2207/20; G06T2207/20048; G06T2207/20052; G06T2207/30; G06T2207/30176
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
284 words
A method of processing mixed raster content planes which represent a compressed pixel map representation of a document, wherein the mixed raster content planes include an upper plane, a lower plane, and a selector plane, and wherein the upper and lower planes have been processed based upon data contained in said selector plane, comprising the steps of: a) generating an image plane map which identifies locations on an associated image data plane of image data signals that shall be used to reconstruct said digital image; b) replacing all image data signals that correspond to locations not identified for image reconstruction using an iterative smoothing technique; and c) outputting said image plane; wherein for said image data signal replacing steps, said iterative smoothing technique comprises the steps of: 1) replacing each image data signal on said image plane that does not correspond to said reconstruction identified locations with a signal equal to an average of all image data neighbor signals that correspond to locations previously identified for reconstruction, wherein a neighbor signal is defined as an image data signal that is horizontally, vertically or diagonally adjacent to said image data signal; 2) applying a discrete cosine transformation to said image plane and quantizing the results of said transformation; 3) inverse quantizing said transformation results and performing an inverse discrete cosine transform thereon, thereby generating a pseudo-plane that has image data signals that lie in the same locations as signals in said image data plane; and 4) replacing each image data signal on said image data plane that does not correspond to a reconstruction identified location on said image data plane map with an image data signal on said pseudo-plane that lies in a same location.
Claim 2
Independent Claim
284 words
A method of processing mixed raster content planes which represent a compressed pixel map representation of a document, wherein the mixed raster content planes include an upper plane, a lower plane, and a selector plane, and wherein the upper and lower planes have been processed based upon data contained in said selector plane, comprising the steps of: a) generating an image plane map which identifies locations on an associated image data plane of image data signals that shall be used to reconstruct said digital image; b) replacing all image data signals that correspond to locations not identified for image reconstruction using an iterative smoothing technique; and c) outputting said image plane; wherein for said image data signal replacing steps, said iterative smoothing technique comprises the steps of: 1) replacing each image data signal on said image plane that does not correspond to said reconstruction identified locations with a signal equal to an average of all image data neighbor signals that correspond to locations previously identified for reconstruction, wherein a neighbor signal is defined as an image data signal that is horizontally, vertically or diagonally adjacent to said image data signal; 2) applying a discrete cosine transformation to said image plane and quantizing the results of said transformation; 3) inverse quantizing said transformation results and performing an inverse discrete cosine transform thereon, thereby generating a pseudo-plane that has image data signals that lie in the same locations as signals in said image data plane; and 4) replacing each image data signal on said image data plane that does not correspond to a reconstruction identified location on said image data plane map with an image data signal on said pseudo-plane that lies in a same location.
Claim 3
Dependent Claim
52 words
A method of processing a compressed pixel map as claimed in claim 1 wherein for said image data signal replacing step, said iterative smoothing step further comprises after once completing said replacing step, repeating said applying step, said inverse quantizing step and said replacing step until a designated stop criteria is met.
Claim 4
Dependent Claim
67 words
A method of processing a compressed pixel map as claimed in claim 2 wherein for said iterative smoothing step, said designated stop criteria further comprises: a) comparing a magnitude of image data signals identified for reconstruction in consecutive processing operations; b) measuring a difference in said consecutive image data signal magnitudes; and c) canceling said repeating step when said measured difference is less than a predetermined value.
Claim 5
Dependent Claim
27 words
A method of processing a compressed pixel map as claimed in claim 1 further comprising removing all but the lowest frequency coefficients, thereby generating a pseudo plane.
Claim 6
Dependent Claim
56 words
A method of processing a compressed pixel map as claimed in claim 4 wherein for said image data replacing step, said iterative smoothing technique further comprises after once completing said replacing step, repeating said applying step, said lowest frequency removing step, said inverse quantizing step and said replacing step until a designated stop criteria is met.
Claim 7
Dependent Claim
67 words
A method of processing a compressed pixel map as claimed in claim 5 wherein for said iterative smoothing step, said designated stop criteria further comprises: a) comparing a magnitude of image data signals identified for reconstruction in consecutive processing operations; b) measuring a difference in said consecutive image data signal magnitudes; and c) canceling said repeating step when said measured difference is less than a predetermined value.
Claim 8
Independent Claim
335 words
A method of processing mixed master content planes which represent a compressed pixel map representation of a document, wherein the mixed raster content planes include an upper plane a lower plane and a selector plane, and wherein the upper and lower planes have been processed based upon data contained in said selector plane, comprising the steps of: a) inputting a threshold signal, which indicates an acceptable level of distortion for a subsequent processing operation; b) inputting a variance signal, which indicates a maximum acceptable magnitude difference between an image data signal and a threshold signal; c) generating an image plane map which identifies locations on an associated image data plane of image data signals that shall be used to reconstruct said digital image; d) replacing image data signals that correspond to locations not identified for image reconstruction using an iterative smoothing technique if said variance signal is greater than or equal to said threshold signal; and e) outputting said image plane; wherein for said image data signal replacing step, said iterative smoothing technique further comprises the steps of: 1) replacing each image data signal on said image plane that does not correspond to said reconstruction identified locations with a signal equal to an average of all image data neighbor signals that correspond to locations previously identified for reconstruction, wherein a neighbor signal is defined as an image data signal that is horizontally, vertically, or diagonally adjacent to said image data signal; 2) applying a discrete cosine transformation to said image plane and quantizing the results of said transformation; 3) inverse quantizing said transformation results and performing an inverse discrete cosine transform thereon, thereby generating a pseudo-plane that has image data signals that lie in the same locations as signals in said image data plane; and 4) replacing each image data signal on said image data plane that does not correspond to a reconstruction identified location on said image data plane map with an image data signal on said pseudoplane that lies in a same location.
Claim 9
Independent Claim
335 words
A method of processing mixed master content planes which represent a compressed pixel map representation of a document, wherein the mixed raster content planes include an upper plane a lower plane and a selector plane, and wherein the upper and lower planes have been processed based upon data contained in said selector plane, comprising the steps of: a) inputting a threshold signal, which indicates an acceptable level of distortion for a subsequent processing operation; b) inputting a variance signal, which indicates a maximum acceptable magnitude difference between an image data signal and a threshold signal; c) generating an image plane map which identifies locations on an associated image data plane of image data signals that shall be used to reconstruct said digital image; d) replacing image data signals that correspond to locations not identified for image reconstruction using an iterative smoothing technique if said variance signal is greater than or equal to said threshold signal; and e) outputting said image plane; wherein for said image data signal replacing step, said iterative smoothing technique further comprises the steps of: 1) replacing each image data signal on said image plane that does not correspond to said reconstruction identified locations with a signal equal to an average of all image data neighbor signals that correspond to locations previously identified for reconstruction, wherein a neighbor signal is defined as an image data signal that is horizontally, vertically, or diagonally adjacent to said image data signal; 2) applying a discrete cosine transformation to said image plane and quantizing the results of said transformation; 3) inverse quantizing said transformation results and performing an inverse discrete cosine transform thereon, thereby generating a pseudo-plane that has image data signals that lie in the same locations as signals in said image data plane; and 4) replacing each image data signal on said image data plane that does not correspond to a reconstruction identified location on said image data plane map with an image data signal on said pseudoplane that lies in a same location.
Claim 10
Dependent Claim
52 words
A method of processing a compressed pixel map as claimed in claim 7 wherein for said image data signal replacing step, said iterative smoothing step further comprises after once completing said replacing step, repeating said applying step, said inverse quantizing step and said replacing step until a designated stop criteria is met.
Claim 11
Dependent Claim
67 words
A method of processing a compressed pixel map as claimed in claim 8 wherein for said iterative smoothing step, said designated stop criteria further comprises: a) comparing a magnitude of image data signals identified for reconstruction in consecutive processing operations; b) measuring a difference in said consecutive image data signal magnitudes; and c) canceling said repeating step when said measured difference is less than a predetermined value.
Claim 12
Dependent Claim
27 words
A method of processing a compressed pixel map as claimed in claim 7 further comprising removing all but the lowest frequency coefficients, thereby generating a pseudo plane.
Claim 13
Dependent Claim
57 words
A method of processing a compressed pixel map as claimed in claim 10 wherein for said image data signal replacing step, said iterative smoothing step further comprises after once completing said replacing step, repeating said applying step, said lowest frequency removing step, said inverse quantizing step and said replacing step until a designated stop criteria is met.
Claim 14
Dependent Claim
67 words
A method of processing a compressed pixel map as claimed in claim 11 wherein for said iterative smoothing step, said designated stop criteria further comprises: a) comparing a magnitude of image data signals identified for reconstruction in consecutive processing operations; b) measuring a difference in said consecutive image data signal magnitudes; and c) canceling said repeating step when said measured difference is less than a predetermined value.
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) | 2004-12-24 | 2005-06-25 | 2005-12-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-12-24 | 2009-06-25 | 2009-12-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-12-24 | 2013-06-25 | 2013-12-25 | $7700.00 | Window Closed / Lapsed |