arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.4996eess.SYcs.ITcs.SYmath.ITstat.ML
收藏

压缩移位检索

Compressive Shift Retrieval

University of California, Berkeley(加州大学伯克利分校);Linköping University(林雪平大学);Technion – Israel Institute of Technology(以色列理工学院)

Henrik Ohlsson, Yonina C. Eldar, Allen Y. Yang, S. Shankar Sastry

AI总结:

针对经典移位检索问题,提出从压缩信号中直接估计移位的方法,利用傅里叶系数在温和条件下仅需一个系数即可恢复真实移位。

摘要:

经典的移位检索问题考虑两个向量形式的信号,它们通过移位相关联。该问题在许多应用中非常重要,通常通过最大化两个信号之间的互相关来解决。受压缩感知的启发,本文旨在直接从压缩信号中估计移位。我们表明,在某些条件下,与经典设置相比,可以使用更少的样本和更少的计算来恢复移位。特别令人感兴趣的是从傅里叶系数估计移位。我们表明,在相当温和的条件下,仅需一个傅里叶系数就足以恢复真实移位。

英文摘要:

The classical shift retrieval problem considers two signals in vector form that are related by a shift. The problem is of great importance in many applications and is typically solved by maximizing the cross-correlation between the two signals. Inspired by compressive sensing, in this paper, we seek to estimate the shift directly from compressed signals. We show that under certain conditions, the shift can be recovered using fewer samples and less computation compared to the classical setup. Of particular interest is shift estimation from Fourier coefficients. We show that under rather mild conditions only one Fourier coefficient suffices to recover the true shift.

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

↑