Computational Hyperspectral Imaging Based on Dimension-Discriminative Low-Rank Tensor Recovery

Shipeng Zhang, Lizhi Wang, Ying Fu, Xiaoming Zhong, Hua Huang

Introduction

Hyperspectral imaging (HSI) captures a scene across dozens or hundreds of narrow spectral bands, providing a rich "3D cube" of data. While powerful, capturing this much information typically requires slow scanning. Computational HSI systems, such as Coded Aperture Snapshot Spectral Imaging (CASSI), solve this by "squashing" the 3D cube into a single 2D snapshot. The challenge lies in the "un-squashing"—reconstructing the original 3D cube from a single 2D measurement.

The Pitfalls of Vectorization

A major flaw in many existing reconstruction algorithms is the "unfolding" of 3D data into long 1D vectors. This process destroys the intrinsic structural relationships between pixels. As shown in Figure 1, a smooth 3D surface representing a local image patch becomes a jagged, chaotic 1D signal after vectorization. This "breaks" the prior information that reconstruction algorithms rely on to recover the scene.

Figure 1: Comparison of (a) an image patch, (b) its 3D surface representation, and (c) the resulting jagged 1D signal after vectorization.

The DLTR Framework

To address these issues, the authors introduce the Dimension-discriminative Low-rank Tensor Recovery (DLTR) model. Instead of 1D vectorization, DLTR operates on high-order tensors that preserve data diversity.

The method begins with Nonlocal Tensor Construction. The image is partitioned into cubic patches, and for each patch, the algorithm finds its $k$-nearest neighbors across the image. These similar patches are grouped to build a high-order tensor, capturing spatial self-similarity, spectral correlation, and joint correlation simultaneously (see Figure 6).

Figure 6: The construction of a joint correlation tensor using nonlocal similarity, grouping a key patch with its most similar neighbors.

Dimension-Discriminative Weighting

The core innovation of DLTR is the realization that different "modes" (dimensions) of these tensors have different "ranks." By analyzing singular values, the researchers found that the "similarity" dimension (representing nonlocal patches) is much more redundant than the spatial or spectral dimensions.

DLTR uses a weighted regularization scheme with a non-convex log-sum penalty to approximate the rank. By assigning different weights to different dimensions, the model avoids over-smoothing important features while effectively compressing noise.

Key Results

The DLTR method consistently outperformed both traditional "prior-knowledge" methods and modern deep learning approaches across several benchmarks:

  • Quantitative Gains: On the Columbia dataset, DLTR achieved an average PSNR of 27.15 dB, significantly higher than the next best prior-based method, NSR (26.13 dB).
  • Structural Integrity: SSIM scores were notably higher, often exceeding 0.9 for complex scenes where other methods struggled.
  • Real-World Performance: In tests on physical CASSI hardware, DLTR produced images with much clearer textures and fewer "spectral bleeding" artifacts compared to competing methods.

Conclusion

DLTR demonstrates that treating HSI data as a high-order tensor rather than a collection of vectors leads to superior reconstruction. By adaptively weighting dimensions based on their redundancy, the model provides a robust and flexible framework for computational imaging. Future work will explore applying this dimension-discriminative approach to even more complex imaging systems.

Summary updated

Abstract

Exploiting the prior information is fundamental for the image reconstruction in computational hyperspectral imaging. Existing methods usually unfold the 3D signal as a 1D vector and treat the prior information within different dimensions in an indiscriminative manner, which ignores the high-dimensionality nature of hyperspectral image (HSI) and thus results in poor quality reconstruction. In this paper, we propose to make full use of the high-dimensionality structure of the desired HSI to boost the reconstruction quality. We first build a high-order tensor by exploiting the nonlocal similarity in HSI. Then, we propose a dimension-discriminative low-rank tensor recovery (DLTR) model to characterize the structure prior adaptively in each dimension. By integrating the structure prior in DLTR with the system imaging process, we develop an optimization framework for HSI reconstruction, which is finally solved via the alternating minimization algorithm. Extensive experiments implemented with both synthetic and real data demonstrate that our method outperforms state-of-the-art methods.
BibTeX
@inproceedings{zhang2019computational,
  author = {Shipeng Zhang and Lizhi Wang and Ying Fu and Xiaoming Zhong and Hua Huang},
  title = {{Computational Hyperspectral Imaging Based on Dimension-Discriminative Low-Rank Tensor Recovery}},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year = {2019},
  doi = {10.1109/iccv.2019.01028},
}
Figure