{"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/interlaced-sparse-self-attention-for-semantic","title":"Interlaced Sparse Self-Attention for Semantic Segmentation","arxiv_id":"1907.12273","date":"2019-07-29","proceeding":null,"authors":["Lang Huang","Yuhui Yuan","Jianyuan Guo","Chao Zhang","Xilin Chen","Jingdong Wang"],"abstract":"In this paper, we present a so-called interlaced sparse self-attention approach to improve the efficiency of the \\emph{self-attention} mechanism for semantic segmentation. The main idea is that we factorize the dense affinity matrix as the product of two sparse affinity matrices. There are two successive attention modules each estimating a sparse affinity matrix. The first attention module is used to estimate the affinities within a subset of positions that have long spatial interval distances and the second attention module is used to estimate the affinities within a subset of positions that have short spatial interval distances. These two attention modules are designed so that each position is able to receive the information from all the other positions. In contrast to the original self-attention module, our approach decreases the computation and memory complexity substantially especially when processing high-resolution feature maps. We empirically verify the effectiveness of our approach on six challenging semantic segmentation benchmarks.","url_abs":"https://arxiv.org/abs/1907.12273v2","url_pdf":"https://arxiv.org/pdf/1907.12273v2.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":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/openseg-group/openseg.pytorch","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/PkuRainBow/OCNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/PkuRainBow/OCNet.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/openseg-group/OCNet.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/vishwesh5/Paper-a-day","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"interlaced-sparse-self-attention-for-semantic","repo_url":"https://github.com/PaddlePaddle/PaddleSeg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null}],"tasks":[{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1907.12273","atlas_url":"https://app.syntology.ai/?focus=1907.12273","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":"1907.12273"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1907.12273\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1907.12273"},"call":"get_concepts_for_paper(arxiv_id=\"1907.12273\")"}],"by_repo":[{"repo":"openseg-group/openseg.pytorch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.11065"],"harvested_for_calls":[{"arxiv_id":"1909.11065","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.11065"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.11065\")"}]},{"repo":"PkuRainBow/OCNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.04269"],"harvested_for_calls":[{"arxiv_id":"2007.04269","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.04269"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.04269\")"}]},{"repo":"PkuRainBow/OCNet.pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"openseg-group/OCNet.pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vishwesh5/Paper-a-day","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleSeg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.09406"],"harvested_for_calls":[{"arxiv_id":"2109.09406","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.09406"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.09406\")"}]}],"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":"2f8ac44b133a879980d8983f29893227d4e4262beea1582d173af7015c2d2c52","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}