{"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/deep-attentional-structured-representation","title":"Deep Attentional Structured Representation Learning for Visual Recognition","arxiv_id":"1805.05389","date":"2018-05-14","proceeding":null,"authors":["Krishna Kanth Nakka","Mathieu Salzmann"],"abstract":"Structured representations, such as Bags of Words, VLAD and Fisher Vectors,\nhave proven highly effective to tackle complex visual recognition tasks. As\nsuch, they have recently been incorporated into deep architectures. However,\nwhile effective, the resulting deep structured representation learning\nstrategies typically aggregate local features from the entire image, ignoring\nthe fact that, in complex recognition tasks, some regions provide much more\ndiscriminative information than others.\n  In this paper, we introduce an attentional structured representation learning\nframework that incorporates an image-specific attention mechanism within the\naggregation process. Our framework learns to predict jointly the image class\nlabel and an attention map in an end-to-end fashion and without any other\nsupervision than the target label. As evidenced by our experiments, this\nconsistently outperforms attention-less structured representation learning and\nyields state-of-the-art results on standard scene recognition and fine-grained\ncategorization benchmarks.","url_abs":"http://arxiv.org/abs/1805.05389v1","url_pdf":"http://arxiv.org/pdf/1805.05389v1.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":"deep-attentional-structured-representation","repo_url":"https://github.com/ahmedest61/vlad-buff","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"scene-recognition","task_name":"Scene Recognition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"ahmedest61/vlad-buff","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2409.19293"],"harvested_for_calls":[{"arxiv_id":"2409.19293","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2409.19293"},"call":"get_harvested_code_for_paper(arxiv_id=\"2409.19293\")"}]}],"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":"8b61c309dd80a99f31195f93eb302dbf81f75d925586ae440a28601bd84f89a8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}