{"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/sequential-end-to-end-network-for-efficient","title":"Sequential End-to-end Network for Efficient Person Search","arxiv_id":"2103.10148","date":"2021-03-18","proceeding":null,"authors":["Zhengjia Li","Duoqian Miao"],"abstract":"Person search aims at jointly solving Person Detection and Person Re-identification (re-ID). Existing works have designed end-to-end networks based on Faster R-CNN. However, due to the parallel structure of Faster R-CNN, the extracted features come from the low-quality proposals generated by the Region Proposal Network, rather than the detected high-quality bounding boxes. Person search is a fine-grained task and such inferior features will significantly reduce re-ID performance. To address this issue, we propose a Sequential End-to-end Network (SeqNet) to extract superior features. In SeqNet, detection and re-ID are considered as a progressive process and tackled with two sub-networks sequentially. In addition, we design a robust Context Bipartite Graph Matching (CBGM) algorithm to effectively employ context information as an important complementary cue for person matching. Extensive experiments on two widely used person search benchmarks, CUHK-SYSU and PRW, have shown that our method achieves state-of-the-art results. Also, our model runs at 11.5 fps on a single GPU and can be integrated into the existing end-to-end framework easily.","url_abs":"https://arxiv.org/abs/2103.10148v1","url_pdf":"https://arxiv.org/pdf/2103.10148v1.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":"sequential-end-to-end-network-for-efficient","repo_url":"https://github.com/serend1p1ty/SeqNet","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"graph-matching","task_name":"Graph Matching"},{"task_slug":"human-detection","task_name":"Human Detection"},{"task_slug":"person-re-identification","task_name":"Person Re-Identification"},{"task_slug":"person-search","task_name":"Person Search"},{"task_slug":"region-proposal","task_name":"Region Proposal"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"faster-r-cnn","method_name":"Faster R-CNN"},{"method_slug":"rpn","method_name":"RPN"},{"method_slug":"roipool","method_name":"RoIPool"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/person-search-on-cuhk-sysu","task":"Person Search","dataset":"CUHK-SYSU","model":"NAE+SeqNet+CBGM","rank_in_archive_order":8,"of":16,"metrics":{"MAP":"94.8","Top-1":"95.7"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-cuhk-sysu","task":"Person Search","dataset":"CUHK-SYSU","model":"OIM+SeqNet+CBGM","rank_in_archive_order":10,"of":16,"metrics":{"MAP":"94.3","Top-1":"95.0"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-cuhk-sysu","task":"Person Search","dataset":"CUHK-SYSU","model":"NAE+SeqNet","rank_in_archive_order":12,"of":16,"metrics":{"MAP":"93.8","Top-1":"94.6"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-cuhk-sysu","task":"Person Search","dataset":"CUHK-SYSU","model":"OIM+SeqNet","rank_in_archive_order":13,"of":16,"metrics":{"MAP":"93.4","Top-1":"94.1"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-prw","task":"Person Search","dataset":"PRW","model":"NAE+SeqNet+CBGM","rank_in_archive_order":8,"of":15,"metrics":{"Top-1":"87.6","mAP":"47.6"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-prw","task":"Person Search","dataset":"PRW","model":"NAE+SeqNet","rank_in_archive_order":11,"of":15,"metrics":{"Top-1":"83.4","mAP":"46.7"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-prw","task":"Person Search","dataset":"PRW","model":"OIM+SeqNet+CBGM","rank_in_archive_order":12,"of":15,"metrics":{"Top-1":"84.9","mAP":"46.6"},"uses_additional_data":false},{"leaderboard":"/sota/person-search-on-prw","task":"Person Search","dataset":"PRW","model":"OIM+SeqNet","rank_in_archive_order":15,"of":15,"metrics":{"Top-1":"81.7","mAP":"45.8"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2103.10148","atlas_url":"https://app.syntology.ai/?focus=2103.10148","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":"2103.10148"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2103.10148\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2103.10148"},"call":"get_concepts_for_paper(arxiv_id=\"2103.10148\")"}],"by_repo":[{"repo":"serend1p1ty/SeqNet","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":"f907c966f2ad158dd2cbc45e31280a2e23d870c0b6980cfe6a2e779047acddc1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}