2008
DOI: 10.1007/s11554-007-0069-2
|View full text |Cite
|
Sign up to set email alerts
|

Fast Zernike moments

Abstract: Zernike moments are important digital image descriptors used in various applications starting from image watermarking to image recognition. Lots of fast algorithms have been proposed to speedup the computation of Zernike moments. This work provides computational complexity analysis of methods for the computation of Zernike moments, as well as a thorough study and simplification to the methods of finding Zernike moments from geometric moments. A new formula that relates Zernike moments to moments of digital fil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(13 citation statements)
references
References 17 publications
0
13
0
Order By: Relevance
“…Even if PZRPs are efficiently generated using recursive or coefficient methods, there is still a huge computation overhead of the amount O N 2 n þ 1 ð Þ 2 : It is possible to further reduce the computation by considering the symmetry of a point in the first octant [18]. To do this, (1) can be rewritten as…”
Section: Further Operations Reduction Using the Symmetry Methodsmentioning
confidence: 99%
“…Even if PZRPs are efficiently generated using recursive or coefficient methods, there is still a huge computation overhead of the amount O N 2 n þ 1 ð Þ 2 : It is possible to further reduce the computation by considering the symmetry of a point in the first octant [18]. To do this, (1) can be rewritten as…”
Section: Further Operations Reduction Using the Symmetry Methodsmentioning
confidence: 99%
“…Recurrence equations [19] are often used in place of these direct formulas, but although recurrence formulas do help to push the maximal order of computable moment higher, they eventually will suffer from numerical instability. See [19], [20] for some ZM-computation-related issues. A summary of comparison of the various moment kernels and that of PHTs is given in Table 1.…”
Section: Polar Harmonic Transformsmentioning
confidence: 99%
“…However, the plurality of large bit-width adders in the digital filter structure presents a major challenge to chip synthesis, placement and the routing process. Taking a different tack, Al-Rawi [23] generalized the relationship between the moments and the digital filter outputs using a recurrence formula.…”
Section: Introductionmentioning
confidence: 99%