Dictionary-sparse recovery via thresholding-based algorithms
Compressive sensing is nowadays a well known term designating an efficient procedure for recovering a signal from its samples. It is applied in a variety of domains such as photography, computed tomography and so on, allowing reconstructing a signal from its samples in a better way than it is predicted by the Shannon theory. It is obvious that such an approach can be fitted to a class of signals having some prescribed properties, namely that of having a small number of nonzero components (sparsity) and a special norm inequality (restricted isometry property, as E. Candes named it). The signal to be analyzed is represented via a special matrix, the so called dictionary or design matrix. It is clear that a great interest was directed to generate adequate algorithms to obtain the optimum solution. The present paper compares the so called thresholding algorithms, namely the iterative hard thresholding one and the hard thresholding pursuit one, and shows that they provide the same theoretical guarantee as \(\ell_1\)-recovery from imperfect compressive measurements for signals that can be represented as expansions in a fixed dictionary. The paper is a rigorous exposition of all the theorems and we think it represents a valuable contribution in the area of algorithms for compressive sensing.
- Hard thresholding pursuit algorithms: number of iterations
- A generalized class of hard thresholding algorithms for sparse signal recovery
- Hard thresholding pursuit: an algorithm for compressive sensing
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Iterative hard thresholding for compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- Hard thresholding pursuit: an algorithm for compressive sensing
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Sparse recovery with pre-Gaussian random matrices
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- The cosparse analysis model and algorithms
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Iterative hard thresholding for compressed data separation
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- A generalized class of hard thresholding algorithms for sparse signal recovery
- Instance optimal decoding by thresholding in compressed sensing
- Flavors of compressive sensing
- Solving inverse problems using data-driven models
- Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements
- Dictionary-sparse recovery from heavy-tailed measurements
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Hard thresholding pursuit algorithms: number of iterations
- Preserving injectivity under subgaussian mappings and its application to compressed sensing
This page was built for publication: Dictionary-sparse recovery via thresholding-based algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964229)
