Abstract
This paper investigates two parameters that measure the coherence of a frame: worst-case and average coherence. We first use worst-case and average coherence to derive near-optimal probabilistic guarantees on both sparse signal detection and reconstruction in the presence of noise. Next, we provide a catalog of nearly tight frames with small worst-case and average coherence. Later, we find a new lower bound on worst-case coherence; we compare it to the Welch bound and use it to interpret recently reported signal reconstruction results. Finally, we give an algorithm that transforms frames in a way that decreases average coherence without changing the spectral norm or worst-case coherence.
Original language | English (US) |
---|---|
Pages (from-to) | 58-78 |
Number of pages | 21 |
Journal | Applied and Computational Harmonic Analysis |
Volume | 33 |
Issue number | 1 |
DOIs | |
State | Published - Jul 2012 |
All Science Journal Classification (ASJC) codes
- Applied Mathematics
Keywords
- Average coherence
- Frames
- Sparse signal processing
- Welch bound
- Worst-case coherence