A parallel recurrence method for the fast computation of Zernike moments

This paper presents a parallel recursive method for the computation of Zernike moments from a digital image. The proposed method can reduce the computational complexity of the Zernike radial polynomials by introducing a novel recurrence relation, and be applicable to either the computation of a sing...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2012-11, Vol.219 (4), p.1549-1561
Main Authors: Qin, Huafeng, Qin, Lan, Xue, Lian, Yu, Chengbo
Format: Article
Language:English
Subjects:
Fast computation
Image reconstruction accuracy
Recursive method
Vectorization
Zernike moments
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a parallel recursive method for the computation of Zernike moments from a digital image. The proposed method can reduce the computational complexity of the Zernike radial polynomials by introducing a novel recurrence relation, and be applicable to either the computation of a single Zernike moment or entire set of Zernike moments. The fast computation is achieved because it involves less addition and multiplication operations and is executed in parallel. Moreover, the single Zernike moment can be obtained with employing partial Zernike moments of lower orders. The experiments are carried out to evaluate the performance of the proposed method using binary and grayscale images. The experimental results show that the proposed method takes the shortest time in computing the Zernike moments of a specific order ⩽28 as well as the entire Zernike moments of orders ⩽70.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2012.07.055