← Back to Patent Explorer
US3930228A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and device for reading characters, preferably digits

Assignee: Government of Netherlands
•
Filing: 1974-02-11
•
Granted: 1975-12-30
•
Expires: 1994-02-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Method and device for reading hand-written characters placed in squares, each serving for one character, which squares border each other and are projected on a matrix. A cameratube serves as scanner of the matrices. The area scanned is larger than the area of the square, which makes it possible to bring about a geometrical separation between the characters that overstep the border lines, of its square resulting in a better recognition of the characters.

Inventors

  • 👤 Arie Adriaan Spanjersberg

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 06:52
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/12; G06V30/14; G06V30/148

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 122 words
A method for reading hand written characters in predetermined squares marked on a document comprising electronically scanning said characters, said system comprising: A. scanning predetermined marginal strips on each side of the border lines of said squares, B. recording the character parts scanned in said strips in an auxiliary memory for processing before transfer to a character processor, C. erasing for a given character those recorded parts which are not connected to said given character in said square inside strip, D. adding those recorded parts of said given character in said strip to said given character which cross the border lines of said square, and E. indicating the presence of more than three separate recorded parts in each said marginal side strip.
Claim 2
Independent Claim 122 words
A method for reading hand written characters in predetermined squares marked on a document comprising electronically scanning said characters, said system comprising: A. scanning predetermined marginal strips on each side of the border lines of said squares, B. recording the character parts scanned in said strips in an auxiliary memory for processing before transfer to a character processor, C. erasing for a given character those recorded parts which are not connected to said given character in said square inside strip, D. adding those recorded parts of said given character in said strip to said given character which cross the border lines of said square, and E. indicating the presence of more than three separate recorded parts in each said marginal side strip.
Claim 3
Dependent Claim 20 words
the joined marks which cross the side of the border line of said square from outside of said square, and
Claim 4
Dependent Claim 20 words
the joined marks which cross the side of the border line of said square from outside of said square, and
Claim 5
Independent Claim 116 words
A method for reading hand written characters in predetermined squares marked on a document comprising electronically scanning said characters, said system comprising: A. scanning predetermined marginal strips on each side of the border lines of said squares, B. recording the character parts scanned in said strips in an auxiliary memory for processing before transfer to a character processor, C. erasing for a given character those recorded parts which are not connected to said given character in said square inside said strip, D. adding those recorded parts of said given character in said strip to said given character which cross the border lines of said square, and E. indicating joined recorded parts which completely cross said strips.
Claim 6
Independent Claim 116 words
A method for reading hand written characters in predetermined squares marked on a document comprising electronically scanning said characters, said system comprising: A. scanning predetermined marginal strips on each side of the border lines of said squares, B. recording the character parts scanned in said strips in an auxiliary memory for processing before transfer to a character processor, C. erasing for a given character those recorded parts which are not connected to said given character in said square inside said strip, D. adding those recorded parts of said given character in said strip to said given character which cross the border lines of said square, and E. indicating joined recorded parts which completely cross said strips.
Claim 7
Dependent Claim 68 words
the joined marks that are not connected outside the said area, D. adding the determined marks detected outside said square to their connecting marks inside said square, E. erasing the determined marks detected inside the area connected to marks outside said square and the detected marks not connected to any marks outside said area, and F. transferring the resulting data from said auxiliary memory to a character processor.
Claim 8
Dependent Claim 68 words
the joined marks that are not connected outside the said area, D. adding the determined marks detected outside said square to their connecting marks inside said square, E. erasing the determined marks detected inside the area connected to marks outside said square and the detected marks not connected to any marks outside said area, and F. transferring the resulting data from said auxiliary memory to a character processor.
Claim 9
Independent Claim 61 words
A method for reading characters in squares on a document comprising: A. electronically scanning predetermined border areas on each side of the border lines of said squares to determine the marks occurring in said areas, B. recording the scanning results from said marks in said areas in an auxiliary memory, C. processing said recorded results from said auxiliary memory to determine:
Claim 10
Independent Claim 61 words
A method for reading characters in squares on a document comprising: A. electronically scanning predetermined border areas on each side of the border lines of said squares to determine the marks occurring in said areas, B. recording the scanning results from said marks in said areas in an auxiliary memory, C. processing said recorded results from said auxiliary memory to determine:
Claim 11
Dependent Claim 10 words
the number of joined marks detected in each area, and
Claim 12
Dependent Claim 10 words
the number of joined marks detected in each area, and
Claim 13
Dependent Claim 19 words
A method according to claim 3 wherein said processing of said recorded results in said auxiliary memory also includes:
Claim 14
Independent Claim 221 words
A system for reading characters written in predetermined squares on a document by electronically scanning said document, said system comprising: A. an auxiliary memory means for recording the parts of characters scanned in predetermined strips on each side of the border lines of said squares, B. shift register meaNs connected to said auxiliary memory means for determining the number of joined parts of said characters recorded in each side strips, C. first logic circuit means connected to said register means for determining the joined parts that cross the border lines of said strips and the border lines of said squares, D. second logic circuit means for erasing the joined character parts that only cross the outside border lines of said strips, E. third logic circuit means for erasing (1) only the joined character parts that cross the border lines of said squares, (2) the parts that cross both the border lines of said square and the outside border lines of said strips, and (3) the joined character parts which cross none of the border lines of said strips and squares in said strips, and F. fourth logic circuit means for adding to the characters the joined character parts in said strips that only cross the inside border lines of said strips and the border lines of said squares in said strips.
Claim 15
Independent Claim 221 words
A system for reading characters written in predetermined squares on a document by electronically scanning said document, said system comprising: A. an auxiliary memory means for recording the parts of characters scanned in predetermined strips on each side of the border lines of said squares, B. shift register meaNs connected to said auxiliary memory means for determining the number of joined parts of said characters recorded in each side strips, C. first logic circuit means connected to said register means for determining the joined parts that cross the border lines of said strips and the border lines of said squares, D. second logic circuit means for erasing the joined character parts that only cross the outside border lines of said strips, E. third logic circuit means for erasing (1) only the joined character parts that cross the border lines of said squares, (2) the parts that cross both the border lines of said square and the outside border lines of said strips, and (3) the joined character parts which cross none of the border lines of said strips and squares in said strips, and F. fourth logic circuit means for adding to the characters the joined character parts in said strips that only cross the inside border lines of said strips and the border lines of said squares in said strips.
Claim 16
Dependent Claim 33 words
the joined marks which completely traverse said area, and G. indicating the present of more than three joined marks in each area and the presence of a mark that completely traverses said area.
Claim 17
Dependent Claim 33 words
the joined marks which completely traverse said area, and G. indicating the present of more than three joined marks in each area and the presence of a mark that completely traverses said area.
Claim 18
Dependent Claim 28 words
A system according to claim 5 including counter means for indicating more than three separate joined character parts in any one side border strip for a given character.
Claim 19
Dependent Claim 28 words
A system according to claim 5 including means for indicating joined character parts that cross both border lines of said strips and the border lines of said squares.
Claim 20
Independent Claim 296 words
A system for reading characters written in predetermined squares on a document by electronically scanning said document, said system comprising: A. an auxiliary memory for temporarily storing the information of predetermined marginal strips m-steps long vertically and n-steps wide horizontally, which strips extend on each side of each border line of said squares, B. two cascaded circuits connected to said auxiliary memory for m-steps along the vertical and n-steps along the horizontal lines of each of said marginal strips, C. a cycle counter connected to said n-step cascaded circuit for counting five cycles during the first of which cycles said m and n-steps are read into said auxiliary memory, D. an m-bit shift register connected to said auxiliary memory for detecting character parts in said marginal strips during the second cycle of said cycle counter, E. a counter connected to said m-bit shift register for indicating the number of character parts detected in said marginal strips during the scanning of the border line of said strips inside said squares, operated during said third cycle of said cycle counter, which cycle counter is restored to normal after each n-steps by connection to said cycle counter, F. first logic circuit means connected to said auxiliary memory, said cycle counter, and said n-step cascaded circuits for erasing certain of said character parts from said auxiliary memory during the fourth cycle of said cycle counter, and G. second logic circuit means connected to said auxiliary memory and said first logic circuit means for adding certain of said character marks to marks already in said auxiliary memory during the fourth cycle of said cycle counter, and H. means connected to said cycle counter for transferring the resulting processed information from said auxiliary memory to the memory of a character processing circuit.
Claim 21
Independent Claim 296 words
A system for reading characters written in predetermined squares on a document by electronically scanning said document, said system comprising: A. an auxiliary memory for temporarily storing the information of predetermined marginal strips m-steps long vertically and n-steps wide horizontally, which strips extend on each side of each border line of said squares, B. two cascaded circuits connected to said auxiliary memory for m-steps along the vertical and n-steps along the horizontal lines of each of said marginal strips, C. a cycle counter connected to said n-step cascaded circuit for counting five cycles during the first of which cycles said m and n-steps are read into said auxiliary memory, D. an m-bit shift register connected to said auxiliary memory for detecting character parts in said marginal strips during the second cycle of said cycle counter, E. a counter connected to said m-bit shift register for indicating the number of character parts detected in said marginal strips during the scanning of the border line of said strips inside said squares, operated during said third cycle of said cycle counter, which cycle counter is restored to normal after each n-steps by connection to said cycle counter, F. first logic circuit means connected to said auxiliary memory, said cycle counter, and said n-step cascaded circuits for erasing certain of said character parts from said auxiliary memory during the fourth cycle of said cycle counter, and G. second logic circuit means connected to said auxiliary memory and said first logic circuit means for adding certain of said character marks to marks already in said auxiliary memory during the fourth cycle of said cycle counter, and H. means connected to said cycle counter for transferring the resulting processed information from said auxiliary memory to the memory of a character processing circuit.

References Cited (Backward Citations)

US3264608A Cited
US3517387A Cited
US3587047A Cited
US3694807A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1978-12-29 1979-06-30 1979-12-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1982-12-29 1983-06-30 1983-12-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1986-12-29 1987-06-30 1987-12-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag