Patent US3699536A successfully refreshed from Google Patents.
US3699536A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Low cost raster scanned data consolidation
Assignee: International Business Machines Corp
•
Filing: 1971-06-28
•
Granted: 1972-10-17
•
Expires: 1991-06-28
Abstract
Abstract Data representing a character received from a raster scanner is simultaneously stored in a serial memory and presented to character dimension and location determining logic. After all of the data representing the character has been stored, the character dimension and location information is converted to an address for retrieving a data consolidation mask from a memory containing a plurality of masks. The data consolidation mask is stored in a second serial memory. The first serial memory and the second serial memory are recycled in synchronism to allow the contents of each to sequentially be presented to logic gates which compare the data in the first memory with the mask in the second memory to generate consolidated data representing the character.
Inventors
- 👤 David C Roberts
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 23:34
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/16; G06V30/166
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
122 words
A method for consolidating the amount of data from a raster scanned area without sacrificing recognition reliability comprising the steps of: a. scanning the area including a character to be recognized; b. serially storing binary data detected from said area in a first serial memory; c. accumulating character dimension and location information while said area is being scanned; d. choosing a data consolidation mask from a plurality to data consolidation masks from a memory; said choice being determined by said dimension and location information and storing said mask in a second serial memory; e. recycling said first serial memory in synchronism with said second serial memory to sequentially present said data and said mask to logic circuitry for consolidation of said data.
Claim 2
Independent Claim
122 words
A method for consolidating the amount of data from a raster scanned area without sacrificing recognition reliability comprising the steps of: a. scanning the area including a character to be recognized; b. serially storing binary data detected from said area in a first serial memory; c. accumulating character dimension and location information while said area is being scanned; d. choosing a data consolidation mask from a plurality to data consolidation masks from a memory; said choice being determined by said dimension and location information and storing said mask in a second serial memory; e. recycling said first serial memory in synchronism with said second serial memory to sequentially present said data and said mask to logic circuitry for consolidation of said data.
Claim 3
Dependent Claim
80 words
The method of claim 1 further comprising the steps of: f. transmitting said consolidated binary data to a recognition means; g. receiving an instruction from said recognition means when an ambiguity is detected by said recognition means; h. choosing a different data consolidation mask from said plurality of data consolidation masks under control of said instruction and said dimension and location information and storing said different data consolidation mask in said second serial memory; i. repeating steps (e) and (f).
Claim 4
Dependent Claim
33 words
The method of claim 2 wherein said serially storing step is accomplished at the document scanning rate; and wherein said recycling step is accomplished at a calculation rate different from said scanning rate.
Claim 5
Dependent Claim
33 words
The method of claim 1 wherein said serially storing step is accomplished at the document scanning rate; and wherein said recycling step is accomplished at a calculation rate different from said scanning rate.
Claim 6
Independent Claim
215 words
A method for consolidating the amount of data from a raster scanned area without sacrificing recognition reliability comprising the steps of: a. scanning the area including a character to be recognized; b. filtering the binary data detected from said character for removing noise information therefrom; c. detecting a logical combination of one bits in said binary data indicating the presence of a character; d. storing a work mark in a first serial memory; e. serially storing binary data representing said scanned character in said first serial memory following the location of said word mark in said first serial meMory; f. accumulating character dimension and location information while said area is being scanned; g. addressing a data consolidation mask from a plurality of data consolidation masks from a memory under control of said dimension and location information and storing said mask in a second serial memory; h. recycling said first serial memory until said word mark is detected; i. recycling said second serial memory in synchronism with said first serial memory when said location information indicates that said first serial memory has been recycled past said word mark thereby indicating that binary data detected from said character in said first serial memory is in alignment with said data consolidation mask stored in said second serial memory.
Claim 7
Independent Claim
215 words
A method for consolidating the amount of data from a raster scanned area without sacrificing recognition reliability comprising the steps of: a. scanning the area including a character to be recognized; b. filtering the binary data detected from said character for removing noise information therefrom; c. detecting a logical combination of one bits in said binary data indicating the presence of a character; d. storing a work mark in a first serial memory; e. serially storing binary data representing said scanned character in said first serial memory following the location of said word mark in said first serial meMory; f. accumulating character dimension and location information while said area is being scanned; g. addressing a data consolidation mask from a plurality of data consolidation masks from a memory under control of said dimension and location information and storing said mask in a second serial memory; h. recycling said first serial memory until said word mark is detected; i. recycling said second serial memory in synchronism with said first serial memory when said location information indicates that said first serial memory has been recycled past said word mark thereby indicating that binary data detected from said character in said first serial memory is in alignment with said data consolidation mask stored in said second serial memory.
Claim 8
Dependent Claim
171 words
Apparatus for consolidating data from a raster scanner without sacrificing recognition reliability comprising: scanning means for scanning an area including a character to be recognized; first serial memory means connected to said scanning means for serially storing binary data representing said character; accumulating means connected to said scanning means for accumulating information representing the width, vertical location, and height of said character; addressing means connected to said accumulation means for covering said width, location, and height information into an address; memory means connected to said addressing means; said memory means having a data consolidation mask stored at an address generated by said addressing means; second serial memory means connected to said memory means for receiving said data consolidation mask from said memory means; data consolidation means connected to said first serial memory means and to second serial means for comparing the binary data stored in said first serial number means with said mask stored in said second serial memory means and providing an output of consolidated binary data representing said character.
Claim 9
Dependent Claim
171 words
Apparatus for consolidating data from a raster scanner without sacrificing recognition reliability comprising: scanning means for scanning an area including a character to be recognized; first serial memory means connected to said scanning means for serially storing binary data representing said character; accumulating means connected to said scanning means for accumulating information representing the width, vertical location, and height of said character; addressing means connected to said accumulation means for covering said width, location, and height information into an address; memory means connected to said addressing means; said memory means having a data consolidation mask stored at an address generated by said addressing means; second serial memory means connected to said memory means for receiving said data consolidation mask from said memory means; data consolidation means connected to said first serial memory means and to second serial means for comparing the binary data stored in said first serial number means with said mask stored in said second serial memory means and providing an output of consolidated binary data representing said character.
Claim 10
Dependent Claim
71 words
The apparatus of claim 6 further comprising control means responsive to instructions from a character recognition means, said control means being connected to said scanning means, said first serial memory means, said accumulation means, and said addressing means for initiating the scan of said character on a document, and for altering the address generated by said addressing means, thereby causing a different data consolidation mask to be retrieved from said memory.
Claim 11
Dependent Claim
28 words
The apparatus of claim 6, wherein said scanning means includes a filter means for removing extraneous data bits from binary data representing information from said area being scanned.
References Cited (Backward Citations)
US3264608A
Cited
US3189873A
Cited
US3243776A
Cited
US3263216A
Cited
US3543238A
Cited
US3582898A
Cited
US3581281A
Cited
US3613082A
Cited
US3573730A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1975-10-17 | 1976-04-17 | 1976-10-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-10-17 | 1980-04-17 | 1980-10-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-10-17 | 1984-04-17 | 1984-10-17 | $7700.00 | Window Closed / Lapsed |