Quasi-linear compressed sensing
From MaRDI portal
Abstract: Inspired by significant real-life applications, in particular, sparse phase retrieval and sparse pulsation frequency detection in Asteroseismology, we investigate a general framework for compressed sensing, where the measurements are quasi-linear. We formulate natural generalizations of the well-known Restricted Isometry Property (RIP) towards nonlinear measurements, which allow us to prove both unique identifiability of sparse signals as well as the convergence of recovery algorithms to compute them efficiently. We show that for certain randomized quasi-linear measurements, including Lipschitz perturbations of classical RIP matrices and phase retrieval from random projections, the proposed restricted isometry properties hold with high probability. We analyze a generalized Orthogonal Least Squares (OLS) under the assumption that magnitudes of signal entries to be recovered decay fast. Greed is good again, as we show that this algorithm performs efficiently in phase retrieval and asteroseismology. For situations where the decay assumption on the signal does not necessarily hold, we propose two alternative algorithms, which are natural generalizations of the well-known iterative hard and soft-thresholding. While these algorithms are rarely successful for the mentioned applications, we show their strong recovery guarantees for quasi-linear measurements which are Lipschitz perturbations of RIP matrices.
Recommendations
Cites work
- A mathematical introduction to compressive sensing
- A simple proof of the restricted isometry property for random matrices
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- An elementary proof of a theorem of Johnson and Lindenstrauss
- An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Compressed sensing
- Compressed Sensing and Redundant Dictionaries
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Exact Recovery Conditions for Sparse Representations With Partial Support Information
- Finding the minimum of a function
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Greed is Good: Algorithmic Results for Sparse Approximation
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 5853153 (Why is no real title available?)
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Improved bounds on restricted isometry constants for Gaussian matrices
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- Matching pursuits with time-frequency dictionaries
- Multilevel Gauss–Newton methods for phase retrieval problems
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On performance of greedy algorithms
- Phase retrieval: stability and recovery guarantees
- Phase transitions for greedy sparse approximation algorithms
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Prospects for asteroseismology
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Restricted isometries for partial random circulant matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Reconstruction From the Magnitude of Subspace Components
- Sparse signal recovery from quadratic measurements via convex programming
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property for time-frequency structured random matrices
Cited in
(13)- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- Solving equations of random convex functions via anchored regression
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Nonlinear residual minimization by iteratively reweighted least squares
- Linearized Bregman iterations for compressed sensing
- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Low rank matrix recovery from rank one measurements
- Binned Progressive Quantization for Compressive Sensing
- Oracle-net for nonlinear compressed sensing in electrical impedance tomography reconstruction problems
- Nonlinear frames and sparse reconstructions in Banach spaces
- Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
- Sparse signals recovered by non-convex penalty in quasi-linear systems
This page was built for publication: Quasi-linear compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250350)
