Total variation regularization via continuation to recover compressed hyperspectral images.

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.