{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/two-stage-discriminative-re-ranking-for-large","title":"Two-stage Discriminative Re-ranking for Large-scale Landmark Retrieval","arxiv_id":"2003.11211","date":"2020-03-25","proceeding":null,"authors":["Shuhei Yokoo","Kohei Ozaki","Edgar Simo-Serra","Satoshi Iizuka"],"abstract":"We propose an efficient pipeline for large-scale landmark image retrieval that addresses the diversity of the dataset through two-stage discriminative re-ranking. Our approach is based on embedding the images in a feature-space using a convolutional neural network trained with a cosine softmax loss. Due to the variance of the images, which include extreme viewpoint changes such as having to retrieve images of the exterior of a landmark from images of the interior, this is very challenging for approaches based exclusively on visual similarity. Our proposed re-ranking approach improves the results in two steps: in the sort-step, $k$-nearest neighbor search with soft-voting to sort the retrieved results based on their label similarity to the query images, and in the insert-step, we add additional samples from the dataset that were not retrieved by image-similarity. This approach allows overcoming the low visual diversity in retrieved images. In-depth experimental results show that the proposed approach significantly outperforms existing approaches on the challenging Google Landmarks Datasets. Using our methods, we achieved 1st place in the Google Landmark Retrieval 2019 challenge and 3rd place in the Google Landmark Recognition 2019 challenge on Kaggle. Our code is publicly available here: \\url{https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution}","url_abs":"https://arxiv.org/abs/2003.11211v1","url_pdf":"https://arxiv.org/pdf/2003.11211v1.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":"two-stage-discriminative-re-ranking-for-large","repo_url":"https://github.com/cvdfoundation/google-landmark","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"two-stage-discriminative-re-ranking-for-large","repo_url":"https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"landmark-recognition","task_name":"Landmark Recognition"},{"task_slug":"re-ranking","task_name":"Re-Ranking"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"methods":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2003.11211","atlas_url":"https://app.syntology.ai/?focus=2003.11211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11211"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cvdfoundation/google-landmark","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution","reach":null}],"summary":{"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":2,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"58024c2129ac7ee2","entry":"cache","repo":"lyakaap/Landmark2019-1st-and-3rd-Place-Solution","repo_kind":"official","path":"src/reranking.py","file_url":"https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution/blob/HEAD/src/reranking.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"58024c2129ac7ee2"}},{"code_sha256_prefix":"d8174ac57defd44c","entry":"get_offline_result","repo":"lyakaap/Landmark2019-1st-and-3rd-Place-Solution","repo_kind":"official","path":"src/reranking.py","file_url":"https://github.com/lyakaap/Landmark2019-1st-and-3rd-Place-Solution/blob/HEAD/src/reranking.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"d8174ac57defd44c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}