Fast and stable algorithms for high-order Pseudo Zernike moments and image reconstruction

An-Wen Deng and Chih-Ying Gwo

Applied Mathematics and Computation, 2018, vol. 334, issue C, 239-253

Abstract: Pseudo Zernike moments are broadly applied in the fields of image processing and pattern recognition. In this paper, we propose fast and stable methods for calculating high-order Pseudo Zernike moments. A new recurrence is introduced with the addition of a proof. Combining with the Farey sequence, the proposed method is adequate for fast computation. Furthermore, by collaborating with some procedures such as filter method or patch method, we can enhance the accuracy dramatically. The experimental results show that it takes 8.360 s to compute the top 500-order Pseudo Zernike moments of an image with 512 by 512 pixels using the proposed method. Its normalized mean square error is 0.000564363 if 500-order moments are used to reconstruct the image. When computing high-order Pseudo Zernike moments, the proposed filter method surpasses other compared methods in both speed and accuracy.

Keywords: Pseudo Zernike moments; Pseudo Zernike radial polynomials; Farey sequence; q-recursive method; p-recursive method (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318303059
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:334:y:2018:i:c:p:239-253

DOI: 10.1016/j.amc.2018.04.001

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().