TL;DR
This paper introduces an end-to-end lane marker detection method that transforms the problem into a row-wise classification task, eliminating the need for post-processing and achieving competitive results on standard benchmarks.
Contribution
The paper proposes a novel row-wise classification approach for lane detection, enabling direct vertex prediction without post-processing, which is a significant departure from traditional dense prediction methods.
Findings
Outperforms state-of-the-art on TuSimple and CULane benchmarks
Eliminates post-processing in lane detection pipeline
Achieves comparable or better accuracy with end-to-end approach
Abstract
In autonomous driving, detecting reliable and accurate lane marker positions is a crucial yet challenging task. The conventional approaches for the lane marker detection problem perform a pixel-level dense prediction task followed by sophisticated post-processing that is inevitable since lane markers are typically represented by a collection of line segments without thickness. In this paper, we propose a method performing direct lane marker vertex prediction in an end-to-end manner, i.e., without any post-processing step that is required in the pixel-level dense prediction task. Specifically, we translate the lane marker detection problem into a row-wise classification task, which takes advantage of the innate shape of lane markers but, surprisingly, has not been explored well. In order to compactly extract sufficient information about lane markers which spread from the left to the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
