稀疏恢复的快速方法:L1的替代方法Fast methods for sparse recovery: alternatives to L1 |
|
课程网址: | http://videolectures.net/smls09_davies_fmfsr/ |
主讲教师: | Mike Davies |
开课单位: | 爱丁堡大学 |
开课时间: | 2009-05-06 |
课程语种: | 英语 |
中文简介: | 从信号采集到信号源分离,在不确定的逆问题中找到稀疏的解决方案是在广泛的信号处理应用中遇到的一项基本挑战。在我们对这个问题的理解上,理论上的最新进展使人们对其应用到各个领域的兴趣进一步增加。在许多领域,例如医学成像或地球物理数据采集,有必要找到针对很大的欠定反问题的稀疏解。因此必须开发快速方法。在本次演讲中,我们将介绍两类快速算法,它们与更经典的L1最小化(基本追求)具有竞争力。第一种技术基于贪婪选择方法。但是,在每次迭代中,都会选择几个新元素。然后使用共轭更新方向更新所选系数。这是先前建议的“梯度追踪”框架的扩展,以允许采用更为贪婪的选择策略。它还具有允许在恢复性能和计算复杂度之间平稳权衡的独特属性。我们讨论的第二种技术是一种非常简单的策略,称为迭代硬阈值(IHT)。尽管它很简单,但可以证明:它提供了接近最佳的性能保证;它对观察噪声具有鲁棒性;它具有较低的每次迭代有限的计算复杂度,并且仅需要固定次数的迭代,具体取决于信号的信噪比。不幸的是,一次全面应用IHT产生的经验性能大大低于其他现有技术的恢复算法。因此,我们讨论了可以修改算法以获得与现有技术相当的性能,同时保留其强大的理论特性。 |
课程简介: | Finding sparse solutions to underdetermined inverse problems is a fundamental challenge encountered in a wide range of signal processing applications, from signal acquisition to source separation. Recent theoretical advances in our understanding of this problem have further increased interest in their application to various domains. In many areas, such as for example medical imaging or geophysical data acquisition, it is necessary to find sparse solutions to very large underdetermined inverse problems. Fast methods therefore have to be developed. In this talk, we will present two classes of fast algorithm that are competitive with the more classical L1 minimization (Basis Pursuit). The first techniques is based upon a greedy selection approach. However in each iteration, several new elements are selected. The selected coefficients are then updated using a conjugate update direction. This is an extension of the previously suggested Gradient Pursuit framework to allow an even greedier selection strategy. It also has the unique property of allowing a smooth trade-off between recovery performance and computational complexity. The second technique that we discuss is an extremely simple strategy called Iterative Hard thresholding (IHT). Despite its simplicity it can be shown that: it gives near-optimal performance guarantees; it is robust to observation noise; it has low bounded computational complexity per iteration and only requires a fixed number of iterations depending on the signal to noise ratio of the signal. Unfortunately a niaive application of IHT yields empirical performance substantially below that of other state of the art recovery algorithms. We therefore discuss have the algorithm can be modified to obtain performance that is comparable with state of the art while retaining its strong theoretical properties. |
关 键 词: | 信号源; 地球物理数据; 欠定反问题 |
课程来源: | 视频讲座网 |
最后编审: | 2020-05-22:杨雨(课程编辑志愿者) |
阅读次数: | 93 |