Iterative mixture component pruning algorithm for Gaussian mixture PHD filter
From MaRDI portal
Publication:1718875
DOI10.1155/2014/653259zbMath1407.94046OpenAlexW2092998833WikidataQ59068661 ScholiaQ59068661MaRDI QIDQ1718875
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/653259
Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- Unnamed Item
- Tracking in a cluttered environment with probabilistic data association
- Convergence results for the Gaussian mixture implementation of the extended-target PHD filter and its extended Kalman filtering approximation
- On the Lambert \(w\) function
- Convergence of the SMC implementation of the PHD filter
- Joint probabilistic data association for multitarget tracking with possibly unresolved measurements and maneuvers
- Reduction of Gaussian mixture models by maximum similarity
- Tracking methods in a multitarget environment
- Convergence Analysis of the Gaussian Mixture PHD Filter
- Analytic Implementations of the Cardinalized Probability Hypothesis Density Filter
- The Bin-Occupancy Filter and Its Connection to the PHD Filters
- The Cardinality Balanced Multi-Target Multi-Bernoulli Filter and Its Implementations
- Closed-Form Solutions to Forward–Backward Smoothing
- A phd Filter for Tracking Multiple Extended Targets Using Random Matrices
- On Spawning and Combination of Extended/Group Targets Modeled With Random Matrices
- The Gaussian Mixture Probability Hypothesis Density Filter
- Widely linear reception strategies for layered space-time wireless communications
- Learning Scene Context for Multiple Object Tracking
This page was built for publication: Iterative mixture component pruning algorithm for Gaussian mixture PHD filter