High-precision and fast computation of Jacobi-Fourier moments for image description
| Autor: | José Javier Báez-Rojas, Alfonso Padilla-Vivanco, César Camacho-Bello, Carina Toxqui-Quitl |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Zernike polynomials
business.industry Computation Direct method Image processing Iterative reconstruction Atomic and Molecular Physics and Optics Electronic Optical and Magnetic Materials symbols.namesake Fourier transform Optics Pattern recognition (psychology) symbols Jacobi polynomials Computer Vision and Pattern Recognition business Algorithm Mathematics |
| Zdroj: | Journal of the Optical Society of America. A, Optics, image science, and vision. 31(1) |
| ISSN: | 1520-8532 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|