§
Luxuse
Patent Intelligence
Sign In
← Back to Patent Explorer
EP0166271A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Recognition system for run-on handwriting

Assignee: International Business Machines Corp
•
Filing: 1985-06-03
•
Granted: —
•
Expires: 2005-06-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of processing a word with the segmentation and recognition steps combined into an overall scheme. This is accomplished by a three step procedure. First, potential or trial segmentation points are derived. This is done in a manner so as to ensure that essentially all true segmentation points are present but also includes extra or not true segmentation points. Second, all combinations of the segments that could reasonably be a character are sent to a character recognizer to obtain ranked choices and corresponding scores. Finally, the recognition results are sorted and combined so that the character sequences having the best cumulative scores are obtained as the best word choices. For a particular word choice there is a corresponding character segmentation, simply the segment combinations that resulted in the chosen characters. With this recognition scheme the initial character segmentation is not final and need not be highly accurate, but is subject to a lesser constraint of containing the true segmentation points.

Inventors

  • 👤 Charles Carson Tappert

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-03 21:31
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/10; G06V30/00; G06V30/10; G06V30/14; G06V30/148; G06V30/153

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 91 words
A method of recognizing handwritten characters that may touch or overlap each other characterized by the steps of: (a) initializing an index of the current segmentation point; (b) receiving a stroke of handwritten character and incrementing said index or terminating said method when no further strokes exist to be processed. (c) examining recognitions on stroke sequences ending at the segmentation point corresponding to said index; (d) grading the results of said recognition examination to rank potential character choices; and (e) repeating steps (b) through (f) until all strokes have been processed.
Claim 2
Independent Claim 91 words
A method of recognizing handwritten characters that may touch or overlap each other characterized by the steps of: (a) initializing an index of the current segmentation point; (b) receiving a stroke of handwritten character and incrementing said index or terminating said method when no further strokes exist to be processed. (c) examining recognitions on stroke sequences ending at the segmentation point corresponding to said index; (d) grading the results of said recognition examination to rank potential character choices; and (e) repeating steps (b) through (f) until all strokes have been processed.
Claim 3
Dependent Claim 187 words
A recognition method of Claim 1 wherein said step of examining recognitions comprises the steps of: (c i ) determining the maximum number of strokes of a character in the alphabet to be recognized; (c ii ) setting a register of the number of strokes to be examined by a recognizer; ( c iii ) comparing the contents of said register with the maximum number of strokes and terminating at the recognition examination when said register exceeds the maximum number of strokes; ( c iv ) when said register contents are less than the maximum number of strokes, performing recognition examination on a sequence of strokes corresponding to the contents of said register and ending in the stroke corresponding to the stroke of the segmentation point corresponding to the contents the contents of said index; (c v ) storing candidate characters and scores obtained during recognition examination; and ( c vi ) incrementing said register of the number of strokes to be examined; and repeating steps (c i ) through (c vi ) until all stroke sequences up to the maximum number of strokes have been examined.
Claim 4
Dependent Claim 89 words
A recognition method of Claim 2 wherein the step of grading the results of said recognition examination comprise the steps of: setting a counter of the number of strokes sent to the recognizer; comparing the contents of said counter with the maximum number of strokes and ter- . minating the grading when said counter exceeds the maximum number of strokes; and when said counter contents are less than the maximum number of strokes assembling a list of recognition choices and ranking by recognition choice sources corresponding to graded results.
Claim 5
Dependent Claim 123 words
A recognition method as in Claim 3 wherein the step of assembling a list of recognition choices comprises initializing a choice index, incrementing said choice index, determining whether the contents of the choice index exceed a maximum number of choices to be listed and whether the recognition choice score exceeds a reject threshold; if the recognition choice score exceeds said reject threshold and the maximum number of choices has not been exceeded creating a new recognition choice and inserting it into the list by increasing score 1 returning to the step incrementing said choice index; and if the recognition score does not exceed said reject threshold and the maximum number of choices has been exceeded, processing the next sequence of strokes for grading.
Claim 6
Dependent Claim 33 words
A recognition method as in Claim 3 further comprising the step of comparing the recognition choices with a list of acceptable character strings; and eliminating recognition choices having no corresponding acceptable character string.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag