{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:07:38Z","timestamp":1761646058913,"version":"3.41.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,17]],"date-time":"2017-02-17T00:00:00Z","timestamp":1487289600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s11263-017-0994-x","type":"journal-article","created":{"date-parts":[[2017,2,17]],"date-time":"2017-02-17T09:32:52Z","timestamp":1487323972000},"page":"415-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Directed Acyclic Graph Continuous Max-Flow Image Segmentation for Unconstrained Label Orderings"],"prefix":"10.1007","volume":"123","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3548-4343","authenticated-orcid":false,"given":"John S. H.","family":"Baxter","sequence":"first","affiliation":[]},{"given":"Martin","family":"Rajchl","sequence":"additional","affiliation":[]},{"given":"A. Jonathan","family":"McLeod","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Terry M.","family":"Peters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,17]]},"reference":[{"key":"994_CR1","doi-asserted-by":"crossref","unstructured":"Bae, E., Tai, X. C., & Yuan, J. (2015). Maximizing flows with message-passing: Computing spatially continuous min-cuts. In International workshop on energy minimization methods in computer vision and pattern recognition (pp. 15\u201328). Springer International Publishing.","DOI":"10.1007\/978-3-319-14612-6_2"},{"key":"994_CR2","doi-asserted-by":"crossref","unstructured":"Bae, E., Yuan, J., Tai, X. C., & Boykov, Y. (2014). A fast continuous max-flow approach to non-convex multi-labeling problems. In Efficient algorithms for global optimization methods in computer vision (pp. 134\u2013154). Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-54774-4_7"},{"key":"994_CR3","unstructured":"Baxter, J. S., Rajchl, M., Yuan, J., & Peters, T. M. (2014). A continuous max-flow approach to general hierarchical multi-labeling problems. arXiv preprint arXiv:1404.0336 ."},{"key":"994_CR4","unstructured":"Baxter, J. S., Yuan, J., Drangova, M., Peters, T. M., & Inoue, J. (2016). Shape complexes in continuous max-flow segmentation. In SPIE medical imaging (978434 pp.). International Society for Optics and Photonics."},{"key":"994_CR5","unstructured":"Bertsekas, D. P. (1999). Nonlinear programming (pp. 1\u201360). Belmont: Athena scientific."},{"issue":"1","key":"994_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(85)90035-6","volume":"12","author":"A Billionnet","year":"1985","unstructured":"Billionnet, A., & Minoux, M. (1985). Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discrete Applied Mathematics, 12(1), 1\u201311.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"994_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., & Hammer, P. L. (2002). Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1), 155\u2013225.","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"994_CR8","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26(9), 1124\u20131137.","journal-title":"Pattern Analysis and Machine Intelligence, IEEE Transactions on"},{"issue":"11","key":"994_CR9","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. (2001). Fast approximate energy minimization via graph cuts. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 23(11), 1222\u20131239.","journal-title":"Pattern Analysis and Machine Intelligence, IEEE Transactions on"},{"issue":"3","key":"994_CR10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y Censor","year":"1992","unstructured":"Censor, Y., & Zenios, S. A. (1992). Proximal minimization algorithm with d-functions. Journal of Optimization Theory and Applications, 73(3), 451\u2013464.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1\u20132","key":"994_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:JMIV.0000011325.36760.1e","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A. (2004). An algorithm for total variation minimization and applications. Journal of Mathematical imaging and vision, 20(1\u20132), 89\u201397.","journal-title":"Journal of Mathematical imaging and vision"},{"issue":"1","key":"994_CR12","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., & Pock, T. (2011). A first-order primal\u2013dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision, 40(1), 120\u2013145.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"3","key":"994_CR13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., & Teboulle, M. (1993). Convergence analysis of a proximal-like minimization algorithm using bregman functions. SIAM Journal on Optimization, 3(3), 538\u2013543.","journal-title":"SIAM Journal on Optimization"},{"key":"994_CR14","unstructured":"Cocosco, C. A., Kollokian, V., Kwan, R. K. S., Pike, G. B., & Evans, A. C. (1997). Brainweb: Online interface to a 3D MRI simulated brain database. In NeuroImage."},{"key":"994_CR15","doi-asserted-by":"crossref","unstructured":"Delage, E., Lee, H., & Ng, A. Y. (2006). A dynamic bayesian network model for autonomous 3d reconstruction from a single indoor image. In 2006 IEEE computer society conference on computer vision and pattern recognition (CVPR\u201906) (Vol.\u00a02, pp. 2418\u20132428). IEEE.","DOI":"10.1109\/CVPR.2006.23"},{"key":"994_CR16","doi-asserted-by":"crossref","unstructured":"Delong, A., & Boykov, Y. (2009). Globally optimal segmentation of multi-region objects. In International conference on computer vision (ICCV) (pp. 285\u2013292). IEEE.","DOI":"10.1109\/ICCV.2009.5459263"},{"issue":"1","key":"994_CR17","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s11263-012-0531-x","volume":"100","author":"A Delong","year":"2012","unstructured":"Delong, A., Gorelick, L., Veksler, O., & Boykov, Y. (2012). Minimizing energies with hierarchical costs. International journal of computer vision, 100(1), 38\u201358.","journal-title":"International journal of computer vision"},{"issue":"1","key":"994_CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jmri.21995","volume":"31","author":"C Denk","year":"2010","unstructured":"Denk, C., & Rauscher, A. (2010). Susceptibility weighted imaging with multiple echoes. Journal of Magnetic Resonance Imaging, 31(1), 185\u2013191.","journal-title":"Journal of Magnetic Resonance Imaging"},{"key":"994_CR19","doi-asserted-by":"crossref","unstructured":"Ekeland, I., & Temam, R. (1999). Convex analysis and variational problems.Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611971088"},{"key":"994_CR20","doi-asserted-by":"crossref","unstructured":"Giusti, E. (1984). Minimal surfaces and functions of bounded variation. Springer.","DOI":"10.1007\/978-1-4684-9486-0"},{"key":"994_CR21","doi-asserted-by":"crossref","unstructured":"Gulshan, V., Rother, C., Criminisi, A., Blake, A., & Zisserman, A. (2010). Geodesic star convexity for interactive image segmentation. In IEEE conference on computer vision and pattern recognition (CVPR) (pp. 3129\u20133136). IEEE.","DOI":"10.1109\/CVPR.2010.5540073"},{"issue":"1","key":"994_CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.media.2015.04.001","volume":"23","author":"F Guo","year":"2015","unstructured":"Guo, F., Yuan, J., Rajchl, M., Svenningsen, S., Capaldi, D. P., Sheikh, K., et al. (2015). Globally optimal co-segmentation of three-dimensional pulmonary 1 h and hyperpolarized 3 he mri with spatial consistence prior. Medical Image Analysis, 23(1), 43\u201355.","journal-title":"Medical Image Analysis"},{"issue":"3","key":"994_CR23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1002\/mrm.20198","volume":"52","author":"EM Haacke","year":"2004","unstructured":"Haacke, E. M., Xu, Y., Cheng, Y. C. N., & Reichenbach, J. R. (2004). Susceptibility weighted imaging (swi). Magnetic Resonance in Medicine, 52(3), 612\u2013618.","journal-title":"Magnetic Resonance in Medicine"},{"issue":"1","key":"994_CR24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s11263-006-0031-y","volume":"75","author":"D Hoiem","year":"2007","unstructured":"Hoiem, D., Efros, A. A., & Hebert, M. (2007). Recovering surface layout from an image. International Journal of Computer Vision, 75(1), 151\u2013172.","journal-title":"International Journal of Computer Vision"},{"key":"994_CR25","unstructured":"Hong, M., & Luo, Z. Q. (2012). On the linear convergence of the alternating direction method of multipliers. arXiv preprint arXiv:1208.3922 ."},{"issue":"10","key":"994_CR26","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H Ishikawa","year":"2003","unstructured":"Ishikawa, H. (2003). Exact optimization for markov random fields with convex priors. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 25(10), 1333\u20131336.","journal-title":"Pattern Analysis and Machine Intelligence, IEEE Transactions on"},{"issue":"3","key":"994_CR27","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"PL Iv\u0103nescu","year":"1965","unstructured":"Iv\u0103nescu, P. L. (1965). Some network flow problems solved with pseudo-boolean programming. Operations Research, 13(3), 388\u2013399.","journal-title":"Operations Research"},{"key":"994_CR28","doi-asserted-by":"crossref","unstructured":"Jang, J., Kim, H. W., & Kim, Y. S. (2014). Co-segmentation of inter-subject brain magnetic resonance images. In IEEE international conference on ubiquitous robots and ambient intelligence (URAI) (pp. 80\u201384). IEEE.","DOI":"10.1109\/URAI.2014.7057400"},{"key":"994_CR29","doi-asserted-by":"crossref","unstructured":"Koch, L. M., Rajchl, M., Tong, T., Passerat-Palmbach, J., Aljabar, P., & Rueckert, D. (2015). Multi-atlas segmentation as a graph labelling problem: Application to partially annotated atlas data. In Information processing in medical imaging (pp. 221\u2013232). Springer.","DOI":"10.1007\/978-3-319-19992-4_17"},{"issue":"2","key":"994_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., & Zabin, R. (2004). What energy functions can be minimized via graph cuts? Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26(2), 147\u2013159.","journal-title":"Pattern Analysis and Machine Intelligence, IEEE Transactions on"},{"key":"994_CR31","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Cremers, D., & Bischof, H. (2009). A convex relaxation approach for computing minimal partitions. In IEEE conference on computer vision and pattern recognition (CVPR) (pp. 810\u2013817). IEEE.","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"994_CR32","doi-asserted-by":"crossref","unstructured":"Potts, R. B. (1952). Some generalized order-disorder transformations. In Mathematical proceedings of the Cambridge Philosophical Society (Vol.\u00a048, pp. 106\u2013109). Cambridge Univ Press.","DOI":"10.1017\/S0305004100027419"},{"key":"994_CR33","doi-asserted-by":"crossref","unstructured":"Rajchl, M., Baxter, J. S., McLeod, A. J., Yuan, J., Qiu, W., Peters, T. M., & Khan, A. R. (2016). Hierarchical max-flow segmentation framework for multi-atlas segmentation with Kohonen self-organizing map based Gaussian mixture modeling. Medical Image Analysis, 27, 45\u201356.","DOI":"10.1016\/j.media.2015.05.005"},{"issue":"1","key":"994_CR34","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1109\/TMI.2013.2282932","volume":"33","author":"M Rajchl","year":"2014","unstructured":"Rajchl, M., Yuan, J., White, J., Ukwatta, E., Stirrat, J., Nambakhsh, C., et al. (2014). Interactive hierarchical-flow segmentation of scar tissue from late-enhancement cardiac mr images. Medical Imaging, IEEE Transactions on, 33(1), 159\u2013172.","journal-title":"Medical Imaging, IEEE Transactions on"},{"issue":"5","key":"994_CR35","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R. T. (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14(5), 877\u2013898.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"994_CR36","unstructured":"Schlesinger, D., & Flach, B. (2006). Transforming an arbitrary minsum problem into a binary one. TU: Fak. Informatik."},{"issue":"3","key":"994_CR37","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.optlaseng.2003.11.002","volume":"42","author":"X Su","year":"2004","unstructured":"Su, X., & Chen, W. (2004). Reliability-guided phase unwrapping algorithm: A review. Optics and Lasers in Engineering, 42(3), 245\u2013261.","journal-title":"Optics and Lasers in Engineering"},{"issue":"2","key":"994_CR38","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00234-007-0316-z","volume":"50","author":"B Thomas","year":"2008","unstructured":"Thomas, B., Somasundaram, S., Thamburaj, K., Kesavadas, C., Gupta, A. K., Bodhey, N. K., et al. (2008). Clinical applications of susceptibility weighted mr imaging of the brain-a pictorial review. Neuroradiology, 50(2), 105\u2013116.","journal-title":"Neuroradiology"},{"issue":"4","key":"994_CR39","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1016\/j.neuroimage.2008.07.058","volume":"43","author":"F Lijn van der","year":"2008","unstructured":"van der Lijn, F., den Heijer, T., Breteler, M. M., & Niessen, W. J. (2008). Hippocampus segmentation in mr images using atlas registration, voxel classification, and graph cuts. Neuroimage, 43(4), 708\u2013720.","journal-title":"Neuroimage"},{"key":"994_CR40","doi-asserted-by":"crossref","unstructured":"Veksler, O. (2008). Star shape prior for graph-cut image segmentation. In Computer vision\u2014ECCV 2008 (pp. 454\u2013467). Springer.","DOI":"10.1007\/978-3-540-88690-7_34"},{"key":"994_CR41","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., & Tai, X. C. (2010). A study on continuous max-flow and min-cut approaches. In IEEE conference on computer vision and pattern recognition (CVPR) (pp. 2217\u20132224). IEEE.","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"994_CR42","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X. C., & Boykov, Y. (2010). A continuous max-flow approach to Potts model. In Computer vision\u2014ECCV 2010 (pp. 379\u2013392). Springer.","DOI":"10.1007\/978-3-642-15567-3_28"},{"key":"994_CR43","first-page":"82","volume":"7512","author":"J Yuan","year":"2012","unstructured":"Yuan, J., Qiu, W., Ukwatta, E., Rajchl, M., Sun, Y., & Fenster, A. (2012). An efficient convex optimization approach to 3D prostate MRI segmentation with generic star shape prior. Prostate MR Image Segmentation Challenge, MICCAI, 7512, 82\u201389.","journal-title":"Prostate MR Image Segmentation Challenge, MICCAI"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-017-0994-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-017-0994-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-017-0994-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T13:01:00Z","timestamp":1749992460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-017-0994-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,17]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["994"],"URL":"https:\/\/doi.org\/10.1007\/s11263-017-0994-x","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"type":"print","value":"0920-5691"},{"type":"electronic","value":"1573-1405"}],"subject":[],"published":{"date-parts":[[2017,2,17]]}}}