Fast computation of Jacobi-Fourier moments for invariant image recognition

作者：

Highlights：

• Fast recursive method for the computation of Jacobi-Fourier moments is proposed.

• The proposed method not only reduces time complexity but also improves numerical stability of moments.

• Better image reconstruction is achieved with lower reconstruction error.

• Proposed method is useful for many image processing, pattern recognition and computer vision applications.

摘要

•Fast recursive method for the computation of Jacobi-Fourier moments is proposed.•The proposed method not only reduces time complexity but also improves numerical stability of moments.•Better image reconstruction is achieved with lower reconstruction error.•Proposed method is useful for many image processing, pattern recognition and computer vision applications.

论文关键词：Jacobi-Fourier moments,Recursive method,Numerical stability

论文评审过程：Received 23 December 2013, Revised 4 July 2014, Accepted 17 November 2014, Available online 25 November 2014.

论文官网地址：https://doi.org/10.1016/j.patcog.2014.11.012