Deep Learning of Compressed Sensing Operators with Structural Similarity Loss
Pith reviewed 2026-05-25 16:19 UTC · model grok-4.3
The pith
A fully-connected network jointly learns the sensing matrix and reconstruction operator for compressed sensing by training on structural similarity loss.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that an end-to-end deep learning approach in which a fully-connected network performs both linear sensing and nonlinear reconstruction, with the sensing matrix and reconstruction operator jointly optimized using SSIM as the loss function rather than MSE, yields higher reconstruction quality than state-of-the-art methods under both SSIM and MSE metrics.
What carries the argument
A fully-connected network that executes both the linear sensing matrix multiplication and the subsequent nonlinear reconstruction, trained end-to-end with SSIM loss to optimize the matrix and reconstructor simultaneously.
If this is right
- The sensing matrix and reconstruction operator are learned jointly rather than designed or trained separately.
- Reconstruction quality improves under both SSIM and MSE metrics relative to prior compressed sensing techniques.
- SSIM loss serves as an effective objective even when final evaluation includes MSE.
- The entire compressed sensing pipeline is realized inside one network without separate stages.
Where Pith is reading between the lines
- The learned sensing matrix could be implemented directly in analog hardware sensors tuned to structural image features.
- The same joint-optimization idea might apply to other linear inverse problems such as super-resolution or denoising.
- Gains from SSIM training suggest testing alternative perceptual losses in deep reconstruction networks.
- Performance on natural images raises the question of how the approach behaves on signals with different statistical structure.
Load-bearing premise
That a single fully-connected network can simultaneously learn an effective linear sensing matrix and a high-quality nonlinear reconstructor for the signals of interest, and that SSIM is an appropriate training objective for this joint optimization task.
What would settle it
Training the described network on standard image datasets used in compressed sensing and measuring that its SSIM and MSE scores on held-out test signals do not exceed those of existing state-of-the-art methods.
Figures
read the original abstract
Compressed sensing (CS) is a signal processing framework for efficiently reconstructing a signal from a small number of measurements, obtained by linear projections of the signal. In this paper we present an end-to-end deep learning approach for CS, in which a fully-connected network performs both the linear sensing and non-linear reconstruction stages. During the training phase, the sensing matrix and the non-linear reconstruction operator are jointly optimized using Structural similarity index (SSIM) as loss rather than the standard Mean Squared Error (MSE) loss. We compare the proposed approach with state-of-the-art in terms of reconstruction quality under both losses, i.e. SSIM score and MSE score.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes an end-to-end deep learning framework for compressed sensing in which a single fully-connected network simultaneously learns the linear sensing matrix and the nonlinear reconstruction operator. The sensing and reconstruction stages are jointly optimized during training by minimizing a structural similarity (SSIM) loss rather than the conventional MSE loss, and the authors report that the resulting reconstructions outperform state-of-the-art methods when evaluated under both SSIM and MSE metrics.
Significance. If the performance gains can be isolated to the joint FC architecture rather than the SSIM objective alone, the work would provide evidence that perceptual losses and end-to-end optimization of the sensing operator can improve reconstruction quality in CS. The approach is conceptually straightforward and could be relevant to practical CS systems where measurement design and recovery are co-optimized.
major comments (1)
- Abstract: the central claim that the proposed FC network outperforms SOTA under both SSIM and MSE is not isolated from the choice of training loss. The abstract states that SOTA methods are compared after being trained (presumably with MSE), so any SSIM improvement is expected while MSE improvement could arise from SSIM acting as a surrogate loss rather than from the joint linear/nonlinear FC design. Without an explicit statement that SOTA baselines were retrained under identical SSIM loss, data, and hyper-parameters, the load-bearing contribution of the proposed architecture remains unverified.
Simulated Author's Rebuttal
We thank the referee for the constructive feedback. We address the single major comment below.
read point-by-point responses
-
Referee: Abstract: the central claim that the proposed FC network outperforms SOTA under both SSIM and MSE is not isolated from the choice of training loss. The abstract states that SOTA methods are compared after being trained (presumably with MSE), so any SSIM improvement is expected while MSE improvement could arise from SSIM acting as a surrogate loss rather than from the joint linear/nonlinear FC design. Without an explicit statement that SOTA baselines were retrained under identical SSIM loss, data, and hyper-parameters, the load-bearing contribution of the proposed architecture remains unverified.
Authors: We agree that the manuscript does not state or perform retraining of SOTA baselines under the SSIM loss; comparisons use the originally published results of those methods (typically MSE-trained). Our FC network, jointly optimized end-to-end with SSIM, nevertheless reports superior scores on both SSIM and MSE. We will revise the abstract and methods section to explicitly note that baselines reflect their published (MSE) training regimes. This makes clear that the reported gains arise from the combination of the joint FC architecture and SSIM objective. Additional experiments retraining all baselines with SSIM would further isolate the architecture's contribution but are outside the scope of the current submission. revision: yes
Circularity Check
No circularity: empirical training procedure with no reducing equations
full rationale
The paper presents an end-to-end training procedure for a fully-connected network that jointly learns sensing and reconstruction operators using SSIM loss, with experimental comparisons to SOTA methods under SSIM and MSE. No derivation chain, equations, or self-citations are described that reduce any claimed result or metric to a fitted parameter or input by construction. The approach is self-contained as an empirical method; no self-definitional, fitted-prediction, or load-bearing self-citation patterns apply. This is the expected outcome for a non-derivational ML paper.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
D. L. Donoho, “Compressed sensing,” IEEE Transactions on information theory, vol. 52, no. 4, pp. 1289–1306, 2006
work page 2006
-
[2]
An introduction to compressive sampling,
E. J. Cand `es and M. B. Wakin, “An introduction to compressive sampling,” IEEE signal processing magazine , vol. 25, no. 2, pp. 21– 30, 2008
work page 2008
-
[3]
Imaging via compressive sampling,
J. Romberg, “Imaging via compressive sampling,” IEEE Signal Process- ing Magazine , vol. 25, no. 2, pp. 14–20, 2008
work page 2008
-
[4]
Sparsity and compressed sensing in radar imaging,
L. C. Potter, E. Ertin, J. T. Parker, and M. Cetin, “Sparsity and compressed sensing in radar imaging,” Proceedings of the IEEE , vol. 98, no. 6, pp. 1006–1020, 2010
work page 2010
-
[5]
M. Lustig, D. L. Donoho, J. M. Santos, and J. M. Pauly, “Compressed sensing mri,” IEEE signal processing magazine , vol. 25, no. 2, pp. 72– 82, 2008
work page 2008
-
[6]
M. Murphy, M. Alley, J. Demmel, K. Keutzer, S. Vasanawala, and M. Lustig, “Fast ℓ1-spirit compressed sensing parallel imaging mri: Scalable parallel implementation and clinically feasible runtime,” IEEE transactions on medical imaging , vol. 31, no. 6, pp. 1250–1262, 2012
work page 2012
-
[7]
Spectrum sensing for cognitive radio: State-of-the-art and recent advances,
E. Axell, G. Leus, E. G. Larsson, and H. V . Poor, “Spectrum sensing for cognitive radio: State-of-the-art and recent advances,” IEEE Signal Processing Magazine, vol. 29, no. 3, pp. 101–116, 2012
work page 2012
-
[8]
Received-signal-strength- based indoor positioning using compressive sensing,
C. Feng, W. S. A. Au, S. Valaee, and Z. Tan, “Received-signal-strength- based indoor positioning using compressive sensing,” IEEE Transactions on Mobile Computing , vol. 11, no. 12, pp. 1983–1993, 2012
work page 1983
-
[9]
Compressed sensing system considerations for ecg and emg wireless biosensors,
A. M. Dixon, E. G. Allstot, D. Gangopadhyay, and D. J. Allstot, “Compressed sensing system considerations for ecg and emg wireless biosensors,” IEEE Transactions on Biomedical Circuits and Systems , vol. 6, no. 2, pp. 156–166, 2012
work page 2012
-
[10]
Compressed sensing signal and data acquisition in wireless sensor networks and internet of things,
S. Li, L. Da Xu, and X. Wang, “Compressed sensing signal and data acquisition in wireless sensor networks and internet of things,” IEEE Transactions on Industrial Informatics , vol. 9, no. 4, pp. 2177–2186, 2013
work page 2013
-
[11]
Learning deep architectures for ai,
Y . Bengio et al. , “Learning deep architectures for ai,” F oundations and trends R⃝ in Machine Learning , vol. 2, no. 1, pp. 1–127, 2009
work page 2009
-
[12]
Image quality assessment: from error visibility to structural similarity,
Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image quality assessment: from error visibility to structural similarity,” IEEE transactions on image processing , vol. 13, no. 4, pp. 600–612, 2004
work page 2004
-
[13]
Reducing the dimensionality of data with neural networks,
G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” science, vol. 313, no. 5786, pp. 504–507, 2006
work page 2006
-
[14]
A. Krizhevsky, V . Nair, and G. Hinton, “The cifar-10 dataset,” online: http://www. cs. toronto. edu/kriz/cifar . html , 2014
work page 2014
-
[15]
Z. Wang and E. P. Simoncelli, “Maximum differentiation (mad) competi- tion: A methodology for comparing computational models of perceptual quantities,” Journal of Vision , vol. 8, no. 12, pp. 8–8, 2008
work page 2008
-
[16]
Adam: A Method for Stochastic Optimization
D. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980 , 2014
work page internal anchor Pith review Pith/arXiv arXiv 2014
-
[17]
A Deep Learning Approach to Block-based Compressed Sensing of Images
A. Adler, D. Boublil, M. Elad, and M. Zibulevsky, “A deep learning approach to block-based compressed sensing of images,” arXiv preprint arXiv:1606.01519, 2016
work page internal anchor Pith review Pith/arXiv arXiv 2016
-
[18]
Loss functions for image restoration with neural networks,
H. Zhao, O. Gallo, I. Frosio, and J. Kautz, “Loss functions for image restoration with neural networks,” IEEE Transactions on Computational Imaging, vol. 3, no. 1, pp. 47–57, 2017
work page 2017
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.