{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","arxiv_id":"2103.07889","date":"2021-03-14","proceeding":"CVPR 2021 1","authors":["Peng Dai","Renliang Weng","Wongun Choi","ChangShui Zhang","Zhangping He","Wei Ding"],"abstract":"The recent trend in multiple object tracking (MOT) is heading towards leveraging deep learning to boost the tracking performance. However, it is not trivial to solve the data-association problem in an end-to-end fashion. In this paper, we propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph. This framework is similar to the two-stage object detector Faster RCNN, and can solve the MOT problem in a data-driven way. For proposal generation, we propose an iterative graph clustering method to reduce the computational cost while maintaining the quality of the generated proposals. For proposal scoring, we deploy a trainable graph-convolutional-network (GCN) to learn the structural patterns of the generated proposals and rank them according to the estimated quality scores. For trajectory inference, a simple deoverlapping strategy is adopted to generate tracking output while complying with the constraints that no detection can be assigned to more than one track. We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks. Our code is available at https://github.com/daip13/LPC_MOT.git.","url_abs":"https://arxiv.org/abs/2103.07889v3","url_pdf":"https://arxiv.org/pdf/2103.07889v3.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":"learning-a-proposal-classifier-for-multiple","repo_url":"https://github.com/daip13/LPC_MOT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"},{"task_slug":"multiple-object-tracking","task_name":"Multiple Object Tracking"},{"task_slug":"object","task_name":"Object"},{"task_slug":"object-tracking","task_name":"Object Tracking"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2103.07889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07889"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/daip13/LPC_MOT","reach":null}],"summary":{"ran":4,"unverified":1},"by_repo_kind":{"official":{"samples":5,"ran":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"96b7d80b1def4faf","entry":"BasicBlock","repo":"daip13/LPC_MOT","repo_kind":"official","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"96b7d80b1def4faf"}},{"code_sha256_prefix":"748441f5b0d1ba43","entry":"GCN","repo":"daip13/LPC_MOT","repo_kind":"official","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"748441f5b0d1ba43"}},{"code_sha256_prefix":"7e35382b5c5a5ae5","entry":"GNN","repo":"daip13/LPC_MOT","repo_kind":"official","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7e35382b5c5a5ae5"}},{"code_sha256_prefix":"d9c4fcd2b20442d2","entry":"GraphConv","repo":"daip13/LPC_MOT","repo_kind":"official","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d9c4fcd2b20442d2"}},{"code_sha256_prefix":"f2496d122dcd0113","entry":"normalize","repo":"daip13/LPC_MOT","repo_kind":"official","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f2496d122dcd0113"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}