Patent US4876735A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4876735A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for character recognition systems

Assignee: International Business Machines Corp
•
Filing: 1987-12-18
•
Granted: 1989-10-24
•
Expires: 2007-12-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention employs a method of choosing between the output of two different character recognition systems to improve the rate at which characters are recognized, without significantly increasing the number of undetected substitution errors. If the first recognition system cannot recognize a character, a random probability generator is used to determine whether to use the output of the second recognition system, or alternatively to generate a reject character.

Inventors

  • 👤 William C. Martin
  • 👤 Gene D. Rohrer

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 19:59
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/98; G06F; G06F18/00; G06F18/20; G06F18/25; G06F18/254; G06V10/70; G06V10/77; G06V10/80; G06V10/809

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 215 words
A document reading machine comprising a first character reading system mounted for reading characters on documents; a second character reading system also mounted for reading said characters on said documents; first character recognition logic for recognizing characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value from 0 to 1; and means for adjustably setting the value within the range said probability p within the range of from 0 to 1.
Claim 2
Dependent Claim 215 words
A document reading machine comprising a first character reading system mounted for reading characters on documents; a second character reading system also mounted for reading said characters on said documents; first character recognition logic for recognizing characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value from 0 to 1; and means for adjustably setting the value within the range said probability p within the range of from 0 to 1.
Claim 3
Dependent Claim 36 words
The document reading machine of claim 1 wherein said means for adjustably setting the value of said probability includes means for manually entering a value for said probability p within the range of 0 to 1.
Claim 4
Dependent Claim 55 words
The document reading machine of claim 1 wherein said means for setting the value of said probability comprises control means for monitoring the rate that reject characters are generated by said first logic while characters are read from said documents, and for decreasing said probability p in response to a predetermined increase in said rate.
Claim 5
Dependent Claim 36 words
The document reading machine of claim 3, wherein said control means initially sets said probability p at one and does not begin to decrease said probability p until said rate has exceeded a first predetermined value.
Claim 6
Dependent Claim 26 words
The document reading machine of claim 4, wherein said control means sets said probability p at zero when said rate has exceeded a second predetermined value.
Claim 7
Dependent Claim 280 words
A document reading machine comprising a document transport for moving a plurality of documents encoded with magnetic ink characters from a document hopper to a document stacker, a first character reading system, including an AC magnetic ink character read head, mounted adjacent said transport for reading the magnetic characters on the documents being transported by said transport; a second character reading system, including a DC magnetic ink character read head, mounted adjacent said transport between said first system and said stacker for also reading said magnetic characters on said documents; first character recognition logic for recognizing magnetic ink characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing magnetic ink characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and means for adjustably setting the value of said probability p within the range of from 0 to 1.
Claim 8
Dependent Claim 280 words
A document reading machine comprising a document transport for moving a plurality of documents encoded with magnetic ink characters from a document hopper to a document stacker, a first character reading system, including an AC magnetic ink character read head, mounted adjacent said transport for reading the magnetic characters on the documents being transported by said transport; a second character reading system, including a DC magnetic ink character read head, mounted adjacent said transport between said first system and said stacker for also reading said magnetic characters on said documents; first character recognition logic for recognizing magnetic ink characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing magnetic ink characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and means for adjustably setting the value of said probability p within the range of from 0 to 1.
Claim 9
Independent Claim 120 words
A method for reading characters on documents, in which the characters are read by first and second characters reading systems associated respectively with first and second recognition systems which either recognize the character or generate a reject character when a character cannot be recognized, and wherein periodically an undetected error is created by recognizing a character incorrectly when a reject character should have been generated, the improvement which comprises substantially randomly choosing with a probability of p as the character most accurately representing a character on the document, said character generated by said second recognition system when the first recognition system generates a reject character, where p is a probability which is adjustable within the range from 0 to 1.
Claim 10
Independent Claim 120 words
A method for reading characters on documents, in which the characters are read by first and second characters reading systems associated respectively with first and second recognition systems which either recognize the character or generate a reject character when a character cannot be recognized, and wherein periodically an undetected error is created by recognizing a character incorrectly when a reject character should have been generated, the improvement which comprises substantially randomly choosing with a probability of p as the character most accurately representing a character on the document, said character generated by said second recognition system when the first recognition system generates a reject character, where p is a probability which is adjustable within the range from 0 to 1.
Claim 11
Dependent Claim 227 words
A document reading machine comprising a first character reading system mounted by reading characters on documents; a second character reading system also mounted for reading said character on said documents; first character recognition logic for recognizing characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and control means responsive to a change in the rate of generation of reject characters by said first and second recognition logic for altering the value of said probability p.
Claim 12
Dependent Claim 227 words
A document reading machine comprising a first character reading system mounted by reading characters on documents; a second character reading system also mounted for reading said character on said documents; first character recognition logic for recognizing characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and control means responsive to a change in the rate of generation of reject characters by said first and second recognition logic for altering the value of said probability p.
Claim 13
Dependent Claim 291 words
A document reading machine comprising a document transport for moving a plurality of documents encoded with magnetic ink characters from a document hopper to a document stacker, a first character reading system, including an AC magnetic ink character rear head, mounted adjacent said transport for reading the magnetic characters on the documents being transported by said transport; a second character reading system, including a DC magnetic ink character read head, mounted adjacent said transport between said first system and said stacker for also reading said magnetic characters on said documents; first character recognition logic for recognizing magnetic ink characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing magnetic ink characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and control means responsive to a change in the rate of generation of reject characters by said first or second recognition logic for altering the value of said probability p.
Claim 14
Dependent Claim 291 words
A document reading machine comprising a document transport for moving a plurality of documents encoded with magnetic ink characters from a document hopper to a document stacker, a first character reading system, including an AC magnetic ink character rear head, mounted adjacent said transport for reading the magnetic characters on the documents being transported by said transport; a second character reading system, including a DC magnetic ink character read head, mounted adjacent said transport between said first system and said stacker for also reading said magnetic characters on said documents; first character recognition logic for recognizing magnetic ink characters read by first system and generating a reject character when a character cannot be recognized, said first logic periodically creating a first undetected error by recognizing a character when a reject character should have been generated; second character recognition logic for recognizing magnetic ink characters read by said second system and generating said reject character when a character cannot be recognized, said second logic periodically creating a second undetected error by recognizing a character when said reject character should have been generated; decision logic for choosing one of: a character recognized by said first logic, said reject character, and a character recognized by said second logic, as the character most accurately representing a character on said document; and said decision logic including means for substantially randomly choosing with a probability of p, said character generated by said second logic when said first logic generates said reject character, where p is a probability having a value within the range from 0 to 1; and control means responsive to a change in the rate of generation of reject characters by said first or second recognition logic for altering the value of said probability p.
Claim 15
Independent Claim 136 words
A method for reading characters on documents, in which the characters are read by first and second character reading systems associated respectively with first and second recognition systems which either recognize the character or generate a reject character when a character cannot be recognized, and wherein periodically an undetected error is created by recognizing a character incorrectly when a reject character should have been generated, the improvement which comprises substantially randomly choosing as the character most accurately representing a character on the document, said character generated by said second recognition system when the first recognition system generates a reject character and varying the probability within the range from 0 to 1 to randomly choose the character generated by said second recognition system in response to a change in the reject rate of said first recognition system.
Claim 16
Independent Claim 136 words
A method for reading characters on documents, in which the characters are read by first and second character reading systems associated respectively with first and second recognition systems which either recognize the character or generate a reject character when a character cannot be recognized, and wherein periodically an undetected error is created by recognizing a character incorrectly when a reject character should have been generated, the improvement which comprises substantially randomly choosing as the character most accurately representing a character on the document, said character generated by said second recognition system when the first recognition system generates a reject character and varying the probability within the range from 0 to 1 to randomly choose the character generated by said second recognition system in response to a change in the reject rate of said first recognition system.

References Cited (Backward Citations)

US31692A Cited
US3641495A Cited
US3496543A Cited
USRE31692E Cited
US3876981A Cited
US3938089A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-10-23 1993-04-24 1993-10-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-10-23 1997-04-24 1997-10-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-10-23 2001-04-24 2001-10-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag