{"url":"/sota/person-search-on-cuhk-sysu","task":{"name":"Person Search","url":"/task/person-search","note":null},"dataset":{"name":"CUHK-SYSU","url":"/dataset/cuhk-sysu"},"category":"Computer Vision","categories":["Computer Vision"],"category_note":null,"description":"**Person Search** is a task which aims at matching a specific person among a great number of whole scene images.\n\n\n<span class=\"description-source\">Source: [Re-ID Driven Localization Refinement for Person Search ](https://arxiv.org/abs/1909.08580)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["MAP","Top-1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"MAP":"higher","Top-1":"higher"}},"counts":{"rows":16,"rows_with_code":14,"rows_with_paper_page":16,"rows_dated":16,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SeqNeXt+GFN","metrics":{"MAP":"96.4","Top-1":"97.0"},"uses_additional_data":false,"paper_date":"2022-10-24","paper":"/paper/gallery-filter-network-for-person-search","paper_url":"https://arxiv.org/abs/2210.12903v2","paper_title":"Gallery Filter Network for Person Search","code":"https://github.com/lukejaffe/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"SPNet","metrics":{"MAP":"96.4","Top-1":"97.0"},"uses_additional_data":false,"paper_date":"2024-12-06","paper":"/paper/swap-path-network-for-robust-person-search","paper_url":"https://arxiv.org/abs/2412.05433v1","paper_title":"Swap Path Network for Robust Person Search Pre-training","code":"https://github.com/llnl/spnet","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"SeqNeXt","metrics":{"MAP":"96.1","Top-1":"96.5"},"uses_additional_data":false,"paper_date":"2022-10-24","paper":"/paper/gallery-filter-network-for-person-search","paper_url":"https://arxiv.org/abs/2210.12903v2","paper_title":"Gallery Filter Network for Person Search","code":"https://github.com/lukejaffe/gfn","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"GLCNet+CBGM","metrics":{"MAP":"95.8","Top-1":"96.2"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/global-local-context-network-for-person","paper_url":"https://arxiv.org/abs/2112.02500v4","paper_title":"MovieNet-PS: A Large-Scale Person Search Dataset in the Wild","code":"https://github.com/zhengpeng7/glcnet","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"GLCNet","metrics":{"MAP":"95.5","Top-1":"96.1"},"uses_additional_data":false,"paper_date":"2021-12-05","paper":"/paper/global-local-context-network-for-person","paper_url":"https://arxiv.org/abs/2112.02500v4","paper_title":"MovieNet-PS: A Large-Scale Person Search Dataset in the Wild","code":"https://github.com/zhengpeng7/glcnet","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"SOLIDER","metrics":{"MAP":"95.5","Top-1":"95.8"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/beyond-appearance-a-semantic-controllable","paper_url":"https://arxiv.org/abs/2303.17602v1","paper_title":"Beyond Appearance: a Semantic Controllable Self-Supervised Learning Framework for Human-Centric Visual Tasks","code":"https://github.com/modelscope/modelscope","n_code_links":4,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":1}},{"rank_in_archive_order":7,"model":"ROI-AlignPS","metrics":{"MAP":"95.4","Top-1":"96.0"},"uses_additional_data":false,"paper_date":"2021-09-01","paper":"/paper/efficient-person-search-an-anchor-free","paper_url":"https://arxiv.org/abs/2109.00211v1","paper_title":"Efficient Person Search: An Anchor-Free Approach","code":"https://github.com/daodaofr/AlignPS","n_code_links":4,"syntology":null},{"rank_in_archive_order":8,"model":"NAE+SeqNet+CBGM","metrics":{"MAP":"94.8","Top-1":"95.7"},"uses_additional_data":false,"paper_date":"2021-03-18","paper":"/paper/sequential-end-to-end-network-for-efficient","paper_url":"https://arxiv.org/abs/2103.10148v1","paper_title":"Sequential End-to-end Network for Efficient Person Search","code":"https://github.com/serend1p1ty/SeqNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"DMRNet++","metrics":{"MAP":"94.5","Top-1":"95.7"},"uses_additional_data":false,"paper_date":"2022-11-10","paper":"/paper/dmrnet-learning-discriminative-features-with","paper_url":"https://ieeexplore.ieee.org/document/9944858","paper_title":"DMRNet++: Learning Discriminative Features with Decoupled Networks and Enriched Pairs for One-Step Person Search","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":10,"model":"OIM+SeqNet+CBGM","metrics":{"MAP":"94.3","Top-1":"95.0"},"uses_additional_data":false,"paper_date":"2021-03-18","paper":"/paper/sequential-end-to-end-network-for-efficient","paper_url":"https://arxiv.org/abs/2103.10148v1","paper_title":"Sequential End-to-end Network for Efficient Person Search","code":"https://github.com/serend1p1ty/SeqNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"AlignPS+","metrics":{"MAP":"94","Top-1":"94.5"},"uses_additional_data":false,"paper_date":"2021-03-22","paper":"/paper/anchor-free-person-search","paper_url":"https://arxiv.org/abs/2103.11617v2","paper_title":"Anchor-Free Person Search","code":"https://github.com/daodaofr/AlignPS","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":12,"model":"NAE+SeqNet","metrics":{"MAP":"93.8","Top-1":"94.6"},"uses_additional_data":false,"paper_date":"2021-03-18","paper":"/paper/sequential-end-to-end-network-for-efficient","paper_url":"https://arxiv.org/abs/2103.10148v1","paper_title":"Sequential End-to-end Network for Efficient Person Search","code":"https://github.com/serend1p1ty/SeqNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"OIM+SeqNet","metrics":{"MAP":"93.4","Top-1":"94.1"},"uses_additional_data":false,"paper_date":"2021-03-18","paper":"/paper/sequential-end-to-end-network-for-efficient","paper_url":"https://arxiv.org/abs/2103.10148v1","paper_title":"Sequential End-to-end Network for Efficient Person Search","code":"https://github.com/serend1p1ty/SeqNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":14,"model":"DMRNet","metrics":{"MAP":"93.2","Top-1":"94.2"},"uses_additional_data":false,"paper_date":"2021-02-22","paper":"/paper/decoupled-and-memory-reinforced-networks","paper_url":"https://arxiv.org/abs/2102.10795v1","paper_title":"Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search","code":"https://github.com/ChuchuHan/DMRNet","n_code_links":1,"syntology":null},{"rank_in_archive_order":15,"model":"AlignPS","metrics":{"MAP":"92.6","Top-1":"93.4"},"uses_additional_data":false,"paper_date":"2021-03-22","paper":"/paper/anchor-free-person-search","paper_url":"https://arxiv.org/abs/2103.11617v2","paper_title":"Anchor-Free Person Search","code":"https://github.com/daodaofr/AlignPS","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":2,"n_samples":3,"n_pointer_only_licence":0}},{"rank_in_archive_order":16,"model":"PAPS","metrics":{"MAP":"92.1","Top-1":"94.0"},"uses_additional_data":false,"paper_date":"2023-06-12","paper":"/paper/real-time-distributed-video-analytics-for","paper_url":"https://www.sciencedirect.com/science/article/pii/S1077314223001297","paper_title":"Real-time distributed video analytics for privacy-aware person search","code":null,"n_code_links":0,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":3,"rows_with_any_sample_ran":3,"distinct_papers_with_graph_line":2,"distinct_papers_with_any_sample_ran":2,"samples_over_distinct_papers":{"n_ran":2,"n_unverified":3,"n_samples":5,"n_pointer_only_licence":1,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":3,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":1,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}