SuperDepth: Self-Supervised, Super-Resolved Monocular Depth Estimation

10/03/2018 ∙ by Sudeep Pillai, et al. ∙ 0

Recent techniques in self-supervised monocular depth estimation are approaching the performance of supervised methods, but operate in low resolution only. We show that high resolution is key towards high-fidelity self-supervised monocular depth prediction. Inspired by recent deep learning methods for Single-Image Super-Resolution, we propose a sub-pixel convolutional layer extension for depth super-resolution that accurately synthesizes high-resolution disparities from their corresponding low-resolution convolutional features. In addition, we introduce a differentiable flip-augmentation layer that accurately fuses predictions from the image and its horizontally flipped version, reducing the effect of left and right shadow regions generated in the disparity map due to occlusions. Both contributions provide significant performance gains over the state-of-the-art in self-supervised depth and pose estimation on the public KITTI benchmark. A video of our approach can be found at



There are no comments yet.


page 1

page 3

page 5

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Robots need the ability to simultaneously infer the 3D structure of a scene and estimate their ego-motion to enable autonomous operation. Recent advances in Convolutional Neural Networks (CNNs), especially for depth and pose estimation 

[1, 2, 3, 4] from a monocular camera have dramatically shifted the landscape of single-image 3D reconstruction. These methods cast monocular depth estimation as a supervised or semi-supervised regression problem, and require large volumes of ground truth depth and pose measurements that are sometimes difficult to obtain. On the other hand, self-supervised methods in depth and pose estimation [5, 6, 7] alleviate the need for ground truth labels and provide a mechanism to learn these latent variables by incorporating geometric and temporal constraints to effectively infer the structure of the 3D scene.

Recent works [6, 7, 8] in self-supervised depth estimation are limited to training in lower-resolution regimes due to the large memory requirements of the model and their corresponding self-supervised loss objective. High resolution depth prediction is, however, crucial for safe robot navigation, in particular for autonomous driving where high resolution enables robust long-term perception, prediction, and planning, especially at higher speeds. Furthermore, simply operating at higher image resolutions can be shown to improve overall disparity estimation accuracy (Section IV). We utilize this intuition and propose a deep architecture leveraging super-resolution techniques to improve monocular disparity estimation.

Figura 1: Illustration of the accurate and crisp disparities produced by our method from a single monocular image. Our approach combines techniques from Single-Image Super-Resolution (SISR) [9]

and spatial transformer networks (STN) 

[10] to estimate high-resolution, and accurate super-resolved disparity maps.

Contributions: We propose to use subpixel-convolutional layers to effectively and accurately super-resolve disparities from their lower-resolution outputs, thereby replacing the deconvolution or resize-convolution [11] up-sampling layers typically used in the disparity decoder networks [12, 7]. Second, we introduce a differentiable flip-augmentation layer that allows the disparity model to learn an improved prior for disparities at image boundaries in an end-to-end fashion. This results in improved test-time depth predictions with reduced artifacts and occluded regions, effectively removing the need for additional post-processing steps typically used in other methods [6, 13]. We train our monocular disparity estimation network in a self-supervised manner using a synchronized stream of stereo imagery, relieving the need for ground truth depth labels. We show that our proposed layers provide significant performance gains to the overall monocular disparity estimation accuracy (Figure 1), especially at higher image resolutions as we detail in our experiments on the public KITTI benchmark.

Ii Related Work

The problem of depth estimation from a single RGB image is an ill-posed inverse problem. Many 3D scenes can indeed correspond to the same 2D image, for instance because of scale ambiguities. Therefore, solving this problem requires the use of strong priors, in the form of geometric [6, 7, 14], ordinal [15], or temporal constraints [8, 7, 16]. Another effective form of strong prior knowledge is statistical in nature: powerful representations learned by deep neural networks trained on large scale data. CNNs have indeed shown consistent progress towards robust scene depth and 3D reconstruction [14, 17, 18]. State-of-the-art approaches in leveraging both data and structural constraints mostly differ by the type of data and supervision used.

Supervised Depth Estimation  Saxena et al. [19] proposed one of the first monocular depth estimation techniques, learning patch-based regression and relative depth interactions using Markov Random Fields trained on ground truth laser scans. Eigen et al. [4] proposed a multiscale CNN architecture trained on ground truth depth maps by minimizing a scale-invariant loss. Fully supervised deep learning-based approaches have since then continuously advanced the state of the art through various architecture and loss improvements [20, 21, 1, 22]. Semi-supervised methods [3, 14] can, in theory, alleviate part of the labeling cost. However, so far they have only been evaluated when using similar amounts of labeled data, reporting significant improvements nonetheless. Another alternative to circumvent the difficulty of getting ground truth depth maps consists of using synthetic data coming from a simulator [23], trading off the labeling problem for a domain adaptation and virtual scene creation one.

Self-supervised Depth Estimation  Procuring large amounts of ground truth depth or disparity maps is expensive, often requiring an entirely different data collection platform than the target robotic deployment platform. Self-supervised learning methods have recently proven to be a promising direction to circumvent this major limitation. Recent advancements, for instance Spatial Transformer Networks [10], have indeed opened the door to a variety of differentiable geometric constraints used as learning objectives capturing key scene properties characterizing optical flow [13, 24], depth [6, 5, 25, 16], and camera pose [7, 25]. Self-supervised approaches thus typically focus on engineering the learning objective, for instance by treating view-synthesis as a proxy task [26, 27, 6, 8, 25, 28]. Related works also typically explore different architectures, for instance using shared encoders [8] for simultaneous depth and pose estimation. In contrast, our contributions rely on changing fundamental building blocks of the depth prediction CNN architecture using ideas developed initially for super-resolution [9]

, or transforming post-processing heuristics into trainable parts of our model.

Iii Self-supervised, Super-Resolved Monocular Depth Estimation

The goal of monocular depth estimation is the recovery of a function , that predicts the depth for every pixel in the given input image . In this work, we learn to recover the disparity estimation function in a self-supervised manner from a synchronized stereo camera (Section III-A). Given , we can estimate the disparity for every pixel in the input image , with the metric depth estimated via . Both the camera focal length and stereo baseline are assumed to be known while training.

Input image Ours MonoDepth [12] GeoNet [13] SfMLearner [7] Vid2Depth [16]
Figura 2: Illustrated above are qualitative comparisons of our proposed self-supervised, super-resolved monocular depth estimation method with previous state-of-the-art methods. We show that our approach produces qualitatively better depth estimates with crisp boundaries. Our method also correctly reconstructs thin and far-off objects reliably compared to previous methods that tend to only estimate shadow artifacts in such regions.

Iii-a Monocular Depth Network Architecture

Our disparity estimation model builds upon the popular DispNet [20] architecture. Following Godard et al. [6], we make similar modifications to the encoder-decoder network with skip connections [29] between the encoder’s activation blocks. However, unlike the left-right (LR) disparity architecture [6], the model outputs a single disparity channel. We further extend this base architecture to incorporate two key components detailed in the following sections.

Iii-A1 Sub-pixel Convolution for Depth Super-Resolution

Recent methods that employ multi-scale disparity estimation utilize deconvolutions, resize-convolutions [11]

or naive interpolation operators (for e.g. bilinear, nearest-neighbor) to up-sample the lower-resolution disparities to their target image resolution. However these methods perform the interpolation in the high-resolution space, and are limited in their representational capacity for disparity super-resolution. Inspired by recent CNN-based methods for Single-Image-Super-Resolution (SISR) 

[9], we introduce a sub-pixel convolutional layer based on ESPCN [9]

for depth super-resolution that accurately synthesizes the high-resolution disparities from their corresponding low-resolution multi-scale model outputs. This effectively replaces the disparity interpolation layer, while learning relevant low-resolution convolutional features that can perform high-quality disparity synthesis. We swap the resize-convolution branches from each of the 4 pyramid scales in the disparity network with the sub-pixel convolutional branch consisting of a sequence of 4 consecutive 2D convolutional layers with 32, 32, 32, 16 layers with 1 pixel stride, each followed by ReLu activations. The final convoluational output is then re-mapped to the target depth resolution via a pixel re-arrange operation, resulting in an efficient sub-pixel convolutional operation as described in 


Iii-A2 Differentiable Flip Augmentation

In stereopsis, due to the lack of observable left image boundary scene points in the right image, the disparity model will inevitably learn a poor prior on boundary-pixels. To circumvent this behavior, previous methods [6, 8] include a post-processing step that alpha-blends the disparity images from the image and its horizontally flipped version. While this significantly reduces visual artifacts around the image boundary and improves overall accuracy, it however decouples the final disparity estimation from the training. To this end, we replace this step with a differentiable flip-augmentation layer within the disparity estimation model itself, allowing us to fine-tune disparities in an end-to-end fashion. By leveraging the differentiable image-rendering in [10] to revert the flipped disparity, the model performs the forward pass with the identical model on both the original and horizontally flipped images. The outputs are fused together in a differentiable manner with a pixel-wise mean operation while handling the borders similar to [6].

Iii-B Self-supervising Depth with Stereopsis

Following [6, 5, 7], we formulate the disparity estimation as a photometric error minimization problem across multiple camera views. We define as the disparity image for the corresponding target image , and re-cast the disparity estimation implicitly as an image synthesis task of a new source image . The photometric error is then re-written as the minimization of pixel-intensity difference between the target image , and the synthesized target image re-projected from the source image’s view  [10]. Here, is the source pixel derived from re-projecting the target pixel in the source image’s view , with describing the relative transformation between the target image view pose and source image view pose . The disparity estimation model parametrized by is defined as:


where are all the disparate views available for synthesizing the target image . In the case of stereo cameras, in Equation 1 is known a-priori, and directly incorporated as a constant within the overall minimization objective. The overall loss comprises of 3 terms:


Appearance Matching Loss  Following [6], the pixel-level similarity between the target image and the synthesized target image is estimated using the Structural Similarity (SSIM) [30] term combined with an L1 photometric-term, inducing an overall loss given by Equation 3 below.


Disparity Smoothness Loss  In order to regularize the disparities in textureless low-image gradient regions, we incorporate an edge-aware term (Equation  4), similar to [6, 14, 25]. The effect of each of the pyramid-levels is decayed by a factor of 2 on downsampling, starting with a weight of 1 for the pyramid level.


Occlusion Regularization Loss  We adopt the occlusion regularization term (similar to  [14]) to minimize the shadow areas generated in the disparity map, especially across high gradient disparity regions. By inducing an L1-loss over the disparity estimate, this term encourages background depths (i.e. lower disparities) by penalizing the total sum of absolute disparities in the estimate.


The photometric, disparity smoothness and occlusion regularization losses are combined in a final loss (Equation 2) which is averaged per-pixel, pyramid-scale and image batch during training.

Iv Experiments

Iv-a Dataset

We use the KITTI [31] dataset for all our experiments. We compare with previous methods on the standard KITTI Disparity Estimation benchmark. We adopted the training protocols used in Eigen et al. [4], and specifically, we used the KITTI Eigen splits described in [4] that contain 22600 training, 888 validation, and 697 test stereo image pairs. We evaluate the disparities estimated using the metrics described in Eigen et al. [4].

Iv-B Depth Estimation Performance

We re-implemented the modified DispNet with skip connections as described in Godard et al. [6] as our

baseline (Ours), and evaluate it with the proposed sub-pixel convolutional extension (Ours-SP) and the differentiable flip-augmentation (Ours-FA). However, first, we show that by operating in high-resolution regimes, we are able to alleviate the drawbacks of the multi-scale photometric loss function that inadvertently incorporate the losses at extremely low-resolution disparities.

Iv-B1 Effect of High-Resolution in Disparity Estimation

As previously mentioned, the self-supervised photometric loss is limited by the image resolution and the corresponding disparities at which they operate. In their recent work [8], the authors discuss this limitation and up-sample the multi-scaled disparity outputs to their original input image resolution before computing the relevant photometric losses. Using this insight, we first consider estimating disparities at higher-resolutions and use this as our baseline for subsequent experiments. In Figure 3, we show that with increasing input image resolutions of 1024 x 384, 1536 x 576, and 2048 x 768, the disparity estimation performance continues to improve for most metrics including Abs. Rel, Sq Rel. RMSE, and RMSE log. The performance of the baseline approach however saturates at the 1536 x 576 resolution since the original KITTI stereo images are captured at 1392 x 512 pixel resolution. It is however noteworthy that the fraction of the disparities within pixels show improvements with even higher input image resolutions indicating that the photometric losses are indeed limited by the disparity resolution.

Resolution Abs Rel Sq Rel RMSE log
 512 x 192 0.133 1.079 0.247 0.816 0.927 0.964
1024 x 384 0.116 0.935 0.210 0.842 0.945 0.977
1536 x 576 0.114 0.869 0.209 0.849 0.945 0.976
2048 x 768 0.116 1.055 0.209 0.853 0.948 0.977

Figura 3: Effect of high-resolution: The relative change in the disparity estimation metrics are plotted with increasing input image resolution. We show that by naively increasing the input image resolution, we are able to show considerable improvement (increase in , and decrease in Abs Rel, Sq Rel, RMSE log metrics) without any changes to the underlying loss function. This motivates us to consider efficient and accurate methods in performing disparity estimation at much higher input image resolutions via sub-pixel convolutions.

Iv-B2 Improving Disparity Estimation with Sub-pixel Convolutions

Using the insight of operating at high-resolution disparity regimes, we discuss the importance of super-resolving low-resolution disparities estimated within Encoder-Decoder-based disparity networks [20, 14, 1]. With Ours-SP, we are able to achieve a considerable improvement in performance (0.112 abs. rel.) for the same input image resolution over our established baseline Ours (0.116 abs. rel.). Furthermore, we notice that the Sq. Rel., RMSE, columns show equally consistent and improved performance over the baseline that utilizes resize-convolutions [11] instead of the proposed sub-pixel convolutional layer for disparity up-sampling. In Table. I, we report our disparity estimation results with the proposed sub-pixel convolutional layer and the differentiable flip-augmentation, illustrating the state-of-the-art performance for self-supervised disparity estimation on the KITTI Eigen test set.

Method Resolution Dataset Train Abs Rel Sq Rel RMSE RMSE log
Garg et al.[5] cap 50m 620 x 188 K M 0.169 1.080 5.104 0.273 0.740 0.904 0.962
Godard et al. [8] 640 x 192 K M 0.129 1.112 5.180 0.205 0.851 0.952 0.978
SfMLearner [7] (w/o explainability) 416 x 128 K M 0.221 2.226 7.527 0.294 0.676 0.885 0.954
SfMLearner [7] 416 x 128 K M 0.208 1.768 6.856 0.283 0.678 0.885 0.957
SfMLearner [7] 416 x 128 CS+K M 0.198 1.836 6.565 0.275 0.718 0.901 0.960
GeoNet [13] 416 x 128 K M 0.155 1.296 5.857 0.233 0.793 0.931 0.973
GeoNet [13] 416 x 128 CS+K M 0.153 1.328 5.737 0.232 0.802 0.934 0.972
Vid2Depth [16] 416 x 128 K M 0.163 1.240 6.220 0.250 0.762 0.916 0.968
Vid2Depth [16] 416 x 128 CS+K M 0.159 1.231 5.912 0.243 0.784 0.923 0.970
UnDeepVO [25] 416 x 128 K S 0.183 1.73 6.57 0.268 - - -
Godard et al. [6] 640 x 192 K S 0.148 1.344 5.927 0.247 0.803 0.922 0.964
Godard et al. [6] 640 x 192 CS+K S 0.124 1.076 5.311 0.219 0.847 0.942 0.973
Godard et al. [8] 640 x 192 K S 0.115 1.010 5.164 0.212 0.858 0.946 0.974
Ours 1024 x 384 K S 0.116 0.935 5.158 0.210 0.842 0.945 0.977
Ours-SP 1024 x 384 K S 0.112 0.880 4.959 0.207 0.850 0.947 0.977
Ours-FA 1024 x 384 K S 0.115 0.922 5.031 0.206 0.850 0.948 0.978
Ours-SP+FA 1024 x 384 K S 0.112 0.875 4.958 0.207 0.852 0.947 0.977

Tabela I: Single-view depth estimation results on the KITTI dataset [31] using the Eigen Split [4] for depths reported less than 80m, as indicated in [4]. The mode of self-supervision employed during training is reported under the Train column - Stereo (S), Mono (M). Above, we compare our baseline approach (Ours) along with the proposed sub-pixel convolutions variant (Ours-SP). Training datasets used by previous methods are listed as either CS=Cityscapes [32], K=KITTI[31]. For Abs Rel, Sq Rel, RMSE, and RMSE log, lower is better. For , and , higher is better.

Iv-B3 Improving Disparity Estimation with Differentiable Flip-Augmentation Fine-Tuning

In their previous works Godard et. al [6, 8] use a hand-engineered post-processing step to fuse the disparity estimates of the left image and the horizontally flipped image. While this reduces the artifacts at the borders of the image, we show that this technique can be used in a differentiable manner to allow further fine-tuning of the disparity network in an end-to-end manner. With the differentiable flip-augmentation training, we improve the baseline (Ours) and the sub-pixel variant (Ours-SP) on all metrics except the Abs. Rel which remains unchanged. Finally, by training with the subpixel-variant (Ours-SP) and fine-tuning with the flip-augmentation (Ours-FA) we are able to achieve state-of-the-art performance on the KITTI Eigen split benchmark as listed in Table I.

Effects of fine-tuning and pre-training Many recent state-of-the-art results [8, 33]

provide strong performance by either using pre-trained ImageNet weights 

[34] and fine-tuning or adapting the task domain from a model trained on an alternate dataset training. While we realize the implications of transferring well-conditioned model weights for warming up training, in this work we only consider the case of self-supervised training from scratch. Despite training from scratch, we show in Table I that the performance of our models (Ours, Ours-SP, Ours-SP+FA) are competitive with those of recent state-of-the-art self-supervised disparity estimation methods [6, 8, 33] that utilize ImageNet pre-trained weights.

Figura 4: Examples of pixel-wise photometric errors when reconstructing the right image from the left input image.

Qualitative results We contrast the results of our method alongside related methods in Figure 2. We note that our method is able to capture with higher fidelity the sharpness of objects as compared to the state-of-the-art. The effect of our sub-pixel convolutions is particularly noticeable around smaller objects (e.g. poles, traffic signs), where the super-resolved depths successfully recover the underlying geometry. Fig. 4 shows examples of pixel-wise photometric errors induced when reconstructing the right image from the input left image.

Iv-C Pose Estimation

To further validate our contributions, we perform a second set of experiments where we use our disparity network trained on stereo data to train a network which estimates the 6 DoF pose between subsequent monocular frames. Specifically, we are interested in recovering long-term trajectories that are metrically accurate and free of drift. Additionally, we bootstrap the training process with our disparity network, thus ensuring the trajectories are estimated with the correct scale factor.

To estimate pose, we follow the architecture of [7] without the explainability mask layer. The network is fed the concatenation of a target image and a set of context images , which are temporally adjacent to the target image. The network outputs the 6 DoF transformations between and the images in via the final convolutional layer. Following [35, 36, 37], we use the logarithm of a unit quaternion to parameterize the rotation in and do not require an added normalization constraint unlike previous works [38]. Finally, we use the logarithm and exponential maps to convert between a unit quaternion and its log form [37].

Formally, the network recovers a function , for all , where is the 6 DoF transformation between image and . We train the pose network through an additional photometric loss between the target image and image inferred via the mapping from the context image .


We note here that, although similar to the loss defined in Eq. 3, the multi-view photometric loss, , uses a different weight, , to trade-off between the and the components. In all our experiments, , thus the optimization favors the component of the loss while training the pose network. This is important, as the loss is better suited for images that are fronto-parallel (e.g. stereo camera images), an assumption which is often invalidated in images which are acquired sequentially as the camera is undergoing ego-motion. Furthermore, we jointly optimize Eq. 2 and Eq. 6, thus ensuring that the network which estimates disparity, , does not diverge during this optimization step; this is important for recovering trajectories that are metrically accurate.

For long term trajectory estimation we report Average Translational () and Rotational () RMS drift over trajectories of 100-800 meters. We use the KITTI odometry benchmark for evaluation, and specifically sequences 00 - 10, for which ground truth is available. We note that in this case we still train our disparity and pose networks on the KITTI Eigen train split, with the mention that this data split includes all the images from sequences 01, 02, 06, 08, 09 and 10. We report our results on all sequences 00 - 10 in II, where we clearly mark the sequences that are used for training and testing, both for our method and the related work. We leave out model based methods (e.g. [39, 14]

) and limit our quantitative comparison to self-supervised learning based methods which are similar in nature to our approach. In all our experiments we use a context of size 3 (i.e. target frame plus 2 additional frames).

SfMLearner [7] UnDeepVO [25] Ours
Seq t r t r t r
00 66.35 6.13 4.41 1.92 6.12 2.72
03 10.78 3.92 5.00 6.17 7.90 4.30
04 4.49 5.24 4.49 2.13 11.80 1.90
05 18.67 4.10 3.40 1.50 4.58 1.67
07 21.33 6.65 3.15 2.48 7.60 5.17
01 35.17 2.74 69.07 1.60 13.48 1.97
02 58.75 3.58 5.58 2.44 3.48 1.10
06 25.88 4.80 6.20 1.98 1.81 0.78
08 21.90 2.91 4.08 1.79 2.25 0.84
09 18.77 3.21 7.01 3.61 3.74 1.19
10 14.33 3.30 10.63 4.65 2.26 1.03
Train 29.26 4.45 11.70 2.75 4.50 1.15
Test 16.56 3.26 8.82 4.13 7.60 3.15
Avg 29.95 4.23 11.18 2.55 5.91 2.06

Tabela II: Long term trajectory results on the KITTI odometry benchmark. We report the following metrics: - average translational RMSE drift (%) on trajectories of length 100-800m, and - average rotational RMSE drift () on trajectories of length 100-800m. and represent train and respectively test seq. for our method. The methods of [7] and [25] are trained on seq. 00-08. The results of [7] were scaled using the scale from the ground truth depth.

We compare against: (a) SfMLearner [7] which is trained using monocular video and thus we scale their depth predictions using the scale from the ground truth; and (b) UnDeepVO [25] which, like us, is trained on a combination of monocular and stereo imagery and returns metrically accurate depths and trajectories. We note that our quantitative results are superior to those of [25], which we attribute to the fact that our pose network is bootstrapped with much more accurate depth estimates. We further note that through the proposed combination of monocular and stereo losses our approach is able to overcome the scale ambiguity and recover metrically accurate trajectories which exhibit little drift over extended periods of time (see Table. II and Fig. 5).

Figura 5: Illustrations of our pose estimation results on the KITTI odometry benchmark, sequences 00 (left) and 08 (right). Our results are rendered in blue while the ground truth is rendered in red.

Iv-D Implementation

We follow the implementation of [6]

closely, and implement our depth estimation network in PyTorch. The sub-pixel convolution and differentiable flip-augmentation take advantage of the native PixelShuffle and index_select operations in PyTorch, with the model and losses parallelized across 8 Titan V100s during training. We train the disparity network for 200 epochs using the Adam optimizer 

[40]. The learning rate and batch size are estimated via hyper-parameter search. In most cases, we use a batch size of 4 or 8, with an initial learning rate of 5e-4. As training proceeds, the learning rate is decayed every 40 epochs by a factor of 2. We set the following parameter values for all training runs: , , . For fine-tuning with the differentiable flip-augmentation layer, we use a learning rate of 5e-5, batch size of 2, and only consider the first 2 pyramid scales for computing the loss as the lower-resolution pyramid scales tend to over-regularize the depth maps.

V Conclusion

In this work, we propose two key extensions to self-supervised monocular disparity estimation that enables state-of-the-art performance on the public KITTI disparity estimation benchmark. Inspired by the strong performance in monocular disparity estimation in high-resolution regimes, we incorporate the concept of sub-pixel convolutions within a disparity estimation network to enable super-resolved depths. The super-resolved depths operating at higher-resolutions tend to reduce ambiguities in the self-supervised photometric loss estimation (unlike their lower-resolution counterparts), thereby resulting in improved monodepth estimation. In addition to super-resolution, we introduce a differentiable flip-augmentation layer that further reduces artifacts and ambiguities while training the monodepth model. Through experiments, we show that both contributions provide significant performance gains to the proposed self-supervised technique, resulting in state-of-the-art performance in depth estimation on the public KITTI benchmark. As a consequence of improved disparity estimation, we study its relation to the strongly correlated problem of pose estimation and show strong quantitative and qualitative performance compared to previous self-supervised pose estimation methods.


We would like to thank John Leonard, Mike Garrison, and the whole TRI-ML team for their support. Special thanks to Vitor Guizilini for his help.


  • [1] B. Ummenhofer, H. Zhou, J. Uhrig, N. Mayer, E. Ilg, A. Dosovitskiy, and T. Brox, “Demon: Depth and motion network for learning monocular stereo,” in

    IEEE Conference on computer vision and pattern recognition (CVPR)

    , vol. 5, 2017, p. 6.
  • [2] C. Wang, J. M. Buenaposada, R. Zhu, and S. Lucey, “Learning depth from monocular videos using direct methods,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 2022–2030.
  • [3] Y. Kuznietsov, J. Stückler, and B. Leibe, “Semi-supervised deep learning for monocular depth map prediction,” in Proc. of the IEEE Conference on Computer Vision and Pattern Recognition, 2017, pp. 6647–6655.
  • [4] D. Eigen, C. Puhrsch, and R. Fergus, “Depth map prediction from a single image using a multi-scale deep network,” in Advances in neural information processing systems, 2014, pp. 2366–2374.
  • [5] R. Garg, V. K. BG, G. Carneiro, and I. Reid, “Unsupervised cnn for single view depth estimation: Geometry to the rescue,” in European Conference on Computer Vision.   Springer, 2016, pp. 740–756.
  • [6] C. Godard, O. Mac Aodha, and G. J. Brostow, “Unsupervised monocular depth estimation with left-right consistency,” in CVPR, vol. 2, no. 6, 2017, p. 7.
  • [7]

    T. Zhou, M. Brown, N. Snavely, and D. G. Lowe, “Unsupervised learning of depth and ego-motion from video,” in

    CVPR, vol. 2, no. 6, 2017, p. 7.
  • [8] C. Godard, O. Mac Aodha, and G. Brostow, “Digging into self-supervised monocular depth estimation,” arXiv preprint arXiv:1806.01260, 2018.
  • [9] W. Shi, J. Caballero, F. Huszár, J. Totz, A. P. Aitken, R. Bishop, D. Rueckert, and Z. Wang, “Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 1874–1883.
  • [10] M. Jaderberg, K. Simonyan, A. Zisserman, et al., “Spatial transformer networks,” in Advances in neural information processing systems, 2015, pp. 2017–2025.
  • [11] A. Odena, V. Dumoulin, and C. Olah, “Deconvolution and checkerboard artifacts,” Distill, vol. 1, no. 10, p. e3, 2016.
  • [12] C. Godard, O. Mac Aodha, and G. J. Brostow, “Unsupervised monocular depth estimation with left-right consistency,” in CVPR, 2017.
  • [13] Z. Yin and J. Shi, “Geonet: Unsupervised learning of dense depth, optical flow and camera pose,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2, 2018.
  • [14] N. Yang, R. Wang, J. Stückler, and D. Cremers, “Deep virtual stereo odometry: Leveraging deep depth prediction for monocular direct sparse odometry,” arXiv preprint arXiv:1807.02570, 2018.
  • [15] H. Fu, M. Gong, C. Wang, K. Batmanghelich, and D. Tao, “Deep ordinal regression network for monocular depth estimation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 2002–2011.
  • [16] R. Mahjourian, M. Wicke, and A. Angelova, “Unsupervised learning of depth and ego-motion from monocular video using 3d geometric constraints,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 5667–5675.
  • [17] M. Bloesch, J. Czarnowski, R. Clark, S. Leutenegger, and A. J. Davison, “Codeslam-learning a compact, optimisable representation for dense visual slam,” 2018.
  • [18] H. Zhou, B. Ummenhofer, and T. Brox, “DeepTAM: Deep Tracking and Mapping,” arXiv preprint arXiv:1808.01900, 2018.
  • [19] A. Saxena, M. Sun, and A. Y. Ng, “Make3d: Learning 3d scene structure from a single still image,” IEEE transactions on pattern analysis and machine intelligence, vol. 31, no. 5, pp. 824–840, 2009.
  • [20] N. Mayer, E. Ilg, P. Hausser, P. Fischer, D. Cremers, A. Dosovitskiy, and T. Brox, “A large dataset to train convolutional networks for disparity, optical flow, and scene flow estimation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 4040–4048.
  • [21] J. Žbontar and Y. LeCun, “Computing the stereo matching cost with a convolutional neural network,” in Proc. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2015.
  • [22] A. Kendall, H. Martirosyan, S. Dasgupta, P. Henry, R. Kennedy, A. Bachrach, and A. Bry, “End-to-end learning of geometry and context for deep stereo regression,” CoRR, vol. abs/1703.04309, 2017.
  • [23] N. Mayer, E. Ilg, P. Fischer, C. Hazirbas, D. Cremers, A. Dosovitskiy, and T. Brox, “What Makes Good Synthetic Training Data for Learning Disparity and Optical Flow Estimation?” IJCV, 2018.
  • [24] S. Meister, J. Hur, and S. Roth, “Unflow: Unsupervised learning of optical flow with a bidirectional census loss,” arXiv preprint arXiv:1711.07837, 2017.
  • [25] R. Li, S. Wang, Z. Long, and D. Gu, “Undeepvo: Monocular visual odometry through unsupervised deep learning,” arXiv preprint arXiv:1709.06841, 2017.
  • [26] T. Zhou, S. Tulsiani, W. Sun, J. Malik, and A. A. Efros, “View synthesis by appearance flow,” in European conference on computer vision.   Springer, 2016, pp. 286–301.
  • [27] J. Flynn, I. Neulander, J. Philbin, and N. Snavely, “Deepstereo: Learning to predict new views from the world’s imagery,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2016, pp. 5515–5524.
  • [28] X. Fei, A. Wang, and S. Soatto, “Geo-supervised visual depth prediction,” arXiv preprint arXiv:1807.11130, 2018.
  • [29] J. Long, E. Shelhamer, and T. Darrell, “Fully convolutional networks for semantic segmentation,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2015, pp. 3431–3440.
  • [30] Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image quality assessment: from error visibility to structural similarity,” IEEE transactions on image processing, vol. 13, no. 4, pp. 600–612, 2004.
  • [31] A. Geiger, P. Lenz, C. Stiller, and R. Urtasun, “Vision meets robotics: The kitti dataset,” The International Journal of Robotics Research, vol. 32, no. 11, pp. 1231–1237, 2013.
  • [32]

    M. Cordts, M. Omran, S. Ramos, T. Rehfeld, M. Enzweiler, R. Benenson, U. Franke, S. Roth, and B. Schiele, “The cityscapes dataset for semantic urban scene understanding,” in

    Proceedings of the IEEE conference on computer vision and pattern recognition, 2016, pp. 3213–3223.
  • [33] X. Guo, H. Li, S. Yi, J. Ren, and X. Wang, “Learning monocular depth by distilling cross-domain stereo networks,” in Proceedings of the European Conference on Computer Vision (ECCV), 2018, pp. 484–500.
  • [34] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition, 2016, pp. 770–778.
  • [35] S. Brahmbhatt, J. Gu, K. Kim, J. Hays, and J. Kautz, “Geometry-aware learning of maps for camera localization,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 2616–2625.
  • [36] R. Clark, S. Wang, H. Wen, A. Markham, and N. Trigoni, “Vinet: Visual-inertial odometry as a sequence-to-sequence learning problem.” in AAAI, 2017, pp. 3995–4001.
  • [37] F. S. Grassia, “Practical parameterization of rotations using the exponential map,” Journal of graphics tools, vol. 3, no. 3, pp. 29–48, 1998.
  • [38] A. Kendall, M. Grimes, and R. Cipolla, “Posenet: A convolutional network for real-time 6-dof camera relocalization,” in Proceedings of the IEEE international conference on computer vision, 2015, pp. 2938–2946.
  • [39] R. Mur-Artal and J. D. Tardós, “Orb-slam2: An open-source slam system for monocular, stereo, and rgb-d cameras,” IEEE Transactions on Robotics, vol. 33, no. 5, pp. 1255–1262, 2017.
  • [40] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.