scholarly journals Image classification by a two-dimensional hidden Markov model

2000 ◽  
Vol 48 (2) ◽  
pp. 517-533 ◽  
Author(s):  
Jia Li ◽  
A. Najmi ◽  
R.M. Gray
2017 ◽  
Vol 31 (4) ◽  
pp. 1543-1550 ◽  
Author(s):  
Lin Li ◽  
Tingfeng Ming ◽  
Shuyong Liu ◽  
Shuai Zhang

2016 ◽  
Vol 89 ◽  
pp. 435-446 ◽  
Author(s):  
Guo-gang Wang ◽  
Gui-jin Tang ◽  
Zong-liang Gan ◽  
Zi-guan Cui ◽  
Xiu-chang Zhu

2013 ◽  
Vol 411-414 ◽  
pp. 2041-2046 ◽  
Author(s):  
Jing Guo ◽  
Ming Quan Zhou ◽  
Chao Li ◽  
Zhe Shi

In this paper, we develop a novel method of 3D object classification based on a Two-Dimensional Hidden Markov Model (2D HMM). Hidden Markov Models are a widely used methodology for sequential data modeling, of growing importance in the last years. In the proposed approach, each object is decomposed by a spiderweb model and a shape function D2 is computed for each bin. These feature vectors are then arranged in a sequential fashion to compose a sequence vector, which is used to train HMMs. In 2D HMM, we assume that feature vectors are statistically dependent on an underlying state process which has transition probabilities conditioning the states of two neighboring bins. Thus the dependency of two dimensions is reflected simultaneously. To classify an object, the maximized posteriori probability is calculated by a given model and the observed sequence of an unknown object. Comparing with 1D HMM, the 2D HMM gets more information from the neighboring bins. Analysis and experimental results show that the proposed approach performs better than existing ones in database.


Sign in / Sign up

Export Citation Format

Share Document