2003
DOI: 10.1016/s0031-3203(02)00091-2
|View full text |Cite
|
Sign up to set email alerts
|

A comparative analysis of algorithms for fast computation of Zernike moments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
131
0
1

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 246 publications
(133 citation statements)
references
References 11 publications
1
131
0
1
Order By: Relevance
“…Images are firstly pre-processed and transformed by the discrete double density wavelet transform (3DWT). The following features are extracted: Texture descriptors [13], -Statistical moments [14], Tamura parameters [15,16], Radon's characteristics [17,18] and Zernike's moments [19] …”
Section: Features Extractionmentioning
confidence: 99%
“…Images are firstly pre-processed and transformed by the discrete double density wavelet transform (3DWT). The following features are extracted: Texture descriptors [13], -Statistical moments [14], Tamura parameters [15,16], Radon's characteristics [17,18] and Zernike's moments [19] …”
Section: Features Extractionmentioning
confidence: 99%
“…For example the most commonly used ones are the Zernike [4], Tchebichef [17] or power moments. Additionally, in [18] a method of custom built moments construction has been proposed.…”
Section: Momentsmentioning
confidence: 99%
“…Common methods are based on moments [28,2,13] including geometric, Legendre, Zernike, and Pseudo-Zernike moments. Comparative studies [2,28] have demonstrated the interest on improving invariance properties and reducing computational time of the Zernike moments [8]. On the other side, to overcome the drawbacks of contour-based Fourier descriptors, Zhang and Lu [30] have proposed a region-based Generic Fourier Descriptor (GFD).…”
Section: Introductionmentioning
confidence: 99%