{"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/interpretable-and-generalizable-deep-image","title":"Interpretable and Generalizable Person Re-Identification with Query-Adaptive Convolution and Temporal Lifting","arxiv_id":"1904.10424","date":"2019-04-23","proceeding":"ECCV 2020 8","authors":["Shengcai Liao","Ling Shao"],"abstract":"For person re-identification, existing deep networks often focus on representation learning. However, without transfer learning, the learned model is fixed as is, which is not adaptable for handling various unseen scenarios. In this paper, beyond representation learning, we consider how to formulate person image matching directly in deep feature maps. We treat image matching as finding local correspondences in feature maps, and construct query-adaptive convolution kernels on the fly to achieve local matching. In this way, the matching process and results are interpretable, and this explicit matching is more generalizable than representation features to unseen scenarios, such as unknown misalignments, pose or viewpoint changes. To facilitate end-to-end training of this architecture, we further build a class memory module to cache feature maps of the most recent samples of each class, so as to compute image matching losses for metric learning. Through direct cross-dataset evaluation, the proposed Query-Adaptive Convolution (QAConv) method gains large improvements over popular learning methods (about 10%+ mAP), and achieves comparable results to many transfer learning methods. Besides, a model-free temporal cooccurrence based score weighting method called TLift is proposed, which improves the performance to a further extent, achieving state-of-the-art results in cross-dataset person re-identification. Code is available at https://github.com/ShengcaiLiao/QAConv.","url_abs":"https://arxiv.org/abs/1904.10424v4","url_pdf":"https://arxiv.org/pdf/1904.10424v4.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":"interpretable-and-generalizable-deep-image","repo_url":"https://github.com/shengcailiao/QAConv","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-generalization","task_name":"Domain Generalization"},{"task_slug":"generalizable-person-re-identification","task_name":"Generalizable Person Re-identification"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"person-re-identification","task_name":"Person Re-Identification"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/generalizable-person-re-identification-on-22","task":"Generalizable Person Re-identification","dataset":"CUHK03-NP (detected)","model":"QAConv","rank_in_archive_order":5,"of":5,"metrics":{"MSMT17-All->Rank-1":"25.3","MSMT17-All->mAP":"22.6","Market-1501->Rank-1":"9.9","Market-1501->mAP":"8.6"},"uses_additional_data":true},{"leaderboard":"/sota/generalizable-person-re-identification-on-23","task":"Generalizable Person Re-identification","dataset":"DukeMTMC-reID","model":"QAConv","rank_in_archive_order":3,"of":4,"metrics":{"MSMT17->Rank1":"69.4","MSMT17->mAP":"52.6"},"uses_additional_data":true},{"leaderboard":"/sota/generalizable-person-re-identification-on-20","task":"Generalizable Person Re-identification","dataset":"MSMT17","model":"QAConv","rank_in_archive_order":4,"of":4,"metrics":{"Market-1501->Rank1":"22.6","Market-1501->mAP":"7.0"},"uses_additional_data":true},{"leaderboard":"/sota/generalizable-person-re-identification-on-21","task":"Generalizable Person Re-identification","dataset":"Market-1501","model":"QAConv","rank_in_archive_order":5,"of":5,"metrics":{"MSMT17-All->Rank-1":"72.6","MSMT17-All->mAP":"43.1"},"uses_additional_data":true},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-cuhk03-to-1","task":"Unsupervised Domain Adaptation","dataset":"CUHK03 to Market","model":"QAConv","rank_in_archive_order":5,"of":9,"metrics":{"R1":"85.0","R10":"-","R5":"-","mAP":"66.5"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-domain-adaptation-on-market-to-6","task":"Unsupervised Domain Adaptation","dataset":"Market to CUHK03","model":"QAConv","rank_in_archive_order":5,"of":8,"metrics":{"R1":"33.3","R10":"-","R5":"-","mAP":"32.9"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.10424","atlas_url":"https://app.syntology.ai/?focus=1904.10424","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":"1904.10424"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.10424\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.10424"},"call":"get_concepts_for_paper(arxiv_id=\"1904.10424\")"}],"by_repo":[{"repo":"shengcailiao/QAConv","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.14432"],"harvested_for_calls":[{"arxiv_id":"2105.14432","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14432"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14432\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"1a7c400b950d9ec8f7053b30409e1675fa6a0e03fee16d8773b58c5271df6355","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}