Abstract
The fast computation of Zernike moments from normalized geometric moments has been developed in this paper. The computation is multiplication free and only additions are needed to generate Zernike moments. Geometric moments are generated using Hatamian's filter up to high orders by a very simple and straightforward computation scheme. Other kinds of moments (e.g., Legendre, pseudo Zernike) can be computed using the same algorithm after giving the proper transformations that state their relations to geometric moments. Proper normalizations of geometric moments are necessary so that the method can be used in the efficient computation of Zernike moments. To ensure fair comparisons, recursive algorithms are used to generate Zernike polynomials and other coefficients. The computational complexity model and test programs show that the speed-up factor of the proposed algorithm is superior with respect to other fast and/or direct computations. It perhaps is the first time that Zernike moments can be computed in real time rates, which encourages the use of Zernike moment features in different image retrieval systems that support huge databases such as the XM experimental model stated for the MPEG-7 experimental core. It is concluded that choosing direct computation would be impractical.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
