乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:16:18Z","timestamp":1725887778833},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587707"},{"type":"electronic","value":"9783319587714"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58771-4_42","type":"book-chapter","created":{"date-parts":[[2017,5,17]],"date-time":"2017-05-17T01:13:41Z","timestamp":1494983621000},"page":"524-534","source":"Crossref","is-referenced-by-count":1,"title":["Bregman-Proximal Augmented Lagrangian Approach to Multiphase Image Segmentation"],"prefix":"10.1007","author":[{"given":"Jing","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Ke","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Yi-Guang","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Xiang-Chu","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Xue-Cheng","family":"Tai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,18]]},"reference":[{"key":"42_CR1","unstructured":"Bae, E., Yuan, J., Tai, X.C.: Global minimization for continuous multiphase partitioning problems using a dual approach. Technical report CAM09-75, UCLA, CAM, September 2009"},{"key":"42_CR2","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with bregman divergences. J. Mach. Learn. Res. 6, 1705\u20131749 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"42_CR3","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV 2003, pp. 26\u201333 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"key":"42_CR5","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. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"42_CR7","volume-title":"Parallel Optimization: Theory, Algorithms and Applications","author":"YA Censor","year":"1997","unstructured":"Censor, Y.A., Zenios, S.A.: Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, Oxford (1997)"},{"key":"42_CR8","unstructured":"Chambolle, A., Cremers, D., Pock, T.: A convex approach for computing minimal partitions. Technical report TR-2008-05, Department of Computer Science, University of Bonn, Bonn, Germany, November 2008"},{"issue":"4","key":"42_CR9","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/moor.19.4.790","volume":"19","author":"AN Iusem","year":"1994","unstructured":"Iusem, A.N., Svaiter, B.F., Teboulle, M.: Entropy-like proximal methods in convex programming. Math. Oper. Res. 19(4), 790\u2013814 (1994)","journal-title":"Math. Oper. Res."},{"issue":"9","key":"42_CR10","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1109\/TPAMI.2008.217","volume":"31","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Kumar, M.P., Torr, P.H.S.: $$p^3$$ and beyond: move making algorithms for solving higher order functions. IEEE Trans. Pattern Anal. Mach. Intell. 31(9), 1645\u20131656 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: What metrics can be approximated by geo-cuts, or global optimization of length\/area and flux. In: ICCV, pp. 564\u2013571 (2005)","DOI":"10.1109\/ICCV.2005.252"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-47977-5_6","volume-title":"Computer Vision \u2014 ECCV 2002","author":"V Kolmogorov","year":"2002","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 82\u201396. Springer, Heidelberg (2002). doi: 10.1007\/3-540-47977-5_6"},{"key":"42_CR13","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1109\/TPAMI.2007.1061","volume":"29","author":"N Komodakis","year":"2007","unstructured":"Komodakis, N., Tziritas, G.: Approximate labeling via graph-cuts based on linear programming. Pattern Anal. Mach. Intell. 29, 1436\u20131453 (2007)","journal-title":"Pattern Anal. Mach. Intell."},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Becker, F., Schn\u00f6rr, C.: Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In: ICCV, pp. 646\u2013653 (2009)","DOI":"10.1109\/ICCV.2009.5459176"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schn\u00f6rr, C.: Convex multi-class image labeling by simplex-constrained total variation. Technical report, HCI, IWR, University Heidelberg, IWR, University Heidelberg, November 2008","DOI":"10.1007\/978-3-642-02256-2_13"},{"key":"42_CR16","volume-title":"Markov Random Field Modeling in Image Analysis","author":"SZ Li","year":"2001","unstructured":"Li, S.Z.: Markov Random Field Modeling in Image Analysis. Springer-Verlag New York, Inc., Secaucus (2001)"},{"issue":"5","key":"42_CR17","doi-asserted-by":"crossref","first-page":"1632","DOI":"10.1137\/040615286","volume":"66","author":"M Nikolova","year":"2006","unstructured":"Nikolova, M., Esedoglu, S., Chan, T.F.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. App. Math. 66(5), 1632\u20131648 (2006)","journal-title":"SIAM J. App. Math."},{"key":"42_CR18","volume-title":"Handbook of Mathematical Models in Computer Vision","author":"N Paragios","year":"2005","unstructured":"Paragios, N., Chen, Y., Faugeras, O.: Handbook of Mathematical Models in Computer Vision. Springer-Verlag New York, Inc., Secaucus (2005)"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approachfor computing minimal partitions. In: CVPR, Miami, Florida (2009)","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"42_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-540-88690-7_59","volume-title":"Computer Vision \u2013 ECCV 2008","author":"T Pock","year":"2008","unstructured":"Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5304, pp. 792\u2013805. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88690-7_59"},{"key":"42_CR21","series-title":"Princeton Mathematical Series","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series, vol. 28. Princeton University Press, Princeton (1970)"},{"issue":"3","key":"42_CR22","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M Teboulle","year":"1992","unstructured":"Teboulle, M.: Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res. 17(3), 670\u2013690 (1992)","journal-title":"Math. Oper. Res."},{"key":"42_CR23","doi-asserted-by":"crossref","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M Wainwright","year":"2002","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on (hyper)trees: message-passing and linear programming approaches. IEEE Trans. Inf. Theory 51, 3697\u20133717 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.C.: A study on continuous max-flow and min-cut approaches. In: CVPR, San Francisco, USA (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"42_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-15567-3_28","volume-title":"Computer Vision \u2013 ECCV 2010","author":"J Yuan","year":"2010","unstructured":"Yuan, J., Bae, E., Tai, X.-C., Boykov, Y.: A continuous max-flow approach to potts model. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6316, pp. 379\u2013392. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15567-3_28"},{"issue":"3","key":"42_CR26","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s00211-013-0569-x","volume":"126","author":"J Yuan","year":"2014","unstructured":"Yuan, J., Bae, E., Tai, X.-C., Boykov, Y.: A spatially continuous max-flow and min-cut framework for binary labeling problems. Numerische Mathematik 126(3), 559\u2013587 (2014)","journal-title":"Numerische Mathematik"},{"key":"42_CR27","unstructured":"Zach, C., Gallup, D., Frahm, J.-M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Vision, Modeling and Visualization Workshop (VMV) (2008)"}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58771-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T18:56:12Z","timestamp":1569351372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58771-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587707","9783319587714"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58771-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}