The following pages link to Compressed sensing (Q5900527):
Displaying 50 items.
- Characterizing empirical mode decomposition algorithm using signal processing techniques (Q2312521) (← links)
- On the strong restricted isometry property of Bernoulli random matrices (Q2315024) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- Detecting edges from non-uniform Fourier data via sparse Bayesian learning (Q2316239) (← links)
- A class of alternating linearization algorithms for nonsmooth convex optimization (Q2316308) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
- A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
- Enabling numerically exact local solver for waveform inversion -- a low-rank approach (Q2321974) (← links)
- Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies (Q2322234) (← links)
- Compressed-sensing-based gradient reconstruction for ghost imaging (Q2323735) (← links)
- Sampling strategies for uncertainty reduction in categorical random fields: formulation, mathematical analysis and application to multiple-point simulations (Q2325286) (← links)
- Image encryption using sparse coding and compressive sensing (Q2326110) (← links)
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity (Q2330192) (← links)
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI (Q2330927) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Quantized compressed sensing for random circulant matrices (Q2330944) (← links)
- Multichannel interpolation of nonuniform samples with application to image recovery (Q2332780) (← links)
- Block matching video compression based on sparse representation and dictionary learning (Q2333095) (← links)
- Norm penalized joint-optimization NLMS algorithms for broadband sparse adaptive channel estimation (Q2333541) (← links)
- A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method (Q2333885) (← links)
- Numerical aspects of the nonstationary modified linearized Bregman algorithm (Q2335665) (← links)
- Region-based image-fusion framework for compressive imaging (Q2336234) (← links)
- Sparse signal recovery for direction-of-arrival estimation based on source signal subspace (Q2336510) (← links)
- A new subband adaptive filtering algorithm for sparse system identification with impulsive noise (Q2336651) (← links)
- A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography (Q2337028) (← links)
- Matrix estimation by universal singular value thresholding (Q2338924) (← links)
- On some aspects of approximation of ridge functions (Q2344299) (← links)
- An asymptotic existence result on compressed sensing matrices (Q2347356) (← links)
- New analysis of manifold embeddings and signal recovery from compressive measurements (Q2347898) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Sensor selection via compressed sensing (Q2350790) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- Optimal \(D\)-RIP bounds in compressed sensing (Q2353238) (← links)
- A novel measurement matrix based on regression model for block compressed sensing (Q2353426) (← links)
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring (Q2353428) (← links)
- Three stochastic measurement schemes for direction-of-arrival estimation using compressed sensing method (Q2354754) (← links)
- Adaptive restart for accelerated gradient schemes (Q2355332) (← links)
- Sparse proximal support vector machine with a specialized interior-point method (Q2356343) (← links)
- Bayesian semiparametric Wiener system identification (Q2356659) (← links)
- A fast \(\ell_1\)-solver and its applications to robust face recognition (Q2358854) (← links)
- Use of EM algorithm for data reduction under sparsity assumption (Q2358925) (← links)
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752) (← links)
- Optimality conditions for sparse nonlinear programming (Q2361004) (← links)
- 3D face recognition in the Fourier domain using deformed circular curves (Q2361287) (← links)
- A scheme for distributed compressed video sensing based on hypothesis set optimization techniques (Q2361288) (← links)
- A new direction-of-arrival estimation method exploiting signal structure information (Q2361290) (← links)
- Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach (Q2362610) (← links)
- Greedy strategies for convex optimization (Q2363679) (← links)
- Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
