Abstract
The 3D Zernike polynomials form an orthonormal basis of the unit ball. The associated 3D Zernike moments have been successfully applied for 3D shape recognition; they are popular in structural biology for comparing protein structures and properties. Many algorithms have been proposed for computing those moments, starting from a voxel-based representation or from a surface based geometric mesh of the shape. As the order of the 3D Zernike moments increases, however, those algorithms suffer from decrease in computational efficiency and more importantly from numerical accuracy. In this paper, new algorithms are proposed to compute the 3D Zernike moments of a homogeneous shape defined by an unstructured triangulation of its surface that remove those numerical inaccuracies. These algorithms rely on the analytical integration of the moments on tetrahedra defined by the surface triangles and a central point and on a set of novel recurrent relationships between the corresponding integrals. The mathematical basis and implementation details of the algorithms are presented and their numerical stability is evaluated.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference70 articles.
1. Zelditch, M., Swiderski, D., and Sheets, H. (2012). Geometric Morphometrics for Biologists. A Primer, Academic Press.
2. Bioimage informatics: A new area of engineering biology;Bioinformatics,2008
3. Spherical harmonics-based parametric deconvolution of 3D surface images using bending energy minimizations;Med. Image Anal.,2008
4. Shamir, L., Delaney, J., Orlov, N., Eckley, D., and Goldberg, I. (2010). Pattern recognition software and techniques for biological image analysis. PLoS Comput. Biol., 6.
5. A new wave of cellular imaging;Annu. Rev. Cell. Dev. Biol.,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献