By Topic

A nested recursive approach to MAP estimation based on Gauss-Markov random fields

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

3 Author(s)
Kauthold, J. ; BME Dept., Boston Univ., MA, USA ; Karl, W.C. ; Castanon, D.A.

Many large multidimensional space-time signal processing and data inversion applications (e.g. deconvolution) require some form of regularization to extract meaningful information. A popular approach to regularizing such problems in a statistical context is via a Gauss-Markov random field (GMRF) prior model in a maximum a posteriori (MAP) estimation framework. While providing good reconstructions, the high dimensionality of these problems can lead to prohibitive computational constraints which limit their practical applicability, particularly in real or near-real time applications. It has been shown that GMRF models possess a particular recursive structure. Conversely, complementary work in suboptimal filtering has been based on reduced order GMRF modeling. In, this work, we combine these two results to present a suboptimal filter design which repeatedly takes advantage of this recursive GMRF structure to subdivide a large problem into a series of smaller, more tractable problems. In this way we present a method for approximate, model-based, recursive solution to such high dimensional problems based on their inherent recursive structure

Published in:

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on  (Volume:2 )

Date of Conference:

4-7 Oct 1998