Robust Line Feature Matching via Point–Line Invariants and Geometric Constraints

Abstract

Line feature matching is a crucial aspect of computer vision and image processing tasks, attracting significant research attention. Most line matching algorithms predominantly rely on local feature descriptors or deep learning modules, which often suffer from low robustness and poor generalization. In response, this paper presents a novel line feature matching approach grounded in point–line invariants through spatial invariant relationships. By leveraging a robust point feature matching algorithm, an initial set of point feature matches is acquired. Subsequently, the line feature supporting area is partitioned, and a constant ratio invariant is formulated based on the distances from point to line features within corresponding neighborhood domains. Additionally, a direction vector invariant is also introduced, jointly constructing a dual invariant for line matching. An initial matching matrix and line feature match pairs are derived using this dual invariant. Subsequent geometric constraints within line feature matches eliminate residual outliers. Comprehensive evaluations under diverse imaging conditions, along with comparisons to several state-of-the-art algorithms, demonstrate that our proposal achieved remarkable performance in terms of both accuracy and robustness. Our implementation code will be publicly released upon the acceptance of this paper.