2021 IEEE Winter Conference on Applications of Computer Vision (WACV) 2021
DOI: 10.1109/wacv48630.2021.00141
|View full text |Cite
|
Sign up to set email alerts
|

ClassMix: Segmentation-Based Data Augmentation for Semi-Supervised Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
175
1

Year Published

2021
2021
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 276 publications
(177 citation statements)
references
References 19 publications
1
175
1
Order By: Relevance
“…To address both problems, instead of storing whole images from the previous tasks {1, ..., t − 1}, we propose to store an informative portion that we will mix with the images of the current task t. Image mixing is popular for classification [93], [94], [95], [96], [97], [98] yet, to the best of our knowledge, sees limited use for semantic segmentation [99], [100], [101], [102], [103], and has never been considered to design memory-efficient rehearsal learning systems. Formally, given an image I and the corresponding ground truth segmentation maps S t , we define a binary mask Π c such that ∀c ∈ C t : with O c the selected object for class c. By nature, this patch is extremely sparse and can be efficiently stored on disk by modern compression algorithms [104].…”
Section: Object Rehearsalmentioning
confidence: 99%
“…To address both problems, instead of storing whole images from the previous tasks {1, ..., t − 1}, we propose to store an informative portion that we will mix with the images of the current task t. Image mixing is popular for classification [93], [94], [95], [96], [97], [98] yet, to the best of our knowledge, sees limited use for semantic segmentation [99], [100], [101], [102], [103], and has never been considered to design memory-efficient rehearsal learning systems. Formally, given an image I and the corresponding ground truth segmentation maps S t , we define a binary mask Π c such that ∀c ∈ C t : with O c the selected object for class c. By nature, this patch is extremely sparse and can be efficiently stored on disk by modern compression algorithms [104].…”
Section: Object Rehearsalmentioning
confidence: 99%
“…French et al [13] find that mask-based augmentation strategies are effective and introduce an adapted version of a popular technique CutMix [13]. The idea of CutMix is to mix samples by replacing the image region with a patch from another image, which can be regarded as an extension of Cutout [35] and Mixup [36], and is further extended in recent works [14,37,38]. Our approach also adopts the idea from CutMix [13] to enforce consistency between the mixed outputs and the prediction over the mixed inputs.…”
Section: Related Workmentioning
confidence: 99%
“…We comprehensively compare our method with state-of-the-art methods which can be categories as: 1) adversarial based methods, i.e., AdvSSL [58] and S4GAN [66]; 2) methods that encourage consistency, i.e., ICT [6], CutMix [13], CowMix [59] and ClassMix [14]; 3) two recent works that also collaboratively train networks, i.e., ECS [23] and DMT [19]. For fair comparisons, we report the performance reported by their original papers under the same SSL setting.…”
Section: Comparisons With Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A common practice when dealing with domain shift is to annotate some data from the domain of interest and re-train (fine-tune) the network on this new data. Additionally, Semi-Supervised Learning (SSL) methods for semantic segmentation have been proposed [4,5,6,7,8,9], effectively training on a small amount of labelled data by relying on complementary learning from unlabelled data. These approaches are not always feasible as sometimes no annotations at all are accessible in the target domain.…”
Section: Introductionmentioning
confidence: 99%