2005Dianzi xuebaoRequires access

A Novel Algorithm for Fast Computation of Pseudo-Zernike Moments

Shu Huazhong

Open publisher page 2 citations

Abstract

Zernike moments are widely used in the fields of pattern recognition and image analysis due to their good properties such as orthogonality and rotation invariance.Pseudo-Zernike moments have similar properties as those of Zernike moments;moreover,they are less sensitive to image noise than the conventional Zernike moments.However,the problem of fast computation of pseudo-Zernike moments has not been well solved due to the complexity of the pseudo-Zernile polynomials.In this paper,we present a novel method for fast computing the pseudo-Zernike moments.

About this research paper

What this paper is about

Zernike moments are widely used in the fields of pattern recognition and image analysis due to their good properties such as orthogonality and rotation invariance.Pseudo-Zernike moments have similar properties as those of Zernike moments;moreover,they are less sensitive to image noise than the conventional Zernike moments.However,the problem of fast computation of pseudo-Zernike moments has not been well solved due to the complexity of the pseudo-Zernile polynomials.In this paper,we present a novel method for fast computing the pseudo-Zernike moments.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Zernike moments are widely used in the fields of pattern recognition and image analysis due to their good properties such as orthogonality and rotation invariance.Pseudo-Zernike moments have similar properties as those of Zernike moments;moreover,they are less sensitive to image noise than the conventional Zernike moments.However,the problem of fast computation of pseudo-Zernike moments has not been well solved due to the complexity of the pseudo-Zernile polynomials.In this paper,we present a novel method for fast computing the pseudo-Zernike moments.

Key concepts: Zernike polynomials, Velocity Moments, Orthogonality, Computation, Algorithm, Mathematics, Noise (video), Moment (physics)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Novel Algorithm for Fast Computation of Pseudo-Zernike Moments — Research Paper | ScholarLens