arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.7538cs.ITmath.IT
收藏

贝叶斯追踪算法

Bayesian Pursuit Algorithms

Cédric Herzet, Angélique Drémeau

摘要:

本文讨论了稀疏表示(SR)的问题在一般贝叶斯框架。我们证明了标准SR问题的拉格朗日公式,即,$\mathbf{x}^\star=\arg\min_\mathbf{x} \lbrace \| \mathbf{y}-\mathbf{D}\mathbf{x} \|_2^2+λ\| \mathbf{x}\|_0 \rbrace$,可以被视为一个极限情况下的一般最大后验概率(MAP)问题,涉及伯努利-高斯变量。然后,我们提出了不同的易于处理的实现这个MAP问题,我们称之为“贝叶斯追求算法”。贝叶斯算法被证明与文献中的几个众所周知的追踪算法(例如,MP,OMP,StOMP,CoSaMP,SP),并对其进行了几个方面的推广。特别是,i)它们允许原子取消选择; ii)它们可以包括关于选择过程中每个原子出现概率的任何先验信息; iii)它们可以将未知模型参数的估计包含到它们的递归中。

英文摘要:

This paper addresses the sparse representation (SR) problem within a general Bayesian framework. We show that the Lagrangian formulation of the standard SR problem, i.e., $\mathbf{x}^\star=\arg\min_\mathbf{x} \lbrace \| \mathbf{y}-\mathbf{D}\mathbf{x} \|_2^2+λ\| \mathbf{x}\|_0 \rbrace$, can be regarded as a limit case of a general maximum a posteriori (MAP) problem involving Bernoulli-Gaussian variables. We then propose different tractable implementations of this MAP problem that we refer to as "Bayesian pursuit algorithms". The Bayesian algorithms are shown to have strong connections with several well-known pursuit algorithms of the literature (e.g., MP, OMP, StOMP, CoSaMP, SP) and generalize them in several respects. In particular, i) they allow for atom deselection; ii) they can include any prior information about the probability of occurrence of each atom within the selection process; iii) they can encompass the estimation of unkown model parameters into their recursions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑