US4415880A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character recognition method and apparatus
Assignee: Texas Instruments Inc
•
Filing: 1980-01-28
•
Granted: 1983-11-15
•
Expires: 2000-01-28
Abstract
Abstract A character recognition circuit is provided with the image of unknown characters, in an accessible memory. A microprocessor directs a microcontroller to access the memory and to perform pixel counting, transition recognition and pattern finding. The microprocessor directs such operations and effectively locates lines of unknown characters, deskews those lines if necessary, roughly identifies each unknown character by forming a window around the character and counting pixels inwardly from the top and bottom and from each side until a transition is reached from white (0) to black (1), and from that information as weighted and combined, categorizing the unknown character to be of a particular set of known characters. By comparing the unknown character with the possible known characters, the unknown character is positively identified and stored in a random access memory until the entire message is assembled. Then the message is sent to a buffer unit for ultimate transmission.
Inventors
- 👤 Warner C. Scott
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 16:02
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/20; G06V10/24; G06V10/30; G06V10/34; G06V10/40
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
161 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermining rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (e) combining the sums; (f) categorizing the combination; (g) identifying the possible characters from the categorization; and (h) comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 2
Independent Claim
161 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermining rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (e) combining the sums; (f) categorizing the combination; (g) identifying the possible characters from the categorization; and (h) comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 3
Independent Claim
195 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predeterined rows, and from top and bottom of the window for predetermined columns until a transistion from white (0) to black (1) occurs; (d) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (e) forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window; (f) combining the sums; (g) categorizing the combination; (h) identifying the possible characters from the categorization; and (i) comparing the possible characters from the categorization with the unknown character unitl a match is made.
Claim 4
Independent Claim
195 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predeterined rows, and from top and bottom of the window for predetermined columns until a transistion from white (0) to black (1) occurs; (d) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (e) forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window; (f) combining the sums; (g) categorizing the combination; (h) identifying the possible characters from the categorization; and (i) comparing the possible characters from the categorization with the unknown character unitl a match is made.
Claim 5
Independent Claim
165 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermined rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) counting white pixels following a transition from white to black to white until a transition from white to black occurs; (e) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (f) combining the sums; (g) categorizing the combination; and (h) identifying the possible characters from the categorization.
Claim 6
Independent Claim
165 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermined rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) counting white pixels following a transition from white to black to white until a transition from white to black occurs; (e) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (f) combining the sums; (g) categorizing the combination; and (h) identifying the possible characters from the categorization.
Claim 7
Independent Claim
199 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermined rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) counting white pixels following a transition from white to black to white until a transition from white to black occurs; (e) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (f) forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window; (g) combining the sums; (h) categorizing the combination; and (i) identifying the possible characters from the categorization.
Claim 8
Independent Claim
199 words
A method of character recognition of a character from a memory means arranged in columns and rows of pixels, comprising the steps of: (a) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (b) assigning a weight number to each pixel within the window; (c) penetrating the window by counting pixels inwardly from each side for predetermined rows, and from top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (d) counting white pixels following a transition from white to black to white until a transition from white to black occurs; (e) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side and from top and bottom of the window; (f) forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window; (g) combining the sums; (h) categorizing the combination; and (i) identifying the possible characters from the categorization.
Claim 9
Dependent Claim
29 words
The method of claim 4 including the further step, after step (g), of comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 10
Independent Claim
200 words
A method of character recognition of a plurality of parallel lines of unknown characters from a memory means arranged in columns and rows of pixels comprising the steps of: (a) locating the first line of unknown characters; (b) determining the skew of the line; (c) deskewing the line; (d) locating the first unknown character in the line; (e) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (f) assigning a weight number to each pixel within the window; (g) penetrating the window by counting pixels inwardly from each side for predetermined rows, and top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (h) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side, and from top and bottom of the window; (j) combining the sums; (k) categorizing the combination; (l) identifying the possible characters from the categorization; (m) locating the next unknown character in the line; and (n) repeating steps (e) through (m) through the last unknown character in the line.
Claim 11
Independent Claim
200 words
A method of character recognition of a plurality of parallel lines of unknown characters from a memory means arranged in columns and rows of pixels comprising the steps of: (a) locating the first line of unknown characters; (b) determining the skew of the line; (c) deskewing the line; (d) locating the first unknown character in the line; (e) forming a window around an unknown character, the window being defined by the memory addresses of at least two of the corners; (f) assigning a weight number to each pixel within the window; (g) penetrating the window by counting pixels inwardly from each side for predetermined rows, and top and bottom of the window for predetermined columns until a transition from white (0) to black (1) occurs; (h) summing the white pixel weight numbers for each penetration until the transition occurs to form a sum for the total number of penetrations from each side, and from top and bottom of the window; (j) combining the sums; (k) categorizing the combination; (l) identifying the possible characters from the categorization; (m) locating the next unknown character in the line; and (n) repeating steps (e) through (m) through the last unknown character in the line.
Claim 12
Dependent Claim
35 words
The method of claim 6 including the further steps, after step (n), of: (o) locating the next line of unknown characters; and (p) repeating steps (c) through (n) through the last line of unknown characters.
Claim 13
Dependent Claim
46 words
The method of claim 7 including the further step, after step (h) of forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window.
Claim 14
Dependent Claim
29 words
The method of claim 8 including the further step, after step (l) of comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 15
Dependent Claim
33 words
The method of claim 9 including the further step, after step (g) of counting white pixels following a transition from white to black to white until a transition from white to black occurs.
Claim 16
Dependent Claim
29 words
The method of claim 7, including the further step, after step (l) of comparing the possible character from the categorization with the unknown character until a match is made.
Claim 17
Dependent Claim
33 words
The method of claim 7 including the further step, after step (g) of counting white pixels following a transition from white to black to white until a transition from white to black occurs.
Claim 18
Dependent Claim
46 words
The method of claim 6 including the further step, after step (h) of forming a sum for the upper and lower portion of each side of the window, and forming a sum for the left and right portion of the top and bottom of the window.
Claim 19
Dependent Claim
29 words
The method of claim 10 including the further step, after step (l) of comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 20
Dependent Claim
32 words
The method of claim 14 including the further step, after step (g) of counting white pixels following a transition from white to-black to white until a transition from white to black occurs.
Claim 21
Dependent Claim
29 words
The method of claim 6 including the further step, after step (l) of comparing the possible characters from the categorization with the unknown character until a match is made.
Claim 22
Dependent Claim
33 words
The method of claim 6 including the further step, after step (g) of counting white pixels following a transition from white to black to white until a transition from white to black occurs.
References Cited (Backward Citations)
US3781799A
Cited
US3967243A
Cited
US4153897A
Cited
US4138662A
Cited
US4130819A
Cited
US4120049A
Cited
US4122443A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-11-14 | 1987-05-16 | 1987-11-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-11-14 | 1991-05-16 | 1991-11-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-11-14 | 1995-05-16 | 1995-11-15 | $7700.00 | Window Closed / Lapsed |