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

Robust Non-Rigid Point Set Registration Using Student's-t Mixture Model

Author

Listed:
  • Zhiyong Zhou
  • Jian Zheng
  • Yakang Dai
  • Zhe Zhou
  • Shi Chen

Abstract

The Student's-t mixture model, which is heavily tailed and more robust than the Gaussian mixture model, has recently received great attention on image processing. In this paper, we propose a robust non-rigid point set registration algorithm using the Student's-t mixture model. Specifically, first, we consider the alignment of two point sets as a probability density estimation problem and treat one point set as Student's-t mixture model centroids. Then, we fit the Student's-t mixture model centroids to the other point set which is treated as data. Finally, we get the closed-form solutions of registration parameters, leading to a computationally efficient registration algorithm. The proposed algorithm is especially effective for addressing the non-rigid point set registration problem when significant amounts of noise and outliers are present. Moreover, less registration parameters have to be set manually for our algorithm compared to the popular coherent points drift (CPD) algorithm. We have compared our algorithm with other state-of-the-art registration algorithms on both 2D and 3D data with noise and outliers, where our non-rigid registration algorithm showed accurate results and outperformed the other algorithms.

Suggested Citation

  • Zhiyong Zhou & Jian Zheng & Yakang Dai & Zhe Zhou & Shi Chen, 2014. "Robust Non-Rigid Point Set Registration Using Student's-t Mixture Model," PLOS ONE, Public Library of Science, vol. 9(3), pages 1-11, March.
  • Handle: RePEc:plo:pone00:0091381
    DOI: 10.1371/journal.pone.0091381
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0091381?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
    ---><---

    Citations

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


    Cited by:

    1. Xuetao Zhang & Libo Jian & Meifeng Xu, 2018. "Robust 3D point cloud registration based on bidirectional Maximum Correntropy Criterion," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-15, May.

    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:0091381. 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.