US5056154A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Text image data compression system
Assignee: Sharp Corp
•
Filing: 1989-11-06
•
Granted: 1991-10-08
•
Expires: 2009-11-06
Abstract
Abstract A text image data compression system for compressing image data having pixels each being expressed by N bit data which varies from a maximum value to a minimum value, includes a circuit for replacing the maximum value N bit data with a first symbol "3" followed by N-1 bit common data "*" and the minimum value N bit data with a second symbol "2" followed by N-1 bit common data "*". Also provided is a circuit for making a symbol alignment such that the most significant symbols are collected and are aligned from the first row to the bottom row, the second significant symbols are collected and are aligned from the first row to the bottom row, kth significant symbols are collected and are aligned from the first row to the bottom row, in which k is between three and N-1, and the least significant symbols are collected and are aligned from the first row to the bottom row, and that all of said common symbols "*" are removed; and a circuit for detecting run lengths in the symbol alignment to produce run lengths of four different symbols "3", "2", "1" and "0".
Inventors
- 👤 Tomoko Aono
- 👤 Hiroyuki Katata
- 👤 Yoji Noguchi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 22:17
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
353 words
A text image data compression system for compressing image data divided into bit planes and including data text images disposed in a plain background image, said text image data compression system comprising: means for producing grey level image data for a plurality of pixels aligned in two orthogonal directions, each pixel being expressed by N bits of data which represent values varying from a maximum value to a minimum value, in which the pixels with maximum value represent background, the pixels with minimum value represent characters, and the pixels with intermediate value represent boundary portions between the background and characters; means for replacing said maximum value N bit data with a first symbol followed by N-1 bit common data and replacing said minimum value N bit data with a second symbol followed by N-1 bit common data, so that background portions are expressed by N bit symbols comprised of said first symbol and a plurality of common symbols, character portions are expressed by N bit symbols comprised of said second symbol and a plurality of said common symbols, and intermediate grey level portions are expressed by N bit symbols comprised of binary 1's and binary 0's; means for making a symbol alignment wherein the N bit symbols lie in different bit planes, such that the most significant symbols of said N bit symbols are collected and are aligned from a first row of said N bit symbols to a bottom row of said N bit symbols, the second significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, kth significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, in which k is between three and N-1, and the least significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, and that all of said common symbols are removed; and means for detecting run lengths in said symbol alignment after removal of said common symbols to produce run lengths of four different symbols.
Claim 2
Dependent Claim
353 words
A text image data compression system for compressing image data divided into bit planes and including data text images disposed in a plain background image, said text image data compression system comprising: means for producing grey level image data for a plurality of pixels aligned in two orthogonal directions, each pixel being expressed by N bits of data which represent values varying from a maximum value to a minimum value, in which the pixels with maximum value represent background, the pixels with minimum value represent characters, and the pixels with intermediate value represent boundary portions between the background and characters; means for replacing said maximum value N bit data with a first symbol followed by N-1 bit common data and replacing said minimum value N bit data with a second symbol followed by N-1 bit common data, so that background portions are expressed by N bit symbols comprised of said first symbol and a plurality of common symbols, character portions are expressed by N bit symbols comprised of said second symbol and a plurality of said common symbols, and intermediate grey level portions are expressed by N bit symbols comprised of binary 1's and binary 0's; means for making a symbol alignment wherein the N bit symbols lie in different bit planes, such that the most significant symbols of said N bit symbols are collected and are aligned from a first row of said N bit symbols to a bottom row of said N bit symbols, the second significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, kth significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, in which k is between three and N-1, and the least significant symbols of said N bit symbols are collected and are aligned from said first row to said bottom row, and that all of said common symbols are removed; and means for detecting run lengths in said symbol alignment after removal of said common symbols to produce run lengths of four different symbols.
Claim 3
Dependent Claim
44 words
A text image data compression system as claimed in claim 1, wherein said symbol alignment further includes a line symbol at the beginning of each of said rows and a plane symbol at the beginning of each collection of said most significant bit symbols.
Claim 4
Dependent Claim
19 words
A text image data compression system as claimed in claim 2, further comprising means for coding said symbol alignment.
Claim 5
Dependent Claim
21 words
A text image data compression system as claimed in claim 3, wherein said coding means carries out a modified Huffman coding.
Claim 6
Dependent Claim
39 words
A text image data compression system as claimed in claim 4, wherein said symbol alignment further has a first indicator at the beginning of each run of said most significant symbols for indicating one of said four different symbols.
Claim 7
Dependent Claim
43 words
A character image data compression system as claimed in claim 4, wherein said symbol alignment further has a second indicator at the beginning of each run of symbols other than said most significant symbols indicating one of two of said four different symbols.
Claim 8
Dependent Claim
250 words
A grey level reduction system for reducing text image data including text images disposed in a plain background image, said grey level reduction system comprising: means for producing original image data for a plurality of pixels aligned in two orthogonal directions, each pixel having a pixel value expressed by N bit data which varies from a maximum value to a minimum value in which the pixels with maximum value represent white, the pixels with minimum value represent black, and the pixels with intermediate value represent grey; means for producing a histogram of different pixel values to obtain a first pixel value at a first peak point adjacent said minimum value, and a second pixel value at a second peak point adjacent said maximum value, and also to obtain a threshold pixel value located between said first and second pixel values; means for making a bi-level image by applying a white level value to all the pixels not smaller than said threshold, thereby producing white pixels and a black level value to all the pixels smaller than said threshold, thereby producing black pixels; means for detecting a boundary portion of said bi-level image, said boundary portion being located where the white level value pixel portions and the black level value pixel portions meet; and means for replacing pixel values of said white and black pixels at said boundary portion with grey level values, thereby obtaining an image wherein said boundary portions change gradually from a black level to a white level.
Claim 9
Dependent Claim
250 words
A grey level reduction system for reducing text image data including text images disposed in a plain background image, said grey level reduction system comprising: means for producing original image data for a plurality of pixels aligned in two orthogonal directions, each pixel having a pixel value expressed by N bit data which varies from a maximum value to a minimum value in which the pixels with maximum value represent white, the pixels with minimum value represent black, and the pixels with intermediate value represent grey; means for producing a histogram of different pixel values to obtain a first pixel value at a first peak point adjacent said minimum value, and a second pixel value at a second peak point adjacent said maximum value, and also to obtain a threshold pixel value located between said first and second pixel values; means for making a bi-level image by applying a white level value to all the pixels not smaller than said threshold, thereby producing white pixels and a black level value to all the pixels smaller than said threshold, thereby producing black pixels; means for detecting a boundary portion of said bi-level image, said boundary portion being located where the white level value pixel portions and the black level value pixel portions meet; and means for replacing pixel values of said white and black pixels at said boundary portion with grey level values, thereby obtaining an image wherein said boundary portions change gradually from a black level to a white level.
Claim 10
Dependent Claim
113 words
A grey level reduction system as claimed in claim 7, further comprising: means for quantizing said original image data to produce quantized image data such that the pixels with pixel values equal to or smaller than said first pixel value are assigned with a minimum pixel value, the pixels with pixel values equal to or greater than said second pixel value are assigned with a maximum pixel value, and the pixels with pixel values between said first and second pixel values are quantized with a predetermined quantization level, and wherein said replacing means replaces said pixel values of pixels at said boundary portion with grey level values obtained from said quantized image data.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-07 | 1995-04-08 | 1995-10-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-07 | 1999-04-08 | 1999-10-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-07 | 2003-04-08 | 2003-10-08 | $7700.00 | Window Closed / Lapsed |