Learning circulant sensing kernels
From MaRDI portal
Recommendations
- Learning by Kernel Polarization
- Feature space perspectives for learning the kernel
- scientific article; zbMATH DE number 1934580
- scientific article; zbMATH DE number 1931862
- Multiple Kernel Learningの学習理論
- Learning via variably scaled kernels
- scientific article; zbMATH DE number 5957287
- scientific article; zbMATH DE number 7646022
- Learning the kernel function via regularization
- Learning the kernel matrix with semidefinite programming
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Analysis and generalizations of the linearized Bregman method
- Block-circulant matrices with circulant blocks, Weil sums, and mutually unbiased bases. II. The prime power case
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Compressed sensing
- Compressive sensing by random convolution
- Greed is Good: Algorithmic Results for Sparse Approximation
- High-Resolution Radar via Compressed Sensing
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- Matching pursuits with time-frequency dictionaries
- Optimized Projections for Compressed Sensing
- Restricted isometries for partial random circulant matrices
- Sparse Reconstruction by Separable Approximation
- Stable signal recovery from incomplete and inaccurate measurements
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Toeplitz and Circulant Matrices: A Review
This page was built for publication: Learning circulant sensing kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479905)