基于ProSparse的傅立叶和局部基稀疏表示的概率分析
Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis
摘要:
在过去的几年里,在过完备字典中寻找信号的稀疏表示吸引了很多关注。本文研究ProSparse,一种新的多项式复杂度算法,解决了稀疏表示问题时,底层字典是一个Vandermonde矩阵和带状矩阵的联合。不像我们以前的工作,建立确定性(最坏情况下)的稀疏边界ProSparse成功,本文提出了一个概率平均情况下分析的算法。基于生成函数方法,给出了ProSparse算法精确成功概率的封闭表达式.成功概率也在高维政权进行了分析。这种渐近分析表征了关于算法性能的急剧相变现象。
英文摘要:
Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem when the underlying dictionary is the union of a Vandermonde matrix and a banded matrix. Unlike our previous work which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper presents a probabilistic average-case analysis of the algorithm. Based on a generating-function approach, closed-form expressions for the exact success probabilities of ProSparse are given. The success probabilities are also analyzed in the high-dimensional regime. This asymptotic analysis characterizes a sharp phase transition phenomenon regarding the performance of the algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。