Expectation-maximization algorithms, null spaces, and MAP image restoration

A computationally efficient, easily implementable algorithm for MAP restoration of images degraded by blur and additive correlated Gaussian noise using Gibbs prior density functions is derived. This algorithm is valid for a variety of complete data spaces. The constraints upon the complete data spac...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on image processing Vol. 4; no. 8; pp. 1084 - 1095
Main Authors: Hebert, T.J., Keming Lu
Format: Journal Article
Language:English
Published: New York, NY IEEE 01-08-1995
Institute of Electrical and Electronics Engineers
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A computationally efficient, easily implementable algorithm for MAP restoration of images degraded by blur and additive correlated Gaussian noise using Gibbs prior density functions is derived. This algorithm is valid for a variety of complete data spaces. The constraints upon the complete data space arising from the Gaussian image formation model are analyzed and a motivation is provided for the choice of the complete data, based upon the ease of computation of the resulting EM algorithms. The overlooked role of the null space of the blur operator in image restoration is introduced. An examination of this role reveals an important drawback to the use of the simulated annealing algorithm in maximizing a specific class of functionals. An alternative iterative method for computing the nullspace component of a vector is given. The ability of a simple Gibbs prior density function to enable partial recovery of the component of an image within the nullspace of the blur operator is demonstrated.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1057-7149
1941-0042
DOI:10.1109/83.403415