IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i3p2628-d1054331.html
   My bibliography  Save this article

Center-Aware 3D Object Detection with Attention Mechanism Based on Roadside LiDAR

Author

Listed:
  • Haobo Shi

    (Research Institute of Highway, Ministry of Transport, Beijing 100088, China
    Key Laboratory of Intelligent Transportation Technology and Transportation Industry, Beijing 100088, China
    National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China)

  • Dezao Hou

    (Research Institute of Highway, Ministry of Transport, Beijing 100088, China
    Key Laboratory of Intelligent Transportation Technology and Transportation Industry, Beijing 100088, China
    National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China)

  • Xiyao Li

    (Research Institute of Highway, Ministry of Transport, Beijing 100088, China
    Key Laboratory of Intelligent Transportation Technology and Transportation Industry, Beijing 100088, China
    National Intelligent Transport Systems Center of Engineering and Technology, Beijing 100088, China)

Abstract

Infrastructure 3D Object Detection is a pivotal component of Vehicle-Infrastructure Cooperated Autonomous Driving (VICAD). As turning objects account for a high proportion of traffic at intersections, anchor-free representation in the bird’s-eye view (BEV) is more suitable for roadside 3D detection. In this work, we propose CetrRoad, a simple yet effective ce nter-aware detector with tr ansformer-based detection head for road side 3D object detection with single LiDAR (Light Detection and Ranging). CetrRoad firstly utilizes a voxel-based roadside LiDAR feature encoder module that voxelizes and projects the raw point cloud into BEV with dense feature representation, following a one-stage center proposal module that initializes center candidates of objects based on the top N points in the BEV target heatmap with unnormalized 2D Gaussian. Then, taking attending center proposals as query embedding, a detection head with multi-head self-attention and multi-scale multi-head deformable cross attention can refine and predict 3D bounding boxes for different classes moving/parked at the intersection. Extensive experiments and analyses demonstrate that our method achieves state-of-the-art performance on the DAIR-V2X-I benchmark with an acceptable training time cost, especially for Car and Cyclist. CetrRoad also reaches comparable results with the multi-modal fusion method for Pedestrian. An ablation study demonstrates that center-aware query as input can provide denser supervision than a purified feature map in the attention-based detection head. Moreover, we were able to intuitively observe that in complex traffic environment, our proposed model could produce more accurate 3D detection results than other compared methods with fewer false positives, which is helpful for other downstream VICAD tasks.

Suggested Citation

  • Haobo Shi & Dezao Hou & Xiyao Li, 2023. "Center-Aware 3D Object Detection with Attention Mechanism Based on Roadside LiDAR," Sustainability, MDPI, vol. 15(3), pages 1-19, February.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:3:p:2628-:d:1054331
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/3/2628/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/3/2628/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Husnain Mushtaq & Xiaoheng Deng & Mubashir Ali & Babur Hayat & Hafiz Husnain Raza Sherazi, 2023. "DFA-SAT: Dynamic Feature Abstraction with Self-Attention-Based 3D Object Detection for Autonomous Driving," Sustainability, MDPI, vol. 15(18), pages 1-21, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    2. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    3. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    4. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    5. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    6. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.
    7. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    8. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    9. Michal Brylinski, 2014. "eMatchSite: Sequence Order-Independent Structure Alignments of Ligand Binding Pockets in Protein Models," PLOS Computational Biology, Public Library of Science, vol. 10(9), pages 1-15, September.
    10. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.
    11. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    12. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    13. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef, 2021. "Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration," European Journal of Operational Research, Elsevier, vol. 288(3), pages 810-828.
    14. Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.
    15. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    16. Enning Yang & Filip Milisav & Jakub Kopal & Avram J. Holmes & Georgios D. Mitsis & Bratislav Misic & Emily S. Finn & Danilo Bzdok, 2023. "The default network dominates neural responses to evolving movie stories," Nature Communications, Nature, vol. 14(1), pages 1-18, December.
    17. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    18. Morgan A. Schmitz & Matthieu Heitz & Nicolas Bonneel & Fred Ngolè & David Coeurjolly, 2017. "Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learning," Working Papers 2017-84, Center for Research in Economics and Statistics.
    19. Mingwei Lei & Xingfen Wang & Meihua Wang & Yitao Cheng, 2024. "Improved YOLOv5 Based on Multi-Strategy Integration for Multi-Category Wind Turbine Surface Defect Detection," Energies, MDPI, vol. 17(8), pages 1-25, April.
    20. Pasin Manurangsi & Warut Suksompong, 2020. "Closing Gaps in Asymptotic Fair Division," Papers 2004.05563, arXiv.org.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:3:p:2628-:d:1054331. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.