{"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/re-ranking-person-re-identification-with-k","title":"Re-ranking Person Re-identification with k-reciprocal Encoding","arxiv_id":"1701.08398","date":"2017-01-29","proceeding":"CVPR 2017 7","authors":["Zhun Zhong","Liang Zheng","Donglin Cao","Shaozi Li"],"abstract":"When considering person re-identification (re-ID) as a retrieval process,\nre-ranking is a critical step to improve its accuracy. Yet in the re-ID\ncommunity, limited effort has been devoted to re-ranking, especially those\nfully automatic, unsupervised solutions. In this paper, we propose a\nk-reciprocal encoding method to re-rank the re-ID results. Our hypothesis is\nthat if a gallery image is similar to the probe in the k-reciprocal nearest\nneighbors, it is more likely to be a true match. Specifically, given an image,\na k-reciprocal feature is calculated by encoding its k-reciprocal nearest\nneighbors into a single vector, which is used for re-ranking under the Jaccard\ndistance. The final distance is computed as the combination of the original\ndistance and the Jaccard distance. Our re-ranking method does not require any\nhuman interaction or any labeled data, so it is applicable to large-scale\ndatasets. Experiments on the large-scale Market-1501, CUHK03, MARS, and PRW\ndatasets confirm the effectiveness of our method.","url_abs":"http://arxiv.org/abs/1701.08398v4","url_pdf":"http://arxiv.org/pdf/1701.08398v4.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":"person-re-identification","task_name":"Person Re-Identification"},{"task_slug":"re-ranking","task_name":"Re-Ranking"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/person-re-identification-on-cuhk03","task":"Person Re-Identification","dataset":"CUHK03","model":"k-reciprocal 46","rank_in_archive_order":12,"of":19,"metrics":{"MAP":"67.6","Rank-1":"61.6"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-detected","task":"Person Re-Identification","dataset":"CUHK03 detected","model":"IDE-R+XQDA","rank_in_archive_order":15,"of":19,"metrics":{"MAP":"28.2","Rank-1":"31.1"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-detected","task":"Person Re-Identification","dataset":"CUHK03 detected","model":"IDE-R","rank_in_archive_order":17,"of":19,"metrics":{"MAP":"19.7","Rank-1":"21.3"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-detected","task":"Person Re-Identification","dataset":"CUHK03 detected","model":"IDE-C+XQDA","rank_in_archive_order":18,"of":19,"metrics":{"MAP":"19.0","Rank-1":"21.1"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-detected","task":"Person Re-Identification","dataset":"CUHK03 detected","model":"IDE-C","rank_in_archive_order":19,"of":19,"metrics":{"MAP":"14.2","Rank-1":"15.1"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-labeled","task":"Person Re-Identification","dataset":"CUHK03 labeled","model":"IDE-R+XQDA","rank_in_archive_order":18,"of":21,"metrics":{"MAP":"29.6","Rank-1":"32.0"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-labeled","task":"Person Re-Identification","dataset":"CUHK03 labeled","model":"IDE-R","rank_in_archive_order":19,"of":21,"metrics":{"MAP":"21.0","Rank-1":"22.2"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-labeled","task":"Person Re-Identification","dataset":"CUHK03 labeled","model":"IDE-C+XQDA","rank_in_archive_order":20,"of":21,"metrics":{"MAP":"20.0","Rank-1":"21.9"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-cuhk03-labeled","task":"Person Re-Identification","dataset":"CUHK03 labeled","model":"IDE-C","rank_in_archive_order":21,"of":21,"metrics":{"MAP":"14.9","Rank-1":"15.6"},"uses_additional_data":false},{"leaderboard":"/sota/person-re-identification-on-market-1501","task":"Person Re-Identification","dataset":"Market-1501","model":"Re-rank","rank_in_archive_order":115,"of":135,"metrics":{"Rank-1":"77.11","mAP":"63.63"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.08398","atlas_url":"https://app.syntology.ai/?focus=1701.08398","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":"1701.08398"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1701.08398\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1701.08398"},"call":"get_concepts_for_paper(arxiv_id=\"1701.08398\")"}],"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":"e56d6cf0b934d9df3334fd60a8f8a9fe5f104a8830ae0385e3320e441f94a4de","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}