Click:

The Last Update Time:--

赵鹏程
+
Personal Information
  • Supervisor of Master's Candidates
  • Name (Pinyin):Zhao Pengcheng
  • Date of Birth:1993-09-05
  • E-Mail:
  • Date of Employment:2019-12-07
  • Administrative Position:高级实验师
  • Education Level:With Certificate of Graduation for Doctorate Study
  • Business Address:武汉大学信息学部遥感信息工程学院（5号楼）315办公室
  • Gender:Male
  • Contact Information:+86 15972003670
  • Status:Employed
  • Alma Mater:武汉大学
  • Teacher College:School of Remote Sensing and Information Engineering
Other Contact Information
  • PostalAddress:
  • OfficePhone:
  • Telephone:
  • Email:
Paper Publications
Current position: Home   >   Scientific Research   >   Paper Publications

Robust point cloud registration based on topological graph and Cauchy weighted <i>l<sub>q</sub></i> -norm

  • Date of Publication:2025-01-07
  • Hits:

  • DOI number: 

    10.1016/j.isprsjprs.2019.12.008

  • Affiliation of Author(s): 

    School of Remote Sensing and Information Engineering, Wuhan University, China

  • Journal: 

    ISPRS JOURNAL OF PHOTOGRAMMETRY AND REMOTE SENSING

  • Key Words: 

    Point Cloud Registration (PCR),Coarse-to-fine registration,Feature correspondence,Iterative Closest Point (ICP),Robust estimation

  • Abstract: 

    Point Cloud Registration (PCR) is a fundamental and important issue in photogrammetry and computer vision. Its goal is to find rigid transformations that register multiple 3D point sets. This paper proposes a robust and efficient PCR method based on topological graph and Cauchy weighted l(q)-norm. Our method does not require initializations and is highly robust to outliers and partial overlaps. It contains two major steps: (1) correspondence-based coarse registration, which is called Weighted l(q) Coarse Registration (WCR). In the Wl(q)CR method, we represent feature point sets as topological graphs and transform the point matching problem to an edge matching problem. We build a mathematical model for edge correspondence maximization. We also present an edge voting strategy to distinguish potential correct matches from mismatches. Then, we define a concept called edge vector, which has a property that it is invariant to translations. Based on this property, six Degrees of Freedoms (DoF) PCR problem can be simplified into two three DoF subproblems, i.e., rotation estimation and translation estimation. (2) fine registration based on Weighted l(q) Iterative Closest Point (Wl(q)ICP). We propose a new ICP method called Wl(q)ICP, which is much more robust to partial overlaps compared with traditional ICP. In both rotation estimation and Wl(q)ICP, we use a new Cauchy weighted l(q)-norm (0 < q < 1) instead of l(2)-norm for object function construction, which has a high degree of robustness. Extensive experiments on both simulated and real data demonstrate the power of the proposed method, i.e., our method is more robust (is able to tolerate up to 99% of outliers) and much faster than compared state-of-the-art methods (Wl(q)CR is almost two orders of magnitude faster than RANdom SAmple Consesus (RANSAC) and its variants under 95% of outliers). The source code will be made publicly available in http://www.escience.cn/people/lijiayuan/index.html.

  • Co-author: 

    Mingyao,Hu,Ai, Qingwu, Pengcheng,Zhao, Jiayuan,Li

  • Indexed by: 

    Journal paper

  • Discipline: 

    Engineering

  • Document Type: 

    J

  • Volume: 

    160

  • Page Number: 

    244-259

  • ISSN No.: 

    0924-2716

  • Translation or Not: 

    no

  • CN No.: 

    WOS:000510525500017

  • Date of Publication: 

    2020-02-01

Copyright @ 2017 Wuhan University