• DocumentCode
    3752123
  • Title

    A robust registration method using Huber ICP and low rank and sparse decomposition

  • Author

    Qiaochu Zhao;Xian-Hua Han;Yen-Wei Chen

  • Author_Institution
    Graduate School of Information Science and Engineering, Ritsumeikan University, Shiga, Japan
  • fYear
    2015
  • Firstpage
    744
  • Lastpage
    752
  • Abstract
    This paper proposes a robust registration and alignment framework for multiple point clouds using low rank and sparse decomposition. A coarse registration phase utilizing Huber-ICP is firstly performed to roughly align all the point clouds to a same location, and then sparse and low rank decomposition is applied to extract the low rank subspace of all the point clouds, which is expected to be outlier and loss data free. Finally, a fine registration procedure can be carried out between each point clouds from this low rank space to not only a more accurate registration result but also a more precise correspondence. Robustness of our method for outliers contained in point clouds is verified through manufactured data and it also shows that an effective result can still be achieved even when some points in the cloud are lost.
  • Keywords
    "Three-dimensional displays","Iterative closest point algorithm","Sparse matrices","Matrix decomposition","Robustness","Cost function","Standards"
  • Publisher
    ieee
  • Conference_Titel
    Signal and Information Processing Association Annual Summit and Conference (APSIPA), 2015 Asia-Pacific
  • Type

    conf

  • DOI
    10.1109/APSIPA.2015.7415371
  • Filename
    7415371