期刊文献+

Stable recovery of signals from frame coefficients with erasures at unknown locations 被引量:1

Stable recovery of signals from frame coefficients with erasures at unknown locations
原文传递
导出
摘要 In an earlier work, we proposed a frame-based kernel analysis approach to the problem of recovering erasures from unknown locations. The new approach led to the stability question on recovering a signal from noisy partial frame coefficients with erasures occurring at unknown locations. In this continuing work, we settle this problem by obtaining a complete characterization of frames that provide stable reconstructions. We show that an encoding frame provides a stable signal recovery from noisy partial frame coefficients at unknown locations if and only if it is totally robust with respect to erasures. We present several characterizations for either totally robust frames or almost robust frames. Based on these characterizations several explicit construction algorithms for totally robust and almost robust frames are proposed. As a consequence of the construction methods, we obtain that the probability for a randomly generated frame to be totally robust with respect to a fixed number of erasures is one. In an earlier work, we proposed a frame-based kernel analysis approach to the problem of recovering erasures from unknown locations. The new approach led to the stability question on recovering a signal from noisy partial frame coefficients with erasures occurring at unknown locations. In this continuing work, we settle this problem by obtaining a complete characterization of frames that provide stable reconstructions. We show that an encoding frame provides a stable signal recovery from noisy partial frame coefficients at unknown locations if and only if it is totally robust with respect to erasures. We present several characterizations for either totally robust frames or almost robust frames. Based on these characterizations several explicit construction algorithms for totally robust and almost robust frames are proposed. As a consequence of the construction methods, we obtain that the probability for a randomly generated frame to be totally robust with respect to a fixed number of erasures is one.
出处 《Science China Mathematics》 SCIE CSCD 2018年第1期151-172,共22页 中国科学:数学(英文版)
基金 supported by National Science Foundation of USA(Grant Nos.DMS-1403400 and DMS-1712602) National Natural Science Foundation of China(Grant Nos.11171151,11371200,11525104 and 11531013)
关键词 FRAMES ERASURES signal recovery almost robust frames totally robust frames frames erasures signal recovery almost robust frames totally robust frames
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部