US5148498A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Image coding apparatus and method utilizing separable transformations
Assignee: Aware Inc
•
Filing: 1990-08-01
•
Granted: 1992-09-15
•
Expires: 2010-08-01
Abstract
Abstract An image coding apparatus and method are disclosed. The method and apparatus are applicable to coding any array of arbitrary dimension. The apparatus utilizes FIR filters which generate three or more sets of coefficients from linear arrays generated from the array being coded. Each set of coefficients represents spatial frequency information of different frequencies. The filters utilize coefficient sets which are preferrably orthogonal.
Inventors
- 👤 Howard L. Resnikoff
- 👤 David Pollen
- 👤 David C. P. Linden
- 👤 Wayne M. Lawton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 08:08
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; H04N19/63; H04N19/635; H03; H03H; H03H17/00; H03H17/02; H03H17/0202
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
239 words
An apparatus for compressing an image comprising a two-dimensional array of pixel intensity values, said apparatus comprising: image storage means comprising means for storing said array of pixel intensity values as a plurality of rows and columns; linear filtering means for filtering a one-dimensional sequence of digital values to generate a low-frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said linear filtering means comprising means for convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU1## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the filter coefficient 0 a p ; row processing means for causing said linear filtering means to process each said row in said image storage means to generate a low-frequency row array comprising a two-dimensional array of digital values organized as a plutality of rows and columns and a plurality of high-frequency rows arrays, each said high-frequency row array comprising a two-dimensional array of digital values organized as a plurality of rows and columns; and column processing means for causing said linear filtering means to process each said column in said low-frequency row array to generate a low-frequency column array representing the low spatial frequency information in said image.
Claim 2
Independent Claim
239 words
An apparatus for compressing an image comprising a two-dimensional array of pixel intensity values, said apparatus comprising: image storage means comprising means for storing said array of pixel intensity values as a plurality of rows and columns; linear filtering means for filtering a one-dimensional sequence of digital values to generate a low-frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said linear filtering means comprising means for convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU1## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the filter coefficient 0 a p ; row processing means for causing said linear filtering means to process each said row in said image storage means to generate a low-frequency row array comprising a two-dimensional array of digital values organized as a plutality of rows and columns and a plurality of high-frequency rows arrays, each said high-frequency row array comprising a two-dimensional array of digital values organized as a plurality of rows and columns; and column processing means for causing said linear filtering means to process each said column in said low-frequency row array to generate a low-frequency column array representing the low spatial frequency information in said image.
Claim 3
Dependent Claim
44 words
The apparatus of claim 1 wherein said column processing means further comprises means for causing said linear filtering means to process each said column in said high-frequency row arrays to generate a high-frequency column array representing the high spatial frequency information in said image.
Claim 4
Dependent Claim
25 words
The apparatus of claim 1 wherein said filter coefficients further satisfy the condition ##EQU2## wherein q is any positive integer and (*) denotes complex conjugation.
Claim 5
Dependent Claim
34 words
The apparatus of claim 1 wherein said filter coefficients further satisfy the condition ##EQU3## wherein said condition is satisfied for all i >0 and any positive integer value q less than some predetermined value.
Claim 6
Independent Claim
197 words
The apparatus for synthesizing an image comprising a two-dimensional array of pixel intensity values organized as a plurality of rows and columns from M two-dimensional sets of image coefficients, each said set of image coefficients being organized as a plurality of rows and columns, wherein M is greater than two, said apparatus comprising: coefficient storage means comprising means for storing said two-dimensional sets of image coefficients; linear synthesizing means for combining M one-dimensional input sequences of digital values to generates an output numerical sequence, wherein each of said one-dimensional sequences may be obtained by filtering said output numerical sequence through a finite impulse response filter having a set of filter coefficients i a p corresponding to each said input sequence, wherein ##EQU4## for i from 0 to M-1; column processing means for causing said linear synthesizing means to combine corresponding columns of said sets of image coefficients to generate M column arrays, each said column array comprising a two-dimensional array of numerical values organized as a plurality of rows and columns; and row processing means for causing said linear synthesizing means to combine corresponding rows of said column arrays to generate a row of said reconstructed image.
Claim 7
Independent Claim
197 words
The apparatus for synthesizing an image comprising a two-dimensional array of pixel intensity values organized as a plurality of rows and columns from M two-dimensional sets of image coefficients, each said set of image coefficients being organized as a plurality of rows and columns, wherein M is greater than two, said apparatus comprising: coefficient storage means comprising means for storing said two-dimensional sets of image coefficients; linear synthesizing means for combining M one-dimensional input sequences of digital values to generates an output numerical sequence, wherein each of said one-dimensional sequences may be obtained by filtering said output numerical sequence through a finite impulse response filter having a set of filter coefficients i a p corresponding to each said input sequence, wherein ##EQU4## for i from 0 to M-1; column processing means for causing said linear synthesizing means to combine corresponding columns of said sets of image coefficients to generate M column arrays, each said column array comprising a two-dimensional array of numerical values organized as a plurality of rows and columns; and row processing means for causing said linear synthesizing means to combine corresponding rows of said column arrays to generate a row of said reconstructed image.
Claim 8
Dependent Claim
25 words
The apparatus of claim 5, wherein said filter coefficients further satisfy the condition ##EQU5## wherein q is any positive integer and (*) denotes complex conjugation.
Claim 9
Dependent Claim
33 words
The apparatus of claim 5 wherein said filter coefficients further satisfy the condition ##EQU6## wherein said condition is satisfied for all i>0 and any positive integer value q less than some predetermined value.
Claim 10
Dependent Claim
328 words
In an apparatus including a linear filter for filtering a one-dimensional sequence of digital values to generate a low frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said linear filter comprising means for convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU7## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the sequence 0 a p , a method for compressing an image comprising a two-dimensional array of pixel intensity values, said method comprising the step of: storing said array of pixel intensity values as a plurality of rows and columns; filtering a one-dimensional sequence of digital values to generate a low-frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said filtering step comprising convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU8## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the sequence 0 a p ; causing said linear filter to process each said row in said image storage means to generate a low-frequency row array comprising a two-dimensional array of digital values comprising a two-dimensional array of digital values organized as a plurality of rows and columns and a plurality of high-frequency row arrays, each said high-frequency row array comprising a two-dimensional array of digital values organized as a plurality of rows and columns; and causing said linear filter to process each said column in said low-frequency row array to generate a low-frequency column array representing the low spatial frequency information in said image.
Claim 11
Dependent Claim
328 words
In an apparatus including a linear filter for filtering a one-dimensional sequence of digital values to generate a low frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said linear filter comprising means for convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU7## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the sequence 0 a p , a method for compressing an image comprising a two-dimensional array of pixel intensity values, said method comprising the step of: storing said array of pixel intensity values as a plurality of rows and columns; filtering a one-dimensional sequence of digital values to generate a low-frequency array representing the low-frequency components of said one-dimensional sequence and two or more high-frequency arrays representing high-frequency components of said one-dimensional sequence, said filtering step comprising convolving said one-dimensional signal with three or more sequences of filter coefficients i a p wherein ##EQU8## M is an integer greater than 2, i runs from 0 to the total number of high-frequency arrays so generated, and said low-frequency array is generated by convolving said one-dimensional sequence with the sequence 0 a p ; causing said linear filter to process each said row in said image storage means to generate a low-frequency row array comprising a two-dimensional array of digital values comprising a two-dimensional array of digital values organized as a plurality of rows and columns and a plurality of high-frequency row arrays, each said high-frequency row array comprising a two-dimensional array of digital values organized as a plurality of rows and columns; and causing said linear filter to process each said column in said low-frequency row array to generate a low-frequency column array representing the low spatial frequency information in said image.
Claim 12
Dependent Claim
40 words
The method of claim 8 further comprising the step of causing said linear filter to process each said column in said high-frequency row arrays to generate a high-frequency column of arrays representing the high spatial frequency information in said image.
Claim 13
Dependent Claim
25 words
The method of claim 8 wherein said filter coefficients further satisfy the condition ##EQU9## wherein q is any positive integer and (*) denotes complex conjugation.
Claim 14
Dependent Claim
33 words
The method of claim 8 wherein said filter coefficients further satisfy the condition ##EQU10## wherein said condition is satisfied for all i>0 and any positive integer value q less than some predetermined value.
Claim 15
Dependent Claim
188 words
In an apparatus including a linear synthesizing means for combining M one-dimensional input sequences of digital values to generate an output numerical sequence, wherein each of said one-dimensional sequences may be obtained by filtering said output numerical sequence through a finite impulse response filter having a set of filter coefficients i a p corresponding to each said input sequence, wherein ##EQU11## for i from 0 to M-1, a method for synthesizing an image comprising a two-dimensional array of pixel intensity values organized as a plurality of rows and columns from M two-dimensional sets of image coefficients, each said set of image coefficients being organized as a plurality of rows and columns, wherein M is greater than two, said method comprising: storing said two-dimensional sets of image coefficients; causing said linear synthesizing means to combine corresponding columns of said sets of image coefficients to generate M column arrays, each said column array comprising a two-dimensional array of numerical values organized as a plurality of rows and columns; and causing said linear synthesizing means to combine corresponding rows of said column arrays to generate a row of said reconstructed image.
Claim 16
Dependent Claim
188 words
In an apparatus including a linear synthesizing means for combining M one-dimensional input sequences of digital values to generate an output numerical sequence, wherein each of said one-dimensional sequences may be obtained by filtering said output numerical sequence through a finite impulse response filter having a set of filter coefficients i a p corresponding to each said input sequence, wherein ##EQU11## for i from 0 to M-1, a method for synthesizing an image comprising a two-dimensional array of pixel intensity values organized as a plurality of rows and columns from M two-dimensional sets of image coefficients, each said set of image coefficients being organized as a plurality of rows and columns, wherein M is greater than two, said method comprising: storing said two-dimensional sets of image coefficients; causing said linear synthesizing means to combine corresponding columns of said sets of image coefficients to generate M column arrays, each said column array comprising a two-dimensional array of numerical values organized as a plurality of rows and columns; and causing said linear synthesizing means to combine corresponding rows of said column arrays to generate a row of said reconstructed image.
Claim 17
Dependent Claim
25 words
The method of claim 12 wherein said filter coefficients further satisfy the condition ##EQU12## wherein q is any positive integer and (*) denotes complex conjugation.
Claim 18
Dependent Claim
33 words
The method of claim 12 wherein said filter coefficients further satisfy the condition ##EQU13## wherein said condition is satisfied for all i>0 and any positive integer value q less than some predetermined value.
References Cited (Backward Citations)
US4328426A
Cited
US4817180A
Cited
US4805226A
Cited
US4821223A
Cited
US4817182A
Cited
US4829378A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-09-15 | 1996-03-16 | 1996-09-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-09-15 | 2000-03-16 | 2000-09-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-09-15 | 2004-03-16 | 2004-09-15 | $7700.00 | Window Closed / Lapsed |