Pages that link to "Item:Q3549018"

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

Displaying 50 items.

• A Greedy Algorithm for Sparse Precision Matrix Approximation (Q5079528) (← links)
• The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials (Q5094726) (← links)
• Locality constrained dictionary learning for human behaviour recognition (Q5106948) (← links)
• Reconstruction of Smooth 3D Color Functions from Keypoints: Application to Lossy Compression and Exemplar-Based Generation of Color LUTs (Q5143306) (← links)
• Orthogonal Nonnegative Tucker Decomposition (Q5147984) (← links)
• (Q5149233) (← links)
• (Q5149239) (← links)
• Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control (Q5152596) (← links)
• The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
• Chaotic Binary Sensing Matrices (Q5197651) (← links)
• The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy (Q5210421) (← links)
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems (Q5210512) (← links)
• Solving inverse problems using data-driven models (Q5230520) (← links)
• Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods (Q5231667) (← links)
• Robust network structure reconstruction based on Bayesian compressive sensing (Q5242054) (← links)
• Perturbation Analysis of Orthogonal Least Squares (Q5242545) (← links)
• Minimization of $\ell_{1-2}$ for Compressed Sensing (Q5251929) (← links)
• Compressive Sampling for Energy Spectrum Estimation of Turbulent Flows (Q5258610) (← links)
• Solving Basis Pursuit (Q5270711) (← links)
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise (Q5273564) (← links)
• Robust Data Assimilation Using $L_1$ and Huber Norms (Q5275041) (← links)
• Quantifying Statistical Interdependence by Message Passing on Graphs—Part II: Multidimensional Point Processes (Q5323762) (← links)
• Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases (Q5327163) (← links)
• Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery (Q5380402) (← links)
• Improving the Incoherence of a Learned Dictionary via Rank Shrinkage (Q5380643) (← links)
• CHAOTIC ANALOG-TO-INFORMATION CONVERSION: PRINCIPLE AND RECONSTRUCTABILITY WITH PARAMETER IDENTIFIABILITY (Q5407274) (← links)
• A time continuation based fast approximate algorithm for compressed sensing related optimization (Q5501146) (← links)
• Adaptive surface-related multiple subtraction using sparse norm minimization method (Q5746703) (← links)
• A Plaintext-Related Image Encryption Algorithm Based on Compressive Sensing and a Novel Hyperchaotic System (Q5854875) (← links)
• A survey on compressive sensing: classical results and recent advancements (Q5855706) (← links)
• Sequential Active Learning of Low-Dimensional Model Representations for Reliability Analysis (Q5864079) (← links)
• Compressed sensing reconstruction using expectation propagation (Q5869953) (← links)
• A new result on recovery sparse signals using orthogonal matching pursuit (Q5880131) (← links)
• Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method (Q5881246) (← links)
• Discussion on “Two-Stage Procedures for High-Dimensional Data” by Makoto Aoshima and Kazuyoshi Yata (Q5894437) (← links)
• \(\mathrm{L_1RIP}\)-based robust compressed sensing (Q6042575) (← links)
• On recovery of discrete time signals with single-point spectrum degeneracy (Q6046512) (← links)
• Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery (Q6053460) (← links)
• Heuristics for Finding Sparse Solutions of Linear Inequalities (Q6053490) (← links)
• Greedy Variable Selection for High-Dimensional Cox Models (Q6069891) (← links)
• Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (Q6072435) (← links)
• An outlier detection and recovery method based on moving least squares quasi-interpolation scheme and \(\text{ł}_0\)-minimization problem (Q6072817) (← links)
• (Q6073213) (← links)
• Sparse signal reconstruction via collaborative neurodynamic optimization (Q6076704) (← links)
• Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization (Q6078747) (← links)
• Weighted singular value decomposition basis of Szegő kernel and its applications to signal reconstruction and denoising (Q6099470) (← links)
• Kernel functions embed into the autoencoder to identify the sparse models of nonlinear dynamics (Q6121868) (← links)
• Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification (Q6125488) (← links)
• Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems (Q6134435) (← links)
• Heavy-ball-based hard thresholding algorithms for sparse signal recovery (Q6137779) (← links)