RESUMO
A high-precision and fast algorithm for computation of Jacobi-Fourier moments (JFMs) is presented. A fast recursive method is developed for the radial polynomials that occur in the kernel function of the JFMs. The proposed method is numerically stable and very fast in comparison with the conventional direct method. Moreover, the algorithm is suitable for computation of the JFMs of the highest orders. The JFMs are generic expressions to generate orthogonal moments changing the parameters α and ß of Jacobi polynomials. The quality of the description of the proposed method with α and ß parameters known is studied. Also, a search is performed of the best parameters, α and ß, which significantly improves the quality of the reconstructed image and recognition. Experiments are performed on standard test images with various sets of JFMs to prove the superiority of the proposed method in comparison with the direct method. Furthermore, the proposed method is compared with other existing methods in terms of speed and accuracy.