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

Lucas Brynte

dblp:227/6555 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0002-0794-291XORCID · corroborated

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

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

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.

Artificial intelligence
2 papers
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
structure from motion
0.812024
Learning Structure-From-Motion with Graph Attention Networks · CVPR 2024
Computer vision › 3D vision › visual localization
long-term visual localization
0.312018
Semantic Match Consistency for Long-Term Visual Localization · ECCV (2) 2018
Computer vision › 3D vision
visual localization
0.312018
Semantic Match Consistency for Long-Term Visual Localization · ECCV (2) 2018
Computer vision › 3D vision › structure from motion
bundle adjustment
0.212024
Learning Structure-From-Motion with Graph Attention Networks · CVPR 2024

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

graph neural network · 0.8graph attention network · 0.8semantic matching · 0.3feature matching · 0.3
YearPublicationVenuePosition
2024 Learning Structure-From-Motion with Graph Attention Networks
abstract
In this paper we tackle the problem of learning Structure-from-Motion (SfM) through the use of graph attention networks. SfM is a classic computer vision problem that is solved though iterative minimization of reprojection errors, referred to as Bundle Adjustment (BA), starting from a good initialization. In order to obtain a good enough initial-ization to BA, conventional methods rely on a sequence of sub-problems (such as pairwise pose estimation, pose averaging or triangulation) which provide an initial solution that can then be refined using BA. In this work we re-place these sub-problems by learning a model that takes as input the 2D keypoints detected across multiple views, and outputs the corresponding camera poses and 3D key-point coordinates. Our model takes advantage of graph neural networks to learn SfM-specijic primitives, and we show that it can be used for fast inference of the reconstruction for new and unseen sequences. The experimental results show that the proposed model outperforms com-peting learning-based methods, and challenges COLMAP while having lower runtime. Our code is available at: https://github.com/lucasbrynte/gasfm/.
Lucas Brynte, José Pedro Iglesias, Carl Olsson, Fredrik Kahl
CVPR1
2020 Pose Proposal Critic: Robust Pose Refinement by Learning Reprojection Errors
Lucas Brynte, Fredrik Kahl
BMVC1
2018 Semantic Match Consistency for Long-Term Visual Localization
Carl Toft, Erik Stenborg, Lars Hammarstrand, Lucas Brynte, Marc Pollefeys, Torsten Sattler, Fredrik Kahl
ECCV (2)4