{"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/followme-efficient-online-min-cost-flow","title":"FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation","arxiv_id":"1407.6251","date":"2014-07-23","proceeding":"ICCV 2015 12","authors":["Philip Lenz","Andreas Geiger","Raquel Urtasun"],"abstract":"One of the most popular approaches to multi-target tracking is\ntracking-by-detection. Current min-cost flow algorithms which solve the data\nassociation problem optimally have three main drawbacks: they are\ncomputationally expensive, they assume that the whole video is given as a\nbatch, and they scale badly in memory and computation with the length of the\nvideo sequence. In this paper, we address each of these issues, resulting in a\ncomputationally and memory-bounded solution. First, we introduce a dynamic\nversion of the successive shortest-path algorithm which solves the data\nassociation problem optimally while reusing computation, resulting in\nsignificantly faster inference than standard solvers. Second, we address the\noptimal solution to the data association problem when dealing with an incoming\nstream of data (i.e., online setting). Finally, we present our main\ncontribution which is an approximate online solution with bounded memory and\ncomputation which is capable of handling videos of arbitrarily length while\nperforming tracking in real time. We demonstrate the effectiveness of our\nalgorithms on the KITTI and PETS2009 benchmarks and show state-of-the-art\nperformance, while being significantly faster than existing solvers.","url_abs":"http://arxiv.org/abs/1407.6251v2","url_pdf":"http://arxiv.org/pdf/1407.6251v2.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":[],"tasks":[{"task_slug":"multiple-object-tracking","task_name":"Multiple Object Tracking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/multiple-object-tracking-on-kitti-test-online","task":"Multiple Object Tracking","dataset":"KITTI Test (Online Methods)","model":"mbodSSP","rank_in_archive_order":34,"of":34,"metrics":{"MOTA":"72.69"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1407.6251","atlas_url":"https://app.syntology.ai/?focus=1407.6251","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":"1407.6251"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1407.6251\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1407.6251"},"call":"get_concepts_for_paper(arxiv_id=\"1407.6251\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fe6e6c81b53cdfeaa1a8402e10eb78711fd37e0a86644f277d2d0bcae646a17f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}