Multiple-solutions RANSAC for finding axes of symmetry in fragments of objects

作者：

Highlights：

• It is shown that the problem of ǣfinding best lines passing through a set of straight linesǥ has two meaningful local minima.

• A multiple-solution RANSAC algorithm for finding initial estimates of the local minima is proposed.

• A coordinate-descent algorithm is also proposed that finds the local minima of the problem.

• A proof for the rate of the convergence of our coordinate-descent algorithm is presented.

摘要

•It is shown that the problem of ǣfinding best lines passing through a set of straight linesǥ has two meaningful local minima.•A multiple-solution RANSAC algorithm for finding initial estimates of the local minima is proposed.•A coordinate-descent algorithm is also proposed that finds the local minima of the problem.•A proof for the rate of the convergence of our coordinate-descent algorithm is presented.

论文关键词：Symmetry axis,Multiple-solutions RANSAC,3D Reconstruction

论文评审过程：Received 12 November 2020, Revised 30 April 2022, Accepted 20 May 2022, Available online 3 June 2022, Version of Record 20 June 2022.

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