Pages that link to "Item:Q3549018"

The following pages link to Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit (Q3549018):

Displaying 50 items.

• Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction (Q2198239) (← links)
• A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration (Q2198630) (← links)
• Geological facies recovery based on weighted \(\ell_1\)-regularization (Q2198925) (← links)
• Cluster sparsity field: an internal hyperspectral imagery prior for reconstruction (Q2200022) (← links)
• Recovering an unknown signal completely submerged in strong noise by a new stochastic resonance method (Q2206064) (← links)
• Bipolar measurement matrix using chaotic sequence (Q2207348) (← links)
• Stability of 1-bit compressed sensing in sparse data reconstruction (Q2217038) (← links)
• Some greedy algorithms for sparse polynomial chaos expansions (Q2220572) (← links)
• Variance-based adaptive sequential sampling for polynomial chaos expansion (Q2246308) (← links)
• Spectral compressive sensing (Q2252132) (← links)
• Data-driven time-frequency analysis (Q2252154) (← links)
• Convergence of a data-driven time-frequency analysis method (Q2252514) (← links)
• Functional concurrent linear regression model for spatial images (Q2260207) (← links)
• On rank awareness, thresholding, and MUSIC for joint sparse recovery (Q2278470) (← links)
• A novel design of sparse prototype filter for nearly perfect reconstruction cosine-modulated filter banks (Q2283880) (← links)
• An effective algorithm for the spark of sparse binary measurement matrices (Q2287709) (← links)
• Analysis of compressed distributed adaptive filters (Q2288711) (← links)
• An efficient privacy-preserving compressive data gathering scheme in WSNs (Q2293079) (← links)
• Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method (Q2295093) (← links)
• A new smoothed L0 regularization approach for sparse signal recovery (Q2298142) (← links)
• A physics-constrained data-driven approach based on locally convex reconstruction for noisy database (Q2309342) (← links)
• Deterministic constructions of compressed sensing matrices based on codes (Q2311429) (← links)
• Lattices from tight frames and vertex transitive graphs (Q2325750) (← links)
• Image encryption using sparse coding and compressive sensing (Q2326110) (← links)
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
• sampling based automatic modulation classifier (Q2333091) (← links)
• A sparse signal reconstruction method based on improved double chains quantum genetic algorithm (Q2333565) (← links)
• A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method (Q2333885) (← links)
• Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems (Q2335937) (← links)
• Region-based image-fusion framework for compressive imaging (Q2336234) (← links)
• Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case (Q2338338) (← links)
• Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
• Three stochastic measurement schemes for direction-of-arrival estimation using compressed sensing method (Q2354754) (← links)
• The sparsest solution to the system of absolute value equations (Q2356345) (← links)
• Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach (Q2362610) (← links)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
• Compressed sensing by inverse scale space and curvelet thresholding (Q2378722) (← links)
• Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis (Q2398391) (← links)
• Adaptive step-size matching pursuit algorithm for practical sparse reconstruction (Q2402080) (← links)
• On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms (Q2402492) (← links)
• Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector (Q2411715) (← links)
• Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection (Q2416964) (← links)
• Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model (Q2423989) (← links)
• Model's sparse representation based on reduced mixed GMsFE basis methods (Q2424473) (← links)
• A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
• Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
• Performance analysis of the compressed distributed least squares algorithm (Q2670748) (← links)