Pages that link to "Item:Q1029548"

The following pages link to Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548):

Displaying 23 items.

• Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
• Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← links)
• Robust sparse phase retrieval made easy (Q347523) (← links)
• Waveform design and high-resolution imaging of cognitive radar based on compressive sensing (Q362194) (← links)
• Parameter estimation for nonincreasing exponential sums by Prony-like methods (Q389569) (← links)
• Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
• Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
• Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
• Random sampling of sparse trigonometric polynomials (Q861807) (← links)
• Sparsity in time-frequency representations (Q967573) (← links)
• Sparse approximate solution of partial differential equations (Q972312) (← links)
• Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
• Sparse approximate solution of fitting surface to scattered points by MLASSO model (Q1656898) (← links)
• Sparsity and incoherence in orthogonal matching pursuit (Q1710949) (← links)
• Sliding-MOMP based channel estimation scheme for ISDB-T systems (Q1793180) (← links)
• Sparse approximation of fitting surface by elastic net (Q1993576) (← links)
• Meshless Hermite-HDMR finite difference method for high-dimensional Dirichlet problems (Q2000930) (← links)
• Three deterministic constructions of compressed sensing matrices with low coherence (Q2202898) (← links)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
• Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)