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

Ling Gao 0001

dblp:88/3528-1 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0003-2294-5155ORCID · verified

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

Artificial intelligence and machine learning · 7 · 4 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 3 since 2021Systems, architecture and hardware · 2 · 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
7 papers
3D vision · 68% Robot navigation and mapping · 32%
Theoretical computer science
3 papers
Mathematical optimization · 100%
Computer graphics and multimedia
2 papers
Computational photography and imaging · 64% Image and video processing · 36%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › motion estimation
event-based motion estimation
1.732023
A 5-Point Minimal Solver for Event Camera Relative Motion Estimation · ICCV 2023
Globally-Optimal Contrast Maximisation for Event Cameras · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Globally-Optimal Event Camera Motion Estimation · ECCV (26) 2020
Computer vision › 3D vision
motion estimation
1.532024
A 5-Point Minimal Solver for Event Camera Relative Motion Estimation · ICCV 2023
Globally-Optimal Contrast Maximisation for Event Cameras · IEEE Trans. Pattern Anal. Mach. Intell. 2022
An N-Point Linear Solver for Line and Motion Estimation with Event Cameras · CVPR 2024
Computer vision › 3D vision
camera pose estimation
0.912025
A Linear N-Point Solver for Structure and Motion from Asynchronous Tracks · ICCV 2025
Computer vision › 3D vision
structure from motion
0.912025
A Linear N-Point Solver for Structure and Motion from Asynchronous Tracks · ICCV 2025
Computational photography and imaging
event camera
0.812024
An N-Point Linear Solver for Line and Motion Estimation with Event Cameras · CVPR 2024
Mathematical optimization › numerical computation
linear solver
0.812024
An N-Point Linear Solver for Line and Motion Estimation with Event Cameras · CVPR 2024
Mathematical optimization › integer programming
branch-and-bound
0.722022
Globally-Optimal Contrast Maximisation for Event Cameras · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles · ICRA 2020
Mathematical optimization
global optimization
0.722022
Globally-Optimal Contrast Maximisation for Event Cameras · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles · ICRA 2020
Computer vision › 3D vision › geometric optimization
minimal solver
0.712023
A 5-Point Minimal Solver for Event Camera Relative Motion Estimation · ICCV 2023
Computer vision › 3D vision
contrast maximization
0.612022
Globally-Optimal Contrast Maximisation for Event Cameras · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Robotics › Robot navigation and mapping › localization › map-based localization
floor-plan-based localization
0.612022
FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization · ICRA 2022
Robotics › Robot navigation and mapping › localization › range-based localization
LiDAR localization
0.612022
FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization · ICRA 2022
Robotics › Robot navigation and mapping
localization
0.612022
FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization · ICRA 2022
Robotics › Robot navigation and mapping › SLAM › graph optimization
pose graph optimization
0.612022
FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization · ICRA 2022
Robotics › Robot navigation and mapping
SLAM
0.612022
FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization · ICRA 2022
Computer vision › 3D vision › motion estimation
correspondence-free motion estimation
0.412020
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles · ICRA 2020
Computer vision › 3D vision
event-based vision
0.412020
Globally-Optimal Event Camera Motion Estimation · ECCV (26) 2020
Robotics › Robot navigation and mapping
visual odometry
0.412020
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles · ICRA 2020
Image and video processing
motion estimation
0.412020
Globally-Optimal Event Camera Motion Estimation · ECCV (26) 2020

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

velocity averaging · 2.3polynomial constraint solving · 2.3branch-and-bound · 2.0homographic warping · 1.1contrast maximization · 1.1minimal solver · 0.9linear solver · 0.9nonlinear parametrization · 0.7plane detection · 0.6nearest neighbour data structure · 0.6planar homography · 0.4globally-optimal estimation · 0.4event camera · 0.4ackermann steering model · 0.4
YearPublicationVenuePosition
2025 A Linear N-Point Solver for Structure and Motion from Asynchronous Tracks
Yunlong Feng, Daniel Gehrig, Panfeng Jiang, Ling Gao 0001, Xavier Lagorce, Laurent Kneip
ICCV5
2024 An N-Point Linear Solver for Line and Motion Estimation with Event Cameras
abstract
Event cameras respond primarily to edges─formed by strong gradients─and are thus particularly well-suited for line-based motion estimation. Recent work has shown that events generated by a single line each satisfy a polynomial constraint which describes a manifold in the space-time volume. Multiple such constraints can be solved simultaneously to recover the partial linear velocity and line parameters. In this work, we show that, with a suitable line parametrization, this system of constraints is actually linear in the unknowns, which allows us to design a novel linear solver. Unlike existing solvers, our linear solver (i) is fast and numerically stable since it does not rely on expensive root finding, (ii) can solve both minimal and overdetermined systems with more than 5 events (i.e. N ≥ 5), and (iii) admits the characterization of all degenerate cases and multiple solutions. The found line parameters are singularity-free and have a fixed scale, which eliminates the need for auxiliary constraints typically encountered in previous work. To recover the full linear camera velocity we fuse observations from multiple lines with a novel velocity averaging scheme that relies on a geometrically-motivated residual, and thus solves the problem more efficiently than previous schemes which minimize an algebraic residual. Extensive experiments in synthetic and real-world settings demonstrate that our method surpasses the previous work in numerical stability, and operates over 600 times faster. Project page: https://mgaoling.github.io/eventail/
Ling Gao 0001, Daniel Gehrig, Davide Scaramuzza 0001, Laurent Kneip
CVPR1
2023 A 5-Point Minimal Solver for Event Camera Relative Motion Estimation
abstract
Event-based cameras are ideal for line-based motion estimation, since they predominantly respond to edges in the scene. However, accurately determining the camera displacement based on events continues to be an open problem. This is because line feature extraction and dynamics estimation are tightly coupled when using event cameras, and no precise model is currently available for describing the complex structures generated by lines in the space-time volume of events. We solve this problem by deriving the correct non-linear parametrization of such manifolds, which we term eventails, and demonstrate its application to eventbased linear motion estimation, with known rotation from an Inertial Measurement Unit. Using this parametrization, we introduce a novel minimal 5-point solver that jointly estimates line parameters and linear camera velocity projections, which can be fused into a single, averaged linear velocity when considering multiple lines. We demonstrate on both synthetic and real data that our solver generates more stable relative motion estimates than other methods while capturing more inliers than clustering based on spatiotemporal planes. In particular, our method consistently achieves a 100% success rate in estimating linear velocity where existing closed-form solvers only achieve between 23% and 70%. The proposed eventails contribute to a better understanding of spatio-temporal event-generated geometries and we thus believe it will become a core building block of future event-based motion estimation algorithms.
Ling Gao 0001, Daniel Gehrig, Marco Cannici, Davide Scaramuzza 0001, Laurent Kneip
ICCV1
2022 FP-Loc: Lightweight and Drift-free Floor Plan-assisted LiDAR Localization
abstract
We present a novel framework for floor plan-based, full six degree-of-freedom LiDAR localization. Our approach relies on robust ceiling and ground plane detection, which solves part of the pose and supports the segmentation of vertical structure elements such as walls and pillars. Our core contribution is a novel nearest neighbour data structure for an efficient look-up of nearest vertical structure elements from the floor plan. The registration is realized as a pair-wise regularized windowed pose graph optimization. Highly efficient, accurate and drift-free long-term localization is demonstrated on multiple scenes.
Ling Gao 0001, Laurent Kneip
ICRA1
2022 Globally-Optimal Contrast Maximisation for Event Cameras
abstract
Event cameras are bio-inspired sensors that perform well in challenging illumination conditions and have high temporal resolution. However, their concept is fundamentally different from traditional frame-based cameras. The pixels of an event camera operate independently and asynchronously. They measure changes of the logarithmic brightness and return them in the highly discretised form of time-stamped events indicating a relative change of a certain quantity since the last event. New models and algorithms are needed to process this kind of measurements. The present work looks at several motion estimation problems with event cameras. The flow of the events is modelled by a general homographic warping in a space-time volume, and the objective is formulated as a maximisation of contrast within the image of warped events. Our core contribution consists of deriving globally optimal solutions to these generally non-convex problems, which removes the dependency on a good initial guess plaguing existing methods. Our methods rely on branch-and-bound optimisation and employ novel and efficient, recursive upper and lower bounds derived for six different contrast estimation functions. The practical validity of our approach is demonstrated by a successful application to three different event camera motion estimation problems.
Xin Peng 0005, Ling Gao 0001, Yifu Wang, Laurent Kneip
IEEE Trans. Pattern Anal. Mach. Intell.2
2020 Globally-Optimal Event Camera Motion Estimation
Xin Peng 0005, Yifu Wang, Ling Gao 0001, Laurent Kneip
ECCV (26)3
2020 Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles
abstract
The motion of planar ground vehicles is often non-holonomic, and as a result may be modelled by the 2 DoF Ackermann steering model. We analyse the feasibility of estimating such motion with a downward facing camera that exerts fronto-parallel motion with respect to the ground plane. This turns the motion estimation into a simple image registration problem in which we only have to identify a 2-parameter planar homography. However, one difficulty that arises from this setup is that ground-plane features are indistinctive and thus hard to match between successive views. We encountered this difficulty by introducing the first globally-optimal, correspondence-less solution to plane-based Ackermann motion estimation. The solution relies on the branch-and-bound optimisation technique. Through the low-dimensional parametrisation, a derivation of tight bounds, and an efficient implementation, we demonstrate how this technique is eventually amenable to accurate real-time motion estimation. We prove its property of global optimality and analyse the impact of assuming a locally constant centre of rotation. Our results on real data finally demonstrate a significant advantage over the more traditional, correspondence-based hypothesise-and-test schemes.
Ling Gao 0001, Junyan Su, Jiadi Cui, Xiangchen Zeng, Xin Peng 0005, Laurent Kneip
ICRA1