solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看1627次
Average performance of Orthogonal Matching Pursuit (OMP) for sparse approximation. (arXiv:1809.06684v1 [cs.IT])
来源于:arXiv
We present a theoretical analysis of the average performance of OMP for
sparse approximation. For signals, that are generated from a dictionary with
$K$ atoms and coherence $\mu$ and coefficients corresponding to a geometric
sequence with parameter~$\alpha$, we show that OMP is successful with high
probability as long as the sparsity level $S$ scales as $S\mu^2 \log K \lesssim
1-\alpha $. This improves by an order of magnitude over worst case results and
shows that OMP and its famous competitor Basis Pursuit outperform each other
depending on the setting. 查看全文>>