Semi-supervised lane detection with Deep Hough Transform
Not on the map. Why?
Abstract (arXiv)
Current work on lane detection relies on large manually annotated datasets. We reduce the dependency on annotations by leveraging massive cheaply available unlabelled data. We propose a novel loss function exploiting geometric knowledge of lanes in Hough space, where a lane can be identified as a local maximum. By splitting lanes into separate channels, we can localize each lane via simple global max-pooling. The location of the maximum encodes the layout of a lane, while the intensity indicates the the probability of a lane being present. Maximizing the log-probability of the maximal bins helps neural networks find lanes without labels. On the CULane and TuSimple datasets, we show that the proposed Hough Transform loss improves performance significantly by learning from large amounts of unlabelled images.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 11 of its 32 references that are in the map. First posted on arXiv 9 Jun 2021.
Builds on
11 of 32 references.
References · 11
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2014Semi-Supervised Learning with Deep Generative Modelscited by 494
- 2017Spatial As Deep: Spatial CNN for Traffic Scene Understandingcited by 187
- 2019Learning Lightweight Lane Detection CNNs by Self Attention Distillationcited by 162
- 2019Semi-Supervised Semantic Segmentation with High- and Low-level Consistencycited by 147
- 2018Towards End-to-End Lane Detection: an Instance Segmentation Approachcited by 129
- 2020Ultra Fast Structure-aware Deep Lane Detectioncited by 121
- 2020Inter-Region Affinity Distillation for Road Marking Segmentationcited by 58
- 2017VPGNet: Vanishing Point Guided Network for Lane and Road Marking Detection and Recognitioncited by 56
- 2020Deep Hough-Transform Line Priorscited by 44
- 2017Active Decision Boundary Annotation with Deep Generative Modelscited by 8
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.