Abstract

Intelligent vehicles should be able to detect various obstacles and also identify their types so that the vehicles can take an appropriate level of protection and intervention. This article presents a method of detecting and classifying multiclass obstacles for intelligent vehicles. A stereovision-based method is used to segment obstacles from traffic background and measure three-dimensional geometrical features. A Bayesian network (BN) model has been established to further classify them into five classes, including pedestrian, cyclist, car, van, and truck. The BN model is trained using substantial data samples. The optimized structure of the model is determined from the necessary path condition method with a presupposition constraint (NPC+PC). The conditional probability table of the discrete nodes and the conditional probability distribution of the continuous nodes are determined from expectation maximization (EM) training algorithm with consideration of prior domain knowledge. Experiments were conducted using the object detection data set on the public KITTI benchmark, and the results show that the proposed BN model exhibits an excellent performance for obstacle classification while the full pipeline of the method including detection and classification is in the upper middle level compared with other existing methods.

Highlights

  • Research on intelligent vehicles is being in the ascendant with the aim of autonomous driving

  • Simultaneous detection and classification of multiclass obstacles are a challenge for intelligent vehicles

  • The stereovisionbased method is used to segment objects from traffic background and to measure the 3D geometrical features

Read more

Summary

Introduction

Research on intelligent vehicles is being in the ascendant with the aim of autonomous driving. We use an active contour model (snake model) to extract the contour so that the accurate object size, including length, width, and height, can be obtained. The details of these methods are described in our previous research work.[1,2] Steps are summarized as follows:. Structure learning of a BN is to find the close-to-optimum directed acyclic graph (DAG) from a given data set, which reflects the dependent/independent relationship between variables (nodes) This is a non-deterministic polynomial (NP)-hard problem without an optimum solution. For each discrete parent, intercept and the variance must be specified as well as the weights for each continuous parent

Experiments and evaluation of classification model
Method Type
Method
Findings
Conclusions and future works
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call