Analysis of binning of normals for spherical harmonic cross-correlation

Spherical harmonic cross-correlation is a robust registration technique that uses the normals of two overlapping point clouds to bring them into coarse rotational alignment. This registration technique however has a high computational cost as spherical harmonics need to be calculated for every normal. By binning the normals, the computational efficiency is improved as the spherical harmonics can be pre-computed and cached at each bin location. In this paper we evaluate the efficiency and accuracy of the equiangle grid, icosahedron subdivision and the Fibonacci spiral, an approach we propose. It is found that the equiangle grid has the best efficiency as it can perform direct binning, followed by the Fibonacci spiral and then the icosahedron, all of which decrease the computational cost compared to no binning. The Fibonacci spiral produces the highest achieved accuracy of the three approaches while maintaining a low number of bins. The number of bins allowed by the equiangle grid and icosahedron are much more restrictive than the Fibonacci spiral. The performed analysis shows that the Fibonacci spiral can perform as well as the original cross-correlation algorithm without binning, while also providing a significant improvement in computational efficiency.

[1]  N. A. Teanby,et al.  An icosahedron-based method for even binning of globally distributed remote sensing data , 2006, Comput. Geosci..

[2]  T. Chan,et al.  Shape Registration with Spherical Cross Correlation , 2008 .

[3]  François Blais.  Review of 20 years of range sensor development , 2004, J. Electronic Imaging.

[4]  Michael J. Cree,et al.  Analysis of ICP variants for the registration of partially overlapping time-of-flight range images , 2010, 2010 25th International Conference of Image and Vision Computing New Zealand.

[5]  E. Saff,et al.  Distributing many points on a sphere , 1997 .

[6]  David Fofi,et al.  A review of recent range image registration methods with accuracy evaluation , 2007, Image Vis. Comput..

[7]  Cheng Guan Koay,et al.  A simple scheme for generating nearly uniform distribution of antipodally symmetric points on the unit sphere , 2011, J. Comput. Sci..

[8]  D. Williamson.  The Evolution of Dynamical Cores for Global Atmospheric Models(125th Anniversary Issue of the Meteorological Society of Japan) , 2007 .

[9]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Graham J. L. Kemp,et al.  Fast computation, rotation, and comparison of low resolution spherical harmonic molecular surfaces , 1999, J. Comput. Chem..

[11]  Fillia Makedon,et al.  Efficient Registration of 3D SPHARM Surfaces , 2007, Fourth Canadian Conference on Computer and Robot Vision (CRV '07).

[12]  Kostas Daniilidis,et al.  Fully Automatic Registration of 3D Point Clouds , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[13]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[14]  Gilles Burel,et al.  Determination of the Orientation of 3D Objects Using Spherical Harmonics , 1995, CVGIP Graph. Model. Image Process..

[15]  Cheng Guan Koay,et al.  Analytically exact spiral scheme for generating uniformly distributed points on the unit sphere , 2011, J. Comput. Sci..

[16]  Álvaro González.  Measurement of Areas on a Sphere Using Fibonacci and Latitude–Longitude Lattices , 2009, 0912.4540.