Numerical stability of fast computation algorithms of Zernike moments

This paper exhaustively compares some well known recursive algorithms for the computation of Zernike moments and sets the appropriate conditions in which each algorithm may fall in an unstable state. The experiments show that any of these algorithms can be unstable under some conditions and thus the need to develop more stable algorithms is of major importance.