By Topic

Compound Gauss-Markov random fields for image estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fure-Chinq Jeng ; Bellcore Morristown, NH, USA ; Woods, J.W.

Algorithms for obtaining approximations to statistically optimal estimates for images modeled as compound Gauss-Markov random fields are discussed. The authors consider both the maximum a posteriori probability (MAP) estimate and the minimum mean-squared error (MMSE) estimate for image estimation and image restoration. Compound image models consist of several submodels having different characteristics along with an underlying structure model which govern transitions between these image submodels. Two different compound random field models are employed, the doubly stochastic Gaussian (DSG) random field and a compound Gauss-Markov (CGM) random field. The authors present MAP estimators for DSG and CGM random fields using simulated annealing. A fast-converging algorithm called deterministic relaxation, which, however, converges to only a locally optimal MAP estimate, is also presented as an alternative for reducing computational loading on sequential machines. For comparison purposes, the authors include results on the fixed-lag smoothing MMSE estimator for the DSG field and its suboptimal M-algorithm approximation

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 3 )