DocumentCode :
3607398
Title :
Compressive Deconvolution in Random Mask Imaging
Author :
Bahmani, Sohail ; Romberg, Justin
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Volume :
1
Issue :
4
fYear :
2015
Firstpage :
236
Lastpage :
246
Abstract :
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 crit- cal for designing efficient imaging systems.
Keywords :
convolution; deconvolution; image reconstruction; image sampling; matrix algebra; probability; random processes; blurring kernel; compressive deconvolution; measurement matrix; probability; random mask imaging; scene image reconstruction; scene image sparsity; signal reconstruction; sparse recovery algorithms; spatial phase modulation; spatial subsampling; subsampled convolution; Convolution; Deconvolution; Image reconstruction; Lenses; Modulation; Sparse matrices; Coded mask imaging; compressive sensing; deconvolution; property; restricted isometry; sparse recovery;
fLanguage :
English
Journal_Title :
Computational Imaging, IEEE Transactions on
Publisher :
ieee
ISSN :
2333-9403
Type :
jour
DOI :
10.1109/TCI.2015.2485941
Filename :
7286775
Link To Document :
بازگشت