mlsanityData to 7 Oct 2026

Deep Equilibrium Models for Video Snapshot Compressive Imaging

arXiv 2201.06931 ↗First posted 18 Jan 2022eess.IV cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

The ability of snapshot compressive imaging (SCI) systems to efficiently capture high-dimensional (HD) data has led to an inverse problem, which consists of recovering the HD signal from the compressed and noisy measurement. While reconstruction algorithms grow fast to solve it with the recent advances of deep learning, the fundamental issue of accurate and stable recovery remains. To this end, we propose deep equilibrium models (DEQ) for video SCI, fusing data-driven regularization and stable convergence in a theoretically sound manner. Each equilibrium model implicitly learns a nonexpansive operator and analytically computes the fixed point, thus enabling unlimited iterative steps and infinite network depth with only a constant memory requirement in training and testing. Specifically, we demonstrate how DEQ can be applied to two existing models for video SCI reconstruction: recurrent neural networks (RNN) and Plug-and-Play (PnP) algorithms. On a variety of datasets and real data, both quantitative and qualitative evaluations of our results demonstrate the effectiveness and stability of our proposed method. The code and models are available at: https://github.com/IndigoPurple/DEQSCI .

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 28 of its 51 references that are in the map. First posted on arXiv 18 Jan 2022.

Builds on

28 of 51 references.

References · 28

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  3. 2017The 2017 DAVIS Challenge on Video Object Segmentationcited by 942
  4. 2018Universal Transformerscited by 613
  5. 2019Deep Equilibrium Modelscited by 603
  6. 2017FFDNet: Toward a Fast and Flexible Solution for CNN based Image Denoisingcited by 509
  7. 2016Plug-and-Play ADMM for Image Restoration: Fixed Point Convergence and Applicationscited by 244
  8. 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 215
  9. 2019Plug-and-Play Methods Provably Converge with Properly Trained Denoiserscited by 197
  10. 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 178
  11. 2020Multiscale Deep Equilibrium Modelscited by 149
  12. 2021Deep Equilibrium Architectures for Inverse Problems in Imagingcited by 126
16 more
  1. 2018Rank Minimization for Snapshot Compressive Imagingcited by 99
  2. 2015Plug-and-Play Priors for Bright Field Electron Tomography and Sparse Interpolationcited by 78
  3. 2020Plug-and-Play Algorithms for Large-scale Snapshot Compressive Imagingcited by 78
  4. 2021On Training Implicit Modelscited by 73
  5. 2013Coded aperture compressive temporal imagingcited by 57
  6. 2020GAP-net for Snapshot Compressive Imagingcited by 54
  7. 2018Trellis Networks for Sequence Modelingcited by 50
  8. 2021Plug-and-Play Algorithms for Video Snapshot Compressive Imagingcited by 42
  9. 2018Recurrent Stacking of Layers for Compact Neural Machine Translation Modelscited by 38
  10. 2020Tuning-free Plug-and-Play Proximal Algorithm for Inverse Imaging Problemscited by 38
  11. 2021Dense Deep Unfolding Network with 3D-CNN Prior for Snapshot Compressive Imagingcited by 31
  12. 2021Memory-Efficient Network for Large-scale Video Compressive Sensingcited by 30
  13. 2021MetaSCI: Scalable and Adaptive Reconstruction for Video Compressive Sensingcited by 29
  14. 2022Adaptive Deep PnP Algorithm for Video Snapshot Compressive Imagingcited by 10
  15. 2022Two-Stage is Enough: A Concise Deep Unfolding Reconstruction Network for Flexible Video Compressive Sensingcited by 3
  16. 2021Revisit Dictionary Learning for Video Compressive Sensing under the Plug-and-Play Frameworkcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 2; 2025: 0; 2026: 1.

5 papers.