Share Email Print
cover

Proceedings Paper

Blind reconstruction of sparse images with unknown point spread function
Author(s): Kyle Herrity; Raviv Raich; Alfred O. Hero
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We consider the image reconstruction problem when the original image is assumed to be sparse and when partial knowledge of the point spread function (PSF) is available. In particular, we are interested in recovering the magnetization density given magnetic resonance force microscopy (MRFM) data, and we present an iterative alternating minimization algorithm (AM) to solve this problem. A smoothing penalty is introduced on allowable PSFs to improve the reconstruction. Simulations demonstrate its performance in reconstructing both the image and unknown point spread function. In addition, we develop an optimization transfer approach to solving a total variation (TV) blind deconvolution algorithm presented in a paper by Chan and Wong. We compare the performance of the AM algorithm to the blind TV algorithm as well as to a TV based majorization-minimization algorithm developed by Figueiredo et al.

Paper Details

Date Published: 26 February 2008
PDF: 11 pages
Proc. SPIE 6814, Computational Imaging VI, 68140K (26 February 2008); doi: 10.1117/12.779253
Show Author Affiliations
Kyle Herrity, Univ. of Michigan (United States)
Raviv Raich, Oregon State Univ. (United States)
Alfred O. Hero, Univ. of Michigan (United States)


Published in SPIE Proceedings Vol. 6814:
Computational Imaging VI
Charles A. Bouman; Eric L. Miller; Ilya Pollak, Editor(s)

© SPIE. Terms of Use
Back to Top