Efficient computations for generalized Zernike moments and image recovery

DOI10.1016/j.amc.2018.07.029zbMath1428.94019OpenAlexW2885513659MaRDI QIDQ2007531

An-Wen Deng, Chih-Ying Gwo

Publication date: 22 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.07.029

zbMATH Keywords

dihedral groupJacobi polynomialrecursive formulaegeneralized Zernike momentsgeneralized Zernike radial polynomials

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (1)

Stable computation of higher order Charlier moments for signal and image reconstruction

Cites Work

• Unnamed Item
• Fast and accurate method for high order Zernike moments computation
• Fast and numerically stable methods for the computation of Zernike moments
• Trademark image retrieval using synthetic features for describing global shape and interior structure
• Transformation groups
• A comparative analysis of algorithms for fast computation of Zernike moments
• Generalized Zernike or disc polynomials
• A parallel recurrence method for the fast computation of Zernike moments
• Stable, fast computation of high-order Zernike moments using a recursive method
• A novel approach to the fast computation of zernike moments
• Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode

This page was built for publication: Efficient computations for generalized Zernike moments and image recovery