Abstract
As Planck’s constant \(\hbar\) (treated as a free parameter) tends to zero, the solution to the eikonal equation \(|\nabla S(X)|=f(X)\) can be increasingly closely approximated by the solution to the corresponding Schrödinger equation. When the forcing function f(X) is set to one, we get the Euclidean distance function problem. We show that the corresponding Schrödinger equation has a closed form solution which can be expressed as a discrete convolution and efficiently computed using a Fast Fourier Transform (FFT). The eikonal equation has several applications in image analysis, viz. signed distance functions for shape silhouettes, surface reconstruction from point clouds and image segmentation being a few. We show that the sign of the distance function, its gradients and curvature can all be written in closed form, expressed as discrete convolutions and efficiently computed using FFTs. Of note here is that the sign of the distance function in 2D is expressed as a winding number computation. For the general eikonal problem, we present a perturbation series approach which results in a sequence of discrete convolutions once again efficiently computed using FFTs. We compare the results of our approach with those obtained using the fast sweeping method, closed-form solutions (when available) and Dijkstra’s shortest path algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Horn, B.: Robot Vision. MIT Press, Cambridge (1986)
Siddiqi, K., Tannenbaum, A., Zucker, S.: A Hamiltonian approach to the eikonal equation. In: Hancock, E.R., Pelillo, M. (eds.) EMMCVPR 1999. LNCS, vol. 1654, pp. 1–13. Springer, Heidelberg (1999)
Osher, S., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces. Springer, Heidelberg (2002)
Gilboa, G., Sochen, N., Zeevi, Y.: Image enhancement and denoising by complex diffusion processes. IEEE PAMI 26(8), 1020–1036 (2004)
Emms, D., Severini, S., Wilson, R., Hancock, E.: Coined quantum walks lift the cospectrality of graphs and trees. In: Rangarajan, A., Vemuri, B.C., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 332–345. Springer, Heidelberg (2005)
Goldstein, H., Poole, C., Safko, J.: Classical Mechanics. Addison-Wesley, Reading (2001)
Griffiths, D.: Introduction to Quantum Mechanics. Benjamin-Cummings (2004)
Yatziv, L., Bartesaghi, A., Sapiro, G.: O(N) implementation of the fast marching algorithm. Journal of Computational Physics 212(2), 393–399 (2006)
Zhao, H.: A fast sweeping method for eikonal equations. Mathematics of Computation, 603–627 (2005)
Gurumoorthy, K., Rangarajan, A.: A fast eikonal equation solver using the Schrödinger wave equation. Technical Report CVGMI-09-05, Center for Computer Vision, Graphics and Medical Imaging (CVGMI), University of Florida (2009)
Bracewell, R.: The Fourier Transform and its Applications. 3rd edn. McGraw-Hill Science and Engineering (1999)
Fernandez, F.: Introduction to Perturbation Theory in Quantum Mechanics. CRC Press, Boca Raton (2000)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Crandall, M., Ishii, H., Lions, P.: User’s guide to viscosity solutions of second order partial differential equations. Bulletin of the AMS 27(1), 1–67 (1992)
Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Government Printing Office, USA (1964)
Aberth, O.: Precise Numerical Methods Using C++. Academic Press, London (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rangarajan, A., Gurumoorthy, K.S. (2009). A Schrödinger Wave Equation Approach to the Eikonal Equation: Application to Image Analysis. In: Cremers, D., Boykov, Y., Blake, A., Schmidt, F.R. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2009. Lecture Notes in Computer Science, vol 5681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03641-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-03641-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03640-8
Online ISBN: 978-3-642-03641-5
eBook Packages: Computer ScienceComputer Science (R0)