A systematic method for efficient computation of full and subsets Zernike moments
From MaRDI portal
Publication:985068
DOI10.1016/J.INS.2010.02.006zbMATH Open1200.68266OpenAlexW2077049290MaRDI QIDQ985068FDOQ985068
Authors: Khalid M. Hosny 
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
Recommendations
Cites Work
- On image analysis by the methods of moments
- Circularly orthogonal moments for geometrically robust image watermarking
- Exact and fast computation of geometric moments for gray level images
- A new class of Zernike moments for computer vision applications
- Exact Legendre moment computation for gray level images
- A comparative analysis of algorithms for fast computation of Zernike moments
- Classification of plant leaf images with complicated background
- New computational methods for full and subset Zernike moments.
Cited In (13)
- An algorithm for fast computation of 3D Zernike moments for volumetric images
- Practical fast computation of Zernike moments
- A parallel recurrence method for the fast computation of Zernike moments
- Improved algorithm for Zernike basis functions
- Efficient computations for generalized Zernike moments and image recovery
- Accurate calculation of Zernike moments
- New set of Gegenbauer moment invariants for pattern recognition applications
- Fast computation of Krawtchouk moments
- New computational methods for full and subset Zernike moments.
- A new class of Zernike moments for computer vision applications
- Exact Legendre moment computation for gray level images
- A novel approach to the fast computation of zernike moments
- A new method for solving the Marr expansion coefficient
This page was built for publication: A systematic method for efficient computation of full and subsets Zernike moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985068)
