5 research outputs found
VIENA2: A Driving Anticipation Dataset
Action anticipation is critical in scenarios where one needs to react before
the action is finalized. This is, for instance, the case in automated driving,
where a car needs to, e.g., avoid hitting pedestrians and respect traffic
lights. While solutions have been proposed to tackle subsets of the driving
anticipation tasks, by making use of diverse, task-specific sensors, there is
no single dataset or framework that addresses them all in a consistent manner.
In this paper, we therefore introduce a new, large-scale dataset, called
VIENA2, covering 5 generic driving scenarios, with a total of 25 distinct
action classes. It contains more than 15K full HD, 5s long videos acquired in
various driving conditions, weathers, daytimes and environments, complemented
with a common and realistic set of sensor measurements. This amounts to more
than 2.25M frames, each annotated with an action label, corresponding to 600
samples per action class. We discuss our data acquisition strategy and the
statistics of our dataset, and benchmark state-of-the-art action anticipation
techniques, including a new multi-modal LSTM architecture with an effective
loss function for action anticipation in driving scenarios.Comment: Accepted in ACCV 201
Recommended from our members
Interactive Prediction and Planning for Autonomous Driving: from Algorithms to Fundamental Aspects
Inevitably, autonomous vehicles need to interact with other road participants in a variety of highly complex or critical driving scenarios. It is still an extremely challenging task even for the forefront companies or institutes to enable autonomous vehicles to interactively predict the behavior of others, and plan safe and high-quality motions accordingly. The major obstacles are not just originated from prediction and planning algorithms with insufficient performances. Several fundamental problems in the fields of interactive prediction and planning still remain open, such as formulation, representation and evaluation of interactive prediction methods, motion dataset with densely interactive driving behavior, as well as interface of interactive prediction and planning algorithms. The aforementioned fundamental aspects of interactive prediction and planning are addressed in this dissertation along with various kinds of algorithms. First, generic environmental representation for various scenarios with topological decomposition is constructed, and a corresponding planning algorithm is designed by combining graph search and optimization. Hard constraints in optimization-based planners are also incorporated into the training loss of imitation learning so that the policy net can generate safe and feasible motions in highly constrained scenarios. Unified problem formulation and motion representation are designed for different paradigms of interactive predictors such as planning-based prediction (inverse reinforcement learning), as well as probabilistic graphical models (hidden Markov model) and deep neural networks (mixture density network), which are utilized for the prediction/planning interface design and prediction benchmark. A framework combing decision network and graph-search/optimization/sample-based planner is proposed to achieve a driving strategy which is defensive to potential violations of others, but not overly conservatively to threats of low probabilities. Such driving strategy is achieved via experiments based on the aforementioned interactive prediction and planning algorithms with proper interface designed. These predictors are also evaluated from closed loop perspective considering planning fatality when using the prediction results instead of pure data approximation metrics. Finally, INTERACTION (INTERnational, Adversarial and Cooperative moTION) dataset with highly interactive driving scenarios and behavior from international locations is constructed with interaction density metric defined to compare different datasets. The dataset has been utilized for various behavior-related research areas such as prediction, planning, imitation learning and behavior modeling, and is inspiring new research fields such as representation learning, interaction extraction and scenario generation
Probabilistic, Variable and Interaction-aware Situation Recognition
Future advanced driver assistance systems (ADAS) as well as autonomous driving functions will extend their applicability to more complex highway scenarios and inner-city traffic. For these systems it is a prerequisite to know how an encountered traffic scene is most likely going to evolve. Situation recognition aims to predict the high level behavior patterns traffic participants pursue. Thus, it provides valuable information that helps to predict the next few seconds of a traffic scene. The extension of ADAS and autonomous driving functions to more complex scenarios poses a problem to state-of-the-art situation recognition systems due to the variability of the encountered scene layouts, the presence of multiple interacting traffic participants and the concomitant large number of possible situation classes. This thesis proposes and discusses approaches that tackle these challenges. A novel discriminative maneuver estimation framework provides the possibility to assess traffic scenes with varying layout. It is based on reusable, partial classifiers that are combined online using a technique called pairwise probability coupling. The real-world evaluations indicate that the assembled probabilistic maneuver estimation is able to provide superior classification results. A novel interaction-aware situation recognition framework constructs a probabilistic situation assessment over multiple traffic participants without relying on independence assumptions. It allows to assess each traffic participant individually by using maneuver estimation systems that determine complete conditional distributions. A real-world evaluation outlines its applicability and shows its benefits. The challenges associated with the increasing number of possible situation classes are addressed in two ways. Both frameworks allow to reuse classifiers in different contexts. This reduces the number of models required to cope with a large variety of traffic scenes. Moreover, a situation hypotheses selection scheme provides an efficient way for reducing the number of situation hypotheses. This lowers the computational demands and eases the load on subsequent systems