Pages that link to "Item:Q3549018"
From MaRDI portal
The following pages link to Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit (Q3549018):
Displaying 50 items.
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems (Q137310) (← links)
- Pseudo-inverses of difference matrices and their application to sparse signal approximation (Q277123) (← links)
- A model of regularization parameter determination in low-dose X-ray CT reconstruction based on dictionary learning (Q307697) (← links)
- An orthogonal method for measurement matrix optimization (Q308066) (← links)
- Compressed blind signal reconstruction model and algorithm (Q318508) (← links)
- Design of wideband fractional-order differentiator using interlaced sampling method (Q318551) (← links)
- Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- A matching pursuit approach to solenoidal filtering of three-dimensional velocity measurements (Q348912) (← links)
- The essential ability of sparse reconstruction of different compressive sensing strategies (Q362190) (← links)
- Waveform design and high-resolution imaging of cognitive radar based on compressive sensing (Q362194) (← links)
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- Sparse SAR imaging based on \(L_{1/2}\) regularization (Q362313) (← links)
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging (Q362317) (← links)
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain (Q362320) (← links)
- A novel cognitive ISAR imaging method with random stepped frequency chirp signal (Q362338) (← links)
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions (Q384215) (← links)
- Grouping strategies and thresholding for high dimensional linear models (Q394551) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Wavelet compressive sampling signal reconstruction using upside-down tree structure (Q410477) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography (Q427195) (← links)
- 2D sparse signal recovery via 2D orthogonal matching pursuit (Q439789) (← links)
- Particle swarm optimization of compression measurement for signal detection (Q453680) (← links)
- Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
- Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
- Compressive sensing using chaotic sequence based on Chebyshev map (Q494825) (← links)
- Individual-specific, sparse inverse covariance estimation in generalized estimating equations (Q504468) (← links)
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
- Bayesian signal detection with compressed measurements (Q508772) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- Sparse decomposition by iterating Lipschitzian-type mappings (Q517031) (← links)
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241) (← links)
- Two-dimensional random projection (Q537260) (← links)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Improved stability conditions of BOGA for noisy block-sparse signals (Q634875) (← links)
- Noise folding in completely perturbed compressed sensing (Q670261) (← links)
- Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm (Q711045) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Iterative hard thresholding for compressed sensing (Q734323) (← links)
- DFT spectrum-sparsity-based quasi-periodic signal identification and application (Q737021) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
