Patent US3638934A successfully refreshed from Google Patents.
Patent US5091977A successfully refreshed from Google Patents.
US5091977A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Image data compression method using a run prediction technique
Assignee: Sharp Corp
•
Filing: 1990-12-19
•
Granted: 1992-02-25
•
Expires: 2010-12-19
Abstract
Abstract In an image data compression method to be employed in coding digital image data whose pixels are represented by n bits and which include 2 n different types of runs, while a run length of a current run is counted, a value representing a run type of the current run is predicted. The prediction is repeated till a predicted value coincides with an actual value of the run type of the current run. When a predicted value does not coincide with the actual value of the run type of the current run, a run length for an imaginary run having the predicted value is regarded as zero and the run length 0 of the imaginary run is entropy coded. On the other hand, when a predicted value coincides with an actual value, the actual run length of the current run is entropy coded.
Inventors
- 👤 Hiroyuki Katata
- 👤 Yoji Noguchi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 08:07
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/90; H04N19/93; G; G06; G06T; G06T9/00; G06T9/005
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
160 words
A machine implemented image data compression method comprising the steps of: (a) inputting digital image data whose pixels are represented by n bits (where n<1) and which include 2 n different types of runs; (b) counting a run length of a current run of the digital image data (c) predicting a value representing a run type of the current run wherein said prediction is repeated until a predicted value is equal to an actual value of the run type of said current run; (d) setting a run length for an imaginary run having the predicted value to zero and entropy coding the run length of the imaginary run when the predicted value is not equal to the actual value of the run type of said current run; (e) entropy coding the actual run length of the current run when the predicted value is equal to with the actual value to produce compressed image data. (f) outputting the compressed image data.
Claim 2
Dependent Claim
160 words
A machine implemented image data compression method comprising the steps of: (a) inputting digital image data whose pixels are represented by n bits (where n<1) and which include 2 n different types of runs; (b) counting a run length of a current run of the digital image data (c) predicting a value representing a run type of the current run wherein said prediction is repeated until a predicted value is equal to an actual value of the run type of said current run; (d) setting a run length for an imaginary run having the predicted value to zero and entropy coding the run length of the imaginary run when the predicted value is not equal to the actual value of the run type of said current run; (e) entropy coding the actual run length of the current run when the predicted value is equal to with the actual value to produce compressed image data. (f) outputting the compressed image data.
Claim 3
Dependent Claim
57 words
The method of claim 1, wherein a run type of a headmost run in each line of the digital image data is obtained without being predicted and further comprising the step of: (g) adding n-bit data representing the run type of each headmost run to entropy coded run length data for each run following the headmost run.
Claim 4
Dependent Claim
24 words
The method of claim 2, wherein said predicted values are chosen in a predetermined order depending on a run type of each headmost run.
Claim 5
Dependent Claim
49 words
The method of claim 3, wherein step (c), if two or more predictions are made for a current run, an identical predicted value is not obtained and a value representing an actual type of an immediately previous run is not used as a predicted value for said current run.
Claim 6
Dependent Claim
57 words
The method of claim 3, wherein the digital image data is two-bit image data, and the predetermined order for the predicted values is 1, 2, 3, 2, 1, 0, and an initial predicted value for runs in each line of the image data is chosen based on a run type of a headmost run of each line.
Claim 7
Dependent Claim
26 words
The method of claim 1, wherein predicted values for a current run are prioritized based on a preceding run and a run before the preceding run.
Claim 8
Dependent Claim
30 words
The method of claim 6, wherein a predetermined number of values which are closest to a value representing a run type of a preceding run are selected as predicted values.
Claim 9
Dependent Claim
157 words
An image data compression apparatus comprising: input means for inputting digital image data whose pixels are represented by n-bits (where n<1) and which include 2 n in types of runs; counting means for counting a run length of the current run of the digital image data; predicting means for predicting a value representing a run type of a current run wherein said prediction is repeated until a predicted value is equal to an actual value of the run type of said current run; setting means for setting a run length for an imaginary run having the predicted value to zero, and entropy coding the run length of the imaginary run when the predicted value is not equal to the actual value of the run type of said current run; entropy coding means for entropy coding the actual run length of the current run to produce compressed image data; and output means for outputting the compressed image data.
Claim 10
Dependent Claim
157 words
An image data compression apparatus comprising: input means for inputting digital image data whose pixels are represented by n-bits (where n<1) and which include 2 n in types of runs; counting means for counting a run length of the current run of the digital image data; predicting means for predicting a value representing a run type of a current run wherein said prediction is repeated until a predicted value is equal to an actual value of the run type of said current run; setting means for setting a run length for an imaginary run having the predicted value to zero, and entropy coding the run length of the imaginary run when the predicted value is not equal to the actual value of the run type of said current run; entropy coding means for entropy coding the actual run length of the current run to produce compressed image data; and output means for outputting the compressed image data.
Claim 11
Dependent Claim
57 words
The apparatus of claim 8, wherein a run type of a headmost run in each line of the digital image data is obtained without being predicted and further comprising: adding means for adding n-bit data representing the run type of each headmost run to entropy coded run length data for each run for following the headmost run.
Claim 12
Dependent Claim
24 words
The apparatus of claim 9, wherein said predicted values are chosen in a predetermine order depending on a run type of each headmost run.
Claim 13
Dependent Claim
50 words
The apparatus of claim 10, wherein said predicting means, if two or more predictions are made for a current run, an identical predicted value is not obtained and a value representing an actual type of an immediately previous run is not used as a predicted value for said current run.
Claim 14
Dependent Claim
57 words
The apparatus of claim 10, wherein the digital image data is two-bit image data and the predetermined order for the predicted values is 1, 2, 3, 2, 1, 0, and an initial predicted value for runs in each line of the image data is chosen based on a run type of a headmost run of each line.
Claim 15
Dependent Claim
26 words
The apparatus of claim 8, wherein predicted values for a current run are prioritized based on a preceding run and a run before the preceding run.
Claim 16
Dependent Claim
30 words
The apparatus of claim 13, wherein a predetermined number of values which are closest to a value representing a run type of a preceding run are selected as predicted values.
References Cited (Backward Citations)
US4097903A
Cited
US4344086A
Cited
US4454546A
Cited
US4360840A
Cited
US4701803A
Cited
US4725885A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-02-24 | 1995-08-26 | 1996-02-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-02-24 | 1999-08-26 | 2000-02-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-02-24 | 2003-08-26 | 2004-02-25 | $7700.00 | Window Closed / Lapsed |