Stable, fast computation of high-order Zernike moments using a recursive method
作者：
Highlights：
• This study has proposed a recursive method for fast computation of Zernike moments.
• The idea of Pascal׳s triangle is introduced to pre-calculate the binomial coefficients.
• Symmetry property and Farey sequence are applied to speed up the computation.
• The proposed method can yield accurate values of the high-order Zernike moments.
• The proposed took 5.398 seconds to compute the top 500-order Zernike moments.
摘要
•This study has proposed a recursive method for fast computation of Zernike moments.•The idea of Pascal׳s triangle is introduced to pre-calculate the binomial coefficients.•Symmetry property and Farey sequence are applied to speed up the computation.•The proposed method can yield accurate values of the high-order Zernike moments.•The proposed took 5.398 seconds to compute the top 500-order Zernike moments.
论文关键词：Zernike moments,Zernike radial polynomials,Farey sequence,q-Recursive method,Prata׳s method
论文评审过程：Received 9 September 2015, Revised 21 December 2015, Accepted 22 February 2016, Available online 7 March 2016, Version of Record 12 April 2016.
论文官网地址：https://doi.org/10.1016/j.patcog.2016.02.014
