- Pseudo-Zernike polynomials
In
mathematics , Pseudo-Zernike polynomials are well known and widely used in the analysis of optical systems. They are also widely used inimage analysis as region descriptors.Definition
They are an
orthogonal set of complex-valuedpolynomials defined as :where and orthogonality on the
unit disk isgiven as:The
radial polynomials are defined as:where
The PZM of order and repetition are defined as:
where and takes on positive and negative
integer values subject to .The image function can be reconstructed by expansion of the Pseudo-Zernikecoefficients on the unit disk as:
Pseudo-Zernike moments are derived from conventional
Zernike moments and shownto be more robust and less sensitive to imagenoise than the Zernike moments.ee also
*
Zernike polynomials 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).
# [http://www.cosc.canterbury.ac.nz/mukundan/ivcnz01.pdf An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments]
# [http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/SHUTLER3/node11.html Complex Zernike Moments]
Wikimedia Foundation. 2010.