Degradation-Aware Unfolding Half-Shufﬂe Transformer for Spectral Compressive Imaging
Abstract
In coded aperture snapshot spectral compressive imaging (CASSI) systems, hyperspectral image (HSI) reconstruction methods are employed to recover the spatialspectral signal from a compressed measurement.
Among these algorithms, deep unfolding methods demonstrate promising performance but suffer from two issues.
Firstly, they do not estimate the degradation patterns and ill-posedness degree from CASSI to guide the iterative learning.
Secondly, they are mainly CNN-based, showing limitations in capturing long-range dependencies.
In this paper, we propose a principled Degradation-Aware Unfolding Framework (DAUF) that estimates parameters from the compressed image and physical mask, and then uses these parameters to control each iteration.
Moreover, we customize a novel Half-Shufﬂe Transformer (HST) that simultaneously captures local contents and non-local dependencies.
By plugging HST into DAUF, we establish the ﬁrst Transformer-based deep unfolding method, Degradation-Aware Unfolding Half-Shufﬂe Transformer (DAUHST), for HSI reconstruction.
Experiments show that DAUHST surpasses state-of-the-art methods while requiring cheaper computational and memory costs.
Code and models are publicly available at https://github.com/caiyuanhao1998/MST
Introduction
[Figure]
Hyperspectral images (HSIs) have more spectral bands than normal RGB images to store more detailed information.
Thus,
HSIs are widely applied in image recognition [1, 2, 3], object detection [4, 5, 6], tracking [7, 8, 9], medical image processing [10, 11, 12], remote sensing [13, 14, 15, 16], etc.
To obtain HSIs, traditional imaging systems use spectrometers to scan the scenes along the spectral or spatial dimensions, usually requiring a long time.
These imaging systems fail to capture dynamic objects.
Recently, snapshot compressive imaging (SCI) systems [17, 18, 19, 20, 21, 22, 23] have been developed to capture HSIs at video rate.
Among these SCI systems, coded aperture snapshot spectral imaging (CASSI)
[18, 24, 25] stands out for its impressive performance.
CASSI uses a coded aperture and a disperser to modulate the HSI signal at different wavelengths, and then mixes all modulated signal to generate a 2D compressed measurement.
Subsequently, HSI restoration methods are employed to solve the CASSI inverse problem, i.e. , restore the HSIs from the measurement.
These methods are divided into four categories. (i) Model-based methods [18, 26, 27, 28, 29, 30, 31, 32] rely on hand-crafted image priors, e.g. , total variation [30], sparsity [18, 26], low-rank [27], etc.
These methods have theoretically proven properties and can be interpreted.
Yet, these methods need manual parameter tweaking, which slows down reconstruction.
Also, they suffer from limited representation capacity and generalization ability.
(ii) Plug-and-play (PnP) algorithms [33, 34, 35, 36, 37, 38] plug pre-trained denoising networks into traditional model-based methods [35, 39] to solve the HSI reconstruction problem.
Nonetheless, the pre-trained networks in PnP methods are ﬁxed without re-training, therefore limiting the performance.
(iii) End-to- end (E2E) algorithms employ a powerful model, usually a convolutional neural network (CNN) [12, 24, 40, 41], to learn the
E2E mapping function from a measurement to the desired HSIs.
E2E methods enjoy the power of deep learning.
However, they learn a brute-force mapping from the compressed measurement to the underlying spectral images, thereby ignoring the working principles of CASSI systems.
They come without theoretically proven properties, interpretability [42], and ﬂexibility because the imaging models widely differ from each other for various hardware systems.
(iv) Deep unfolding methods [43, 44, 45, 46, 47, 48, 49] adopt a multi -stage network to map the measurement into the HSI cube.
Each stage usually includes two phases, i.e. , linear projection followed by passing the signal through a single-stage network that learns the underlying denoiser prior.
In deep unfolding methods, the network architecture is intuitively interpretable by explicitly characterizing the image priors and the system imaging model.
Besides, these methods also enjoy the power of deep learning and thus have great potential.
Yet, this potential has not been fully explored.
Existing deep unfolding algorithms suffer from two issues.
(a) The iterative learning
is highly related to the CASSI system.
However, current unfolding methods do not estimate CASSI degradation patterns and ill-posedness degree to adjust the linear projection and denoising network in each iteration.
(b) Existing deep unfolding methods are mainly CNN -based, therefore showing limitations in capturing non-local
self
-similarity and
long -range dependencies both critical for HSI
reconstruction.
Recently, the emerging Transformer [50] has provided a solution to tackle the drawbacks of CNN.
Due to its strong capability in modeling the interactions of non-local spatial regions, Transformer has been widely applied in image classiﬁcation [51, 52, 53, 54, 55, 56, 57], object detection [58, 59, 51, 60, 61, 62, 63], semantic segmentation [51, 55, 64, 65, 66, 67, 68], human pose estimation [69, 70, 71, 72, 73, 74, 75], image restoration [76, 77, 78, 79, 80, 81, 82, 83, 84, 85], etc.
Yet, the use of Transformer is confronted with two main issues.
(a) The computational complexity of global Transformer [53] is quadratic to the spatial dimensions.
This nontrivial cost is sometimes unaffordable.
(b) The receptive ﬁelds of local Transformer [51] are limited within position-speciﬁc windows.
As a result, some tokens with highly-related contents can not match each other when computing the self-attention.
To address the above problems, in this paper, we ﬁrstly formulate a principled Degradation-Aware
Unfolding Framework (DAUF)
based on maximum a posteriori (MAP) theory for HSI reconstruction.
Different from previous deep unfolding methods, our DAUF implicitly estimates informative parameters from the degraded compressed measurement and the physical mask used in the modulation.
Then
DAUF feeds the parameters, which capture key cues of CASSI degradation patterns and ill-posedness degree, into each iteration to adaptively scale the linear projection and provide the noise level information for the denoising network.
Secondly, we design a novel Half-Shufﬂe Transformer (HST) as the denoiser prior in each iteration.
Our HST can jointly extract local contextual information and model non-local dependencies, while requiring much cheaper computational costs than global Transformer.
We achieve this by customizing a Half-Shufﬂe Multi-head Self-Attention (HS-MSA) mechanism that composes the basic unit of HST.
More speciﬁcally, our HS-MSA has two branches, i.e. , local branch and non - local branch .
The local branch calculates the self-attention within the local window while the non - local branch shufﬂes the tokens and captures cross-window interactions.
We plug HST into
DAUF to establish an iterative architecture, Degradation-Aware Unfolding Half-Shufﬂe Transformer (DAUHST).
With the proposed techniques, DAUHST models dramatically outperform state-of-the-art (SOTA) deep unfolding methods with the same number of stages by over 4 dB , as shown in Fig.
In a nutshell, our contributions can be summarized as follows:
(i)
We formulate a principled MAP-based unfolding framework DAUF for HSI reconstruction. (ii)
We propose a novel Transformer HST and plug it into DAUF to establish DAUHST.
To the best of our knowledge, DAUHST is the ﬁrst Transformer-based deep unfolding method for HSI restoration.
(iii) DAUHST outperforms SOTA methods by a large margin while requiring cheaper computational and memory costs.
Besides, DAUHST yields more visually pleasant results in real HSI reconstruction.
[Figure]
conv3 × 3 stride= 𝐳 $ 𝐱 & 𝐱 ’ 𝐳 & 𝐳 ’ 𝐳 ()& 𝐱 ( 𝐳 ( Φ y Φ y
( y , Φ ) ( y , Φ ) ( y , Φ ) ( y , Φ )
αα 2 βββ K α K
( α , β )
D
D D
[Figure]
P
P E
Proposed Method 2.1 Degradation Model of CASSI
In CASSI, we denote the vectorized measurement as y ∈ R n , where n = H ( W + d
( N λ − 1)) .
H , W , d , and N λ denote the HSI’s height, width, shifting step in dispersion, and total number of wavelengths.
Given the vectorized shifted HSI signal x ∈ R nN λ and the sensing matrix Φ ∈ R n × nN λ that is determined by the physical mask, the degradation model of CASSI can be formulated as
[Equation]
where n ∈ R n represents the vectorized imaging noise on the measurement.
As analyzed in [86, 87, 88], Φ is a fat, sparse, and highly structured matrix that is hard to handle.
Please refer to the supplementary material for details about the mathematical model of CASSI.
Then the task of HSI reconstruction is given y (captured by the camera) and Φ (calibrated based on pre-design), solving x .
2.2 Degradation-Aware Unfolding Framework
Previous unfolding frameworks [43, 44, 45, 46] do not estimate the CASSI degradation patterns to adjust the iterative learning.
To alleviate this limitation, we formulate a principled Degradation-Aware
Unfolding Framework (DAUF) as depicted in Fig.
DAUF starts from the MAP theory.
In particular, the original HSI signal could be estimated by minimizing the following energy function as
[Equation]
where 12 || y −
Φx
|| 2 is the data ﬁdelity term, R ( x ) is the image prior term, and τ is a hyperparameter balancing the importance.
By introducing an auxiliary variable z , Eq.
(2) can be reformulated as
[Equation]
This is a constrained optimization problem.
To obtain an unfolding inference, we adopt half-quadratic splitting (HQS) algorithm for its simplicity and fast convergence.
Then Eq.
(3) is solved by minimizing
[Equation]
where µ is a penalty parameter that forces x and z to approach the same ﬁxed point.
Subsequently,
Eq.
(4) can be solved by decoupling x and z into the following two iterative sub-problems as
[Equation]
where k = 0 , 1 , ... , K − 1 indexes the iteration.
Note that the data ﬁdelity term is associated with a quadratic regularized least-squares problem, i.e. , x k +1 in Eq.
It has a closed-form solution as
[Equation]
where I is an identity matrix.
Since Φ is a fat matrix, ( Φ T Φ + µ I ) will be large and thus we simplify the computation of the inverse problem ( Φ T Φ + µ I ) − 1 by the matrix inversion formula as
[Equation]
− µ − 1 Φ T ( I + Φ µ − 1 Φ T ) − 1 Φ µ − 1 .
By plugging Eq.
(7) into Eq.
(6), we can reformulate Eq.
(6) as
[Equation]
In CASSI systems, ΦΦ T is a diagonal matrix which can be deﬁned as ΦΦ T def = diag { ψ 1 , . . .
, ψ n } .
By plugging ΦΦ T into ( I + Φ µ − 1 Φ T ) − 1 and ( I + Φ µ − 1 Φ T ) − 1 ΦΦ T , we obtain:
[Equation]
Let y def =
[ y 1 , . . .
, y n ] T and [ Φz k ] i denotes the i -th element of Φz k .
We plug Eq.
(9) into Eq.
(8) as
[Equation]
Note that { y i − [ Φz k ] i } ni =1 can be directly updated by y − Φz k , and { ψ i } ni =1 is pre-calculated and stored in ΦΦ T .
Thus, by element-wise computation in Eq.
(10), x k +1 can be updated very efﬁciently.
According to Eq.
(5), the penalty parameter µ should be large enough so that x and z can approach approximately the same ﬁxed point.
This indicates that µ controls the convergence and output of each iteration.
Thus, instead of manually tweaking µ , we set µ as a series of iteration-speciﬁc parameters to be automatically estimated from the CASSI system.
We denote µ in the k -th iteration as µ k .
Returning to Eq.
(5), we also set τ as iteration-speciﬁc parameters and z k +1 can be reformulated as
[Equation]
From the perspective of Bayesian probability, Eq.
(11) is equivalent to denoising image x k +1 with a
Gaussian noise at level (cid:112)
τ
k +1 /µ
k
+
To conveniently solve Eq.
(11), we set [Equation] µ k +1 /τ
k +1 as parameters to be estimated from CASSI.
Let α k def = µ k , α def =
[ α 1 , ..., α K ] , β k def = µ k /τ k , and β def = [ β 1 , ..., β K ] .
Then we can formulate our DAUF as an iterative scheme:
[Equation]
where E denotes the parameter estimator that takes the compressed measurement y and the sensing matrix Φ of the CASSI system as inputs, P equivalent to Eq.
(10) denotes the linear projection, and D represents the Gaussian denoiser solving Eq.
z 0 is initialized by passing the shifted y concatenated with Φ through a conv 1 × 1 (convolution with 1 × 1 kernel).
Fig.
2 shows the architecture of E .
It consists of a conv 1 × 1 , a strided conv 3 × 3 , a global average pooling, and three fully connected layers.
Through E , DAUF captures critical cues from CASSI by learning the degradation patterns and ill-posedness degree caused by the mask-modulation and dispersionintegration.
Parameters α and β estimated by E direct the iterative learning by adaptively scaling the linear projection in Eq.
(10) and providing noise level information for the denoiser prior in Eq.
2.3 Half-Shufﬂe Transformer
When designing the denoiser prior, previous deep unfolding methods [43, 44, 45, 46] mainly adopt
CNNs, showing limitations in capturing long-range dependencies.
Directly applying local and global
Transformers will encounter two problems, i.e. , limited receptive ﬁelds and nontrivial computational costs.
To address these challenges, we propose Half-Shufﬂe Transformer (HST) to play the role of D .
Network Architecture.
As shown in Fig.
3 (a), HST adopts a three-level U-shaped structure built by the basic unit Half-Shufﬂe Attention Block (HSAB).
Firstly , HST uses a conv 3 × 3 to map reshaped x k concatenated with stretched β k into feature X 0 ∈ R H × ˆ W × C , where ˆ W = W + d ( N λ − 1) .
Secondly , X 0 passes through the encoder, bottleneck, and decoder to be embedded into deep feature
X d ∈ R H
× ˆ W × C .
Each level of the encoder or decoder contains an HSAB and a resizing module.
conv3 ×
HSAB HSAB
DownSample
DownSample conv3 ×
HSAB HSAB
UpSample UpSample
HSAB 𝐗 # 𝐗 $ 𝐳 & (a) HST 𝐑
Concat conv1 ×conv1 × 1 Concat 𝐱 ) (d) HS-MSA
L N
FF N
G E L U
G E L U L N
H S - M SA c on v 1 ×
D ep t h - W
i s e c on v 3 ×c on v 1 ×(c)
FFN 𝐖 𝐐 ,𝐖 𝐊 ,𝐖 𝐕 𝐗 /
H a l f S p li t Partition
Partition Shuffle
Unshuffle 𝐐,𝐊,𝐕 𝐐 1 ,𝐊 1 ,𝐕𝐐 01 ,𝐊 01 ,𝐕𝐀𝐀𝐖𝐖𝐗
MSA
MSA
Eq. Eq.
(16) Bottleneck (b) HSAB [𝛽 & ,𝐱 & ]
Encoder
Decoder
LocalBranch
Non-LocalBranch
H ×
̂ W × C
H ×
̂ W ×( N λ +1)
H ×
̂ W × C
H ×
̂ W × N λ
H 2 × ̂ W 2 ×2 C H 2 × ̂ W 2 ×2 C
H 4 × ̂ W 4 ×4 C H 4 × ̂ W 4 ×4 C
H 2 × ̂ W 2 ×2 C
H ×
̂ W × C
H ×
̂ W × C
H ×
̂ W × C
H ×
̂ W × C
M 2 × H ̂ WM 2 × C H ̂ WM 2 × M 2 × C
H ̂ WM 2 × M 2 × C M 2 × H ̂ WM 2 × C
H ×
̂ W × C
H 2 × ̂ W 2 ×2 C
In Fig.
3 (b), HSAB consists of two layer normalization (LN), an HS-MSA, and a Feed-Forward
Network (FFN) that is detailed in Fig.
3 (c).
The downsampling and upsampling modules are strided conv 4 × 4 and deconv 2 × 2 .
Finally , a conv 3 × 3 operates on X d to generate a residual image
R ∈ R H
× ˆ W × N λ .
The output denoised image z k is obtained by the sum of x k and reshaped R .
Half-Shufﬂe Multi-head Self-Attention.
The most important element of HSAB is the proposed
Half-Shufﬂe Multi-head Self-Attention (HS-MSA) module.
Fig.
3 (d) depicts the HS-MSA used in the ﬁrst level.
The input tokens of HS-MSA are denoted as X in ∈ R H × ˆ W × C .
Subsequently, X in is linearly projected into query Q ∈ R H
× ˆ W × C , key K ∈ R H
× ˆ W × C , and value V ∈ R H
× ˆ W × C as
[Equation]
where W Q , W K ,
W V ∈ R C × C are learnable parameters and biases are omitted for simpliﬁcation.
Our HS-MSA combines the advantages of global MSA [53] and local window-based MSA [51], i.e. , HS-MSA can jointly capture local contextual information through the local branch and model long-range dependencies through the non-local branch , all while being computationally cheaper than global MSA.
Speciﬁcally, Q , K , V are split into two equal parts along the channel dimension as
[Equation]
(14) where Q l , K l , V l ∈ R H × ˆ W × C 2 are fed into the local branch to capture local contents, while
Q nl , K nl , V nl ∈ R H × ˆ W × C 2 pass through the non - local branch to model non-local dependencies.
Local Branch.
The local branch computes MSA within position-speciﬁc windows.
As shown in the upper path of Fig.
3 (d), Q l , K l , V l are partitioned into non-overlapping windows of size M × M .
Then they are reshaped into R H ˆ WM 2 ×
M 2 × C 2 .
Subsequently, Q l , K l , V l are split along the channel wise into h heads: Q l =
[ Q 1 l , . .
, Q hl ] , K l =
[ K 1 l , . .
, K hl ] , and V l =
[ V 1 l , . .
, V hl ] .
The dimension of each head is d h = C 2 h .
Note that Fig.
3 (d) depicts the situation with h = 1 and some details are omitted for simpliﬁcation.
The local self-attention A il is calculated inside each head as
[Equation]
where P il ∈ R M 2 × M 2 are learnable parameters embedding the position information.
Non-local Branch.
The non - local branch computes cross-window interactions through shufﬂe operations inspired by ShufﬂeNet [89].
In particular, Q nl , K nl , V nl ∈ R H
× ˆ W × C 2 are ﬁrstly partitioned into non-overlapping windows with size M × M .
Then their shapes are transposed from
R H
ˆ WM
× M 2 × C 2 to R M 2 × H ˆ WM 2 ×
C 2 to shufﬂe the positions of tokens and establish inter-window dependencies.
Q nl , K nl , V nl are split into h heads: Q nl =
[ Q 1 nl , . .
, Q hnl ] , K nl =
[ K 1 nl , . .
, K hnl ] ,
[Table]
and V nl =
[ V 1 nl , . .
, V hnl ] .
Then the non-local self-attention A inl is computed in each head as
[Equation]
where P inl ∈ R H
ˆ WM
× H ˆ WM 2 are learnable parameters representing the position embedding.
Subsequently,
A inl ∈ R M 2 ×
H
ˆ WM 2 ×
d h is unshufﬂed by being transposed to shape R H
ˆ WM 2 ×
M 2 × d h .
Then the outputs of local branch in Eq.
(15) and non - local branch in Eq.
(16) are aggregated by a linear projection as
[Equation]
(17) where W il , W inl ∈ R d h × C refer to learnable parameters.
We reshape the result of Eq.
(17) to obtain the output X out ∈ R H
× ˆ W × C .
Instead of globally sampling all tokens, HS-MSA builds inter-window correlations by shufﬂe operations.
The self-attention is calculated in the local window but with tokens from non-local regions.
Therefore, HS-MSA is much computationally cheaper than global MSA.
Experiment 3.1 Experiment Setup
Similar to [24, 40, 45, 47, 81], 28 wavelengths are selected from 450nm to 650nm and derived by spectral interpolation manipulation for the HSI data.
Simulation and real experiments are conducted.
Simulation Dataset.
We adopt two datasets, i.e. , CAVE [92] and KAIST [93] for simulation experiments.
The CAVE dataset consists of 32 HSIs with spatial size 512 × 512.
The KAIST dataset contains 30 HSIs of spatial size 2704 × 3376.
Following the settings of [24, 40, 45, 47, 81], the CAVE dataset is adopted as the training set while 10 scenes from the KAIST dataset are selected for testing.
Real Dataset.
Five real HSIs collected by the CASSI system developed in [24] are used for testing. [Figure]
Implementation Details.
We implement DAUHST by Pytorch.
All DAUHST models are trained with Adam [94] optimizer ( β 1 = 0.9 and β 2 = 0.999) using Cosine Annealing scheme [95] [-for 
 [Figure] epochs-]forepochs on an RTX 3090 GPU.
The initial learning rate is 4 × 10 − 4 .
Patches with spatial sizes 256 ×and 660 × 660 are randomly cropped from the 3D HSI cubes with 28 channels as training samples for the simulation and real experiments.
The shifting step d in the dispersion is set to 2.
The batch size is 5.
We set the basic channel C = N λ
= 28 to store HSI information.
The weights of D in different stages are unshared.
Data augmentation includes random rotation and ﬂipping.
The training objective is to minimize the Root Mean Square Error (RMSE) between reconstructed and ground-truth HSIs.
3.2 Quantitative Comparisons with State-of-the-Art Methods
Tab. 1 compares the results of DAUHST and 16 SOTA methods including three model-based methods (TwIST [90], GAP-TV [30], and DeSCI [27]), one PnP method (DIP-HSI [36]), seven E2E methods ( λ -Net [41], TSA-Net [24], HDNet [40], MST [81], MST++ [82], CST [83], and BIRNAT [91]), and ﬁve deep unfolding methods (HSSP [44], DNU [43], DGSMP [47], GAP-Net [45], and ADMMNet [46]) on 10 simulation scenes.
All algorithms are tested with the same settings as [47, 81].
(i) Our best model DAUHST-9stg (9-stage DAUHST) yields very impressive results, i.e. , 38.36 dB in PSNR and 0.967 in SSIM.
DAUHST-9stg signiﬁcantly outperforms two recent SOTA methods
BIRNAT [91] and MST-L [81] by 0.78 and 3.18 dB suggesting the effectiveness of our method.
(ii) Our DAUHST models dramatically surpass SOTA methods while requiring cheaper computational and memory costs.
For instance, when compared with the only one Transformer-based E2E method MST, our DAUHST-2stg outperforms MST-L by 1.16 dB but only costs 68.9% (1.40 / 2.03) Params and 65.5% (18.44 / 28.15) FLOPS.
When compared with CNN-based E2E methods, DAUHST-3stg surpasses HDNet, TSA-Net and λ -Net by 2.24, 5.75, and 8.68 dB while only requiring 87.8%, 4.7%, 3.3% Params and 17.6%, 24.7%, 23.0% FLOPS.
When compared with RNN-based E2E method BIRNAT, our DAUHST-5stg is 0.17 dB higher but only costs 2.1% FLOPS and 78.2% Params
Fig.
1 plots the PSNR-FLOPS comparisons of DAUHST and SOTA unfolding methods.
DAUHST outperforms other competitors with the same number of stages by very large margins, over 4 dB .
3.3 Qualitative Comparisons with State-of-the-Art Methods
Simulation HSI Reconstruction.
Fig.
4 depicts the simulation HSI reconstruction comparisons between our DAUHST and other SOTA methods on Scene 2 with 4 (out of 28) spectral channels.
The top-right part shows the zoomed-in patches of the yellow boxes in the entire HSIs (bottom).
As can be observed that our DAUHST-9stg is more favorable to reconstruct visually pleasant HSIs with more
[Figure]
detailed contents, cleaner textures, and fewer artifacts while preserving the spatial smoothness of homogeneous regions.
In contrast, previous methods either yield over-smooth results compromising ﬁne-grained structures, or introduce undesired chromatic artifacts and blotchy textures that are absent in the ground truth (GT).
The top-middle part illustrates the density-wavelength spectral curves corresponding to the green boxes identiﬁed as a and b in the RGB image (top-left).
The spectral curves of DAUHST-9stg achieve the highest correlation and coincidence with the reference curves, showing the advantage of our proposed DAUHST in spectral-dimension consistency reconstruction.
Real HSI Reconstruction.
We further evaluate the effectiveness of DAUHST in real HSI reconstruction.
Following the same settings as [24, 47, 81] for a fair comparison, we re-train DAUHST-3stg with the real mask on the CAVE and KAIST datasets jointly.
To simulate the real imaging situations, the training samples are also injected with 11-bit shot noise.
Fig.
5 shows the visual comparisons between our DAUHST-3stg and nine SOTA methods.
In the top three rows, only our DAUHST-3stg can reconstruct the ﬂower patch corresponding to the yellow box at all wavelengths while other methods all fail to recover the entire patch.
In the bottom row, DAUHST-3stg restores more HSI structural details and clearer contents with fewer artifacts.
In contrast, other methods recover blurry images, generate incomplete responses, and are susceptible to the noise corruption.
This evidence suggests that DAUHST is more robust to the noise distortion and more effective in real HSI reconstruction.
3.4 Ablation Study
Break-down Ablation.
We adopt baseline-1 that is derived by removing HS-MSA and DAUF from
DAUHST-3stg to conduct the break-down ablation.
Our goal is to study the effect of each component towards higher performance.
Baseline-1 is cascaded end to end by three single-stage networks.
As shown in Tab.
2a, baseline-1 achieves 33.05 dB. When we respectively apply DAUF and HS-MSA, the model achieves 2.32 and 2.44 dB improvements.
When we exploit DAUF and HS-MSA jointly, the model gains by 4.16 dB. These results demonstrate the effectiveness of our DAUF and HS-MSA.
Self-Attention Mechanism.
To compare HS-MSA with other MSAs, we adopt baseline-2 that is obtained by removing HS-MSA from DAUHST-1stg to conduct the ablation in Tab. 2b.
We remove different position embedding schemes to avoid their impacts and only compare MSAs.
For fairness, we keep the Params of MSAs the same by ﬁxing the number of channels and heads.
[-Baseline-
 yields32.79-]Baseline-2 yields 32.79 dB. We apply global MSA (G-MSA)
[53], Swin MSA (SW-MSA) [51], Spectral-wise MSA (S-MSA) [81], and HS-MSA.
Note that we downsample the input feature maps of G-MSA to avoid memory bottlenecks.
As shown in Tab. 2b, HS-MSA yields the most signiﬁcant improvement of 1. dB, which is 0.42, 0.30, and 0.23 dB higher than G-MSA, SW-MSA, and S-MSA.
This superiority is mainly derived from HS-MSA’s ability to jointly capture local contents and non-local dependencies.
Unfolding Framework.
We compare our DAUF with previous unfolding frameworks including
DNU [43], ADMM-Net [46], and GAP-Net [45].
For a fair comparison, we replace each single-stage network of DNU, ADMM-Net, and GAP-Net by our HST. 3-stage architecture is adopted to conduct ablations.
The results are shown in Tab.
2c.
Our DAUF signiﬁcantly outperforms DNU, ADMM, and
GAP by 2.59, 1.69, and 1.63 dB while adding only 0.05M Params and 0.94G FLOPS.
This is mainly because DAUF uses the parameters estimated from the compressed measurement and physical mask in the CASSI system to direct the iterative learning.
These parameters capture critical information of
CASSI degradation patterns and ill-posedness degree, providing key cues for HSI reconstruction.
[Figure]
[Figure] [Figure]
[Figure] [Figure]
[Table]
To study the effect of the estimated parameters α and β , we perform a break-down ablation of DAUF.
We adopt DAUHST-3stg as baseline-3 but α is set as learnable parameters instead of being estimated by E in Eq.
(12) and β is not fed into D .
The results are shown in Tab. 2d.
Baseline-3 yields 36. dB. When α is set to be estimated by E , baseline-3 is improved by 0.45 dB. When β is fed into D , baseline-3 gains by 0.34 dB. When α and β are exploited jointly in the iterative learning, baselineachieves a signiﬁcant improvement of 0.72 dB. These results verify that the estimated parameters α and β are beneﬁcial for the linear projection and denoising network of deep unfolding methods.
To further analyze the roles of the estimated parameters, we visualize z k and x k of Eq.
(12), and plot the curves of α and β as they change with the iteration in Fig.
We observe: (i) z 0 and xyield either blurry or noisy images.
There is a signiﬁcant gap between them.
Since α k = µ k in
Eq.
(5) penalizes the differences between z and x , α 1 is estimated to be a large value.
From the linear projection of the second iteration ( z 1 → x 2 ) on, the gap between z and x decreases substantially.
Therefore, α k are estimated to be small values when k ≥ 2 .
This indicates that α can adaptively scale the linear projection P .
(ii)
The noise corruption is severe in the ﬁrst iteration.
Thus, β 1 = µ 1 /τ 1 = 1 / ( (cid:112) τ 1 /µ 1 ) 2 , which is inversely proportional to the noise level, is estimated to be a small value.
With further iterations, the noise level decreases, and thus the estimated β k increases.
These results demonstrate that β can provide the information about noise level for the denoising network D .
Conclusion
In this paper, we remedy two issues of previous deep unfolding methods, i.e. , they do not estimate informative parameters from the CASSI system to direct the iterative learning and they are mainly
CNN-based showing limitations in capturing long-range dependencies.
To cope with these challenges, we ﬁrstly formulate a principled MAP-based unfolding framework DAUF that estimates parameters from the compressed measurement and physical mask.
Then the parameters, which capture critical cues of CASSI degradation patterns and ill-posedness degree, are fed into each iteration to contextually scale the linear projection and provide noise level information for the denoising network.
Secondly, we propose a novel Transformer HST that can jointly extract local contents and model non-local dependencies.
By plugging HST into DAUF, we derive the ﬁrst Transformer-based unfolding method
DAUHST for HSI reconstruction.
Comprehensive experiments show that our DAUHST outperforms
SOTA methods by a large margin while requiring much cheaper memory and computational costs.
Acknowledgement
This work is partially supported by the NSFC fund (61831014), the Shenzhen Science and Technology
Project under Grant (JSGG20210802153150005, CJGJZD20200617102601004).
Xin Yuan acknowledges the support of NSFC (62271414), Westlake Foundation (2021B1501-2) and the Research
Center for Industries of the Future (RCIF) at Westlake University