The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 15, 1997
Filed:
Mar. 27, 1995
Daniel Barbara, Princeton, NJ (US);
Walid Aref, New Brunswick, NJ (US);
Ibrahim Kamel, Monmouth Junction, NJ (US);
Padmavathi Vallabhaneni, Princeton, NJ (US);
Panasonic Technologies, Inc., Princeton, NJ (US);
Abstract
A method for indexing a plurality of handwritten objects is provided. A B-tree data structure of order m is generated, where m is an integer. The B-tree has a plurality of nodes divided into a plurality of levels ordinally numbered 0.sup.th through n.sup.th. Each node in the 0.sup.th level is a leaf. Each node in the 1.sup.th level has at least m/2 leaves as children. Each one of the handwritten objects is assigned to a respective leaf. A respectively different hidden Markov model (HMM) is associated with each respective child of each of the nodes in the 1.sup.th to n.sup.th levels. Each one of the nodes in the 1.sup.th to n.sup.th levels contains the respective HMM associated with the child of the one node. Each HMM in each one of the nodes in the 1.sup.th level is trained to accept the handwritten object of the respective leaf that is a child of the one node. Each HMM associated with any of the nodes in the 2.sup.th through n.sup.th levels is trained to accept all of the handwritten objects in the leaves of a subtree that has as a root the respective child with which the HMM is associated.