Search Results for author: Dror Aiger

Found 6 papers, 3 papers with code

Yes, we CANN: Constrained Approximate Nearest Neighbors for local feature-based visual localization

1 code implementation ICCV 2023 Dror Aiger, André Araujo, Simon Lynen

In this paper, we take a step back from this assumption and propose Constrained Approximate Nearest Neighbors (CANN), a joint solution of k-nearest-neighbors across both the geometry and appearance space using only local features.

Image Retrieval Retrieval +1

SCOOP: Self-Supervised Correspondence and Optimization-Based Scene Flow

1 code implementation CVPR 2023 Itai Lang, Dror Aiger, Forrester Cole, Shai Avidan, Michael Rubinstein

Scene flow estimation is a long-standing problem in computer vision, where the goal is to find the 3D motion of a scene from its consecutive observations.

regression Scene Flow Estimation

Efficient Large Scale Inlier Voting for Geometric Vision Problems

no code implementations ICCV 2021 Dror Aiger, Simon Lynen, Jan Hosang, Bernhard Zeisl

Outlier rejection and equivalently inlier set optimization is a key ingredient in numerous applications in computer vision such as filtering point-matches in camera pose estimation or plane and normal estimation in point clouds.

Pose Estimation

Large-Scale 3D Scene Classification With Multi-View Volumetric CNN

no code implementations26 Dec 2017 Dror Aiger, Brett Allen, Aleksey Golovinskiy

We introduce a method to classify imagery using a convo- lutional neural network (CNN) on multi-view image pro- jections.

Classification General Classification +2

Super 4PCS Fast Global Pointcloud Registration via Smart Indexing

1 code implementation Computer Graphics Forum 2014 Nicolas Mellado, Dror Aiger, Niloy J. Mitra

We present Super 4PCS for global pointcloud registration that is optimal, i. e., runs in linear time (in the number of data points) and is also output sensitive in the complexity of the alignment problem based on the (unknown) overlap across scan pairs.

Point Cloud Registration

Cannot find the paper you are looking for? You can Submit a new open access paper.