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

2PNS++ point-cloud registration via hash of invariants and local compatibility check

Author

Listed:
  • Hai Liu
  • Shulin Wang
  • Donghong Zhao

Abstract

In this research, we use hash match of invariants under fixed pair length and local compatibility check of positions or normal vectors to improve the efficiency of two-point normal set (2PNS) point cloud registration algorithm. On the one hand, we use the key value formed by the invariants of base point pairs of fixed length to construct and retrieve the hash table to realize the matching of base point pairs in the two point clouds to be registered to speed up the extraction of candidate transformation matrices. On the other hand, the time consumed in the verification phase is reduced by checking the compatibility between the positions or normal vectors of the corresponding points in the specific areas of the two point clouds under the transformation from the candidate matrix. Through these two improvements, the algorithm significantly reduces the time spent in the point cloud registration algorithm.

Suggested Citation

  • Hai Liu & Shulin Wang & Donghong Zhao, 2023. "2PNS++ point-cloud registration via hash of invariants and local compatibility check," PLOS ONE, Public Library of Science, vol. 18(11), pages 1-12, November.
    • Handle: RePEc:plo:pone00:0287134
    DOI: 10.1371/journal.pone.0287134
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0287134
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0287134&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0287134?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:0287134. 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.