Abstract

We introduce a novel regularization function for hyperspectral image (HSI), which is based on the nuclear norms of gradient images. Unlike conventional low-rank priors, we achieve a gradient-based low-rank approximation by minimizing the sum of nuclear norms associated with rotated planes in the gradient of a HSI. Our method explicitly and simultaneously exploits the correlation in the spectral domain as well as the spatial domain. Our method exploits the low-rankness of a global region to enhance the dimensionality reduction by the prior. Since our method considers the low-rankness in the gradient domain, it more sensitively detects anomalous variations. Our method achieves high-fidelity image recovery using a single regularization function without the explicit use of any sparsity-inducing priors such as ℓ0, ℓ1 and total variation (TV) norms. We also apply this regularization to a gradient-based robust principal component analysis and show its superiority in HSI decomposition. To demonstrate, the proposed regularization is validated on a variety of HSI reconstruction/decomposition problems with performance comparisons to state-of-the-art methods its superior performance.

Highlights

  • We extend this to hyperspectral image (HSI) image decomposition by applying Total Nuclear Norms of Gradients (TNNG) as follows: min λL(x) + ksk1 x,s s.t

  • We evaluated the performance with PSNR and Structural Similarity Index (SSIM) between the corrupted image y and the obtained HSI x in (12) and compared it with the low-rank based decomposition methods, TRPCA [41] and

  • We focused on the HSI property where the gradient image possesses strong interband correlation and utilized this property in the convex optimization

Read more

Summary

Introduction

Convex optimization techniques have gained broad interest in many hyperspectral image processing applications including image restoration [1,2,3,4,5,6,7,8], decomposition [9,10], unmixing [11,12,13], classification [14,15], and target detection [16] The success of such tasks strongly depends on regularization, which is based on a priori information of a latent clear image. Some convex optimization methods specializing in low-rank regularization have been proposed in recent years [22,23]; these use the spectral information directly and achieve high-quality image restoration

Methods
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call