Graph-based point drift: Graph centrality on the registration of point-sets

作者：

Highlights：

• We introduce the graph centrality into the point-set registration problem.

• Integrating centrality with spatial information can improve the convergence speed.

• We discuss the importance of the graph edges for the registration.

• We compare the performance of five centrality variants with the CPD algorithm.

摘要

Highlights•We introduce the graph centrality into the point-set registration problem.•Integrating centrality with spatial information can improve the convergence speed.•We discuss the importance of the graph edges for the registration.•We compare the performance of five centrality variants with the CPD algorithm.

论文关键词：Point set registration,Graph centrality,Coherent point drift (CPD)

论文评审过程：Received 3 September 2013, Revised 15 June 2014, Accepted 16 June 2014, Available online 28 June 2014.

论文官网地址：https://doi.org/10.1016/j.patcog.2014.06.011