Pages that link to "Item:Q4975851"

The following pages link to Subspace Pursuit for Compressive Sensing Signal Reconstruction (Q4975851):

Displaying 50 items.

• Compressed blind signal reconstruction model and algorithm (Q318508) (← links)
• Sparse microwave imaging: principles and applications (Q362310) (← links)
• Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
• Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
• Analysis of orthogonal multi-matching pursuit under restricted isometry property (Q477291) (← links)
• Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
• A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
• Image reconstruction using analysis model prior (Q519588) (← links)
• Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
• A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
• Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
• Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
• Iterative hard thresholding for compressed sensing (Q734323) (← links)
• Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots (Q739462) (← links)
• GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
• Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
• A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery (Q827377) (← links)
• Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations (Q829377) (← links)
• A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
• Sampling in the analysis transform domain (Q900778) (← links)
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
• On a simple derivation of the complementary matching pursuit (Q1048880) (← links)
• Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data (Q1666730) (← links)
• Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP (Q1673807) (← links)
• Online fault diagnosis for nonlinear power systems (Q1689341) (← links)
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit (Q1700711) (← links)
• Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
• A remark on joint sparse recovery with OMP algorithm under restricted isometry property (Q1740232) (← links)
• Spark-level sparsity and the \(\ell_1\) tail minimization (Q1748258) (← links)
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing (Q1792868) (← links)
• Sparse representation based binary hypothesis model for hyperspectral image classification (Q1792994) (← links)
• \(\ell_1\)- and \(\ell_2\)-norm joint regularization based sparse signal reconstruction scheme (Q1793017) (← links)
• An efficient algorithm for overcomplete sparsifying transform learning with signal denoising (Q1793434) (← links)
• Structured overcomplete sparsifying transform learning with convergence guarantees and applications (Q1799975) (← links)
• Sparse signal recovery via ECME thresholding pursuits (Q1954822) (← links)
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
• Rapid compressed sensing reconstruction: a semi-tensor product approach (Q1999186) (← links)
• Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
• Stochastic greedy algorithms for multiple measurement vectors (Q2028927) (← links)
• A rolling bearing fault detection method based on compressed sensing and a neural network (Q2047853) (← links)
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
• Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling (Q2060149) (← links)
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
• Hierarchical compressed sensing (Q2106467) (← links)
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints (Q2108537) (← links)
• Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence (Q2124198) (← links)
• Distribution agnostic Bayesian compressive sensing with incremental support estimation (Q2146510) (← links)
• Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)