Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/26624
Title: SALSA-Net: Explainable Deep Unrolling Networks for Compressed Sensing
Authors: Song, H
Ding, Q
Gong, J
Meng, H
Lai, Y
Keywords: compressed sensing;SALSA;deep unrolling;explainable networks;neural networks;image reconstruction
Issue Date: 28-May-2023
Publisher: MDPI
Citation: Song, H. et al. (2023) 'SALSA-Net: Explainable Deep Unrolling Networks for Compressed Sensing', Sensors, 23 (11), 5142, pp. 1 - 16. doi: 10.3390/s23115142.
Abstract: Copyright © 2023 by the authors. Deep unrolling networks (DUNs) have emerged as a promising approach for solving compressed sensing (CS) problems due to their superior explainability, speed, and performance compared to classical deep network models. However, the CS performance in terms of efficiency and accuracy remains a principal challenge for approaching further improvements. In this paper, we propose a novel deep unrolling model, SALSA-Net, to solve the image CS problem. The network architecture of SALSA-Net is inspired by unrolling and truncating the split augmented Lagrangian shrinkage algorithm (SALSA) which is used to solve sparsity-induced CS reconstruction problems. SALSA-Net inherits the interpretability of the SALSA algorithm while incorporating the learning ability and fast reconstruction speed of deep neural networks. By converting the SALSA algorithm into a deep network structure, SALSA-Net consists of a gradient update module, a threshold denoising module, and an auxiliary update module. All parameters, including the shrinkage thresholds and gradient steps, are optimized through end-to-end learning and are subject to forward constraints to ensure faster convergence. Furthermore, we introduce learned sampling to replace traditional sampling methods so that the sampling matrix can better preserve the feature information of the original signal and improve sampling efficiency. Experimental results demonstrate that SALSA-Net achieves significant reconstruction performance compared to state-of-the-art methods while inheriting the advantages of explainable recovery and high speed from the DUNs paradigm.
Description: Data Availability Statement: Not applicable.
URI: https://bura.brunel.ac.uk/handle/2438/26624
DOI: https://doi.org/10.3390/s23115142
Other Identifiers: ORCID iDs: Heping Song https://orcid.org/0000-0002-8583-2804; Jingyao Gong https://orcid.org/0009-0009-5907-5836; Hongying Meng https://orcid.org/0000-0002-8836-1382.
5142
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).7.25 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons