Comments on “fast computation of jacobi-Fourier moments for invariant image recognition”
作者：
Highlights：
• Computation procedure presented in “Fast computation of Jacobi–Fourier moments for invariant image recognition” has been analyzed and it has been demonstrated that the proposed domain of the kernel functions causes the loss of the orthogonality.
• Some imprecisions in the determination of the particular cases of Jacobi–Fourier kernel, as well as some errata in the recursive computation of the polynomials have been corrected.
• It has proposed the use of a polar pixel tiling scheme, which allows a more accurate moment computation.
• It is demonstrated that the image reconstruction error is reduced, and this error continuously decreases as the number of considered moments increases.
摘要
•Computation procedure presented in “Fast computation of Jacobi–Fourier moments for invariant image recognition” has been analyzed and it has been demonstrated that the proposed domain of the kernel functions causes the loss of the orthogonality.•Some imprecisions in the determination of the particular cases of Jacobi–Fourier kernel, as well as some errata in the recursive computation of the polynomials have been corrected.•It has proposed the use of a polar pixel tiling scheme, which allows a more accurate moment computation.•It is demonstrated that the image reconstruction error is reduced, and this error continuously decreases as the number of considered moments increases.
论文关键词：Jacobi polynomials,Orthogonal moments,Rotation-invariant pattern recognition
论文评审过程：Received 9 March 2016, Revised 13 January 2017, Accepted 16 January 2017, Available online 2 February 2017, Version of Record 10 February 2017.
论文官网地址：https://doi.org/10.1016/j.patcog.2017.01.025
