Blind sensor calibration using approximate message passing

被引:4
|
作者
Schuelke, Christophe [1 ,2 ]
Caltagirone, Francesco [3 ,4 ]
Zdeborova, Lenka [5 ,6 ]
机构
[1] Univ Paris 07, Sorbonne Paris Cite, F-75013 Paris, France
[2] Univ Roma La Sapienza, Dipartimento Fis, I-00185 Rome, Italy
[3] Ecole Normale Super, CNRS, Lab Phys Stat, UMR 8550, F-75231 Paris, France
[4] Univ Paris 06, F-75231 Paris, France
[5] CEA Saclay, Inst Phys Theor, F-91191 Gif Sur Yvette, France
[6] CNRS, URA 2306, F-91191 Gif Sur Yvette, France
关键词
message-passing algorithms; statistical inference;
D O I
10.1088/1742-5468/2015/11/P11013
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
The ubiquity of approximately sparse data has led a variety of communities to take great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying them to real data can be problematic if imperfect sensing devices introduce deviations from this ideal signal acquisition process, caused by sensor decalibration or failure. We propose a message passing algorithm called calibration approximate message passing (Cal-AMP) that can treat a variety of such sensor-induced imperfections. In addition to deriving the general form of the algorithm, we numerically investigate two particular settings. In the first, a fraction of the sensors is faulty, giving readings unrelated to the signal. In the second, sensors are decalibrated and each one introduces a different multiplicative gain to the measurements. Cal-AMP shares the scalability of approximate message passing, allowing us to treat large sized instances of these problems, and experimentally exhibits a phase transition between domains of success and failure.
引用
收藏
页数:29
相关论文
共 50 条
  • [31] Speech Enhancement Based on Approximate Message Passing
    Li, Chao
    Jiang, Ting
    Wu, Sheng
    CHINA COMMUNICATIONS, 2020, 17 (08) : 187 - 198
  • [32] Approximate Message Passing Algorithm for Nonconvex Regularization
    Zhang, Hai
    Ma, Yan
    Zhang, Hui
    Wang, Puyu
    Wang, Shcnghan
    Meng, Wenhui
    2017 IEEE 7TH ANNUAL INTERNATIONAL CONFERENCE ON CYBER TECHNOLOGY IN AUTOMATION, CONTROL, AND INTELLIGENT SYSTEMS (CYBER), 2017, : 1615 - 1620
  • [33] Nonparametric Maximum Likelihood Approximate Message Passing
    Feng, Long
    Ma, Ruijun
    Dicker, Lee H.
    2017 51ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2017,
  • [34] Conditional Approximate Message Passing with Side Information
    Baron, Dror
    Ma, Anna
    Needell, Deanna
    Rush, Cynthia
    Woolf, Tina
    2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2017, : 430 - 434
  • [35] Dynamics of Damped Approximate Message Passing Algorithms
    Mimura, Kazushi
    Takeuchi, Jun'ichi
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 564 - 568
  • [36] An Expectation Propagation Perspective on Approximate Message Passing
    Meng, Xiangming
    Wu, Sheng
    Kuang, Linling
    Lu, Jianhua
    IEEE SIGNAL PROCESSING LETTERS, 2015, 22 (08) : 1194 - 1197
  • [37] On the Convergence of Approximate Message Passing with Arbitrary Matrices
    Rangan, Sundeep
    Schniter, Philip
    Fletcher, Alyson
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 236 - 240
  • [38] Parametric Bilinear Generalized Approximate Message Passing
    Parker, Jason T.
    Schniter, Philip
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2016, 10 (04) : 795 - 808
  • [39] Cooperative diversity using message passing in wireless sensor networks
    Chu, JPK
    Adve, RS
    GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 1167 - 1171
  • [40] Speech Compressive Sampling Using Approximate Message Passing and a Markov Chain Prior
    Jia, Xiaoli
    Liu, Peilin
    Jiang, Sumxin
    SENSORS, 2020, 20 (16) : 1 - 13