Test Time Adaptation With Regularized Loss for Weakly Supervised Salient Object Detection
It is well known that CNNs tend to overfit to the training data. Test-time adaptation is an extreme approach to deal with overfitting: given a test image, the aim is to adapt the trained model to that image. Indeed nothing can be closer to the test data than the test image itself. The main difficulty of test-time adaptation is that the ground truth is not available. Thus test-time adaptation, while intriguing, applies to only a few scenarios where one can design an effective loss function that does not require ground truth. We propose the first approach for test-time Salient Object Detection (SOD) in the context of weak supervision. Our approach is based on a so called regularized loss function, which can be used for training CNN when pixel precise ground truth is unavailable. Regularized loss tends to have lower values for the more likely object segments, and thus it can be used to fine-tune an already trained CNN to a given test image, adapting to images unseen during training. We develop a regularized loss function particularly suitable for test-time adaptation and show that our approach significantly outperforms prior work for weakly supervised SOD.
Code (0)
등록된 구현이 없습니다.
Tasks
object-detectionObject DetectionSalient Object DetectionTest-time AdaptationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Regularized Loss for Weakly Supervised Single Class Semantic Segmentation
Fully supervised semantic segmentation is highly successful, but obtaining dense ground truth is expensive. Thus there is an increasing interest in weakly supervised approaches. We propose a new weakly supervised method …
ObjectSegmentationSemantic SegmentationDynamic Feature Regularized Loss for Weakly Supervised Semantic Segmentation
We focus on tackling weakly supervised semantic segmentation with scribble-level annotation. The regularized loss has been proven to be an effective solution for this task. However, most existing regularized losses only …
Semantic SegmentationWeakly supervised Semantic SegmentationWeakly-Supervised Semantic SegmentationOn Regularized Losses for Weakly-supervised CNN Segmentation
Minimization of regularized losses is a principled approach to weak supervision well-established in deep learning, in general. However, it is largely overlooked in semantic segmentation currently dominated by methods mim…
SegmentationSemantic SegmentationRobust Trust Region for Weakly Supervised Segmentation
Acquisition of training data for the standard semantic segmentation is expensive if requiring that each pixel is labeled. Yet, current methods significantly deteriorate in weakly supervised settings, e.g. where a fractio…
SegmentationSemantic SegmentationWeakly supervised segmentationMM-TTA: Multi-Modal Test-Time Adaptation for 3D Semantic Segmentation
Test-time adaptation approaches have recently emerged as a practical solution for handling domain shift without access to the source domain data. In this paper, we propose and explore a new multi-modal extension of test-…
3D Semantic SegmentationPseudo LabelSelf-LearningSemantic Segmentation+1