Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
From MaRDI portal
(Redirected from Publication:2175016)
Abstract: The idea that signals reside in a union of low dimensional subspaces subsumes many low dimensional models that have been used extensively in the recent decade in many fields and applications. Until recently, the vast majority of works have studied each one of these models on its own. However, a recent approach suggests providing general theory for low dimensional models using their Gaussian mean width, which serves as a measure for the intrinsic low dimensionality of the data. In this work we use this novel approach to study a generalized version of the popular compressive sampling matching pursuit (CoSaMP) algorithm, and to provide general recovery guarantees for signals from a union of low dimensional linear subspaces, under the assumption that the measurement matrix is Gaussian. We discuss the implications of our results for specific models, and use the generalized algorithm as an inspiration for a new greedy method for signal reconstruction in a combined sparse-synthesis and cosparse-analysis model. We perform experiments that demonstrate the usefulness of the proposed strategy.
Recommendations
Cites work
- scientific article; zbMATH DE number 4061904 (Why is no real title available?)
- A Theory for Sampling Signals From a Union of Subspaces
- A mathematical introduction to compressive sensing
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Adaptive greedy approximations
- Atomic decomposition by basis pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Estimation in high dimensions: a geometric perspective
- Exact matrix completion via convex optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Iterative hard thresholding for compressed sensing
- Living on the edge: phase transitions in convex programs with random data
- Matching pursuits with time-frequency dictionaries
- Model-Based Compressive Sensing
- One-bit compressed sensing with non-Gaussian measurements
- Orthogonal least squares methods and their application to non-linear system identification
- Performance comparisons of greedy algorithms in compressed sensing.
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Random projections of smooth manifolds
- Recipes for Stable Linear Embeddings From Hilbert Spaces to $ {\mathbb {R}}^{m}$
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Sharp Time–Data Tradeoffs for Linear Inverse Problems
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The convex geometry of linear inverse problems
- The cosparse analysis model and algorithms
Cited in
(5)- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Low-rank signal subspace: parameterization, projection and signal estimation
- Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
- Compressed subspace matching on the continuum
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
This page was built for publication: Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175016)
