Learning circulant sensing kernels
From MaRDI portal
Publication:479905
DOI10.3934/ipi.2014.8.901zbMath1332.94018OpenAlexW2029869419MaRDI QIDQ479905
Wotao Yin, Stanley J. Osher, Yang-yang Xu
Publication date: 5 December 2014
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2014.8.901
Toeplitz matrixcirculant matrixcompressive sensingdictionary learningsensing kernel learningsensing operator learning
Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Uses Software
Cites Work
- Restricted isometries for partial random circulant matrices
- Analysis and Generalizations of the Linearized Bregman Method
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Toeplitz and Circulant Matrices: A Review
- Greed is Good: Algorithmic Results for Sparse Approximation
- Compressive Sensing by Random Convolution
- Block-circulant matrices with circulant blocks, Weil sums, and mutually unbiased bases. II. The prime power case
- Optimized Projections for Compressed Sensing
- High-Resolution Radar via Compressed Sensing
- Sparse Reconstruction by Separable Approximation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
