Abstract
In this work, we propose a Quality Factor (QF) that makes use of the orthogonal property in Orthogonal Polynomials (OPs). We have chosen Zernike Radial Polynomials (ZRPs), which were heavily investigated in fields related to digital image/signal processing, as a case study. We also implemented analysis of Zernike moments to investigate how the proposed QF relates to their computation error. Besides ZRPs direct computation, several fast algorithms have been proposed, e.g. the q-recursive, Kintner’s method, and Prata’s method. Our simulations using the proposed QF showed that the direct method and all forms of Prata’s method have numerical instability with orders ≥42 and ≥87 respectively. QF analyses using Kintner’s method and the q-recursive method have shown that these methods are numerically stable up to order 800 (the maximum targeted order in this work) and 180 respectively. We recommend using Prata’s method with orders less than 70, which contradict pervious findings suggesting that using Prata’s method(s) with orders up to 90 is legitimate. All the methods that we have investigated, except Kintner’s method, have numerical instability at high orders.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Isaacson, E., Keller, H.B.: Analysis of Numerical Methods. Dover Publications (1994)
Lee, D.W.: Classical multiple orthogonal polynomials of Angelesco system. Appl. Numer. Math. 60, 1342–1351 (2010)
Al-Rawi, M.: Fast Zernike moments. J. Real-Time Image Process. 3, 89–96 (2008)
Singh, C., Walia, E.: Fast and numerically stable methods for the computation of Zernike moments. Pattern Recognit. 43, 2497–2506 (2010)
Zernike, F.: Beugungstheorie Des Schneidenver-Fahrens Und Seiner Verbesserten Form, Der Phasenkontrastmethode. Physica 1, 689–704 (1934)
Lundstrom, L., Unsbo, P.: Transformation of Zernike coefficients: scaled, translated, and rotated wavefronts with circular and elliptical pupils. J. Opt. Soc. Am. A-Opt. Image Sci. Vis. 24, 569–577 (2007)
Teague, M.R.: Image analysis via the general theory of moments. Journal of the Optical Society of America 70, 920–930 (1980)
Kintner, E.C.: Some comments on use of Zernike polynomials in optics. Opt. Commun. 18, 235–237 (1976)
Prata, A., Rusch, W.V.T.: Algorithm for computation of Zernike polynomials expansion coefficients. Appl. Optics 28, 749–754 (1989)
Chong, C.W., Raveendran, P., Mukundan, R.: A comparative analysis of algorithms for fast computation of Zernike moments. Pattern Recognit. 36, 731–742 (2003)
Al-Rawi, M.S.: Prata’s method, Kintner’s method, and the q-recursive method at http://www.mathworks.com/matlabcentral/fileexchange/authors/215770 (accessed March 2013)
Fricker, P.: http://www.mathworks.com/matlabcentral/fileexchange/7687 (accessed March 2013)
Liao, S.X., Pawlak, M.: On the accuracy of Zernike moments for image analysis. IEEE Trans. Pattern Anal. Mach. Intell. 20, 1358–1364 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Rawi, M.S. (2013). Numerical Stability Quality-Factor for Orthogonal Polynomials: Zernike Radial Polynomials Case Study. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2013. Lecture Notes in Computer Science, vol 7950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39094-4_77
Download citation
DOI: https://doi.org/10.1007/978-3-642-39094-4_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39093-7
Online ISBN: 978-3-642-39094-4
eBook Packages: Computer ScienceComputer Science (R0)