{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/lifted-disjoint-paths-with-application-in-1","title":"Lifted Disjoint Paths with Application in Multiple Object Tracking","arxiv_id":"2006.14550","date":"2020-06-25","proceeding":"ICML 2020 1","authors":["Andrea Hornakova","Roberto Henschel","Bodo Rosenhahn","Paul Swoboda"],"abstract":"We present an extension to the disjoint paths problem in which additional \\emph{lifted} edges are introduced to provide path connectivity priors. We call the resulting optimization problem the lifted disjoint paths problem. We show that this problem is NP-hard by reduction from integer multicommodity flow and 3-SAT. To enable practical global optimization, we propose several classes of linear inequalities that produce a high-quality LP-relaxation. Additionally, we propose efficient cutting plane algorithms for separating the proposed linear inequalities. The lifted disjoint path problem is a natural model for multiple object tracking and allows an elegant mathematical formulation for long range temporal interactions. Lifted edges help to prevent id switches and to re-identify persons. Our lifted disjoint paths tracker achieves nearly optimal assignments with respect to input detections. As a consequence, it leads on all three main benchmarks of the MOT challenge, improving significantly over state-of-the-art.","url_abs":"https://arxiv.org/abs/2006.14550v1","url_pdf":"https://arxiv.org/pdf/2006.14550v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"lifted-disjoint-paths-with-application-in-1","repo_url":"https://github.com/AndreaHor/LifT_Solver","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multiple-object-tracking","task_name":"Multiple Object Tracking"},{"task_slug":"object","task_name":"Object"},{"task_slug":"object-tracking","task_name":"Object Tracking"},{"task_slug":"global-optimization","task_name":"global-optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/multi-object-tracking-on-2d-mot-2015","task":"Multi-Object Tracking","dataset":"2D MOT 2015","model":"Lif_T","rank_in_archive_order":2,"of":4,"metrics":{"IDF1":"60.0","MOTA":"52.5"},"uses_additional_data":false},{"leaderboard":"/sota/multi-object-tracking-on-mot16","task":"Multi-Object Tracking","dataset":"MOT16","model":"Lif_T","rank_in_archive_order":16,"of":24,"metrics":{"IDF1":"64.7","MOTA":"61.3"},"uses_additional_data":false},{"leaderboard":"/sota/multi-object-tracking-on-mot17","task":"Multi-Object Tracking","dataset":"MOT17","model":"Lif_T","rank_in_archive_order":41,"of":48,"metrics":{"IDF1":"65.6","MOTA":"60.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.14550","atlas_url":"https://app.syntology.ai/?focus=2006.14550","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2006.14550"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.14550\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.14550"},"call":"get_concepts_for_paper(arxiv_id=\"2006.14550\")"}],"by_repo":[{"repo":"AndreaHor/LifT_Solver","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f18e704a03d36da3dd4b3d8787e4e6a3dc8c332edfac7fc4fcc4e681e6c60275","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}