Numerical stability of fast computation algorithms of Zernike moments

DOI10.1016/j.amc.2007.04.110zbMath1134.94311OpenAlexW2056834479MaRDI QIDQ2467434

G. A. Papakostas, D. K. Fragoulis, Yiannis Boutalis, Constantin Papaodysseus

Publication date: 21 January 2008

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

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

zbMATH Keywords

numerical stabilityrecursive algorithmZernike momentsfinite precision error

Mathematics Subject Classification ID

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

Related Items

Fast and accurate method for high order Zernike moments computation, A parallel recurrence method for the fast computation of Zernike moments, Computation strategies of orthogonal image moments: a comparative study, Fast and numerically stable methods for the computation of Zernike moments, Novel moment invariants for improved classification performance in computer vision applications

Cites Work

• A comparative analysis of algorithms for fast computation of Zernike moments
• A novel general methodology for studying and remedying finite precision error with application in Kalman filtering
• Translation invariants of Zernike moments.
• Exact analysis of the finite precision error generation and propagation in the FAEST and the fast transversal algorithms: A general methodology for developing robust RLS schemes
• Translation and scale invariants of Legendre moments
• Comparing LS FIR filtering and l-step ahead linear prediction
• Image analysis by Tchebichef moments
• A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering
• Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode
• Error sources and error propagation in the Levinson-Durbin algorithm
• Invariant character recognition with Zernike and orthogonal Fourier-Mellin moments