1622 search results - page 45 / 325 » Learning a Hidden Matching |
ICDAR
2003
IEEE
15 years 3 months ago
2003
IEEE
The purpose of this study is to develop a flexible matching method for recognizing handwritten numerals based on the statistics of shapes and structures learned from learning sam...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper addresses the problem of learning and recognizing human activities of daily living (ADL), which is an important research issue in building a pervasive and smart environ...
100
click to vote
CIKM
2007
Springer
15 years 1 months ago
2007
Springer
Hidden markov model (HMM) is frequently used for Pinyin-toChinese conversion. But it only captures the dependency with the preceding character. Higher order markov models can brin...
PR
1998
14 years 9 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...