arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.4426stat.MLcs.LG
收藏

压缩感知的优化:单纯形法和Kronecker稀疏化

Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification

Princeton University(普林斯顿大学)

Robert Vanderbei, Han Liu, Lie Wang, Kevin Lin

摘要:

在本文中,我们提出了两种新的方法来有效地解决大规模的压缩感知问题。这两个概念是相互独立的,因此可以单独使用或一起使用。我们考虑了所有的可能性。对于第一种方法,我们注意到,零向量可以作为线性规划问题的初始基本(不可行)解,因此,如果真实信号非常稀疏,则可以预期单纯形方法的一些变体仅需要少量的枢轴来获得解。我们实现了这样一个变种,并证明了一个显着的改善非常稀疏的信号上的计算时间。第二种方法需要重新设计的传感机制,其中矢量信号被堆叠成矩阵。这使我们能够利用克罗内克压缩传感(KCS)机制。我们表明,克罗内克传感需要更强的条件相比,原来的向量问题的完美恢复。然而,正确建模的克罗内克传感是一个稀疏的线性优化问题。因此,受益于稀疏问题表示的算法,如邻域点方法,可以比相应的向量问题更快地解决克罗内克传感问题。在我们的数值研究中,我们证明了十倍的计算时间的改善。

英文摘要:

In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider all possibilities. For the first approach, we note that the zero vector can be taken as the initial basic (infeasible) solution for the linear programming problem and therefore, if the true signal is very sparse, some variants of the simplex method can be expected to take only a small number of pivots to arrive at a solution. We implemented one such variant and demonstrate a dramatic improvement in computation time on very sparse signals. The second approach requires a redesigned sensing mechanism in which the vector signal is stacked into a matrix. This allows us to exploit the Kronecker compressed sensing (KCS) mechanism. We show that the Kronecker sensing requires stronger conditions for perfect recovery compared to the original vector problem. However, the Kronecker sensing, modeled correctly, is a much sparser linear optimization problem. Hence, algorithms that benefit from sparse problem representation, such as interior-point methods, can solve the Kronecker sensing problems much faster than the corresponding vector problem. In our numerical studies, we demonstrate a ten-fold improvement in the computation time.

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

↑