Feature Binding with Category-Dependant MixUp for Semantic Segmentation and Adversarial Robustness
In this paper, we present a strategy for training convolutional neural networks to effectively resolve interference arising from competing hypotheses relating to inter-categorical information throughout the network. The premise is based on the notion of feature binding, which is defined as the process by which activation's spread across space and layers in the network are successfully integrated to arrive at a correct inference decision. In our work, this is accomplished for the task of dense image labelling by blending images based on their class labels, and then training a feature binding network, which simultaneously segments and separates the blended images. Subsequent feature denoising to suppress noisy activations reveals additional desirable properties and high degrees of successful predictions. Through this process, we reveal a general mechanism, distinct from any prior methods, for boosting the performance of the base segmentation network while simultaneously increasing robustness to adversarial attacks.
Code (0)
등록된 구현이 없습니다.
Tasks
Adversarial RobustnessDenoisingSemantic SegmentationSimilar Papers 제목 키워드 기반
FedSM: Robust Semantics-Guided Feature Mixup for Bias Reduction in Federated Learning with Long-Tail Data
Federated Learning (FL) enables collaborative model training across decentralized clients without sharing private data. However, FL suffers from biased global models due to non-IID and long-tail data distributions. We pr…
Computational EfficiencyFederated LearningSegMix: Co-occurrence Driven Mixup for Semantic Segmentation and Adversarial Robustness
In this paper, we present a strategy for training convolutional neural networks to effectively resolve interference arising from competing hypotheses relating to inter-categorical information throughout the network. The …
Adversarial RobustnessDenoisingSemantic SegmentationMixup Regularized Adversarial Networks for Multi-Domain Text Classification
Using the shared-private paradigm and adversarial training has significantly improved the performances of multi-domain text classification (MDTC) models. However, there are two issues for the existing methods. First, ins…
ClassificationGeneral Classificationtext-classificationText ClassificationDual Mixup Regularized Learning for Adversarial Domain Adaptation
Recent advances on unsupervised domain adaptation (UDA) rely on adversarial learning to disentangle the explanatory and transferable features for domain adaptation. However, there are two issues with the existing methods…
Domain AdaptationUnsupervised Domain AdaptationRecurrent Feature Mining and Keypoint Mixup Padding for Category-Agnostic Pose Estimation
Category-agnostic pose estimation aims to locate keypoints on query images according to a few annotated support images for arbitrary novel classes. Existing methods generally extract support features via heatmap pooling,…
Category-Agnostic Pose EstimationPose Estimation