The aim of this report is threefold: First we generalize to 3D a long ago known fast algorithm for the computation of ordinary geometrical moments of 2D elds starting from what could be named cumulative moments. This is done by rst reformulating the 2D algorithm in terms of matrix operations and subsequently extending the result straightforwardly to 3D. Second, guided by the results of much res...

In this paper, a new edge detection approach combining Zernike moments operator with Sobel operator is proposed. This detection consists of two steps: Firstly, all probable edge points are detected using Sobel operator; Secondly, Zernike moments operator is used to relocate the edge precisely from the points detected by Sobel operator. In the second step, two masks (one real and one complex) ar...

A new method is proposed for fast and accurate computation of Zernike moments. This method presents a novel formula for computing exact Zernike moments by using exact complex moments where the exact values of complex moments are computed by mathematical integration of the monomials over digital image pixels. The proposed method is applicable to compute the full set of Zernike moments as well as...

In this paper, a novel feature-based image watermarking scheme is proposed. Zernike moments which have invariance properties are adopted in the scheme. In the proposed scheme, feature points are first extracted from host image and several circular patches centered on these points are generated. The patches are used as carriers of watermark information because they can be regenerated to locate w...

In this paper, a novel feature-based image watermarking scheme is proposed. Zernike moments which have invariance properties are adopted in the scheme. In the proposed scheme, feature points are first extracted from host image and several circular patches centered on these points are generated. The patches are used as carriers of watermark information because they can be regenerated to locate w...

This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Zpq. The present method comprises of Direct, Belkasim’s, Prata’s, Kintner’s and Coe3cient methods. We propose a new technique, denoted as q-recursive method, speci5cally for fast computation of Zernike moments. It uses radial polynomials of 5xed order p with a varying inde...

A new set, to our knowledge, of orthogonal moment functions for describing images is proposed. It is based on the generalized pseudo-Zernike polynomials that are orthogonal on the unit circle. The generalized pseudo-Zernike polynomials are scaled to ensure numerical stability, and some properties are discussed. The performance of the proposed moments is analyzed in terms of image reconstruction...

A texture-based method for fingerprint verification is proposed based on weighted Zernike moments. Zernike moment features are calculated from the region of interest (ROI) which consists of several concentric discs, called multi-discs. Zernike moments of multi-disc ROI are weighted according to the regions of discs. In order to reduce the computational complexity of Zernike moments, the fast Ze...

In this paper, a novel feature-based image watermarking scheme is proposed. Zernike moments which have invariance properties are adopted in the scheme. In the proposed scheme, feature points are first extracted from host image and several circular patches centered on these points are generated. The patches are used as carriers of watermark information because they can be regenerated to locate w...

Selecting appropriate feature extraction method is absolutely one of the most important factors to archive high classification performance in pattern recognition systems. Among different feature extraction methods proposed for pattern recognition, statistical moments seem to be so promising. Whereas theoretical comparison of the moments is too complicated, in this paper, an experimental evaluat...