Event-based motion estimation is central to tasks that demand high temporal resolution and robustness to fast motion. Existing methods typically rely on iterative optimization or repeated hypothesis comparison, offsetting the sensor's low-latency advantage. We propose Oriented Distance Field Motion Estimation (ODF Motion Estimation), which replaces this optimization with a single averaging step over a precomputed field of event distance vectors, combined with an adaptive event-count selection strategy and a parameter-free trail filter. On public and self-collected datasets, ODF motion estimation reaches sub-pixel accuracy at the lowest latency among compared methods. We validate its generality on two downstream applications rather than treating them as separate contributions. First, the estimated trajectory is converted into a blur kernel and paired with a compact iterative-unfolding network, trained on simulated motion-estimation noise, for real-time non-blind image deblurring, attaining competitive or superior PSNR/SSIM with under 1M parameters. Second, the same precomputed field is repurposed for directional event filtering in a low-power asynchronous pupil and glint tracker, sustaining stable tracking for tens of seconds while lowering a near-eye module's power draw.
Figures & tables
Fig. 1: Overview of the proposed pipeline. (a) ODF motion estimation (Sec. III ). An edge template built from events or a reference frame is used to precompute a distance field and its descent direction. Averaging the distance vectors of subsequent events against this field gives the motion trajectory during exposure, which yields a temporally-centered blur kernel and an event mask marking where events occurred. (b) Image deblurring with the estimated kernel (Sec. IV-A ). The kernel and event mask from (a), together with the blurry image, are passed to an iterative deep-unfolding network that alternates a closed-form data module with a learned denoising network to recover the sharp image. The same motion trajectory from (a) is also reused as a directional filter for asynchronous pupil and glint tracking (Sec. IV-B ).
Fig. 2: Event-based trajectory extraction. (a) Blurred frame. (b) Events within the exposure window. (c) Event stream (red and blue dots) with the extracted motion trajectory (green line).
Fig. 3: Distance field and direction field. (a-b) Toy example around a single edge point, showing how the distance vector at each location encodes translation magnitude and direction. (c-d) The same fields computed on a real graphics scene, used to precompute the distance vectors that give the translation direction and amount for subsequent events.
Fig. 5: Pupil event filtering and device comparison. (a) Raw events during pupil tracking. (b) Valid events after a fixed-polarity trail filter, which still leaks trailing events. (c) Valid events after the proposed distance-vector direction filter. (d) Pupil events captured by a non-near-eye device, where the pupil occupies few pixels. (e) Pupil events captured by a near-eye device, where the pupil occupies many more pixels.
Sequence
Method
Rate ↑ (Hz)
Error ↓ (px)
slider_close
HASTE [ 4 ]
467.2
0.396
CM [ 12 ]
19.5
0.734
Ours
1066.0
0.584
slider_far
HASTE [ 4 ]
188.9
0.457
CM [ 12 ]
17.2
0.558
Ours
679.4
0.328
TABLE I: Motion estimation accuracy and update rate on Event-Camera Dataset [ 24 ] (bold: best per column).
Fig. 6: Blurred EventAid-B images (main) with the corresponding kernel estimated by ODF motion estimation (inset), showing the range of blur magnitude and scene content covered by the benchmark.
Method
Events
PSNR ↑
SSIM ↑
#Param
EDI [ 26 ]
✔
26.45
0.800
-
Restormer [ 36 ]
✘
26.25
0.842
26.1M
NAFNet-64 [ 8 ]
✘
25.52
0.816
67.9M
EFNet-GoPro [ 31 ]
✔
25.65
0.806
8.5M
EFNet-REBlur [ 31 ]
✔
25.56
0.874
8.5M
ODF kernel + DWDN [ 9 ]
✔
26.66
0.856
7.0M
TABLE II: Comparison of single image motion deblurring methods on EventAid-B-Global Motion. (bold: best per column)
Fig. 7: Qualitative comparison on EventAid-B. Blind methods (NAFNet, Restormer) leave residual blur, EFNet introduces over-sharpening and brightness shifts, and our method restores sharp detail while preserving the original tone.
Method
Events
PSNR ↑
SSIM ↑
#Param
EDI [ 26 ]
✔
30.54
0.856
-
Restormer [ 36 ]
✘
30.34
0.861
26.1M
NAFNet-32 [ 8 ]
✘
29.93
0.848
17.1M
EFNet [ 31 ]
✔
31.67
0.854
8.5M
ODF kernel + DWDN [ 9 ]
✔
31.79
0.874
7.0M
ODF kernel + RAM [ 32 ]
✔
33.00
0.897
35.6M
TABLE III: Comparison of single image motion deblurring methods on blurry images with event data and ground-truth blur kernels. Bold marks the best result per column (gt kernel rows are an oracle upper bound).
Fig. 8: Qualitative comparison on our real captured dataset, using our estimated blur kernel. Our lightweight network controls edge artifacts better than RAM, though RAM recovers marginally sharper texture.
Sensor
Rate (fps)
Sensor ↓ (mW)
LED duty
LED ↓ (mW)
Total ↓ (mW)
Frame camera
60
161.8
30%
53.2
215.0
90
163.6
45%
75.6
239.2
120
165.4
60%
100.8
266.2
Event camera
–
51.2
100%
75.9
127.1
TABLE IV: Hardware power comparison of a frame-camera and an event-camera near-eye tracking module (bold: lowest total power).
Fig. 9: Pupil and glint tracking on near-eye event data at three time steps t1 – t3 . Events are shown in red (positive) and blue (negative), with the fitted pupil ellipse in yellow and located glints in green.
Event-based vision sensors offer asynchronous, high-temporal-resolution measurements that are attractive for low-latency robotic perception, but many event-based motion estimation methods are computationally intensive and difficult to map to FPGA hardware. We present a streaming velocity estimator that discretizes asynchronous events into fixed-duration time bins, constructs a 1-bit spatial occupancy grid, and evaluates multiple velocity hypotheses in parallel using only fixed-width integer logic - shift registers, counters, comparators, and small LUT-mapped multiplies - with no dividers and no DSP blocks. It requires no frame reconstruction, no floating-point arithmetic, and no iterative optimization. The method deliberately trades dense sub-pixel optical flow for a sparse, quantized velocity estimate at each active pixel, suited to low-latency tasks such as reactive obstacle avoidance on size-, weight-, and power-constrained platforms. On noisy synthetic data with known ground-truth velocities, the method recovers both magnitude and direction, with magnitude estimates being most challenged when objects of different velocities intersect. On a real event-camera sequence, directional accuracy reaches 99.5% across all four evaluated motion segments, with performance remaining robust across occupancy densities in the 10-40% range. We characterize the algorithm's density-dependent behavior, present a parameter sensitivity analysis, show that the proposed datapath requires less than 2 kB of storage, and implement a single-axis prototype on a low-cost Xilinx Artix-7.
Arianna Alonso Bizzi, Fernando Cladera, C. J. Taylor
Event cameras capture per-pixel brightness changes with microsecond resolution, offering continuous motion information lost between RGB frames. However, existing event-based motion estimators depend on large-scale synthetic data that often suffers from a significant sim-to-real gap. We propose TETO (Tracking Events with Teacher Observation), a teacher-student framework that learns event motion estimation from only ∼25 minutes of unannotated real-world recordings through knowledge distillation from a pretrained RGB tracker. Our motion-aware data curation and query sampling strategy maximizes learning from limited data by disentangling object motion from dominant ego-motion. The resulting estimator jointly predicts point trajectories and dense optical flow, which we leverage as explicit motion priors to condition a pretrained video diffusion transformer for frame interpolation. We achieve state-of-the-art point tracking on EVIMO2 and optical flow on DSEC using orders of magnitude less training data, and demonstrate that accurate motion estimation translates directly to superior frame interpolation quality on BS-ERGB and HQ-EVFI.
Jini Yang, Eunbeen Hong, Soowon Son +4
KAIST AI · ETH Zurich · Korea Aerospace University
Event cameras report asynchronously per-pixel brightness changes with microsecond latency, encoding dynamic visual information as a sparse stream of events. However, their extreme temporal resolution floods perception systems with entangled events from ego-motion and independently moving objects (IMOs), which existing solutions fail to efficiently decouple, relying instead on prohibitive dense 3D reconstructions or limited hand-tuned filters. In this work, we introduce the first framework for Motion-aware Event Suppression, which learns to filter events triggered by IMOs and ego-motion in real time. Our model jointly segments IMOs in the current event stream while predicting their future motion, enabling anticipatory suppression of dynamic events before they occur. Our lightweight architecture achieves 173 Hz inference on consumer-grade GPUs with less than 1 GB of memory usage, outperforming previous state-of-the-art methods on the challenging EVIMO benchmark by 67% in segmentation accuracy while operating at a 53% higher inference rate. Moreover, we demonstrate significant benefits for downstream applications: our method accelerates Vision Transformer inference by 83% via token pruning and improves event-based visual odometry accuracy, reducing Absolute Trajectory Error (ATE) by 13%.
Roberto Pellerito, Nico Messikommer, Giovanni Cioffi +2
Robotics and Perception Group, University of Zurich, Switzerland