Abstract
Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed distance function, and evolved according to a motion equation in order to minimize a cost function. This function defines the objective of the segmentation problem and also includes regularization constraints. Gradient descent search is the de facto method used to solve this optimization problem. Basic gradient descent methods, however, are sensitive for local optima and often display slow convergence. Traditionally, the cost functions have been modified to avoid these problems. In this work, we instead propose using a modified gradient descent search based on resilient propagation (Rprop), a method commonly used in the machine learning community. Our results show faster convergence and less sensitivity to local optima, compared to traditional gradient descent.
Chapter PDF
References
Charpiat, G., Keriven, R., Pons, J.P., Faugeras, O.: Designing spatially coherent minimizing flows for variational problems based on active contours. In: Tenth IEEE International Conference on Computer Vision, ICCV 2005, October 2005, vol. 2, pp. 1403–1408 (2005)
Sundaramoorthi, G., Yezzi, A., Mennucci, A.: Sobolev active contours. International Journal of Computer Vision 73(3), 345–366 (2007)
Riedmiller, M., Braun, H.: A direct adaptive method for faster backpropagation learning: The rprop algorithm. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 586–591 (1993)
Riedmiller, M., Braun, H.: Rprop – description and implementation details. Technical report, Universitat Karlsruhe (1994)
Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Heidelberg (2006)
Schiffmann, W., Joost, M., Werner, R.: Comparison of optimized backpropagation algorithms. In: Proc. of ESANN 1993, Brussels, pp. 97–104 (1993)
Kimmel, R.: Fast edge integration. In: Geometric Level Set Methods in Imaging, Vision and Graphics. Springer, Heidelberg (2003)
Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics 79, 12–49 (1988)
Osher, S., Fedkiw, R.: Level Set and Dynamic Implicit Surfaces. Springer, New York (2003)
Peng, D., Merriman, B., Osher, S., Zhao, H.K., Kang, M.: A pde-based fast local level set method. Journal of Computational Physics 155(2), 410–438 (1999)
Sethian, J.: A fast marching level set method for monotonically advancing fronts. Proceedings of the National Academy of Science 93, 1591–1595 (1996)
Zhao, H.K.: A fast sweeping method for eikonal equations. Mathematics of Computation (74), 603–627 (2005)
Läthén, G., Jonasson, J., Borga, M.: Phase based level set segmentation of blood vessels. In: Proceedings of 19th International Conference on Pattern Recognition, IAPR, Tampa, FL, USA (December 2008)
Granlund, G.H., Knutsson, H.: Signal Processing for Computer Vision. Kluwer Academic Publishers, Netherlands (1995)
Staal, J., Abramoff, M., Niemeijer, M., Viergever, M., van Ginneken, B.: Ridge based vessel segmentation in color images of the retina. IEEE Transactions on Medical Imaging 23(4), 501–509 (2004)
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
Andersson, T., Läthén, G., Lenz, R., Borga, M. (2009). A Fast Optimization Method for Level Set Segmentation. In: Salberg, AB., Hardeberg, J.Y., Jenssen, R. (eds) Image Analysis. SCIA 2009. Lecture Notes in Computer Science, vol 5575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02230-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-02230-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02229-6
Online ISBN: 978-3-642-02230-2
eBook Packages: Computer ScienceComputer Science (R0)