| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 534699 | Pattern Recognition Letters | 2011 | 10 Pages |
Image representation by using polynomial moments is an interesting theme. In this paper, image representation by using orthogonal Gegenbauer function is presented. A novel method for accurate and fast computation of orthogonal Gegenbauer moments is proposed. The accurate values of Gegenbauer moments are obtained by mathematically integrating Gegenbauer polynomials multiplied by their weight functions over the digital image pixels. A novel recurrence formula is derived for the kernel generation. The proposed method removes the numerical approximation errors involved in conventional method. A fast algorithm is proposed to accelerate the moment’s computations. A comparison with the conventional method is performed. The obtained results explain the efficiency and the superiority of the proposed method.
Research highlights► Orthogonal Gegenbauer moments are used in image representation. ► A highly accurate method is proposed Gegenbauer moments computation. ► Gegenbauer moments are robust against the negative effect of additive noise.
