A new relaxation algorithm and passive sensor data association
From MaRDI portal
Publication:3989595
Recommendations
Cited in
(19)- scientific article; zbMATH DE number 714541 (Why is no real title available?)
- The focus of attention problem
- The focus of attention problem
- Branch and bound algorithms for the multidimensional assignment problem
- The graph association problem: mathematical models and a Lagrangian heuristic
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements
- An LP-based algorithm for the data association problem in multitarget tracking.
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
- Localization of multiple emitters based on the sequential PHD filter
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- A dual approach to multi-dimensional assignment problems
- A bi-criteria approach for the data association problem
- scientific article; zbMATH DE number 679871 (Why is no real title available?)
- New optimal algorithm of data association for multi-passive-sensor location system
- Information value in nonparametric Dirichlet-process Gaussian-process (DPGP) mixture models
- A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
- Study on the Hungarian algorithm for the maximum likelihood data association problem
- Data association based on optimization in graphical models with application to sensor networks
- Data-driven combinatorial optimization for sensor-based assessment of near falls
This page was built for publication: A new relaxation algorithm and passive sensor data association
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989595)
