arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.5187cs.ITmath.IT
收藏

稀疏线性算子的识别

Identification of Sparse Linear Operators

Reinhard Heckel, Helmut Bölcskei

摘要:

我们考虑的问题,确定一个线性确定性运营商从其响应一个给定的探测信号。对于一个大类的线性算子,我们证明了稳定的可识别性是可能的,如果运营商的扩展函数的总支持区满足D<=1/2。该结果适用于扩展函数的任意(可能是碎片化的)支持区域,不对支持区域的总范围施加限制,并且最重要的是,不需要在识别之前已知支持区域。进一步证明了当D<1时,几乎所有算子的稳定可识别性都是可能的.这个结果是令人惊讶的,因为它表明在识别之前不知道扩展函数的支持区域没有惩罚。给出了可证明恢复所有D<=1/2的算子和几乎所有D<1的算子的算法。

英文摘要:

We consider the problem of identifying a linear deterministic operator from its response to a given probing signal. For a large class of linear operators, we show that stable identifiability is possible if the total support area of the operator's spreading function satisfies D<=1/2. This result holds for an arbitrary (possibly fragmented) support region of the spreading function, does not impose limitations on the total extent of the support region, and, most importantly, does not require the support region to be known prior to identification. Furthermore, we prove that stable identifiability of almost all operators is possible if D<1. This result is surprising as it says that there is no penalty for not knowing the support region of the spreading function prior to identification. Algorithms that provably recover all operators with D<=1/2, and almost all operators with D<1 are presented.

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

↑