no code implementations • 2 Apr 2024 • Di Qiu, yinda zhang, Thabo Beeler, Vladimir Tankovich, Christian Häne, Sean Fanello, Christoph Rhemann, Sergio Orts Escolano
We propose CHOSEN, a simple yet flexible, robust and effective multi-view depth refinement framework.
no code implementations • 20 Jul 2022 • Weiwei Sun, Daniel Rebain, Renjie Liao, Vladimir Tankovich, Soroosh Yazdani, Kwang Moo Yi, Andrea Tagliasacchi
We introduce a method for instance proposal generation for 3D point clouds.
8 code implementations • CVPR 2021 • Vladimir Tankovich, Christian Häne, yinda zhang, Adarsh Kowdle, Sean Fanello, Sofien Bouaziz
Contrary to many recent neural network approaches that operate on a full cost volume and rely on 3D convolutions, our approach does not explicitly build a volume and instead relies on a fast multi-resolution initialization step, differentiable 2D geometric propagation and warping mechanisms to infer disparity hypotheses.
Ranked #1 on Stereo Depth Estimation on KITTI2015
1 code implementation • ECCV 2018 • Yinda Zhang, Sameh Khamis, Christoph Rhemann, Julien Valentin, Adarsh Kowdle, Vladimir Tankovich, Michael Schoenberg, Shahram Izadi, Thomas Funkhouser, Sean Fanello
In this paper we present ActiveStereoNet, the first deep learning solution for active stereo systems.
no code implementations • ICCV 2017 • Sean Ryan Fanello, Julien Valentin, Adarsh Kowdle, Christoph Rhemann, Vladimir Tankovich, Carlo Ciliberto, Philip Davidson, Shahram Izadi
Numerous computer vision problems such as stereo depth estimation, object-class segmentation and foreground/background segmentation can be formulated as per-pixel image labeling tasks.
no code implementations • CVPR 2017 • Sean Ryan Fanello, Julien Valentin, Christoph Rhemann, Adarsh Kowdle, Vladimir Tankovich, Philip Davidson, Shahram Izadi
Efficient estimation of depth from pairs of stereo images is one of the core problems in computer vision.
no code implementations • CVPR 2016 • Sean Ryan Fanello, Christoph Rhemann, Vladimir Tankovich, Adarsh Kowdle, Sergio Orts Escolano, David Kim, Shahram Izadi
We contribute an algorithm for solving this correspondence problem efficiently, without compromising depth accuracy.