Sparsification of matrices and compressed sensing
From MaRDI portal
Abstract: Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and compressed sensing has emerging applications in medical imaging, big data, and statistics. Finding practical matrix constructions and computationally efficient recovery algorithms for compressed sensing is an area of intense research interest. Many probabilistic matrix constructions have been proposed, and it is now well known that matrices with entries drawn from a suitable probability distribution are essentially optimal for compressed sensing. Potential applications have motivated the search for constructions of sparse compressed sensing matrices (i.e., matrices containing few non-zero entries). Various constructions have been proposed, and simulations suggest that their performance is comparable to that of dense matrices. In this paper, extensive simulations are presented which suggest that sparsification leads to a marked improvement in compressed sensing performance for a large class of matrix constructions and for many different recovery algorithms.
Recommendations
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields
- Deterministic construction of compressed sensing matrices with characters over finite fields
- Compressive sensing and algebraic coding: connections and challenges
- Compressed Sensing and Redundant Dictionaries
- Deterministic constructions of compressed sensing matrices
Cited in
(19)- Sparsification of rectangular matrices
- An effective algorithm for the spark of sparse binary measurement matrices
- Sparse reconstruction with multiple Walsh matrices
- A sparsity for decomposing a symmetric matrix
- A practical method for compressing sparse matrices with variant entries
- Sampling, denoising and compression of matrices by coherent matrix organization
- A compact sparse matrix representation using random hash functions
- Compression of sparse matrices by blocked Rice coding
- Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
- Approximation and Compression With Sparse Orthonormal Transforms
- Binary Matrices for Compressed Sensing
- Sparse Compression of Expected Solution Operators
- Compressed sensing with applications in wireless networks
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- scientific article; zbMATH DE number 6797621 (Why is no real title available?)
- Sparse representations and approximation theory
- Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
- Matrix-free interior point method for compressed sensing problems
This page was built for publication: Sparsification of matrices and compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224435)
