A systematic method for efficient computation of full and subsets Zernike moments
From MaRDI portal
Publication:985068
DOI10.1016/j.ins.2010.02.006zbMath1200.68266OpenAlexW2077049290MaRDI QIDQ985068
Publication date: 20 July 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.02.006
Related Items
New set of Gegenbauer moment invariants for pattern recognition applications ⋮ An algorithm for fast computation of 3D Zernike moments for volumetric images ⋮ Accurate calculation of Zernike moments ⋮ Fast computation of Krawtchouk moments ⋮ A parallel recurrence method for the fast computation of Zernike moments
Cites Work
- A new class of Zernike moments for computer vision applications
- Exact Legendre moment computation for gray level images
- Circularly orthogonal moments for geometrically robust image watermarking
- A comparative analysis of algorithms for fast computation of Zernike moments
- New computational methods for full and subset Zernike moments.
- Exact and fast computation of geometric moments for gray level images
- Classification of plant leaf images with complicated background
- On image analysis by the methods of moments
This page was built for publication: A systematic method for efficient computation of full and subsets Zernike moments
