A reduced-complexity scheme using message passing for location tracking

Yih Shyh Chiou, Fuan Tsai, Chin Liang Wang, Chin Tseng Huang

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


This article presents a low-complexity and high-accuracy algorithm using message-passing approach to reduce the computational load of the traditional tracking algorithm for location estimation. In the proposed tracking scheme, a state space model for the location-estimation problem can be divided into many mutual-interaction local constraints based on the inherent message-passing features of factor graphs. During each iteration cycle, the message with reliability information is passed efficiently with an adaptive weighted technique and the error propagation law, and then the message-passing approach based on prediction-correction recursion is to simplify the implementation of the Bayesian filtering approach for location-estimation and tracking systems. As compared with a traditional tracking scheme based on Kalman filtering (KF) algorithms derived from Bayesian dynamic model, the analytic result and the numerical simulations show that the proposed forward and one-step backward tracking approach not only can achieve an accurate location very close to the traditional KF tracking scheme, but also has a lower computational complexity.

Original languageEnglish
Article number121
JournalEurasip Journal on Advances in Signal Processing
Issue number1
StatePublished - 2012


  • Bayesian approach
  • Data reliability
  • Factor graphs
  • Location tracking
  • One-step backward
  • Wireless communication


Dive into the research topics of 'A reduced-complexity scheme using message passing for location tracking'. Together they form a unique fingerprint.

Cite this