4,651 research outputs found
A New Approach To Estimate The Collision Probability For Automotive Applications
We revisit the computation of probability of collision in the context of
automotive collision avoidance (the estimation of a potential collision is also
referred to as conflict detection in other contexts). After reviewing existing
approaches to the definition and computation of a collision probability we
argue that the question "What is the probability of collision within the next
three seconds?" can be answered on the basis of a collision probability rate.
Using results on level crossings for vector stochastic processes we derive a
general expression for the upper bound of the distribution of the collision
probability rate. This expression is valid for arbitrary prediction models
including process noise. We demonstrate in several examples that distributions
obtained by large-scale Monte-Carlo simulations obey this bound and in many
cases approximately saturate the bound. We derive an approximation for the
distribution of the collision probability rate that can be computed on an
embedded platform. In order to efficiently sample this probability rate
distribution for determination of its characteristic shape an adaptive method
to obtain the sampling points is proposed. An upper bound of the probability of
collision is then obtained by one-dimensional numerical integration over the
time period of interest. A straightforward application of this method applies
to the collision of an extended object with a second point-like object. Using
an abstraction of the second object by salient points of its boundary we
propose an application of this method to two extended objects with arbitrary
orientation. Finally, the distribution of the collision probability rate is
identified as the distribution of the time-to-collision.Comment: Revised and restructured version, discussion of extended vehicles
expanded, section on TTC expanded, references added, other minor changes, 17
pages, 18 figure
Feature-Guided Black-Box Safety Testing of Deep Neural Networks
Despite the improved accuracy of deep neural networks, the discovery of
adversarial examples has raised serious safety concerns. Most existing
approaches for crafting adversarial examples necessitate some knowledge
(architecture, parameters, etc.) of the network at hand. In this paper, we
focus on image classifiers and propose a feature-guided black-box approach to
test the safety of deep neural networks that requires no such knowledge. Our
algorithm employs object detection techniques such as SIFT (Scale Invariant
Feature Transform) to extract features from an image. These features are
converted into a mutable saliency distribution, where high probability is
assigned to pixels that affect the composition of the image with respect to the
human visual system. We formulate the crafting of adversarial examples as a
two-player turn-based stochastic game, where the first player's objective is to
minimise the distance to an adversarial example by manipulating the features,
and the second player can be cooperative, adversarial, or random. We show that,
theoretically, the two-player game can con- verge to the optimal strategy, and
that the optimal strategy represents a globally minimal adversarial image. For
Lipschitz networks, we also identify conditions that provide safety guarantees
that no adversarial examples exist. Using Monte Carlo tree search we gradually
explore the game state space to search for adversarial examples. Our
experiments show that, despite the black-box setting, manipulations guided by a
perception-based saliency distribution are competitive with state-of-the-art
methods that rely on white-box saliency matrices or sophisticated optimization
procedures. Finally, we show how our method can be used to evaluate robustness
of neural networks in safety-critical applications such as traffic sign
recognition in self-driving cars.Comment: 35 pages, 5 tables, 23 figure
Kernel-based aggregation of marker-level genetic association tests involving copy-number variation
Genetic association tests involving copy-number variants (CNVs) are
complicated by the fact that CNVs span multiple markers at which measurements
are taken. The power of an association test at a single marker is typically
low, and it is desirable to pool information across the markers spanned by the
CNV. However, CNV boundaries are not known in advance, and the best way to
proceed with this pooling is unclear. In this article, we propose a
kernel-based method for aggregation of marker-level tests and explore several
aspects of its implementation. In addition, we explore some of the theoretical
aspects of marker-level test aggregation, proposing a permutation-based
approach that preserves the family-wise error rate of the testing procedure,
while demonstrating that several simpler alternatives fail to do so. The
empirical power of the approach is studied in a number of simulations
constructed from real data involving a pharmacogenomic study of gemcitabine,
and compares favorably with several competing approaches
- …