Accuracy and numerical stability of high-order polar harmonic transforms

Invariant moments and transforms are a special kind of statistical measure designed to remain constant after some transformations, such as object rotation, scaling, translation or image illumination changes, in order to improve the reliability of a pattern recognition system. Polar harmonic transforms (PHTs) are one of such image descriptors based on a set of orthogonal projection bases, which are better rated in comparison with other moments and transforms because they possess less redundant information. PHTs suffer from geometric error and numerical integration error. Geometric error is caused when a square image is mapped into a unit circular disk, which cannot exactly match the square domain. Numerical integration error is caused when the integration is approximated by zeroth-order summation. We propose a computational framework based on numerical integration approach that reduces the geometric error and the numerical integration error simultaneously. The effect of the improved accuracy in the PHTs is analysed for rotation invariance, scale invariance and image noise. Various numerical experiments demonstrate that the effect of these errors is much more prominent in small images and, therefore the proposed method is suitable for applications involving small images, such as in optical character recognition and template-matching applications.

[1]  Xudong Jiang,et al.  Two-Dimensional Polar Harmonic Transforms for Invariant Image Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Behrooz Kamgar-Parsi,et al.  Evaluation of Quantization Error in Computer Vision , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Miroslaw Pawlak,et al.  Accurate Computation of Zernike Moments in Polar Coordinates , 2007, IEEE Transactions on Image Processing.

[4]  Ioannis Andreadis,et al.  Accurate Calculation of Image Moments , 2007, IEEE Transactions on Image Processing.

[5]  Ioannis Andreadis,et al.  Real-time computation of Zernike moments , 2005, IEEE Transactions on Circuits and Systems for Video Technology.

[6]  Miroslaw Pawlak,et al.  On Image Analysis by Moments , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Y. Sheng,et al.  Orthogonal Fourier–Mellin moments for invariant pattern recognition , 1994 .

[8]  Chandan Singh,et al.  Algorithms for fast computation of Zernike moments and their numerical stability , 2011, Image Vis. Comput..

[9]  M. Teague Image analysis via the general theory of moments , 1980 .

[10]  J. Faires,et al.  Numerical Methods , 2002 .

[11]  Chee-Way Chong,et al.  A comparative analysis of algorithms for fast computation of Zernike moments , 2003, Pattern Recognit..

[12]  Miroslaw Pawlak,et al.  On the Accuracy of Zernike Moments for Image Analysis , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Roland T. Chin,et al.  On digital approximation of moment invariants , 1986, Computer Vision Graphics and Image Processing.

[14]  Miroslaw Pawlak,et al.  On the reconstruction aspects of moment descriptors , 1992, IEEE Trans. Inf. Theory.

[15]  Reinhard Klette,et al.  Multigrid error bounds for moments of arbitrary order , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[16]  Chandan Singh,et al.  Computation of Zernike moments in improved polar configuration , 2009, IET Image Process..

[17]  Raveendran Paramesran,et al.  On the computational aspects of Zernike moments , 2007, Image Vis. Comput..

[18]  Khalid M. Hosny,et al.  Fast computation of accurate Zernike moments , 2008, Journal of Real-Time Image Processing.

[19]  Roland T. Chin,et al.  On Image Analysis by the Methods of Moments , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Raveendran Paramesran,et al.  Efficient computation of radial moment functions using symmetrical property , 2006, Pattern Recognit..

[21]  Glen P. Abousleman,et al.  Orthogonal Rotation-Invariant Moments for Digital Image Processing , 2008, IEEE Transactions on Image Processing.