Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Efficient and Stable Voxel-Based Algorithm for Computing 3D Zernike Moments and Shape Reconstruction

Version 1 : Received: 11 November 2021 / Approved: 25 November 2021 / Online: 25 November 2021 (09:54:08 CET)

How to cite: Deng, A.; Gwo, C. Efficient and Stable Voxel-Based Algorithm for Computing 3D Zernike Moments and Shape Reconstruction. Preprints 2021, 2021110466. https://doi.org/10.20944/preprints202111.0466.v1 Deng, A.; Gwo, C. Efficient and Stable Voxel-Based Algorithm for Computing 3D Zernike Moments and Shape Reconstruction. Preprints 2021, 2021110466. https://doi.org/10.20944/preprints202111.0466.v1

Abstract

3D Zernike moments based on 3D Zernike polynomials have been successfully applied to the field of voxelized 3D shape retrieval and have attracted more attention in biomedical image processing. As the order of 3D Zernike moments increases, both computational efficiency and numerical accuracy decrease. Due to this phenomenon, a more efficient and stable method for computing high-order 3D Zernike moments was proposed in this study. The proposed recursive formula for computing 3D Zernike radial polynomials combines the recursive calculation of spherical harmonics to develop a voxel-based algorithm for the calculation of 3D Zernike moments. The algorithm was applied to the 3D shape Michelangelo's David with a size of 150×150×150 voxels. As compared to the method without additional acceleration, the proposed method uses a group action of order sixteen orthogonal group and saving unnecessary iterations, the factor of speed-up is 56.783±3.999 when the order of Zernike moments is between 10 and 450. The proposed method also obtained an accurate reconstructed shape with the error rate (normalized mean square error) of 0.00 (4.17×10^-3) when the reconstruction was computed for all moments up to order 450.

Keywords

3D Zernike moments; 3D Zernike radial polynomials; 3D Zernike polynomials; Spherical harmonics; Recurrence formula; Matrix Lie Group; Group action

Subject

Computer Science and Mathematics, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.