A Method for Efficiently Computing the Two-Dimensional Inverse Tchebichef Orthogonal Moments
Zhang Pin · Chinese Journal of Computers · 2006
Tchebichef moment is based on discrete orthogonal Tchebichef polynomials.It avoids any numerical approximations that come from numerical approximation of continuous integrals or coordinates transformation.Now,it is applied more and more widely to the area of image processing and computer vision.The authors use Clenshaw's recurrence formula and deduce a fast algorithm for calculating the one-dimensional inverse Tchebichef moments.Then,the authors extend it for the computation of the two-dimensional inverse Tchebichef moments.Experimental results show that the new method reduces the computational complexity greatly compared with the direct method.