DA-LMR: A Robust Lane Markings Representation for Data Association Methods

Miguel Ángel Muñoz-Bañón, Jan-Hendrik Pauls, Haohao Hu, Christoph Stiller

Abstract

Localization is a fundamental challenge for autonomous vehicles. While many approaches focus on final pose estimation, the underlying processes of data representation and data association are critical for accuracy. This paper introduces DA-LMR (Delta-Angle Lane Marking Representation), a 3D representation that encodes local curvature into 2D lane markings, and DC-SAC (Distance-Compatible Sample Consensus), a heuristic data association method. By incorporating geometric context and distance constraints, these methods significantly improve localization robustness in noisy environments, achieving high precision and recall even with significant sensor error.

Introduction

For a self-driving vehicle to localize itself, it must match real-time sensor detections (e.g., lane markings from cameras or LiDAR) with pre-existing map landmarks. This "data association" step is often hindered by two factors: information loss in simple 2D point representations and the computational complexity of matching in the presence of noise and outliers. Standard point-based matching often fails to distinguish between similar-looking straight segments, leading to incorrect pose estimates.

Methodology

DA-LMR: Delta-Angle Lane Marking Representation

The core innovation of this work is the addition of a third dimension to traditional 2D lane marking points. Instead of a simple $(x, y)$ coordinate, each point is represented as $(x, y, \Delta\alpha \cdot w)$.

Geometric definition of the Delta-Angle ($\Delta\alpha$) used in the DA-LMR representation.

As shown in the figure above, for any point $p_i$ on a polyline, the Delta-Angle ($\Delta\alpha_i$) is calculated as the change in orientation between the segment entering the point and the segment leaving it. This value effectively encodes the local curvature. By weighting this angle ($w$), the representation provides a unique geometric signature for each point, making curved segments highly distinguishable from straight ones and ensuring the representation is invariant to the vehicle's driving direction.

DC-SAC: Distance-Compatible Sample Consensus

To improve the efficiency and reliability of the matching process, the authors propose DC-SAC. This method enhances the standard RANSAC algorithm by introducing a Distance Compatibility heuristic. Rather than testing random pairs of points, DC-SAC only considers hypotheses where the Euclidean distance between two sensor detections is consistent with the distance between their corresponding map landmarks. This constraint prunes the search space, allowing for faster convergence and better outlier rejection.

Experimental Results

The proposed methods were evaluated using synthetic data derived from aerial imagery of Karlsruhe, Germany, and real-world data from the BerthaOne experimental vehicle. Testing involved varying levels of Gaussian noise (up to $\sigma = 0.5$m) and the addition of 10% outliers.

Performance comparison of different representations (LSR, PR, DA-LMR) across varying noise levels.

As illustrated in the performance plots, the DA-LMR representation consistently outperforms standard Point Representation (PR) and Line Segment Representation (LSR). Even at high noise levels (0.5m standard deviation), the combination of DA-LMR and DC-SAC maintains superior F1-scores, precision, and recall compared to state-of-the-art alternatives. Quantitatively, the system reached up to 98.1% precision and 99.7% recall in challenging scenarios.

Conclusion

DA-LMR and DC-SAC provide a robust framework for the data association sub-problem in autonomous localization. By treating local geometry as a first-class feature and enforcing spatial consistency during matching, these methods overcome the limitations of traditional point-based systems. Future work will focus on extending this representation to 3D environments and automating the tuning of the curvature weight parameter.

Summary updated

Abstract

While complete localization approaches are widely studied in the literature, their data association and data representation subprocesses usually go unnoticed. However, both are a key part of the final pose estimation. In this work, we present DA-LMR (Delta-Angle Lane Marking Representation), a robust data representation in the context of localization approaches. We propose a representation of lane markings that encodes how a curve changes in each point and includes this information in an additional dimension, thus providing a more detailed geometric structure description of the data. We also propose DC-SAC (Distance-Compatible Sample Consensus), a data association method. This is a heuristic version of RANSAC that dramatically reduces the hypothesis space by distance compatibility restrictions. We compare the presented methods with some state-of-the-art data representation and data association approaches in different noisy scenarios. The DA-LMR and DC-SAC produce the most promising combination among those compared, reaching 98.1% in precision and 99.7% in recall for noisy data with 0.5 m of standard deviation.
BibTeX
@inproceedings{munozbanon2022da,
  author = {Miguel Ángel Muñoz-Bañón and Jan-Hendrik Pauls and Haohao Hu and Christoph Stiller},
  title = {{DA-LMR: A Robust Lane Markings Representation for Data Association Methods}},
  booktitle = {IEEE International Conference on Robotics and Automation},
  year = {2022},
  doi = {10.1109/icra46639.2022.9812271},
}

Loading related content...

Figure