Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luke Oeding

dblp:128/3820 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0003-2394-1404ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › camera pose estimation
relative pose estimation
0.712023
Four-view Geometry with Unknown Radial Distortion · CVPR 2023
Computational photography and imaging
camera calibration
0.712023
Four-view Geometry with Unknown Radial Distortion · CVPR 2023
Computational photography and imaging › camera calibration
radial distortion
0.712023
Four-view Geometry with Unknown Radial Distortion · CVPR 2023

Methods — techniques the papers use, named apart from their topics

polynomial system solving · 1.3minimal problem solving · 1.3bundle adjustment · 1.3
YearPublicationVenuePosition
2023 Four-view Geometry with Unknown Radial Distortion
abstract
We present novel solutions to previously unsolved prob-lems of relative pose estimation from images whose calibration parameters, namely focal lengths and radial distortion, are unknown. Our approach enables metric reconstruction without modeling these parameters. The minimal case for reconstruction requires 13 points in 4 views for both the calibrated and uncalibrated cameras. We describe and implement the first solution to these minimal problems. In the calibrated case, this may be modeled as a polynomial sys-tem of equations with 3584 solutions. Despite the apparent intractability, the problem decomposes spectacularly. Each solution falls into a Euclidean symmetry class of size 16, and we can estimate 224 class representatives by solving a sequence of three subproblems with 28, 2, and 4 solutions. We highlight the relationship between internal constraints on the radial quadrifocal tensor and the relations among the principal minors of a$4\times 4$matrix. We also address the case of 4 upright cameras, where 7 points are minimal. Finally, we evaluate our approach on simulated and real data and benchmark against previous calibration-free solutions, and show that our method provides an efficient startup for an SfM pipeline with radial cameras.
Petr Hruby, Viktor Korotynskiy, Timothy Duff, Luke Oeding, Marc Pollefeys, Tomás Pajdla, Viktor Larsson
CVPR4
2013 Eigenvectors of tensors and algorithms for Waring decomposition
Luke Oeding, Giorgio Ottaviani
J. Symb. Comput.1