Digital Image Processing
Integrated Wavelet and Fourier-Mellin invariant feature in fingerprint verification system
WBMA '03 Proceedings of the 2003 ACM SIGMM workshop on Biometrics methods and applications
Subpixel edge location based on orthogonal Fourier-Mellin moments
Image and Vision Computing
Accurate Computation of Zernike Moments in Polar Coordinates
IEEE Transactions on Image Processing
Performance evaluation of moment-based watermarking methods: A review
Journal of Systems and Software
Analysis of algorithms for fast computation of pseudo Zernike moments and their numerical stability
Digital Signal Processing
The fast recursive computation of Tchebichef moment and its inverse transform based on Z-transform
Digital Signal Processing
Hi-index | 0.00 |
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.