Parking Slot Detection Github
Abstract: While real-time parking slot detection plays a critical role in valet parkingsystems, existing methods have limited success in real-world applications. Weargue two reasons accounting for the unsatisfactory performance:romannumeral1, The available datasets have limited diversity, which causes thelow generalization ability. romannumeral2, Expert knowledge for parking slotdetection is under-estimated. Thus, we annotate a large-scale benchmark fortraining the network and release it for the benefit of community. Driven by theobservation of various parking lots in our benchmark, we propose the circulardescriptor to regress the coordinates of parking slot vertexes and accordinglylocalize slots accurately. To further boost the performance, we develop atwo-stage deep architecture to localize vertexes in the coarse-to-fine manner.In our benchmark and other datasets, it achieves the state-of-the-art accuracywhile being real-time in practice. Benchmark is available at:this https URL
Submission history
From: Weiwei Sun [view email]
The algorithm only focuses on detecting the marking point detection and did not mention too much about the post-processing needed to combine the marking points to parking slot. It is more general in that it can detect more than T/L-shaped marking points. The paper is very poorly written, with tons of sloppy annotation and non-standard terminology. Second, to facilitate the study of vision-based parking-slot detection, a large-scale labeled dataset is established. This dataset is the largest in this field, comprising 12 165 surround-view images collected from typical indoor and outdoor parking sites. For each image, the marking points and parking slots are carefully labeled. This was developed during one day and the algorithm is pretty stupid. Unfortunately the code is lost. However this is how it was done: 1. Perspective transfo. Specifically, each parking-slot can impose a surround-view constraint that can be split into an adjacency term and a registration term. The former pre-defines the position of each individual parking-slot subject to whether it has an adjacent neighbor. The latter further constrains by registering between each observed parking-slot and its.
[v1]Tue, 12 May 2020 03:06:25 UTC (1,524 KB)Full-text links:
Download:
Current browse context:References & Citations
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs and how to get involved.