Interlaced Sparse Self-Attention for Semantic Segmentation

Lang Huang, Yuhui Yuan, Jianyuan Guo, Chao Zhang, Xilin Chen +1 more
7/29/2019
cs.CV

Official code: openseg-group/openseg.pytorch (1,238 stars, MIT, last commit 2024-07-25).

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.

View on arXivView PDF

Code Implementations(1)

MIT

The official Pytorch implementation of OCNet, OCRNet, and SegFix.

1,238141C, C++Jan 21, 20192 years agoMIT

Cite this paper

@article{huang2019interlaced,
  title  = {Interlaced Sparse Self-Attention for Semantic Segmentation},
  author = {Lang Huang and Yuhui Yuan and Jianyuan Guo and Chao Zhang and Xilin Chen and Jingdong Wang},
  year   = {2019},
  eprint = {1907.12273},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1907.12273}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1907.12273.svg)](https://codeofpaper.com/paper/1907.12273)

Discussion