Compressive Deconvolution in Random Mask Imaging

We investigate the problem of reconstructing signals from a subsampled convolution of their modulated versions and a known filter. The problem is studied as applies to a specific imaging architecture that relies on spatial phase modulation by randomly coded “masks.” The diversity induced by the random masks is deemed to improve the conditioning of the deconvolution problem while maintaining sampling efficiency. We analyze a linear model of the imaging system, where the joint effect of the spatial modulation, blurring, and spatial subsampling is represented concisely by a measurement matrix. We provide a bound on the conditioning of this measurement matrix in terms of the number of masks K, the dimension (i.e., the pixel count) of the scene image L, and certain characteristics of the blurring kernel and subsampling operator. The derived bound shows that the stable deconvolution is possible with high probability even if the number of masks (i.e., K) is as small as L log L /N , meaning that the total number of (scalar) measurements is within a logarithmic factor of the image size. Furthermore, beyond a critical number of masks determined by the extent of blurring and subsampling, use of every additional mask improves the conditioning of the measurement matrix. We also consider a more interesting scenario where the target image is known to be sparse. We show that under mild conditions on the blurring kernel, with high probability the measurement matrix is a restricted isometry when the number of masks is within a logarithmic factor of the sparsity of the scene image. Therefore, the scene image can be reconstructed using any of the well-known sparse recovery algorithms such as the basis pursuit. The bound on the required number of masks grows linearly in sparsity of the scene image but logarithmically in its ambient dimension. The bound provides a quantitative view of the effect of the blurring and subsampling on the required number of masks, which is critical for designing efficient imaging systems.

[1]  M. Talagrand.  The Generic Chaining , 2005 .

[2]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[3]  M Unser,et al.  3‐D PSF fitting for fluorescence microscopy: implementation and localization application , 2013, Journal of microscopy.

[4]  Justin K. Romberg,et al.  Compressive Sensing by Random Convolution , 2009, SIAM J. Imaging Sci..

[5]  Daniel L Marks,et al.  Compressive holography. , 2009, Optics express.

[6]  E. Candès,et al.  Compressive fluorescence microscopy for biological and hyperspectral imaging , 2012, Proceedings of the National Academy of Sciences.

[7]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[8]  Holger Rauhut,et al.  Compressive Sensing with structured random matrices , 2012 .

[9]  R. M. Willett,et al.  Compressed sensing for practical optical imaging systems: A tutorial , 2011, IEEE Photonics Conference 2012.

[10]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[11]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[12]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[13]  T. R. Gosnell,et al.  Digital Image Reconstruction: Deblurring and Denoising , 2005 .

[14]  Yonina C Eldar,et al.  Super-resolution and reconstruction of sparse sub-wavelength images. , 2009, Optics express.

[15]  K. Siddaraju,et al.  DIGITAL IMAGE RESTORATION , 2011 .

[16]  Justin K. Romberg,et al.  Restricted Isometries for Partial Random Circulant Matrices , 2010, ArXiv.

[17]  Henry Arguello,et al.  Compressive Coded Aperture Spectral Imaging: An Introduction , 2014, IEEE Signal Processing Magazine.

[18]  S. Foucart.  A note on guaranteed sparse recovery via ℓ1-minimization , 2010 .

[19]  H. Rauhut.  Compressive Sensing and Structured Random Matrices , 2009 .

[20]  Massimo Fornasier,et al.  Theoretical Foundations and Numerical Methods for Sparse Recovery , 2010, Radon Series on Computational and Applied Mathematics.

[21]  S. Foucart.  Sparse Recovery Algorithms: Sufficient Conditions in Terms of RestrictedIsometry Constants , 2012 .

[22]  Holger Rauhut,et al.  Suprema of Chaos Processes and the Restricted Isometry Property , 2012, ArXiv.

[23]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..

[24]  Massimo Fornasier,et al.  Compressive Sensing and Structured Random Matrices , 2010 .