US4633505A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character compression technique
Assignee: Xerox Corp
•
Filing: 1984-11-23
•
Granted: 1986-12-30
•
Expires: 2004-11-23
Abstract
Abstract The present invention is concerned with compression encoding and, in particular, the encoding of the second difference of the position of the boundary of a character on consecutive scanlines. Special code sequences represent the starting location for two new character boundaries relative to the last position in the scanline generated, the next two character boundaries that do not extend into the next scanline, and the end of a line when the preceeding scanline had no intersections with a character boundary. Also included are code sequences representing the first item on the last scanline of the character to terminate the code and at the right of all other boundaries on the current scanline.
Inventors
- 👤 Sidney W. Marshall
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 01:40
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/004; G06V; G06V30/00; G06V30/10; G06V30/18; G06V30/1801; G06V30/18076; G06V30/184; H; H03; H03M; H03M7/00; H03M7/30; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/417; H04N1/4175
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
129 words
A method for compression encoding the digital representation of a character having a boundary, the encoding including escape codes, the character being recreated over a plurality of consecutive scanlines, the location of the boundary on three consecutive scanlines being x 1 , x 2 , and x 3 , including the steps of predetermining the second difference for each intersection of a character boundary with a scanline, providing the second difference (x 2 -x 1 )-(x 3 -x 2 ) of the location of the boundary for relatively small second differences, representing by an escape code the starting locations for the new character boundaries relative to the last position in the scanline generated, and using an escape code to terminate the extension of character boundaries into the next scanline.
Claim 2
Independent Claim
129 words
A method for compression encoding the digital representation of a character having a boundary, the encoding including escape codes, the character being recreated over a plurality of consecutive scanlines, the location of the boundary on three consecutive scanlines being x 1 , x 2 , and x 3 , including the steps of predetermining the second difference for each intersection of a character boundary with a scanline, providing the second difference (x 2 -x 1 )-(x 3 -x 2 ) of the location of the boundary for relatively small second differences, representing by an escape code the starting locations for the new character boundaries relative to the last position in the scanline generated, and using an escape code to terminate the extension of character boundaries into the next scanline.
Claim 3
Independent Claim
72 words
A method for compression encoding a digital representation of a character having a boundary including the steps of: encoding the second difference of the positions of the boundary over consecutive scanlines, for second differences of small value, and providing escape codes for second differences of relatively large value, one of the escape codes including the step of representing the digital locations for new character boundaries relative to the current scanline being generated.
Claim 4
Independent Claim
72 words
A method for compression encoding a digital representation of a character having a boundary including the steps of: encoding the second difference of the positions of the boundary over consecutive scanlines, for second differences of small value, and providing escape codes for second differences of relatively large value, one of the escape codes including the step of representing the digital locations for new character boundaries relative to the current scanline being generated.
Claim 5
Dependent Claim
25 words
The method of claim 2 wherein one of the escape codes includes the step of terminating the extension of character boundaries into the next scanline.
Claim 6
Dependent Claim
22 words
The method of claim 2, wherein one of the escape codes includes the step of inserting new boundaries into the next scanline.
Claim 7
Independent Claim
103 words
A method for compression encoding the digital representation of a character having a boundary, the encoding including escape codes, the character being recreated over a plurality of consecutive scanlines, the location of the boundary on three consecutive scanlines being x 1 , x 2 , and x 3 , including the steps of predetermining the second difference for each intersection of a character boundary with a scanline, providing the second difference (x 2 -x 1 )-(x 3 -x 2 ) of the location of the boundary for relatively small second differences, using an escape code for starting and terminating boundaries of the character.
Claim 8
Independent Claim
103 words
A method for compression encoding the digital representation of a character having a boundary, the encoding including escape codes, the character being recreated over a plurality of consecutive scanlines, the location of the boundary on three consecutive scanlines being x 1 , x 2 , and x 3 , including the steps of predetermining the second difference for each intersection of a character boundary with a scanline, providing the second difference (x 2 -x 1 )-(x 3 -x 2 ) of the location of the boundary for relatively small second differences, using an escape code for starting and terminating boundaries of the character.
Claim 9
Dependent Claim
31 words
The method of claim 5 including the step of representing by an escape code the starting locations for the new character boundaries relative to the last position in the scanline generated.
Claim 10
Dependent Claim
24 words
The method of claim 5 including the step of using an escape code to terminate the extension of character boundaries into the next scanline.
Claim 11
Dependent Claim
16 words
The method of claim 5, including the step of inserting new boundaries into the next scanline.
References Cited (Backward Citations)
US3471848A
Cited
US3686631A
Cited
US3833900A
Cited
US3979742A
Cited
US4443794A
Cited
US4555191A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-12-29 | 1990-06-30 | 1990-12-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-12-29 | 1994-06-30 | 1994-12-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-12-29 | 1998-06-30 | 1998-12-30 | $7700.00 | Window Closed / Lapsed |