US4274079A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for dynamic font switching
Assignee: Unisys Corp
•
Filing: 1979-07-12
•
Granted: 1981-06-16
•
Expires: 1999-07-12
Abstract
Abstract A method and apparatus are provided for dynamically switching between fonts or groups of fonts in an automatic optical character reader. A switch character which is included between a first and second group of characters triggers the selection of the appropriate memory for the succeeding font.
Inventors
- 👤 Robert Todd
- 👤 Frank J. Haas
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 10:43
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/24; G06V30/242
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
154 words
An apparatus for recognizing a presented pattern as being in one of a plurality of predetermined classes of patterns, having generating means for generating a predetermined combination of signals representing the geometric configuration of the presented pattern, said predetermined combination of signals defining a feature vector of the presented pattern, projecting means for projecting said feature vector onto one of a plurality of sets of predetermined multi-dimensional subspaces, each of said sets characterizing a specific predetermined class of patterns, selector means for selecting one of said patterns as the presented character according to a predetermined algorithm employing the results of said projections prior to said entire projection process being completed wherein the improvement comprises: switching means operative to sense said presented pattern as being a switch character within one of said predetermined classes of patterns and in response thereto projecting said feature vector onto the set of predetermined multi-dimensional subspaces containing said switch character.
Claim 2
Independent Claim
154 words
An apparatus for recognizing a presented pattern as being in one of a plurality of predetermined classes of patterns, having generating means for generating a predetermined combination of signals representing the geometric configuration of the presented pattern, said predetermined combination of signals defining a feature vector of the presented pattern, projecting means for projecting said feature vector onto one of a plurality of sets of predetermined multi-dimensional subspaces, each of said sets characterizing a specific predetermined class of patterns, selector means for selecting one of said patterns as the presented character according to a predetermined algorithm employing the results of said projections prior to said entire projection process being completed wherein the improvement comprises: switching means operative to sense said presented pattern as being a switch character within one of said predetermined classes of patterns and in response thereto projecting said feature vector onto the set of predetermined multi-dimensional subspaces containing said switch character.
Claim 3
Dependent Claim
62 words
The apparatus of claim 1 wherein said switching means further comprises: comparator means operative to compare said switch character to a fixed character; a plurality of memories each memory containing a set of vectors characterizing one of said predetermined classes of patterns; and memory switching means responsive to said comparator means operative to connect one of said memories to said projecting means.
Claim 4
Dependent Claim
14 words
The apparatus of claim 2 wherein said memory switching means comprises: a J-K flip-flop.
Claim 5
Independent Claim
208 words
An apparatus for recognizing a presented character as being in one of a plurality of predetermined classes of characters, having generating means for generating a predetermined combination of signals representing the geometric configuration of the presented character, said predetermined combination of signals defining a normalized feature vector of the presented character, storage means for storing a plurality of sets of eigenvectors, each set of eigenvectors being formed from a plurality of prototype vectors representing each class of characters, projecting means for projecting said feature vector onto a set of predetermined multi-dimensional subspaces characterizing the predetermined classes one dimension at a time, the subspaces being in the form of one of said stored sets of eigenvectors wherein each of the subspaces approximates its corresponding prototype vectors in a least mean square root sense, selector means for selecting one of said characters as the presented character according to a predetermined algorithm employing the results of said projections after each projection onto a dimension of the subspace, wherein the improvement comprises: switching means operative to sense said presented pattern as being a switch character within one of said predetermined classes of characters, and in response thereto projecting said feature vector onto the set of predetermined multi-dimensional subspaces containing said switch character.
Claim 6
Independent Claim
208 words
An apparatus for recognizing a presented character as being in one of a plurality of predetermined classes of characters, having generating means for generating a predetermined combination of signals representing the geometric configuration of the presented character, said predetermined combination of signals defining a normalized feature vector of the presented character, storage means for storing a plurality of sets of eigenvectors, each set of eigenvectors being formed from a plurality of prototype vectors representing each class of characters, projecting means for projecting said feature vector onto a set of predetermined multi-dimensional subspaces characterizing the predetermined classes one dimension at a time, the subspaces being in the form of one of said stored sets of eigenvectors wherein each of the subspaces approximates its corresponding prototype vectors in a least mean square root sense, selector means for selecting one of said characters as the presented character according to a predetermined algorithm employing the results of said projections after each projection onto a dimension of the subspace, wherein the improvement comprises: switching means operative to sense said presented pattern as being a switch character within one of said predetermined classes of characters, and in response thereto projecting said feature vector onto the set of predetermined multi-dimensional subspaces containing said switch character.
Claim 7
Dependent Claim
62 words
The apparatus of claim 4 wherein said switching means further comprises: comparator means operative to compare said switch character to a fixed character; a plurality of memories each memory containing a set of vectors characterizing one of said predetermined classes of patterns; and memory switching means responsive to said comparator means operative to connect one of said memories to said projecting means.
Claim 8
Dependent Claim
14 words
The apparatus of claim 5 wherein said memory switching means comprises: a J-K flip-flop.
Claim 9
Independent Claim
125 words
A method for recognizing presented patterns each of which is one of a plurality of predetermined classes of patterns, said method comprising the steps of: generating a predetermined combination of signals each combination representing the geometric configuration of each presented pattern, the present combinations signals defining feature vectors; projecting the feature vectors onto one of a plurality of sets of predetermined multi-dimensional subspaces each set characterizing a particular predetermined class; selecting one of the patterns as the presented pattern according to a predetermined algorithm employing the results of the projections prior to the entire projection process being completed; sensing the existence of a switch character and in response thereto selecting an alternate set of predetermined multi-dimensional subspaces onto which the succeeding feature vectors are projected.
Claim 10
Independent Claim
125 words
A method for recognizing presented patterns each of which is one of a plurality of predetermined classes of patterns, said method comprising the steps of: generating a predetermined combination of signals each combination representing the geometric configuration of each presented pattern, the present combinations signals defining feature vectors; projecting the feature vectors onto one of a plurality of sets of predetermined multi-dimensional subspaces each set characterizing a particular predetermined class; selecting one of the patterns as the presented pattern according to a predetermined algorithm employing the results of the projections prior to the entire projection process being completed; sensing the existence of a switch character and in response thereto selecting an alternate set of predetermined multi-dimensional subspaces onto which the succeeding feature vectors are projected.
Claim 11
Independent Claim
178 words
A method for recognizing presented characters each of which is one of a plurality of predetermined classes of characters, said method comprising the steps of: generating a predetermined combination of signals, each combination representing the geometric configuration of a presented character, the generated combination of signals defining feature vectors; storing a plurality of sets of eigenvectors, each set being formed from a plurality of prototype vectors representing each class of characters; projecting each of the feature vectors onto a set of predetermined multi-dimensional subspaces characterizing the predetermined classes, one dimension at a time, such subspaces being in the form of one of said sets of eigenvectors wherein each of the subspaces approximates its corresponding prototype vectors in a least mean square error sense; selecting one of the characters as the presented character according to a predetermined algorithm employing the results of the projections prior to the entire projection process being completed; sensing the existance of a switch character, and in response thereto selecting an alternate set of predetermined multi-dimensional subspaces onto which the succeeding feature vectors are projected.
Claim 12
Independent Claim
178 words
A method for recognizing presented characters each of which is one of a plurality of predetermined classes of characters, said method comprising the steps of: generating a predetermined combination of signals, each combination representing the geometric configuration of a presented character, the generated combination of signals defining feature vectors; storing a plurality of sets of eigenvectors, each set being formed from a plurality of prototype vectors representing each class of characters; projecting each of the feature vectors onto a set of predetermined multi-dimensional subspaces characterizing the predetermined classes, one dimension at a time, such subspaces being in the form of one of said sets of eigenvectors wherein each of the subspaces approximates its corresponding prototype vectors in a least mean square error sense; selecting one of the characters as the presented character according to a predetermined algorithm employing the results of the projections prior to the entire projection process being completed; sensing the existance of a switch character, and in response thereto selecting an alternate set of predetermined multi-dimensional subspaces onto which the succeeding feature vectors are projected.
References Cited (Backward Citations)
US3167746A
Cited
US3444517A
Cited
US3643069A
Cited
US3578953A
Cited
US3810094A
Cited
US4021777A
Cited
US3964591A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1984-06-15 | 1984-12-15 | 1985-06-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-06-15 | 1988-12-15 | 1989-06-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-06-15 | 1992-12-15 | 1993-06-16 | $7700.00 | Window Closed / Lapsed |