US 6,084,985 AGrant

Method and Apparatus for on-Line Handwriting Recognition Based on Feature Vectors That Use Aggregated Observations Derived From Time-Sequential Frames

Issue Date:2000-07-04

•18 Claims

•5 Drawing Sheets

Abstract

A method for on-line handwriting recognition is based on a hidden Markov model and implies the following steps: sensing real-time at least an instantaneous write position of the handwriting, deriving from the handwriting a time-conforming string of segments each associated to a handwriting feature vector, matching the time-conforming string to various example strings from a data base pertaining to the handwriting, and selecting from the example strings a best-matching recognition string through hidden-Markov processing, or rejecting the handwriting as unrecognized. In particular, the feature vectors are based on local observations derived from a single segment, as well as on compacted observations derived from time-sequential segments.

Metadata

Assignee

U.S. Philips Corporation

Inventors

Jannes G. A. Dolfing
Reinhold Hab-Umbach

Application Information

Application Number:US 9435328

Filing Date:1997-10-03

Priority Date:1996-10-04

Art Unit:271

Classifications

IPC:

G06K 900G06K 918G06K 962G06K 972

Field of Search:

382186;187;188;203;228;229;116

Patent Drawings (5 sheets)

Description

Background to the Invention

The invention relates to a method for on-line handwriting recognition.

Human speech is presently being recognized by data processing methods that use hidden Markov processes and neural networks. Of late, similar algorithms are being used for online recognizing human handwriting during writing thereof. In the case of standard text, recognizing may imply correlating with various letter models, and assigning a particular letter sequence to the writing. In the case of a signature, recognizing may imply correlating with various different signatures, or rather verifying through correlating with just one signature. The modellings may be descriptions on some level of abstraction of the eventual text. The outputting may be restricted further with respect to the recognition, such as in the form an ASCII series, a stylized representation of the handwriting, the reproduction as spoken text, or just a yes/no output in the case of verification E. J. Bellegarda et al., A Fast Statistical Mixture Algorithm for On-line Handwriting Recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(12) p.1227-1233, December 1994, describes letter recognition based on a splicing mechanism. K. S. Nathan et al., Real-time On-line Unconstrained Handwriting Recognition Using Statistical Methods, International Conference of Acoustics, Speech and Signal Processing, p.2619-2622, 1995, describes complete handwriting recognition based on a hidden Markov model (HMM).

Now, the present inventors have found that associating each handwriting interval with only a single feature vector, yields unsatisfactory recognition results. It is possible to derive each feature vector from all information present in a sequence of a plurality of handwriting intervals; this however leads to a sharply increased dimension of the feature vectors in terms of the number of components thereof, and requires unwieldy calculations, without yielding a corresponding improvement of the results. In consequence, there appears to be ample room for attaining improved effectivity of the present state of the art.

Summary to the Invention

Accordingly, amongst other things, it is an object of the present invention to provide a calculation model that allows a relatively higher recognition score at a relatively lower processing cost. The invention generally concerns handwriting recognition including real-time sensing at least an instantaneous write position of the handwriting, deriving from the handwriting a time-conforming string of samples, and from the string a series of handwriting intervals each associated by derivation to a handwriting feature vector, matching the time-conforming sequence of feature vectors so derived to one or more example sequence modeling from a database pertaining to the handwriting in question, selecting from the modeling a sufficiently-matching recognition string through hidden-Markov processing, and outputting essentials of a result of the selecting, or alternatively, rejecting the handwriting as failing to be recognized. Now, according to one of its aspects, the invention is characterized in that said feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, as well as one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay. Through the aggregation, the size of the feature factors in terms of the number of vector elements is kept much lower than the size that would follow from the combined information from a sequence of handwriting intervals. Nevertheless, the recognition quality is excellent. It has been felt that this result derives from the following characterizations of the recognition model:

a. the aggregated observations relate to a temporal or spatial sequence of handwriting intervals that in combination have an adjustable duration or delay; this delay can have a greater or smaller value to adjust to handwriting idiosyncrasies of the singular person in question. Another variable can be the particular type of information that the vector element in question relates to: a handwriting contour may use a greater delay than angles between various shapes of the writing.

b. the aggregation result has a smaller number of vector elements in the feature vectors, thereby allowing the full execution of relatively many process steps which each take a number of calculations that increases with this size.

According to the invention, the handwriting intervals may be delimited as a uniform number of samples, in which case they are called frames. Alternatively, the handwriting intervals may be delimited by characteristic locations or instants in the handwriting, in which case they are called segments. A particularly advantageous aspect for integrating is to calculate differential angles between points pertaining to successive handwriting intervals. The method can be used for standard handwriting text, or for the verification of signatures.

Advantageously, the aggregated feature vector elements comprise differential angles derived from principal points associated to successive handwriting intervals. This has been found a particularly distinguishing aspect, which moreover is straightforward to calculate.

Advantageously, said feature vector elements to be aggregated include spatial path lengths between principal points associated to successive handwriting intervals. This has been found a particularly distinguishing aspect. The path in question may be measured in the X-and/or Y-direction, or along a path of the writing itself.

For signature recognition or verification, advantageously at least one aggregated feature vector element is based on sensing instantaneous writing pressure. The sensing of either the pressure or the tilt of a writing instrument have become feasible with an electromagnetically operating writing tablet, that is based on electromagnetic loops arranged immediately below the surface.

The invention also relates to a data processing apparatus arranged and programmed for implementing the handwriting recognition method according to the invention. Further advantageous aspects of the invention are described herein.

Brief Description of the Drawing

These and other aspects and advantages of the invention will be discussed more in detail hereinafter with reference to the disclosure of preferred embodiments, and more in particular with reference to the appended Figures. First, the general environment of the invention is discussed. Next, the implementation of the invention is disclosed in detail. Finally, a few results are presented. The Figures show in particular:

FIG. 1, a diagram of a two-channel recognition system;

FIG. 2, an example of text sampling;

FIG. 3A, another example of a text;

FIG. 3B, the breakdown thereof into segments;

FIG. 4A, an exemplary frame path;

FIG. 4B, an exemplary segment path;

FIG. 5, another example of a sequence of segments;

FIG. 6, ditto of the feature center of gravity;

FIG. 7, ditto of the feature relative delayed angles;

FIG. 8, ditto of the feature contour information;

FIG. 9, ditto of the feature relative contour angle;

FIG. 10, ditto of the pressure signal of text;

FIG. 11, ditto of the so-called `hat`-feature.

The Environment of the Invention

FIG. 1 shows a bi-channel recognition system, voice at left and handwriting and/or signature recognition at right. Input 23 comprises a telephone-type voice input subsystem 20 and a graphical input tablet 22. Information gathered may be transferred by wireless 21 to a central data processing system not shown. Block 24 symbolizes instantaneous speech signal, block 26 instantaneous handwriting signal. As to the speech signal, the system contains acoustic preprocessor 28, search and classification 36, language model 30, acoustic model 34 that accounts for observation/feature vectors and a word sequence module, and finally outputs a result 40. As to the handwriting signal, there is a handwriting preprocessor 32, and a handwriting model description 38.

FIG. 2 is an example of text sampling, each block representing a particular sample. As shown, inter block-separation can vary by a factor of ten or more.

FIG. 3A is another text specimen used for exemplifying further processing. The pen is assumed to move in an X, Y coordinate system. FIG. 3B shows the breakdown of FIG. 3A's example into five successive segments S.sub.1 -S.sub.5 : a segment terminates when the Y-velocity has become zero. Now suppose that segment S.sub.4 is the current segment. Feature extraction from this single segment produces an observation o.sub.4 that can be used as an element of a feature vector. Various such features have been in use in the art. It is clear that observation o.sub.4 contains only local information that exclusively pertains to the segment in question. Now according to the invention, aggregated features will be constructed, such as aggregated observation o'.sub.4 on the basis of observation o.sub.4, and furthermore by describing relations between observations o.sub.4, o.sub.3, o.sub.2. Another way of interpreting is to consider this as a system with three delay taps. In the course of time, other subsets of segments will be aggregated, such as observations o.sub.3, o.sub.2, o.sub.1, etcetera. Negative delay values are feasible.

By way of example, FIG. 4A shows a frame path, that gives the grouping of successive samples of a particular written letter into fixed-size frames. Here, each frame has four samples, and moreover, Successive frames overlap by 50%: four successive frames have been shown, that roughly cover the top, the top left, and the left side of the single character, respectively. The overlap is optional. These frames can be used for deriving various feature vector elements, such as observations represented by instantaneous curvature of the handwriting.

By way of alternative, FIG. 4B shows an exemplary segment path. Here, the delimiting between successive odd-numbered segments is effected at instants where vertical (Y)-speed is zero. Even-numbered segments again overlap half of both their predecessor and of their successor segment. Hereinafter, in particular, the odd-numbered frames are used for aggregating feature vector elements associated thereto. The features in a feature vector are chosen to be size-independent. The splitting points on v.sub.y =0 guarantee a uniform number of segments per character, independent of character size. Hence, the `segment` representation is automatically size-independent. In similar manner, the aggregating among even-numbered segments yields aggregated feature vector elements that are size-independent.

The preprocessing, of FIG. 1 in the first place derives from each such segment or frame various features that may collectively be aggregated into a feature vector element for the frame or segment in question, according to: O=(o.sub.1,o.sub.2,o.sub.3) So-called spliced feature vectors have been derived according to the state of the art by combining into a particular feature vector various features derived from successive frames or segments, without aggregation on the level of the features themselves. This often raises the size of the feature vector to an unmanageable level. According to the present invention, the size of these vectors is kept much lower, by aggregating individual features of successive frames or segments into a single aggregated feature, symbolically representable as: ##EQU1## Herein, d as expressed in a number of segments, corresponds to the maximum value of the delay among successive frames or segments, and m indicates the number of functions actually used. Further, like with `delta` features, observations relating to future segments can be aggregated into the actual feature vector as well.

FIG. 5 gives another example of a segments sequence. First, from the samples associated to each segment the center of gravity is calculated, wherein each respective sample accounts for a uniform weight. These centers of gravity have in FIG. 6 been shown as a cross appertaining to each segment. Alternative calculations may take either only the y coordinate value or only the x-coordinate value and the intersection of such coordinate with the character stroke. Through connecting a series of predecessor centers of gravity to an actual center of gravity, FIG. 7 shows the feature of relative delayed angles. As shown, four angles are produced, that may yield an aggregated feature vector according to:

which combines the original local information, together with a relevant part of 3.times.2 further features. The aggregated vector has a smaller size compared to the number of contributing features.

In a comparable manner, the size calculation of the various frames or segments l.sub.1. . . l.sub.4 can be used for constituting an aggregated vector based on successive segments according to:

Again, the size of the aggregated feature vector is reduced.

FIG. 8 shows the deriving of the feature aggregated contour information. First, as shown, top and bottom samples of each segment s.sub.1. . s.sub.4 are determined, as indicated by crosses and circles, respectively. For the subsets of segments shown, separate regression lines are now calculated for the tops and bottoms, respectively, and the angles associated to these lines are used for producing the aggregated feature vector for these four segments or frames, such as according to:

the latter two elements representing contour information (FIG. 9).

FIG. 10 shows the deriving of aggregated feature vectors as based on pressure signal of text, which in particular is useful for signature recognition or verification. By themselves, either of these usages of signatures is old; the main distinction versus standard text is that mapping on separate characters is superfluous. Instantaneous pressure is correlated with starting and terminating of the various segments or frames as shown in FIG. 8. In the Figure, the pressure has been entered as a function of time. Experimentally it has been verified that the pressure is often highest in the middle of a segment that on the writing surface runs primarily in a vertical direction; the relevant points have been indicated by crosses and have respective pressure values p.sub.1. . p.sub.4. Now, the aggregated feature vector can, for example, be expressed as:

Various other derivations of the aggregated feature values are feasible.

FIG. 11 exemplifies the so-called `hat-feature`: this feature means that certain parts of the handwriting are not written in their standard order. Such occurs most often with accents, dots on letters like i and j, horizontal strokes in the letter t and the like. FIG. 11 is an example of the writing of the letter sequence `ai`, that has been divided into five standard segments s.sub.1 to s.sub.5, and a single hat segment s.sub.6 corresponding to the dot on the letter i. The superposition of the `hat` can be given as overlapping in a vertical direction versus non-overlapping of a particular earlier segment, in exceptional cases of a later segment. Another occurrence is that segments generated during the continuous writing overlap each other, if a small loop occurs. The occurring or non-occurring may be specified by a single bit with respect to all preceding segments combined: an example of the aggregating could then be that the count is formed as a quantity: (2/(maximum delay)). Another implementation is to express the hat feature as a respective bit relative to each preceding segment that is considered relevant, such as the three most recent segments: this leads to a bit string. The aggregating then can be done by calculating a function of these various bits.

Another implementation is to give the overlap as a multivalued or an analog quantity, such as the overlap between segments (s.sub.6, s.sub.5) as measured in distance or in a number of sample points. For the hat segment, this then could lead to a string of analog values. This string can then be aggregated with a particular property of the hat segment itself. A still further development is to even combine the various overlap distances in an associated function f((overlap(s.sub.6,s.sub.5), overlap (s.sub.6,s.sub.4), This function then is aggregated with a particular property of the hat segment itself.

Further Description of the Performance

We have used an unconstrained, writer-independent, hidden Markov model (HMM) based on an on-line handwriting recognition system. The principal effort is feature extraction, i.e. finding a suitable representation of a portion of the scribble sequence recorded on a tablet. The feature vector should contain all information relevant for subsequent classification, be insensitive to irrelevant variations, and at the same time have a low vector dimension. The following results were achieved.

The genericity of the approach has been verified; state-of the-art recognition results have been produced. Essentially the same system was used for the recognizing discrete characters and continuous input and for 200 and 20,000 words vocabulary, with and without language model. The recognition accuracy obtained, e.g. up to 90% correct for a 20,000 word cursive recognition task without language model, compares well with other published results.

For obtaining a writing size invariant system, we compared two representations, frames and segments, which differ in the way adjacent samples are grouped into feature vectors. In a frame representation a constant number of samples contribute to one feature vector, and resulted in a better peak performance. For segments the boundaries between samples represented by the same feature vector; they are defined by the vertical handwriting speed being zero, and are more robust with respect to writing size. The error rate was hardly affected by scale variations of tip to a factor of eight.

The invention in particular relates to the concept of delayed features. Delayed features provide a flexible framework to integrate handwriting-specific knowledge into the representation by expressing structural relations between current and previous observation vectors. Not only the computation of angles between the center-of-gravities and size relations of subsequent features is possible but more complex relations like the "hat feature" can be computed too. The incorporation of delayed features will lower the error rate by 50%. We also experimented with delta features, as they are known from speech recognition, and obtained similar improvements, however with a quite higher vector dimension.

Linear discriminant analysis (LDA) allowed to obtain a representation maximally compact with respect to a discrimination criterion. The vector dimension could be reduced by a factor of two without performance degradation.

2. Baseline System

The platform for capturing handwriting is a proprietary tablet consisting of an LCD plus orthogonal sensors for pen and finger input sampling (x,y,p) with up to 200 pps. This tablet is connected to a PC with PenWindows. Data is filtered and, depending on representation, spatially resampled. Each character is modeled by a left-to-right Hidden Markov Model with loop, forward and skip transitions between the states. The observation probabilities are continuous mixtures of Gaussian densities with density specific diagonal covariance matrices. Training of the HMM parameters is done by using the Maximum Likelihood criterion and applying the Viterbi approximation. Recognition is based on the one-stage beam search algorithm using a tree-organized dictionary. All knowledge sources (the pen signal, the dictionary, and for some experiments, a language model) are applied at once, thus avoiding all premature decisions.

For the experiments, the training data consisted of more than 10,000 words from about 60 writers and several nationalities from on-site collected data and Unipen training data. Essentially the same recognizer was employed for the recognition of characters, words or whole sentences for a 200 words and a 20,000 words dictionary. The HMM framework is able to simultaneously determine the optimal segmentation and carry out the decoding. We obtained word recognition rates of 90% up to 99% for the 200 word vocabulary, 73% to 90% correct words for a 20K word vocabulary without language model. These results compare well with other published(d results for unconstrained handwriting recognition. Initial experiments on sentence recognition have also been conducted.

3. Writing Size Invariance

Like writing and sample speed, writing size is often explicitly normalized. This approach is suitable for recognizing isolated words where all input is available before normalization, but less appropriate for on-line recognition where preprocessing and recognition are done simultaneously. As an alternative we investigated size-independent representations.

Two alternatives were studied for grouping samples into blocks of which a feature vector is computed. For segments, the block borders are determined using the criterion that the vertical handwriting speed is zero: v.sub.y =0. In contrast, a frame consists of a fixed number of consecutive, resampled points. Resampling the pen trajectory is necessary to obtain equispaced points and thus compensate for writing speed variations. In both cases the sample blocks were used to compute adjacent feature vectors were chosen to overlap by 50%. On the average there were about 10 frames (7 segments) per character corresponding to 7 (5) states per model.

The feature vectors were identical for frames and for segments and contained 13 low-level features like aspect ratio, path length, 5 angles, a pen-down feature, and four so-called delayed features.

To test writing size dependence, 10 writers wrote a set of 50 words in four different sizes (scale: 0.5, 1, 2, 4; where scale 1 corresponds to the average writing size of the training data). Writers were instructed to write lower case were not constrained otherwise. The resulting set of 4 times 500 words was represented by either frames or segments and recognized using a 200 and 20K word vocabulary. The results presented in Table 1 clearly show that, while frames have a better peak performance (of up to 99% correct words), the segments are essentially independent of the writing size.

Table 1: Comparison of frames and segments for four different writing sizes. The table contains recognition rates in % for a 200 and 20,000 word dictionary, respectively.

4. Delayed and Delta Features

Features that describe consistent trends in the handwriting over several points can improve recognition accuracy. One method is to splice adjacent frames to an enlarged feature vector. Here we investigated alternative approaches.

Let o.sub.t denote a feature of the current frame t. A way to describe the dynamics of the handwriting signal, which has been adopted from speech recognition, is the use of delta features, i.e. approximations to the derivatives of the observation vector versus time, e.g.:

The novel delayed features indicate the spatial dynamics of the handwriting signal by computing relative angles between the X-axis and a line connecting centers-of-gravity, and further size relations between subsequent feature vectors. For a delay n=2, the features sin(angle(cog(o.sub.t),cog(o.sub.t-2))), cos(angle(cog(o.sub.t), cog(o.sub.t-2))) describe the change of writing direction between feature vectors o.sub.t-2 and o.sub.t. This concept of delayed features further allows to define a so-called "hat-feature".

Based on 500 normal-sized words of the scalability test, we compared the performance of a baseline representation (13-component feature vector) versus feature vectors which included delta and delayed features, respectively. Table 2 shows that the augmented feature vector outperforms the baseline representation, delta and delayed features performing similarly well. In the case of the delayed features, however, fewer additional vector components are required to improve the performance.

Table 2: Recognition rates (in %) for segment type of feature vector for a 200 word and a 20,000 word dictionary.

5. Linear Discriminant Analysis

Linear discriminant analysis (LDA) is used for compressing the information contents (with respect to classification) of a feature vector by a linear transformation. After the feature vector had been augmented by delta or delayed features the resulting vector was transformed by an LDA transformation. Then a certain number of features corresponding to the largest eigenvalues were retained while the other features were discarded. By doing so the vector dimension could be reduced by a factor of two without performance degradation.

6. References

E. J. Bellegarda, J. R. Bellegarda, D. Nahamoo, and K. S. Nathan. A Fast Statistical Mixture Algorithm for On-line Handwriting Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(12) p. 1227-1233, December 1994: describes letter recognition based on so-called splicing, that makes the feature vectors too large.

K. S. Nathan, H. S. M. Beigi, J. Subrahmonia, G. J. Clary, and H. Maruyama. Real-time On-line Unconstrained Handwriting Recognition Using Statistical Methods. In International Conference of Acoustics, Speech and Signal Processing, p. 2619-2622, 1995: describes complete handwriting recognition, based on HMM.

Claims

What is claimed is:

1. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting frame, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU2## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive frames, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized.

2. The method as claimed in claim 1, wherein the aggregated feature vector elements comprise differential angles derived from the centers of gravities associated to successive handwriting intervals.

3. A method as claimed in claim 1, wherein said feature vector elements to be aggregated include spatial path lengths between principal points associated to successive handwriting intervals.

4. A method as claimed in claim 1, wherein said aggregated feature vector elements define spatially contiguous character segments generated in a temporally non-sequential manner.

5. A method as claimed in claim 1, wherein said aggregated feature vector elements include contour changes between successive character segments in a direction transverse to a general orientation of a line or writing.

6. A method as claimed in claim 1, applied for signature recognition.

7. A method as claimed in claim 1, wherein at least one aggregated feature vector element is based on sensing instantaneous writing pressure.

8. A method as claimed in claim 1, wherein at least one aggregated feature vector element is based on sensing instantaneous writing instrument tilt.

9. A data processing system for handwriting recognition comprising: a graphical input means for real-time sensing at least an instantaneous write position of handwriting and converting said handwriting information into a handwriting signal; a handwriting processing means for receiving and processing said handwriting signal, for deriving from said handwriting a time-conforming string of samples and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, and for calculating a center of gravity from the samples associated with each handwriting interval, and wherein said feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said hand writing interval being selected from the group consisting of a handwriting frame and a handwriting segment, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU3## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive frames or segments, and m indicates a number of functions actually used; a handwriting model description database pertaining to the handwriting in question; search and classification means for receiving a processed handwriting signal from the handwriting processing means, and for matching the time-conforming sequence of feature vectors so derived to one or more example sequence modeling from the handwriting model description database, and for selecting from said modeling a sufficiently-matching recognition string through hidden-Markov processing; and results output means for outputting essentials of a result of said selecting, or alternatively, for rejecting said handwriting as failing to be recognized.

10. A system according to claim 9, wherein said graphical input means comprises an electromagnetically operating writing tablet.

11. A method for on-line handwriting recognition based on a hidden Markov model, said method comprising the steps of: real-time sensing at least an instantaneous write position of said handwriting; deriving from said handwriting a time-conforming string of samples, and from said string a series of handwriting intervals each associated by derivation to a handwriting feature vector, including calculating a center of gravity from the samples associated with each handwriting interval, and wherein the feature vectors contain one or more vector elements that are based on local observations derived from a single said handwriting interval, said handwriting interval comprising a handwriting segment, as well as being based on one or more vector elements that are based on aggregated observations derived from time-spaced said intervals defined over an associated delay, wherein the aggregated feature vector elements are representable as o'.sub.1 and o'.sub.2 as follows: ##EQU4## where o.sub.1 and o.sub.2 represent the vector elements that are based on local observations, d corresponds to a maximum value of the delay between successive segments, and m indicates a number of functions actually used; matching the time-conforming sequence of feature vectors so derived to one or more example sequence modellings from a database pertaining to the handwriting in question; selecting from said modellings a sufficiently-matching recognition string through hidden-Markov processing; and outputting essentials of a result of said selecting, or alternatively, rejecting said handwriting as failing to be recognized.

12. The method as claimed in claim 11, wherein the aggregated feature vector elements comprise differential angles derived from the centers of gravities associated to successive handwriting intervals.

13. The method as claimed in claim 11, wherein said feature vector elements to be aggregated include spatial path lengths between principal points associated to successive handwriting intervals.

14. The method as claimed in claim 11, wherein said aggregated feature vector elements include signallings that spatially contiguous character segments are generated in a temporally non-sequential manner.

15. The method as claimed in claim 11, wherein said aggregated feature vector elements include contour changes between successive character segments in a direction transverse to a general orientation of a line or writing.

16. The method as claimed in claim 11, applied for signature recognition.

17. The method as claimed in claim 11, wherein at least one aggregated feature vector element is based on sensing instantaneous writing pressure.

18. The method as claimed in claim 11, wherein at least one aggregated feature vector element is based on sensing instantaneous writing instrument tilt.

Patent Citations (1)

Patent	Date	Inventor	Cited By
US5621809	1997-04-01	Bellegarda et al.

Non-Patent Literature (4)

Krishna S. Nathan et al, "Real-Time On-Line Unconstrained Handwriting Recognition Using Statistical Methods", pp. 2619-2622, 1995 IEEE.
Eveline J. Bellegarda et al, "A Fast Statistical Mixture Algorithm for On-Line Handwriting Recognition", pp. 1227-1233, IIIE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, No. 12, Dec. 1994.
M. Schenkel et al, On-Line Cursive Script Recognition Using Time-Delay Neural Networks and Hidden Markov Models, pp. 215-223, 1995 Machine Vision and Applications.
"Application of Hidden Markov Models for Signature Vierification" L. Yang et al, Pattern Recognition, vol. 28, No. 2, Mar. 1995.

Abstract

Description