Orthogonal Rotation-Invariant Moments for Digital Image Processing

Orthogonal rotation-invariant moments (ORIMs), such as Zernike moments, are introduced and defined on a continuous unit disk and have been proven powerful tools in optics applications. These moments have also been digitized for applications in digital image processing. Unfortunately, digitization compromises the orthogonality of the moments and, therefore, digital ORIMs are incapable of representing subtle details in images and cannot accurately reconstruct images. Typical approaches to alleviate the digitization artifact can be divided into two categories: (1) careful selection of a set of pixels as close approximation to the unit disk and using numerical integration to determine the ORIM values, and (2) representing pixels using circular shapes such that they resemble that of the unit disk and then calculating ORIMs in polar space. These improvements still fall short of preserving the orthogonality of the ORIMs. In this paper, in contrast to the previous methods, we propose a different approach of using numerical optimization techniques to improve the orthogonality. We prove that with the improved orthogonality, image reconstruction becomes more accurate. Our simulation results also show that the optimized digital ORIMs can accurately reconstruct images and can represent subtle image details.

[1]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[2]  N. Kehtarnavaz,et al.  Zernike moment invariants based photo-identification using Fisher discriminant model , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[3]  Henryk Iwaniec,et al.  On the divisor and circle problems , 1988 .

[4]  K. R. Ramakrishnan,et al.  Fast computation of Legendre and Zernike moments , 1995, Pattern Recognit..

[5]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[6]  Behrooz Kamgar-Parsi,et al.  Evaluation of quantization error in computer vision , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  D. Jackson,et al.  fourier series and orthogonal polynomials , 1943, The Mathematical Gazette.

[8]  Herbert Süße,et al.  The Method of Normalization to Determine Invariants , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

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

[10]  H. Engels,et al.  Numerical Quadrature and Cubature , 1980 .

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

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

[13]  M. Huxley Exponential sums and lattice points III , 2003 .

[14]  Mandyam D. Srinath,et al.  Invariant character recognition with Zernike and orthogonal Fourier-Mellin moments , 2002, Pattern Recognit..

[15]  Peng Jia-xiong,et al.  Invariance analysis of improved Zernike moments , 2002 .

[16]  Miroslaw Pawlak,et al.  Image Reconstruction with Polar Zernike Moments , 2005, ICAPR.

[17]  von F. Zernike Beugungstheorie des schneidenver-fahrens und seiner verbesserten form, der phasenkontrastmethode , 1934 .

[18]  Chee-Way Chong,et al.  Translation invariants of Zernike moments , 2003, Pattern Recognit..

[19]  Olaf Kübler,et al.  Complete Sets of Complex Zernike Moment Invariants and the Role of the Pseudoinvariants , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Guojun Lu,et al.  Evaluation of MPEG-7 shape descriptors against other shape descriptors , 2003, Multimedia Systems.

[21]  Huazhong Shu,et al.  A novel algorithm for fast computation of Zernike moments , 2002, Pattern Recognit..

[22]  Miroslaw Pawlak,et al.  On the recovery of a function on a circular domain , 2002, IEEE Trans. Inf. Theory.

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

[24]  Miroslaw Pawlak,et al.  On the improvement of rotational invariance of Zernike moments , 2005, IEEE International Conference on Image Processing 2005.

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

[26]  Roland T. Chin,et al.  On image analysis by the methods of moments , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[27]  Alireza Khotanzad,et al.  Invariant Image Recognition by Zernike Moments , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

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

[29]  Glenn Healey,et al.  Using Zernike moments for the illumination and geometry invariant classification of multispectral texture , 1998, IEEE Trans. Image Process..

[30]  A. Bhatia,et al.  On the circle polynomials of Zernike and related orthogonal sets , 1954, Mathematical Proceedings of the Cambridge Philosophical Society.

[31]  Whoi-Yul Kim,et al.  Robust Rotation Angle Estimator , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  Chin-Liang Wang,et al.  A new two-dimensional block adaptive FIR filtering algorithm and its application to image restoration , 1998, IEEE Trans. Image Process..

[33]  Philip N. Klein,et al.  Recognition of shapes by editing their shock graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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