Patent US5481277A successfully refreshed from Google Patents.
US5481277A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character generator
Assignee: Canon Inc
•
Filing: 1992-11-02
•
Granted: 1996-01-02
•
Expires: 2012-11-02
Abstract
Abstract A character generator includes a memory for storing a plurality of character patterns for each character having a specified character code, the plurality of character patterns having different writing start and end points so as to continuously couple a character pattern to the preceding and following character patterns in a string of continuous characters when the string of continuous characters are outputted, and a search unit for searching and deriving a character pattern corresponding to a subject character code from the plurality of character patterns which character pattern as derived is a most appropriate pattern and is continuously coupled to the preceding and following character patterns.
Inventors
- 👤 Hidehiko Morinaga
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 19:25
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06K2215/00; G06K2215/0002; G06K2215/002; G06K2215/0037; G06K2215/0062; G06K2215/0065; G06K2215/0068
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
123 words
A character generator comprising: storage means for storing a plurality of continuous-script character patterns for each character having a specified character code, the plurality of character patterns having different writing start and end points so as to continuously couple a character pattern to preceding and following character patterns when these characters are outputted; and searching means for searching the plurality of character patterns stored in said storage means for a most appropriate character pattern corresponding to a subject character code, wherein the most appropriate character pattern is determined by determining the writing end point thereof on the basis of the writing start point of a following character pattern such that the most appropriate character pattern is continuously coupled to the following character pattern.
Claim 2
Dependent Claim
123 words
A character generator comprising: storage means for storing a plurality of continuous-script character patterns for each character having a specified character code, the plurality of character patterns having different writing start and end points so as to continuously couple a character pattern to preceding and following character patterns when these characters are outputted; and searching means for searching the plurality of character patterns stored in said storage means for a most appropriate character pattern corresponding to a subject character code, wherein the most appropriate character pattern is determined by determining the writing end point thereof on the basis of the writing start point of a following character pattern such that the most appropriate character pattern is continuously coupled to the following character pattern.
Claim 3
Dependent Claim
16 words
A character generator according to claim 1, wherein said character generator is used for Japanese characters.
Claim 4
Dependent Claim
23 words
A character generator according to claim 1, wherein said character generator is used for at least one of printing and displaying character patterns.
Claim 5
Independent Claim
122 words
A method of character generation using a plurality of stored continuous-script character patterns for each character having a specified character code, the plurality of character patterns having different writing start and end points so as to continuously couple a character pattern to preceding and following character patterns when these characters are outputted, said method comprising the steps of: determining the writing end point of a most appropriate character pattern corresponding to a subject character code on the basis of the writing start point of a following character pattern such that the most appropriate character pattern is continuously coupled to the following character pattern; and searching the plurality of stored character patterns for the most appropriate character pattern determined in said determining step.
Claim 6
Independent Claim
122 words
A method of character generation using a plurality of stored continuous-script character patterns for each character having a specified character code, the plurality of character patterns having different writing start and end points so as to continuously couple a character pattern to preceding and following character patterns when these characters are outputted, said method comprising the steps of: determining the writing end point of a most appropriate character pattern corresponding to a subject character code on the basis of the writing start point of a following character pattern such that the most appropriate character pattern is continuously coupled to the following character pattern; and searching the plurality of stored character patterns for the most appropriate character pattern determined in said determining step.
Claim 7
Dependent Claim
14 words
A method of character generation according to claim 4, wherein Japanese characters are generated.
Claim 8
Dependent Claim
17 words
A method of character generation according to claim 4, further comprising the step of printing character patterns.
Claim 9
Dependent Claim
17 words
A method of character generation according to claim 4, further comprising the step of displaying character patterns.
Claim 10
Dependent Claim
136 words
An information processing apparatus comprising: input means for inputting character codes; memory means for sequentially storing the character codes input by said input means; pattern memory means for storing a plurality of character patterns for one character code, the plurality of character patterns having respective different start and end points; output means for outputting a character pattern; and control means for converting each character code stored in said memory means into a corresponding character pattern, and for sending the corresponding character pattern to said output means, wherein said control means sets an end point of a character pattern corresponding to one of consecutive character codes based on a start point of a character pattern corresponding to a subsequent one of the consecutive character codes, and reads a suitable character pattern stored in said pattern memory means.
Claim 11
Dependent Claim
136 words
An information processing apparatus comprising: input means for inputting character codes; memory means for sequentially storing the character codes input by said input means; pattern memory means for storing a plurality of character patterns for one character code, the plurality of character patterns having respective different start and end points; output means for outputting a character pattern; and control means for converting each character code stored in said memory means into a corresponding character pattern, and for sending the corresponding character pattern to said output means, wherein said control means sets an end point of a character pattern corresponding to one of consecutive character codes based on a start point of a character pattern corresponding to a subsequent one of the consecutive character codes, and reads a suitable character pattern stored in said pattern memory means.
Claim 12
Dependent Claim
35 words
An apparatus according to claim 8, wherein each of the character patterns stored in said pattern memory means corresponds to a code comprising a character code, a start position code and an end position code.
Claim 13
Dependent Claim
30 words
An apparatus according to claim 9, wherein said pattern memory means further stores a character pattern which is not connected to at least one of preceding and subsequent character patterns.
Claim 14
Dependent Claim
47 words
An apparatus according to claim 9, wherein said control means converts the input character code into a code comprising a character code, a start position code and an end position code and reads the suitable character pattern from said pattern memory means based on the converted code.
Claim 15
Dependent Claim
19 words
An apparatus according to claim 9, wherein the start position and the end position are represented by coordinate positions.
Claim 16
Dependent Claim
27 words
An apparatus according to claim 9, wherein the start position and the end position are represented by positions of a dot pattern outermost of the character pattern.
Claim 17
Dependent Claim
118 words
An information processing method of outputting a character pattern corresponding to an input character code, said method comprising the steps of: sequentially storing input character codes in a memory; setting an end point of a character pattern corresponding to one of consecutive character codes stored in the memory based on a start point of a character pattern corresponding to a subsequent character code of the consecutive character codes; reading a suitable character pattern from a pattern memory, which stores a plurality of character patterns for each character code, the plurality of character patterns having respective different start and end points, based on the set start and end points; and sending the read character pattern to an output means.
Claim 18
Dependent Claim
118 words
An information processing method of outputting a character pattern corresponding to an input character code, said method comprising the steps of: sequentially storing input character codes in a memory; setting an end point of a character pattern corresponding to one of consecutive character codes stored in the memory based on a start point of a character pattern corresponding to a subsequent character code of the consecutive character codes; reading a suitable character pattern from a pattern memory, which stores a plurality of character patterns for each character code, the plurality of character patterns having respective different start and end points, based on the set start and end points; and sending the read character pattern to an output means.
Claim 19
Dependent Claim
34 words
A method according to claim 14, wherein each of the character patterns stored in the pattern memory corresponds to a code comprising a character code, a start position code and an end position code.
Claim 20
Dependent Claim
28 words
A method according to claim 15, wherein the pattern memory further stores a character pattern which is not connected to at least one of preceding and subsequent patterns.
Claim 21
Dependent Claim
53 words
A method according to claim 15, wherein said reading step comprises a step of converting the input character code into a code comprising a character code, a start position code and an end position code and a step of reading the suitable character pattern from the pattern memory based on the converted code.
Claim 22
Dependent Claim
19 words
A method according to claim 15, wherein the start position and the end position are represented by coordinate positions.
Claim 23
Dependent Claim
27 words
A method according to claim 15, wherein the start position and the end position are represented by positions of a dot pattern outermost of the character pattern.
References Cited (Backward Citations)
US4604712A
Cited
EP0120481A2
Cited
US4670842A
Cited
JPS59230754A
Cited
US4764972A
Cited
US4843593A
Cited
JPS62282381A
Cited
GB2208556A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-01 | 1999-07-03 | 2000-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-01 | 2003-07-03 | 2004-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-01 | 2007-07-03 | 2008-01-02 | $7700.00 | Window Closed / Lapsed |