{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:46Z","timestamp":1740099166952,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030052874"},{"type":"electronic","value":"9783030052881"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-05288-1_9","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T23:35:18Z","timestamp":1542756918000},"page":"112-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["When Can $$l_p$$-norm Objective Functions Be Minimized via Graph Cuts?"],"prefix":"10.1007","author":[{"given":"Filip","family":"Malmberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Strand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"issue":"10","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1016\/j.imavis.2009.06.017","volume":"28","author":"C All\u00e8ne","year":"2010","unstructured":"All\u00e8ne, C., Audibert, J.Y., Couprie, M., Keriven, R.: Some links between extremum spanning forests, watersheds and min-cuts. Image Vis. Comput. 28(10), 1460\u20131471 (2010)","journal-title":"Image Vis. Comput."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11263-006-7934-5","volume":"70","author":"Y Boykov","year":"2006","unstructured":"Boykov, Y., Funka-Lea, G.: Graph cuts and efficient ND image segmentation. Int. J. Comput. Vis. 70(2), 109\u2013131 (2006)","journal-title":"Int. J. Comput. Vis."},{"issue":"11","key":"9_CR3","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. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/TPAMI.2010.200","volume":"33","author":"C Couprie","year":"2011","unstructured":"Couprie, C., Grady, L., Najman, L., Talbot, H.: Power watershed: a unifying graph-based optimization framework. IEEE Trans. Pattern Anal. Mach. Intell. 33(7), 1384\u20131399 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., Rother, C.: Minimizing nonsubmodular functions with graph cuts-a review. IEEE Trans. Pattern Anal. Mach. Intell. 29(7), 1274\u20131279 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/2661229.2661258","volume":"33","author":"Z Levi","year":"2014","unstructured":"Levi, Z., Zorin, D.: Strict minimizers for geometric optimization. ACM Trans. Graph. (TOG) 33(6), 185 (2014)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10851-009-0159-9","volume":"35","author":"PA Miranda","year":"2009","unstructured":"Miranda, P.A., Falc\u00e3o, A.X.: Links between image segmentation based on optimum-path forest and minimum cut in graph. J. Math. Imaging Vis. 35(2), 128\u2013142 (2009)","journal-title":"J. Math. Imaging Vis."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05288-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T23:38:02Z","timestamp":1542757082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05288-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030052874","9783030052881"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05288-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"IWCIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Image Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/iwcia18\/general","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}