CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2012 vol.34 Issue No.11 - Nov.

Subscribe

Issue No.11 - Nov. (2012 vol.34)

pp: 2158-2163

P. Koehl , Dept. of Comput. Sci., Univ. of California, Davis, CA, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2012.23

ABSTRACT

A new exact algorithm is proposed to compute the 3D geometric moments of a homogeneous shape defined by an unstructured triangulation of its surface. This algorithm relies on the analytical integration of the moments on tetrahedra defined by the surface triangles and a central point and on a set of recurrent relationships between the corresponding integrals, and achieves linear running time complexities with respect to the number of triangles in the surface mesh and with respect to the number of moments that are computed. This effectively reduces the complexity for computing moments up to order N from N

^{6}to N^{3}with respect to the fastest previously proposed exact algorithm.INDEX TERMS

Shape, Equations, Approximation methods, Approximation algorithms, Mathematical model, Computational complexity, discrete convolution, 3D geometric moments, exact algorithm

CITATION

P. Koehl, "Fast Recursive Computation of 3D Geometric Moments from Surface Meshes",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.34, no. 11, pp. 2158-2163, Nov. 2012, doi:10.1109/TPAMI.2012.23REFERENCES