D EEP 3D P AN VIA ADAPTIVE “ T - SHAPED ” CONVOLUTIONS WITH GLOBAL AND LOCAL ADAPTIVE DILATIONS
A BSTRACT
Recent advances in deep learning have shown promising results in many low-level vision tasks.
However, solving the single-image-based view synthesis is still an open problem.
In particular, the generation of new images at parallel camera views given a single input image is of great interest, as it enables 3D visualization of the 2D input scenery.
We propose a novel network architecture to perform stereoscopic view synthesis at arbitrary camera positions along the X-axis, or Deep 3D
Pan, with “t-shaped” adaptive kernels equipped with globally and locally adaptive dilations.
Our proposed network architecture, the monster-net, is devised with a novel t-shaped adaptive kernel with globally and locally adaptive dilation, which can efﬁciently incorporate global camera shift into and handle local 3D geometries of the target image’s pixels for the synthesis of naturally looking 3D panned views when a 2-D input image is given.
Extensive experiments were performed on the KITTI, CityScapes and our VICLAB STEREO indoors dataset to prove the efﬁcacy of our method.
Our monster-net signiﬁcantly outperforms the stateof-the-art method, SOTA, by a large margin in all metrics of RMSE, PSNR, and
SSIM.
Our proposed monster-net is capable of reconstructing more reliable image structures in synthesized images with coherent geometry.
Moreover, the disparity information that can be extracted from the “t-shaped” kernel is much more reliable than that of the SOTA for the unsupervised monocular depth estimation task, conﬁrming the effectiveness of our method.
I NTRODUCTION
Recent advances in deep learning have pushed forward the state-of-the-art performance for novel view synthesis problems.
Novel view synthesis is the task of generating a new view seen from a different camera position, given a single or multiple input images, and ﬁnds many applications in robotics, navigation, virtual and augmented reality (VR/AR), cinematography, etc.
In particular, the challenging task of generating stereo images given a single input view is of great interest as it enables 3D visualization of the 2D input scene.
In addition, the falling price and the increasing availability of the equipment required for VR/AR has fueled the demand for stereoscopic contents.
The previous works, such as the Deep3D (Xie et al., 2016), have addressed the right-view generation problem in a fully supervised fashion when the input is the left-view to which the output is the synthetic right-view at a ﬁxed camera shift.
In contrast, our proposed Deep 3D Pan pipeline enables the generation of new views at arbitrary camera positions along the horizontal X-axis of an input image with far better quality by utilizing adaptive “t-shaped” convolutions with globally and locally adaptive dilations, which takes into account the camera shift amount and the local 3D geometries of the target pixels.
Panning at arbitrary camera positions allows our proposed model to adjust the baseline (distance between cameras) for different levels of 3D sensation.
Additionally, arbitrary panning unlocks the possibility to adjust for different inter-pupillary distances of various persons.
Figure 1 shows some generated left and right view images for a given single image input by our proposed Deep 3D Pan pipeline, which we call it the “monster-net” ( mon ocular to ster eo network).
In this paper, we deﬁne “pan” in the context of 3D modeling, implying that camera movement is in parallel to the center view plane.
In the following sections, we review the related works to stereoscopic view synthesis and discuss the differences with our proposed method, followed by the formulation of our Deep 3d Pan pipeline and ﬁnally, we present outstanding results on various challenging stereo datasets, showing superior performance against the previous state-of-the-art methods.
R ELATED WORK
Novel view synthesis is a well-studied problem in deep learning-based computer vision, and has already surpassed the classical techniques for both cases of the multiple-image (Woodford et al., 2007; Liu et al., 2009; Chaurasia et al., 2013) and single-image input (Horry et al., 1997; Hoiem et al., 2005).
The latter, single-image based novel view synthesis, is known to be a much more complex problem compared to multiple-image based ones.
Previous deep learning-based approaches usually tend to utilize one of the two techniques to generate a novel view: (i) optical ﬂow guided image warping, and (ii) a “ﬂavor” of kernel estimation, also known as adaptive convolutions.
The ﬁrst technique, optical ﬂow guided image warping , has been widely used by many researchers to indirectly train convolutional neural networks (CNNs) to estimate optical ﬂow or disparity from single or stereo images in an unsupervised fashion, but its ﬁnal goal was not to synthesize new views.
These works include those of (Godard et al., 2017; Zhou et al., 2016; Gonzalez & Kim, 2019b;
Tosi et al., 2019; Liu et al., 2019; Wang et al., 2019b; Ranjan et al., 2019; Lai et al., 2019).
However, not all methods have used ﬂow-guided warping to do unsupervised training or to regularize supervised methods for ﬂow estimation.
The work of Im et al.
(2019) implements plane sweep at the feature level to generate a cost volume for multi-view stereo depth estimation.
Plane sweep can be seen as a type of 1D convolution, similar to the 1D kernel utilized in (Flynn et al., 2016; Xie et al., 2016).
On the other hand, the second approach, kernel estimation or adaptive convolutions , has proved to be a superior image synthesis technique and has been executed in different ways by many authors.
For example: (1) Flynn et al.
(2016) in their early DeepStereo work formulated a CNN capable of synthesizing a middle view by blending multiple plane-swept lateral view inputs weighted by a “selection volume”, which can be considered a 1D (or line-shaped) adaptive convolution; (2) in a similar way, Xie et al.
(2016) devised the Deep3D, a non fully-convolutional network that estimates a series of “probabilistic disparity maps” that are then used to blend multiple shifted versions of the left-view input image to generate a synthetic right-view; (3) The adaptive separable convolutions (SepConv) in the work of Niklaus et al.
(2017) approximated adaptive 2D convolutions by two (vertical and horizontal) 1D kernels that are applied sequentially to the input t 0 and t 1 frames for the video interpolation problem; (4)
In the works of (Zhou et al., 2018; Srinivasan et al., 2019), although with additional considerations, their multiplane image representation approach can be loosely un- derstood as a 1D adaptive convolution as the ﬁnal operation involves the reduction of a plane sweep volume; (5) Geometric-aware networks in the work of Liu et al.
(2018) indirectly achieved adaptive convolutions by learning a ﬁxed number of afﬁne transformations on an input image, where the resulting afﬁne-transformed images are then blended together to generate one output image; and ﬁnally, (6) in the work of Gonzalez & Kim (2019a), the authors developed the Deep 3D Zoom Net, which estimates a selection volume for the “blending of multiple upscaled versions of the input image”, which can be treated as an special case of a 1D adaptive convolution.
The DeepStereo and the multiplane image approaches require two or more images as inputs, thus, greatly reducing the complexity of the synthesis task as most ambiguities are removed by counting on multiple views.
In our work, we focus on the single-image based stereoscopic view synthesis task, which is a far more difﬁcult problem as the network needs to understand the 3D geometry in the scene, and to handle complex occlusions, ambiguities and non-Lambertian surfaces.
Although the aforementioned methods are distinguished one another, as the different synthesis techniques have their own properties, they can be all interpreted as belonging to a category of adaptive convolutions which are visualized in Figure 2.
As observed in Figure 2-(a), DeepStereo and Deep3D share a same shape of kernels, that is, a 1D horizontal-only kernel that samples the pixels at a ﬁxed interval or dilation along the X-axis for all target output pixels.
A 1D horizontal-only constantdilation kernel suffers from three major drawbacks:
Inefﬁcient usage of kernel values.
When sampling the positions opposite to the camera movement (which are the pixel locations corresponding to a 1 - a 3 in Figure 2-(a) assuming a rightward camera shift), experiments showed that these kernel values would often be zeros.
The same effect repeats when sampling the positions further away from the maximum disparity value of the given scene (which corresponds to the pixel location at a 7 , assuming that the maximum disparity is 2 and the dilation is 1) as the network is not able to ﬁnd valid stereo correspondences for these kernel positions; 2.
Right-view synthesis is limited to the trained baseline (distance between stereo cameras), as the models over-ﬁt to a speciﬁc training dataset with a ﬁxed baseline; and 3.
The 1D line kernel has limited occlusion handling capabilities, as the network will try to ﬁll in the gaps with the information contained only along the horizontal direction, limiting the reconstruction performance of the models on the occluded areas.
In contrast, the kernels predicted by the geometric-aware networks have deformable structures adaptive to the given input images.
However, only one deformed kernel shape is predicted and shared to synthesize all target output pixels, leading to limited performance.
Another drawback of the geometric-aware networks is their complexity as they require three sub-networks and a super-pixel segmentation step as pre-processing, hindering the processing of high-resolution images.
For the
Deep 3D Zoom Net case, the kernel tends to point to the center of the image, as it performs a blending operation of multiple upscaled versions of the input image.
The kernel dilation size of the Deep
3D Zoom Net is adaptive according to the zoom factor applied to the input image, which allows for the generation of arbitrary 3D-zoomed output images.
Finally, for the video interpolation case, the SepConv approximates an NxN adaptive kernel via a 1xN and an Nx1 component which are sequentially applied to the input images to generate the output.
SepConv has, by design, limited receptive ﬁelds, as the dilation size is ﬁxed to 1.
Besides, the sequential nature of the kernel forces the vertical component to sample pixels from the output of the horizontal convolution, which could be already degraded due to heavy deformations introduced by the horizontal component.
Recent works have also attempted to improve upon the stereoscopic view synthesis by improving the loss functions used to train the CNNs.
The work of Zhang et al.
(2019) proposed a multi-scale adversarial correlation matching (MS-ACM) loss that learns to penalize structures and ignore noise and textures by maximizing and minimizing the correlation- l 1 distance in the discriminator’s featurespace between the generated right-view and the target-view in an adversarial training setup.
Whereas the objective function is a key factor in training any CNN, we believe that, at its current state, the stereoscopic view synthesis problem can beneﬁt more from a better pipeline that can handle the previously mentioned issues and using the widely accepted l 1 and perceptual losses (Johnson et al., 2016) for image reconstruction, rather than a more complex loss function.
Our proposed dilation adaptive “t-shaped” convolutions incorporate global (new camera position along the X-axis) and local (3D geometries of speciﬁc target pixels) information of the input scene into the synthesis of each output pixel value by not only learning the speciﬁc kernel that will generate each output pixel, but also by learning the proper dilation value for each kernel.
The “t” shape of the kernel allows the network to account for occlusions by ﬁlling-in the gaps (missing information in the output) due to shifted camera positions using not only left-and-right pixels (like DeepStereo and
Deep3D), but also up-and-down neighboring pixel information.
In addition, the notions of global and local dilations allow our proposed mon ocular to ster eo network, the monster-net, to generate arbitrarily 3D panned versions of the input center view along the X-axis, a useful feature not present in previous works that allows adjusting for eye-to-eye separation and/or level of 3D sensation.
M ETHOD
In order to effectively synthesize an arbitrary 3D panned image, we propose a global dilation ﬁlter as shown in Figure 3.
Our proposed cross-shaped global dilation ﬁlter T d ( p ) at a target pixel location p = ( x, y ) ∈ I to , where I to is a generated image, is deﬁned as
[Equation]
where T c ( x, y ) is the ﬁlter parameter value of T d ( p ) at the center location p .
The upper, bottom, left and right wing parameters ( T u , T b , T l , T r ) of the cross-shaped dilation ( d ) ﬁlter are deﬁned as
[Equation]
where n u , n b , n l and n r indicate the numbers of ﬁlter parameters in T u , T b , T l , and T r , respectively.
For the cross-shaped dilation ﬁlter shown in Figure 3, it is more appropriate to have a longer length of the right (left) ﬁlter wing than the other three wings when the camera panning is rightward (leftward), as it allows capturing more useful information for the synthesis of a right (left) panned image.
In this case, n r ( n l ) is set to be greater than n l ( n r ), n u and n b , such that the global dilation ﬁlter showed in Figure 3 can be elaborated as a “t-shaped” kernel which can then take into account the camera panning direction for synthesis.
Figure 4 shows examples of “t-shaped” kernels overlaid on top of an input center image.
As shown in Figure 4-(a), the “t-shaped” kernel has a longer left wing of ﬁlter parameters for the synthesis of a leftward camera panning while in Figure 4-(b) it shows a longer right-wing of ﬁlter parameters for the synthesis of a rightward camera panning.
Why “t” shape?
Experiments with symmetric kernel shapes (e.g., “+” shape) were performed ﬁrst, but it was noted that most of the elements on the left (right), upper and bottom sides against the centered red dot of the kernel tended to have very small values close to zeros for most target pixels for the rightward (leftward) movement of a camera.
Similar to SepConv, the experiments with a horizontal kernel applied ﬁrst followed by a vertical kernel were performed, yielding poor results.
It was discovered that the “t” shape is more efﬁcient than the “+” shape as it picks up more effective sampling positions with a fewer parameters than the standard adaptive convolutions such as those in (Niklaus et al., 2017).
As depicted in Figure 5, the “t-shaped” kernels can embed useful information like disparity and occlusion from a monocular image into the stereo synthesis process.
The longer right (left) wing of the “t-shaped” kernel contains disparity information , as it will try to sample pixels from the right (left) side to the target position when the camera is assumed to move in the rightward (leftward) direction.
Figure 5-(a) depicts a primitive disparity map D p that was constructed by the weighted sum of the kernel values in the longer wing part as described by
[Equation]
where T r ( x + id, y ) is the i -th value of the longer wing T r at pixel location p
= ( x, y ) for the rightward 3D panning of an input center image I c .
Note that D p is normalized in the range [0 , 1] .
Interestingly, as shown in Figure 5-(a), the generated disparity map looks very natural and appropriate, which implies the effectiveness of our “t-shaped” kernel approach.
The short left (right), upper and bottom wings of the “t-shaped” kernel contain occlusion information , as the network will try to ﬁll in the gaps utilizing surrounding information that is not present in the long part of the “t-shaped” kernel.
It is also interesting to see the occlusion map in
Figure 5-(b) where a primitive rightward occlusion map O rp was constructed by summing up the “t-shaped” kernel values in the short wing parts according to the following:
[Equation]
The bright regions or spots in Figure 5-(b) indicate the occlusions due to the camera shift along the horizontal axis of the input center image, which are likely to happen for the case of the camera’s rightward panning.
For both Equations (3) and (4), the primitive disparity and occlusion maps for the leftward panning case can be obtained by swapping the r and l indices.
3. G LOBALLY AND L OCALLY ADAPTIVE DILATIONS FOR SYNTHESIS OF A NEW VIEW IMAGE AT A SHIFTED CAMERA POSITION
In general, the disparity amounts between stereo images are variable at different pixel locations according to the distance between stereo cameras and the local scene geometries.
Therefore, it is necessary to take into account the variable disparity in synthesizing a new view in a globally and locally adaptive fashion.
For this, a “t-shaped” kernel is introduced with a controllable dilation factor by which both camera shift and local changes in image geometry can be effectively taken into account when synthesizing a new (left or right) view for the input center image.
Any kernel with a ﬁxed dilation may cause a limited accuracy in synthesizing a novel view because the disparity amounts vary over the whole image according to the cameras’ baseline and the local geometries.
So, our “t-shaped” kernel is proposed to make the synthesis of novel views not only globally, but locally adaptive to the camera shift and its local changes in image geometry by controlling its dilation size per-pixel in the output image.
Globally, a short dilation value is more appropriate when slightly shifting the camera, while a high dilation value is desirable when largely shifting the camera position.
In a local manner, a small dilation value is appropriate for far-away objects from the camera while very close objects to the camera can be better reconstructed with a larger dilation value.
3.1. G LOBAL DILATION
We deﬁne the global dilation g d as the pixel distance between two consecutive kernel sampling positions, which is given by the pan amount P a to be applied to the input center image I c divided by the total number of ﬁlter parameters in the longer “t-shaped” kernel wing ( n l or n r ).
P a has a unit of pixels mapped in the image corresponding to the camera shift into the left or right direction and takes on ﬂoating numbers.
Therefore, the global dilation g d is given by
[Equation]
where P a takes on positive (negative) values for the rightward (leftward) panning scenario.
The pan amount needed to generate a left-view or a right-view is determined during training according to the closest possible objects to the camera.
The “closest possible objects” vary over different training datasets.
For our novel view synthesis task, like in (Godard et al., 2017; Gonzalez & Kim, 2019b), we assume the KITTI dataset to have a maximum or “closest possible object” disparity of 153 pixels.
During training, P a is set to 153 and -153 for the rightward and leftward panning, respectively.
3.1. L OCAL DILATION
While global dilation allows the “t-shaped” kernel to take into account the global camera shift, a locally adaptive mechanism is needed to synthesize new views of locally variable disparity.
Such a mechanism is realized by ﬁrst generating multiple images with the “t-shaped” kernel at N different dilations and blending them per-pixel in a locally adaptive manner.
The blending is a weighted sum of ﬁltered images by the “t-shaped” kernel with N different dilations, where the blending weights ( w 1 , w 2 , . . .
, w N ) control the local dilation per-pixel and are learned via a convolutional neural network (CNN) along with the parameter values of the “t-shaped” kernel.
Let | g d | be the maximum dilation value that is a fractional number.
Figures 4-(c), -(d) and -(e) illustrative three “t-shaped” kernels with a maximum dilation | g d | and two dilation values less than | g d | .
To generate an output image I to panned to the rightward direction ( g d > 0 ) or to the leftward direction ( g d < 0 ), the input center image I c is ﬁrst ﬁltered by N
“t-shaped” kernels T d i of different dilations ( d 1 , . . .
, d N ).
Then, local adaptive dilations are calculated by linearly combining the resulting N intermediate ﬁltered images according to the corresponding blending weights ( w 1 , w 2 , . . .
, w N ) .
Based on the
N different global dilations, the output image value I to ( p ) at a pixel location p can be calculated as
[Equation]
where [ I c ∗ T d i ]( p ) is a “t-shaped” convolution at location p between I c and T d i of dilation d i
= (1 + (1 − i ) /N )
g d for i = 1 , . . . , N .
w i ( p ) indicates a blending weight for the i -th global dilation.
3. N ETWORK ARCHITECTURE
We propose an end-to-end trainable CNN, called the “monster-net” ( mon ocular to ster eo net).
The monster-net is made of two main building blocks, a novel view synthesis network, the “t-net”, and a resolution restoration block, the “sr-block”.
Given an input center image I c and pan amount P a , the ﬁnal output panned image I o is obtained by sequentially applying the aforementioned modules by
[Equation]
[Equation]
where θ t and θ sr parameterize the t-net and the sr-block respectively.
{ I ncs } is the stack of progressively shifted-downscaled versions of the input center image I c described in the SR - BLOCK section.
The t-net .
The “t-net” estimates both the “t-shaped” global dilation kernel parameters and the adaptive local dilation weights.
The t-net is designed to have large receptive ﬁelds to synthesize detailed image structures of a new view image which corresponds to a shifted camera position.
This is because such a large receptive ﬁeld is useful in capturing the global image structure and contextual information for a new view image to be synthesized.
For this, an auto-encoder with skip connections (not a U-net structure) is adopted, which allows to effectively have very large receptive ﬁelds and to efﬁciently fuse global and local (ﬁne details) information on the decoder stage.
For better feature extraction, we adopt the residual connections in the encoder side as proposed by (Gonzalez & Kim, 2019b).
The t-net estimates all necessary values to perform the operation described by Equation (6).
The t-net, depicted in Figure 6, has two output branches: the ﬁrst output branch yieldschannels, where the ﬁrst 49 are horizontal parameter maps and the following 32 vertical parameter maps; the second output branch generates the 3-channel blending weight maps for the local adaptive dilation.
That is, each channel-wise vector at a pixel location for the ﬁrst output branch corresponds to the t-kernel parameter values [ T c , T Tl , T Tr , T Tu , T Tb ] , and each channel-wise vector for the second output branch corresponds to the blending weights [ w 1 , w 2 , . . .
, w N ] for local dilations in Equation (6).
As our t-net is devised to generate arbitrarily panned novel views, feeding the pan amount as a 1-channel constant feature map ( P a ( p ) =
P a ∀ p ) helps the network take into account the varying pan direction and the amount of occlusions on the 3D panned output.
The effect of feeding the pan amount is further discussed in appendix A-1.
Super resolution (SR) block.
As generating a full resolution dilation-adaptive t-kernel would be computationally too expensive, we propose to estimate it at a low resolution (LR) to synthesize a novel view of the half-resolution, and then to apply deep learning based SR techniques to bring the
LR novel view to the high (or original) resolution (HR).
In comparison, in Deep3D and SepConv,
[Table]
the estimated LR kernel is upscaled with conventional methods to the HR and then applied to the input image(s), which is a costly operation as it is carried out in the HR dimensions and can lead to blurred areas as the kernel is just bilinearly interpolated.
In our proposed pipeline, instead of utilizing common single image SR methods like (Dong et al., 2015; Shi et al., 2016; Kim et al., 2016), we propose to apply a stereo-SR method.
The stereo-SR technique in (Jeon et al., 2018) takes a LR stereo pair (left and right views) as input and progressively shifts the right-view producing a stack that is concatenated with the left-view and later processed by a CNN to obtain the super-resolved left-view.
This process is made at an arbitrary and ﬁxed stride (e.g. 1 pixel at every step of the stack) and does not take into account the maximum disparity between the input views.
For our Deep 3D
Pan pipeline, we propose to use the maximum disparity prior that can be obtained from the long wing of the t-kernel to dynamically set the shifting stride.
Additionally, instead of interpolating and processing the low resolution panned view I to ( p ) on the HR dimensions, we progressively shift and then downscale the high-resolution center view I c by a factor of x2.
This allows our sr-block to operate on the LR dimensions without performance degradation, as high frequency information in the horizontal axis is not lost but distributed along the levels of the shifted center view stack as depicted in Figure 7-(a).
Our sr-block, depicted in Figure 7-(b), is a simple, yet effective module that takes as input the LR I to view and the shifted-downscaled center view stack I ncs described by
[Equation]
(8) where g ( I , s ) is an s -strided horizontal-shift and 2x down-scaling operator applied on image I .
The stride s can take any real number and the resulting image is obtained via bilinear interpolation.
N s is the depth of the stack, and was set to N s = 32 for all our experiments).
The stack is concatenated with the LR I to and passed trough four Conv-ReLU layers followed by a residual connection as shown in Figure 7-(b).
The ﬁnal step up-scales the resulting features into the target resolution via nearest interpolation followed by a convolutional layer.
The last layer reduces the number of channels to three for the ﬁnal RGB output I o .
Nearest upscaling was adopted as it yields no checkerboard artifacts in contrast with transposed or sub-pixel convolutions (Niklaus et al., 2017).
E XPERIMENTS AND RESULTS
To demonstrate the effectiveness of our “t-shaped”-dilation-adaptive kernel, we performed several experiments on the challenging KITTI2012 (Geiger et al., 2012), KITTI2015 (Menze & Geiger, 2015), and CityScapes (Cordts et al., 2016) datasets.
As these stereo datasets only consist of outdoor scenes, we also performed experiments on our indoors dataset, called the VICLAB STEREO dataset.
Surprisingly, to our best knowledge, this is the ﬁrst stereo dataset available that focuses on the indoor scene, which is planned to be publicly available for research.
Additionally, our formulation of global and local adaptive dilations allows our monster-net to be trained on multiple stereo datasets at the same time, even if these have different baselines.
Instead of over-ﬁtting on a single camera baseline like the previous methods (Xie et al.
; Godard et al.
; Zhang et al.
Luo et al.
, our monster-net can build knowledge when simultaneously trained on many datasets.
To our best knowledge, our Deep 3D Pan pipeline is the ﬁrst method designed to be trained on multiple baseline datasets concurrently for the stereoscopic view synthesis problem where unsupervised monocular depth estimation is even used particularly.
For more details about the datasets and multi-dataset training, please see the appendix A-3.
We compare our monster-net against the stereoscopic view synthesis SOTA: Deep3D Xie et al.
(2016) and a version of SepConv (Niklaus et al., 2017) modiﬁed for right-view synthesis.
Firstly, for a fair comparison, the backbone convolutional auto-encoders for the Deep3D and SepConv were set up to be equivalent to our t-net’s, that is, a six-stage encoder-decoder with skip connections and residual blocks in the encoder side.
Secondly, we compare our monster-net with Deep3D-B, a “Bigger” version of Deep3D, where, instead of 32 elements in the 1D kernel as in its original work, we use 49 elements to match the number of horizontal kernel values in our t-net.
Thirdly, we compare against SepConv-D, a dilated version of the SepConv such that the receptive ﬁeld of the separable convolutions has a size of 153x153.
The Deep3D and the SepConv models are trained without using perceptual loss as in their original works.
For a more meaningful comparison, the
Deep3D-B and the SepConv-D are trained with a combination of l 1 and perceptual loss l p (Johnson et al., 2016), and demonstrate that a better loss function than l 1 does not contribute enough to the stereoscopic view synthesis problem.
For more implementation details, reefer to the appendix A-4.
Additionally, we compare the quality of the embedded disparity in the long wing of the “t-shaped” kernel with those of the state-of-the-art models for the monocular depth estimation task.
For that, we ﬁrst deﬁne a disparity reﬁnement sub-network that uses the primitive disparity obtained from the long wing of the “t-shaped” kernel as prior information.
Secondly, we deﬁne a special postprocessing (spp) step, which, instead of relying on a naive element wise summation as in Godard
[Table]
et al.
(2017), takes into account the ambiguities of the ﬁrst and second forward passes to generate a remarkable sharp and consistent disparity map.
For more details on the reﬁnement block and our special post-processing, reefer to the appendix A-2.
4. R ESULTS ON THE KITTI, C ITY S CAPES AND THE VICLAB STEREO DATASETS
Table 1 shows the performance comparison for our method and previous works.
It is important to mention that our monster-net performs inference on full resolution images, while the previous approaches for single-view novel view synthesis perform estimation on reduced resolution inputs.
Our method outperforms the Deep3D baseline by a considerable margin of 0.7dB in PSNR, 2.0 in RMSE, and 0.03 in SSIM.
The qualitative results are shown in Figure 8.
Our method produces superior looking images.
In Deep3D and SepConv, many objects appear too blurred such that their boundaries can hardly be recognized in the synthetic images (e.g the motorcycle, persons, trafﬁc signs, etc.).
We challenged the models trained on KITTI (K) to perform inference on the CityScapes validation split (CS), and observed that our method generalizes much better than the Deep3D baseline with up to 3dB higher in PSNR.
When training the monster-net with K+CS, we get an additional improvement of 4dB PSNR in the validation CS dataset.
Incorporating an indoor dataset to our training pipeline is also possible, making our network applicable to a wide variety of scenarios.
We added the VICLAB STEREO (VL) dataset to the training, that is K+CS+VL, and observed little impact on the K dataset performance as shown in Table 1.
We also tested the performance of our monster-net on the validation split of the VL dataset.
We observed that our full monster-net trained on K+CS achieved a mean PSNR of 19.92dB, while achieving a mean PSNR of 21.78 dB when trained on K+CS+VL.
For a network trained on the outdoors dataset only it is difﬁcult to generalize to the indoors case, as the latter contains mainly homogeneous areas, whereas the outdoors case mainly contains texture rich scenes.
Visualizations on CS and VL, and ablation studies that prove the efﬁcacy of each of our design choices can be found in the appendices A-5, A-6 and A-8.
4. R ESULTS ON DISPARITY ESTIMATION
With the addition of a relatively shallow disparity reﬁnement sub-network, the monster-net remarkably outperforms all the state-of-the-art models for the unsupervised monocular depth estimation task, as shown in Table 2.
Our monster-net with disparity reﬁnement even outperforms the supervised monocular disparity estimation methods such as (Luo et al., 2018;
Gur & Wolf, 2019) and multiple view unsupervised methods such as (Wang et al., 2019a; Ranjan et al., 2019).
C ONCLUSION
We presented an adaptive “t-shaped” kernel equipped with globally and locally adaptive dilations for the Deep 3D Pan problem, deﬁned as the task of arbitrarily shifting the camera position along the X-axis for stereoscopic view synthesis.
Our proposed monster-net showed superior performance to the SOTA for right-view generation on the KITTI and the CityScapes datasets.
Our monsternet also showed very good generalization capabilities with 3dB gain in PSNR against the Deep3D baseline.
In addition, our method presents no-discontinuities, consistent geometries, good contrast, and naturally looking left or right synthetic panned images.
Our monster-net can be extended for image registration, monocular video to stereo video, and generation of novel views at any camera translation by just allowing pixel-wise rotation of our “t-shaped” kernel. A CKNOWLEDGMENTS
This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT)
(No. 2017-0-00419, Intelligent High Realistic
Visual Processing for Smart Broadcasting Media).
A A PPENDIX A. E FFECT OF FEEDING THE PAN AMOUNT TO THE T - NET
The larger the pan amount, the greater the occlusions to be handled in the synthetic output image.
The effect of feeding the pan amount P a as a one-channel constant feature to the t-net can be visualized in Figure 9, where multiple primitive disparity and occlusion maps are depicted for different pan amounts.
As shown in Figure 9, the network generates different maps for different magnitudes and directions of P a while keeping the input center image I c unchanged, conﬁrming the effect of the pan amount as prior knowledge to the network.
The difference between the disparity maps can be appreciated in the “holes” or “shadows” casted in the objects borders, as they represent the occluded content seen from the output 3D panned image.
In the red box in Figure 9 it is observed that the shadows casted by leftward and rightward camera panning appear in opposite sides ob the objects.
In the yellow box, it is observed that the larger the P a , the larger the shadows projected, as more occlusions are to be handled.
A. D ISPARITY REFINEMENT SUB - NETWORK
The disparity reﬁnement network architecture, as depicted in Figure 10, has two input branches: one takes a stack of the 2x bilinearly upscaled center image disparity prior ( D cp ) and the RGB center image ( I c ); and the other is fed with a stack of the 2x bilinearly upscaled output panned view disparity prior ( D op ) and the generated panned view ( I o ).
The disparity reﬁnement block is a relatively shallow auto-encoder with skip connections and rectangular convolutions as fusion layers in the decoder stage.
This allows to increase the receptive ﬁeld size in the horizontal axis, thus improving the stereo matching performance, as suggested by (Gonzalez & Kim, 2019b).
We conﬁgure the output layer of our reﬁnement network with the last layer of Gonzalez & Kim (2019b)’s architecture, which allows to do ambiguity learning in our reﬁnement block.
Ambiguity learning allows the network to unsupervisedly account for occlusions and complex or clutered regions that are difﬁcult to minimize in the photometric reconstruction loss (Gonzalez & Kim, 2019b).
We train the reﬁnement block with the loss functions deﬁned in (Gonzalez & Kim, 2019b) and a new additional loss towards producing the reﬁned disparity maps similar to the primitive disparity maps D cp and D op .
The reﬁnement network is encouraged to produce reﬁned center and panned disparity maps D c and D o similar to their primitive counterparts of half the resolution (as they are estimated from the t-net), by minimizing the following primitive disparity loss
[Equation]
(9) where D 1 / 2 c
and D 1 / 2 o are the bilinearly downscaled and reﬁned center and panned disparity maps by a factor of 1/2, respectively.
We give a weight of 0.5 to this new loss term.
The disparity reﬁnement block can be trained end-to-end along with the monster-net or from a pre-trained monster-net.
A.2. S PECIAL POST - PROCESSING
Instead of relying on naive post-processing approaches like in (Godard et al., 2017), which consist on running the disparity estimation twice with normal and horizontally ﬂipped inputs and then taking the average depth, we deﬁne a novel special post-processing step (spp) by taking into account the ambiguities in the ﬁrst and second forward pass.
We noted that the ambiguity learning from (Gonzalez & Kim, 2019b), which we incorporate in our disparity reﬁnement block, can be used to blend the resulting disparities from the ﬁrst and the second forward pass such that only the best disparity estimation (or ambiguity free) from each forward pass is kept on the ﬁnal post-processed disparity.
Figure 11 depicts our novel post-processing step, which consist on running the forward pass of our monster-net with disparity reﬁnement block with P a = 153 and P a = − 153 , for the ﬁrst and the second pass respectively.
Then, the generated ambiguity masks of each forward pass are concatenated to create a two-channel tensor and passed through a softmax operation along the channel axis.
The resulting soft-maxed ambiguities are used to linearly combine the disparity maps of each forward pass.
As can be observed in Figure 11, the soft-maxed ambiguity mask effectively segment the best disparity estimation from each forward pass.
Figure 12 shows the primitive disparity map, the subsequent reﬁnement step, the naive post-processing (pp) and our novel post-processing (spp).
A. T HE KITTI, C ITY S CAPES AND VICLAB STEREO DATASETS
The KITTI dataset is a very large collection of mid-resolution 370x1226 stereo images taken from a driving perspective.
We used the KITTI split as suggested in (Godard et al., 2017), which consists of 29,000 stereo pairs from 33 different scenes of the KITTI2012 dataset.
We set apart the KITTI dataset for validation as it contains 400 images excluded from the KITTI split.
Additionally, the
KITTI2015 contains sparse disparity ground truths (GTs) which are obtained from LIDAR and then are reﬁned by car CAD models.
We use these GTs to evaluate the quality of the estimated disparity that can be extracted from the long wing of the t-kernel.
CityScapes is a higher resolution stereo dataset with 24,500 stereo pairs that we extract from the train , test and train extra directories for training.
The val directory is left for validation with 500 stereo pairs.
We pre-process the
CityScapes dataset for faster and more robust training.
We ﬁrst remove the top 25, bottom and left 100 pixels to avoid car hoods and rectiﬁcation artifacts, thus yielding a ﬁnal image size of 799x1948.
Secondly, we save the cropped images in .jpg
format to accelerate loading times during training.
The VICLAB STEREO is an indoor left and right view dataset that was captured indifferent buildings on a static pedestal using a Stereolabs’s ZED TM stereo camera.
The captured 2,051 high-resolution stereo pairs were rectiﬁed via checkerboard calibration as described in this
MATLAB website 1 .
After rectiﬁcation, the images in the VICLAB STEREO yield a ﬁnal resolution of 1247x2454.
We use 2,035 stereo pairs spanning 17 buildings for training, and the remainingimages for validation.
A.3. T RAINING ON MULTIPLE DATASETS
To our best knowledge, our Deep 3D Pan pipeline is the ﬁrst method designed to be trained on multiple baseline datasets at the same time for the stereoscopic view synthesis problem and the unsupervised monocular depth estimation task.
It should be noted that the work of Facil et al.
(2019) only handled the supervised monocular depth estimation task for multiple datasets with different camera intrinsics utilizing “CAM-Convs”, which is a simpler problem than our unsupervised problem.
While they require to know the intrinsic matrix for each dataset, along with added computational complexity to perform the “CAM-Convs”, our method only requires to know the dataset baseline (distance between cameras).
To train on multiple datasets, the only required step is to multiply the P a by the relative baseline with respect to a reference dataset.
For instance, the baseline in the KITTI dataset is about 54cm, and, as mentioned before, we have set this baseline to correspond to P Ka = 153 .
Then for the CityScapes dataset, whose baseline is 22cm, its pan amount will be given by P CSa =
(22 / 54) P Ka .
For the VICLAB STEREO dataset with the baseline of 12cm long, its pan amount becomes P V L
a =
(12 / 54) P Ka .
When training on KITTI + CityScapes (K+CS), a batch of size 8 contains 4 images from each dataset.
When training on KITTI + CityScapes + VICLAB (K+CS+VL), each batch of size 8 contains 3, 3 and 2 images, respectively.
For the comparison against the recent works, we train our model and the state-of-the-art models with KITTI (K) and
KITTI + CITYSCAPES (K+CS) only, and evaluate the resulting trained models on the 400 images from the KITTI2015.
A. I MPLEMENTATION DETAILS
For the training of all models, we used the Adam optimizer (Kingma & Ba, 2014) with the recommended β ’s (0.5 and 0.999) for the regression task with a batch size of 8 for 50 epochs.
The initial learning rate was set to 0.0001 and was halved at epochs 30 and 40.
The following data augmentations on-the-ﬂy were performed: Random resize with a factor between 0.5 and 1 conditioned by the subsequent 256x512 random crop; random horizontal ﬂip, random gamma, and random color and RGB brightness.
It was observed that vertical ﬂip has made the learning more difﬁcult, thus it was avoided.
When training our model (the monster-net), the training images were sampled with a 50% chance for rightward ( P a > 0 ) or leftward ( P a < 0 ) panning.
Additionally, random resolution degradation was applied to the input only by down-scaling followed by up-scaling back to its original size using a bicubic kernel with a scaling factor between 1 and 1/3 while keeping the target view unchanged.
Random resolution degradation has improved our results by making the network more sensitive to edges and forcing it to focus more on structures and less on textures.
Similar “tricks” have been used in previous works in the form of adding noise to the input of discriminators (Sønderby et al., 2017; Zhang et al., 2019) to make them invariant to noise, and more sensible to structures.
When training our monster-net, either the left or the right view can be used as the input during training.
When the left
A.4. L OSS FUNCTION
We train our monster-net with a combination of l 1 loss and perceptual loss (Johnson et al., 2016).
The later measures the distance between the generated view ( I o or I to ) and the ground truth ( I gt ) images in the deep feature space of a pre-trained network for image classiﬁcation.
The perceptual loss is especially good to penalize deformations, textures and lack of sharpness.
The mean square error of the output of the ﬁrst three max-pooling layers from the pre-trained V GG 19 (Simonyan & Zisserman, 2014), denoted by φ l , was utilized as the perceptual loss function.
To balance the contributions of the l 1 and perceptual losses, a constant α p = 0 .
01 was introduced.
This combination of loss terms was applied to both the low-resolution panned image I to and super-resolved panned image I o to yield the total loss function L pan as follows:
[Equation]
[Equation]
where I 1 / 2 gt is the bilinearly downscaled version of the ground truth by a factor of 1/2.
A. R ESULTS ON THE C ITY S CAPES DATASET
Visualizations on the CittyScapes (CS) datasets for our monster-net trained on KITTI (K) and on
KITT + CityScapes (K+CS) are depicted in Figure 13.
The First row of Figure 13 shows the synthesized images from the Deep3D baseline, it can be noted that it over-ﬁts to the training baseline of the
KITTI dataset, performing very poorly on CityScapes.
The subsequent rows show the results for our monster-net when trained without and with the CityScapes dataset.
Our models generate very good structures and sharp panned views as depicted the red highlighted regions on Figure 13 for both cases of with and without CityScapes training.
When trained on KITTI-only, our method generalizes very well on the CityScapes dataset, with a performance improvement of 3dB over the Deep3D baseline as shown in Table 1.
When trained on K+CS, we obtain an additional improvement of 4dB against the KITTY-only trained monster-net.
Additionally, we present results for our monster-net trained with and without perceptual loss, ( L 1 ) and ( l 1 + l p ) respectively, on the CityScapes dataset.
Sharper results with clear edges and structures are achieved when utilizing the perceptual loss, as depicted in the highlighted areas in Figure 13.
A. R ESULT ON THE VICLAB STEREO INDOORS DATASET
A network that is trained on outdoor datasets only is not able to generalize well on highly homogeneous areas that are common in the indoors datasets but rare in the outdoor scenes.
Visualization of the synthetic views generated for the VICLAB STEREO (VL) indoors dataset is provided in Figure 14.
We compare the results of our network trained on K+CS versus those of our monster-net trained on K+CS+VL.
The latter achieves better generalization, as depicted in Figure 14, with marginal performance decrease in the KITTI dataset (-0.09dB) and considerable quality improvement on the
VICLAB STEREO dataset (+1.86dB), as showed in the last row of Table 1.
A. 3D PANNING BEYOND THE BASELINE
As our method allows for arbitrary camera panning, it is possible to perform 3D pan beyond the baseline as depicted in Figure 15, where the pan amount was set to go 30% beyond the baseline for both leftward and rightward camera panning, that is P a = − 200 and P a = 200 for the per-scene top and bottom samples respectively, where the input image for both pan amounts was set to be the left-view.
It is observed that the monster-net with adaptive dilations generates naturally looking new views with consistent structures and without discontinuities even at beyond training baseline 3D panning.
A. A BLATION STUDIES
We demonstrate the contribution of our design choices in this section.
Our main contribution is the adaptive “t-shaped” kernel equipped with globally and locally adaptive dilations.
Figure 16-(a) shows the effect of adaptive dilations in comparison with the ﬁxed dilation.
As can be observed, the resulting synthesized image by a ﬁxed local dilation kernel shows unnaturally looking regions with low contrast, discontinuities and blurs.
Unlike any previous work, our pipeline can greatly beneﬁt from training on multiple datasets at the same time, as shown in Figure 16-(b).
That is, our method greatly beneﬁts from training on two datasets (KITTI and CityScapes) as it exploits the baseline information via its global adaptive dilation property.
Training on both KITTI and CityScapes contributes to improved geometry reconstruction as the network is exposed to a wide variety of objects at many different resolutions where, in addition to applying random resizing during training, the resolutions and baselines of these two datasets are very different.
Figure 16-(c) shows the effect of utilizing our sr-block.
Even if the quality of the panned image I to is good in terms of structure, the sharpness is further improved by the addition of the super resolution block.
Finally, we analyze the effect of the perceptual loss.
By utilizing the perceptual loss, our monter-net is able to better synthesize rich textures and complex or thin structures, as depicted in Figure 16-(d), even though the PSNR and SSIM are slightly lower as shown in Table 1.
The last is known as the “perception-distortion tradeoff” (Blau & Michaeli, 2018) which suggests that better synthetic looking images not always yield higher PSNR/SSIM.
A. D ISPARITY / DEPTH ESTIMATION RESULTS
Our monster-net with reﬁnement block beats the current state-of-the-art methods for unsupervised monocular depth estimation in terms of prediction accuracy for the KITTI2015 dataset.
As shown in Table 3, the primitive disparity D p , that can be extracted from the longer wing of the “t-shaped” kernel, is already among the best performing unsupervised methods.
When we add the reﬁnement block with ambiguity learning, our model results outperform those of the state-of-the-art.
Furthermore, we get an additional improvement in the a 1 accuracy metric when we add our novel specialpost-processing (spp) step.
The qualitative comparison against previous methods and the ground truth disparity is shown in Figure 17.
It is noted that our monster-net with disparity reﬁnement and special-post-processing generates very reliable disparity maps even on thin structures and image borders.
Additionally, our method beneﬁts from very good detection of far away objects [Table] ) x K 0.
[Table]
[Table]
978 0.989 Lai et al.
(2019) (s) x x
K 0.
0.948 0.979 0.990 Wang et al.
(2019b)
(s) x x
K 0.
[Table]
[Table]
[Table]
[Table]
[Table]