Posterior Cramér–Rao lower bounds for extended target tracking with PMBM conjugate recursion

• Published in: Electronics letters 2024-09, Vol.60 (18), p.n/a
• Main Authors: Xie, Xingxiang, Zhao, Xiongwei, Song, Zhumei, Li, Kening
• Format: Article
• Language: English
• Subjects: signal processing; tracking; tracking filters
• ISSN: 0013-5194; 1350-911X
• DOI: 10.1049/ell2.70041

This letter considers the posterior Cramér–Rao lower bounds (PCRLB) problem for extended target tracking from a stack of measurement data that are modelled as random variables in the random finite sets framework. The scalars in the traditional PCRLB are converted into vectors based on random finite sets to derive a theoretical lower bound. In this way, the proposed method can be applied to the multi‐target tracking problem and accommodates scenarios with targets of varying. Moreover, solving the data association problem from four parts caused by the conjugate update of the Poisson multi‐Bernoulli mixture filter is considered. Simulation results are presented to verify the effectiveness of the derived PCRLB. A posterior Cramér–Rao lower bounds based on Poisson multi‐Bernoulli mixture conjugate recursion is derived in this letter, considering four cases for data association: PPP intensity update for undetected targets, multi‐Bernoulli mixture update for newly detected targets, missed detection update in multi‐Bernoulli mixture recursion, and update of previously potentially detected targets. This approach effectively handles targets' variations in complex extended target tracking problems, as verified by simulations.