Filtered gradient reconstruction algorithm for compressive spectral imaging

被引:4
作者
Mejia, Yuri [1 ]
Arguello, Henry [2 ]
机构
[1] Univ Ind Santander, Dept Elect Engn, Calle 9 Carrera 27, Bucaramanga 680002, Colombia
[2] Univ Ind Santander, Dept Comp Sci, Calle 9 Carrera 27, Bucaramanga 680002, Colombia
关键词
spectral imaging; structured matrices; compressive sensing; gradient projection reconstruction algorithm; filtering; CODED-APERTURE DESIGN; PROJECTION;
D O I
10.1117/1.OE.56.4.041306
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Compressive sensing matrices are traditionally based on random Gaussian and Bernoulli entries. Nevertheless, they are subject to physical constraints, and their structure unusually follows a dense matrix distribution, such as the case of the matrix related to compressive spectral imaging (CSI). The CSI matrix represents the integration of coded and shifted versions of the spectral bands. A spectral image can be recovered from CSI measurements by using iterative algorithms for linear inverse problems that minimize an objective function including a quadratic error term combined with a sparsity regularization term. However, current algorithms are slow because they do not exploit the structure and sparse characteristics of the CSI matrices. A gradient-based CSI reconstruction algorithm, which introduces a filtering step in each iteration of a conventional CSI reconstruction algorithm that yields improved image quality, is proposed. Motivated by the structure of the CSI matrix, Phi, this algorithm modifies the iterative solution such that it is forced to converge to a filtered version of the residual Phi(T)(y), where y is the compressive measurement vector. We show that the filtered-based algorithm converges to better quality performance results than the unfiltered version. Simulation results highlight the relative performance gain over the existing iterative algorithms. (C) 2016 Society of Photo-Optical Instrumentation Engineers (SPIE)
引用
收藏
页数:11
相关论文
共 40 条
[1]   Fast Image Recovery Using Variable Splitting and Constrained Optimization [J].
Afonso, Manya V. ;
Bioucas-Dias, Jose M. ;
Figueiredo, Mario A. T. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2010, 19 (09) :2345-2356
[2]  
[Anonymous], 2010, CONVEX OPTIMIZATION
[3]   Compressive Coded Aperture Spectral Imaging [J].
Arce, Gonzalo R. ;
Brady, David J. ;
Carin, Lawrence ;
Arguello, Henry ;
Kittle, David S. .
IEEE SIGNAL PROCESSING MAGAZINE, 2014, 31 (01) :105-115
[4]   Colored Coded Aperture Design by Concentration of Measure in Compressive Spectral Imaging [J].
Arguello, Henry ;
Arce, Gonzalo R. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (04) :1896-1908
[5]   Higher-order computational model for coded aperture spectral imaging [J].
Arguello, Henry ;
Rueda, Hoover ;
Wu, Yuehao ;
Prather, Dennis W. ;
Arce, Gonzalo R. .
APPLIED OPTICS, 2013, 52 (10) :D12-D21
[6]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[7]   NESTA: A Fast and Accurate First-Order Method for Sparse Recovery [J].
Becker, Stephen ;
Bobin, Jerome ;
Candes, Emmanuel J. .
SIAM JOURNAL ON IMAGING SCIENCES, 2011, 4 (01) :1-39
[8]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[9]   Compressive tomography [J].
Brady, David J. ;
Mrozack, Alex ;
MacCabe, Ken ;
Llull, Patrick .
ADVANCES IN OPTICS AND PHOTONICS, 2015, 7 (04) :756-813
[10]   A subspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems [J].
Branch, MA ;
Coleman, TF ;
Li, YY .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1999, 21 (01) :1-23