Fast and Accurate Lane Detection via Graph Structure and Disentangled Representation Learning
It is desirable to maintain high accuracy and runtime efficiency at the same time in lane detection. However, due to the long and thin properties of lanes, extracting features with both strong discrimination and perception abilities needs a huge amount of calculation, which seriously slows down the running speed. Therefore, we design a more efficient way to extract the features of lanes, including two phases: (1) Local feature extraction, which sets a series of predefined anchor lines, and extracts the local features through their locations. (2) Global feature aggregation, which treats local features as the nodes of the graph, and builds a fully connected graph by adaptively learning the distance between nodes, the global feature can be aggregated through weighted summing finally. Another problem that limits the performance is the information loss in feature compression, mainly due to the huge dimensional gap, e.g., from 512 to 8. To handle this issue, we propose a feature compression module based on decoupling representation learning. This module can effectively learn the statistical information and spatial relationships between features. After that, redundancy is greatly reduced and more critical information is retained. Extensional experimental results show that our proposed method is both fast and accurate. On the Tusimple and CULane benchmarks, with a running speed of 248 FPS, F1 values of 96.81% and 75.49% were achieved, respectively..
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2021 |
|---|---|
| Erschienen: |
2021 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:21 |
|---|---|
| Enthalten in: |
Sensors - 21(2021), 14, p 4657 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Yulin He [VerfasserIn] |
|---|
| Links: |
doi.org [kostenfrei] |
|---|
| Themen: |
Chemical technology |
|---|
| doi: |
10.3390/s21144657 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
DOAJ030412641 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | DOAJ030412641 | ||
| 003 | DE-627 | ||
| 005 | 20240412165421.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230226s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.3390/s21144657 |2 doi | |
| 035 | |a (DE-627)DOAJ030412641 | ||
| 035 | |a (DE-599)DOAJ5dba686b39ad409ba4fb05b54882097b | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 050 | 0 | |a TP1-1185 | |
| 100 | 0 | |a Yulin He |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Fast and Accurate Lane Detection via Graph Structure and Disentangled Representation Learning |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a It is desirable to maintain high accuracy and runtime efficiency at the same time in lane detection. However, due to the long and thin properties of lanes, extracting features with both strong discrimination and perception abilities needs a huge amount of calculation, which seriously slows down the running speed. Therefore, we design a more efficient way to extract the features of lanes, including two phases: (1) Local feature extraction, which sets a series of predefined anchor lines, and extracts the local features through their locations. (2) Global feature aggregation, which treats local features as the nodes of the graph, and builds a fully connected graph by adaptively learning the distance between nodes, the global feature can be aggregated through weighted summing finally. Another problem that limits the performance is the information loss in feature compression, mainly due to the huge dimensional gap, e.g., from 512 to 8. To handle this issue, we propose a feature compression module based on decoupling representation learning. This module can effectively learn the statistical information and spatial relationships between features. After that, redundancy is greatly reduced and more critical information is retained. Extensional experimental results show that our proposed method is both fast and accurate. On the Tusimple and CULane benchmarks, with a running speed of 248 FPS, F1 values of 96.81% and 75.49% were achieved, respectively. | ||
| 650 | 4 | |a lane detection | |
| 650 | 4 | |a graph structure | |
| 650 | 4 | |a feature compression | |
| 650 | 4 | |a disentangled representation learning | |
| 653 | 0 | |a Chemical technology | |
| 700 | 0 | |a Wei Chen |e verfasserin |4 aut | |
| 700 | 0 | |a Chen Li |e verfasserin |4 aut | |
| 700 | 0 | |a Xin Luo |e verfasserin |4 aut | |
| 700 | 0 | |a Libo Huang |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i In |t Sensors |d MDPI AG, 2003 |g 21(2021), 14, p 4657 |w (DE-627)DOAJ000032646 |x 14248220 |7 nnns |
| 773 | 1 | 8 | |g volume:21 |g year:2021 |g number:14, p 4657 |
| 856 | 4 | 0 | |u https://doi.org/10.3390/s21144657 |z kostenfrei |
| 856 | 4 | 0 | |u https://doaj.org/article/5dba686b39ad409ba4fb05b54882097b |z kostenfrei |
| 856 | 4 | 0 | |u https://www.mdpi.com/1424-8220/21/14/4657 |z kostenfrei |
| 856 | 4 | 2 | |u https://doaj.org/toc/1424-8220 |y Journal toc |z kostenfrei |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_DOAJ | ||
| 951 | |a AR | ||
| 952 | |d 21 |j 2021 |e 14, p 4657 | ||