Computer Science > Computer Vision and Pattern Recognition
arXiv:2211.13756 (cs)
[Submitted on 24 Nov 2022 (v1), last revised 23 Jan 2023 (this version, v2)]
Title:Contrastive pretraining for semantic segmentation is robust to noisy positive pairs
Authors:Sebastian Gerard (KTH Royal Institute of Technology, Stockholm, Sweden),Josephine Sullivan (KTH Royal Institute of Technology, Stockholm, Sweden)
View a PDF of the paper titled Contrastive pretraining for semantic segmentation is robust to noisy positive pairs, by Sebastian Gerard (KTH Royal Institute of Technology and 5 other authors
View PDFAbstract:Domain-specific variants of contrastive learning can construct positive pairs from two distinct in-domain images, while traditional methods just augment the same image twice. For example, we can form a positive pair from two satellite images showing the same location at different times. Ideally, this teaches the model to ignore changes caused by seasons, weather conditions or image acquisition artifacts. However, unlike in traditional contrastive methods, this can result in undesired positive pairs, since we form them without human supervision. For example, a positive pair might consist of one image before a disaster and one after. This could teach the model to ignore the differences between intact and damaged buildings, which might be what we want to detect in the downstream task. Similar to false negative pairs, this could impede model performance. Crucially, in this setting only parts of the images differ in relevant ways, while other parts remain similar. Surprisingly, we find that downstream semantic segmentation is either robust to such badly matched pairs or even benefits from them. The experiments are conducted on the remote sensing dataset xBD, and a synthetic segmentation dataset for which we have full control over the pairing conditions. As a result, practitioners can use these domain-specific contrastive methods without having to filter their positive pairs beforehand, or might even be encouraged to purposefully include such pairs in their pretraining dataset.
Comments: | This work has been submitted to the IEEE for possible publication. Compared to the previous version, large-scale changes were made to make the paper easier to understand for people less familiar with contrastive learning and to make it easier to follow certain arguments. 10 pages, 9 figures |
Subjects: | Computer Vision and Pattern Recognition (cs.CV) |
ACM classes: | I.2.6; I.2.10; J.2 |
Cite as: | arXiv:2211.13756 [cs.CV] |
(orarXiv:2211.13756v2 [cs.CV] for this version) | |
https://doi.org/10.48550/arXiv.2211.13756 arXiv-issued DOI via DataCite |
Submission history
From: Sebastian Gerard [view email][v1] Thu, 24 Nov 2022 18:59:01 UTC (9,187 KB)
[v2] Mon, 23 Jan 2023 18:59:54 UTC (10,245 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled Contrastive pretraining for semantic segmentation is robust to noisy positive pairs, by Sebastian Gerard (KTH Royal Institute of Technology and 5 other authors
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.