Patent US4425829A successfully refreshed from Google Patents.
Patent US5867598A successfully refreshed from Google Patents.
US5867598A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for processing of a JPEG compressed image
Assignee: Xerox Corp
•
Filing: 1996-09-26
•
Granted: 1999-02-02
•
Expires: 2016-09-26
Abstract
Abstract The present invention is a method and apparatus for the processing of images that have been compressed using a discrete cosine transform operation, and particularly JPEG compressed images. In a preferred embodiment, the rotation of image blocks is accomplished by sign inversion and transposition operations to accomplish intrablock operations. Subsequently, one of a number of alternative methods is employed to accomplish the same image processing on an interblock level, thereby enabling the rotation or mirroring of compressed images. The two stage process allows the use of either a standardized JPEG system with enhancements or a hybrid processing method, thereby accomplishing the image processing in conjunction with compression or decompression operations and minimizing the need for large memory buffers to accomplish the image processing. Accordingly, the technique has application to any number of systems, including digital printers and copiers where there may be a necessity to orthogonally rotate or mirror the digital image.
Inventors
- 👤 Ricardo L. de Queiroz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:53
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/48; H04N19/90; H04N19/91
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
175 words
A method for performing an image processing operation on compressed digital image data comprising a plurality of coded units, wherein each coded unit is a variable-length representation of the coefficients of a discrete cosine transform for a segment of a digital image, the method including the steps of: retrieving from a memory a coded unit; at least partially variable-length decoding the coded unit to produce a quantized coefficient matrix, wherein the step of variable length decoding further includes the identification of diagonal portions of a coefficient matrix; processing the quantized coefficient matrix in accordance with the image processing operation to produce a processed coefficient matrix, wherein the steps of variable-length decoding and processing the quantized coefficient matrix are performed in conjunction with one another on a single diagonal portion of the image at a time; variable-length encoding the processed coefficient matrix to produce a processed coded unit; and repeating the above steps for each of the plurality of coded units in the compressed digital image data to produce coded units of a processed, compressed image.
Claim 2
Independent Claim
175 words
A method for performing an image processing operation on compressed digital image data comprising a plurality of coded units, wherein each coded unit is a variable-length representation of the coefficients of a discrete cosine transform for a segment of a digital image, the method including the steps of: retrieving from a memory a coded unit; at least partially variable-length decoding the coded unit to produce a quantized coefficient matrix, wherein the step of variable length decoding further includes the identification of diagonal portions of a coefficient matrix; processing the quantized coefficient matrix in accordance with the image processing operation to produce a processed coefficient matrix, wherein the steps of variable-length decoding and processing the quantized coefficient matrix are performed in conjunction with one another on a single diagonal portion of the image at a time; variable-length encoding the processed coefficient matrix to produce a processed coded unit; and repeating the above steps for each of the plurality of coded units in the compressed digital image data to produce coded units of a processed, compressed image.
Claim 3
Dependent Claim
32 words
The method of claim 1, wherein the image processing operation is selected from the group consisting of: tranposition; clockwise orthogonal rotation; counterclockwise orthogonal rotation; 180 degree rotation; vertical mirroring; and horizontal mirroring.
Claim 4
Dependent Claim
44 words
The method of claim 1, wherein the image processing operation is an orthogonal clockwise rotation and where the processing of the quantized coefficient matrix includes: changing the sign of coefficients in selected rows of the quantized coefficient matrix; and transposing the quantized coefficient matrix.
Claim 5
Dependent Claim
44 words
The method of claim 1, wherein the image processing operation is an orthogonal counterclockwise rotation and where the processing of the quantized coefficient matrix includes: changing the sign of coefficients in selected columns of the quantized coefficient matrix; and transposing the quantized coefficient matrix.
Claim 6
Dependent Claim
52 words
The method of claim 1, wherein the image processing operation is a 180 degree rotation and where the processing of the quantized coefficient matrix includes: changing the sign of coefficients in selected rows of the quantized coefficient matrix; and changing the sign of coefficients in selected columns of the quantized coefficient matrix.
Claim 7
Dependent Claim
41 words
The method of claim 1, wherein the image processing operation is a vertical mirroring of the input image and where the processing of the quantized coefficient matrix includes changing the sign of coefficients in selected rows of the quantized coefficient matrix.
Claim 8
Dependent Claim
41 words
The method of claim 4, wherein the image processing operation is a horizontal mirroring of the input image and where the processing of the quantized coefficient matrix includes changing the sign of coefficients in selected columns of the quantized coefficient matrix.
Claim 9
Dependent Claim
84 words
The method of claim 1, further including the steps of: identifying a storage area in memory for the processed, compressed image; determining the offset, from a beginning of the storage area, at which to store each of the processed coded units, said offset being determined as a function of the image processing operation applied to the compressed image data; and storing the image data for each coded unit at the location indicated by the associated offset so as to produce a processed, compressed image.
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) | 2002-02-01 | 2002-08-03 | 2003-02-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-02-01 | 2006-08-03 | 2007-02-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-02-01 | 2010-08-03 | 2011-02-02 | $7700.00 | Window Closed / Lapsed |