Pseudo zernike polynomials
From Wikipedia, the free encyclopedia
Pseudo-Zernike polynomials are well known and widely used in the analysis of optical systems. They are also widely used in image analysis as region descriptors.
[edit] Definition
They are an orthogonal set of complex-valued polynomials defined as :
where and orthogonality on the unit disk is given as:
The radial polynomials {Rnm} are defined as:
where
The PZM of order n and repetition l are defined as:
where and l takes on positive and negative integer values subject to .
The image function can be reconstructed by expansion of the Pseudo-Zernike coefficients on the unit disk as:
Pseudo-Zernike moments are derived from conventional Zernike moments and shown to be more robust and less sensitive to image noise than the Zernike moments.
[edit] References
- TEH C.-H., CHIN R.: On image analysis by the methods of moments. Pattern Analysis and Machine Intelligence, IEEE Transactions on 10, 4 (1998), 496–513.
- BELKASIM S., AHMADI M., SHIRDHAR M.: Efficient algorithm for the fast computation of zernike moments.
- HADDADNIA J., AHMADI M., FAEZ K.: An efficient feature extraction method with pseudo-zernike moment in rbf neural network-based human face recognition system. EURASIP Journal on Applied Signal Processing (2003), 890–901.
- LIN T.-W., CHOU Y.-F.: A comparative study of zernike moments. Proceedings of the IEEE/WIC International Conference on Web Intelligence (2003).
- An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments
- Complex Zernike Moments