Handwriting Identification Method, Program And Electronic Device

• US 20100104189A1
• Filed: 12/10/2008
• Published: 04/29/2010
• Est. Priority Date: 10/23/2008
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: ARAVAMUDHAN, Bharath, Madhvanath, Sriganesh
• Application Number:
  US12/331,458
• Publication Number:
  US 20100104189A1
• Time in Patent Office: Days
• US Class Current: 382/187
• CPC Class Codes: G06V 30/36 Matching; Classification

Abstract

A method of identifying at least one handwritten character composed of at least one stroke is disclosed. The method comprises providing a database comprising a plurality of sequences of strokes, the strokes of each sequence defining at least one character, at least some of said sequences comprising a plurality of strokes; capturing a string of handwritten characters, said string comprising the at least one handwritten character; and matching at least a part of the string with a sequence from said plurality of sequences. This method enables the recognition of multi-stroke characters where the positions of the strokes relative to each other are unknown or at least unreliable. A computer program product implementing this method and an electronic device comprising this computer program product are also disclosed.

Claims

1. A method of identifying at least one handwritten character composed of at least one stroke, the method comprising:

providing a database comprising a plurality of sequences of strokes, the strokes of each sequence defining at least one character, at least some of said sequences comprising a plurality of strokes;

capturing a string of handwritten characters, said string comprising the at least one handwritten character; and

matching at least a part of the string with a sequence from said plurality of sequences.

2. The method of claim 1, wherein the string comprises at least two strokes, and wherein the exact positions of the at least two strokes relative to each other are unknown.

3. The method of claim 2, further comprising translating each stroke of the string to a predefined reference prior to said matching step.

4. The method of claim 2 or 3, further comprising normalizing the sizes of the respective strokes prior to said matching step.

5. The method of claim 1, further comprising matching the string with at least two sequences from said database and selecting one of the at least two sequences by analyzing the context of the string.

6. The method of claim 1, further comprising matching the string with at least two sequences from said database, providing the writer with a list comprising the characters corresponding to the at least two sequences, and selecting one sequence based on feedback received from the writer.

7. The method of claim 1, wherein each stroke in said sequences is represented by stroke feature information, and wherein said capturing step further comprises extracting stroke feature information from the at least one stroke in said string.

8. A computer program product for identifying at least one handwritten character composed of at least one stroke, the computer program product comprising a database comprising a plurality of sequences of strokes, the strokes of each sequence defining at least one character, at least some of said sequences comprising a plurality of strokes, said computer program product being arranged to, when executed on a computer, perform the steps of:

capturing a string of handwritten characters, said string comprising the at least one handwritten character; and

matching at least a part of the string with a sequence from said plurality of sequences.

9. The computer program product of claim 8, wherein the string comprises at least two strokes, and wherein the exact positions of the at least two strokes relative to each other are unknown.

10. The computer program product of claim 9, further being arranged to perform the step of translating each stroke of the string to a predefined origin prior to said matching step.

11. The computer program product of claim 9 or 10, further being arranged to perform the step of normalizing the sizes of the respective strokes prior to said matching step.

12. The computer program product of claim 8, further being arranged to match the string with at least two sequences from said database and select one of the at least two sequences by analyzing the context of the string.

13. The computer program product of claim 8, further being arranged to match the string with at least two sequences from said database, provide the writer with a list comprising the characters corresponding to the at least two sequences, and select one sequence based on feedback received from the writer.

14. The computer program product of claim 8, wherein each stroke in said sequences is represented by stroke feature information, and wherein said capturing step further comprises extracting stroke feature information from the at least one stroke in said string.

15. An electronic device comprising the computer program product of claim 8, a processor for executing the computer program product and an input device for monitoring the writing of a character comprising at least one stroke, the input device being arranged to provide the processor with said monitoring result.