Pith. sign in

REVIEW

Attentional Graph Neural Network for Parking-slot Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.02576 v1 pith:7KWOYLR4 submitted 2021-04-06 cs.CV

classification cs.CV
keywords detectiongraphmarking-pointsmethodnetworkneuralparking-slotattentional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning has recently demonstrated its promising performance for vision-based parking-slot detection. However, very few existing methods explicitly take into account learning the link information of the marking-points, resulting in complex post-processing and erroneous detection. In this paper, we propose an attentional graph neural network based parking-slot detection method, which refers the marking-points in an around-view image as graph-structured data and utilize graph neural network to aggregate the neighboring information between marking-points. Without any manually designed post-processing, the proposed method is end-to-end trainable. Extensive experiments have been conducted on public benchmark dataset, where the proposed method achieves state-of-the-art accuracy. Code is publicly available at \url{https://github.com/Jiaolong/gcn-parking-slot}.

Discussion (0). Continue with ORCID to comment.

Pith tools