US5828849A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method to derive edge extensions for wavelet transforms and inverse wavelet transforms
Assignee: Avago Technologies International Sales Pte Ltd
•
Filing: 1996-05-14
•
Granted: 1998-10-27
•
Expires: 2016-05-14
Abstract
Abstract A method derives edge extensions for wavelet transforms and inverse wavelet transforms of two-dimensional images. The method overcomes the necessity of side computations by treating the two-dimensional matrix of values as a one-dimensional array of values. The use of a one-dimensional array reduces the required flushing and loading of registers by allowing the flushing and loading to be performed in between frames, rather than in between rows or columns of the matrix.
Inventors
- 👤 Mody Lempel
- 👤 Manoucher Vafai
- 👤 Loganath Ramachandran
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 11:11
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; H04N19/649; H04N19/63
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
53 words
In a wavelet compression-decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: forming a one-dimensional array from the two-dimensional matrix by sequencing ends of the rows together; deriving the edge extensions for each value from adjacent values in the one-dimensional array.
Claim 2
Dependent Claim
53 words
In a wavelet compression-decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: forming a one-dimensional array from the two-dimensional matrix by sequencing ends of the rows together; deriving the edge extensions for each value from adjacent values in the one-dimensional array.
Claim 3
Dependent Claim
21 words
The method of claim 1, wherein the ends of the rows are sequenced in raster-scan order to form the one-dimensional array.
Claim 4
Dependent Claim
21 words
The method of claim 1, wherein the end of the rows are sequenced in zig-zag order to form the one-dimensional array.
Claim 5
Dependent Claim
11 words
The method of claim 1, wherein the one-dimensional array is cyclical.
Claim 6
Dependent Claim
11 words
The method of claim 2, wherein the one-dimensional array is cyclical.
Claim 7
Dependent Claim
21 words
The method of claim 5, wherein the edge extensions are used to determine future and back values for a wavelet transform.
Claim 8
Dependent Claim
22 words
The method of claim 5, wherein the edge extensions are used to determine future and back values for an inverse wavelet transform.
Claim 9
Dependent Claim
117 words
In a wavelet compression-decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: determining whether processing a present value requires a back value because the present value is sufficiently close to a first end of a present row; determining whether processing the present value requires a future value because the present value is sufficiently close to a second end of the present row; obtaining the back value from the second end of a preceding row, if processing the present value requires the back value; and obtaining the future value from the first end of a next row, if processing the present value requires the back value.
Claim 10
Dependent Claim
117 words
In a wavelet compression-decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: determining whether processing a present value requires a back value because the present value is sufficiently close to a first end of a present row; determining whether processing the present value requires a future value because the present value is sufficiently close to a second end of the present row; obtaining the back value from the second end of a preceding row, if processing the present value requires the back value; and obtaining the future value from the first end of a next row, if processing the present value requires the back value.
Claim 11
Dependent Claim
38 words
The method of claim 1, wherein the preceding row is the last row if the present row is the first row, and wherein the next row is the first row if the present row is the last row.
Claim 12
Dependent Claim
21 words
The method of claim 1, wherein the first end is a left end and the second end is a right end.
Claim 13
Dependent Claim
119 words
In a wavelet compression or decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: determining whether processing a present value requires a back value because the present value is sufficiently close to a first end of a present row; determining whether processing the present value requires a future value because the present value is sufficiently close to a second end of the present row; obtaining the back value from the first end of a preceding row, if processing the present value requires the back value; and obtaining the future value from the second end of a next row, if processing the present value requires the back value.
Claim 14
Dependent Claim
119 words
In a wavelet compression or decompression system for multimedia computing, a method for deriving edge extensions for a two-dimensional matrix of values in multiple rows comprising: determining whether processing a present value requires a back value because the present value is sufficiently close to a first end of a present row; determining whether processing the present value requires a future value because the present value is sufficiently close to a second end of the present row; obtaining the back value from the first end of a preceding row, if processing the present value requires the back value; and obtaining the future value from the second end of a next row, if processing the present value requires the back value.
Claim 15
Dependent Claim
38 words
The method of claim 11, wherein the preceding row is the last row if the present row is the first row, and wherein the next row is the first row if the present row is the last row.
References Cited (Backward Citations)
US5101446A
Cited
US5398067A
Cited
US5381354A
Cited
US5546477A
Cited
US5586200A
Cited
US5600373A
Cited
US5615287A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-26 | 2002-04-27 | 2002-10-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-26 | 2006-04-27 | 2006-10-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-26 | 2010-04-27 | 2010-10-27 | $7700.00 | Window Closed / Lapsed |