Fast and stable algorithms for high-order pseudo Zernike moments and image reconstruction
From MaRDI portal
Publication:2335531
DOI10.1016/j.amc.2018.04.001zbMath1427.94010OpenAlexW2800118762MaRDI QIDQ2335531
Publication date: 14 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.04.001
Farey sequence\(q\)-recursive methodpseudo Zernike moments\(p\)-recursive methodpseudo Zernike radial polynomials
Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (5)
Stable computation of higher order Charlier moments for signal and image reconstruction ⋮ Stable analysis of large-size signals and images by Racah's discrete orthogonal moments ⋮ 2D and 3D image localization, compression and reconstruction using new hybrid moments ⋮ Expectation identities from integration by parts for univariate continuous random variables with applications to high-order moments ⋮ Novel quaternion discrete shifted Gegenbauer moments of fractional-orders for color image analysis
Cites Work
- Fast and accurate method for high order Zernike moments computation
- A new class of Zernike moments for computer vision applications
- Fast and numerically stable methods for the computation of Zernike moments
- A comparative analysis of algorithms for fast computation of Zernike moments
- A pseudo-Zernike moment based audio watermarking scheme robust against desynchronization attacks
- Stable, fast computation of high-order Zernike moments using a recursive method
- On image analysis by the methods of moments
- Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode
- Unnamed Item
This page was built for publication: Fast and stable algorithms for high-order pseudo Zernike moments and image reconstruction
