# A Robust Parallel Algorithm for Combinatorial Compressed Sensing

@article{MendozaSmith2018ARP,
title={A Robust Parallel Algorithm for Combinatorial Compressed Sensing},
author={Rodrigo Mendoza-Smith and Jared Tanner and Florian Wechsung},
journal={IEEE Transactions on Signal Processing},
year={2018},
volume={66},
pages={2167-2177}
}
• Published 28 April 2017
• Mathematics, Computer Science
• IEEE Transactions on Signal Processing
It was shown in previous work that a vector <inline-formula><tex-math notation="LaTeX">$\mathbf{x} \in \mathbb {R}^n$</tex-math></inline-formula> with at most <inline-formula><tex-math notation="LaTeX">$k < n$</tex-math> </inline-formula> nonzeros can be recovered from an expander sketch <inline-formula><tex-math notation="LaTeX"> $\mathbf{A}\mathbf{x}$</tex-math></inline-formula> in <inline-formula><tex-math notation="LaTeX"> $\mathcal{O}(\text{nnz}(\mathbf{A})\log k)$</tex-math></inline… Expand
8 Citations
The Permuted Striped Block Model and its Factorization - Algorithms with Recovery Guarantees
• Computer Science
• ArXiv
• 2020
The PSB data model is defined as a particular distribution over this class of matrices, motivated by its implications for community detection, provable binary dictionary learning with real valued sparse coding, and blind combinatorial compressed sensing. Expand
On the Construction of Sparse Matrices From Expander Graphs
• Computer Science, Mathematics
• Front. Appl. Math. Stat.
• 2018
A new reduced sample complexity for the number of nonzeros per column of these matrices is derived, precisely d = \mathcal{O}\left(\log_s(N/s) \right)\$; this gives insights into why using small d performed well in numerical experiments involving such matrices. Expand
Expander ℓ0-Decoding
• Mathematics, Computer Science
• Applied and Computational Harmonic Analysis
• 2018
Two new algorithms, Serial- l 0 and Parallel- l0, are introduced for solving a large underdetermined linear system of equations y = A x ∈ R m when it is known that x has at most k m nonzero entries and A is the adjacency matrix of an unbalanced left d-regular expander graph. Expand
Encoder blind combinatorial compressed sensing
• Computer Science, Engineering
• 2020
It is proved that D-EBF recovers both the encoder and sparse coding matrix at the optimal measurement rate with high probability in n, from a near optimal number N = Ω ( n k log (n) ) of measurement vectors. Expand
Robust Multichannel EEG Compressed Sensing in the Presence of Mixed Noise
• Computer Science
• IEEE Sensors Journal
• 2019
This paper proposes a novel multichannel EEG CS method based on sparse and low rank representation in the presence of mixed noise (SLRMN), which can take both Gaussian noise and impulsive noise into consideration, and develops the alternative direction method of multipliers (ADMM) to solve the proposed SLRMN. Expand
FFOCT imaging based on compressed sensing
• Computer Science
• 2020
Based on the high-resolution tomographic image obtained from the organ tissue, compressed sensing theory is used to perform compression reconstruction simulation and it is verified that the amount of data stored in the three-dimensional image of the diseased tissue is effectively reduced without changing the image resolution. Expand
Facets of high-dimensional Gaussian polytopes
• Mathematics
• 2018
We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when theExpand
A directly seeking spectrum holes algorithm by compressive sampling
• Hua Zhao
• Computer Science
• Int. J. Commun. Syst.
• 2019