{"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/learning-to-disentangle-scenes-for-person-re","title":"Learning to Disentangle Scenes for Person Re-identification","arxiv_id":"2111.05476","date":"2021-11-10","proceeding":null,"authors":["Xianghao Zang","Ge Li","Wei Gao","Xiujun Shu"],"abstract":"There are many challenging problems in the person re-identification (ReID) task, such as the occlusion and scale variation. Existing works usually tried to solve them by employing a one-branch network. This one-branch network needs to be robust to various challenging problems, which makes this network overburdened. This paper proposes to divide-and-conquer the ReID task. For this purpose, we employ several self-supervision operations to simulate different challenging problems and handle each challenging problem using different networks. Concretely, we use the random erasing operation and propose a novel random scaling operation to generate new images with controllable characteristics. A general multi-branch network, including one master branch and two servant branches, is introduced to handle different scenes. These branches learn collaboratively and achieve different perceptive abilities. In this way, the complex scenes in the ReID task are effectively disentangled, and the burden of each branch is relieved. The results from extensive experiments demonstrate that the proposed method achieves state-of-the-art performances on three ReID benchmarks and two occluded ReID benchmarks. Ablation study also shows that the proposed scheme and operations significantly improve the performance in various scenes. The code is available at https://git.openi.org.cn/zangxh/LDS.git.","url_abs":"https://arxiv.org/abs/2111.05476v2","url_pdf":"https://arxiv.org/pdf/2111.05476v2.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-to-disentangle-scenes-for-person-re","repo_url":"https://github.com/deropty/LDS","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"person-re-identification","task_name":"Person Re-Identification"}],"methods":[{"method_slug":"random-erasing","method_name":"Random Erasing"},{"method_slug":"random-scaling","method_name":"Random Scaling"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/person-re-identification-on-dukemtmc-reid","task":"Person Re-Identification","dataset":"DukeMTMC-reID","model":"LDS (ResNet50 + RK)","rank_in_archive_order":8,"of":94,"metrics":{"Rank-1":"92.91","mAP":"91.0"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-msmt17","task":"Person Re-Identification","dataset":"MSMT17","model":"LDS (ResNet50+RK)","rank_in_archive_order":5,"of":43,"metrics":{"Rank-1":"88.35","mAP":"79.09"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-market-1501","task":"Person Re-Identification","dataset":"Market-1501","model":"LDS (ResNet50 + RK)","rank_in_archive_order":25,"of":135,"metrics":{"Rank-1":"96.17","mAP":"94.89"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-occluded-dukemtmc","task":"Person Re-Identification","dataset":"Occluded-DukeMTMC","model":"LDS","rank_in_archive_order":19,"of":32,"metrics":{" Rank-1":"64.3","mAP":"55.7"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-p-dukemtmc-reid","task":"Person Re-Identification","dataset":"P-DukeMTMC-reID","model":"LDS","rank_in_archive_order":2,"of":2,"metrics":{" Rank-1":"91.96","Rank-10":"96.39","Rank-5":"95.28","mAP":"82.93"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"deropty/LDS","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":"9f84bd4b85de5a50fa54d44e4d1c8cec0879050ce8bfbef8266478261615d1c0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}