US5802209A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for compressing and restoring binary image having multitone
Assignee: Seiko Epson Corp
•
Filing: 1996-06-26
•
Granted: 1998-09-01
•
Expires: 2016-06-26
Abstract
Abstract When an N-times density binary image having N+1 tones is compressed, only the tone of each pixel is converted into a compressed code. The compressed code has a number of bits necessary and sufficient to distinguish between the tones. When a triple-density image having 4 tones is compressed, for example, the tone of each pixel is converted into a 2-bit compressed code. When the original N-times density is restored from the compressed code, there is formed a dot pattern in which the number of dots corresponding to the tone, as represented by the compressed code of each pixel, are situated closer to the darker one of the two adjoining pixels.
Inventors
- 👤 Toshiyuki Hattori
- 👤 Ryuji Oomoto
- 👤 Kiyoaki Murai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:39
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/405; H04N1/4055; H04N1/4056; H04N1/41; H04N1/4105
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
139 words
An apparatus for restoring a compressed multitone image, said apparatus comprising: compressed code generating means for generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones; and dot pattern generating means for generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels; wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 2
Independent Claim
139 words
An apparatus for restoring a compressed multitone image, said apparatus comprising: compressed code generating means for generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones; and dot pattern generating means for generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels; wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 3
Dependent Claim
21 words
An apparatus as claimed in claim 1, wherein the depth M of said compressed code satisfies the following relationship: (N+1)≦2.sup.M ≦2N.
Claim 4
Dependent Claim
133 words
A computer system comprising: a host computer having a printer driver for generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones, and a printer for generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels, wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 5
Dependent Claim
133 words
A computer system comprising: a host computer having a printer driver for generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones, and a printer for generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels, wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 6
Independent Claim
132 words
A method of restoring a compressed multitone image, said method comprising the steps of: generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones, and generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels, wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 7
Independent Claim
132 words
A method of restoring a compressed multitone image, said method comprising the steps of: generating a compressed code representing a tone of each pixel in an image having N+1 tones, said compressed code having a depth of M bits, said M bits being capable of distinguishing among said N+1 tones, and generating a dot pattern having N dot areas, each representing one out of a dot and a blank space on receiving a compressed code of each pixel and compressed codes of both-side adjoining pixels, the number of dot areas indicative of said dot corresponding to the compressed codes of the respective pixels, wherein the dot area indicative of said dot in said dot pattern is situated close to an adjoining pixel having a darker tone out of said both-side adjoining pixels.
Claim 8
Independent Claim
141 words
A method of processing image data pertaining to pixels of a multitone binary image, each of said pixels having N dot areas, said pixels including a current pixel and adjoining pixels, said method comprising the steps of: defining, for said pixels, only N+1 tone values; determining, for said current pixel, a corresponding one of said tone values; providing, for said current pixel, an M-bit compressed code corresponding to said determined tone value; defining, for said pixels, 2N dot patterns, each of which corresponds to only one of said N+1 tone values, and each of which has N dot areas, wherein each of said dot areas of said dot patterns is one of a dot and a blank space; and selecting, for said current pixel, one of said dot patterns on the basis of said determined tone value of said current pixel.
Claim 9
Independent Claim
141 words
A method of processing image data pertaining to pixels of a multitone binary image, each of said pixels having N dot areas, said pixels including a current pixel and adjoining pixels, said method comprising the steps of: defining, for said pixels, only N+1 tone values; determining, for said current pixel, a corresponding one of said tone values; providing, for said current pixel, an M-bit compressed code corresponding to said determined tone value; defining, for said pixels, 2N dot patterns, each of which corresponds to only one of said N+1 tone values, and each of which has N dot areas, wherein each of said dot areas of said dot patterns is one of a dot and a blank space; and selecting, for said current pixel, one of said dot patterns on the basis of said determined tone value of said current pixel.
Claim 10
Dependent Claim
109 words
The method as set forth in claim 5, further comprising the step of performing said determining step and said providing step for said adjoining pixels to provide, for each of said adjoining pixels, a respective determined tone value; wherein one of said N+1 tone values is an intermediate tone having said defined dot pattern such that said dot areas thereof include at least one said dot and at least one said blank space; wherein when said determined tone value of said current pixel corresponds to said intermediate tone, the selection in said selecting step is further based on said respective determined tone value of each of said adjoining pixels.
Claim 11
Dependent Claim
25 words
The method as set forth in claim 6, wherein 2 M is not less than N+1, and wherein 2 M is not greater than 2N.
Claim 12
Dependent Claim
48 words
The method as set forth in claim 7, wherein when said determined tone value of said current pixel corresponds to said intermediate tone, said selected dot pattern has said at least one dot situated closer to one of said adjoining pixels having a darkest respective determined tone value.
References Cited (Backward Citations)
US4084259A
Cited
US4084196A
Cited
US4150400A
Cited
WO1981002206A1
Cited
EP0109005A1
Cited
US4596993A
Cited
US4926251A
Cited
US4916545A
Cited
US5535013A
Cited
WO1995033330A1
Cited
US5625755A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-31 | 2002-03-02 | 2002-09-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-31 | 2006-03-02 | 2006-09-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-31 | 2010-03-02 | 2010-09-01 | $7700.00 | Window Closed / Lapsed |