Abstract
Pseudo Zernike moments are broadly applied in the fields of image processing and pattern recognition. In this paper, we propose fast and stable methods for calculating high-order Pseudo Zernike moments. A new recurrence is introduced with the addition of a proof. Combining with the Farey sequence, the proposed method is adequate for fast computation. Furthermore, by collaborating with some procedures such as filter method or patch method, we can enhance the accuracy dramatically. The experimental results show that it takes 8.360 s to compute the top 500-order Pseudo Zernike moments of an image with 512 by 512 pixels using the proposed method. Its normalized mean square error is 0.000564363 if 500-order moments are used to reconstruct the image. When computing high-order Pseudo Zernike moments, the proposed filter method surpasses other compared methods in both speed and accuracy.
Sign-in/Register to access full text options 
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.
