Efficient algorithm for fast computation of Zernike moments
From MaRDI portal
Publication:1925059
DOI10.1016/0016-0032(96)00017-8zbMath0858.68088OpenAlexW1969694079WikidataQ29395793 ScholiaQ29395793MaRDI QIDQ1925059
M. Shridhar, S. O. Belkasim, Majid Ahmadi
Publication date: 27 October 1996
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(96)00017-8
Related Items (9)
Practical fast computation of Zernike moments ⋮ A new class of Zernike moments for computer vision applications ⋮ Stable, fast computation of high-order Zernike moments using a recursive method ⋮ A comparative analysis of algorithms for fast computation of Zernike moments ⋮ Computation strategies of orthogonal image moments: a comparative study ⋮ Efficient computation of radial moment functions using symmetrical property ⋮ A novel approach to the fast computation of zernike moments ⋮ Pattern classification by using improved wavelet compressed Zernike moments ⋮ A novel algorithm for fast computation of Zernike moments
Cites Work
This page was built for publication: Efficient algorithm for fast computation of Zernike moments
