Using edges and corners for character input
First Claim
1. A character recognition method, comprising:
- using a processor to perform the following method;
queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area;
searching the queued continuous path data to generate a sequence of corner hits, where a corner hit corresponds to a corner defined by said geometric shape;
identifying a character based on said sequence of corner hits independently of the remainder of the continuous path data;
wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode; and
identifying a letter character as being upper case when said stroke representative of said character ends in a common predetermined corner and lower case when said stroke does not end in said common predetermined corner.
2 Assignments
0 Petitions
Accused Products
Abstract
A new unistroke text entry method for handheld or wearable devices is designed to provide high accuracy and stability of motion. The user makes characters by traversing the edges and diagonals of a geometric pattern, e.g. a square, imposed over the usual text input area. Gesture recognition is accomplished not through pattern recognition but through the sequence of corners that are hit. This means that the full stroke path is unimportant and the recognition is highly deterministic, enabling better accuracy than other gestural alphabets. This input technique works well using a template with a square hole placed over a touch-sensitive surface, such as on a Personal Digital Assistant (PDA), and with a square boundary surrounding a joystick, which might be used on a cell-phone or game controller. Another feature of the input technique is that capital letters are made by ending the stroke in a particular corner, rather than through a mode change as in other gestural input techniques. Because of the rules governing abstracts, this abstract should not be used to construe the claims.
-
Citations
60 Claims
-
1. A character recognition method, comprising:
-
using a processor to perform the following method; queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area; searching the queued continuous path data to generate a sequence of corner hits, where a corner hit corresponds to a corner defined by said geometric shape; identifying a character based on said sequence of corner hits independently of the remainder of the continuous path data; wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode; and identifying a letter character as being upper case when said stroke representative of said character ends in a common predetermined corner and lower case when said stroke does not end in said common predetermined corner. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A letter character recognition method, comprising:
-
using a processor to perform the following method; queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area; searching the queued continuous path data to generate a sequence of corner hits within a single unistroke, where a corner hit corresponds to a corner defined by said geometric shape; identifying a letter character based on said sequence of corner hits independently of the path therebetween; and identifying said letter character as being upper case when said single unistroke defining the character ends in a common predetermined corner and lower case when said unistroke does not end in the common predetermined corner; wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
-
29. A method of generating a stroke, comprising:
-
using a processor to perform the following method; queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area; searching the queued continuous path data to generate a sequence of corner hits independently of the remainder of the continuous path data, with each corner hit in said sequence of corner hits corresponding to a corner defined by said geometric shape; receiving information indicative of the end of each stroke; wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode; and identifying a letter character as being upper case when said stroke representative of said character ends in a common predetermined corner and lower case when said stroke does not end in said common predetermined corner. - View Dependent Claims (30, 31, 32)
-
-
33. A computer readable memory carrying software which, when executed, performs a method comprising:
-
queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area; searching the queued continuous path data to generate a sequence of corner hits, where a corner hit corresponds to a corner defined by said geometric shape; identifying a character based on said sequence of corner hits independently of the remainder of the continuous path data; wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode; and identifying a letter character as being upper case when said stroke representative of said character ends in a common predetermined corner and lower case when said stroke does not end in said common predetermined corner. - View Dependent Claims (34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46)
-
-
47. A computer readable memory carrying software which, when executed, performs a method, comprising:
-
queuing continuous path data made by traversing edges and diagonals and into corners within a confining geometric shape constraining an input device to less than the input device'"'"'s total area; searching the queued continuous path data to generate a sequence of corner hits within a single unistroke, where a corner hit corresponds to a corner defined by said geometric shape; identifying a letter character based on said sequence of corner hits independently of the path therebetween; and identifying said letter character as being upper case when said single unistroke defining the character ends in a common predetermined corner and lower case when said unistroke does not end in the common predetermined corner; wherein each of said sequences of corner hits defines a single stroke, and wherein each single stroke is representative of one of a letter, number, punctuation or mode. - View Dependent Claims (48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60)
-
Specification