Skip to main content

Accurate and Efficient Computation of High Order Zernike Moments

  • Conference paper
Advances in Visual Computing (ISVC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3804))

Included in the following conference series:

Abstract

Zernike Moments are useful tools in pattern recognition and image analysis due to their orthogonality and rotation invariance property. However, direct computation of these moments is very expensive, limiting their use especially at high orders. There have been some efforts to reduce the computational cost by employing quantized polar coordinate systems, which also reduce the accuracy of the moments. In this paper, we propose an efficient algorithm to accurately calculate Zernike moments at high orders. To preserve accuracy, we do not use any form of coordinate transformation and employ arbitrary precision arithmetic. The computational complexity is reduced by detecting the common terms in Zernike moments with different order and repetition. Experimental results show that our method is more accurate than other methods and it has comparable computational complexity especially in case of using large images and high order moments.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Prokop, R.J., Reeves, A.P.: A survey of moment based techniques for unoccluded object representation. Graph. Models Image Process–CVGIP 54(5), 438–460 (1992)

    Article  Google Scholar 

  2. Teague, M.R.: Image analysis via the general theory of moments. J. Opt. Soc. Am. 70(8), 920–930 (1980)

    Article  MathSciNet  Google Scholar 

  3. Teh, C.H., Chin, R.T.: On image analysis by the method of moments. IEEE Trans. Pattern Anal. Mach. Intell. 10, 485–513 (1988)

    Article  Google Scholar 

  4. Mukundan, R., Ramakrishnan, K.: Fast computation of legendre and zernike moments. Pattern Recognition 28(9), 1433–1442 (1995)

    Article  MathSciNet  Google Scholar 

  5. Belkasim, S.O., Ahmadi, M., Shridhar, M.: Efficient algorithm for fast computation of zernike moments. In: IEEE 39th Midwest symposium on Circuits and Systems, August 18-21, vol. 3, pp. 1401–1404 (1996)

    Google Scholar 

  6. Gu, J., Shua, H.Z., Toumoulinb, C., Luoa, L.M.: A novel algorithm for fast computation of zernike moments. Pattern Recognition 35, 2905–2911 (2002)

    Article  MATH  Google Scholar 

  7. GMP: (GNU multiple precision arithmetic library), http://www.swox.com/gmp

  8. Zernike, F.: Physica (1934)

    Google Scholar 

  9. Khotanzad, A., Hong, Y.H.: Invariant image recognition by zernike moments. IEEE Trans. on Pattern Anal. and Machine Intell. 12, 489–498 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amayeh, G., Erol, A., Bebis, G., Nicolescu, M. (2005). Accurate and Efficient Computation of High Order Zernike Moments. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds) Advances in Visual Computing. ISVC 2005. Lecture Notes in Computer Science, vol 3804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595755_56

Download citation

  • DOI: https://doi.org/10.1007/11595755_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30750-1

  • Online ISBN: 978-3-540-32284-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics