Shape tracking and production using Hidden Markov Models

被引:7
作者
Caelli, T [1 ]
McCabe, N
Briscoe, G
机构
[1] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2M7, Canada
[2] ieWild Inc, San Diego, CA USA
[3] Univ Wisconsin, Oshkosh, WI 54901 USA
基金
美国国家航空航天局;
关键词
feature extraction; pattern recognition; scene understanding; tracking human performance; learning; Hidden Markov Models;
D O I
10.1142/S0218001401000794
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper is concerned with an application of Hidden Markov Models (HMMs) to the generation of shape boundaries from image features. In the proposed model, shape classes are defined by sequences of "shape states" each of which has a probability distribution of expected image feature types (feature "symbols"). The tracking procedure uses a generalization of the well-known Viterbi method by replacing its search by a type of "beam-search" so allowing the procedure, at any time, to consider less likely features (symbols) as well the search for an instantiable optimal state sequences. We have evaluated the model's performance on a variety of image and shape types and have also developed a new performance measure defined by an expected Hamming distance between predicted and observed symbol sequences. Results point to the use of this type of model for the depiction of shape boundaries when it is necessary to have accurate boundary annotations as, for example, occurs in Cartography.
引用
收藏
页码:197 / 221
页数:25
相关论文
共 18 条
[1]  
[Anonymous], P ACM SIGGRAPH LOS A
[2]   CONNECTED AND DEGRADED TEXT RECOGNITION USING HIDDEN MARKOV MODEL [J].
BOSE, CB ;
KUO, SS .
PATTERN RECOGNITION, 1994, 27 (10) :1345-1363
[3]   Integration of structural and statistical information for unconstrained handwritten numeral recognition [J].
Cai, JH ;
Liu, ZQ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1999, 21 (03) :263-270
[4]  
DAVE J, 1986, IEEE T PATTERN ANAL, V8, P248
[5]  
Falkner E., 1994, AERIAL MAPPING METHO
[6]   Factorial hidden Markov models [J].
Ghahramani, Z ;
Jordan, MI .
MACHINE LEARNING, 1997, 29 (2-3) :245-273
[7]  
Jain K, 1988, Algorithms for clustering data
[8]  
LUKES G, 1998, P DARPA 1998 IM UND
[9]  
McCane B, 1997, INT J PATTERN RECOGN, V11, P909, DOI 10.1142/S021800149700041X
[10]  
MUELLER S, 2000, INT J PATTERN RECOGN, V5