{"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/a-deep-local-and-global-scene-graph-matching","title":"A Deep Local and Global Scene-Graph Matching for Image-Text Retrieval","arxiv_id":"2106.02400","date":"2021-06-04","proceeding":null,"authors":["Manh-Duy Nguyen","Binh T. Nguyen","Cathal Gurrin"],"abstract":"Conventional approaches to image-text retrieval mainly focus on indexing visual objects appearing in pictures but ignore the interactions between these objects. Such objects occurrences and interactions are equivalently useful and important in this field as they are usually mentioned in the text. Scene graph presentation is a suitable method for the image-text matching challenge and obtained good results due to its ability to capture the inter-relationship information. Both images and text are represented in scene graph levels and formulate the retrieval challenge as a scene graph matching challenge. In this paper, we introduce the Local and Global Scene Graph Matching (LGSGM) model that enhances the state-of-the-art method by integrating an extra graph convolution network to capture the general information of a graph. Specifically, for a pair of scene graphs of an image and its caption, two separate models are used to learn the features of each graph's nodes and edges. Then a Siamese-structure graph convolution model is employed to embed graphs into vector forms. We finally combine the graph-level and the vector-level to calculate the similarity of this image-text pair. The empirical experiments show that our enhancement with the combination of levels can improve the performance of the baseline method by increasing the recall by more than 10% on the Flickr30k dataset.","url_abs":"https://arxiv.org/abs/2106.02400v1","url_pdf":"https://arxiv.org/pdf/2106.02400v1.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":"a-deep-local-and-global-scene-graph-matching","repo_url":"https://github.com/m2man/LGSGM","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-matching","task_name":"Graph Matching"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"image-text-retrieval","task_name":"Image-text Retrieval"},{"task_slug":"image-text-matching","task_name":"Image-text matching"},{"task_slug":"image-to-text-retrieval","task_name":"Image-to-Text Retrieval"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"text-matching","task_name":"Text Matching"},{"task_slug":"text-retrieval","task_name":"Text Retrieval"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-retrieval-on-flickr30k-1k-test","task":"Image Retrieval","dataset":"Flickr30K 1K test","model":"LGSGM","rank_in_archive_order":4,"of":18,"metrics":{"R@1":"57.4","R@10":"90.2","R@5":"84.1"},"uses_additional_data":false},{"leaderboard":"/sota/image-retrieval-on-flickr30k","task":"Image Retrieval","dataset":"Flickr30k","model":"LGSGM","rank_in_archive_order":7,"of":9,"metrics":{"Recall@1":"57.4","Recall@10":"90.2","Recall@5":"84.1","Recall@Sum":"231.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-retrieval-on-flickr30k","task":"Image Retrieval","dataset":"Flickr30k","model":"GSMN","rank_in_archive_order":8,"of":9,"metrics":{"Recall@10":"89","Recall@5":"82.3","Recall@Sum":"228.7"},"uses_additional_data":false},{"leaderboard":"/sota/image-to-text-retrieval-on-flickr30k","task":"Image-to-Text Retrieval","dataset":"Flickr30k","model":"GSMN","rank_in_archive_order":10,"of":11,"metrics":{"Recall@1":"76.4","Recall@10":"97.3","Recall@5":"94.3","Recall@Sum":"268"},"uses_additional_data":false},{"leaderboard":"/sota/image-to-text-retrieval-on-flickr30k","task":"Image-to-Text Retrieval","dataset":"Flickr30k","model":"LGSGM","rank_in_archive_order":11,"of":11,"metrics":{"Recall@1":"71","Recall@10":"96.1","Recall@5":"91.9","Recall@Sum":"259"},"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":"m2man/LGSGM","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1910.05134"],"harvested_for_calls":[{"arxiv_id":"1910.05134","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.05134"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.05134\")"}]}],"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":"4a07899d43c4ea41ec2a51dd2be8a2e6122d3ee2ff9bf9345e151239648b3c4e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}