Patent US5109451A successfully refreshed from Google Patents.
US5109451A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Orthogonal transform coding system for image data
Assignee: Sharp Corp
•
Filing: 1991-06-28
•
Granted: 1992-04-28
•
Expires: 2011-06-28
Abstract
Abstract An orthogonal transform coding system for images which orthogonally transforms image data to spatial frequencies and divides the domain of the spatial frequencies into low and high frequency domains using a plurality of domain patterns prepared in advance. This system quantizes and encodes the high and low frequency domains of the orthogonally transformed data by different methods. Coding of the data in the low frequency domain is preformed based on bits which are allocated to those data in accordance with their energies. The data in the high frequency domain are decomposed into bit planes and run-length coding is performed for each bit plane, whereby a small number of bits are allocated to those data in the low frequency domain in the coding and an efficient coding of images is accomplished.
Inventors
- 👤 Tomoko Aono
- 👤 Masao Izumi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 21:00
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/90; H04N19/94; H04N19/10; H04N19/134; H04N19/136; H04N19/14; H04N19/169; H04N19/184; H04N19/30; H04N19/37; H04N19/60
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
248 words
A method for orthogonal transform coding image data, comprising the steps of: (a) orthogonally transforming image data from space coordinates to spatial frequencies; (b) preparing a plurality of domain patterns each having low and high frequency domains therein; (c) dividing a spatial frequency domain of orthogonally transformed image data into a low frequency domain and a high frequency domain according to a threshold; (d) summing absolute values of the orthogonally transformed data belonging to the low frequency domain of each domain pattern; (e) specifying the low frequency domain of a domain pattern in which the sum of the absolute values is the largest as a low frequency domain of the orthogonally transformed image data and specifying a remaining part of the same domain pattern as a high frequency domain of the orthogonally transformed image data; (f) encoding the orthogonally transformed data in the low frequency domain by dividing the low frequency domain into a plurality of blocks and calculating respective mean values of the orthogonally transformed data in the blocks so as to allocate a large number of bits to a block which has a mean value larger than a specified value and a small number of bits to a block which has a mean value smaller than the specified value; and (g) encoding the orthogonally transformed data in the high frequency domain in a manner different from the encoding of said step (f) so as to allocate a small number of bits to the high frequency domain.
Claim 2
Independent Claim
248 words
A method for orthogonal transform coding image data, comprising the steps of: (a) orthogonally transforming image data from space coordinates to spatial frequencies; (b) preparing a plurality of domain patterns each having low and high frequency domains therein; (c) dividing a spatial frequency domain of orthogonally transformed image data into a low frequency domain and a high frequency domain according to a threshold; (d) summing absolute values of the orthogonally transformed data belonging to the low frequency domain of each domain pattern; (e) specifying the low frequency domain of a domain pattern in which the sum of the absolute values is the largest as a low frequency domain of the orthogonally transformed image data and specifying a remaining part of the same domain pattern as a high frequency domain of the orthogonally transformed image data; (f) encoding the orthogonally transformed data in the low frequency domain by dividing the low frequency domain into a plurality of blocks and calculating respective mean values of the orthogonally transformed data in the blocks so as to allocate a large number of bits to a block which has a mean value larger than a specified value and a small number of bits to a block which has a mean value smaller than the specified value; and (g) encoding the orthogonally transformed data in the high frequency domain in a manner different from the encoding of said step (f) so as to allocate a small number of bits to the high frequency domain.
Claim 3
Dependent Claim
36 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (g) comprises the steps of; (h) decomposing the transformed data into bit planes; and (i) performing run length coding for each bit plane.
Claim 4
Dependent Claim
104 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (g) comprises the steps of: (h) dividing the high frequency domain into a plurality of blocks; and (i) comparing data patterns of the orthogonally transformed data in the respective blocks with a limited number of representative data patterns that are stored in a memory so as to select representative patterns which are closest to the respective data patterns of the orthogonally transformed image data with respect to each of the blocks so as to encode the high frequency domain of the orthogonally transformed data according to indexes representing selected representative patterns.
Claim 5
Dependent Claim
23 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (a) uses a discrete cosine transform as the orthogonal transform.
Claim 6
Dependent Claim
22 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (a) uses a Fourier transform as the orthogonal transform.
Claim 7
Dependent Claim
22 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (a) uses a Hadamard transform as the orthogonal transform.
Claim 8
Dependent Claim
22 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (a) uses a Haar transform as the orthogonal transform.
Claim 9
Dependent Claim
22 words
The orthogonal transform coding method as claimed in claim 1, wherein said step (a) uses a Karkunen-Loeve transform as the orthogonal transform.
Claim 10
Independent Claim
295 words
A system for orthogonal transform coding image data comprising: transform means for orthogonally transforming image data from space coordinates to spatial frequencies; pattern means, operatively connected to said transform means, for preparing a plurality of domain patterns each having low and high frequency domains therein and for dividing a spatial frequency domain of orthogonally transformed image data into a low frequency domain and a high frequency domain according to a threshold; summing means, operatively connected to said transform means, for summing absolute values of the orthogonally transformed data belonging to said low frequency domain of each domain pattern; frequency selecting means, operatively connected to said summing areas, for specifying the low frequency domain of a domain pattern in which the sum of the absolute values is the largest as a low frequency domain of the orthogonally transformed image data and for specifying a remaining part of the same domain pattern as a high frequency domain of the orthogonally transformed image data; first encoding means, operatively connected to said frequency selecting means, for encoding the orthogonally transformed data in said low frequency domain; said first encoding means dividing said low frequency domain into a plurality of blocks and calculating respective mean values of the orthogonally transformed data in said blocks so as to allocate a large number of bits to a block which has a mean value larger than a specified value and a small number of bits to a block which has a mean value smaller than said specified value; and second encoding means, operatively connected to said frequency selecting means, for encoding the orthogonally transformed data in said high frequency domain in a manner different from said first encoding means so as to allocate a small number of bits to said high frequency domain.
Claim 11
Independent Claim
295 words
A system for orthogonal transform coding image data comprising: transform means for orthogonally transforming image data from space coordinates to spatial frequencies; pattern means, operatively connected to said transform means, for preparing a plurality of domain patterns each having low and high frequency domains therein and for dividing a spatial frequency domain of orthogonally transformed image data into a low frequency domain and a high frequency domain according to a threshold; summing means, operatively connected to said transform means, for summing absolute values of the orthogonally transformed data belonging to said low frequency domain of each domain pattern; frequency selecting means, operatively connected to said summing areas, for specifying the low frequency domain of a domain pattern in which the sum of the absolute values is the largest as a low frequency domain of the orthogonally transformed image data and for specifying a remaining part of the same domain pattern as a high frequency domain of the orthogonally transformed image data; first encoding means, operatively connected to said frequency selecting means, for encoding the orthogonally transformed data in said low frequency domain; said first encoding means dividing said low frequency domain into a plurality of blocks and calculating respective mean values of the orthogonally transformed data in said blocks so as to allocate a large number of bits to a block which has a mean value larger than a specified value and a small number of bits to a block which has a mean value smaller than said specified value; and second encoding means, operatively connected to said frequency selecting means, for encoding the orthogonally transformed data in said high frequency domain in a manner different from said first encoding means so as to allocate a small number of bits to said high frequency domain.
Claim 12
Dependent Claim
31 words
The orthogonal transform coding system as claimed in claim 9, wherein said second encoding means decomposes the transformed data into bit planes and performs run length coding for each bit plane.
Claim 13
Dependent Claim
99 words
The orthogonal transform coding system as claimed in claim 9, wherein said second encoding means divides said high frequency domain into a plurality of blocks and compares data patterns of the orthogonally transformed data in the respective blocks with a limited number of representative data patterns that are stored in a memory so as to select representative patterns which are closest to the respective data patterns of the orthogonally transformed image data with respect to each of said blocks so as to encode said high frequency domain of the orthogonally transformed data according to indexes representing selected representative patterns.
Claim 14
Dependent Claim
23 words
The orthogonal transform coding system as claimed in claim 9, wherein said transform means uses a discrete cosine transform as the orthogonal transform.
Claim 15
Dependent Claim
22 words
The orthogonal transform coding system as claimed in claim 9, wherein said transform means uses a Fourier transform as the orthogonal transform.
Claim 16
Dependent Claim
22 words
The orthogonal transform coding system as claimed in claim 9, wherein said transform means uses a Hadamard transform as the orthogonal transform.
Claim 17
Dependent Claim
22 words
The orthogonal transform coding system as claimed in claim 9, wherein said transform means uses a Haar transform as the orthogonal transform.
Claim 18
Dependent Claim
22 words
The orthogonal transform coding system as claimed in claim 9, wherein said transform means uses a Karhunen-Loeve transform as the orthogonal transform.
References Cited (Backward Citations)
US4048443A
Cited
US4189748A
Cited
US4179709A
Cited
US4184049A
Cited
US4375650A
Cited
US4504860A
Cited
US4707738A
Cited
US4805030A
Cited
US4807042A
Cited
US4734767A
Cited
US4841012A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-04-28 | 1995-10-28 | 1996-04-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-04-28 | 1999-10-28 | 2000-04-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-04-28 | 2003-10-28 | 2004-04-28 | $7700.00 | Window Closed / Lapsed |