Sparse recovery of time-frequency representations via recurrent neural networks
The DOI matches its Crossref record; 30 of the 31 references it cites were found in a registry or an index.
Abstract
The impressive evolution of neural networks and deep learning techniques during the last few years has offered new incomparable routes to solve many complex problems. Moreover, the fact that neural networks are structured and supervised has made it possible to perform automatic parameter tuning that guarantees convergence to the best expressive model for the problem assessed. In this work, we investigated the use of recurrent neural networks (RNNs) to solve the sequential sparse recovery problem through unfolding the iterative soft thresholding algorithm (ISTA) into a stacked RNN. Specifically, we examined the performance of the unsupervised iterative algorithm and the supervised network for a purely compressive sampling reconstruction problem of time-frequency representations. Our results demonstrated that the trained stacked neural network outperforms the iterative algorithm in the quality of the reconstructed data and points to several future directions to improve the performance.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Self-citationAtomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Generating Sequences With Recurrent Neural Networks
Graves, A. (2013) · arXiv · doi:10.48550/arxiv.1308.0850 · Cited by 2,894
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Learning Fast Approximations of Sparse Coding
Gregor, K., & LeCun, Y. (2010) · International Conference on Machine Learning · Cited by 2,400
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
(2007) · CaltechAUTHORS (California Institute of Technology) · Cited by 2,274
Research works printed but not linked: 2
- tieleman, 2012, Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude, COURSERA Neural Networks for Machine Learning, 4
- team, 2016, Theano A Python framework for fast computation of mathematical expressions, 1605
Cited by
Khalifa, Y., Mandic, D. P., & Sejdić, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.11.008 · Cited by 88
Self-citationKhalifa, Y., Donohue, C., Coyle, J. L., & Sejdic, E. (2021) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2020.3000057 · Cited by 49
Self-citationDECONET: An Unfolding Network for Analysis-Based Compressed Sensing With Generalization Error Bounds
Kouni, V., & Panagakis, Y. (2023) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2023.3272286 · Cited by 11
Kiragu, H., Mwangi, E., & Kamucha, G. (2020) · IEEE Mediterranean Electrotechnical Conference (MELECON) · doi:10.1109/melecon48756.2020.9140563 · Cited by 2
A Robust Compressive Sampling Method for MR Images Based on Partial Scanning and Apodization
Kiragu, H., Mwangi, E., & Kamucha, G. (2018) · IEEE International Symposium on Signal Processing and Information Technology (ISSPIT) · doi:10.1109/isspit.2018.8642640
Metadata
- Authors
- Khalifa, Y., Zhang, Z., & Sejdic, E.
- Affiliations
- University of Pittsburgh (US)
- Venue
- 2017 22nd International Conference on Digital Signal Processing (DSP)
- Publisher
- IEEE
- Published
- 2017-08
- Volume
- 58
- Pages
- 1-5
- OpenAlex
- W2767207094
- Cited by
- 5
- References
- 31
- Citations by year
- 2023: 1 · 2020: 3 · 2018: 1
- FWCI
- 1.67
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Conference on Digital Signal Processing (DSP) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Signal Denoising Methods
- Keywords
- sparse signal recovery, time-frequency representation, recurrent neural networks, iterative soft thresholding, stacked neural networks, compressed sensing, signal reconstruction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.