US5818963A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for recognizing a boundary between characters in handwritten text
Assignee: Societe des Ceramiques Techniques SA
•
Filing: 1996-11-04
•
Granted: 1998-10-06
•
Expires: 2016-11-04
Abstract
Abstract A method and system for identifying boundaries of characters in handwritten text by classifying segment strokes provides improved performance in a handwriting recognition system. A segment stroke is a portion of handwritten text which includes a boundary between two characters. The segment stroke is recognized by the same method used to recognized characters. Recognition of a segment stroke is accomplished by training a learning machine to act as a classifier which implements a discriminant function based on a polynomial expansion.
Inventors
- 👤 Michael Murdock
- 👤 Shay-Ping T. Wang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 20:33
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/32; G06V30/333; G06F; G06F18/00; G06F18/20; G06F18/24; G06F18/245; G06F18/2453; G06V30/14; G06V30/142; G06V30/1423; G06V30/148; G06V30/153; G06V30/22; G06V30/226; G06V30/2268; G06V30/24; G06V30/248; G06V30/26; G06V30/262; G06V30/36
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
165 words
A handwriting recognition system, comprising: a feature extractor for extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a segment stroke between the plurality of characters; and a boundary classifier for generating a boundary classifier output signal based on the plurality of features, a plurality of discriminant function coefficients, and a discriminant function, wherein the plurality of discriminant function coefficients are derived from a plurality of cursive segment stroke examples, each of the cursive segment stroke examples connecting the end point of a first cursive character to the start point of a second cursive character wherein the discriminant function has a form ##EQU2## Wherein y represents the boundary classifier output signal; wherein I, m, and n are integers; wherein wi-1 represents the plurality of discriminant function coefficients; wherein x1, x2, . . . , xn represents the plurality of features; and wherein g1i, . . . , gni represent a plurality of exponents of the discriminant function.
Claim 2
Dependent Claim
165 words
A handwriting recognition system, comprising: a feature extractor for extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a segment stroke between the plurality of characters; and a boundary classifier for generating a boundary classifier output signal based on the plurality of features, a plurality of discriminant function coefficients, and a discriminant function, wherein the plurality of discriminant function coefficients are derived from a plurality of cursive segment stroke examples, each of the cursive segment stroke examples connecting the end point of a first cursive character to the start point of a second cursive character wherein the discriminant function has a form ##EQU2## Wherein y represents the boundary classifier output signal; wherein I, m, and n are integers; wherein wi-1 represents the plurality of discriminant function coefficients; wherein x1, x2, . . . , xn represents the plurality of features; and wherein g1i, . . . , gni represent a plurality of exponents of the discriminant function.
Claim 3
Dependent Claim
13 words
The handwriting recognition system 1, wherein the boundary classifier includes a neural network.
Claim 4
Dependent Claim
13 words
The handwriting recognition system 1, wherein the boundary classifier includes a neural network.
Claim 5
Dependent Claim
45 words
The handwriting recognition system of claim 1, wherein the boundary classifier comprises: a plurality of computing elements for generating a plurality of discriminant function terms; and a summing circuit for generating the boundary classifier output signal in response to the plurality of discriminant function terms.
Claim 6
Dependent Claim
25 words
The handwriting recognition system of claim 1, wherein at least one of the plurality of features is extracted while the cursive handwriting is being written.
Claim 7
Dependent Claim
31 words
The handwriting recognition system of claim 1, wherein the plurality of features are selected from angular velocity, curvilinear velocity, stroke angle, stroke curvature, Fourier coefficients, and a plurality of polynomial coefficients.
Claim 8
Dependent Claim
54 words
The handwriting recognition system of claim 1, further comprising: a plurality of character classifiers for generating a plurality of character classifier output signals in response to the plurality of features; and a selector for identifying the plurality of characters based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 9
Dependent Claim
116 words
The handwriting recognition system of claim 1, wherein the feature extractor generates the plurality of features by fitting a first order polynomial to a curvilinear velocity profile v.sub.(k) =a.sub.0 +a.sub.1 v.sub.(k-1) +a.sub.2 v.sub.(k-2) +a.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the curvilinear velocity of a kth sample datum, v.sub.(k-1) represents the curvilinear velocity of a (k-1)th sample datum, v.sub.(k-2) represents the curvilinear velocity of a (k-2)th sample datum, v.sub.(k-3) represents the curvilinear velocity of a (k-3)th sample datum, k is an integer index, and a 0 , a 1 , a 2 , and a 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting.
Claim 10
Dependent Claim
116 words
The handwriting recognition system of claim 1, wherein the feature extractor generates the plurality of features by fitting a first order polynomial to an angular velocity profile v.sub.(k) =b.sub.0 +b.sub.1 v.sub.(k-1) +b.sub.2 v.sub.(k-2) +b.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the angular velocity of a kth sample datum, v.sub.(k-1) represents the angular velocity of a (k-1)th sample datum, v.sub.(k-2) represents the angular velocity of a (k-2)th sample datum, v.sub.(k-3) represents the angular velocity of a (k-3)th sample datum, k is an integer index, and b 0 , b 1 , b 2 , and b 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting.
Claim 11
Dependent Claim
25 words
The handwriting recognition system of claim 1, further comprising: a trainer, operatively coupled to the boundary classifier, for generating the plurality of discriminant function coefficients.
Claim 12
Dependent Claim
26 words
The handwriting recognition system of claim 1, wherein the plurality of discriminant function coefficients are derived using a technique selected from least-squares estimation and matrix inversion.
Claim 13
Dependent Claim
210 words
In a handwriting recognition system, a method for recognizing a character, the method comprising the steps of: extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a boundary between the plurality of characters; generating the plurality of features by fitting a first order polynomial to a curvilinear velocity profile v.sub.(k) =a.sub.0 +a.sub.1 v.sub.(k-1) +a.sub.2 v.sub.(k-2) +a.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the curvilinear velocity of a kth sample datum, v.sub.(-1) represents the curvilinear velocity of a (k-1)th sample datum, v.sub.(k-2) represents the curvilinear velocity of a (k-2)th sample datum, v.sub.(k-3) represents the curvilinear velocity of a (k-3)th sample datum, k is an integer index, and a 0 , a 1 , a 2 , and a 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting, distributing the plurality of features to a plurality of character classifiers; generating a plurality of character classifier output signals; distributing the plurality of features to a boundary classifier;, generating a boundary classifier output signal by applying the plurality of features to a boundary discriminant function: and identifying the character based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 14
Dependent Claim
210 words
In a handwriting recognition system, a method for recognizing a character, the method comprising the steps of: extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a boundary between the plurality of characters; generating the plurality of features by fitting a first order polynomial to a curvilinear velocity profile v.sub.(k) =a.sub.0 +a.sub.1 v.sub.(k-1) +a.sub.2 v.sub.(k-2) +a.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the curvilinear velocity of a kth sample datum, v.sub.(-1) represents the curvilinear velocity of a (k-1)th sample datum, v.sub.(k-2) represents the curvilinear velocity of a (k-2)th sample datum, v.sub.(k-3) represents the curvilinear velocity of a (k-3)th sample datum, k is an integer index, and a 0 , a 1 , a 2 , and a 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting, distributing the plurality of features to a plurality of character classifiers; generating a plurality of character classifier output signals; distributing the plurality of features to a boundary classifier;, generating a boundary classifier output signal by applying the plurality of features to a boundary discriminant function: and identifying the character based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 15
Dependent Claim
27 words
The method of claim 11, wherein the step of extracting includes: extracting at least one of the plurality of features while the cursive handwriting is being written.
Claim 16
Dependent Claim
29 words
The method of claim 11 wherein the plurality of features are selected from angular velocity, curvilinear velocity, stroke angle, stroke curvature, Fourier coefficients, and a plurality of polynomial coefficients.
Claim 17
Dependent Claim
209 words
In a handwriting recognition system, a method for recognizing a character, the method comprising the steps of: extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a boundary between the plurality of characters; generating the plurality of features by fitting a first order polynomial to an angular velocity profile v.sub.(k) =b.sub.0 +b.sub.1 v.sub.(k-1) +b.sub.2 v.sub.(k-2) +b.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the angular velocity of a kth sample datum, v.sub.(k-1) represents the angular velocity of a (k-1)th sample datum, v.sub.(k-2) represents the angular velocity of a (k-2)th sample datum, v.sub.(k-3) represents the angular velocity of a (k-3)th sample datum, k is an integer index, and b 0 , b 1 , b 2 , and b 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting, distributing the plurality of features to a plurality of character classifiers; generating a plurality of character classifier output signals; distributing the plurality of features to a boundary classifier; generating a boundary classifier output signal by applying the plurality of features to a boundary discriminant function; identifying the character based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 18
Dependent Claim
209 words
In a handwriting recognition system, a method for recognizing a character, the method comprising the steps of: extracting a plurality of features from cursive handwriting, the cursive handwriting comprising a plurality of characters and a boundary between the plurality of characters; generating the plurality of features by fitting a first order polynomial to an angular velocity profile v.sub.(k) =b.sub.0 +b.sub.1 v.sub.(k-1) +b.sub.2 v.sub.(k-2) +b.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the angular velocity of a kth sample datum, v.sub.(k-1) represents the angular velocity of a (k-1)th sample datum, v.sub.(k-2) represents the angular velocity of a (k-2)th sample datum, v.sub.(k-3) represents the angular velocity of a (k-3)th sample datum, k is an integer index, and b 0 , b 1 , b 2 , and b 3 represent the plurality of features, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the cursive handwriting, distributing the plurality of features to a plurality of character classifiers; generating a plurality of character classifier output signals; distributing the plurality of features to a boundary classifier; generating a boundary classifier output signal by applying the plurality of features to a boundary discriminant function; identifying the character based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 19
Dependent Claim
153 words
A handwriting recognition system, comprising: a feature extractor for extracting a plurality of features from handwriting, the handwriting comprising a plurality of characters and a boundary between the plurality of characters; a plurality of character classifiers for generating a plurality of character classifier output signals in response to the plurality of features; a boundary classifier for generating a boundary classifier output signal by applying the plurality of features to a polynomial discriminant function; wherein the polynomial discriminant function Y(X) has a form ##EQU3## wherein X={x 0 , x 1 , . . . , x n } represents the plurality of features, Y represents the boundary classifier output signal, w i represents a discriminant function coefficient, g ji represents an exponent, and i, j, m and n are integers; and a selector for identifying the plurality of characters based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 20
Dependent Claim
153 words
A handwriting recognition system, comprising: a feature extractor for extracting a plurality of features from handwriting, the handwriting comprising a plurality of characters and a boundary between the plurality of characters; a plurality of character classifiers for generating a plurality of character classifier output signals in response to the plurality of features; a boundary classifier for generating a boundary classifier output signal by applying the plurality of features to a polynomial discriminant function; wherein the polynomial discriminant function Y(X) has a form ##EQU3## wherein X={x 0 , x 1 , . . . , x n } represents the plurality of features, Y represents the boundary classifier output signal, w i represents a discriminant function coefficient, g ji represents an exponent, and i, j, m and n are integers; and a selector for identifying the plurality of characters based on the plurality of character classifier output signals and the boundary classifier output signal.
Claim 21
Dependent Claim
24 words
The handwriting recognition system of claim 15, wherein the plurality of classifier output signals are generated according to a plurality of polynomial discriminant functions.
Claim 22
Dependent Claim
13 words
The handwriting recognition system 15, wherein the boundary classifier includes a neural network.
Claim 23
Dependent Claim
13 words
The handwriting recognition system 15, wherein the boundary classifier includes a neural network.
Claim 24
Dependent Claim
24 words
The handwriting recognition system of claim 15, wherein at least one of the plurality of features is extracted while the handwriting is being written.
Claim 25
Dependent Claim
31 words
The handwriting recognition system of claim 15, wherein the plurality of features are selected from angular velocity, curvilinear velocity, stroke angle, stroke curvature, Fourier coefficients, and a plurality of polynomial coefficients.
Claim 26
Dependent Claim
115 words
The handwriting recognition system of claim 15, wherein the feature extractor generates a plurality of polynomial coefficients by fitting a first order polynomial to a curvilinear velocity profile v.sub.(k) =a.sub.0 +a.sub.1 v.sub.(k-1) +a.sub.2 v.sub.(k-2) +a.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the curvilinear velocity of a kth sample datum, v.sub.(k-1) represents the curvilinear velocity of a (k-1)th sample datum, v.sub.(k-2) represents the curvilinear velocity of a (k-2)th sample datum, v.sub.(k-3) represents the curvilinear velocity of a (k-3)th sample datum, k is an integer index, and a 0 , a 1 , a 2 , and a 3 represent the polynomial coefficients, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the handwriting.
Claim 27
Dependent Claim
115 words
The handwriting recognition system of claim 15, wherein the feature extractor generates a plurality of polynomial coefficients by fitting a first order polynomial to an angular velocity profile v.sub.(k) =b.sub.0 +b.sub.1 v.sub.(k-1) +b.sub.2 v.sub.(k-2) +b.sub.3 v.sub.(k-3) ; wherein v.sub.(k) represents the angular velocity of a kth sample datum, v.sub.(k-1) represents the angular velocity of a (k-1)th sample datum, v.sub.(k-2) represents the angular velocity of a (k-2)th sample datum, v.sub.(k-3) represents the angular velocity of a (k-3)th sample datum, k is an integer index, and b 0 , b 1 , b 2 , and b 3 represent the polynomial coefficients, and wherein the kth, (k-1)th, (k-2)th, and (k-3)th sample datum are derived from the handwriting.
Claim 28
Dependent Claim
47 words
The handwriting recognition system of claim 15, wherein the boundary classifier comprises: a plurality of computing elements for generating a plurality of polynomial discriminant function terms; and a summing circuit for generating the boundary classifier output signal in response to the plurality of polynomial discriminant function terms.
References Cited (Backward Citations)
US4149081A
Cited
US4654873A
Cited
US4771474A
Cited
US4764972A
Cited
US4907282A
Cited
US4718103A
Cited
US5060279A
Cited
US5115479A
Cited
US5233671A
Cited
US5042001A
Cited
US5161204A
Cited
US5309521A
Cited
US5251265A
Cited
US5101437A
Cited
US5105468A
Cited
US5343537A
Cited
US5295201A
Cited
US5335166A
Cited
US5323470A
Cited
US5321768A
Cited
US5479523A
Cited
US5602938A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-05 | 2002-04-06 | 2002-10-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-05 | 2006-04-06 | 2006-10-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-05 | 2010-04-06 | 2010-10-06 | $7700.00 | Window Closed / Lapsed |