Two are better than one: Fundamental parameters of frame coherence

被引:45
作者
Bajwa, Waheed U. [2 ]
Calderbank, Robert [1 ,3 ]
Mixon, Dustin G. [1 ]
机构
[1] Princeton Univ, Program Appl & Computat Math, Princeton, NJ 08544 USA
[2] Rutgers State Univ, Dept Elect & Comp Engn, Piscataway, NJ 08854 USA
[3] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
关键词
Frames; Worst-case coherence; Average coherence; Welch bound; Sparse signal processing; PROBABILITY-INEQUALITIES; SPARSE REPRESENTATION; RECOVERY; RECONSTRUCTION; MATRICES;
D O I
10.1016/j.acha.2011.09.005
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. Published by Elsevier Inc.
引用
收藏
页码:58 / 78
页数:21
相关论文
共 56 条
[1]   COMPLEX SEQUENCES WITH LOW PERIODIC CORRELATIONS [J].
ALLTOP, WO .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (03) :350-354
[2]   Problems and results in extremal combinatorics - I [J].
Alon, N .
DISCRETE MATHEMATICS, 2003, 273 (1-3) :31-53
[3]  
Alon N., 2015, PROBABILISTIC METHOD
[4]  
[Anonymous], 1973, C INT TEOR COMB ROM
[5]  
[Anonymous], AM CONTR C
[6]  
[Anonymous], THESIS U WISCONSIN M
[7]  
[Anonymous], ARXIV10095730V1
[8]  
[Anonymous], 1499 I RECH INF SYST
[9]  
[Anonymous], 2005, PHYS REV A
[10]   Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role in Model Selection [J].
Bajwa, Waheed U. ;
Calderbank, Robert ;
Jafarpour, Sina .
JOURNAL OF COMMUNICATIONS AND NETWORKS, 2010, 12 (04) :289-307