|
|
Properties and fast algorithms of 3D Zernike radial polynomials |
School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu 215006, China |
|
|
Abstract To solve the too high computational complexity of 3D Zernike moments, the properties and fast algorithms of 3D Zernike radial polynomials were investigated. The relationship between 3D and 2D Zernike radial polynomials was discovered to generalize some important properties of 2D Zernike radial polynomials and four fast algorithms to 3D case. The obtained four 3D fast algorithms were optimized and fused to design one faster hybrid algorithm for computing full set of 3D Zernike radial polynomials. The complexity of the five algorithms was analyzed. For different maximum orders, the full sets of 3D Zernike radial polynomials were computed with the five algorithms, and the elapsed CPU times were compared. The results show that the proposed hybrid algorithm can significantly reduce the complexity and improve the operation speed. The optimization effect becomes more obviously as the order increases.
|
|
|
|
|
|
|
|