公开(公告)号：US5649023A

公开(公告)日：1997-07-15

申请号：US410812

申请日：1995-03-27

申请人： Daniel Barbara ,  Walid Aref ,  Ibrahim Kamel ,  Padmavathi Vallabhaneni

发明人： Daniel Barbara ,  Walid Aref ,  Ibrahim Kamel ,  Padmavathi Vallabhaneni

IPC分类号： G06F17/30 ,  G06K9/00 ,  G06K9/22 ,  G06K9/62 ,  G06K9/68

CPC分类号： G06K9/00879 ,  G06F17/30625 ,  G06K9/00422 ,  G06K9/6282 ,  G06K9/6297

摘要： 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.

摘要翻译： 提供了一种用于索引多个手写物体的方法。 生成阶数为m的B树数据结构，其中m为整数。 B树具有被分成多个级别的多个节点，序号为0到n。 第0级的每个节点都是叶。 第1级的每个节点至少有m / 2个叶子作为子节点。 每个手写物体被分配到相应的叶片。 分别不同的隐马尔可夫模型（HMM）与第1至第n级中的每个节点的每个相应子节点相关联。 第1至第n层中的每个节点包含与一个节点的子节点相关联的相应HMM。 训练第1级每个节点中的每个HMM接受作为该节点的子节点的相应叶子的手写对象。 与第2至第n级中的任何节点相关联的每个HMM被训练以接受子树的叶中的所有手写对象，该子树具有与HMM相关联的相应子节的根。