{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:17:45Z","timestamp":1729660665900,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/cvpr.2015.7298645","type":"proceedings-article","created":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T18:42:06Z","timestamp":1444934526000},"page":"475-483","source":"Crossref","is-referenced-by-count":0,"title":["Graph-based simplex method for pairwise energy minimization with binary variables"],"prefix":"10.1109","author":[{"given":"Daniel","family":"Prusa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/CVPR.2007.383293"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ICCV.2011.6126429"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TPAMI.2014.2353626"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/CVPR.2007.383203"},{"key":"ref14","first-page":"6","article-title":"Transforming an arbitrary Min-Sum problem into a binary one. Technical Report TUD-FI","author":"schlesinger","year":"2006"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.5244\/C.26.61"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Foundations and Trends in Machine Learning"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TPAMI.2007.1036"},{"year":"0","author":"kolmogorov","key":"ref18"},{"year":"0","key":"ref19"},{"key":"ref4","article-title":"Linear Programming","volume":"1","author":"dantzig","year":"1997"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/34.969114"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TPAMI.2003.1233908"},{"key":"ref5","first-page":"353","article-title":"A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time. Mathematical Programming","volume":"47","author":"goldfarb","year":"1990"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TPAMI.2007.1031"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TPAMI.2006.200"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TPAMI.2004.60"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/S0166-218X(01)00341-9"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/S0167-6377(98)00043-1"},{"year":"0","author":"verma","journal-title":"MaxFlow Revisited","key":"ref20"}],"event":{"name":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)","start":{"date-parts":[[2015,6,7]]},"location":"Boston, MA, USA","end":{"date-parts":[[2015,6,12]]}},"container-title":["2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7293313\/7298593\/07298645.pdf?arnumber=7298645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T17:24:28Z","timestamp":1498238668000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7298645\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cvpr.2015.7298645","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}