{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T01:19:40Z","timestamp":1770513580364,"version":"3.49.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319464749","type":"print"},{"value":"9783319464756","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46475-6_50","type":"book-chapter","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T08:48:10Z","timestamp":1474015690000},"page":"818-833","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Continuous Relaxations for Dense CRF"],"prefix":"10.1007","author":[{"given":"Alban","family":"Desmaison","sequence":"first","affiliation":[]},{"given":"Rudy","family":"Bunel","sequence":"additional","affiliation":[]},{"given":"Pushmeet","family":"Kohli","sequence":"additional","affiliation":[]},{"given":"Philip H. S.","family":"Torr","sequence":"additional","affiliation":[]},{"given":"M. Pawan","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Ravikumar, P., Lafferty, J.: Quadratic programming relaxations for metric labeling and Markov random field MAP estimation. In: ICML (2006)","DOI":"10.1145\/1143844.1143937"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1145\/585265.585268","volume":"49","author":"J Kleinberg","year":"2002","unstructured":"Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. JACM 49, 616\u2013639 (2002)","journal-title":"JACM"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Kumar, P., Kolmogorov, V., Torr, P.: An analysis of convex relaxations for MAP estimation. In: NIPS (2008)","DOI":"10.1145\/1390156.1390242"},{"key":"50_CR4","unstructured":"Chekuri, C., Khanna, S., Naor, J., Zosin, L.: Approximation algorithms for the metric labeling problem via a new linear programming formulation. In: SODA (2001)"},{"key":"50_CR5","unstructured":"Kr\u00e4henb\u00fchl, P., Koltun, V.: Efficient inference in fully connected CRFs with Gaussian edge potentials. In: NIPS (2011)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Tappen, M., Liu, C., Adelson, E., Freeman, W.: Learning Gaussian conditional random fields for low-level vision. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.382979"},{"key":"50_CR7","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Adams, A., Baek, J., Abraham, M.: Fast high-dimensional filtering using the permutohedral lattice. In: Eurographics (2010)","DOI":"10.1111\/j.1467-8659.2009.01645.x"},{"key":"50_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Log. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Log. Q."},{"key":"50_CR10","unstructured":"Kr\u00e4henb\u00fchl, P., Koltun, V.: Parameter learning and convergent inference for dense random fields. In: ICML (2013)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Baqu\u00e9, P., Bagautdinov, T., Fleuret, F., Fua, P.: Principled parallel mean-field inference for discrete random fields. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.630"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s11263-014-0708-6","volume":"110","author":"V Vineet","year":"2014","unstructured":"Vineet, V., Warrell, J., Torr, P.: Filter-based mean-field inference for random fields with higher-order terms and product label-spaces. IJCV 110, 290\u2013307 (2014)","journal-title":"IJCV"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-15555-0_18","volume-title":"Computer Vision \u2013 ECCV 2010","author":"L Ladicky","year":"2010","unstructured":"Ladicky, L., Russell, C., Kohli, P., Torr, P.H.S.: Graph cut based inference with co-occurrence statistics. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 239\u2013253. Springer, Heidelberg (2010)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Kohli, P., Kumar, P., Torr, P.: P3 & beyond: solving energies with higher order cliques. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383204"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Long, J., Shelhamer, E., Darrell, T.: Fully convolutional networks for semantic segmentation. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298965"},{"key":"50_CR16","unstructured":"Chen, L., Papandreou, G., Kokkinos, I., Murphy, K., Yuille, A.: Semantic image segmentation with deep convolutional nets and fully connected CRFs. In: ICLR (2015)"},{"key":"50_CR17","unstructured":"Schwing, A., Urtasun, R.: Fully connected deep structured networks. CoRR (2015)"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Zheng, S., Jayasumana, S., Romera-Paredes, B., Vineet, V., Su, Z., Du, D., Huang, C., Torr, P.: Conditional random fields as recurrent neural networks. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.179"},{"key":"50_CR19","unstructured":"Zhang, Y., Chen, T.: Efficient inference for fully-connected CRFs with stationarity. In: CVPR (2012)"},{"key":"50_CR20","unstructured":"Wang, P., Shen, C., van den Hengel, A.: Efficient SDP inference for fully-connected CRFs based on low-rank decomposition. In: CVPR (2015)"},{"key":"50_CR21","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM 42, 1115\u20131145 (1995)","journal-title":"JACM"},{"key":"50_CR22","unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., Pletscher, P.: Block-coordinate Frank-Wolfe optimization for structural SVMs. In: ICML (2013)"},{"key":"50_CR23","unstructured":"Yuille, A., Rangarajan, A.: The concave-convex procedure (CCCP). In: NIPS (2002)"},{"key":"50_CR24","unstructured":"Sriperumbudur, B., Lanckriet, G.: On the convergence of the concave-convex procedure. In: NIPS (2009)"},{"key":"50_CR25","unstructured":"Kumar, P., Koller, D.: MAP estimation of semi-metric MRFs via hierarchical graph cuts. In: UAI (2009)"},{"key":"50_CR26","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2015","unstructured":"Condat, L.: Fast projection onto the simplex and the $$l_1$$ ball. Math. Program. 158, 575\u2013585 (2015)","journal-title":"Math. Program."},{"key":"50_CR27","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D Scharstein","year":"2002","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV 47, 7\u201342 (2002)","journal-title":"IJCV"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"Everingham, M., Van Gool, L., Williams, C., Winn, J., Zisserman, A.: The PASCAL visual object classes challenge. In: VOC 2010 Results (2010)","DOI":"10.1007\/s11263-009-0275-4"},{"key":"50_CR29","unstructured":"Snoek, J., Larochelle, H., Adams, R.: Practical bayesian optimization of machine learning algorithms. In: NIPS (2012)"},{"key":"50_CR30","doi-asserted-by":"publisher","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. PAMI 23, 1222\u20131239 (2001)","journal-title":"PAMI"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46475-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,10]],"date-time":"2020-10-10T01:11:42Z","timestamp":1602292302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46475-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319464749","9783319464756"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46475-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"17 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.eccv2016.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}