Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition
DOI: 10.1109/cvpr.1989.37850
|View full text |Cite
|
Sign up to set email alerts
|

Object recognition using a neural network and invariant Zernike features

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0
1

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 9 publications
0
5
0
1
Order By: Relevance
“…Traditionally the most popular method of achieving scale invariance of Zernike moments [15][16][17][18] is based on normalizing the area that is the zero order of geometric moments, to a constant value; however there are several drawbacks: first, the changes in area are not always linearly dependent on changes of size for the same image; second, when the order of moments becomes larger, the dynamic range increases, which in turn amplify the numerical errors; third, the conversion from geometric moments to Zernike moments adds more computation complexity. In [1], Belkasim used the zero order and the second order of Zernike moments to develop several scale invariance parameters.…”
Section: Introductionmentioning
confidence: 99%
“…Traditionally the most popular method of achieving scale invariance of Zernike moments [15][16][17][18] is based on normalizing the area that is the zero order of geometric moments, to a constant value; however there are several drawbacks: first, the changes in area are not always linearly dependent on changes of size for the same image; second, when the order of moments becomes larger, the dynamic range increases, which in turn amplify the numerical errors; third, the conversion from geometric moments to Zernike moments adds more computation complexity. In [1], Belkasim used the zero order and the second order of Zernike moments to develop several scale invariance parameters.…”
Section: Introductionmentioning
confidence: 99%
“…It is usually unreasonable due to both time and space constraints to replicate each image many times at different rotations and to compute the resulting covariance matrix for eigenvector decomposition. To cope with this, Teague, [19] and then Khotanzad and Lu [10], developed a means of creating rotation-invariant image approximations based on Zernike polynomials. While Zernike polynomials are not adaptive to the data, PCA produces an optimal data adaptive basis (in the least squares sense).…”
Section: Introductionmentioning
confidence: 99%
“…Several years after, Teague used orthogonal polynomials to propose a new kind of moments called today, Zernike and Legendre moments [2]. Many authors have demonstrated that the moments of an image are useful features for pattern recognition and object classification [3][4][5][6][7][8][9][10][11]. In all these researches have been demonstrated that image moments based on different nature of polynomials can be efficiently combined in an algebraic way to define invariants to the orientation [12], scale [13], shift [14], blur [15][16][17], and the contrast changes [18] on the vision field of an image.…”
Section: Introductionmentioning
confidence: 99%