arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.09450math.OC
收藏

多值信号的压缩感知

Compressed Sensing for Finite-Valued Signals

Sandra Keiper, Gitta Kutyniok, Dae Gwan Lee, Götz E. Pfander

摘要:

在科学和工程中经常需要从少量的测量数据中重构离散稀疏信号,即求解一个待定的线性方程组。而经典的压缩感知算法不包括额外的知识的离散性质的信号,经典的晶格解码方法,如球解码器不利用稀疏约束。在这项工作中,我们提出了一种方法,将离散值之前的基础追求。特别是,我们解决单极二进制和双极三进制稀疏信号,即,分别在$\{-1,0,1\}$中具有$\{0,1\}$中的条目的稀疏信号。我们将表明,相变发生早于当使用经典的基追踪方法,独立的信号的稀疏性,在最多$N/2$,分别为$3N/4$,测量是必要的,以恢复一个单极二进制,和一个双极三进制信号唯一,其中$N$是周围空间的尺寸。我们将进一步讨论算法的鲁棒性和推广到具有较大字母表条目的信号。

英文摘要:

The need of reconstructing discrete-valued sparse signals from few measurements, that is solving an undetermined system of linear equations, appears frequently in science and engineering. Whereas classical compressed sensing algorithms do not incorporate the additional knowledge of the discrete nature of the signal, classical lattice decoding approaches such as the sphere decoder do not utilize sparsity constraints. In this work, we present an approach that incorporates a discrete values prior into basis pursuit. In particular, we address unipolar binary and bipolar ternary sparse signals, i.e., sparse signals with entries in $\{0,1\}$, respectively in $\{-1,0,1\}$. We will show that phase transition takes place earlier than when using the classical basis pursuit approach and that, independently of the sparsity of the signal, at most $N/2$, respectively $3N/4$, measurements are necessary to recover a unipolar binary, and a bipolar ternary signal uniquely, where $N$ is the dimension of the ambient space. We will further discuss robustness of the algorithm and generalizations to signals with entries in larger alphabets.

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

↑