Paper
26 February 2008 Blind reconstruction of sparse images with unknown point spread function
Author Affiliations +
Proceedings Volume 6814, Computational Imaging VI; 68140K (2008) https://doi.org/10.1117/12.779253
Event: Electronic Imaging, 2008, San Jose, California, United States
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kyle Herrity, Raviv Raich, and Alfred O. Hero III "Blind reconstruction of sparse images with unknown point spread function", Proc. SPIE 6814, Computational Imaging VI, 68140K (26 February 2008); https://doi.org/10.1117/12.779253
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Point spread functions

Reconstruction algorithms

Algorithm development

Magnetism

Deconvolution

Image restoration

Convolution

Back to Top