15 December 2016 Fast and efficient computation of three-dimensional Hahn moments
Abderrahim Mesbah, Aissam Berrahou, Mostafa El Mallahi, Hassan Qjidaa
Author Affiliations +
Abstract
We propose an algorithm for fast computation of three-dimensional (3-D) Hahn moments. First, the symmetry property of Hahn polynomials is provided to decrease the computational complexity at 12%. Second, 3-D Hahn moments are computed by using an algorithm based on matrix multiplication. The proposed algorithm enormously reduces the computational complexity of a 3-D Hahn moment and its inverse moment transform. It can be also implemented easily for high order of moments. The performance of the proposed algorithm is proved through object reconstruction experiments. The experimental results and complexity analysis show that the proposed method outperforms the straightforward method, especially for large size noise-free and noisy 3-D objects.
Abderrahim Mesbah, Aissam Berrahou, Mostafa El Mallahi, and Hassan Qjidaa "Fast and efficient computation of three-dimensional Hahn moments," Journal of Electronic Imaging 25(6), 061621 (15 December 2016). https://doi.org/10.1117/1.JEI.25.6.061621
Published: 15 December 2016
Lens.org Logo
CITATIONS
Cited by 22 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
3D image processing

Reconstruction algorithms

3D image reconstruction

Matrices

Matrix multiplication

Signal to noise ratio

Electroluminescence

Back to Top