US5495538A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Segmentation-based JPEG image artifacts reduction
Assignee: Xerox Corp
•
Filing: 1995-03-08
•
Granted: 1996-02-27
•
Expires: 2015-03-08
Abstract
Abstract A method for reducing ringing and blocking artifacts in a decompressed image models an image in a relatively small area as several smooth regions separated by edges. The method uses JPEG MxM pixel blocks and is compatible with JPEG decompression. To reduce ringing, a block is examined for uniformity, segmented and smoothed. Then, after a DCT transform, a projection is performed to guarantee that the DCT coefficients of the resulting image block will be within the initial quantization interval. The resultant image is produced by an inverse DCT. To reduce blocking, the method is modified to employ a large outer window for uniformity checking, segmentation and smoothing and a small inner window for DCT projection.
Inventors
- 👤 Zhigang Fan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 19:14
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/85; H04N19/86; H04N19/10; H04N19/102; H04N19/124; H04N19/126; H04N19/80; H04N19/20; H04N19/60
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
229 words
A method of decompressing a compressed image which reduces artifacts in a decompressed image, comprising the steps of: inputting a signal representing a plurality of discrete cosine transform coefficients grouped into blocks, each of the plurality of input discrete cosine transform coefficients representing a corresponding pixel value for a pixel in the compressed image; determining an initial quantization interval corresponding to each of the plurality of input discrete cosine transform coefficients based on the input discrete cosine transform coefficient; performing an inverse discrete cosine transform on each block of input discrete cosine transform coefficients to produce a pixel block of a corresponding plurality of pixel values; examining each pixel block for uniformity in pixel values; grouping pixels having pixel values within an intensity threshold in each non-uniform pixel block into regions; smoothing the pixel values for the pixels in each region by low pass filtering; performing a discrete cosine transform on the smoothed pixel values for the pixels in each block, the discrete cosine transform yielding resultant discrete cosine transform coefficients; projecting each of the resultant discrete cosine transform coefficients so that the resultant discrete cosine transform coefficients are within the corresponding initial quantization interval; performing an inverse discrete cosine transform on the resultant discrete cosine transform coefficients to produce a final signal representing final pixel values for pixels corresponding to the decompressed image; and outputting the final signal.
Claim 2
Independent Claim
229 words
A method of decompressing a compressed image which reduces artifacts in a decompressed image, comprising the steps of: inputting a signal representing a plurality of discrete cosine transform coefficients grouped into blocks, each of the plurality of input discrete cosine transform coefficients representing a corresponding pixel value for a pixel in the compressed image; determining an initial quantization interval corresponding to each of the plurality of input discrete cosine transform coefficients based on the input discrete cosine transform coefficient; performing an inverse discrete cosine transform on each block of input discrete cosine transform coefficients to produce a pixel block of a corresponding plurality of pixel values; examining each pixel block for uniformity in pixel values; grouping pixels having pixel values within an intensity threshold in each non-uniform pixel block into regions; smoothing the pixel values for the pixels in each region by low pass filtering; performing a discrete cosine transform on the smoothed pixel values for the pixels in each block, the discrete cosine transform yielding resultant discrete cosine transform coefficients; projecting each of the resultant discrete cosine transform coefficients so that the resultant discrete cosine transform coefficients are within the corresponding initial quantization interval; performing an inverse discrete cosine transform on the resultant discrete cosine transform coefficients to produce a final signal representing final pixel values for pixels corresponding to the decompressed image; and outputting the final signal.
Claim 3
Dependent Claim
32 words
The method of claim 1, wherein the step of examining each pixel block for uniformity comprises comparing a range of pixel values for the pixels in each block to a uniformity threshold.
Claim 4
Dependent Claim
63 words
The method of claim 1, wherein the step of grouping pixels into regions comprises the steps of: forming initial regions of connected pixels wherein neighboring pixels have a difference in pixel value smaller than the intensity threshold, and merging neighboring initial regions into a single region in sequence, the merged neighboring initial regions having at most a minimum difference in mean pixel value.
Claim 5
Dependent Claim
43 words
The method of claim 1, wherein the step of projecting includes comparing each of the resultant discrete cosine transform coefficients for each block to the corresponding initial quantization interval and correcting the resultant discrete transform coefficients to fit within the initial quantization interval.
Claim 6
Dependent Claim
50 words
The method of claim 4, wherein, when the resultant discrete cosine transform coefficients for a block are not within the initial quantization interval, the step of correcting comprises partitioning at least one region of pixels within the block into two regions and repeating the steps of smoothing, transforming and comparing.
Claim 7
Dependent Claim
17 words
The method of claim 5, wherein the step of partitioning comprises splitting the last merged region first.
Claim 8
Dependent Claim
45 words
The method of claim 4, wherein when the discrete cosine transform coefficients fit generally within the initial quantization interval or a number of merged regions equals an established minimum number of regions, the method proceeds to the step of performing the inverse discrete cosine transform.
Claim 9
Dependent Claim
67 words
The method of claim 1, wherein the step of smoothing comprises replacing the pixel values of pixels in an interior of a region with a mean pixel value of pixels in the region, and replacing the pixel value of each pixel in the boundary of the region with a combination of the pixel value of the pixel and the mean pixel value of pixels in the region.
Claim 10
Dependent Claim
59 words
The method of claim 1, wherein the step of smoothing further comprises replacing the pixel values of boundary pixels with a pixel value obtained by the following relationship: y(m,n)=α[x]y(m,n)+(1-α)[x]μ where y(m,n) is the pixel value of a boundary pixel at position (m,n); α is a pre-set factor satisfying 0≦α≦1; and α is the mean pixel value of the region.
Claim 11
Dependent Claim
77 words
The method of claim 1, wherein the step of projecting is performed by the following relationships: Z(u,v)=U(u,v) if Y(u,v)>U(u,v); Z(u,v)=L(u,v) if Y(u,v)<L(u,v); and Z(u,v)=Y(u,v) otherwise, wherein Z(u,v) is the output of the projection for (u,v) discrete cosine transform coefficients; U(u,v) is an upper discrete cosine transform boundary; L(u,v) is a lower discrete cosine transform boundary; and Y(u,v) is a desirable discrete cosine transform boundary, wherein the upper and lower boundaries are based on the initial quantization interval.
Claim 12
Dependent Claim
71 words
The method of claim 1, further comprising: forming at least one first outer window of pixel values around a corresponding second inner window of pixel values; using the at least one first outer window for the steps of examining each pixel block for uniformity, forming regions, and smoothing; and using the corresponding second inner window for the steps of performing the discrete cosine transform, projecting and performing the inverse cosine transform.
Claim 13
Independent Claim
185 words
A method of decompressing compressed image data, comprising the steps of: inputting a signal comprising blocks of discrete cosine transform coefficients, the discrete cosine transform coefficients representative of a compressed image; establishing discrete cosine transform constraints based on the input discrete cosine transform coefficients; transforming the blocks of discrete cosine transform coefficients into pixel blocks of intensity values representing pixels; determining initial pixel intensity values for each of the pixel blocks; determining uniformity of intensity values for pixels for each pixel block; forming regions of pixels in each non-uniform pixel block; replacing the initial pixel intensity values corresponding to pixels in a region with an average pixel intensity value of the respective region to smooth the region; performing a discrete cosine transform on the intensity values for each pixel block yielding resultant discrete cosine transform coefficients; projecting the resultant discrete cosine transform coefficients for each pixel block onto the established discrete cosine transform constraints; performing an inverse discrete cosine transform on the projected resultant coefficients to produce a final signal comprising intensity values for pixels representative of a decompressed image; and outputting the final signal.
Claim 14
Independent Claim
185 words
A method of decompressing compressed image data, comprising the steps of: inputting a signal comprising blocks of discrete cosine transform coefficients, the discrete cosine transform coefficients representative of a compressed image; establishing discrete cosine transform constraints based on the input discrete cosine transform coefficients; transforming the blocks of discrete cosine transform coefficients into pixel blocks of intensity values representing pixels; determining initial pixel intensity values for each of the pixel blocks; determining uniformity of intensity values for pixels for each pixel block; forming regions of pixels in each non-uniform pixel block; replacing the initial pixel intensity values corresponding to pixels in a region with an average pixel intensity value of the respective region to smooth the region; performing a discrete cosine transform on the intensity values for each pixel block yielding resultant discrete cosine transform coefficients; projecting the resultant discrete cosine transform coefficients for each pixel block onto the established discrete cosine transform constraints; performing an inverse discrete cosine transform on the projected resultant coefficients to produce a final signal comprising intensity values for pixels representative of a decompressed image; and outputting the final signal.
Claim 15
Dependent Claim
30 words
The method of claim 12, wherein the step of determining uniformity comprises comparing an intensity range of values for the pixels in each block to a pre-set uniformity value threshold.
Claim 16
Dependent Claim
22 words
The method of claim 12, wherein the step of projecting comprises comparing the resultant coefficients to the established discrete cosine transform constraints.
Claim 17
Dependent Claim
25 words
The method of claim 14, wherein the step of projecting further comprises correcting the resultant discrete cosine transform coefficients to fit within the established constraints.
Claim 18
Dependent Claim
46 words
The method of claim 14, wherein when the resultant discrete cosine transform coefficients for a pixel block are not within the established coefficient constraints, the method further comprises partitioning a region in the pixel block into two and repeating the steps of replacing, transforming, and projecting.
Claim 19
Dependent Claim
79 words
The method of claim 12, wherein the step of projecting is performed by the following relationships: Z(u,v)=U(u,v) if Y(u,v)>U(u,v); Z(u,v)=L(u,v) if Y(u,v)<L(u,v); and Z(u,v)=Y(u,v) otherwise, wherein Z(u,v) is the output of the projection for (u,v) discrete cosine transform coefficients; U(u,v) is an upper discrete cosine transform boundary; L(u,v) is a lower discrete cosine transform boundary; and Y(u,v) is a desirable discrete cosine transform boundary, wherein the upper and lower boundaries are based on the established discrete cosine transform constraints.
Claim 20
Dependent Claim
66 words
The method of claim 12, further comprising: forming at least one first outer window of pixel intensity values around a corresponding second inner window of pixel intensity values; using the at least one first outer window for the steps of determining uniformity, forming regions, and replacing pixel values; and using the corresponding second inner window for the steps of performing the discrete cosine transform and projecting.
Claim 21
Dependent Claim
64 words
The method of claim 12, wherein the step of forming regions comprising the steps of: forming initial regions of connected pixels wherein neighboring pixels have a difference in intensity value that is smaller than a pre-set intensity value threshold, and merging neighboring initial regions into a single region in sequence, the merged neighboring initial regions having a minimum difference in mean pixel intensity value.
Claim 22
Dependent Claim
78 words
The method of claim 12, wherein the step of replacing pixel intensity values comprises replacing the initial pixel intensity value of each pixel in an interior of a region with a mean pixel intensity value of pixels in the region, and replacing the initial pixel intensity value of pixels in the boundary of the region with a combination of the initial pixel intensity value of the pixel and the mean pixel intensity value of pixels in the region.
Claim 23
Dependent Claim
64 words
The method of claim 12, wherein the step of replacing pixel intensity values further comprises replacing the initial pixel intensity value of boundary pixels with a value obtained by the following relationship: y(m,n)=α[x]y(m,n)+(1-α)[x]μ where y(m,n) is the intensity value of a boundary pixel at position (m,n); α is a pre-set factor satisfying 0≦α≦1; and μ is the mean pixel intensity value of the region.
References Cited (Backward Citations)
US4965754A
Cited
US5049991A
Cited
US5121216A
Cited
US5241395A
Cited
US5001559A
Cited
US5129015A
Cited
US4999705A
Cited
US5127021A
Cited
EP0590922A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-02-26 | 1999-08-28 | 2000-02-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-02-26 | 2003-08-28 | 2004-02-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-02-26 | 2007-08-28 | 2008-02-27 | $7700.00 | Window Closed / Lapsed |