# Complex Zernike moments

Posted 2012.05.21 01:56The Zernike polynomials were first proposed in 1934 by Zernike [22]. Their moment formulation appears to be one of the most popular, outperforming the alternatives [19] (in terms of noise resilience, information redundancy and reconstruction capability). The pseudo-Zernike formulation proposed by Bhatia and Wolf [3] further improved these characteristics. However, here we study the original formulation of these orthogonal invariant moments.

Complex Zernike moments [18] are constructed using a set of complex polynomials which form a complete orthogonal basis set defined on the unit disc . They are expressed asTwo dimensional Zernike moment:

and is true. The Zernike polynomials [22] Zernike polynomial expressed in polar coordinates are:

where are defined over the unit disc, and is the orthogonal radial polynomial, defined asOrthogonal radial polynomial:

where:

(53) |

(54) | |||

Figure 1.6 shows eight such radial responses, where it can been seen that the polynomials become more grouped, as they approach the edge of the unit disc ( approaches unity). (Care must be taken with regard to the accuracy of these polynomial calculations as the factorial operations can quickly produce large integer values, even at relatively low order ). The difference between these orthogonal polynomials and the non-orthogonal monomials can be seen by comparing Figure 1.6 with Figure 1.2.So for a discrete image, if is the current pixel then Equation 1.49 becomes:

(55) |

where

However, in practice is often defined over the interval , so care must be taken as to which quadrant the Cartesian coordinates appear in. Translation and scale invariance can be achieved by normalising the image using the Cartesian moments prior to calculation of the Zernike moments [7]. Translation invariance is achieved by moving the origin to the image's COM, causing . Following this, scale invariance is produced by altering each object so that its area (or pixel count for a binary image) is , where is a predetermined value. Both invariance properties (for a binary image) can be achieved using :

and is the new translated and scaled function. The error involved in the discrete implementation can be reduced by interpolation. If the coordinate calculated by Equation 1.58 does not coincide with an actual grid location, the pixel value associated with it is interpolated from the four surrounding pixels. As a result of the normalisation, the Zernike moments and are set to known values. is set to zero, due to the translation of the shape to the centre of the coordinate system. This however will be affected by a discrete implementation where the error in the mapping will decrease as the shape (being mapped) size (or pixel-resolution) increases. is dependent on , and thus on :

Further, the absolute value of a Zernike moment is rotation invariant as reflected in the mapping of the image to the unit disc. The rotation of the shape around the unit disc is expressed as a phase change, if is the angle of rotation, is the Zernike moment of the rotated image and is the Zernike moment of the original image then:

**Subsections**

**Next:**A note on image

**Up:**Orthogonal moments

**Previous:**Legendre momentsJamie Shutler 2002-08-15

#### 'Enginius > Machine Learning' 카테고리의 다른 글

ANN로 headPoseEstimate하기 (0) | 2012.06.05 |
---|---|

Markov Chain Monte Carlo (MCMC) and Gibbs Sampling example(MATLAB) (0) | 2012.05.31 |

Complex Zernike moments (0) | 2012.05.21 |

푸리에 변환과 라플라스 변환 (18) | 2012.05.01 |

Hierarchical Temporal Memory Prototype ver1.0.0 (4) | 2012.04.26 |

기계 학습과 수학적 뒷받침 (0) | 2012.04.26 |

- Filed under : Enginius/Machine Learning
- Comment Trackback