US5177622A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for detecting run length of two successive pixels and subjecting run length to universal coding
Assignee: Fujitsu Ltd
•
Filing: 1990-07-27
•
Granted: 1993-01-05
•
Expires: 2010-07-27
Abstract
Abstract A halftone image data compression apparatus includes a first part for detecting a continuous state of pattern data of two successive pixels on a line of a halftone image for N adjacent lines of the halftone image. A second part is coupled to the first part for detecting a run length of the continuous state detected in the first part along a direction of the lines, and a third part is coupled to the first and second parts for subjecting to a universal coding a time-sequential data which is in predetermined processing units. Each predetermined processing unit is made up of one run length which is detected by the second part and corresponding pattern data which are received from the first part while the continuous state is detected for the one run length.
Inventors
- 👤 Shigeru Yoshida
- 👤 Yasuhiko Nakano
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:59
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H04; H04N; H04N1/00; H04N1/41; H04N1/4105
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
140 words
A halftone image data compression apparatus for processing a halftone image, comprising: first means for detecting a continuous state of pattern data of two successive pixels on a line of a halftone image for N adjacent lines of the halftone image, where N is an integer; second means, coupled to said first means, for detecting run lengths of the continuous state detected in said first means along a direction of the lines; and third means, coupled to said first and second means, for subjecting to a universal coding time-sequential data which is in predetermined processing units, each of the predetermined processing units being made up of one of the run lengths which is detected by said second means and corresponding pattern data which are received from said first means while the continuous state is detected for said one run length.
Claim 2
Dependent Claim
140 words
A halftone image data compression apparatus for processing a halftone image, comprising: first means for detecting a continuous state of pattern data of two successive pixels on a line of a halftone image for N adjacent lines of the halftone image, where N is an integer; second means, coupled to said first means, for detecting run lengths of the continuous state detected in said first means along a direction of the lines; and third means, coupled to said first and second means, for subjecting to a universal coding time-sequential data which is in predetermined processing units, each of the predetermined processing units being made up of one of the run lengths which is detected by said second means and corresponding pattern data which are received from said first means while the continuous state is detected for said one run length.
Claim 3
Dependent Claim
154 words
The halftone image data compression apparatus as claimed in claim 1, wherein said first means includes: halftone image input means for storing pattern data of the halftone image; image data storage means, coupled to said halftone image input means, for successively reading the pattern data from said halftone image input means and storing the pattern data of pixels located at a corresponding position on each of N lines of the halftone image; and continuous state detecting means, coupled to said image data storage means, for detecting the continuous state when the pattern data stored in said image data storage means during an arbitrary storage cycle match the pattern data read from said halftone image input means and stored in said image data storage means during a storage cycle immediately subsequent to said arbitrary storage cycle, said continuous state detecting means outputting a detection signal indicative of whether or not the continuous state is detected.
Claim 4
Dependent Claim
48 words
The halftone image data compression apparatus as claimed in claim 2, wherein said image data storage means includes N registers, and wherein each of said N registers stores the pattern data of one of the pixels on a corresponding one of N lines of the halftone image data.
Claim 5
Dependent Claim
100 words
The halftone image data compression apparatus as claimed in claim 2, wherein said continuous state detecting means includes: N exclusive-OR circuits; and an OR circuit, coupled to said N exclusive-OR circuits, supplied with outputs of said N exclusive-OR circuits, each of said N exclusive-OR circuits being supplied with the pattern data stored in said image data storage means during said arbitrary storage cycle and the pattern data read from said halftone image input means and stored in said image data storage means during said storage cycle immediately subsequent to said arbitrary storage cycle, said OR circuit outputting said detection signal.
Claim 6
Dependent Claim
41 words
The halftone image data compression apparatus as claimed in claim 2, wherein said second means includes a counter for counting a number of times the output detection signal of said continuous state detecting means indicates the detection of the continuous state.
Claim 7
Dependent Claim
35 words
The halftone image data compression apparatus as claimed in claim 5, wherein said counter is cleared in response to the output detection signal of said continuous state detecting means indicating non-detection of the continuous state.
Claim 8
Dependent Claim
38 words
The halftone image data compression apparatus as claimed in claim 2, wherein said third means codes the time-sequential data in response to the output detection signal of said continuous state detecting means indicating non-detection of the continuous state.
Claim 9
Dependent Claim
62 words
The halftone image data compression apparatus as claimed in claim 1, wherein said third means includes universal coding means for coding the time-sequential data in conformance with a universal coding algorithm selected from a group consisting essentially of a Ziv-Lempel universal algorithm, a Ziv-Lempel incremental parsing algorithm, an LZSS coding Ziv-Lempel algorithm and an LZW coding modified version of the Ziv-Lempel algorithm.
Claim 10
Dependent Claim
36 words
The halftone image data compression apparatus as claimed in claim 1, wherein said third means includes universal coding means for coding the time-sequential data in conformance with an LZW coding modified version of a Ziv-Lempel algorithm.
Claim 11
Independent Claim
119 words
A method of compressing halftone image data comprising the steps of: (a) detecting a continuous state of pattern data of two successive pixels on a line of a halftone image for N adjacent lines of the halftone image, where N is an integer; (b) detecting a run length of the continuous state which is detected in said step (a) along a direction of the lines; and (c) subjecting to a universal coding a time-sequential data which is in predetermined processing units, each of said predetermined processing units being made up of one run length which is detected in said step (b) and corresponding pattern data which are received while the continuous state is detected for said one run length.
Claim 12
Independent Claim
119 words
A method of compressing halftone image data comprising the steps of: (a) detecting a continuous state of pattern data of two successive pixels on a line of a halftone image for N adjacent lines of the halftone image, where N is an integer; (b) detecting a run length of the continuous state which is detected in said step (a) along a direction of the lines; and (c) subjecting to a universal coding a time-sequential data which is in predetermined processing units, each of said predetermined processing units being made up of one run length which is detected in said step (b) and corresponding pattern data which are received while the continuous state is detected for said one run length.
Claim 13
Dependent Claim
112 words
The method of compressing halftone image data as claimed in claim 10, wherein said step (a) includes substeps of: (a1) storing pattern data of the halftone image; (a2) successively reading the stored pattern data of the halftone image and storing the pattern data of pixels located at the same position on each of N lines of the halftone image; and (a3) detecting the continuous state when the pattern data stored during an arbitrary storage cycle match the pattern data read and stored during a storage cycle immediately subsequent to the arbitrary storage cycle, said detecting subset (a3) including outputting a detection signal indicative of whether or not the continuous state is detected.
Claim 14
Dependent Claim
38 words
The method of compressing halftone image data as claimed in claim 11, wherein said step (b) includes counting a number of times the detection signal output by said detecting substep (a3) indicates the detection of the continuous state.
Claim 15
Dependent Claim
33 words
The method of compressing halftone image data as claimed in claim 12, further comprising a step of clearing a counted value in response to the detection signal indicating non-detection of the continuous state.
Claim 16
Dependent Claim
33 words
The method of compressing halftone image data as claimed in claim 11, wherein said step (c) includes coding the time-sequential data in response to the detection signal indicating non-detection of the continuous state.
Claim 17
Dependent Claim
59 words
The method of compressing halftone image data as claimed in claim 10, wherein said step (c) includes coding the time-sequential data in conformance with a universal coding algorithm selected from a group consisting essentially of a Ziv-Lempel universal algorithm, a Ziv-Lempel incremental parsing algorithm, an LZSS coding Ziv-Lempel algorithm and an LZW coding modified version of the Ziv-Lempel algorithm.
Claim 18
Dependent Claim
33 words
The method of compressing halftone image data as claimed in claim 10, wherein said step (c) includes coding the time-sequential data in conformance with an LZW coding modified version of a Ziv-Lempel algorithm.
References Cited (Backward Citations)
GB1440378A
Cited
US4257069A
Cited
US4365273A
Cited
US4623325A
Cited
EP0259588A2
Cited
EP0309655A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-01-05 | 1996-07-06 | 1997-01-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-01-05 | 2000-07-06 | 2001-01-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-01-05 | 2004-07-06 | 2005-01-05 | $7700.00 | Window Closed / Lapsed |