返回
An Adaptive Markov Random Field for Structured Compressive Sensing
DOI:10.1109/TIP.2018.2878294.png)
摘要
En 中文
Exploiting intrinsic structures in sparse signals underpin the recent progress in compressive sensing (CS). The key for exploiting such structures is to achieve two desirable properties: generality (i.e., the ability to fit a wide range of signals with diverse structures) and adaptability (i.e., being adaptive to a specific signal). Most existing approaches, however, often only achieve one of these two properties. In this paper, we propose a novel adaptive Markov random field sparsity prior for CS, which not only is able to capture a broad range of sparsity structures, but also can adapt to each sparse signal through refining the parameters of the sparsity prior with respect to the compressed measurements. To maximize the adaptability, we also propose a new sparse signal estimation, where the sparse signals, support, noise, and signal parameter estimation are unified into a variational optimization problem, which can be effectively solved with an alternative minimization scheme. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed method in recovery accuracy, noise tolerance, and runtime.
Keyword:
Structured compressive sensing
probabilistic graphical models
sparse representation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
Bayesian compressive sensing for cluster structured sparse signals簇结构稀疏信号的贝叶斯压缩感知
SIGNAL PROCESSING
IF3.6
Imine-linked micron-network polymers with high polyethylene glycol uptake for shaped-stabilized phase change materials
RSC Advances
IF0

