Classifying a string formed from a known number of hand-written characters

• US 8,000,531 B2
• Filed: 12/22/2010
• Issued: 08/16/2011
• Est. Priority Date: 10/15/2001
• Status: Expired due to Fees

• Current Assignee: Silverbrook Research Pty Limited
• Original Assignee: Silverbrook Research Pty Limited
• Inventors: Napper, Jonathon Leigh
• Primary Examiner(s): Ahmed; Samir A
• Assistant Examiner(s): Rashidian; Mehdi
• Application Number:
  US12/976,324
• Publication Number:
  US 20110091110A1
• Time in Patent Office: 237 Days
• Field of Search: 382/159, 382/164, 382/171, 382/173, 382/177, 382/179, 382/181, 382185-187, 382/216, 382226-228, 382/259, 382/300, 382202-203, 382/209, 382/213, 382/224
• US Class Current: 382/186
• CPC Class Codes: G06F 18/254 of classification results, e.g. of results related to same input data
• CPC Class Codes: G06V 30/10 Character recognition
• CPC Class Codes: G06V 30/2272 with lexical matching
• CPC Class Codes: G06V 30/268 Lexical context

Abstract

A method of classifying a character string formed from a known number of hand-written characters is disclosed. The method starts by determining character probabilities for each hand-written character in the character string. Each character probability represents a likelihood of the respective hand-written character being a respective one of a plurality of predetermined characters. Each predetermined character has a respective character type. Character templates having the known number of characters are next identified. Each character template has a respective predetermined probability and represents a respective combination of character types. Character sequence probabilities corresponding to each of the character templates having the known number of characters are next determined. The character sequence probabilities are a function of the predetermined probability of the respective character template and the character probabilities of the hand-written character in the character string. The character string is classified as the sequence of characters having the highest character sequence probability.

Claims

1. A method of classifying a character string formed from a known number of hand-written characters, said method comprising the steps of:

determining by a processor character probabilities for each hand-written character in the character string, each character probability representing a likelihood of the respective hand-written character being a respective one of a plurality of predetermined characters, each predetermined character has a respective character type;

identifying by the processor character templates having the known number of characters, each character template having a respective predetermined probability and representing a respective combination of character types;

determining by the processor character sequence probabilities corresponding to each of the character templates having the known number of characters, the character sequence probabilities being a function of the predetermined probability of the respective character template and the character probabilities of the hand-written character in the character string; and

classifying by the processor the character string as the sequence of characters having the highest character sequence probability.

2. The method of claim 1, wherein the function is of the predetermined probability of the respective character template and the character probabilities having character types corresponding to the combination of character types represented by the respective character template.

3. The method of claim 1, wherein the function is of the predetermined probability of the respective character template and the highest character probabilities having character types corresponding to the combination of character types represented by the respective character template.

4. The method of claim 1, wherein the character types include digits, letters, and punctuation marks.

5. The method of claim 1, wherein the template probability is determined by statistical analysis of a text corpus.