Patent US6707939B1 successfully refreshed from Google Patents.
US6707939B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for image data compression for two-color images
Assignee: Heidelberger Druckmaschinen AG
•
Filing: 2000-10-23
•
Granted: 2004-03-16
•
Expires: 2020-10-23
Abstract
Abstract A method for compressing digital image data present as matrix of M×N pixels, to a reduced data set, includes dividing the matrix of M×N pixels into blocks of u×v pixels, classifying the blocks of u×v pixels into blocks containing only pixels of one block color or single-color blocks, blocks containing pixels of a foreground color and pixels of a background color or two-color blocks, and blocks containing pixels with more than two colors or multicolor blocks, and coding, in the image data of the single-color blocks and the two-color blocks, by command code words and data words, pixel patterns which are repeated in at least one manner selected from the group consisting of from block to block and within a block, respectively.
Inventors
- 👤 Peter Weinholz
- 👤 Eike Siemsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 11:10
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/415; H04N1/46; H04N1/64; H04N1/642
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
127 words
A method for compressing digital image data present as a matrix of M×N pixels, to a reduced data set, which comprises a) dividing the matrix of M×N pixels into blocks of u×v pixels, b) classifying the blocks of u×v pixels into blocks containing only pixels of one block color, or single-color blocks, blocks containing pixels of a foreground color and pixels of a background color, or two-color blocks, and blocks containing pixels with more than two colors, or multicolor blocks, and c) coding, in the image data of the single-color blocks and the two-color blocks, by command code words and data words, pixel patterns which are repeated in at least one manner selected from the group consisting of from block to block and within a block, respectively.
Claim 2
Independent Claim
127 words
A method for compressing digital image data present as a matrix of M×N pixels, to a reduced data set, which comprises a) dividing the matrix of M×N pixels into blocks of u×v pixels, b) classifying the blocks of u×v pixels into blocks containing only pixels of one block color, or single-color blocks, blocks containing pixels of a foreground color and pixels of a background color, or two-color blocks, and blocks containing pixels with more than two colors, or multicolor blocks, and c) coding, in the image data of the single-color blocks and the two-color blocks, by command code words and data words, pixel patterns which are repeated in at least one manner selected from the group consisting of from block to block and within a block, respectively.
Claim 3
Dependent Claim
23 words
The method according to claim 1 , which includes coding consecutive single-color blocks with a like block color as that of run lengths.
Claim 4
Dependent Claim
52 words
The method according to claim 1 , which includes coding the two-color blocks as bit patterns, assigning to each bit of the bit pattern a pixel of the two-color block, the bits of the bit pattern indicating whether the assigned pixel has one of the foreground color and the background color, respectively.
Claim 5
Dependent Claim
50 words
The method according to claim 3 , which includes forming the bit pattern only with bits for the pixels of such lines of the two-color block, the distribution of foreground color and background color of which is different from the corresponding distribution in the preceding line of the two-color block.
Claim 6
Dependent Claim
26 words
The method according to claim 3 , which includes forming the bit pattern only with bits for a subset of undersampled pixels of the two-color block.
Claim 7
Dependent Claim
23 words
The method according to claim 1 , which includes coding consecutive two-color blocks with a like bit pattern as that of run lengths.
Claim 8
Dependent Claim
25 words
The method according to claim 1 , which includes providing the single-color blocks in different regions of the image data with a different block color.
Claim 9
Dependent Claim
27 words
The method according to claim 1 , which includes providing that the foreground color and the background color are different in different regions of the image data.
Claim 10
Dependent Claim
33 words
The method according to claim 1 , which includes coding as run lengths, consecutive multicolor blocks which are supposed to be skipped in the compression of the single-color blocks and the two-color blocks.
Claim 11
Dependent Claim
20 words
The method according to claim 1 , which includes compressing the multicolor blocks by using a method of transformational coding.
Claim 12
Dependent Claim
15 words
The method according to claim 1 , which includes avoiding compression of the multicolor blocks.
Claim 13
Dependent Claim
32 words
The method according to claim 1 , which includes replacing a portion of the pixels in a multicolor block by the background color, and then coding the block like a two-color block.
Claim 14
Dependent Claim
32 words
The method according to claim 1 , which includes replacing a portion of the pixels in a multicolor block by an arbitrary color, and then coding the block like a multicolor block.
Claim 15
Dependent Claim
23 words
The method according to claim 1 , which includes coding one of the properties of transparency and nontransparency, respectively, for the background color.
References Cited (Backward Citations)
JPS581377A
Cited
US4538187A
Cited
US4530004A
Cited
US4675721A
Cited
JPS59110274A
Cited
USRE33632E
Cited
DE3414455C2
Cited
DE3419693A1
Cited
US4654484A
Cited
US4562484A
Cited
US4982288A
Cited
US5267333A
Cited
EP0491556A2
Cited
US5706368A
Cited
US5612748A
Cited
EP0680030A1
Cited
JPH07274026A
Cited
US5644406A
Cited
US6205255B1
Cited
US6594385B2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-03-16 | 2007-09-15 | 2008-03-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-03-16 | 2011-09-15 | 2012-03-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-03-16 | 2015-09-15 | 2016-03-16 | $7700.00 | Window Closed / Lapsed |