Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 704

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Expectation-Maximization Attention Networks for Semantic Segmentation

Open access
Li, Xia, Zhong, Zhisheng, Wu, Jianlong, Yang, Yibo, Lin, Zhouchen, Liu, Hong·2019·2019 IEEE/CVF International Conference on Computer Vision (ICCV)

Abstract

Self-attention mechanism has been widely used for various tasks. It is designed to compute the representation of each position by a weighted sum of the features at all positions. Thus, it can capture long-range relations for computer vision tasks. However, it is computationally consuming. Since the attention maps are computed w.r.t all other positions. In this paper, we formulate the attention mechanism into an expectation-maximization manner and iteratively estimate a much more compact set of bases upon which the attention maps are computed. By a weighted summation upon these bases, the resulting representation is low-rank and deprecates noisy information from the input. The proposed Expectation-Maximization Attention (EMA) module is robust to the variance of input and is also friendly in memory and computation. Moreover, we set up the bases maintenance and normalization methods to stabilize its training procedure. We conduct extensive experiments on popular semantic segmentation benchmarks including PASCAL VOC, PASCAL Context, and COCO Stuff, on which we set new records1.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/iccv.2019.00926

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Research works printed but not linked: 25

  1. 10.1007/978-3-030-01240-3_17 · DOI · Paper page
  2. 10.1109/CVPR.2018.00256 · DOI
  3. 10.1016/j.patcog.2019.01.006 · DOI · Paper page
  4. 10.1109/CVPR.2017.556 · DOI
  5. 10.1109/CVPR.2017.660 · DOI · Paper page
  6. zhang, 2018, Exfuse: Enhancing feature fusion for semantic segmentation, ECCV, 269
  7. 10.1109/CVPR.2018.00747 · DOI · Paper page
  8. 10.1109/CVPR.2018.00199 · DOI · Paper page
  9. forgy, 1965, Cluster analysis of multivariate data: efficiency versus interpretability of classifications, Biometrics, 21, 768
  10. fu, 2019, Dual attention network for scene segmentation, CVPR, 3146
  11. 10.1109/TIP.2019.2895460 · DOI · Paper page
  12. li, 2018, Recurrent squeeze-and-excitation context aggregation net for single image deraining, ECCV, 254
  13. liang, 2018, Symbolic graph reasoning meets convolutions, NeurIPS, 1858
  14. 10.1109/CVPR.2018.00085 · DOI
  15. chen, 2017, Rethinking atrous convolution for semantic image segmentation, arXiv preprint arXiv 1706 05587
  16. 10.1109/CVPR.2018.00132 · DOI · Paper page
  17. chen, 2018, A2-nets: Double attention networks, NeurIPS, 350
  18. vaswani, 2017, Attention is all you need, NeurIPS, 5998
  19. 10.1109/CVPR.2018.00254 · DOI · Paper page
  20. bahdanau, 2014, Neural machine translation by jointly learning to align and translate, arXiv preprint arXiv 1409 0473
  21. ba, 2016, Layer normalization, arXiv preprint arXiv 1607 06450
  22. 10.1007/978-3-030-01219-9_37 · DOI · Paper page
  23. 10.1109/CVPR.2015.7298965 · DOI · Paper page
  24. 10.1109/ICCV.2017.296 · DOI
  25. 10.1111/1467-9868.00095 · DOI · Paper page

Cited by

See all 704

Metadata

Authors
Li, X., Zhong, Z., Wu, J., Yang, Y., Lin, Z., & Liu, H.
Venue
2019 IEEE/CVF International Conference on Computer Vision (ICCV)
Publisher
IEEE
Published
2019-10
Pages
9166-9175
OpenAlex
W2993235622
Cited by
704
References
13
FWCI
26.99
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Expectation-Maximization Attention Networks for Semantic Segmentation. https://app.cochat.ai/papers/10.1109/iccv.2019.00926
The paper
Li, X., Zhong, Z., Wu, J., Yang, Y., Lin, Z., & Liu, H. (2019). Expectation-Maximization Attention Networks for Semantic Segmentation. 2019 IEEE/CVF International Conference on Computer Vision (ICCV). https://doi.org/10.1109/iccv.2019.00926

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.