Bayesian Multi-Object Filtering for Pairwise Markov Chains

• Published in: IEEE transactions on signal processing Vol. 61; no. 18; pp. 4481 - 4490
• Main Authors: Petetin, Yohan, Desbouvries, Francois
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.09.2013; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Applied sciences; Approximation; Bayesian analysis; Density; Detection, estimation, filtering, equalization, prediction; Engineering Sciences; Exact sciences and technology; Filtering; Filtration; hidden Markov chains; Information, signal and communications theory; Markov analysis; Markov chains; Mathematical analysis; Mathematical models; multi-object filtering; pairwise Markov chains; probability hypothesis density; Random finite sets; Signal and communications theory; Signal and Image processing; Signal, noise; Telecommunications and information theory; Filtering; Probabilistic approach; pairwise Markov chains; Markov model; Physical properties; Addressing; Implementation; Random finite sets; probability hypothesis density; Markov chain; Probability density; Finite sets; Pairwise Markov model; hidden Markov chains; Hidden Markov models; Signal processing; Random set; multi-object filtering; Pairwise Markov chains; Multi-object filtering; Hidden Markov chains; Probability hypothesis density
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2013.2271751

Random finite sets (RFS) are recent tools for addressing the multi-object filtering problem. The probability hypothesis density (PHD) Filter is an approximation of the multi-object Bayesian filter, which results from the RFS formulation of the problem and has been used in many applications. In the RFS framework, it is assumed that each target and associated observation follow a hidden Markov chain (HMC) model. HMCs conveniently describe some physical properties of practical interest for practitioners, but they also implicitly imply restrictive independence properties which, in practice, may not be satisfied by data. In this paper, we show that these structural limitations of HMC models can somehow be relaxed by embedding them into the more general class of pairwise Markov chain (PMC) models. We thus focus on the computation of the PHD filter in a PMC framework, and we propose a practical implementation of the PHD filter for a particular class of PMC models.