Trie structure based method and apparatus for indexing and searching handwritten databases with dynamic search sequencing
US5768423A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Oct 19, 1995 |
| Grant date | Jun 16, 1998 |
| Priority date | — |
| Expiry date | Oct 19, 2015 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06V30/2276
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of searching for one of a plurality of objects that matches an input sequence of handwritten objects is provided. The objects are modeled by concatenating members of a set of component objects. A Trie structure representing the plurality of objects is generated. Component objects of each object are assigned to the elements of respective nodes of the Trie structure. A respective hidden Markov model (HMM) is associated with each element of each non-leaf node. The HMMs represent the respective component object of the element. A maximum probability of any HMM accepting any of the set of component objects is estimated. The root node of the Trie structure is selected. A plurality of elements of the selected node are selected. A plurality of segments of the input sequence are applied to respective HMMs associated with the selected elements to generate respective acceptance values.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.