US3999167A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for generating character patterns
Assignee: Fujifilm Business Innovation Corp
•
Filing: 1974-11-01
•
Granted: 1976-12-21
•
Expires: 1994-11-01
Abstract
Abstract Apparatus for generating a character pattern where the character pattern comprises a plurality of dots where certain ones of the dots fall within the character outline and others of the dots fall outside of the character outline, the apparatus comprising first storing means for storing preselected ones of the dots; decoder means responsive to at least some of the stored dots for reconstructing the dots not stored in the first storing means; pattern combining means responsive to the stored dots and the reconstructed dots for generating the character pattern therefrom whereby the memory capacity of the first storing means is lessened by having to store therein only the preselected ones of the dots; second storing means for storing the reconstructed dots; and the decoder means being further responsive to reconstructed dots previously stored in the second storing means for effecting the reconstruction of the dots not stored in the first storing means.
Inventors
- 👤 Masamichi Ito
- 👤 Takashi Hirasaki
- 👤 Hiroshi Sato
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 18:26
CPC Classifications
G; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G09G5/246
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
233 words
Apparatus for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said apparatus comprising first memory means for storing said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot disposed to the immediate left of each said omitted dot, (b) a right dot disposed to the immediate right of each said omitted dot, (c) an upper dot disposed immediately above each said omitted dot and (d) a lower dot disposed immediately below each said omitted dot; decoder means responsive to said first memory means for restoring each said omitted dot to the original character pattern, said decoder means being responsive to the presence or absence of said left, right, upper and lower dots and at least one further dot in addition to said last-mentioned dots to generate a restored dot for each said omitted dot; and combining means for combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 2
Dependent Claim
233 words
Apparatus for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said apparatus comprising first memory means for storing said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot disposed to the immediate left of each said omitted dot, (b) a right dot disposed to the immediate right of each said omitted dot, (c) an upper dot disposed immediately above each said omitted dot and (d) a lower dot disposed immediately below each said omitted dot; decoder means responsive to said first memory means for restoring each said omitted dot to the original character pattern, said decoder means being responsive to the presence or absence of said left, right, upper and lower dots and at least one further dot in addition to said last-mentioned dots to generate a restored dot for each said omitted dot; and combining means for combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 3
Dependent Claim
15 words
Apparatus as in claim 1 where said further dot is stored in said first memory.
Claim 4
Dependent Claim
26 words
Apparatus as in claim 2 where said decoder means is responsive to a plurality of said further dots including said left, right, upper and lower dots.
Claim 5
Dependent Claim
36 words
Apparatus as in claim 3 where at least one of said further dots is diagonally disposed in said original matrix with respect to one of said left, right, upper and lower dots and immediately adjacent thereto.
Claim 6
Dependent Claim
32 words
Apparatus as in claim 4 where at least one of said further dots is collinearly disposed with respect to one of said left, right, upper and lower dots and said omitted dot.
Claim 7
Dependent Claim
35 words
Apparatus as in claim 1 including a second memory responsive to said decoder means for storing said restored dots and where said further dot is one of the restored dots stored in said second memory.
Claim 8
Dependent Claim
410 words
Apparatus for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said apparatus comprising first memory means for storing said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot A 1 disposed to the immediate left of each said omitted dot, (b) a right dot A 3 disposed to the immediate right of each said omitted dot, (c) an upper dot A 2 disposed immediately above each said omitted dot, (d) a lower dot A 4 disposed immediately below each said omitted dot, (e) a dot A 5 diagonally disposed immediately to the left and above dot A 1 , (f) a dot A 6 diagonally disposed immediately to the left and above dot A 2 , (g) a dot A 7 diagonally disposed immediately to the right and above dot A 2 , (h) a dot A 8 diagonally disposed immediately to the right and above dot A 3 , (i) a dot A 9 diagonally disposed immediately to the right and below dot A 3 , (j) a dot A 10 diagonally disposed immediately to the right and below dot A 4 , (k) a dot A 11 diagonally disposed immediately to the left and below dot A 4 , (l) a dot A 12 diagonally disposed immediately to the left and below dot A 1 , (m) a dot A 13 collinearly disposed to the left of dot A 1 and said omitted dot, (n) a dot A 14 collinearly disposed to the right of dot A 3 and said omitted dot, (o) a dot A 15 collinearly disposed above dot A 2 and said omitted dot; decoder means responsive to said first memory means for restoring each said omitted dot to the original character pattern, said decoder means being responsive to said dots A 1 through A 15 to generate a restored dot for each said omitted dot; and combining means for combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 9
Dependent Claim
410 words
Apparatus for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said apparatus comprising first memory means for storing said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot A 1 disposed to the immediate left of each said omitted dot, (b) a right dot A 3 disposed to the immediate right of each said omitted dot, (c) an upper dot A 2 disposed immediately above each said omitted dot, (d) a lower dot A 4 disposed immediately below each said omitted dot, (e) a dot A 5 diagonally disposed immediately to the left and above dot A 1 , (f) a dot A 6 diagonally disposed immediately to the left and above dot A 2 , (g) a dot A 7 diagonally disposed immediately to the right and above dot A 2 , (h) a dot A 8 diagonally disposed immediately to the right and above dot A 3 , (i) a dot A 9 diagonally disposed immediately to the right and below dot A 3 , (j) a dot A 10 diagonally disposed immediately to the right and below dot A 4 , (k) a dot A 11 diagonally disposed immediately to the left and below dot A 4 , (l) a dot A 12 diagonally disposed immediately to the left and below dot A 1 , (m) a dot A 13 collinearly disposed to the left of dot A 1 and said omitted dot, (n) a dot A 14 collinearly disposed to the right of dot A 3 and said omitted dot, (o) a dot A 15 collinearly disposed above dot A 2 and said omitted dot; decoder means responsive to said first memory means for restoring each said omitted dot to the original character pattern, said decoder means being responsive to said dots A 1 through A 15 to generate a restored dot for each said omitted dot; and combining means for combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 10
Dependent Claim
50 words
Apparatus as in claim 7 where said decoder means restores each said omitted dot X in accordance with the following equation: X = A.sub.1.A.sub.2.(A.sub.3 +A.sub.4)+A.sub.3.A.sub.4.(A.sub.1 +A.sub.2) + A.sub.1.[A.sub.2.(A.sub.12 +A.sub.6.A.sub.9 +A.sub.8.A.sub.14 +A.sub.5.A.sub.15 +A.sub.8.A.sub.15) + A.sub.3.(A.sub.9 +A.sub.15 +A.sub.12.A.sub.13 +A.sub.6.A.sub.12 +A.sub.8.A.sub.10 +A.sub.5.A.sub.8) + A.sub.4.(A.sub.12 +A.sub.6.A.sub.11 +A.sub.9.A.sub.11)] + A.sub.3.[A.sub.2.A.sub.8.(A.sub.5.A.sub.7.A.sub.14 +A.sub.5.A.sub.15 +A.sub.7.A.sub.15) + A.sub.4.(A.sub.9.A.sub.12 +A.sub.8.A.sub.15)]
Claim 11
Independent Claim
236 words
a method for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said method comprising the steps of storing in a first memory means said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot disposed to the immediate left of each said omitted dot, (b) a right dot disposed to the immediate right of each said omitted dot, (c) an upper dot disposed immediately above each said omitted dot and (d) a lower dot disposed immediately below each said omitted dot; restoring with a decoder means responsive to said first memory means each said omitted dot to the original character pattern, said decoder means being response to the presence or absence of said left, right, upper and lower dots and at least one further dot in addition to said last-mentioned dots to generate a restored dot for each said omitted dot; and combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 12
Independent Claim
236 words
a method for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said method comprising the steps of storing in a first memory means said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot disposed to the immediate left of each said omitted dot, (b) a right dot disposed to the immediate right of each said omitted dot, (c) an upper dot disposed immediately above each said omitted dot and (d) a lower dot disposed immediately below each said omitted dot; restoring with a decoder means responsive to said first memory means each said omitted dot to the original character pattern, said decoder means being response to the presence or absence of said left, right, upper and lower dots and at least one further dot in addition to said last-mentioned dots to generate a restored dot for each said omitted dot; and combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 13
Dependent Claim
16 words
A method as in claim 9 where said further dot is stored in said first memory.
Claim 14
Dependent Claim
27 words
A method as in claim 10 where said decoder means is responsive to a plurality of said further dots including said left, right, upper and lower dots.
Claim 15
Dependent Claim
40 words
A method as in claim 11 where at least one of said further dots is diagonally disposed in said original matrix with respect to one of said left, right, upper and lower dots and immediately adjacent thereto excluding omitted dots.
Claim 16
Dependent Claim
33 words
A method as in claim 11 where at least one of said further dots is collinearly disposed with respect to one of said left, right, upper and lower dots and said omitted dots.
Claim 17
Dependent Claim
31 words
A method as in claim 9 including storing said restored dots in a second memory and where said further dot is one of the restored dots stored in said second memory.
Claim 18
Independent Claim
413 words
A method for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said method comprising the steps of storing in a first memory means said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot A 1 disposed to the immediate left of each said omitted dot, (b) a right dot A 3 disposed to the immediate right of each said omitted dot, (c) an upper dot A 2 disposed immediately above each said omitted dot, (d) a lower dot A 4 disposed immediately below each said omitted dot, (e) a dot A 5 diagonally disposed immediately to the left and above dot A 1 , (f) a dot A 6 diagonally disposed immediately to the left and above dot A 2 , (g) a dot A 7 diagonally disposed immediately to the right and above dot A 2 , (h) a dot A 8 diagonally disposed immediately to the right and above dot A 3 , (i) a dot A 9 diagonally disposed immediately to the right and below dot A 3 , (j) a dot A 10 diagonally disposed immediately to the right and below dot A 4 , (k) a dot A 11 diagonally disposed immediately to the left and below dot A 4 , (l) a dot A 12 diagonally disposed immediately to the left and below dot A 1 , (m) a dot A 13 collinearly disposed to the left of dot A 1 and said omitted dot, (n) a dot A 14 collinearly disposed to the right of dot A 3 and said omitted dot, (o) a dot A 15 collinearly disposed above dot A 2 and said omitted dot; restoring with a decoder means responsive to said first memory means each said omitted dot to the original character pattern, said decoder means being responsive to said dots A 1 through A 15 to generate a restored dot for each said omitted dot; and combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 19
Independent Claim
413 words
A method for reconstructing an original character pattern comprising an original matrix of m × n dots from a compressed character pattern comprising approximately (m × n)/2 dots; said method comprising the steps of storing in a first memory means said compressed character pattern as a compressed matrix of approximately (m × n)/2 dots where each row of the compressed character pattern so contains every other dot of the corresponding row of the original character pattern that for each omitted dot of the original character pattern, the following dots of the original character pattern are stored in the first memory means: (a) a left dot A 1 disposed to the immediate left of each said omitted dot, (b) a right dot A 3 disposed to the immediate right of each said omitted dot, (c) an upper dot A 2 disposed immediately above each said omitted dot, (d) a lower dot A 4 disposed immediately below each said omitted dot, (e) a dot A 5 diagonally disposed immediately to the left and above dot A 1 , (f) a dot A 6 diagonally disposed immediately to the left and above dot A 2 , (g) a dot A 7 diagonally disposed immediately to the right and above dot A 2 , (h) a dot A 8 diagonally disposed immediately to the right and above dot A 3 , (i) a dot A 9 diagonally disposed immediately to the right and below dot A 3 , (j) a dot A 10 diagonally disposed immediately to the right and below dot A 4 , (k) a dot A 11 diagonally disposed immediately to the left and below dot A 4 , (l) a dot A 12 diagonally disposed immediately to the left and below dot A 1 , (m) a dot A 13 collinearly disposed to the left of dot A 1 and said omitted dot, (n) a dot A 14 collinearly disposed to the right of dot A 3 and said omitted dot, (o) a dot A 15 collinearly disposed above dot A 2 and said omitted dot; restoring with a decoder means responsive to said first memory means each said omitted dot to the original character pattern, said decoder means being responsive to said dots A 1 through A 15 to generate a restored dot for each said omitted dot; and combining the dots stored in said first memory means with said restored dots to thereby effect the reconstruction of said original character pattern.
Claim 20
Dependent Claim
49 words
A method as in claim 15 where each said omitted dot X is restored in accordance with the following equation: X = A.sub.1.A.sub.2.(A.sub.3 +A.sub.4)+A.sub.3.A.sub.4.(A.sub.1 +A.sub.2) + A.sub.1.[A.sub.2.(A.sub.12 +A.sub.6.A.sub.9 +A.sub.8.A.sub.14 +A.sub.5.A.sub.15 +A.sub.8.A.sub.15) + A.sub.3.(A.sub.9 +A.sub.15 +A.sub.12.A.sub.13 +A.sub.6.A.sub.12 +A.sub.8.A.sub.10 +A.sub.5.A.sub.8) + A.sub.4.(A.sub.12 +A.sub.6.A.sub.11 +A.sub.9.A.sub.11)] + A.sub.3.[A.sub.2.A.sub.8.(A.sub.5.A.sub.7.A.sub.14 +A.sub.5.A.sub.15 +A.sub.7.A.sub.15) + A.sub.4.(A.sub.9.A.sub.12 +A.sub.8.A.sub.15)]
References Cited (Backward Citations)
US3878536A
Cited
US3789386A
Cited
US3769451A
Cited
US3786478A
Cited
US3824590A
Cited
US3873761A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1979-12-21 | 1980-06-21 | 1980-12-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1983-12-21 | 1984-06-21 | 1984-12-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1987-12-21 | 1988-06-21 | 1988-12-21 | $7700.00 | Window Closed / Lapsed |