Total Variation Regularization via Continuation to Recover Compressed Hyperspectral Images
Authors:
- 26 November 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 24 (1) , 284-293
Abstract
In this paper, we investigate a low-complexity scheme for decoding compressed hyperspectral image data. We have exploited the simplicity of the subgradient method by modifying a total variation-based regularization problem to include a residual constraint, employing convex optimality conditions to provide equivalency between the original and reformed problem statements. A scheme that utilizes spectral smoothness by calculating informed starting points to improve the rate of convergence is introduced. We conduct numerical experiments, using both synthetic and real hyperspectral data, to demonstrate the effectiveness of the reconstruction algorithm and the validity of our method for exploiting spectral smoothness. Evidence from these experiments suggests that the proposed methods have the potential to improve the quality and run times of the future compressed hyperspectral image reconstructions.Keywords
This publication has 19 references indexed in Scilit:
- Joint trace/TV norm minimization: A new efficient approach for spectral compressive imaging2012
- Fast alternating linearization methods for minimizing the sum of two convex functionsMathematical Programming, 2012
- The ASTER spectral library version 2.0Remote Sensing of Environment, 2009
- The Split Bregman Method for L1-Regularized ProblemsSIAM Journal on Imaging Sciences, 2009
- Single-pixel imaging via compressive samplingIEEE Signal Processing Magazine, 2008
- Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse ProblemsIEEE Journal of Selected Topics in Signal Processing, 2007
- Compressive Sensing [Lecture Notes]IEEE Signal Processing Magazine, 2007
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Mirror descent and nonlinear projected subgradient methods for convex optimizationOperations Research Letters, 2003
- A method of conjugate subgradients for minimizing nondifferentiable functions1975