Analysis of algorithms for fast computation of pseudo Zernike moments and their numerical stability

Authors:
Chandan Singh;Ekta Walia; Pooja;Rahul Upneja
Affiliations:
Department of Computer Science, Punjabi University, Patiala 147002, India;Department of Computer Science, South Asian University, New Delhi, India;Department of Computer Science, Punjabi University, Patiala 147002, India;Department of Computer Science, Punjabi University, Patiala 147002, India
Venue:
Digital Signal Processing
Year:
2012

Citing 13
Cited 2

On Image Analysis by the Methods of Moments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Invariant Image Recognition by Zernike Moments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Orthogonal Moment Features for Use With Parametric and Non-Parametric Classifiers

IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient computation of radial moment functions using symmetrical property

Pattern Recognition
Improved quality of reconstructed images using floating point arithmetic for moment calculation

Pattern Recognition
A novel approach to the fast computation of Zernike moments

Pattern Recognition
On the computational aspects of Zernike moments

Image and Vision Computing
Circularly orthogonal moments for geometrically robust image watermarking

Pattern Recognition
Fast and numerically stable methods for the computation of Zernike moments

Pattern Recognition
A new robust digital image watermarking based on Pseudo-Zernike moments

Multidimensional Systems and Signal Processing
An effective image retrieval scheme using color, texture and shape features

Computer Standards & Interfaces
Algorithms for fast computation of Zernike moments and their numerical stability

Image and Vision Computing
Fast computation of orthogonal Fourier---Mellin moments in polar coordinates

Journal of Real-Time Image Processing

A novel speech content authentication algorithm based on Bessel-Fourier moments

Digital Signal Processing
Error Analysis in the Computation of Orthogonal Rotation Invariant Moments

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at analyzing the performance of various fast methods for the computation of pseudo Zernike moments (PZMs) with respect to their time complexity and numerical stability. Based on these different types of existing methods, four new methods are also proposed. A computational framework is provided which integrates the fast calculation of pseudo Zernike polynomials (PZPs), the angular functions and symmetry/anti-symmetry property of complex kernel functions. It is shown that the recursive methods that compute PZMs of all orders =