Fast and numerically stable methods for the computation of Zernike moments

DOI10.1016/J.PATCOG.2010.02.005MaRDI QIDQ969096zbMATH OpenOpenAlexFDO

Authors Chandan Singh, Ekta Walia

Publication date 11 May 2010

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2010.02.005

zbMATH Keywords

accuracyfast computationnumerical stabilityZernike moments

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• Stable, fast computation of high-order Zernike moments using a recursive method
• Numerical stability of fast computation algorithms of Zernike moments
• A parallel recurrence method for the fast computation of Zernike moments
• A novel approach to the fast computation of zernike moments
• A comparative analysis of algorithms for fast computation of Zernike moments

Cites work

• A comparative analysis of algorithms for fast computation of Zernike moments
• A new class of Zernike moments for computer vision applications
• A novel approach to the fast computation of zernike moments
• Circularly orthogonal moments for geometrically robust image watermarking
• Efficient computation of radial moment functions using symmetrical property
• Improved quadratic normal vector interpolation for realistic shading
• Improved quality of reconstructed images using floating point arithmetic for moment calculation
• Invariant character recognition with Zernike and orthogonal Fourier-Mellin moments
• Numerical stability of fast computation algorithms of Zernike moments
• On image analysis by the methods of moments
• Rotation, scale and translation invariant handwritten Devanagari numeral character recognition using general fuzzy neural network

Cited in

(16)

• A comparative analysis of algorithms for fast computation of Zernike moments
• A novel algorithm for fast computation of Zernike moments
• Accurate computation of orthogonal Fourier-Mellin moments
• Efficient computations for generalized Zernike moments and image recovery
• Comparing field data using Alpert multi-wavelets
• A parallel recurrence method for the fast computation of Zernike moments
• Error analysis in the computation of orthogonal rotation invariant moments
• Fast and stable algorithms for high-order pseudo Zernike moments and image reconstruction
• Stable, fast computation of high-order Zernike moments using a recursive method
• Numerical stability of fast computation algorithms of Zernike moments
• Orthogonal moments based on exponent functions: exponent-Fourier moments
• Fast and accurate method for high order Zernike moments computation
• 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]
• ZERNIPAX: a fast and accurate Zernike polynomial calculator in Python
• Efficient and accurate quaternion Chebyshev-Fourier moments for color image zero-watermarking
• Projective invariants of D-moments of 2D grayscale images

This page was built for publication: Fast and numerically stable methods for the computation of Zernike moments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969096)