Target association method based on bipartite graph optimal complete matching

DOI10.13245/J.HUST.170218MaRDI QIDQ5368212zbMATH OpenFDO

Authors Hanbao Wu, Lun Li, Zhiyun Zhang

Publication date 20 October 2017

Full work available at URL https://doi.org/10.13245/J.HUST.170218

zbMATH Keywords

bipartite graphdense targetsoptimal matchingsystematic errorstarget association

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Multi-target tracking data association algorithm based on greedy strategy
• A bi-criteria approach for the data association problem
• A new fast algorithm for multitarget tracking in dense clutter
• Data association in multi-target tracking using belief function
• The graph association problem: mathematical models and a Lagrangian heuristic

This page was built for publication: Target association method based on bipartite graph optimal complete matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368212)