The depth ordinal information of two objects (points) in an image is an important visual cue for many computer vision tasks such as objects classification[4, 5] and semantic segmentation [6, 7, 8]. The objective is to know which one is closer or further (or at the same depth) to the camera, given a pair of pixels. To estimate relative depth order, traditional methods mainly depends on objects’ boundary and junction characteristics such as T-junction, convexity/concavity and inclusion [9, 10, 11]. The accuracy of these methods is limited. Recently, Convolutional Neural Networks (CNNs) have achieved remarkable success on many vision tasks such as object recognition [12, 13, 14] and semantic segmentation [15, 16]. Motivated by the powerful visual representation and generalization capability, recent works [1, 2] of depth estimation have also used CNNs to estimate the ordinal information between the point pairs, and demonstrated superior performance. In [1, 2], both methods attempt to explore multiple features, which include the appearance of the points, the local contextual information, the global scene context and so on. The idea is to use the visual cues as much as possible to improve the models’ performance. Moreover, they both apply the multi-stream network structure. Zhou et al.  concatenates all the convolutional features. In contrast, Zoran et al.’s  network applies hierarchical concatenation of the convolutional features—the global feature first concatenates with the RoI mask and is fed into a fully connected layer, then concatenates with the other convolutional features and the masks.
Thus, the studies of the recent works have mainly focused on combining various contextual information to train a network, yet without demonstrating if each feature is useful. In this work, we attempt to achieve two objectives: 1) empirically examine the contribution of each context cue; 2) and present a practical model to estimate the ordinal depth information. As we show in the next sections, such an exploration has resulted in several interesting findings.
The global feature vs. the multi-scale local features. Following the insights presented in [1, 2], it makes sense to take advantage of more types of the contextual information for improving the accuracy of the model. However, neither of the them offers an analysis of the contributions of each cue. It is crucial to find if each cue plays an important role in the model. For an ineffective cue, we can remove it to make the model simpler. Motivated by this, we conduct an experiment to examine the effectiveness of each cue. Our result shows that the global scene context makes the least contribution in terms of the performance of the model. We provide the detailed explanation in Section III-A.
Consider two points (red and green) located in the purple bounding box in Fig. 2. If we remove the bookcase or the carpet from the scene, it would not affect the depth order of the points. We argue that the global structure of the scene is not necessarily useful for the task because the global information is redundant. Instead, the local context surrounding the points is critical. The local context contains abundant monocular cues such as occlusion, shadows, texture gradient and so on [17, 18, 19], which determine the relative depth of the objects. In this paper, we make CNN learn these relative depth cues by feeding the local background context surrounding the points. In particular, the context is in the form of multiple scales. Multi-scale features have an extended history application in computer vision and recently it has also been found very useful in the tasks like semantic segmentation [15, 16], stereo vision  and high-quality natural images producing , integrating with DCNN. Compared with the complex global structure, the local surrounding context is much simpler and easy to learn. Our experimental results show this simple change—that is, from learning the global context to learning the multi-scale local context—leads to a significant improvement in the performance.
Deepening the model with DenseNet Recently convolutional neural network has been witnessed to become deeper and deeper, from a few layers  to more than a thousand layers . Very deep network structures such as VGG , highway network , deep residual learning  have demonstrated the superiority in many applications [23, 13, 24, 25].
In this paper, we employ a novel deepening technique, namely densely connected network (DenseNet) , to obtain powerful visual representation and improve the performance. The method has been reported to achieve state-of-the-art performance on image classification tasks. Its principal characteristic is the dense connectivity. That is, each layer of the structure is directly connected to every other layer in a feed-forward way. It takes advantage of the feature reuse and strengthens feature propagation. By using the densely connected network, we have percent accuracy improvement compared with our baseline model proposed in Section III-B on the NYU Depth Dataset. We compare the DenseNet with the popular deepening technique, deep residual learning (ResNet)  to demonstrate its advantages.
Last, we integrate the learned prior (the outputs of the proposed model which are the probabilities of three ordinal relationships) into the energy minimization proposed by Zoran et al. , such that we obtain the relative depth of the entire image from the ordinal estimates. The key difference is that we solve the minimization in the log space and introduce a useful smoothness term, which improves the details of the recovered depth map.
In summary, our contributions are as follows.
1) We present a detailed experimental study on the usefulness the contextual information used in prior works [1, 2] by examining their effects for the task of depth order estimation.
2) We present a simple yet effective model, using the multi-scale framework and densely connected network, which makes the learning much easier and achieves state-of-the-art performance. However, our method only uses hundreds of training images, while recent state-of-the-art methods  usually used many more images (220K images) for training.
3) Last, we solve a constrained quadratic optimization problem similar to  to reconstruct the depth map from the ordinal estimations. We introduce a smoothness term to improve the result.
The rest of this paper is organized as follows. In Section II we summarize recent advances on ordinal relationship estimation and the CNN deepening techniques related to our work. In Section III, we present our method in detail, including the examination of the role of each context, describing the proposed model and how we reconstruct the depth map from the ordinal relationship of thousands of point pairs. In section IV, we provide quantities of experiments and analysis to validate the effectiveness of the proposed model.
Ii Related works
In this section, we briefly review the works of monocular relative depth estimation, in particular, those using CNN. Furthermore, we briefly review the characteristics of the current popular CNN deepening techniques.
Depth ordinal relationship estimation in monocular images Computer vision approaches handling monocular relative depth estimation were profoundly influenced by psycho-visual theory [17, 18], which suggests T-junctions as one of the fundamental of monocular depth perception. Many works relied on developing the computational model to interpret and extract the T-junctions in an image [9, 11, 8, 9, 10].
become available, thus leading to the trend of solving the problem as a supervised learning task using CNN. Pioneering work of Zoran et al. proposed an end-to-end system to estimate the depth order of points pairs. Compared with another ordinal estimation work which also utilized CNN , Zoran et al. add one more bounding box which contains the important visual cues for the task and a different location expression in their network structure. We consider such the design very practical, which makes the visual cues be automatically learned and inferred by CNN. Since the NYU and KITTI datasets have no direct annotations for the task, Chen et al.  proposed a dataset named Depth in the Wild (DIW) which annotated the ordinal depth information between point pairs. Their deep model is an deep ranking model, and the output is a relative depth map.
Our network is an end-to-end system. The output is the same as in [1, 2], which are three relationships, namely, “further”, “closer” and “the same”. However, we employ different input context cues and a much deeper architecture. We describe the details in the next section.
. The deepening of CNN is not merely repeating the ‘Convolution-Relu-Pooling’ process. With increasing the depth of a plain network, the performance of a deep model was often observed worse than a shallower model, due to the gradient vanishing and the optimization becoming underfit. To address the issues, a well-designed structure is needed. In VGG ,
filters are used throughout, and the entire network is divided into several blocks. Convolutional layers are stacked in the block. Between the blocks, the max pooling operation is used to reduce the feature map size. This design highly influences network structures proposed in recent years, as nowadays most of the structures useconvolutional filters and the block by block structure.
The characteristic of Inception network  is that their structure is not only deep but also very wide. In their block, several streams with different filter sizes (, ) are applied. ResNet  is the most successful network structure since it well alleviates the gradient vanishing problem. It is worth mentioning the highway network  because its underlying principle is similar to ResNet. ResNet applies skip connections and sum up the feature map every two or three layers to enhance the information flow, which is termed residual learning. Relying on residual learning, ResNet can extend its depth to more than a thousand layers and still achieves impressive performance.
The densely connected network is a new deep structure proposed by Huang et al. . It takes advantage of the above useful designs such as small filters (, ), block by block structure (yet apply average pooling) and skip connection as well. In particular, its primary characteristic is the dense connectivity, which leads to the heavy feature reuse, information flow propagation, and good regularization. Considering these advantages, we apply the DenseNet in our proposed model. To verify our choice, we compare its effectiveness against ResNet and the baseline model, respectively. We observe the improvement over the proposed baseline model. The details are shown in Section IV.
Iii Estimation of the depth order of a pair of points
Estimating the depth order of point pairs is to explore the points’ 3D relationship. It is very challenging, as the only information that we use is the 2D appearances. We propose to tackle this complex problem in multiple stages.
Firstly, since the quality of input features plays an important role in the training process, we analyze the effectiveness of the input feature (context) used in the state-of-the-art works [1, 2] by conducting a series of ablation experiments. We observe several interesting findings in the experiments. Secondly, based on the findings, we present the multi-scale model to make better use of the local contextual information surrounding the points. The method is simple, which extracts three gradually increased bounding boxes around the points (shown in Fig. 2) and feeds the contents of the bounding boxes into a deep CNN, instead of the global scene context used in [1, 2]. Thirdly, motivated by the recent success of very deep CNN, we manage to obtain the better performance by using the DenseNet  to deepen the proposed model. To provide a reference, we compare the performance of the DenseNet with the ResNet  when they are both used to deepen the proposed model. Last, we reconstruct the depth map from the outputs of the proposed model to deliver an intuitive impression of the quality of the estimates.
Most of depth datasets such as the NYU dataset V2  and KITTI  do not provide the annotations for ordinal estimation. Thus before estimating the ordinal relationship, we need to determine which pairs of points should be sampled in an image, then extract the required contextual information according to the selected points. We employ the strategy proposed by Zoran et al.  to achieve the goal. We over segment an image into many superpixels  and pick the centroid of the superpixels as the selected points. We then paired the points with their second-order neighbors to compare the depth order. The method is simple yet effective since a superpixel varies very smoothly and the centroid of the superpixel can represent the other points within it. Fig. 3 depicts an example of the selected points in an image and how the points are paired. After extracting the context, we start to examine the effectiveness of the context.
Iii-a Examining the contextual information used for depth order estimation
The contextual information used in recent works [1, 2] has three types: the local contextual information, the global scene context, and the location information. As illustrated in Fig. 2, the local contexts are two patches on the comparison points and a bounding box surrounding the patches. The global context is a downscaled version of the input image. The location information that we use here is the mask. Note that in Zoran’s model , the bounding box is considered as the global scene context. We would like to label it local context since it contains the local structure in an image.
We carry out a series of ablation experiments to examine the effectiveness of these contexts for the task. Before starting the experiments, we need to complete several preparations. Firstly, we simplify Zoran’s model to make it more intuitive. The simplified model that we utilize is shown in Fig. 3(d). It removes three fully connected layers from Zoran’s model (the first one is next to the concatenation of ROI and Downscaled Image, the second one is next to BB, the last one is next to the fully connected layer which has 300 outputs). However, the number of convolutional layers and the parameter setting of the corresponding convolutional layer in the simplified model, such as the filter size and stride, are the same with Zoran’s. We split the simplified model into several basic components according to their types. There basic components are the patches, the bounding box, the masks and the downscale version of the image.
We start the experiments from only one component and test its performance, then gradually add other components one by one into the model and repeat the test. In this procedure, if the performance is improved, we can conclude the feature is likely to be effective for the task. If not, then the feature is not useful. Our test is conducted on the NYU depth dataset. Since the task is to learn the relationship between the points’ appearances and the depth order, the first basic component that we keep in the model is the streams of two points’ appearances (the patches). In the next round of test, we add the remaining components following the order of adding the bounding box—adding the masks—adding the downscaled image. In every round we test 10 times and select the most accurate result as the model’s best performance. Everytime we test a new component, we fine tune the model from the previous model of the best performance. We present the results in the Table I.
|Method||Accuracy of the predictions|
|Baseline (The patches)||47.5%|
|Zoran et al. ||59.6%|
We test the accuracy of the predictions to measure the performance of the models. We take the result of the basic component model as the baseline. We also test the accuracy of Zoran’s model to show the difference in the performance between the original model and the simplified model. Our baseline (Fig. 4(a)) achieves . Adding the bounding box component (Fig. 4(b)) leads to a significant improvement—the accuracy increases to . Applying the masks (Fig. 4(c)) gains a significant improvement as well: the accuracy further increases to . However, the accuracy decreases to after adding the downscaled image (Fig. 4(d)). Zoran’s model achieves accuracy which is almost more than our simplified model.
We see three findings from the experiments:
1) The local background context and the location information are highly useful for the task; From the experiments, they contributes the most for the increase of the performance;
2) The global structure may not be required for the task, since adding the global scene context (the downscaled image), the performance shows a slight degradation;
3) The complex network structure, such as the hierarchy concatenation of the different streams  in the original Zoran’s model, is also helpful for improving the performance.
Why would adding the global structure result in performance degradation? In theory, the global context has the global structure information which certainly contains the structure of the local context. Thus it should be helpful to boost the performance as well. We argue that the global structure may not be well learned, as its structure, which only has two layers, may not be able to efficiently learn the semantic content of the scene.
A recent work 
by Gonzalez et al. investigates the responses of convolutional filters with semantic parts to analyze the internal representation of CNN. They argue that when CNNs handle the tasks like scene classification, it needs to be very deep, because the task is less related to object parts. According to their finding, we can deepen the network to make more convolutional filters response to the semantic parts of the scene. To demonstrate this point of view, we deepen the stream of the downscaled image from two layers to four layers. We set the filter size of the four layers as. The first two layers’ stride is 2 and the last two layers’ stride is 1. As we expected, the accuracy increases to , which is slightly better than non-downscaled-image model in Fig. 4(c). Gonzalez et al. suggest very deep architectures such as VGG  for various tasks since it has abundant semantic parts for finetuning. Coincidentally, Chakrabarti et al.  also utilize VGG to extract the coarse global structure of an image for absolute depth estimation. As a comparison, training from scratch with such a shallow depth is not ideal.
Iii-B The proposed baseline model
As discussed, extracting the global structure from an image is very challenging, and most of the structure is not helpful to estimate the depth order of the points. Thus we choose a different route. We first look at the promising results from the deep visual correspondence embedding model  for inspiration to make better use of the local context. The model from  achieves improved accuracy of stereo matching by proposing an ensemble model of two patch scales. The large patches with richer information are less ambiguous, and the small patches have merits in details. The model combines the best of two worlds. We hypothesized that this may work better to learn the local structure from observing the local backgrounds at multiple scales with different sizes of contexts.
Therefore, we propose a multi-scale model to incorporate multi-scale local background contexts. We add two larger bounding box scales with the fields of view of 2.25, 4 of the original bounding box (shown in Figure 6) all surrounding the points pair. In each stream of the model, we utilize strided convolution of four layers for feature map downsampling. The output features from the patches and multi-scale local surroundings are concatenated with the location information and fed into a fully-connected layer with 400 outputs. We train the network end-to-end with the log-softmax loss.
The proposed model encourages to aggregate the multi-scale contextual information. We consider that three scales may be ideal for learning the crucial visual cues for the task. We set the model as a baseline in Section IV. In the next subsection, we show how to push the limit of the performance by deepening the proposed model.
Iii-C Deepening with densely connected networks
We employ the densely connected networks proposed by Huang et al.  to deepen the proposed model. As we have introduced, it is a very deep CNN structure. The particular design of the network is the dense connectivity. In a densely connected network, the dense connectivity denotes that for each layer, it connects with all the other layers in the network. See Fig. 7(b). The characteristic differs from the pattern of traditional CNN, of which each layer is only connected with its adjacent layers. In a densely connected network, the feature maps of the early layers are concatenated as the input of the later layer. For the layer, it receives the feature maps of all preceding layers, i.e.,
Here36]37]. As the number of the connections grows quadratically with the depth, Huang et al. provide two solutions to control the growth. The first one is that they present a hyper-parameter as the growth rate of the network. This growth rate is representing the number of the outputs in a layer. For instance, denotes that all the layers in the densely connected network have 12 output feature maps. The other one is dividing the entire network into several blocks. Thus the dense connectivity is only applied within the blocks. Between the blocks, average pooling is used to downsample the feature map.
Now we show how to integrate the densely connected network in the proposed baseline model. As shown in Fig. 5, the idea is simple: the model contains four densely connected blocks with equal numbers of layers and average pooling layers in the streams of the multi-scale local context inputs. In these deepened streams, all the convolutional layers use filters with kernel size , stride 1 with zero-padding to keep the feature map size fixed. The length of the layers in each densely connected block is 5 and the growth rate is 12. Note that, we have not deepened the streams of two points’ appearance. Since the selected points for comparison often locate in the smooth area, the appearances of the points rarely have complex textures and edges. In contrast, the multi-scale local contexts have abundant visual cues and textures, which should apply the deep structure.
We demonstrate its benefit of enhanced feature reuse and alleviating the vanishing gradient issue through the experiments in Section IV. The results show that with deepening, our model achieves a significant improvement. Moreover, we take one step further to provide a reference of its deepening effect by comparing it with the state-of-the-art deepening technique ResNet proposed by He et al. . We take one ResNet block for illustration, which is shown in Fig. 7. The characteristic of ResNet is utilizing skip connections to add up the feature maps every two or three layers to encourage the information flow. A residual block has several different structures. The one that we use here is “bottleneck,” which is one convolution surrounded by dimensionality reducing and expanding convolution layers . For the test configuration, we simply change the DenseNet blocks in the multi-scale streams to the ResNet “bottleneck” blocks and use max pooling operation instead of average pooling. We provide a comprehensive analysis of the deepening effect performance of both methods in the Section IV.
Iii-D Recovering the depth map
Reconstructing the depth map from the estimates is to infer the global relationship of the selected points (we use each selected point to represent its superpixel) from the local relationship of point pairs. It is challenging since a considerable part of the estimated relationship between the points can be contradictory or ambiguous. We adopt the method proposed by Zoran et al.  to find the global solution, which poses this as a constrained quadratic optimization problem. In contrast to their approach, we solve the problem in log-space and introduce a smoothness term which is a reasonable prior for the task. Our objective is as follows:
where is the energy function as follows,
where , are the depth values of the selected pixels. is the depth ordinal estimation (the outputs of the proposed model which are the probabilities for three cases) of the -th pair. is a scalar slack variable for the ij-th pair. is distance which penalizes the depth estimate when it disagrees with the estimates of the proposed model, which consists of
is the proposed smoothness term for the adjacent superpixels:
It is weighted by the sum of local image gradient and the estimate of ‘equal’ case of the adjacent superpixels, which is
where controls the sensitivity of the image gradient-based weight, and control the proportion of the two terms in the above equation.
In the experiment, we set . Note that, we only consider adjacent superpixels. For non adjacent neighors, . The last term is a regularization term to bound the , which is
where the mean values
and the variancesare computed from the statistics of the training set, corresponding to ‘equal’, ‘further’ and ‘closer’ cases, respectively.
For the objective Equ. (1), are the lower and upper bonds for the depth values. Once the objective is solved, we generate the depth map by floodfilling each superpixel with the corresponding values.
We demonstrate the effectiveness of the proposed model on three datasets including the NYU depth V2 dataset , KITTI dataset  and DIW dataset . The experiments are organized in two categories:
1) We compare the proposed model with several baseline methods to show the benefits of integrating the multi-scale features and DenseNet structure;
2) We compare the proposed model with the state-of-the-art methods on each dataset to show that our method performs better.
The implementation is in Caffe. The contexts are extracted and resized to the specific resolutions as the inputs to the network. We show the size of each input in Table III. The kernel size, the stride, the outputs number of each layer are reported in Table III. Note that for the streams of the scales 1, 2, 3 in Fig. 5, the ‘layer 1/2/3/4’ means each convolutional layer before the corresponding DenseNet blocks. For each DenseNet block, kernel size with zero padding are used in it to keep the feature size fixed and the growth of the DenseNet is 5.
|Input Context||P1/P2||Scale 1||Scale 2||Scale 3||Mask|
|Stream||P1/P2||Scale 1/Scale 2/Scale 3|
|layer 1||,no pooling||
|layer 2||,no pooling||
|layer 3||,no pooling||
|layer 4||,no pooling||
The network is learned end-to-end using a log-softmax loss. We train the model from scratch and use stochastic gradient descent (SGD) for optimization. For NYU V2 and KITTI depth datasets, we trained 300k iterations with mini-batches of 256 pairs, for DIW, 400k iterations with mini-batches of 128 pairs. The weight decay is 0.0005. We use an NVIDIA GeForce Titan X GPU, on which training process takes roughly 5 hours. For the ablation experiments, we reduce the training iterations to 200k. The other settings keep the same.
Metric error measure We utilize Weighted Kinect Disagreement Rate (WKDR)  metric, which is an average disagreement rate, to evaluate all the methods’ performance.
where x is the estimated depth map. We set the tolerance level which is the same with . is the annotation of the depth order of -th pair. are the depth values of two points in a pair.
Baseline settings To demonstrate the effectiveness of the multi-scale features and the deepening technique, we present three baseline methods:
Baseline A: The first baseline is a single scale model without deepening. It is a simplified version of the proposed basic model in the Section III-B, which removes the scale 2, scale 3 streams. The method is expected to show the fundamental performance without multi-scale architecture and any deepening method.
Baseline B: The second baseline is the single scale model with deepening (DenseNet block added in the scale 1 stream). By comparing with Baseline A, we will see the difference of the single scale model before and after deepened.
Baseline C: The last baseline is the proposed basic model in Section III-B, i.e. multi-scale without deepening. By comparing with Baseline B, we can explore as to whether deepening or using a multi-scale architecture provides the bigger improvement in performance.
We carry out the baseline comparisons compared against the proposed model on all the datasets.
Iv-a NYU Depth Dataset
The NYU depth dataset  is a large depth benchmark for indoor scenes, which is collected by a Microsoft Kinect sensor. It consists of 464 indoor scenes and more than 400k images with the resolution of . We use its densely labeled dataset, which has 1449 pairs of aligned RGB and depth images. We use its official train/test split, that is 795 images for training, 654 images for testing. We sample 1600 pairs per image for training and 800 pairs per image for testing. That is totally 127.2 million pairs of points for training and 52.3 million pairs for testing. We consider the number of the training data enough thus we do not apply any data augmentation.
Baseline comparisons The results are reported in Table IV. As we can see, applying the multi-scale features without deepening provides larger performance improvement than deepening on a single stream. Meanwhile deepening the streams of the model is very useful to boost the performance. Among the methods, our model performs the best.
|The proposed model||33.9%||32.1%||38.5%|
Comparisons of deepening methods The second experiment is the comparison test of applying two deepening technique according to Section III-C. The basic model is the proposed multi-scale model without deepening, which we used as Baseline C. As shown in Table V, the methods both help improve the performance. Yet DenseNet outperforms than ResNet. In the training process of ResNet, we observe the overfitting phenomenon. We hypothesize the issue is caused by the duplicated features and the excessive filter numbers of the ResNet block. The three scale features are duplicated due to the overlapping area of the contexts (they overlap at the scale 1 area). In the case, the model needs the regularization to avoid the risk of overfitting the duplicated feature space. However, the ‘bottleneck’ structure of the ResNet has 64, 64, 256 filters in a block, whose total filter number is six times more than a DenseNet block that we use, which means that the ResNet has a greater chance to overfit the data than the DenseNet. Thus we use the DenseNet model, and the experimental result demonstrates that the method works well for the proposed model.
|The basic model||35.9%|
State-of-the-art comparisons The state-of-the-art methods for comparison on the dataset are Eigen et al. , Zoran et al.  and Chen et al. . Note that, all the methods train and test their models on the densely labeled data, yet Chen and Eigen additionally use the raw dataset which contains more than 290k sparsely labeled depth images to achieve the better performance.
Since the numbers of training images in the densely labeled data and the raw NYU dataset are vastly different, the performances of the models trained on each dataset are reported separately in Table VI. We first focus on the upper part of the table which shows the results of the models trained on the densely labeled data. An interesting observation from the table is that our one scale model (baseline B) already significantly outperforms than Zoran et al.’s result and is slightly better than Chen et al. . Note that Chen et al. apply more than 12k points pairs per image for training, while we only need 1.6k pairs. Our multi-scale model achieves the state-of-the-art performance on the densely labeled dataset.
|Zoran et al. ||43.5%||44.2%||41.4%|
|Chen et al. ||38.7%||39.7%||39.4%|
|Chen et al. ||28.7%||31.2%||28.7%|
The bottom part of the table shows the results of the models trained on the raw NYU dataset. Although the number of training data is very different, the performance of the proposed model is still comparable to Eigen et al. . The improvement of Chen et al.’s model from two datasets demonstrates the large training data can greatly boost the performance of the DCNN.
However, for the proposed model, training on the raw NYU dataset can be very time-consuming and also needs massive hard disk space. Because the time of generating the contexts of the points pairs and converting these small image patches to the data format that CAFFE can fast read increases with the training data. We believe the results of training on the densely labeled data have already demonstrated the superiority of the proposed model.
In Fig. 8, we show four example depth maps reconstructed from the depth ordinal predictions. Compared with Zoran et al. , our results (Column 3) demonstrate more accurate reconstruction. For instance, in the first example, the furthest region reconstructed by Zoran et al. is the cabinet on the upper right corner. We manage to find the correct area which is the wall on the left side of the cabinet. The other advantage of our results is the smoothness, such as the three ceiling lamps in the third example, compared with Zoran et al.
Iv-B KITTI dataset
The KITTI dataset  is a large and comprehensive dataset for benchmarking the autonomous driving techniques. It contains a number of outdoor scenes for depth estimation, which has five broad categories: ‘City,’ ‘Residential,’ ‘Road,’ ‘Campus’ and ‘Person’.
We choose ‘City’ raw dataset for evaluation which includes 27 scenes. We use the train-test split index of the scenes provided by Eigen  in the ‘City’ category, i.e., 18 scenes for training and 9 scenes for testing.
The dataset has no direct annotations for the task. Therefore we use the same method as we did in the NYU depth dataset to generate the annotations. Since the data of each scene is a video sequence, the content of each frame in the same scene has a lot of redundancy. Thus we sparsely sample 200 points pairs per image, which is much less than the number in the NYU dataset to avoid the duplicate pairs. We gather in total 815k pairs for training and 450k pairs for testing. Note that, the ground-truth depths of the KITTI dataset are scattered at irregularly spaced points, which only consists of pixels of each image, we extract the ground-truth depth closest to each superpixel centroid as the superpixel depth and floodfill the superpixels with the relative depth values.
Baseline comparisons The baseline comparisons on the KITTI dataset are reported in Table VII. We observe two interesting phenomena.
Firstly, the performances of predicting the equal case and the unequal case are very different. We argue that it is caused by learning the data of unbalanced distribution. The structure of the road scene is that a road is always in the center and the buildings on the two sides are along the road, which makes the KITTI dataset has a distinct pattern that the ground truth depth increases with the road’s direction. Owing to the pattern, the unequal case accounts for the most of the points pairs, roughly of the total number of each image. Thus the unequal case is learned very well, yet the equal case is not.
Secondly, with the multi-scale feature and the DenseNet block added, the performance of predicting the equal case show a much more significant improvement than the unequal case.
|The proposed model||25.8%||66.9%||20.6%|
State-of-the-art comparisons We compare the performance with the state-of-the-art method Eigen et al. . The proposed method achieves the state-of-the-art performance and the recovered examples in Fig. 9 show that the overall structures and the crisp edges at depth discontinuities are captured.
|Eigen et al.||26.3%||64.7%||21.2%|
Iv-C Depth In the Wild dataset
The Depth in the Wild (DIW) dataset  is a recently released dataset for relative depth estimation. The points pairs are human-annotated. Thus we do not need to manually pick the points and generate the labels. The resolutions of the images are not fixed, roughly at . The dataset uses more than 421k images for training and 74k images for testing. For each image. It only annotates one pair of the points. Thus we have 421k pairs of the points for training and 74k pairs for testing.
Different from the previous datasets, the DIW dataset has two distinct characteristics:
1) The selected points in each image has a relative longer distance between each other, compared with the points pairs generated in the NYU and KITTI datasets, and a lot of points pairs locates at the same row or column;
2) More importantly, the dataset only considers two cases, ‘closer’ and ‘further’, where the ‘equal’ case is removed. Thus for the dataset, WKDR metric is equal to . For the first characteristic, we change the three-scale bounding boxes generating strategy: for the points pairs locating in the same row or column, we extract the three scale bounding boxes, whose height or width are 20 pixels, 40 pixels, and 60 pixels, centered on the line between the points; for the other points pairs, we use the same strategy reported in Fig. 6.
Baseline comparisons The baseline comparisons on the DIW dataset are reported in Table IX. The proposed model outperforms the other baseline methods.
|Method||Baseline A||Baseline B||Baseline C||
State-of-the-art comparisons We compare the proposed model with Chen et al. . We follow their method to show the performance in two ways: 1) training the model from scratch; 2) pretrain on the NYU depth dataset then finetune on the DIW dataset.
The results are reported in Table X. The results show that each model has its own merits. Our model significantly outperforms Chen et al., when both are trained from scratch. While their model has made a considerable improvement when pretrain and finetune from the NYU depth raw dataset and achieved a much better result than ours. Their pretrain model is based on the NYU raw dataset which has a much lower error rate than our pretrained model (see Table VI) and gains powerful visual representation. The benefits help improve their result.
Predicting the depth order of the points pairs is a challenging task. By effectively exploring the contexts surrounding the points and deepening the network, it can be performed very well. The proposed framework accomplishes this through the use of the multi-scale local contexts and the DenseNet technique. We achieve state-of-the-art on the task for several datasets with the advantage of using much fewer training data. Future work will extend to solve other mid-level vision issues such as intrinsic image decomposition and improve the framework to exploit more data.
-  D. Zoran, P. Isola, D. Krishnan, and W. T. Freeman, “Learning ordinal relationships for mid-level vision,” in The IEEE International Conference on Computer Vision (ICCV), December 2015.
-  T. Zhou, P. Krahenbuhl, and A. A. Efros, “Learning data-driven reflectance priors for intrinsic image decomposition,” in The IEEE International Conference on Computer Vision (ICCV), December 2015.
-  G. Huang, Z. Liu, K. Q. Weinberger, and L. van der Maaten, “Densely connected convolutional networks,” arXiv preprint arXiv:1608.06993, 2016.
M. Enzweiler, A. Eigenstetter, B. Schiele, and D. M. Gavrila, “Multi-cue
pedestrian classification with partial occlusion handling,” in
Computer vision and pattern recognition (CVPR), 2010 IEEE Conference on. IEEE, 2010, pp. 990–997.
-  P. Smith, T. Drummond, and R. Cipolla, “Layered motion segmentation and depth ordering by tracking edges,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 4, pp. 479–494, 2004.
-  Z. Zhang, A. G. Schwing, S. Fidler, and R. Urtasun, “Monocular object instance segmentation and depth ordering with cnns,” in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 2614–2622.
-  E. C. Hildreth and C. S. Royden, “Integrating multiple cues to depth order at object boundaries,” Attention, Perception, & Psychophysics, vol. 73, no. 7, pp. 2218–2235, 2011.
-  A. Kowdle, A. Gallagher, and T. Chen, “Revisiting depth layers from occlusions,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013, pp. 2091–2098.
-  F. Calderero and V. Caselles, “Recovering relative depth from low-level features without explicit t-junction detection and interpretation,” International journal of computer vision, vol. 104, no. 1, pp. 38–68, 2013.
-  G. P. Visa and P. Salembier, “Precision-recall-classification evaluation framework: Application to depth estimation on single images,” in European Conference on Computer Vision. Springer, 2014, pp. 648–662.
-  Z. Jia, A. Gallagher, Y.-J. Chang, and T. Chen, “A learning-based framework for depth ordering,” in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on. IEEE, 2012, pp. 294–301.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” inAdvances in neural information processing systems, 2012, pp. 1097–1105.
-  K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” CoRR, vol. abs/1409.1556, 2014.
-  K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” arXiv preprint arXiv:1512.03385, 2015.
-  G. Lin, C. Shen, A. van den Hengel, and I. Reid, “Efficient piecewise training of deep structured models for semantic segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 3194–3203.
-  L.-C. Chen, Y. Yang, J. Wang, W. Xu, and A. L. Yuille, “Attention to scale: Scale-aware semantic image segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 3640–3649.
-  I. P. Howard, Perceiving in depth, volume 1: basic mechanisms. Oxford University Press, 2012.
-  R. B. J. Howard I, Perceiving in depth, volume 3: Other mechanisms of depth perception. Oxford University Press, 2012.
-  C. C. Fowlkes, D. R. Martin, and J. Malik, “Local figure–ground cues are valid for natural images,” Journal of Vision, vol. 7, no. 8, pp. 2–2, 2007.
-  Z. Chen, X. Sun, L. Wang, Y. Yu, and C. Huang, “A deep visual correspondence embedding model for stereo matching costs,” in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 972–980.
-  E. L. Denton, S. Chintala, R. Fergus et al., “Deep generative image models using a￼ laplacian pyramid of adversarial networks,” in Advances in neural information processing systems, 2015, pp. 1486–1494.
-  R. K. Srivastava, K. Greff, and J. Schmidhuber, “Highway networks,” arXiv preprint arXiv:1505.00387, 2015.
-  X.-J. Mao, C. Shen, and Y.-B. Yang, “Image denoising using very deep fully convolutional encoder-decoder networks with symmetric skip connections,” arXiv preprint, 2016.
-  S. Zagoruyko and N. Komodakis, “Wide residual networks,” arXiv preprint arXiv:1605.07146, 2016.
-  S. Xie and Z. Tu, “Holistically-nested edge detection,” in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 1395–1403.
-  A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” 2009.
-  Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Y. Ng, “Reading digits in natural images with unsupervised feature learning,” in NIPS workshop on deep learning and unsupervised feature learning, vol. 2011, no. 2, 2011, p. 5.
-  W. Chen, Z. Fu, D. Yang, and J. Deng, “Single-image depth perception in the wild,” CoRR, vol. abs/1604.03901, 2016. [Online]. Available: http://arxiv.org/abs/1604.03901
-  N. Silberman, D. Hoiem, P. Kohli, and R. Fergus, “Indoor segmentation and support inference from rgbd images,” in European Conference on Computer Vision. Springer, 2012, pp. 746–760.
-  A. Geiger, P. Lenz, C. Stiller, and R. Urtasun, “Vision meets robotics: The kitti dataset,” The International Journal of Robotics Research, p. 0278364913491297, 2013.
-  M. Menze and A. Geiger, “Object scene flow for autonomous vehicles,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 3061–3070.
-  C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2015, pp. 1–9.
-  R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Süsstrunk, “Slic superpixels compared to state-of-the-art superpixel methods,” IEEE transactions on pattern analysis and machine intelligence, vol. 34, no. 11, pp. 2274–2282, 2012.
-  A. Gonzalez-Garcia, D. Modolo, and V. Ferrari, “Do semantic parts emerge in convolutional neural networks?” arXiv preprint arXiv:1607.03738, 2016.
-  A. Chakrabarti, J. Shao, and G. Shakhnarovich, “Depth from a single image by harmonizing overcomplete local network predictions,” in Advances in Neural Information Processing Systems, 2016, pp. 2658–2666.
-  S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” arXiv preprint arXiv:1502.03167, 2015.
-  X. Glorot, A. Bordes, and Y. Bengio, “Deep sparse rectifier neural networks.” in Aistats, vol. 15, no. 106, 2011, p. 275.
-  D. Eigen and R. Fergus, “Predicting depth, surface normals and semantic labels with a common multi-scale convolutional architecture,” in The IEEE International Conference on Computer Vision (ICCV), December 2015.
-  Y. Jia, E. Shelhamer, J. Donahue, S. Karayev, J. Long, R. Girshick, S. Guadarrama, and T. Darrell, “Caffe: Convolutional architecture for fast feature embedding,” in Proceedings of the 22Nd ACM International Conference on Multimedia, ser. MM ’14. New York, NY, USA: ACM, 2014, pp. 675–678. [Online]. Available: http://doi.acm.org/10.1145/2647868.2654889