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

Deep Pose Graph-Matching-Based Loop Closure Detection for Semantic Visual SLAM

Author

Listed:
  • Ran Duan

    (Department of Aeronautical and Aviation Engineering, The Hong Kong Polytechnic University, Hong Kong, China)

  • Yurong Feng

    (Department of Aeronautical and Aviation Engineering, The Hong Kong Polytechnic University, Hong Kong, China)

  • Chih-Yung Wen

    (Department of Aeronautical and Aviation Engineering, The Hong Kong Polytechnic University, Hong Kong, China)

Abstract

This work addresses the loop closure detection issue by matching the local pose graphs for semantic visual SLAM. We propose a deep feature matching-based keyframe retrieval approach. The proposed method treats the local navigational maps as images. Thus, the keyframes may be considered keypoints of the map image. The descriptors of the keyframes are extracted using a convolutional neural network. As a result, we convert the loop closure detection problem to a feature matching problem so that we can solve the keyframe retrieval and pose graph matching concurrently. This process in our work is carried out by modified deep feature matching (DFM). The experimental results on the KITTI and Oxford RobotCar benchmarks show the feasibility and capabilities of accurate loop closure detection and the potential to extend to multiagent applications.

Suggested Citation

  • Ran Duan & Yurong Feng & Chih-Yung Wen, 2022. "Deep Pose Graph-Matching-Based Loop Closure Detection for Semantic Visual SLAM," Sustainability, MDPI, vol. 14(19), pages 1-11, September.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:19:p:11864-:d:920412
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/19/11864/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/19/11864/
    Download Restriction: no
    ---><---

    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:14:y:2022:i:19:p:11864-:d:920412. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.