Fast computation of orthogonal Fourier-Mellin moments in polar coordinates

Faculty Computer Science Year: 2011
Type of Publication: Article Pages: 73-80
Authors: DOI: 10.1007/s11554-009-0135-z
Journal: JOURNAL OF REAL-TIME IMAGE PROCESSING SPRINGER HEIDELBERG Volume: 6
Research Area: Computer Science; Engineering; Imaging Science \& Photographic Technology ISSN ISI:000290543600002
Keywords : Fourier-Mellin moments, Symmetry property, Fast algorithm, Polar coordinates, Gray-level images    
Abstract:
Fast, accurate and memory-efficient method is proposed for computing orthogonal Fourier-Mellin moments. Since the basis polynomials are continuous orthogonal polynomials defined in polar coordinates over a unit disk, the proposed method is applied to polar coordinates where the unit disk is divided into a number of non-overlapping circular rings that are divided into circular sectors of the same area. Each sector is represented by one point in its center. The implementation of this method completely removes both approximation and geometrical errors produced by the conventional methods. Based on the symmetry property, a fast and memory-efficient algorithm is proposed to accelerate the moment's computations. A comparison to conventional methods is performed. Numerical experiments are performed to ensure the efficiency of the proposed method.
   
  Online    
PDF  
       
Tweet