Fast computation of accurate Zernike moments

Faculty Computer Science Year: 2008
Type of Publication: Article Pages: 97-107
Authors: DOI: 10.1007/s11554-007-0058-5
Journal: JOURNAL OF REAL-TIME IMAGE PROCESSING SPRINGER HEIDELBERG Volume: 3
Research Area: Computer Science; Engineering; Imaging Science \& Photographic Technology ISSN ISI:000207723700009
Keywords : Zernike moments, Geometric moments, Radial moments, Fast algorithm, Gray level images    
Abstract:
Zernike polynomials are continuous orthogonal polynomials defined in polar coordinates over a unit disk. Zernike moment's computation using conventional methods produced two types of errors namely approximation and geometrical. Approximation errors are removed by using exact Zernike moments. Geometrical errors are minimized through a proper mapping of the image. Exact Zernike moments are expressed as a combination of exact radial moments, where exact values of radial moments are computed by mathematical integration of the monomial polynomials over digital image pixels. A fast algorithm is proposed to accelerate the moment's computations. A comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.
   
  Online    
PDF  
       
Tweet