Source-linked AI summary
Real-time Event-camera Stereo Visual Odometry via Keytime Gaussian Process Regression
Nikan Nobari, Jonathan D. Gammell
TL;DR
Frame-based VO struggles under motion blur or poor contrast, while continuous-time GP estimation can require a state for every measurement. This pipeline uses sparse keytimes and WNOA interpolation to retain event timestamps; on MVSEC and DSEC, it runs in real time and outperforms ES-PTAM on all but one tested sequence.
Problem
Frame-based VO struggles with motion blur or poor contrast, while continuous-time GP estimation can require a state for every measurement.
Source: §I · p. 1, 3) Optimization and Keytime Jacobians · p. 6Method
The pipeline uses MC-RANSAC for event-feature outlier rejection and sparse keytimes with WNOA interpolation to evaluate measurements at their individual timestamps.
Source: §I · p. 1Results
The keytime estimator outperforms ES-PTAM in global and relative error on all but one tested sequence while achieving real-time performance on MVSEC and DSEC.
Source: §V · p. 7Takeaways & Limitations
The keytime formulation reduces state size relative to GPCT without compromising estimation accuracy.
Source: C. Experiment 1: Estimation Accuracy… · p. 6, §V · p. 7
Abstract
from arXiv · showhide
Event cameras have microsecond-level temporal resolution and high dynamic range which make them more resilient to motion blur and poor illumination than standard frame-based cameras. Event-camera visual odometry (VO) pipelines maximize these benefits when they process the asynchronous event stream at the native temporal resolution. Continuous-time Gaussian process (GP) regression and a white-noise-on-acceleration (WNOA) prior can handle asynchronous measurements but result in a prohibitively large estimation state when applied naively. This paper presents a continuous-time event-camera stereo VO pipeline that maintains the native measurement times of asynchronous events while also running in real time. It reduces the estimation states to keytimes while maintaining full temporal resolution by interpolating measurements to their exact timestamps with a physically founded WNOA prior. This decouples the state size from the dense number of measurements without discarding their asynchronous nature. The real-time continuous-time VO pipeline is evaluated on the MVSEC and DSEC datasets. It provides estimates in real time that are more accurate than ES-PTAM, a state-of-the-art discrete estimator, in all but one of the tested sequences. The pipeline respectively provides estimates at 22 Hz and 6 Hz on MVSEC and DSEC and RMS relative errors of 0.46 cm and 0.038 degrees across all valid sequences, which were 11 and 15 times better than ES-PTAM, respectively.
I. INTRODUCTION
The paper addresses event-camera VO methods that lose asynchronous timing or make continuous-time estimation too costly for real-time use. It introduces a keytime-based pipeline and evaluates it against existing estimators.
I. INTRODUCTION
- Naively applying continuous-time GP estimation with a WNOA prior requires a state for every event feature and does not run in real time.Continuous-time methods can preserve individual asynchronous measurement times during estimation.Source: §I · p. 1
- Sparse keytimes reduce the estimation state while WNOA interpolation evaluates each event feature at its individual timestamp.MC-RANSAC rejects outliers using event features at their individual timestamps before state estimation.Source: §I · p. 1
- The pipeline outperforms ES-PTAM on all but one tested sequence, at 22 Hz on MVSEC and 6 Hz on DSEC.The evaluation also reports similar accuracy to the non-real-time GPCT pipeline while reducing state size.Source: §I · p. 1
A. Discrete-time Approaches
- Discrete-time approaches group events during state estimation, reducing temporal resolution and potentially reintroducing motion blur and estimation inaccuracies.Other discrete pipelines may preserve event timing in the front end but group events in the back end.Source: §I · p. 1, A. Discrete-time Approaches · p. 2
B. Continuous-time Approaches
Continuous-time approaches preserve asynchronous event measurements, but prior systems face constraints in real-time performance, sensing requirements, or motion scope. This paper combines GP/WNOA trajectory estimation with keytimes and MC-RANSAC to reduce state size while retaining event timing.
B. Continuous-time Approaches
- GPCT preserves asynchronous measurements with MC-RANSAC but places a state at every measurement time, limiting real-time performance.The proposed keytime formulation is compared with GPCT as a way to reduce state size.Source: B. Continuous-time Approaches · p. 3
- The proposed stereo event-camera VO uses GP/WNOA keytime interpolation and MC-RANSAC to decouple state size from measurement count and achieve real-time performance.It reports reduced optimization times and uses a producer-consumer architecture.Source: B. Continuous-time Approaches · p. 3
III. METHODOLOGY
The method estimates a sparse trajectory at keytimes while evaluating reprojection residuals at each event feature’s timestamp through GP interpolation with a WNOA prior. Its notation describes the SE(3) pose and velocity representation used for this trajectory.
III. METHODOLOGY
- The pipeline applies MC-RANSAC to timestamped event features, selects sparse keytimes, and minimizes per-measurement reprojection residuals using WNOA interpolation.The resulting continuous camera trajectory can be queried by interpolation both online and a posteriori.Source: §III · p. 3
A. Notation
- The notation maps between R6 coordinates and SE(3) using the matrix exponential and logarithm, and represents pose as an SE(3) transform.The state includes linear and angular velocity components, and the stated constant body-centric velocity over a time interval yields the transform between its endpoint frames.Source: A. Notation · p. 3
B. Outlier Rejection
Outlier rejection uses motion-compensated RANSAC to estimate constant velocity from asynchronous observations, rather than assuming simultaneous measurements. Its fast model calculation uses a linearized residual to derive velocity from a random subset of stereo landmarks.
B. Outlier Rejection
- MC-RANSAC estimates constant velocity from individually timestamped event features, unlike frame-based RANSAC’s simultaneous-measurement assumption.The closed-form Euclidean-residual variant is approximate but faster than the iterative measurement-space method.Source: B. Outlier Rejection · p. 3
1) Fast Model Calculation:
- A randomly selected landmark subset yields an initial velocity through a closed-form quadratic approximation of the squared Euclidean residual.The residual can be linearized with a first-order exponential-map approximation when the transform is small, as often occurs over short durations.Source: 1) Fast Model Calculation · pp. 3–4
2) Inlier and Outlier Classification:
The section classifies measurement pairs as inliers using a residual threshold, refines promising inlier sets, and represents the continuous-time trajectory with keytime-bounded local states under a WNOA model.
2) Inlier and Outlier Classification:
- A measurement pair is an inlier when its normalized nonlinear reprojection residual falls below the user-specified threshold αthresh.The initial velocity comes from a randomly sampled subset of landmark measurements.Source: 2) Inlier and Outlier Classification · p. 4
3) Inlier Refinement:
- Promising inlier sets are refined by repeating model calculation and classification over the entire inlier set, with the largest set and its velocity used to initialize estimation.The number of random-sampling iterations is user-selected.Source: 3) Inlier Refinement · p. 4
C. Continous-time Trajectory Optimization via Keytime Interpolation
- The trajectory uses a GP on local pose perturbations and their derivatives between keytimes, with acceleration driven by zero-mean white Gaussian noise.The WNOA formulation maintains a linear, time-invariant SDE; QC is the diagonal power spectral density matrix.Source: C. Continous-time Trajectory… · p. 4
1) Problem Definition:
The estimation problem jointly optimizes keytime states and landmark states using measurement and motion-prior costs. It is defined over asynchronous observation times, with far fewer keytimes than measurements.
- The problem contains M landmarks observed at K asynchronous measurement times and N keytimes, with N ≪ M < K.The landmark states are homogeneous coordinates.Source: 1) Problem Definition · p. 4
- Keytime states are estimated by minimizing a joint cost comprising measurement and prior terms.The prior penalizes deviation from WNOA kinematics, while the measurement term penalizes deviation from observations.Source: 1) Problem Definition · p. 4
- The measurement cost uses landmark reprojection residuals evaluated with the interpolated pose at each observation time.The residual is weighted by its measurement covariance and uses a nonlinear landmark transformation model.Source: 1) Problem Definition · p. 4
2) Keytime Interpolation:
Each measurement pose is interpolated from the two adjacent keytime states, allowing reprojection residuals to be evaluated at the measurement’s own timestamp.
- Each measurement pose T(tk) is interpolated from adjacent keytime states xn and xn+1 when tn ≤ tk < tn+1.The interpolation matrices use local states related to global pose and velocity states; the WNOA covariance and state-transition matrix define the interpolation.Source: 2) Keytime Interpolation · p. 5
3) Optimization and Keytime Jacobians:
The estimator linearizes the joint measurement-and-prior cost and iteratively updates keytime and landmark states. Interpolation makes measurement Jacobians span adjacent keytime blocks while retaining a sparse structure for solving.
- The final trajectory is obtained by iteratively minimizing the joint cost using analytical measurement Jacobians and numerical optimization such as Gauss–Newton.The optimization uses nominal operating points and state perturbations to form a quadratic approximation.Source: 3) Optimization and Keytime Jacobians · p. 5
- The approximate Hessian and gradient define the linear system whose solution supplies the perturbation minimizing the quadratic approximation.The SE(3) inverse Jacobian is approximated by a second-order Taylor expansion.Source: 3) Optimization and Keytime Jacobians · p. 5
- Measurement Jacobians span two adjacent keytime block columns, preserving an approximate Hessian structure suitable for sparse linear solvers while reducing state size.The chain rule maps changes in adjacent keytime states through interpolation to changes in the landmark transformation model.Source: 3) Optimization and Keytime Jacobians · pp. 5–6
IV. EXPERIMENTS
Experiments use MVSEC and DSEC to assess keytime estimation against continuous-time GPCT and discrete ES-PTAM, including real-time performance.
- MVSEC and DSEC have sensor resolutions of 346 × 260 and 640 × 480, respectively.Source: §IV · p. 6
- The GPCT comparison on MVSEC indoor1 and indoor3 evaluates how keytimes affect continuous-time trajectory accuracy.Source: §IV · p. 6
- The ES-PTAM comparison uses publicly available results to evaluate the keytime estimator as a real-time pipeline.Source: §IV · p. 6
- Experiments ran on an Intel Core i7-9750H CPU at 2.60 GHz with 16 GB of RAM.Source: §IV · p. 6
A. Implementation Details and Parameters
The implementation uses incremental optimization with keytime-interpolated measurements, while evaluation aligns trajectories according to each experiment’s timestamps and reports global and relative pose errors.
A. Implementation Details and Parameters
- The pipeline uses custom WNOA and keytime-interpolated measurement factors with incremental batch optimization via iSAM2.Source: A. Implementation Details and Parameters · p. 6
- Event clusters contain 10,500 events for MVSEC and 150,000 for DSEC, with each new keytime placed at the cluster’s last event.Source: A. Implementation Details and Parameters · p. 6
- Features are matched against the preceding five clusters, and DSEC feature extraction uses initial half-resolution downsampling.Source: A. Implementation Details and Parameters · p. 6
- MC-RANSAC uses an inlier threshold of 0.1, target confidence of 0.99, and a 5,000-iteration cap, with early stopping as the estimated success probability rises.Source: A. Implementation Details and Parameters · p. 6
B. Temporal Alignment and Evaluation Metrics
- Experiment 1 queries both continuous-time trajectories at high-frequency ground-truth timestamps; Experiment 2 uses ES-PTAM timestamps except for MVSEC indoor3.Source: B. Temporal Alignment and Evaluation… · p. 6
- Global pose error measures accuracy relative to the initial pose, while relative pose error measures drift between sequential estimates.Source: B. Temporal Alignment and Evaluation… · p. 6
C. Experiment 1: Estimation Accuracy vs. GPCT
The keytime estimator retains accuracy while reducing state size relative to GPCT, and achieves real-time estimates that generally outperform ES-PTAM on the tested sequences.
C. Experiment 1: Estimation Accuracy vs. GPCT
- The keytime estimator has insignificant global and relative error differences from GPCT despite using a smaller state than GPCT’s one-state-per-measurement formulation.Source: C. Experiment 1: Estimation Accuracy… · p. 6
D. Experiment 2: Real-Time Performance vs. ES-PTAM
- The keytime estimator outperforms ES-PTAM in global error on all but one tested sequence and in relative error on all tested sequences, while averaging 22 Hz on MVSEC and 6 Hz on DSEC.Source: Table II · p. 7, Table III · p. 7, D. Experiment 2: Real-Time Performance… · p. 7
V. CONCLUSION
- Sparse keytimes decouple state size from measurement count, while WNOA interpolation evaluates reprojection errors at each measurement timestamp.Source: §V · p. 7
- A producer-consumer architecture supports real-time performance on both datasets, whereas ES-PTAM reports real-time performance only on MVSEC.Source: §V · p. 7
- Future work will compare different event representations and features in the pipeline.Source: §V · p. 7