论文标题

随机步行以进行对抗网眼

Random Walks for Adversarial Meshes

论文作者

Belder, Amir, Yefet, Gal, Izhak, Ran Ben, Tal, Ayellet

论文摘要

多边形网格是计算机图形中表面最常用的表示。因此,最近提出了许多网格分类网络并不奇怪。但是,尽管在2D中对对抗性攻击进行了疯狂的研究,但仍在探索对抗性网络。本文提出了一种新颖,统一和一般的对抗性攻击,导致对几个最新网格分类神经网络的分类错误。我们的攻击方法是黑框,即它仅访问网络的预测,但不能访问网络的完整体系结构或梯度。关键想法是训练网络以模仿给定的分类网络。这是通过沿网格表面的随机行走来完成的,该网格表面收集几何信息。这些步道可洞悉网格区域,对于给定分类网络的正确预测至关重要。然后,这些网格区域比其他区域更换了,以便以肉眼几乎看不见的方式攻击网络。

A polygonal mesh is the most-commonly used representation of surfaces in computer graphics. Therefore, it is not surprising that a number of mesh classification networks have recently been proposed. However, while adversarial attacks are wildly researched in 2D, the field of adversarial meshes is under explored. This paper proposes a novel, unified, and general adversarial attack, which leads to misclassification of several state-of-the-art mesh classification neural networks. Our attack approach is black-box, i.e. it has access only to the network's predictions, but not to the network's full architecture or gradients. The key idea is to train a network to imitate a given classification network. This is done by utilizing random walks along the mesh surface, which gather geometric information. These walks provide insight onto the regions of the mesh that are important for the correct prediction of the given classification network. These mesh regions are then modified more than other regions in order to attack the network in a manner that is barely visible to the naked eye.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源