Efficient algorithm for fast computation of Zernike moments

Abstract

Zernike moments have been used as shape descriptors in several object recognition applications. The classical method of computing Zernike moments is dependent on the regular moments which makes them computationally expensive and inefficient. In this paper, we present an efficient and fast algorithm for the direct computation of Zernike moments. This algorithm is based on using some properties of Zernike polynomials.