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

具有完整性约束的稀疏恢复

Sparse Recovery With Integrality Constraints

Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann

摘要:

我们调查的稀疏整数值的信号从少量的线性测量的唯一可恢复性的条件。这两个目标的最小化的数目的非零组件,所谓的$\ell_0$ -规范,以及其流行的替代品,$\ell_1$ -规范,涵盖。此外,完整性约束和可能的界限上的变量进行了研究。我们的研究结果表明,额外的先验知识的信号完整性允许恢复更多的信号比可以保证从(连续)压缩感知的恢复条件。此外,即使所考虑的问题是\NP -硬一般(即使与$\ell_1$ -目标),我们调查测试的$\ell_0$ -恢复条件,通过一些数值实验。事实证明,相应的问题是很难解决的实际使用黑盒软件。然而,中等规模的$\ell_0$ -和$\ell_1$ -最小化与二进制变量的情况下,可以在合理的时间内精确地解决。

英文摘要:

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as its popular substitute, the $\ell_1$-norm, are covered. Furthermore, integrality constraints and possible bounds on the variables are investigated. Our results show that the additional prior knowledge of signal integrality allows for recovering more signals than what can be guaranteed by the established recovery conditions from (continuous) compressed sensing. Moreover, even though the considered problems are \NP-hard in general (even with an $\ell_1$-objective), we investigate testing the $\ell_0$-recovery conditions via some numerical experiments. It turns out that the corresponding problems are quite hard to solve in practice using black-box software. However, medium-sized instances of $\ell_0$- and $\ell_1$-minimization with binary variables can be solved exactly within reasonable time.

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

↑