Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in which the signal is assumed to be generated as a combination of a few atoms from a given dictionary. In this work we consider a Bayesian setting and go beyond the classic assumption of independence between the atoms. The main goal of this paper is to introduce a statistical model that takes such dependencies into account and show how this model can be used for sparse signal recovery. We follow the suggestion of two recent works and assume that the sparsity pattern is modeled by a Boltzmann machine, a commonly used graphical model. For general dependency models, exact MAP and MMSE estimation of the sparse representation becomes computationally complex. To simplify the computations, we propose greedy approximations of the MAP and MMSE estimators. We then consider a special case in which exact MAP is feasible, by assuming that the dictionary is unitary and the dependency model corresponds to a certain sparse graph. Exploiting this structure, we develop an efficient message passing algorithm that recovers the underlying signal. When the model parameters defining the underlying graph are unknown, we suggest an algorithm that learns these parameters directly from the data, leading to an iterative scheme for adaptive sparse signal recovery. The effectiveness of our approach is demonstrated on real-life signals - patches of natural images - where we compare the denoising performance to that of previous recovery methods that do not exploit the statistical dependencies.
Continuous Angular Power Spectrum Recovery From Channel Covariance via Chebyshev Polynomials
College of Future Information Technology, Fudan University(复旦大学未来信息技术学院);School of Mathematical Sciences, Peking University(北京大学数学科学学院);State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院数学科学国家重点实验室);National Key Laboratory of Wireless Communications, University of Electronic Science and Technology of China(电子科技大学无线通信国家重点实验室)
MAP Support Detection for Greedy Sparse Signal Recovery Algorithms in Compressive Sensing
Intel Labs(英特尔实验室);University of Texas at Austin(德克萨斯大学奥斯汀分校)
一个可靠的支持检测是必不可少的贪心算法从压缩和噪声测量准确地重建稀疏信号。提出了一种新的贪心算法支持度检测方法--\textit{maximum a posteriori (MAP) support detection}。不同于现有的支持检测方法,确定支持指数的幅度最大的相关值,每次迭代,所提出的方法选择他们的最大似然比计算下的真实和空的支持假设,同时利用传感矩阵,稀疏信号和噪声的分布。利用这种技术,MAP匹配追踪(MAP-MP)首次提出了利用建议的支持检测方法的优点,并推导出了一个充分条件时,稀疏信号是二进制的情况下,完美的信号恢复。随后,一组迭代的贪心算法,称为MAP-广义正交匹配追踪(MAP-gOMP),MAP-压缩采样匹配追踪(MAP-CoSaMP),和MAP-子空间追踪(MAP-SP),以证明所提出的支持检测方法现有的贪心算法的适用性。实验结果表明,所提出的贪心算法具有高可靠性的支持检测,可以更好,更快,更容易实现比通过线性规划的基追踪。
Jointly Sparse Blind Deconvolution via Riemannian Optimization
School of Mathematics and Statistics, Xi’an Jiaotong University(西安交通大学数学与统计学院);College of Electronic Engineering, National University of Defense Technology(国防科技大学电子工程学院);School of Mathematical Sciences,University of Science and Technology of China(中国科学技术大学数学科学学院)
Pattern-Coupled Sparse Bayesian Learning for Recovery of Block-Sparse Signals
University of Electronic Science and Technology of China(电子科技大学);Stevens Institute of Technology(史蒂文斯理工学院);Schlumberger-Doll Research Center(斯伦贝谢多尔研究中心)