Image analysis – Pattern recognition – Unconstrained handwriting
Reexamination Certificate
2000-08-22
2004-08-03
Chang, Jon (Department: 2623)
Image analysis
Pattern recognition
Unconstrained handwriting
C382S187000, C382S229000
Reexamination Certificate
active
06771817
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates generally to computer devices, and more particularly computer devices arranged to receive handwritten input.
BACKGROUND OF THE INVENTION
Contemporary computing devices allow users to enter handwritten words (e.g., in cursive handwriting and/or printed handwritten characters) and symbols (e.g., a character in Far East languages). The words and symbols can be used as is, e.g., to function as readable notes and so forth, or can be converted to text for more conventional computer uses. To convert to text, for example, as a user writes strokes representing words or other symbols onto a touch-sensitive computer screen or the like, a handwriting recognizer (e.g., trained with millions of samples, employing a dictionary, context and other rules) is able to convert the handwriting data into dictionary words or symbols. In this manner, users are able to enter textual data without necessarily needing a keyboard.
Ink processing technology uses various data structures to maintain the ink and text entered by a user. For example, one type of data structure includes information in a header and an ink data field that describe the ink (e.g., in coordinates) entered by a user. However, it may be desirable to store additional information in association with an ink word. At the same time, developing a new data structure type to store this information, or adding data to existing data structure types, would cause existing ink programs to fail.
SUMMARY OF THE INVENTION
Briefly, the present invention provides a tail structure that enables data to be added to an existing ink word data structure without compromising backwards-compatibility. A previously unused bit in the header data structure is used to indicate to new ink processing programs the existence of extended (supplemental/additional) data, and the size information maintained in the header is adjusted ensure that earlier versions of ink programs do not lose the extended data. Extended data is then added, e.g., effectively appended to a copy of the existing ink word data structure, along with a tail structure that includes information that describes the extended data and the tail structure to the new ink code. For example, the tail structure can include offset and/or other information, along with a version number that provides for future modifications.
In this manner, the tail structure can, for example, include offset information that locates a list of alternate word choices (and possibly other information) effectively appended to the ink word data structure, and another offset that points out a selected one of the alternates. The tail structure also includes information from which the length of the additional data may be determined or derived, so that the additional data and the tail structure (which is fixed in size relative to each version) may be discarded when no longer needed, thereby reclaiming storage space. For example, the size of the appended information may be derived from the offset information in the tail structure used in conjunction with the total size of the data structure (maintained in the header).
Other advantages will become apparent from the following detailed description when taken in conjunction with the drawings, in which:
REFERENCES:
patent: 5594640 (1997-01-01), Capps et al.
patent: 5615285 (1997-03-01), Beernink
patent: 5675665 (1997-10-01), Lyon
patent: 5682439 (1997-10-01), Beernink et al.
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5764799 (1998-06-01), Hong et al.
patent: 5812697 (1998-09-01), Sakai et al.
patent: 5828991 (1998-10-01), Skiena et al.
patent: 5855000 (1998-12-01), Waibel et al.
patent: 5857099 (1999-01-01), Mitchell et al.
patent: 5953451 (1999-09-01), Syeda-Mahmood
patent: 5960447 (1999-09-01), Holt et al.
patent: 5995664 (1999-11-01), Shimomura
patent: 6005973 (1999-12-01), Seybold et al.
patent: 6014460 (2000-01-01), Fukushima et al.
patent: 6041141 (2000-03-01), Yamamoto et al.
patent: 6111985 (2000-08-01), Hullender et al.
patent: 6473517 (2002-10-01), Tyan et al.
patent: 6493464 (2002-12-01), Hawkins et al.
patent: 2002/0013795 (2002-01-01), Dresevie et al.
patent: 2002/0049796 (2002-04-01), Dresevic et al.
patent: 07110845 (1995-04-01), None
Morita et al. “A Fast and Compact Data Structure of Storing Multi-Attribute Relations Among Words.” IEEE Int. Conf. on Systems, Man and Cybernetics, vol. 3, Oct. 11, 1998, pp. 2791-2796.*
Carrano. “Data Abstraction and Problem Solving with C++: Walls and Mirrors.” the Benjamin/Cummings Publishing Company, Inc., 1995, pp. 150-163, 175-176 and 179-180.*
Zhao et al. “New Method for Segmenting Unconstrained Handwritten Numeral String,” Proc. Of the 4thInt. Conf on Document Analysis and Recognition, vol. 2, Aug. 18, 1997, pp. 524-527.
Senda et al. “Document Image Retrieval System Using Character Candidates Generated by Character Regognition Process.” Proc. Of the 2ndInt. Conf. on Document Analysis and Recognition, Oct. 20, 1993, pp. 541-546.
Ariki et al. “Segmentation and Recognition of Handwritten Characters Using Subspace Method.” Proc. of the 3rdInt. Conf. on Document Analysis and Recognition, vol. 1, Aug. 14, 1995, pp 120-123.
Arica et al. “A New Scheme for Off-Line Handwritten Connected Digit Recognition.” Proc. KES '98, 2ndInt. Conf. on Knowledge-Based Intelligent Electronic Systems, vol. 2, Apr. 21, 1998, pp. 329-335.
Jung et al. Machine Printed Character Segmentation Method Using Side Profiles. Proc. SMC '99, IEE Int. Conf. on Systems, Man, and Cybernetics, vol. 6, Oct. 12, 1999, pp. 863-867.
Liang et al. “Efficient Algorithms for Segmentation and Recognition of Printed Characters in Document Processing.” IEEE Pacific Rim Conf. on Communications, Computers and Signal Processing, vol. 1, May 19, 1993, pp. 240-243.
Lee et al. “A New Methodology for Gray-Scale Character Segmentation and Recognition.” Proc. Of the 3rdInt. Conf. on Document Analysis and Recognition, vol. 1, Aug. 14, 1995, pp. 524-527.
Altman Dan W.
Lui Charlton E.
Williamson Peter H.
Chang Jon
Law Offices of Albert S. Michalik PLLC
Microsoft Corporation
LandOfFree
Method and system for extending ink word data structures... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for extending ink word data structures..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for extending ink word data structures... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3274047