Abstract
Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal results efficiently and the convenience of usage are some of the factors of this popularity. However, there are a few issues with graph cuts, such as inherent sequential nature of popular algorithms and the memory bloat in large scale problems. In this paper, we introduce a novel method for the approximation of the graph cut optimization by posing the problem as a gradient descent formulation. The advantages of our method is the ability to work efficiently on large problems and the possibility of convenient implementation on parallel architectures such as inexpensive Graphics Processing Units (GPUs). We have implemented the proposed method on the Nvidia 8800GTS GPU. The classical segmentation experiments on static images and video data showed the effectiveness of our method.
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
Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI 26(9) (September 2004)
GoldBerg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. JACM 1988 (1988)
Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: ICCV 2005 (2005)
Juan, O., Boykov, Y.: Active Graph Cuts. In: CVPR 2006, pp. 1023–1029 (2006)
Kohli, P., Torr, P.H.S.: Dynamic graph cuts for efficient inference in markov random fields. PAMI 2007 (2007)
Dixit, N., Keriven, R., Paragios, N.: GPU-Cuts: Combinatorial optimisation, graphic processing units and adaptive object extraction. Research Report 05-07, CERTIS (March 2005)
Vineet, V., Narayanan, P.J.: CUDA Cuts: Fast graphs cuts on the gpu. Technical Report, International Institute of Information Technology, Hyderabd
Bhusnurmath, A., Taylor, C.J.: Solving the graph cut problem via l1-norm minimization. Technical Reports, CIS (2007)
Ford, Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics (1956)
Nvidia Geforce Family GPUs, http://www.nvidia.com/object/geforce_family.html
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
Yildiz, A., Akgul, Y.S. (2009). A Gradient Descent Approximation for Graph Cuts. In: Denzler, J., Notni, G., Süße, H. (eds) Pattern Recognition. DAGM 2009. Lecture Notes in Computer Science, vol 5748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03798-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-03798-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03797-9
Online ISBN: 978-3-642-03798-6
eBook Packages: Computer ScienceComputer Science (R0)