IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0325261.html
   My bibliography  Save this article

Overlapping point cloud registration algorithm based on KNN and the channel attention mechanism

Author

Listed:
  • Yangzhuo Chen
  • Fengjiao Guo
  • Jingang Liu
  • Siling Dai
  • Jia Huang
  • Xiaowen Cai

Abstract

With the advancement of sensor technologies such as LiDAR and depth cameras, the significance of three-dimensional point cloud data in autonomous driving and environment sensing continues to increase.Point cloud registration stands as a fundamental task in constructing high-precision environmental models, with particular significance in overlapping regions where the accuracy of feature extraction and matching directly impacts registration quality. Despite advancements in deep learning approaches, existing methods continue to demonstrate limitations in extracting comprehensive features within these overlapping areas. This study introduces an innovative point cloud registration framework that synergistically combines the K-nearest neighbor (KNN) algorithm with a channel attention mechanism (CAM) to significantly enhance feature extraction and matching capabilities in overlapping regions. Additionally, by designing an effectiveness scoring network, the proposed method improves registration accuracy and enhances system robustness in complex scenarios. Comprehensive evaluations on the ModelNet40 dataset reveal that our approach achieves markedly superior performance metrics, demonstrating significantly lower root mean square error (RMSE) and mean absolute error (MAE) compared to established methods including iterative closest point (ICP), Robust & Efficient Point Cloud Registration using PointNet (PointNetLK), Go-ICP, fast global registration (FGR), deep closest point (DCP), self-supervised learning for a partial-to-partial registration (PRNet), and Iterative Distance-Aware Similarity Matrix Convolution (IDAM). This performance advantage is consistently maintained across various challenging conditions, including unseen shapes, novel categories, and noisy environments. Furthermore, additional experiments on the Stanford dataset validate the applicability and robustness of the proposed method for high-precision 3D shape registration tasks.

Suggested Citation

  • Yangzhuo Chen & Fengjiao Guo & Jingang Liu & Siling Dai & Jia Huang & Xiaowen Cai, 2025. "Overlapping point cloud registration algorithm based on KNN and the channel attention mechanism," PLOS ONE, Public Library of Science, vol. 20(6), pages 1-20, June.
  • Handle: RePEc:plo:pone00:0325261
    DOI: 10.1371/journal.pone.0325261
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0325261
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0325261&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0325261?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0325261. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.