CVSep 25, 2018

Geometric-based Line Segment Tracking for HDR Stereo Sequences

arXiv:1809.09368v116 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of reliable feature matching for visual odometry in dynamic lighting conditions, but it is incremental as it builds on existing geometric methods with specific improvements.

The authors tackled the problem of robust line segment matching in stereo sequences with severe illumination changes or HDR environments by proposing a purely geometrical approach, resulting in a considerable speed-up over previous state-of-the-art techniques, making it suitable for real-time applications like Visual Odometry, though with a slightly lower number of matches.

In this work, we propose a purely geometrical approach for the robust matching of line segments for challenging stereo streams with severe illumination changes or High Dynamic Range (HDR) environments. To that purpose, we exploit the univocal nature of the matching problem, i.e. every observation must be corresponded with a single feature or not corresponded at all. We state the problem as a sparse, convex, L1-minimization of the matching vector regularized by the geometric constraints. This formulation allows for the robust tracking of line segments along sequences where traditional appearance-based matching techniques tend to fail due to dynamic changes in illumination conditions. Moreover, the proposed matching algorithm also results in a considerable speed-up of previous state of the art techniques making it suitable for real-time applications such as Visual Odometry (VO). This, of course, comes at expense of a slightly lower number of matches in comparison with appearance based methods, and also limits its application to continuous video sequences, as it is rather constrained to small pose increments between consecutive frames. We validate the claimed advantages by first evaluating the matching performance in challenging video sequences, and then testing the method in a benchmarked point and line based VO algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes