Blind sensor calibration using approximate message passing

DOI10.1088/1742-5468/2015/11/P11013MaRDI QIDQ3302149zbMATH OpenOpenAlexFDO

Authors Christophe Schülke, Francesco Caltagirone, Lenka Zdeborová

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.5903

Mathematics Subject Classification ID

Bayesian inference (62F15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Abstract: The ubiquity of approximately sparse data has led a variety of com- munities to great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying them on real data can be problematic if imperfect sensing devices introduce deviations from this ideal signal ac- quisition 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 measures. Cal-AMP shares the scalability of approximate message passing, allowing to treat big sized instances of these problems, and ex- perimentally exhibits a phase transition between domains of success and failure.

Recommendations

• Self-calibration and biconvex compressive sensing
• Blind Calibration of Networks of Sensors: Theory and Algorithms
• Through the haze: a non-convex approach to blind gain calibration for linear random sensing models
• Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
• Signal recovery and system calibration from multiple compressive Poisson measurements

Cites work

• A Factor Graph Approach to Joint OFDM Channel Estimation and Decoding in Impulsive Noise Environments
• Adaptive Blind Background Calibration of Polynomial-Represented Frequency Response Mismatches in a Two-Channel Time-Interleaved ADC
• Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
• Bayesian signal reconstruction for 1-bit compressed sensing
• Convex Optimization Approaches for Blind Sensor Calibration Using Sparsity
• Information, Physics, and Computation
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Statistical Physics of Spin Glasses and Information Processing
• The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

Cited in

(6)

• Self-calibration and biconvex compressive sensing
• Through the haze: a non-convex approach to blind gain calibration for linear random sensing models
• Sensor calibration for off-the-grid spectral estimation
• Signal recovery and system calibration from multiple compressive Poisson measurements
• Blind Calibration of Networks of Sensors: Theory and Algorithms
• Self-calibration and bilinear inverse problems via linear least squares

Describes a project that uses

Uses Software

• CVX

This page was built for publication: Blind sensor calibration using approximate message passing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302149)