Road scene understanding plays an important role in various computer vision applications, ranging from autonomous driving to urban modeling. It commonly involves multiple tasks, such as drivable road surface detectionAlvarez2010 ; Huang_ICIP2013 , pedestrian and vehicle detection Benenson_CVPR2012 ; YunFu2014 ; Nguyen2013 ; Yangqing2009 , semantic region labeling Huanhuan2010 ; Levinkov_ICCV2013 ; Guo_ITSC2011 ; Alvarez_2012 ; Huang_2014 ; Cheng_PR2010 , geometric context reasoning Jung_PR2012 ; Matzen_ICCV2013 , and so on. Each individual task is notoriously difficult due to the complexity of natural scenarios. As in the typical example presented in Fig. 1 (b), a road scene may contain severe lighting variation and a cluttered roadside background, together with variant numbers of vehicles and pedestrians. These challenges have led to a large amount of studies on tackling each problem.
Most existing work addresses the above-mentioned tasks individually. However, we can observe that these problems are coupled. For example, semantic region labeling should be easier if we know where the ground plane and moving objects are. Likewise, geometric context helps to detect objects and label regions. These observations inspire our research here. In order to take advantage of the benefits from such correlations, this paper proposes to solve the problems jointly. In addition, considering that cameras and ranging sensors are often used conjunctively on today’s autonomous vehicles, we build our work upon the fusion of visual and range data.
Specifically, this paper proposes a holistic approach that exploits appearance, geometry and contextual information to jointly tackle object-level image segmentation and semantic region labeling, from which it is straightforward to locate drivable road surfaces and moving objects in both images and 3D point clouds, as illustrated in Fig. 1 (f)-(i). Holistic road scene understanding is consequently achieved, providing robots with a deeper understanding of the whole scene.
The proposed approach distinguishes itself from other holistic scene understanding techniques in a couple of aspects. First, our approach generates semantic object hypotheses by simply clustering a 3D point cloud into object candidates, learning their prior Gaussian mixture models (GMMs), and using a deep learning method to reason their semantic categories. This procedure does not involve sophisticated feature extraction and requires almost no tedious pixel-wise hand labeling. Second, we perform bimodal data fusion on multiple stages, hierarchically, from image guided depth map upsampling to RGB-D image patch based object classification and holistic inference in a conditional random field (CRF). Thus, both visual and range information are thoroughly utilized. Last but not least, to the best of our knowledge, this research is one of the first studies working on holistic road scene understanding. The effectiveness of our approach is validated on the challenging KITTI datasetGeiger_CVPR2012 .
The remainder of this paper is organized as follows. In Section 2, we make a brief review of both fusion-based and holistic oriented scene understanding techniques. Section 3 introduces the method of generating semantic object hypotheses. The proposed holistic CRF framework, which incorporates the learned priors, together with lidar point pivoted hard constraints and geometric context, to jointly solve the problems, is presented in Section 4. Experiments are demonstrated in Section 5, followed by a conclusion in Section 6.
2 Related Works
There is a huge body of work related to our problem in that it encompasses multiple extensively studied tasks. In this section, we focus our attention on the two most relevant aspects, which are fusion-based and holistic scene understanding. The former emphasizes the fusion of multi-modal data for the tasks and the latter aims to solve multiple tasks jointly.
2.1 Fusion Based Scene Understanding
With the advent of ranging sensors, nowadays, it is quite convenient for us to capture synchronized range and visual data. Such convenience has motivated a great number of studies on fusing these two modalities for tasks towards scene understanding. In contrast to a camera- or lidar-only scheme, fusion dramatically increases accuracy and robustness in various applications.
Generally speaking, fusion is often conducted at feature or decision level. The feature-level methods fuse two modalities via extracting both appearance and geometric features and concatenating them together for the succeeding process. Particularly, these methods first segment RGB-D data into superpixels Ren_CVPR2012 , divide a colored 3D point mesh into spatially adjacent regions Strom_IROS2010 ; Valentin_CVPR2013 , or map both pixels and 3D points into cells Haselich_ECMR2011 ; Laible_AMS2012 . Then, sophisticated appearance features, such as texton Shotton2006 , SIFT and HOG Silberman2011 , and kernel descriptors Ren_CVPR2012
, as well as geometric features, such as surface normal, angular moments, and average height, are extracted from each unit for the tasks of object detection, 3D point segmentationStrom_IROS2010 ; Schoenberg_IROS2010 , terrain classification Haselich_ECMR2011 ; Laible_AMS2012 , semantic 3D modeling Valentin_CVPR2013 , and scene parsing Guo_ITSC2011 ; Zhao_FUSION2012 . Among these studies, RGB-D data oriented work is mostly limited to indoor scene parsing because a great portion of such data are obtained by Kinect-like sensors (although they can also be obtained by upsampling lidar data Diebel_NIPS2006 ). In contrast, 3D point clouds are collected by lidar so that they are more suitable for outdoor applications.
In contrast to feature-level fusion, a decision-level method analyzes each modality individually and then combines the analysis results through a fusion scheme. For instance, Zhao et al. Zhao_FUSION2012 utilize the fuzzy logic inference framework to combine the classification results of lidar data and that of images for scene parsing.
Other than the two above-mentioned separate fusion schemes, the use of deep learning, which is a powerful architecture merging both feature- and decision-level fusion into a whole, surged recently. It learns both feature representation and classification simultaneously to solve tasks such as RGB-D based object recognition Socher2012 and demonstrates promising results.
In contrast, our approach integrates visual and range information on multiple stages. More specifically, low-level fusion is first conducted to produce dense depth maps by using an image guided depth upsampling technique Liu2013 previously proposed by us. The obtained RGB-D image patches are fed into a deep learning method as well to reason semantic categories. Finally, in the proposed holistic conditional random field framework, besides the learned appearance and geometric priors, lidar points are integrated as hard constraints to guide image segmentation. Therefore, our fusion is conducted in a hierarchical way, which thoroughly makes use of the bimodal information.
2.2 Holistic Scene Understanding
While substantial progress has been made in numerous computer vision tasks over the last few decades, most previous works tackled each particular problem isolatedly. In recent years, however, more researchers have started to exploit the dependencies between different tasks and attempted to solve two or more problems jointly. For example, Bleyer et al. Bleyer_CVPR2011 , Ladicky et al. Ladicky_IJCV2012 and Hane et al. Hane_CVPR2013 combine stereo reconstruction with object segmentation to improve the performance of both. The problems of classification and segmentation are also simultaneously addressed in Gonfaus_CVPR2010 . In light of these successes, researchers have stepped further toward achieving the grand goal of holistic scene understanding Heitz_NIPS2008 ; Dahua_ICCV2013 ; Li_PAMI2012 ; Yao_CVPR2012 .
Holistic scene understanding aims to fully interpret a scene by jointly solving the tasks of image segmentation, object detection, 3D reconstruction, scene classification, etc. To achieve this target, a critical problem that we face is how to infer mutual information between the tasks. Here, we roughly categorize the inference techniques into two groups. One develops a general framework, such as Cascaded Classification Models (CCM) Heitz_NIPS2008 and feedback enabled CCMs Li_PAMI2012 , to combine different tasks. These techniques treat the components of each task as black boxes. They rely upon complicated inference algorithms so it is hard to incorporate potentials specific to some particular problems Yao_CVPR2012 .
A more extensive method is formulating a joint problem as an inference within a Markov or conditional random field (CRF) framework Bleyer_CVPR2011 ; Ladicky_IJCV2012 ; Gonfaus_CVPR2010 ; Dahua_ICCV2013 ; Yao_CVPR2012 ; Ladicky_ECCV2010 ; Tighe_ICCV2011 . Each node in the graph represents a segmentation or category label associated with a pixel, superpixel or 3D point. Potentials encode unitary information and pairwise or high-order relations of inter- or intra-tasks. Inference within the random field is done by either a message-passing approach Yao_CVPR2012 , fusion moves Bleyer_CVPR2011 , or more efficient Graph Cuts algorithms Ladicky_IJCV2012 ; Gonfaus_CVPR2010 ; Ladicky_ECCV2010 ; Boykov01 if energy functions satisfy submodularity restriction. In summary, the differences among all CRF-based works rely on the problems to be solved, the construction of the graphical models, the incorporated priors, and the inference techniques.
Our work follows the second line in order to thoroughly exploit the priors specific to road scenes and hierarchically fuse the bimodal data. The proposed holistic CRF graphical model is used for us to jointly solve object-level image segmentation and semantic region labeling problems. Our CRF encodes the priors learned from the bimodal data, together with lidar point pivoted hard constraints and geometric context, in the unary potentials. Meanwhile, pairwise potentials exploit the spatial dependencies in each task, as well as the coherency between the two tasks. All designed unary and pairwise potentials meet the submodularity restriction, so that Graph Cuts can be used for efficient inference.
3 Semantic Object Hypotheses Generation
Before integrating all information within a CRF framework, the first stage for us is to generate initial object hypotheses, learn their prior models, and reason their semantic categories. Considering that geometric information is more reliable than visual cues for discovering objects, we start from partitioning a 3D point cloud into clusters to obtain object hypotheses. Once we get the clustered points, their registered pixels, which are also referred to as seeds
, are taken to build prior models of the objects. Moreover, each RGB-D image patch that is registered to the bounding cuboid of a 3D cluster is fed into a convolutional recursive neuron network (CRNN)Socher2012 to determine its semantic category. The details of each step are stated below.
3.1 Data Preprocessing
The data we process are aligned image-lidar pairs that are, respectively, collected by a camera and a lidar mounted on a vehicle Geiger_CVPR2012 . When the intrinsic and extrinsic parameters of both sensors are calibrated, it is handy for us to register a 3D point set and an image to each other. By registration, we obtain a sparse depth map, in which the seeds are assigned with corresponding depth values and the remainder is of no depth information. For the convenience of the subsequent processes, the sparse depth map is upsampled by a guided depth enhancement technique Liu2013 , which generates a dense depth map via integrating the sparse one with a color image. An example result is illustrated in Fig. 1(c).
3.2 Generating Object Hypotheses
As pointed out by Douillard et al. Douillard_ICRA2011
, the ground extraction significantly improves clustering performance. Therefore, before 3D point clustering, we first estimate the ground plane. The ground is commonly the dominant plane in most road scenes. We therefore use the Random Sample Consensus (RANSAC) algorithmFischler1981 to estimate it. However, in scenarios such as a narrow street with buildings on both sides, the estimated dominant plane may lie on a wall of the buildings. In order to avoid such a mistake, we define a rough range for height according to where the lidar is equipped on the vehicle. Only the 3D points within the range are taken into consideration for ground plane estimation.
After detecting the ground plane, we leave out the corresponding points and use a simple but effective Euclidean clustering method to partition the remainder to generate object candidates. This method PCL2013 is based on the nearest neighbor scheme. It is implemented with a kd-tree data structure and therefore is quite efficient. Moreover, this approach produces a set of object clusters well, especially for separated objects on the road.
Note that our clustering is performed on the original sparse 3D lidar points, instead of the denser points reconstructed from the upsampled dense map. The reason is that the upsampling techniques are prone to generate artifacts, especially on the places near object boundaries and in large invalid regions, leading to errors that might be propagated to later stages.
3.3 Learning Object Priors
Once the ground and other object clusters are produced, the corresponding seeds are taken as samples to learn their prior models. In our work, we only take the RGB color and 3D location of each seed as our feature. No other sophisticated features are considered. Therefore, for each object instance, a Gaussian mixture model (GMM) of the 6D feature is built. It needs to be mentioned that a different means is taken for building the sky model. Since there is no way to sample the sky from lidar data, sky regions in a set of images are manually labeled to learn a color GMM for the sky.
3.4 Reasoning Semantic Categories
This step is to determine the semantic category for each image patch registered to a 3D cluster. In order to avoid the complicated feature extraction step, we simply apply a deep learning method here. More specifically, a convolutional recursive neuron network (CRNN) Socher2012
is adopted, which takes a RGB-D image patch as input. Within the CRNN, a convolutional neural network (CNN) layer with weights trained by k-means clustering is first used to extract low level features from the patch. The resulting feature maps are then connected to several recursive neural networks (RNN) to get higher-order combinational features. The weights of the RNNs are randomly assigned, which is very efficient and has shown to be good enough. Finally, the RNNs’ outputs are fed into a softmax classifier for recognition. The CRNN associates each image patch with a set of scores, indicating the confidence of it being a specific category.
4 Holistic CRF Model
In this section, we formulate road scene understanding as a labeling problem, which associates each pixel with two types of labels: one indicates an object instance that the pixel belongs to and the other tells its semantic category. To this end, we construct a holistic CRF model consisting of two hidden layers. The model also integrates observed features of the pixels, together with the 3D lidar points and geometric contextual information to boost the accuracy of both object-level segmentation and semantic region labeling. Fig. 2 illustrates our constructed model.
Formally, when an image is given, we construct a graph . Here, the vertex set consists of two sets of random variables and the edge set contains three types of edges. More specifically, a random variable is associated with the -th pixel and takes a value from to represent the -th object label, in which is the total number of object hypotheses generated in Sec. 3.3, is for the ground and is for the sky. Likewise, a random variable takes a value from to indicate its category, where
is the total number of semantic categories. With such a graphical model, an optimal solution of joint object-level segmentation and semantic region labeling is obtained by maximizing the following probability:
where is the partition function. In addition, there are five types of potentials. and are two unary potentials associated with the object label and the category label, respectively. is a pairwise potential exploiting the dependency of neighboring object labels. is also a pairwise potential investigating the dependency of category labels. investigates the mutual information between object labels and category labels, and are scaling factors. The details of each potential are explained below. With appropriate design, this graphical model can be inferred with the efficient Graph Cuts algorithm Boykov01 .
4.1 Object Potential
is the feature vector associated with the-th pixel, denotes the parameters of the -th object’s GMM that we have learned in Sec. 3.3, and is the likelihood.
The above-defined likelihood potential is sensitive when two objects share similar features. For instance, strong shadows on the ground and bushes nearby are prone to be labeled as the same object by mistake. In contrast, 3D point clustering performs better; at least it is invariant to illumination change. Therefore, we place high confidence Rother2004 on the seeds. Let us denote the entire set of seeds by , and the set of seeds belonging to the -th object by . Then, the object potential is placed with hard constraints (HC) and defined by
where is a small positive value and is a large positive value, which are experimentally set to force the constraints. With these hard constraints, the labels of the registered pixels are forced to be consistent with the point clustering results.
4.2 Category Potential
The category potential indicates the confidence for a pixel to be the -th category. This potential incorporates the classification result obtained by the CRNN together with the learned prior models and geometric contextual information for better reasoning.
Specifically, for the purpose of simplicity, let us first divide the semantic categories into three groups: , , and . stands for either the ground or the sky category, contains the background category and is for the remaining categories, such as pedestrians, vehicles, etc. The latter two are recognized by the CRNN. Therefore, we define a confidence score for an image patch to be the category , which is
where denotes the -th object hypotheses, for the ground and for the sky, as before. Note that, there is no patch for the ground and sky. For a uniform formulation, we define the patch of ground, denoted as , as the part under the horizon line Huang_ICIP2013 of the image and the patch of the sky, , as the rest of the image. is the score obtained by the CRNN. is a term introducing geometric properties. Although more complicated geometric relations can be taken into account, here we only investigate a quite straightforward observation. That is, except the ground, the sky, and the background, all other objects must lie on the ground. Therefore, this constraint is designed to be
Here, denotes the bottom height of the corresponding object cuboid, which should be lower than a threshold .
Upon these, we define our category potential as below:
Here, denotes the set of object instances that are identified as the -th category; is a large positive value assigned for the pixels that are not falling into any object patches. The reason to combine the category recognition confidence together with the object-level segmentation confidence is for obtaining semantic labeling results with better object boundaries. An illustration of this term is presented in Fig. 3.
4.3 Object Coherency Potential
The object coherency potential exploits the dependence between neighbors. It encourages two neighboring pixels to take the same object label if their associated features are similar to each other. This potential can smooth out isolated labels, leading to piecewise coherent results.
Specifically, for a pixel and each of its 4-connected neighboring pixels , this potential is defined as
where is the norm of the difference between the features and . is an indicator, whose value is 1 when its parameter is true and 0 otherwise. This term indicates that the more similar the features are, the more likely that the two pixels belong to the same object.
4.4 Category Coherency Potential
The category coherency potential encourages neighboring pixels to take the same category label. Likewise, it is defined by
4.5 Object-Category Coherency Potential
This potential is proposed to exploit the dependency between object and category labels of the same pixel. More specifically, the category label of a pixel should be the same as the recognition result of the object that the pixel belongs to. Therefore, it is designed as
where is a function determining the category that an object instance belongs to, which is defined as:
5.1 KITTI Dataset
In order to validate the proposed approach, we have conducted a series of experiments on the KITTI vision benchmark suite Geiger_CVPR2012 , which provides us with numerous color images and 3D point clouds. The data are captured by a PointGrey Elea2 video camera and a Velodyne HDL-64E 3D lidar that are jointly mounted on a vehicle. Each image is in the resolution of , and a 3D point cloud is of points or so, which covers a field of view (FOV). But only the points falling within the camera’s FOV are taken into consideration. The two modalities are registered to each other according to the sensors’ parameters provided on KITTI’s website.
Experiments are conducted on the ’City’, ’Residential’, and ’Road’ datasets, which contain a variety of complex scenarios on urban and highway roads, with the presence of vehicles, cyclists, pedestrians and other objects. The total number of images is 18529, among which 13765 images are randomly selected for the CRNN and the remaining 4764 images are used for evaluation. The details of the evaluation are stated below.
5.2 Evaluation of CRNN
The step of semantic reasoning via the CRNN is critical for our final results. Therefore, we first evaluate its performance. The input of the CRNN is an image patch obtained in the way introduced in Sec. 3. More specifically, we use the nearest neighbor clustering algorithm in the Point Cloud Library (PCL) Rusu_ICRA2011 to generate initial object hypotheses. The produced clusters that have a very small number of faraway points are discarded for robustness. Then, the image patches registered to these clustered 3D points are fed into the CRNN as inputs.
Each patch is resized to . In the CRNN Socher2012 , we set the size of a CNN filter to
and the number of filters is 128. Pre-training for CNN filters is performed by k-means clustering on 300,000 patches, randomly sampled from our training set. Average pooling is performed with pooling regions of size 8 and stride size 2 to produce 128 feature maps of the size of. The RNN receptive field size is set to , by which each feature map is recursively reduced to size , to , and finally to . Through four RNNs, the final feature for classification is .
We manually label all the patches extracted from images into seven object categories. The categories and their corresponding patch numbers are listed in Table 1. In each category, we randomly select patches for the CRNN training and the rest for the CRNN testing. We also horizontally flip the patches in the ’Cyclist’, ’Pedestrian’, and ’Sitter’ categories in order to double their training samples.
In this section, a set of comparative experiments are designed in order to investigate the performance of the CRNN with different input configurations. For instance, we compare the performance of the CRNN when using RGBD patches versus that of using RGB only. Moreover, although rectangular patches are fed into the CRNN, our algorithm is actually able to extract object regions. Therefore, we also compare the performance for patches with and without masks. The average recognition accuracy of each configuration is shown in Table 2. It shows that the CRNN performs the best when depth information is considered and the background is masked out.
In addition, we also present the confusion matrices in Fig. 4 to analyze the recognition performance further. These validate that the masked RGBD configuration achieves the least confusion in most of the categories. Besides this, we also make the following observations. First, among all the categories, ’Vehicle’, ’Roadside’, and ’Sitter’ are recognized with high accuracy, followed by ’Cyclist’, ’Pole’, and ’Greenbelt’. The ’Pedestrian’ category is most often confused. Second, we also observe that all categories are prone to be misclassified as ’Roadside’. The reason is that the ’Roadside’ category is of extremely high diversity, containing variant objects such as trees, buildings, windows of the buildings, barriers on the roadside, mailboxes, and so on. Without global information, many patches of other categories are easily to be viewed as these even by human beings. Third, ’Pedestrian’ is prone to be misclassified as ’Cyclist’, ’Pole’, or ’Roadside’ due to their similarity in shape. In all, the confusions are reasonable and the CRNN performs well.
5.3 Evaluation of Holistic Understanding
Before evaluating the performance of holistic understanding, let us first introduce the implementation details. The parameters involved in the joint problem are empirically set as as follows. The scaling factors defined in Eq. (1) are , , ; in Eq. (3), , ; in Eq. (6), ; and in Eq. (7), . Each Gaussian mixture model has five components. The algorithm is implemented in mixed Matlab/C and run on a desktop with an Intel Core i5 2300 and 12 GB memory. Our implementation has not yet been optimized for efficiency. The whole process is about per frame. Roughly, it takes about for loading and registering a 3D point cloud, for point clustering, for building the GMMs, for the CRNN, and for Graph Cuts inference.
Experiments are performed on the 4764 images that have not been used in the CRNN. In order to quantitatively evaluate the proposed approach, we randomly select 140 images and manually label them with both object-level segmentation and semantic category labels. When evaluating object-level segmentation, we choose the global consistency error (GCE) and the local consistency error (LCE), which are two criteria proposed by Martin et al. Martin_2001 for measuring consistency between two segmentation results. These criteria are designed to be tolerant to different numbers of segments arising from different perceptual levels when observing complex scenarios. For semantic labeling, the average accuracy, precision, recall, and F-measure are computed.
To investigate the performance, a group of comparative experiments is conducted. First, we are interested in how much improvement is achieved when incorporating depth information in the feature of the GMMs and integrating lidar points pivoted hard constraints (HC) into the object potential (in Sec. 4.1). According to whether location information is used and whether the HC is placed or not, we denote the algorithms by RGB, RGBXYZ, RGB_HC, and RGBXYZ_HC, respectively. For instance, literally, RGBXYZ_HC represents the algorithm using both color and location features and with hard constraints, and likewise for the others. Table 3 lists the quantitative comparison results. It shows that the incorporation of depth and hard constraints greatly improve the performance. A typical example is demonstrated in Fig. 5, which illustrates how these different configurations behave. From the segmentation, semantic labeling, and 3D reconstruction results in Fig. 5(d)(e)(f), respectively, we see that RGBXYZ_HC outperforms the other algorithms. Note that, both ’RGB’ and ’XYZ’ values of the feature are all scaled to [0, 255].
Finally, we investigate the performance of our holistic framework compared to the method that implements segmentation and semantic labeling separately. The quantitative comparison of object-level segmentation and average semantic labeling accuracy are listed in Table 3
(refering to ’Separate RGBXYZ_HC’ and ’Holistic RGBXYZ_HC’). From it we know that the holistic method achieves better performance in both segmentation and semantic labeling. To get a deeper insight, we also compare the precision and recall of each object category for semantic labeling, as listed in Table4. The object categories include the seven we introduced in the CRNN, together with ’Road’ and ’Sky’. The percentage of the pixels that each category holds is also listed for a reference and the total number of the pixels is
. This table shows that both the recall and precision of ’Pedestrian’, ’Pole’, and ’Greenbelt’ are increased in the holistic approach. Recall and precision of the other categories are either increased or decreased, which makes it difficult for us to tell the relative performance. Therefore, an F-measure that calculates the harmonic mean of the precision and recall is also provided. The F-measure of our holistic approach is improved for all categories, except ’Sky’ and ’Sitter’.
Fig. 6 demonstrates typical examples of how the holistic approach corrects both segmentation and semantic labeling results compared to the separated method. The improvements are presented in two aspects. On the one hand, the holistic approach can correct some segmentation errors produced by object-level segmentation. For instance, as shown in rows E to G, the separated method segments part of the roadside regions wrongly and these segmentation errors are inevitably propagated to the semantic labeling procedure. Rows H to J show that this type of errors is corrected by jointly tackling these two tasks. Such improvement benefits from the coherency considered between segmentation and semantic labeling in the holistic framework. On the other hand, the holistic approach can also correct some recognition errors of the CRNN. For example, some parts of the roadside are recognized as ’Car’ and ’Pedestrian’ in Fig. 6(b)F-G and Fig. 6(c)F-G, respectively, while with the consideration of geometrical context in our holistic framework, these recognition errors are corrected, as shown in rows I to J.
More experimental results of the holistic approach are presented in Fig. 7. From these examples, we observe that, although the scenarios are extremely diverse, our approach can correctly segment and recognize most of the objects, such as cyclists, pedestrians, cars, poles, and backgrounds. The segmented objects are of precise boundaries.
As presented above, we have conducted sets of comparative experiments. From these comparisons, we know that the integration of color and depth information highly improves the performance of both segmentation and semantic reasoning, and our holistic approach boosts the performance further. Of course, there is still room for improvement. For instance, too bright walls of buildings are easily segmented and labeled as ’Sky’ and parts of cars’ windows are often missed in segmentation and category labeling. These errors are mainly caused by missing lidar data. Therefore, they might be improved if the guided depth upsampling algorithm could perform better in large invalid regions.
In our experiments, we have not compared our algorithm with others’ work yet. The main reason is that, although there is some object detection evaluation platform available on KITTI’s website, to the best of our knowledge, there has been no work developed for object-level segmentation and semantic labeling tasks while integrating images and sparse lidar data.
6 Conclusions and Future Work
In this paper, we have presented an approach for holistic road scene understanding by integrating visual and range information. The approach has been validated by extensive experiments on the challenging KITTI dataset. Both qualitative and quantitative evaluations have been performed, which show that our algorithm is promising. In future, besides improving our algorithm in the aspects discussed above, we also plan to apply this work for large scale semantic urban modeling.
The authors would like to thank the anonymous reviewers for their helpful comments and suggestions. This research work was supported in parts by the National Natural Science Foundation of China via grants 61001171, 60534070 and 90820306, and by the Fundamental Research Funds for the Central Universities.
J. M. Alvarez, T. Gevers, A. M. Lopez, 3D scene priors for road detection, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2010, pp. 57–64.
- (2) W. Huang, X. Gong, J. Liu, Interfrating visual and range data for road detection, in: Proceedings of Ithe IEEE International Conference on Image Processing, 2013.
- (3) R. Benenson, M. Mathias, R. Timofte, L. Van Gool, Pedestrian detection at 100 frames per second, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 2903–2910.
- (4) Y. Liu, J. Guo, C. Chang, Low resolution pedestrian detection using light robust features and hierarchical system, Pattern Recognition 47 (4) (2014) 1616–1625.
- (5) T. H. B. Nguyen, H. Kim, Novel and efficient pedestrian detection using bidirectional PCA, Pattern Recognition 46 (8) (2013) 2220–2227.
Y. Jia, C. Zhang, Front-view vehicle detection by Markov chain Monte Carlo method, Pattern Recognition 42 (3) (2009) 313–321.
H. Cheng, R. Wang, Semantic modeling of natural scenes based on contextual Bayesian networks, Pattern Recognition 43 (12) (2010) 4042–4054.
- (8) E. Levinkov, M. Fritz, Sequential Bayesian Model Update under Structured Scene Prior for Semantic Road Scenes Labeling, in: Proceedings of the IEEE International Conference on Computer Vision, 2013.
- (9) C. Guo, S. Mita, D. McAllester, Hierarchical road understanding for intelligent vehicles based on sensor fusion, in: Proceedings of the International IEEE Conference on Intelligent Transportation Systems, 2011, pp. 1672–1679.
- (10) J. M. Alvarez, T. Gevers, Y. LeCun, A. M. Lopez, Road scene segmentation from a single image, in: Proceedings of the European Conference on Computer Vision, 2012, pp. 376–389.
- (11) W. Huang, X. Gong, Z. Xiang, Road Scene Segmentation via Fusing Camera and Lidar Data, in: Proceedings of the International Conference on Intelligent Robotics and Automation, 2014.
- (12) H. Cheng, R. Wang, Semantic modeling of natural scenes based on contextual Bayesian networks, Pattern Recognition, 43 (12) (2010) 4042–4054.
- (13) C. Jung, C. Kim, Real-time estimation of 3D scene geometry from a single image, Pattern Recognition, 45 (9) (2012) 3256—3269.
- (14) K. Matzen, N. Snavely, NYC3DCars: a dataset of 3D vehicles in geographic context, in: Proceedings of the IEEE International Conference on Computer Vision, 2013.
- (15) X. Ren, L. Bo, D. Fox, Rgb-(d) scene labeling: Features and algorithms, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2012, pp. 2759–2766.
- (16) J. Strom, A. Richardson, E. Olson, Graph-based segmentation for colored 3d laser point clouds, in: roceedings of the IEEE International Conference on Intelligent Robots and Systems, 2010, pp. 2131–2136.
- (17) J. P. C. Valentin, S. Sengupta, J. Warrell, A. Shahrokni, P. H. Torr, Mesh based semantic modelling for indoor and outdoor scenes, in: IEEE Conference on Computer Vision and Pattern Recognition, 2013, pp. 2067–2074.
- (18) M. Haselich, D. Lang, M. Arends, D. Paulus, Terrain classification with Markov random fields on fused camera and 3D laser range data, in: Proceedings of European Conference on Mobile Robotics, 2011, pp. 153–58.
- (19) S. Laible, Y. N. Khan, K. Bohlmann, A. Zell, 3D LIDAR-and camera-based terrain classification under different lighting conditions, Autonomous Mobile Systems, 2012, pp. 21–29.
- (20) J. Shotton, J. Winn, C. Rother, A. Criminisi, Textonboost: joint appearance, shape and context modeling for multi-class object recognition and segmentation, in: Proceedings of the European Conference on Computer Vision, 2006, pp. 1–15.
- (21) N. Silberman, R. Fergus, Indoor scene segmentation using a structured light sensor, in: Proceedings of the ICCV Workshops, 2011, pp. 601–608.
- (22) J. R. Schoenberg, A. Nathan, M. Campbell, Segmentation of dense range information in complex urban scenes, in: Proceedings of the IEEE International Conference on Intelligent Robots and Systems, 2010, pp. 2033–2038.
- (23) G. Zhao, X. Xiao, J. Yuan, Fusion of velodyne and camera data for scene parsing, in: Proceedings of Information Fusion, 2012, pp. 1172–179.
- (24) J. Diebel, S. Thrun, An application of markov random fields to range sensing, in Advances in Neural Information Processing Systems, (5) (2005) 291–298.
- (25) J. Liu and X. Gong, Guided depth enhancement via anisotropic diffusion, in advances in Multimedia Information Processing–PCM 2013, pp. 408–417.
- (26) R. Socher, B. Huval, B. Bath, C. D. Manning, A. Y. Ng, Convolutional-recursive deep learning for 3D object classification, in Advances in Neural Information Processing Systems, 2012, pp. 665–673.
- (27) M. Bleyer, C. Rother, P. Kohli, D. Scharstein, S. Sinha, Object stereo-joint stereo matching and object segmentation, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2011, pp. 3081–3088.
- (28) L’. Ladick, P. Sturgess, C. Russell, S. Sengupta, Y. Bastanlar, W. Clocksin, P. H. Torr, Joint optimization for object class segmentation and dense stereo reconstruction, International Journal of Computer Vision, 100 (2) (2012) 122–133.
- (29) C. Hane, C. Zach, A. Cohen, R. Angst, M. Pollefeys, Joint 3D scene reconstruction and class segmentation, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2013, pp. 97–104.
- (30) J. M. Gonfaus, X. Boix, J. Van de Weijer, A. D. Bagdanov, J. Serrat, J. Gonzalez, Harmony potentials for joint classification and segmentation, IEEE Conference on Computer Vision and Pattern Recognition, 2010, pp. 3280–3287.
- (31) G. Heitz, S. Gould, A. Saxena, D. Koller, Cascaded classification models: combining models for holistic scene understanding, in Advances in Neural Information Processing Systems, 2008, pp. 641–648.
- (32) D. Lin, S. Fidler, R. Urtasun, Holistic Scene Understanding for 3D Object Detection with RGBD cameras, in: Proceedings of the IEEE International Conference on Computer Vision, 2013.
- (33) C. Li, A. Kowdle, A. Saxena, T. Chen, Toward Holistic Scene Understanding Feedback Enabled Cascaded Classification Models, IEEE Transactions on Pattern Analysis and Machine Intelligence 34 (7) (2012) 1394–1408.
- (34) J. Yao, S. Fidler, R. Urtasun, Describing the scene as a whole: Joint object detection, scene classification and semantic segmentation, in: Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2012, pp. 702–709.
- (35) D. Munoz, J. A. Bagnell, M. Hebert, Co-inference for multi-modal scene analysis, in: Proceedings of the European Conference on Computer Vision, 2012, pp. 668–681.
- (36) L’. Ladick, P. Sturgess, K. Alahari, C. Russell, P. H. Torr, What, where and how many? combining object detectors and crfs, in: Proceedings of the European Conference on Computer Vision, 2010, pp. 424–437.
- (37) J. Tighe, S. Lazebnik, Understanding scenes on many levels, in: Proceedings of the IEEE International Conference on Computer Vision, 2011, pp. 335–342.
- (38) Y. Boykov, M. P. Jolly, Interactive Graph Cuts for optimal boundary & region segmentation of objects in ND images, in Proceedings of the IEEE International Conference on Computer Vision, 2001, pp. 105–112.
- (39) A. Geiger, P. Lenz, R. Urtasun, Are we ready for autonomous driving? The KITTI vision benchmark suite, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2012, pp. 3354–3361.
- (40) B. Douillard, J. Underwood, N. Kuntz, V. Vlaskine, A. Quadros, P. Morton, A. Frenkel, On the segmentation of 3d lidar pointclouds, in: Proceedings of the IEEE International Conference on Robotics and Automation, 2011, pp. 2798–2805.
- (41) M. A. Fischler, R. C. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM, 24 (6) (1981) 381–395.
- (42) PCL, Euclidean cluster extraction, 2013, http://www.pointclouds.org/documentation/tutorials/cluster_extraction.php
- (43) R. B. Rusu, S. Cousins, 3d is here: Point cloud library (pcl), in: Proceedings of the IEEE International Conference on Robotics and Automation, 2011, pp. 1–4.
- (44) C. Rother, V. Kolmogorov, A. Blake, GrabCut: interactive foreground extraction using iterated Graph Cuts, ACM Transactions on Graphics 23 (3)
- (45) D. Martin, C. Fowlkes, D. Tal, J. Malik, A database of human segmented natural images and its application to evaluating algorithms and measuring ecological statistics, in: Proceedings of the International Conference on Computer Vision, 2001, pp. 416–423.