ML parameter estimation for Markov random fields with applications to Bayesian tomography

被引:120
作者
Saquib, SS [1 ]
Bouman, CA
Sauer, K
机构
[1] Polaroid Corp, Cambridge, MA 02139 USA
[2] Purdue Univ, Sch Elect Engn, W Lafayette, IN 47907 USA
[3] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
基金
美国国家科学基金会;
关键词
D O I
10.1109/83.701163
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Markov random fields (MRF's) have been widely used to model images in Bayesian frameworks for image reconstruction and restoration. Typically, these MRF models have parameters that allow the prior model to be adjusted for best performance. However, optimal estimation of these parameters (sometimes referred to as hyperparameters) is difficult in practice for two reasons: i) direct parameter estimation for MRF's is known to be mathematically and numerically challenging; ii) parameters can not be directly estimated because the true image cross section is unavailable. In this paper, we propose a computationally efficient scheme to address both these difficulties for a general class of MRF models, and we derive specific methods of parameter estimation for the MRF model known as generalized Gaussian MRF (GGMRF). The first section of the paper derives methods of direct estimation of scale and shape parameters for a general continuously valued MRF. For the GGMRF case, we show that the ML estimate of the scale parameter, sigma, has a simple closed-form solution, and we present an efficient scheme for computing the ML estimate of the shape parameter, p, by an off-line numerical computation of the dependence of the partition function on p. The second section of the paper presents a fast algorithm for computing ML parameter estimates when the true image is unavailable. To do this, we use the expectation maximization (EM) algorithm. We develop a fast simulation method to replace the E-step, and a method to improve parameter estimates when the simulations are terminated prior to convergence. Experimental results indicate that our fast algorithms substantially reduce computation and result in good scale estimates for real tomographic data sets.
引用
收藏
页码:1029 / 1044
页数:16
相关论文
共 57 条
[1]  
[Anonymous], 1964, Handbook of mathematical functions
[2]   STATISTICAL INFERENCE FOR PROBABILISTIC FUNCTIONS OF FINITE STATE MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T .
ANNALS OF MATHEMATICAL STATISTICS, 1966, 37 (06) :1554-&
[3]   A MAXIMIZATION TECHNIQUE OCCURRING IN STATISTICAL ANALYSIS OF PROBABILISTIC FUNCTIONS OF MARKOV CHAINS [J].
BAUM, LE ;
PETRIE, T ;
SOULES, G ;
WEISS, N .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (01) :164-&
[4]  
BESAG J, 1986, J R STAT SOC B, V48, P259
[5]  
BESAG J, 1989, J APPL STAT, V16, P395, DOI DOI 10.1080/02664768900000049
[7]  
Blake A., 1987, Visual Reconstruction
[8]   A unified approach to statistical tomography using coordinate descent optimization [J].
Bouman, CA ;
Sauer, K .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1996, 5 (03) :480-492
[9]  
BOUMAN CA, 1994, P IEEE INT C AC SPEE, V5, P537
[10]  
BOUMAN CA, 1995, P INT C AC SPEECH SI, P2907