1 January 2026 in IEEE Sensors Journal
Compressed sensing (CS) reconstruction is a powerful technique for image compression and reconstruction. Most existing deep learning and deep unfolding reconstruction methods: 1) do not sufficiently analyze the proximal subproblem and naturally derive network architectures from mathematical theory; 2) lack the ability to correct errors and recover details via multidomain, multiscale, and multiresolution analysis; and 3) depend only on the previous stage and overlooking valuable information from earlier stages. In this study, we propose a Nesterov-optimized memory and geometric distillation learning (Nest-MGDL) framework, which effectively integrates interpretability and adaptability to achieve robust and generalizable deep learning performance. By reformulating the proximal subproblem as the decomposition and distillation of memory and geometric priors across diverse domains and integrating a local multilevel feature aggregation (LMFA) strategy, Nest-MGDL enables theoretically grounded network design and accurate multiscale correction of errors. Inspired by the third-Nesterov (N-III) acceleration scheme with fast convergence, we incorporate gradient information from measurement errors across multiple historical stages to achieve more consistent and accurate reconstruction. It provides new insights into leveraging historical measurement errors and designing explainable network architectures. All parameters in our Nest-MGDL are learnable end-to-end with adaptive initialization, enhancing model flexibility and ensuring stable convergence. Extensive experiments show that Nest-MGDL outperforms other state-of-the-art methods.