U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method for indexing and searching handwritten documents in a database

Patent 5553284 Issued on September 3, 1996. Estimated Expiration Date: Icon_subject June 6, 2015. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

3588823

Crosswind measurements through pattern recognition techniques
Patent #: 4028673
Issued on: 06/07/1977
Inventor: Taylor ,   et al.

Method for storing and retrieving data
Patent #: 4419740
Issued on: 12/06/1983
Inventor: Hevenor, Jr.

Image storage and retrieval
Patent #: 4553206
Issued on: 11/12/1985
Inventor: Smutek ,   et al.

Zone partitioning in volume recovery system
Patent #: 4601012
Issued on: 07/15/1986
Inventor: Aiken, Jr.

On-line recognition method and apparatus for a handwritten pattern
Patent #: 4653107
Issued on: 03/24/1987
Inventor: Shojima ,   et al.

Hierarchical parametric apparatus and method for recognizing drawn characters
Patent #: 4975975
Issued on: 12/04/1990
Inventor: Filipski

Character recognition apparatus
Patent #: 4989258
Issued on: 01/29/1991
Inventor: Takahashi, et al.

Parallel associative memory having improved selection and decision mechanisms for recognizing and sorting relevant patterns
Patent #: 5014327
Issued on: 05/07/1991
Inventor: Potter, et al.

Method and apparatus for the automatic determination of phonological rules as for a continuous speech recognition system
Patent #: 5033087
Issued on: 07/16/1991
Inventor: Bahl, et al.

More ...

Inventors

Assignee

Application

No. 469803 filed on 06/06/1995

US Classes:

707/4Query formulation, input preparation, or translation

Examiners

Primary: Black, Thomas G.
Assistant: Pham, C.

Attorney, Agent or Firm

International Class

G06F 017/30

Abstract

A method for indexing electronic handwritten documents is provided. Each document includes a plurality of output symbols in an output sequence, and is modeled by a respective Hidden Markov Model (HMM). The HMMs share a common alphabet and a common sequence length. A tree is established, having linked nodes stored in a memory. Each node has n pointers, each identifying a different node in the next level of the tree. Each path from the root to a different one of the leaf nodes defines a respective sequence of pointers. An indexing procedure is performed, for each of a subset of the nodes in one of the levels of the tree. The procedure includes: (1) determining the probability that a subset of one of the sequences of pointers leading from the root to that node represents a subset of the output symbols in one of the documents; (2) invoking the procedure for the next level, if the determined probability exceeds the minimum probability value of that level; and (3) adding a pointer to that document in the list of pointers of the leaf node associated with that sequence of pointers, if the next level is the last level and the probability is greater than the threshold value. The procedure is repeated for each other document.

Other References

  • Daniel P. Lopresti et al., "Approximate Matching of Hand-Drawn Pictograms", Pre-Proceedings IWFHR III, Third International Workshop on Frontiers in Handwriting Recognition, pp. 102-111 (May 25-27, 1993)
  • C. B. Bose, et al, "Connected and Degraded Text Recognition Using Hidden Markov Model", IEEE, pp. 116-119 (1992)
  • C. C. Tappert, et al, "The State of the Art in On-Line Handwriting Recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, No. 8, pp. 787-808 (Aug. 1990)
  • D. P. Lopresti et al, "Pictographic Naming", Interchi '93 Adjunct Proceedings, Conference on Human Factors in Computing Systems, pp. 77-78 (Apr. 27, 1993)
  • S. V. Vrbsky, et al, "Approximate--A Query Processor that Produces Monotonically Improving Approximate Answers", IEEE Transactions on Knowledge and Data Engineering, vol. 5, No. 6, pp. 1056-1068 (Dec. 1993)
  • M. M. Zloof, "Query-by-Example: a data base language", pp. 324-343
  • Mou-Yen Chen, "Off-Line Handwritten Word Recognition Using Single Contextual Hidden Markhov Model" IEEE, 1992, pp. 669-672
  • Junji Yamato, "Recognition Human Action in Time--Sequential Image using HMM", IEEE, 1992, pp. 379-385
  • Amlan Kundu, "Recognition of handwritten script: A HMM base approach", IEEE, 1988, pp. 928-931
  • J. A. Vlontzos, "A Hierarchichal System for Character Recognition", IEEE, 1989, pp. 1-
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?