Image segmentation and classification based on a 2D distributed hidden Markov model

被引:2
作者
Ma, Xiang [1 ]
Schonfeld, Dan [1 ]
Khokhar, Ashfaq [1 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60607 USA
来源
VISUAL COMMUNICATIONS AND IMAGE PROCESSING 2008, PTS 1 AND 2 | 2008年 / 6822卷
关键词
I mage classification; hidden Markov models; image segmentation;
D O I
10.1117/12.766112
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a two-dimensional distributed hidden Markov model (2D-DHMM), where dependency of the state transition probability on any state is allowed as long as causality is preserved. The proposed 2D-DHMM model is result of a novel solution to a more general non-causal two-dimensional hidden Markov model (2D-HMM) that we proposed. Our proposed models can capture, for example, dependency among diagonal states, which can be critical in many image processing applications, for example, image segmentation. A new sets of basic image patterns are designed to enrich the variability of states, which in return largely improves the accuracy of state estimations and segmentation performance. We provide three algorithms for the training and classification of our proposed model. A new Expectation-Maximization (EM) algorithm suitable for estimation of the new model is derived, where a novel General Forward-Backward (GFB) algorithm is proposed for recursive estimation of the model parameters. A new conditional independent subset-state sequence structure decomposition of state sequences is proposed for the 2D Viterbi algorithm. Application to aerial image segmentation shows the superiority of our model compared to the existing models.
引用
收藏
页数:8
相关论文
共 19 条
  • [1] [Anonymous], TR97021 U C BERK DEP
  • [2] BASHIR F, IEEE T IMAGE PROCESS, V16, P1912
  • [3] A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS
    BAUM, LE
    PETRIE, T
    SOULES, G
    WEISS, N
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01): : 164 - &
  • [4] BRAND M, 1997, IEEE COMP SOC C COMP, V2277, P994
  • [5] BRAND M, 1997, COUPLED HIDDEN MARKO, V405
  • [6] MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM
    DEMPSTER, AP
    LAIRD, NM
    RUBIN, DB
    [J]. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01): : 1 - 38
  • [7] DEVIJVER PA, 1988, SIGNAL PROCESS, V4, P23
  • [8] DEVIJVER PA, 1985, PATTERN RECOGN, V2, P113
  • [9] KUO SS, 1993, P INT C AC SPEECH SI, V5, P81
  • [10] LEVIN E, 1992, P ICASSP, V3, P149