Unsupervised Feature Learning for Event Data: Direct vs Inverse Problem Formulation
Dimche Kostadinov, Davide Scaramuzza

TL;DR
This paper compares direct and inverse problem formulations for unsupervised feature learning from event-based camera data, demonstrating their advantages and achieving up to 9% accuracy improvements in object recognition.
Contribution
It provides a theoretical and empirical analysis of direct versus inverse problem approaches for feature learning from event data, highlighting their respective benefits.
Findings
Both approaches improve recognition accuracy by up to 9%.
Theoretical guarantees for optimal solutions are established.
Empirical results favor the combined use of both methods.
Abstract
Event-based cameras record an asynchronous stream of per-pixel brightness changes. As such, they have numerous advantages over the standard frame-based cameras, including high temporal resolution, high dynamic range, and no motion blur. Due to the asynchronous nature, efficient learning of compact representation for event data is challenging. While it remains not explored the extent to which the spatial and temporal event "information" is useful for pattern recognition tasks. In this paper, we focus on single-layer architectures. We analyze the performance of two general problem formulations: the direct and the inverse, for unsupervised feature learning from local event data (local volumes of events described in space-time). We identify and show the main advantages of each approach. Theoretically, we analyze guarantees for an optimal solution, possibility for asynchronous, parallel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
