Fault identification via nonparametric belief propagation

Danny Bickson*, Dror Baron, Alexander Ihler, Harel Avissar, Danny Dolev

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

We consider the problem of identifying a pattern of faults from a set of noisy linear measurements. Unfortunately, maximum a posteriori (MAP) probability estimation of the fault pattern is computationally intractable. To solve the fault identification problem, we propose a nonparametric belief propagation (NBP) approach. We show empirically that our belief propagation solver is more accurate than recent state-of-the-art algorithms including interior point methods and semidefinite programming. Our superior performance is explained by the fact that we take into account both the binary nature of the individual faults and the sparsity of the fault pattern arising from their rarity.

Original languageEnglish
Article number5714757
Pages (from-to)2602-2613
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume59
Issue number6
DOIs
StatePublished - Jun 2011

Keywords

  • Compressed sensing (CS)
  • fault identification
  • message passing
  • nonparametric belief propagation (NBP)
  • stochastic approximation

Fingerprint

Dive into the research topics of 'Fault identification via nonparametric belief propagation'. Together they form a unique fingerprint.

Cite this