首页> 外文期刊>IEEE Transactions on Signal Processing >Approximate Message Passing With Unitary Transformation for Robust Bilinear Recovery
【24h】

Approximate Message Passing With Unitary Transformation for Robust Bilinear Recovery

机译:通过稳健双线性恢复的酉变换传递的近似消息

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Recently, several promising approximate message passing (AMP) based algorithms have been developed for bilinear recovery with model $oldsymbol{Y}=sum _{oldsymbol{k}=1}^{oldsymbol{K}} oldsymbol{b}_{oldsymbol{k}} oldsymbol{A}_{oldsymbol{k}} oldsymbol{C}+oldsymbol{W}$ , where $lbrace oldsymbol{b}_{oldsymbol{k}}brace$ and $oldsymbol{C}$ are jointly recovered with known $oldsymbol{A}_k$ from the noisy measurements $oldsymbol{Y}$ . The bilinear recovery problem has many applications such as dictionary learning, self-calibration, compressive sensing with matrix uncertainty, etc. In this work, we propose a new approximate Bayesian inference algorithm for bilinear recovery, where AMP with unitary transformation (UTAMP) is integrated with belief propagation (BP), variational inference (VI) and expectation propagation (EP) to achieve efficient approximate inference. It is shown that, compared to state-of-the-art bilinear recovery algorithms, the proposed algorithm is much more robust and faster, leading to remarkably better performance.
机译:最近,已经开发了几个基于近似消息的传递(AMP)算法,用于使用Model <内联公式XMLNS:MML =“http://www.w3.org/1998/math/mathml”xmlns:xlink =“ http://www.w3.org/1999/xlink">< tex-math符号=“LaTex”> $ boldsymbol {y} = sum _ { boldsymbol {k} = 1} ^ { boldsymbol {k }} boldsymbol {b} _ { boldsymbol {k}} boldsymbol {a} _ { boldsymbol {k}} boldsymbol {c} + boldsymbol {w} $ ,其中<内联公式XMLNS:MML =“http://www.w3.org/1998/math/mathml”xmlns:xlink =“http://www.w3.org/1999/xlink”> < tex-math notation =“laTex”> $ lbrace boldsymbol {b} _ { boldsymbol {k}} rbrace $ $ boldsymbol { C} $ 与已知<内联公式XMLNS共同恢复:MML =“http://www.w3.org/1998/math/mathml”xmlns:xlink =“ http://www.w3.org/1999/xlink">< tex-math.符号=“LaTex”> $ Boldsymbol {A} _K $ 从嘈杂的测量<内联公式XMLNS:MML =“http://www.w3.org/1998 / math / mathml“xmlns:xlink =”http://www.w3.org/1999/xlink“> $ boldsymbol {y} $ 。 Bilinear恢复问题有许多应用程序,如字典学习,自校准,用矩阵不确定性的压缩感应等。在这项工作中,我们提出了一种新的近似贝叶斯推理算法,用于双线性恢复,其中AMP集成了单一变换(UTAMM)的放大器具有信念传播(BP),变分推理(VI)和期望传播(EP)以实现有效的近似推理。结果表明,与最先进的双线性恢复算法相比,所提出的算法更加坚固,更快,导致性能更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号