GOAMP achieves error-free reconstruction of sublinearly sparse signals from linear measurements when the measurement dimension exceeds a threshold matching that of Gaussian AMP, provided the non-zero support avoids a neighborhood of the origin.
Iterative hard thresho lding for compressed sensing,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A survey classifying low-rank matrix completion techniques into two categories, discussing required matrix properties, CNN-based variants, and comparing recovery performance with computational complexity.
citing papers explorer
-
Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity
GOAMP achieves error-free reconstruction of sublinearly sparse signals from linear measurements when the measurement dimension exceeds a threshold matching that of Gaussian AMP, provided the non-zero support avoids a neighborhood of the origin.
-
Low-Rank Matrix Completion: A Contemporary Survey
A survey classifying low-rank matrix completion techniques into two categories, discussing required matrix properties, CNN-based variants, and comparing recovery performance with computational complexity.