Fast computation of pseudo Zernike moments

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.