paper-with-me

Papers

Overcomplete Representations Against Adversarial Videos

2020-12-08 · Shao-Yuan Lo, Jeya Maria Jose Valanarasu, Vishal M. Patel

Adversarial robustness of deep neural networks is an extensively studied problem in the literature and various methods have been proposed to defend against adversarial images. However, only a handful of defense methods have been developed for defending against attacked videos. In this paper, we propose a novel Over-and-Under complete restoration network for Defending against adversarial videos (OUDefend). Most restoration networks adopt an encoder-decoder architecture that first shrinks spatial dimension then expands it back. This approach learns undercomplete representations, which have large receptive fields to collect global information but overlooks local details. On the other hand, overcomplete representations have opposite properties. Hence, OUDefend is designed to balance local and global features by learning those two representations. We attach OUDefend to target video recognition models as a feature restoration block and train the entire network end-to-end. Experimental results show that the defenses focusing on images may be ineffective to videos, while OUDefend enhances robustness against different types of adversarial videos, ranging from additive attacks, multiplicative attacks to physically realizable attacks. Code: https://github.com/shaoyuanlo/OUDefend

📄 PDF Abstract BibTeX arXiv:2012.04262

Code (1)

shaoyuanlo/OUDefend 공식 구현 pytorch

Tasks

Adversarial RobustnessDecoderVideo Recognition

Similar Papers 제목 키워드 기반

Approximated Infomax Early Stopping: Revisiting Gaussian RBMs on Natural Images

2013-12-19 · Taichi Kiwaki, Takaki Makino, Kazuyuki Aihara

We pursue an early stopping technique that helps Gaussian Restricted Boltzmann Machines (GRBMs) to gain good natural image representations in terms of overcompleteness and data fitting. GRBMs are widely considered as an …

Attribute

Training sparse natural image models with a fast Gibbs sampler of an extended state space

2012-12-01 · NeurIPS 2012 12 · Lucas Theis, Jascha Sohl-Dickstein, Matthias Bethge

We present a new learning strategy based on an efficient blocked Gibbs sampler for sparse overcomplete linear models. Particular emphasis is placed on statistical image modeling, where overcomplete models have played an …

Reframing Neural Networks: Deep Structure in Overcomplete Representations

2021-03-10 · Calvin Murdock, George Cazenavette, Simon Lucey

In comparison to classical shallow representation learning techniques, deep neural networks have achieved superior performance in nearly every application benchmark. But despite their clear empirical advantages, it is st…

Adversarial RobustnessModel SelectionRepresentation Learning

Overcomplete Deep Subspace Clustering Networks

2020-11-16 · Jeya Maria Jose Valanarasu, Vishal M. Patel

Deep Subspace Clustering Networks (DSC) provide an efficient solution to the problem of unsupervised subspace clustering by using an undercomplete deep auto-encoder with a fully-connected layer to exploit the self expres…

Clustering

Metrics for Multivariate Dictionaries

2013-02-18 · Sylvain Chevallier, Quentin Barthélemy, Jamal Atif

Overcomplete representations and dictionary learning algorithms kept attracting a growing interest in the machine learning community. This paper addresses the emerging problem of comparing multivariate overcomplete repre…

Clusteringcompressed sensingDictionary LearningEEG+1