Cited by 1,116Advanced Neural Network ApplicationsDomain Adaptation and Few-Shot LearningMedical Image Segmentation Techniques

Fully Convolutional Instance-Aware Semantic Segmentation

Open access
Li, Yi, Qi, Haozhi, Dai, Jifeng, Ji, Xiangyang, Wei, Yichen·2017·2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

We present the first fully convolutional end-to-end solution for instance-aware semantic segmentation task. It inherits all the merits of FCNs for semantic segmentation [29] and instance mask proposal [5]. It performs instance mask prediction and classification jointly. The underlying convolutional representation is fully shared between the two sub-tasks, as well as between all regions of interest. The network architecture is highly integrated and efficient. It achieves state-of-the-art performance in both accuracy and efficiency. It wins the COCO 2016 segmentation competition by a large margin. Code would be released at https://github.com/daijifeng001/TA-FCN.

Integrity signals

Registry

Crossref · 10.1109/cvpr.2017.472

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The Hungarian algorithm enforces permutation-invariance and guarantees that each target element has a unique match.

    “The usual solution is to design a loss based on the Hungarian algorithm [20], to find a bipartite matching between ground-truth and prediction. This enforces permutation-invariance, and guarantees that each target element has a unique match.”

    From End-to-End Object Detection with Transformers (2020) · cites this paper as [20]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Li, Y., Qi, H., Dai, J., Ji, X., & Wei, Y.
Affiliations
  • Microsoft Research Asia (China) (CN)
  • Tsinghua University (CN)
Venue
2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2017-07
Pages
4438-4446
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2555182955
Cited by
1,116
References
44
Citations by year
2026: 11 · 2025: 38 · 2024: 75 · 2023: 117 · 2022: 146 · 2021: 219 · 2020: 180 · 2019: 182 · 2018: 116 · 2017: 32
FWCI
40.77
Type
conference paper
Language
en
Open access
Locations
  • IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Microsoft Research
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Medical Image Segmentation Techniques
Keywords
fully convolutional network, instance classification, joint segmentation and classification, region of interest

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