Existing adversarial attacks against Object Detectors (ODs) suffer from two
inherent limitations. Firstly, ODs have complicated meta-structure designs,
hence most advanced attacks for ODs concentrate on attacking specific
detector-intrinsic structures, which makes it hard for them to work on other
detectors and motivates us to design a generic attack against ODs. Secondly,
most works against ODs make Adversarial Examples (AEs) by generalizing
image-level attacks from classification to detection, which brings redundant
computations and perturbations in semantically meaningless areas (e.g.,
backgrounds) and leads to an emergency for seeking controllable attacks for
ODs. To this end, we propose a generic white-box attack, LGP (local
perturbations with adaptively global attacks), to blind mainstream object
detectors with controllable perturbations. For a detector-agnostic attack, LGP
tracks high-quality proposals and optimizes three heterogeneous losses
simultaneously. In this way, we can fool the crucial components of ODs with a
part of their outputs without the limitations of specific structures. Regarding
controllability, we establish an object-wise constraint that exploits
foreground-background separation adaptively to induce the attachment of
perturbations to foregrounds. Experimentally, the proposed LGP successfully
attacked sixteen state-of-the-art object detectors on MS-COCO and DOTA
datasets, with promising imperceptibility and transferability obtained. Codes
are publicly released in this https URL

我们提出了一种通用的白盒攻击方法 LG P（局部扰动与自适应全局攻击），用可控的扰动欺骗主流物体检测器，通过追踪高质量的候选框并同时优化三个异构损失，成功攻击了 16 种最先进的物体检测器，并在 MS-COCO 和 DOTA 数据集上取得了有希望的不可察觉性和可迁移性。

面向通用可控的目标检测攻击

Towards Generic and Controllable Attacks Against Object Detection

For non-uniform cellular automata (NUCA) with finite memory over an arbitrary
universe with multiple local transition rules, we show that pointwise
nilpotency, pointwise periodicity, and pointwise eventual periodicity
properties are respectively equivalent to nilpotency, periodicity, and eventual
periodicity. Moreover, we prove that every linear NUCA which satisfies
pointwise a polynomial equation (which may depend on the configuration) must be
an eventually periodic linear NUCA. Generalizing results for higher dimensional
group and linear CA, we also establish the decidability results of the above
dynamical properties as well as the injectivity for arbitrary NUCA with finite
memory which are local perturbations of higher dimensional linear and group CA.
Some generalizations to the case of sparse global perturbations of higher
dimensional linear and group CA are also obtained.

研究非均匀细胞自动机的特性，证明了点状幂零、周期性和最终周期性等性质与幂零、周期性和最终周期性等性质分别等价。此外，还证明了每个满足点方程（可能依赖于配置）的线性 NSGCA 必须是最终周期性的线性 NSGCA。还将这些动力学特性的可决策性结果推广到任意限制高维线性和群 CA 的局部扰动。