Patent US5887084A successfully refreshed from Google Patents.
US5887084A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Structuring a digital image into a DCT pyramid image representation
Assignee: Hanger Solutions LLC
•
Filing: 1997-11-07
•
Granted: 1999-03-23
•
Expires: 2017-11-07
Abstract
Abstract A method or system for structuring an image which corresponds to an original array of pixels, as a forward discrete even cosine transform (DCT) pyramid having a predetermined number of levels where each level is associated with a different DCT frequency band, includes, respectively, the steps or functionality of: partitioning the original array into blocks of overlapped pixels; taking a DCT of each block of overlapped pixels to generate blocks of first level DCT coefficients forming a first level of the DCT pyramid; storing the first level of the DCT pyramid; selecting and storing at least one of the first level DCT coefficients of each block of first level DCT coefficients into a first temporary array; partitioning the first temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the first temporary array to generate blocks of second level DCT coefficients forming a second level of the DCT pyramid. Additional levels can be created by repeating the previous steps, and the processed image can be restored by reversing the above sequence of steps using inverse discrete even cosine transforms.
Inventors
- 👤 Munib A. Wober
- 👤 Yibing Yang
- 👤 Ibrahim Hajjahmad
- 👤 Lon E. Sunshine
- 👤 Michael L. Reisch
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:33
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/141
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
154 words
A method for structuring an image which corresponds to an original array of pixels, as a forward discrete even cosine transform (DCT) pyramid having a predetermined number of levels where each level is associated with a different DCT frequency band, the method comprising the steps of: partitioning the original array into blocks of overlapped pixels; taking a DCT of each block of overlapped pixels to generate blocks of first level DCT coefficients forming a first level of the DCT pyramid; storing said first level of the DCT pyramid; selecting and storing at least one of said first level DCT coefficients of each block of first level DCT coefficients into a first temporary array; partitioning the first temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the first temporary array to generate blocks of second level DCT coefficients forming a second level of the DCT pyramid.
Claim 2
Independent Claim
154 words
A method for structuring an image which corresponds to an original array of pixels, as a forward discrete even cosine transform (DCT) pyramid having a predetermined number of levels where each level is associated with a different DCT frequency band, the method comprising the steps of: partitioning the original array into blocks of overlapped pixels; taking a DCT of each block of overlapped pixels to generate blocks of first level DCT coefficients forming a first level of the DCT pyramid; storing said first level of the DCT pyramid; selecting and storing at least one of said first level DCT coefficients of each block of first level DCT coefficients into a first temporary array; partitioning the first temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the first temporary array to generate blocks of second level DCT coefficients forming a second level of the DCT pyramid.
Claim 3
Dependent Claim
76 words
The method of claim 1 further comprising the steps of: selecting and storing at least one of said second level DCT coefficients of each block of second level DCT coefficients into a second temporary array; partitioning the second temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the second temporary array to generate blocks of third level DCT coefficients forming a third level of the DCT pyramid.
Claim 4
Dependent Claim
76 words
The method of claim 2 further comprising the steps of: selecting and storing at least one of said third level DCT coefficients of each block of third level DCT coefficients into a third temporary array; partitioning the third temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the third temporary array to generate blocks of fourth level DCT coefficients forming a fourth level of the DCT pyramid.
Claim 5
Dependent Claim
76 words
The method of claim 3 further comprising the steps of: selecting and storing at least one of said fourth level DCT coefficients of each block of fourth level DCT coefficients into a fourth temporary array; partitioning the fourth temporary array into blocks of overlapped coefficients; and taking a DCT of each block of overlapped coefficients of the fourth temporary array to generate blocks of fifth level DCT coefficients forming a fifth level of the DCT pyramid.
Claim 6
Dependent Claim
44 words
The method of claim 1 further comprising the step of independently processing each said level of the DCT pyramid, each said independent processing step selected from at least one of the group consisting of filtering, sharpening, smoothing, edge detecting, color adjusting and luminance adjusting.
Claim 7
Dependent Claim
169 words
The method of claim 1 further comprising the steps of: taking an inverse discrete even cosine transform of each block of second level DCT coefficients which form the second level of the DCT pyramid, to generate blocks of second level IDCT coefficients; discarding border regions and storing saved regions of said blocks of second level IDCT coefficients into a modified first temporary array to compensate for the overlapping of coefficients in the first temporary array; retrieving said stored blocks of first level DCT coefficients; inserting preselected components of said modified first temporary array, corresponding to said at least one of said first level DCT coefficients into said retrieved blocks of first level DCT coefficients to generate modified, retrieved blocks; taking an inverse discrete even cosine transform of each said modified, retrieved block to generate blocks of first level IDCT coefficients; and discarding border regions and storing saved regions of said blocks of first level IDCT coefficients into a modified original array corresponding to a processed and restored said image.
Claim 8
Independent Claim
163 words
A system for structuring an image which corresponds to an original array of pixels, as a forward discrete even cosine transform (DCT) pyramid having a predetermined number of levels where each level is associated with a different DCT frequency band, the system comprising: means for partitioning the original array into blocks of overlapped pixels; means for taking a DCT of each block of overlapped pixels to generate blocks of first level DCT coefficients forming a first level of the DCT pyramid; means for storing said first level of the DCT pyramid; means for selecting and storing at least one of said first level DCT coefficients of each block of first level DCT coefficients into a first temporary array; means for partitioning the first temporary array into blocks of overlapped coefficients; and means for taking a DCT of each block of overlapped coefficients of the first temporary array to generate blocks of second level DCT coefficients forming a second level of the DCT pyramid.
Claim 9
Independent Claim
163 words
A system for structuring an image which corresponds to an original array of pixels, as a forward discrete even cosine transform (DCT) pyramid having a predetermined number of levels where each level is associated with a different DCT frequency band, the system comprising: means for partitioning the original array into blocks of overlapped pixels; means for taking a DCT of each block of overlapped pixels to generate blocks of first level DCT coefficients forming a first level of the DCT pyramid; means for storing said first level of the DCT pyramid; means for selecting and storing at least one of said first level DCT coefficients of each block of first level DCT coefficients into a first temporary array; means for partitioning the first temporary array into blocks of overlapped coefficients; and means for taking a DCT of each block of overlapped coefficients of the first temporary array to generate blocks of second level DCT coefficients forming a second level of the DCT pyramid.
Claim 10
Dependent Claim
79 words
The system of claim 7 further comprising: means for selecting and storing at least one of said second level DCT coefficients of each block of second level DCT coefficients into a second temporary array; means for partitioning the second temporary array into blocks of overlapped coefficients; and means for taking a DCT of each block of overlapped coefficients of the second temporary array to generate blocks of third level DCT coefficients forming a third level of the DCT pyramid.
Claim 11
Dependent Claim
79 words
The system of claim 7 further comprising: means for selecting and storing at least one of said third level DCT coefficients of each block of third level DCT coefficients into a third temporary array; means for partitioning the third temporary array into blocks of overlapped coefficients; and means for taking a DCT of each block of overlapped coefficients of the third temporary array to generate blocks of fourth level DCT coefficients forming a fourth level of the DCT pyramid.
Claim 12
Dependent Claim
79 words
The system of claim 9 further comprising: means for selecting and storing at least one of said fourth level DCT coefficients of each block of fourth level DCT coefficients into a fourth temporary array; means for partitioning the fourth temporary array into blocks of overlapped coefficients; and means for taking a DCT of each block of overlapped coefficients of the fourth temporary array to generate blocks of fifth level DCT coefficients forming a fifth level of the DCT pyramid.
Claim 13
Dependent Claim
18 words
The system of claim 7 further comprising means for independently processing each said level of the DCT pyramid.
Claim 14
Dependent Claim
23 words
The system of claim 11 wherein said independent processing means comprises means for filtering at least one said level of the DCT pyramid.
Claim 15
Dependent Claim
23 words
The system of claim 11 wherein said independent processing means comprises means for sharpening at least one said level of the DCT pyramid.
Claim 16
Dependent Claim
23 words
The system of claim 11 wherein said independent processing means comprises means for smoothing at least one said level of the DCT pyramid.
Claim 17
Dependent Claim
25 words
The system of claim 11 wherein said independent processing means comprises means for edge detection in at least one said level of the DCT pyramid.
Claim 18
Dependent Claim
178 words
The system of claim 7 further comprising: means for taking an inverse discrete even cosine transform of each block of second level DCT coefficients which form the second level of the DCT pyramid, to generate blocks of second level IDCT coefficients; means for discarding border regions and storing saved regions of said blocks of second level IDCT coefficients into a modified first temporary array to compensate for the overlapping of coefficients in the first temporary array; means for retrieving said stored blocks of first level DCT coefficients; means for inserting preselected components of said modified first temporary array, corresponding to said at least one of said first level DCT coefficients into said retrieved blocks of first level DCT coefficients to generate modified, retrieved blocks; means for taking an inverse discrete even cosine transform of each said modified, retrieved block to generate blocks of first level IDCT coefficients; and means for discarding border regions and storing saved regions of said blocks of first level IDCT coefficients into a modified original array corresponding to a processed and restored said 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-03-22 | 2002-09-21 | 2003-03-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-22 | 2006-09-21 | 2007-03-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-22 | 2010-09-21 | 2011-03-23 | $7700.00 | Window Closed / Lapsed |