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

一类模糊随机图的密度演化:快速MRI的理论框架

Density Evolution on a Class of Smeared Random Graphs: A Theoretical Framework for Fast MRI

Kabir Chandrasekher, Orhan Ocal, Kannan Ramchandran

摘要:

我们引入了一个新的合奏随机二部图,我们称之为“涂抹合奏”,其中每个左节点连接到一些连续的右节点。当信号采集在傅立叶域中时,例如在磁共振成像(MRI)中,这样的图自然地出现在稀疏小波系数的恢复中。来自该集合的图以高概率呈现小的结构化循环,使得用于确定迭代解码阈值的当前技术不适用。在本文中,我们开发了一个理论平台来分析和评估涂抹基结构的效果。尽管存在这些小循环,我们得到确切的密度演化递归迭代解码的图上的污点长度为2。此外,我们给出了一个更大的类从涂抹合奏的性能上的下限,并提供了数值实验显示经验阈值和我们的界限确定的紧密的协议。最后,我们描述了一个系统架构,以恢复稀疏小波表示在MRI设置,给出明确的阈值上的最小数量的傅立叶样本需要获得的$1$阶段Haar小波设置。特别是,我们表明,$K$ -稀疏$1$ -阶段Haar小波系数的$n$维信号可以恢复使用$2.63K$傅立叶域样本渐近使用$\mathcal{O}(K\log{K})$操作。

英文摘要:

We introduce a new ensemble of random bipartite graphs, which we term the `smearing ensemble', where each left node is connected to some number of consecutive right nodes. Such graphs arise naturally in the recovery of sparse wavelet coefficients when signal acquisition is in the Fourier domain, such as in magnetic resonance imaging (MRI). Graphs from this ensemble exhibit small, structured cycles with high probability, rendering current techniques for determining iterative decoding thresholds inapplicable. In this paper, we develop a theoretical platform to analyze and evaluate the effects of smearing-based structure. Despite the existence of these small cycles, we derive exact density evolution recurrences for iterative decoding on graphs with smear-length two. Further, we give lower bounds on the performance of a much larger class from the smearing ensemble, and provide numerical experiments showing tight agreement between empirical thresholds and those determined by our bounds. Finally, we describe a system architecture to recover sparse wavelet representations in the MRI setting, giving explicit thresholds on the minimum number of Fourier samples needing to be acquired for the $1$-stage Haar wavelet setting. In particular, we show that $K$-sparse $1$-stage Haar wavelet coefficients of an $n$-dimensional signal can be recovered using $2.63K$ Fourier domain samples asymptotically using $\mathcal{O}(K\log{K})$ operations.

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

↑