US5101446A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for coding an image
Assignee: Aware Inc
•
Filing: 1990-05-31
•
Granted: 1992-03-31
•
Expires: 2010-05-31
Abstract
Abstract A method for coding an image or other two-dimensional data array to provide a sequence of images having differing spatial frequency content is disclosed. The method generates the output images by taking weighted sums of the pixels in the input image. The weights are sets of two-dimensional irreducible scaling and wavelet coefficients.
Inventors
- 👤 Howard L. Resnikoff
- 👤 David Pollen
- 👤 David C. P. Linden
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 22:25
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; H04N19/649; H04N19/50; H04N19/503; H04N19/51; H04N19/527; H04N19/63; H04N19/85; H04N19/86
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
146 words
An apparatus for generating a compressed image from an input image comprising a pixel array, I m , said apparatus comprising projection filtration means for filtering said input image to generate a low-frequency filtered image comprising a pixel array v m ; and output means including quantization means for approximating v m by integer values of a predetermined precision, wherein said low-frequency filtration means comprises: means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; means for receiving I m ; means for generating v m , wherein ##EQU3## and k runs over all values for which a k is not zero; and means for outputting v m .
Claim 2
Independent Claim
146 words
An apparatus for generating a compressed image from an input image comprising a pixel array, I m , said apparatus comprising projection filtration means for filtering said input image to generate a low-frequency filtered image comprising a pixel array v m ; and output means including quantization means for approximating v m by integer values of a predetermined precision, wherein said low-frequency filtration means comprises: means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; means for receiving I m ; means for generating v m , wherein ##EQU3## and k runs over all values for which a k is not zero; and means for outputting v m .
Claim 3
Dependent Claim
89 words
The apparatus of claim 1 further comprising high-frequency projection filter means for generating a high-frequency image comprising a pixel array, 1 w m from said input image, said high-frequency projection apparatus comprising: means for storing a set of coefficients { 1 a m }, wherein ##EQU4## and m runs over all values for which 1 a m is non-zero; means for generating 1 w m , wherein ##EQU5## and k runs over those values for which 1 a* k is non-zero; and means for outputting 1 w m .
Claim 4
Dependent Claim
151 words
An image reconstruction apparatus for generating a low-frequency image comprising a two-dimensional pixel array L I m from a compressed image, said reconstruction apparatus comprising input means for receiving said compressed image, said input means including dequantizing means for generating a two-dimensional filtered image comprising an array v m from said compressed image; and low-frequency injection filtering means for generating L I m from v m , said low-frequency injection filtering means comprising: means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; means for receiving v m ; and means for generating L I m according to the formula ##EQU6## and k runs over all values for which a m-Sk is not zero.
Claim 5
Dependent Claim
151 words
An image reconstruction apparatus for generating a low-frequency image comprising a two-dimensional pixel array L I m from a compressed image, said reconstruction apparatus comprising input means for receiving said compressed image, said input means including dequantizing means for generating a two-dimensional filtered image comprising an array v m from said compressed image; and low-frequency injection filtering means for generating L I m from v m , said low-frequency injection filtering means comprising: means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; means for receiving v m ; and means for generating L I m according to the formula ##EQU6## and k runs over all values for which a m-Sk is not zero.
Claim 6
Dependent Claim
137 words
The image reconstruction apparatus of claim 3 further comprising high-frequency injection filter means for generating constructing a high frequency image comprising a pixel array H (1) I m from a compressed high-frequency image comprising a high-frequency pixel array 1 w m and for combining said high-frequency image and with said low-frequency image to form a reconstructed image, said high-frequency injection filter means comprising: means for storing set of coefficients { 1 a m }, wherein ##EQU7## and m runs over all values for which 1 a m is non-zero; means for receiving a two dimensional array 1 w m ; means for generating a second data array, H (1) I m , wherein ##EQU8## and means for adding corresponding elements of H (1) I m and L I m to generate the pixels of said reconstructed image.
Claim 7
Dependent Claim
118 words
An image reconstruction filter for generating a reconstructed image comprising a pixel array H (1) I m from a compressed low frequency image comprising a pixel array w m , said image reconstruction filter comprising: means for storing a 2×2 matrix S, wherein M=|det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible coefficients { 1 a m }, wherein ##EQU9## and m runs over all values for which 1 a m is non-zero; and means for receiving w m ; means for generating H (1) I m , wherein ##EQU10## and k runs over those value for which a m-Sk is non-zero.
Claim 8
Dependent Claim
118 words
An image reconstruction filter for generating a reconstructed image comprising a pixel array H (1) I m from a compressed low frequency image comprising a pixel array w m , said image reconstruction filter comprising: means for storing a 2×2 matrix S, wherein M=|det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; means for storing a set of irreducible coefficients { 1 a m }, wherein ##EQU9## and m runs over all values for which 1 a m is non-zero; and means for receiving w m ; means for generating H (1) I m , wherein ##EQU10## and k runs over those value for which a m-Sk is non-zero.
Claim 9
Independent Claim
104 words
A method for operating an apparatus to generate a compressed low-frequency image comprising a pixel array V m from an image represented by a pixel array, I m , said method comprising the steps of: storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having a multiplier M=|det S|; receiving said I m ; and generating V m , wherein ##EQU11## and k runs over all values for which a k is not zero.
Claim 10
Independent Claim
104 words
A method for operating an apparatus to generate a compressed low-frequency image comprising a pixel array V m from an image represented by a pixel array, I m , said method comprising the steps of: storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having a multiplier M=|det S|; receiving said I m ; and generating V m , wherein ##EQU11## and k runs over all values for which a k is not zero.
Claim 11
Dependent Claim
81 words
The method of claim 6 further comprising the step of: generating a high-frequency compressed image represented by a pixel array 1 w m , wherein said high-frequency compressed image generating step comprises the steps of: storing a set of coefficients { 1 a m }, wherein ##EQU12## and m runs over all values for which 1 a m is non-zero; and generating 1 w m , wherein ##EQU13## and k runs over those values for which 1 a* k is non-zero.
Claim 12
Independent Claim
109 words
A method for operating an apparatus to generate a low-frequency image represented by a pixel array L I m from a compressed image comprising a pixel array v m , said method comprising the steps of: storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; receiving said two-dimensional array, v m ; and generating L I m according to the formula ##EQU14## and k runs over all values for which a k is not zero.
Claim 13
Independent Claim
109 words
A method for operating an apparatus to generate a low-frequency image represented by a pixel array L I m from a compressed image comprising a pixel array v m , said method comprising the steps of: storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S|; receiving said two-dimensional array, v m ; and generating L I m according to the formula ##EQU14## and k runs over all values for which a k is not zero.
Claim 14
Dependent Claim
95 words
The method of claim 8 further comprising the steps of: storing set of coefficients { 1 a m }, wherein ##EQU15## and m runs over all values for which 1 a m is non-zero; receiving a compressed high-frequency image represented by a pixel array 1 w m ; generating a second reconstructed high-frequency image represented by a pixel array H (1) I m , wherein ##EQU16## and adding corresponding elements of L I m and H (1) I m to generate a pixel array representing a reconstructed image having both high and low spatial frequencies.
Claim 15
Independent Claim
270 words
An apparatus for generating a low-frequency filtered image comprising a pixel array v m and at least one high-frequency filtered image comprising a pixel array w m from an image comprising a pixel array I m , said apparatus comprising: video memory means for storing at least a portion of I m ; means for receiving the pixels of I m , said receiving means causing said received pixels to be stored in said video memory means; matrix memory means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; coefficient memory means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S| and a set of coefficients { 1 a m }, wherein ##EQU17## and m runs over all values for which 1 a m is non-zero; means for receiving I m ; means for generating v m , wherein low-frequency filter means for generating said low-frequency filtered image, wherein ##EQU18## and k runs over all values for which a k is not zero, said low-frequency filter means being connected to said video memory means; high-frequency filter means for generating said high-frequency filtered image, wherein ##EQU19## and k runs over those values for which 1 a* k is non-zero, said high-frequency filter means being connected to said video memory means; control means, connected to said low-frequency filter means and said high-frequency filter means, for coordinating said low-frequency filter means and said high-frequency filter means so as to avoid conflicts in accessesing said video memory.
Claim 16
Independent Claim
270 words
An apparatus for generating a low-frequency filtered image comprising a pixel array v m and at least one high-frequency filtered image comprising a pixel array w m from an image comprising a pixel array I m , said apparatus comprising: video memory means for storing at least a portion of I m ; means for receiving the pixels of I m , said receiving means causing said received pixels to be stored in said video memory means; matrix memory means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; coefficient memory means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S| and a set of coefficients { 1 a m }, wherein ##EQU17## and m runs over all values for which 1 a m is non-zero; means for receiving I m ; means for generating v m , wherein low-frequency filter means for generating said low-frequency filtered image, wherein ##EQU18## and k runs over all values for which a k is not zero, said low-frequency filter means being connected to said video memory means; high-frequency filter means for generating said high-frequency filtered image, wherein ##EQU19## and k runs over those values for which 1 a* k is non-zero, said high-frequency filter means being connected to said video memory means; control means, connected to said low-frequency filter means and said high-frequency filter means, for coordinating said low-frequency filter means and said high-frequency filter means so as to avoid conflicts in accessesing said video memory.
Claim 17
Independent Claim
315 words
An apparatus for reconstructing an image from a low-frequency filtered image comprising a pixel array v m and at least one high-frequency filtered image comprising a pixel array w m , said reconstructed image comprising a pixel array I m , said apparatus comprising: video memory means for storing at least a portion of v m and w m ; means for receiving the pixels of v m and w m , said receiving means causing said received pixels to be stored in said video memory means; matrix memory means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; coefficient memory means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S| and a set of coefficients { 1 a m }, wherein ##EQU20## and m runs over all values for which 1 a m is non-zero; means for receiving I m ; first reconstruction means for generating a low-frequency reconstructed image comprising a pixel array L I m from said low-frequency filtered image, said first reconstruction means being connected to said video memory means, wherein ##EQU21## and k runs over all values for which a k is not zero; second reconstruction means for generating a high-frequency reconstructed image comprising a pixel array H (1) I m from said high-frequency filtered image, said second reconstructed means being connected to said video memory means, wherein ##EQU22## and k runs over all values for which a k is not zero; means for adding corresponding elements of L I m and H (1) I m to generate I m ; and control means, connected to said first and second reconstruction means for coordinating said low-frequency filter means and said high-frequency filter means so as to avoid conflicts in accessesing said video memory.
Claim 18
Independent Claim
315 words
An apparatus for reconstructing an image from a low-frequency filtered image comprising a pixel array v m and at least one high-frequency filtered image comprising a pixel array w m , said reconstructed image comprising a pixel array I m , said apparatus comprising: video memory means for storing at least a portion of v m and w m ; means for receiving the pixels of v m and w m , said receiving means causing said received pixels to be stored in said video memory means; matrix memory means for storing a 2×2 matrix S, wherein |det S|>1 and S maps any lattice point in a 2-dimensional lattice into another point in said lattice; coefficient memory means for storing a set of irreducible scaling coefficients {a m }, said set of scaling coefficients having multiplier M=|det S| and a set of coefficients { 1 a m }, wherein ##EQU20## and m runs over all values for which 1 a m is non-zero; means for receiving I m ; first reconstruction means for generating a low-frequency reconstructed image comprising a pixel array L I m from said low-frequency filtered image, said first reconstruction means being connected to said video memory means, wherein ##EQU21## and k runs over all values for which a k is not zero; second reconstruction means for generating a high-frequency reconstructed image comprising a pixel array H (1) I m from said high-frequency filtered image, said second reconstructed means being connected to said video memory means, wherein ##EQU22## and k runs over all values for which a k is not zero; means for adding corresponding elements of L I m and H (1) I m to generate I m ; and control means, connected to said first and second reconstruction means for coordinating said low-frequency filter means and said high-frequency filter means so as to avoid conflicts in accessesing said video memory.
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) | 1995-03-31 | 1995-09-30 | 1996-03-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-03-31 | 1999-09-30 | 2000-03-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-03-31 | 2003-09-30 | 2004-03-31 | $7700.00 | Window Closed / Lapsed |