{"paper":{"title":"Scaling Data Association for Hypothesis-Oriented MHT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Joydeep Ghosh, Michael Motro","submitted_at":"2019-05-17T20:36:07Z","abstract_excerpt":"Multi-hypothesis tracking is a flexible and intuitive approach to tracking multiple nearby objects. However, the original formulation of its data association step is widely thought to scale poorly with the number of tracked objects. We propose enhancements including handling undetected objects and false measurements without inflating the size of the problem, early stopping during solution calculation, and providing for sparse or gated input. These changes collectively improve the computational time and space requirements of data association so that hundreds or thousands of hypotheses over hund"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07466","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}