default search action
Dror Aiger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c11]Itai Lang, Dror Aiger, Forrester Cole, Shai Avidan, Michael Rubinstein:
SCOOP: Self-Supervised Correspondence and Optimization-Based Scene Flow. CVPR 2023: 5281-5290 - [c10]Dror Aiger, André Araújo, Simon Lynen:
Yes, we CANN: Constrained Approximate Nearest Neighbors for local feature-based visual localization. ICCV 2023: 13293-13303 - [i9]Dror Aiger, André Araújo, Simon Lynen:
Yes, we CANN: Constrained Approximate Nearest Neighbors for local feature-based visual localization. CoRR abs/2306.09012 (2023) - 2022
- [i8]Itai Lang, Dror Aiger, Forrester Cole, Shai Avidan, Michael Rubinstein:
SCOOP: Self-Supervised Correspondence and Optimization-Based Scene Flow. CoRR abs/2211.14020 (2022) - 2021
- [c9]Dror Aiger, Simon Lynen, Jan Hosang, Bernhard Zeisl:
Efficient Large Scale Inlier Voting for Geometric Vision Problems. ICCV 2021: 3223-3231 - [i7]Dror Aiger, Simon Lynen, Jan Hosang, Bernhard Zeisl:
Efficient Large Scale Inlier Voting for Geometric Vision Problems. CoRR abs/2107.11810 (2021) - 2020
- [j13]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. 91: 101666 (2020) - [j12]Simon Lynen, Bernhard Zeisl, Dror Aiger, Michael Bosse, Joel A. Hesch, Marc Pollefeys, Roland Siegwart, Torsten Sattler:
Large-scale, real-time visual-inertial localization revisited. Int. J. Robotics Res. 39(9) (2020) - [i6]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. CoRR abs/2005.08193 (2020) - [i5]Dror Aiger, Haim Kaplan, Micha Sharir:
Duality-based approximation algorithms for depth queries and maximum depth. CoRR abs/2006.12318 (2020)
2010 – 2019
- 2019
- [c8]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. SoCG 2019: 8:1-8:14 - [i4]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General techniques for approximate incidences and their application to the camera posing problem. CoRR abs/1903.07047 (2019) - [i3]Simon Lynen, Bernhard Zeisl, Dror Aiger, Michael Bosse, Joel A. Hesch, Marc Pollefeys, Roland Siegwart, Torsten Sattler:
Large-scale, real-time visual-inertial localization revisited. CoRR abs/1907.00338 (2019) - 2018
- [j11]Dror Aiger, Micha Sharir:
Homotheties and incidences. Discret. Math. 341(7): 2011-2017 (2018) - 2017
- [c7]Dror Aiger, Haim Kaplan, Micha Sharir:
Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA 2017: 5:1-5:13 - [i2]Dror Aiger, Micha Sharir:
Homotheties and incidences. CoRR abs/1709.02933 (2017) - [i1]Dror Aiger, Brett Allen, Aleksey Golovinskiy:
Large-Scale 3D Scene Classification With Multi-View Volumetric CNN. CoRR abs/1712.09216 (2017) - 2014
- [j10]Nicolas Mellado, Dror Aiger, Niloy J. Mitra:
Super 4PCS Fast Global Pointcloud Registration via Smart Indexing. Comput. Graph. Forum 33(5): 205-215 (2014) - [j9]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. 43(4): 1363-1395 (2014) - 2013
- [c6]Dror Aiger, Efi Kokiopoulou, Ehud Rivlin:
Random Grids: Fast Approximate Nearest Neighbors and Range Searching for Image Search. ICCV 2013: 3471-3478 - [c5]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting neighbors in high-dimensional Euclidean spaces. SODA 2013: 784-803 - 2012
- [j8]Dror Aiger, Daniel Cohen-Or, Niloy J. Mitra:
Repetition Maximization based Texture Rectification. Comput. Graph. Forum 31(2pt2): 439-448 (2012) - 2011
- [c4]Dror Aiger, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer:
Efficient Robust Digital Hyperplane Fitting with Bounded Error. DGCI 2011: 223-234 - 2010
- [j7]Dror Aiger, Klara Kedem:
Approximate input sensitive algorithms for point pattern matching. Pattern Recognit. 43(1): 153-159 (2010) - [c3]Dror Aiger, Hugues Talbot:
The phase only transform for unsupervised surface defect detection. CVPR 2010: 295-302
2000 – 2009
- 2009
- [j6]Dror Aiger, Klara Kedem:
A GPU-Based Algorithm for Approximately Finding the Largest Common Point Set in the Plane under Similarity Transformation. Int. J. Image Graph. 9(2): 287-298 (2009) - [j5]Dror Aiger, Klara Kedem:
Geometric pattern matching for point sets in the plane under similarity transformations. Inf. Process. Lett. 109(16): 935-940 (2009) - 2008
- [j4]Dror Aiger, Klara Kedem:
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space. Inf. Process. Lett. 105(6): 224-230 (2008) - [j3]Dror Aiger, Niloy J. Mitra, Daniel Cohen-Or:
4-points congruent sets for robust pairwise surface registration. ACM Trans. Graph. 27(3): 85 (2008) - [c2]Rami Ben-Ari, Dror Aiger:
Geodesic Active Contours with Combined Shape and Appearance Priors. ACIVS 2008: 494-505 - 2007
- [c1]Dror Aiger, Klara Kedem:
Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations. CCCG 2007: 181-184 - 2000
- [j2]Dror Aiger, Daniel Cohen-Or:
Mosaicing Ultrasonic Volumes for Visual Simulation. IEEE Computer Graphics and Applications 20(2): 53-61 (2000)
1990 – 1999
- 1998
- [j1]Dror Aiger, Daniel Cohen-Or:
Real-Time Ultrasound Imaging Simulation. Real Time Imaging 4(4): 263-274 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint