activity
20172025
most citedLarge-Scale 3D Scene Classification With Multi-View Volumetric CNN

5 citations · 9 across the 7 of their papers we have counts for

collaborators

10 papers

cs.IR2025

Global-to-Local or Local-to-Global? Enhancing Image Retrieval with Efficient Local Search and Effective Global Re-ranking

Dror Aiger, Bingyi Cao, Kaifeng Chen +1

The dominant paradigm in image retrieval systems today is to search large databases using global image features, and re-rank those initial results with local image feature matching…

cs.CV2023

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

Dror Aiger, André Araujo, Simon Lynen

Large-scale visual localization systems continue to rely on 3D point clouds built from image collections using structure-from-motion. While the 3D points in these models are repres…

cs.CV2022★ 4 cited

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

Itai Lang, Dror Aiger, Forrester Cole +2

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. Recently, there have been…

cs.CV2021

Efficient Large Scale Inlier Voting for Geometric Vision Problems

Dror Aiger, Simon Lynen, Jan Hosang +1

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…

cs.CG2020

Duality-based approximation algorithms for depth queries and maximum depth

Dror Aiger, Haim Kaplan, Micha Sharir

We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement of a collection of halfplane…

cs.CG2020

Output sensitive algorithms for approximate incidences and their applications

Dror Aiger, Haim Kaplan, Micha Sharir

An -approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most from each othe…