A comparative analysis of algorithms for fast computation of Zernike moments
From MaRDI portal
Publication:1402659
DOI10.1016/S0031-3203(02)00091-2zbMath1028.68142MaRDI QIDQ1402659
Publication date: 28 August 2003
Published in: Pattern Recognition (Search for Journal in Brave)
Related Items
A new class of Zernike moments for computer vision applications ⋮ Image quality assessment by discrete orthogonal moments ⋮ Stable, fast computation of high-order Zernike moments using a recursive method ⋮ Moments-based fast wedgelet transform ⋮ A comment on: ``Fast and numerically stable methods for the computation of Zernike moments by Singh et al. [Pattern recognition, 43(2010), pages 2497--2506] ⋮ A comparative analysis of algorithms for fast computation of Zernike moments ⋮ New computational methods for full and subset Zernike moments. ⋮ Numerical stability of fast computation algorithms of Zernike moments ⋮ Fourier descriptors based on the structure of the human primary visual cortex with applications to object recognition ⋮ A parallel recurrence method for the fast computation of Zernike moments ⋮ Computation strategies of orthogonal image moments: a comparative study ⋮ An effective solution for trademark image retrieval by combining shape description and feature matching ⋮ Fast and numerically stable methods for the computation of Zernike moments ⋮ Efficient computations for generalized Zernike moments and image recovery ⋮ A systematic method for efficient computation of full and subsets Zernike moments ⋮ Efficient computation of radial moment functions using symmetrical property ⋮ A novel approach to the fast computation of zernike moments ⋮ Classification of plant leaf images with complicated background ⋮ Pattern classification by using improved wavelet compressed Zernike moments ⋮ Fast and stable algorithms for high-order pseudo Zernike moments and image reconstruction
Cites Work
This page was built for publication: A comparative analysis of algorithms for fast computation of Zernike moments
