{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:38Z","timestamp":1725555278291},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122965"},{"type":"electronic","value":"9783642122972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12297-2_61","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T04:13:24Z","timestamp":1273032804000},"page":"633-643","source":"Crossref","is-referenced-by-count":4,"title":["Solving Multilabel MRFs Using Incremental \u03b1-Expansion on the GPUs"],"prefix":"10.1007","author":[{"given":"Vibhav","family":"Vineet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. J.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alahari, K., Kohli, P., Torr, P.H.: Reduce, Reuse & Recycle: Efficiently Solving Multi-Label MRFs. In: CVPR (2), pp. 16\u201329 (2008)","key":"61_CR1","DOI":"10.1109\/CVPR.2008.4587402"},{"doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G., Paragios, N.: Fast, Approximately Optimal Solutions for Single and Dynamic MRFs. In: CVPR (2), pp. 1\u20138 (2007)","key":"61_CR2","DOI":"10.1109\/CVPR.2007.383095"},{"issue":"11","key":"61_CR3","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. TPAMI\u00a023(11), 1222\u20131239 (2001)","journal-title":"TPAMI"},{"issue":"12","key":"61_CR4","doi-asserted-by":"crossref","first-page":"2079","DOI":"10.1109\/TPAMI.2007.1128","volume":"29","author":"P. Kohli","year":"2007","unstructured":"Kohli, P., Torr, P.H.S.: Dynamic graph cuts for efficient inference in markov random fields. TPAMI\u00a029(12), 2079\u20132088 (2007)","journal-title":"TPAMI"},{"doi-asserted-by":"crossref","unstructured":"Alizadeh, F., Goldberg, A.: Implementing the push-relabel method for the maximum flow problem on a connection machine. Technical Report STAN-CS-92-1410, Stanford University (1992)","key":"61_CR5","DOI":"10.21236\/ADA323468"},{"doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Setubal, J.C.: On the parallel implementation of goldberg\u2019s maximum flow algorithm. In: SPAA, pp. 168\u2013177 (1992)","key":"61_CR6","DOI":"10.1145\/140901.140919"},{"issue":"4","key":"61_CR7","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"unstructured":"Hussein, M., Varshney, A., Davis, L.: On implementing graph cuts on cuda. In: First Workshop on General Purpose Processing on Graphics Processing Units, October 2007, Northeastern University (2007)","key":"61_CR8"},{"doi-asserted-by":"crossref","unstructured":"Juan, O., Boykov, Y.: Active graph cuts. In: CVPR (1), pp. 1023\u20131029 (2006)","key":"61_CR9","DOI":"10.1109\/CVPR.2006.47"},{"issue":"2","key":"61_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? TPAMI\u00a026(2), 147\u2013159 (2004)","journal-title":"TPAMI"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11744047_2","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M.F., Rother, C.: A comparative study of energy minimization methods for markov random fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 16\u201329. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent Tree-Reweighted Message Passing for Energy Minimization. TPAMI, 1568\u20131583 (2006)","key":"61_CR12","DOI":"10.1109\/TPAMI.2006.200"},{"doi-asserted-by":"crossref","unstructured":"Vineet, V., Narayanan, P.J.: CUDA cuts: Fast graph cuts on the GPU. In: IEEE CVPR workshop on Visual Computer Vision on GPUs, pp. 1\u20138 (2008)","key":"61_CR13","DOI":"10.1109\/CVPRW.2008.4563095"},{"unstructured":"Middlebury MRF Page (2009), http:\/\/vision.middlebury.edu\/MRF\/","key":"61_CR14"},{"doi-asserted-by":"crossref","unstructured":"Liang, C., Cheng, C., Lai, Y., Chen, L., Chen, H.: Hardware-Efficient Belief Propagation. In: CVPR (2009)","key":"61_CR15","DOI":"10.1109\/CVPR.2009.5206819"},{"doi-asserted-by":"crossref","unstructured":"Kovtun, I.: Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems. In: DAGM-Symposium (2003)","key":"61_CR16","DOI":"10.1007\/978-3-540-45243-0_52"},{"doi-asserted-by":"crossref","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions and the Bayesian restoration of image. TPAMI (1984)","key":"61_CR17","DOI":"10.1109\/TPAMI.1984.4767596"},{"doi-asserted-by":"crossref","unstructured":"Delong, A., Boykov, Y.: A Scalable graph-cut algorithm for N-D grids. In: CVPR (2009)","key":"61_CR18","DOI":"10.1109\/CVPR.2008.4587464"},{"unstructured":"Corporation, N.: CUDA: Compute unified device architecture programming guide. Technical report, Nvidia (2007)","key":"61_CR19"},{"doi-asserted-by":"crossref","unstructured":"Freeman, W.T., Pasztor, E.C.: Learning Low-Level Vision. In: IEEE International Conference on Computer Vision (1999)","key":"61_CR20","DOI":"10.1109\/ICCV.1999.790414"},{"key":"61_CR21","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.N.: An O(n logn) algorithm for maximum st-flow in a directed planar graph. In: Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms (2006)","key":"61_CR22","DOI":"10.1145\/1109557.1109615"},{"doi-asserted-by":"crossref","unstructured":"Schmidt, F.R., T\u00f6ppe, E., Cremers, D.: Efficient Planar Graph Cuts with Applications in Computer Vision. In: CVPR (2009)","key":"61_CR23","DOI":"10.1109\/CVPR.2009.5206863"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12297-2_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:50Z","timestamp":1606186370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12297-2_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122965","9783642122972"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12297-2_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}