Patent US5058187A successfully refreshed from Google Patents.
US5058187A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for compressing character image data
Assignee: LG Electronics Inc
•
Filing: 1989-03-29
•
Granted: 1991-10-15
•
Expires: 2009-03-29
Abstract
Abstract A method for compressing font data wherein, for example, each byte of a font is provided with a compressing code. A bit map of the font is stored in a font file which is separated into a reference byte and a comparator byte. The two bytes are compared with each other. In response to the comparison a specific compression code is assigned and stored in the compression file. In the comparison, the present byte of a font to be compressed is compared with a byte which is positioned immediately before the present byte. When no byte is positioned immediately before the present byte, the byte is compared with OOH.
Inventors
- 👤 Jeong Y. Kim
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 17:35
CPC Classifications
G; G06; G06K; G06K15/00; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G06K15/02; G06T; G06T9/00; G06T9/004; H; H03; H03M; H03M7/00; H03M7/30; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0028; G06K2215/0031
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
91 words
A method for compressing character image data, comprising the steps of: (a) dividing a character image data into a plurality of column units; (b) scanning from a top byte of each column unit toward a bottom byte of said each column unit; (c) comparing a present byte with a comparative byte, the comparative byte being a previous byte before the present byte; (d) assigning a predetermined compression code according to the result of said comparing step; and (e) storing the result of said assigning step in at least one memory means.
Claim 2
Independent Claim
91 words
A method for compressing character image data, comprising the steps of: (a) dividing a character image data into a plurality of column units; (b) scanning from a top byte of each column unit toward a bottom byte of said each column unit; (c) comparing a present byte with a comparative byte, the comparative byte being a previous byte before the present byte; (d) assigning a predetermined compression code according to the result of said comparing step; and (e) storing the result of said assigning step in at least one memory means.
Claim 3
Dependent Claim
248 words
A method for compressing character image data according to claim 1 wherein the comparing step is a case selected from the group consisting of: a case that said present byte and said comparative byte are same, a case that said comparative byte is OOH, a case that said comparative byte is FFH, a case that said comparative byte is same as a present byte shifted by one bit to the left, a case that said comparative byte is same as a present byte shifted by one bit to the right, a case that said comparative byte is same as what said present byte and a present byte shifted by one bit to the left are ANDed, a case that said comparative byte is same as what said present byte and a present byte shifted by one bit to the left are ORed, a case that said comparative byte is same as what said present byte and a present byte shifted by one bit to the left are ANDed, a case that said comparative byte is same as what said present byte and a present byte shifted by one bit to the left are ORed, a case that said comparative byte is same as a byte which is reversed after l-th bit of said present byte, or a case that said comparative byte is same as a byte which is reversed after l-th bit of said present byte and is reversed again after j-th bit of said present byte.
Claim 4
Dependent Claim
34 words
A method for compressing character image data according to claim 2, wherein said compression data is assigned in optimum by a Hoffman method after seeking a statistical accumulative degree with respect to said cases.
Claim 5
Dependent Claim
32 words
A method for compressing character image data according to claim 3, wherein said result of said assigning step is respectively stored after being divided into a compressed data and a non-compressed data.
Claim 6
Dependent Claim
32 words
A method for compressing character image data according to claim 2, wherein said result of said assigning step is respectively stored after being divided into a compressed data and a non-compressed data.
Claim 7
Dependent Claim
32 words
A method for compressing character image data according to claim 1, wherein said result of said assigning step is respectively stored after being divided into a compressed data and a non-compressed data.
Claim 8
Independent Claim
87 words
A method for compressing character image data, comprising the steps of: (a) dividing a character image data into a plurality of column units; (b) scanning from a top byte of each column unit toward a bottom byte of said each column unit; (c) comparing a present byte, which is a first byte of each column unit, with OOH; (d) assigning a predetermined compression code according to the result of said comparing step; and (e) storing the result of said assigning step to at least one memory means.
Claim 9
Independent Claim
87 words
A method for compressing character image data, comprising the steps of: (a) dividing a character image data into a plurality of column units; (b) scanning from a top byte of each column unit toward a bottom byte of said each column unit; (c) comparing a present byte, which is a first byte of each column unit, with OOH; (d) assigning a predetermined compression code according to the result of said comparing step; and (e) storing the result of said assigning step to at least one memory means.
Claim 10
Dependent Claim
32 words
A method for compressing character image data according to claim 7, wherein said result of said assigning step is respectively stored after being divided into a compressed data and a non-compressed data.
References Cited (Backward Citations)
US4068224A
Cited
US4703516A
Cited
US4542412A
Cited
US4876607A
Cited
US4513444A
Cited
US4566128A
Cited
US4777620A
Cited
US4843389A
Cited
US4899148A
Cited
US5003307A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-14 | 1995-04-15 | 1995-10-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-14 | 1999-04-15 | 1999-10-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-14 | 2003-04-15 | 2003-10-15 | $7700.00 | Window Closed / Lapsed |