On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm
Publication:4689776
DOI10.1137/17M1148426zbMath1401.62102arXiv1709.06616OpenAlexW2963736506WikidataQ129606562 ScholiaQ129606562MaRDI QIDQ4689776
Qiuwei Li, Xiongxiong He, Gang Li, Zhihui Zhu, Jiajun Ding
Publication date: 17 October 2018
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06616
Image analysis in multivariate analysis (62H35) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Compressed sensing with coherent and redundant dictionaries
- Iterative thresholding for sparse approximations
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A simple proof of the restricted isometry property for random matrices
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- The cosparse analysis model and algorithms
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence analysis for iterative data-driven tight frame construction scheme
- Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
- Certifying the Restricted Isometry Property is Hard
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Designing structured tight frames via an alternating projection method
- Sparse and Redundant Representations
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Atomic Decomposition by Basis Pursuit
- Optimized Projections for Compressed Sensing
- Best Basis Compressed Sensing
- Sensing Matrix Optimization for Block-Sparse Decoding
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range
- On Projection Matrix Optimization for Compressive Sensing Systems
- Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
- Improving M-SBL for Joint Sparse Recovery Using a Subspace Penalty
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Designing robust sensing matrix for image compression
- Cloud K-SVD: A Collaborative Dictionary Learning Algorithm for Big, Distributed Data
- Performance Limits for Noisy Multimeasurement Vector Problems
- Matching pursuits with time-frequency dictionaries
- A Plurality of Sparse Representations Is Better Than the Sparsest One Alone
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Sparse Signal Reconstruction via Iterative Support Detection
- Compressed sensing
This page was built for publication: On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm
