Abstract
A fast and numerically stable method to compute pseudo Zernike moments is proposed in this paper. Several pseudo Zernike moment computation architectures are also implemented and some have overflow problems when high orders are computed. In addition, a correction to a previous two stage p-recursive pseudo Zernike radial polynomial algorithm is introduced. The newly proposed method that is based on computing pseudo Zernike radial polynomials through their relation to Zernike radial polynomials is found to be one and half times faster than the best algorithm reported up to date.
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.
