{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T22:51:10Z","timestamp":1752101470339,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030208691"},{"type":"electronic","value":"9783030208707"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20870-7_5","type":"book-chapter","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T16:14:21Z","timestamp":1558714461000},"page":"74-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving Minimum Cost Lifted Multicut Problems by Node Agglomeration"],"prefix":"10.1007","author":[{"given":"Amirhossein","family":"Kardoost","sequence":"first","affiliation":[]},{"given":"Margret","family":"Keuper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,25]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Keuper, M., Levinkov, E., Bonneel, N., Lavou\u00e9, G., Brox, T., Andres, B.: Efficient decomposition of image and mesh graphs by lifted multicuts. In: 2015 IEEE International Conference on Computer Vision (ICCV). pp. 1751\u20131759 (2015)","DOI":"10.1109\/ICCV.2015.204"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Tang, S., Andriluka, M., Andres, B., Schiele, B.: Multi people tracking with lifted multicut and person re-identification. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (2017)","DOI":"10.1109\/CVPR.2017.394"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Keuper, M.: Higher-order minimum cost lifted multicuts for motion segmentation. In: The IEEE International Conference on Computer Vision (ICCV) (2017)","DOI":"10.1109\/ICCV.2017.455"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-319-46475-6_44","volume-title":"Computer Vision \u2013 ECCV 2016","author":"T Beier","year":"2016","unstructured":"Beier, T., Andres, B., K\u00f6the, U., Hamprecht, F.A.: An efficient fusion move algorithm for the minimum cost lifted multicut problem. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9906, pp. 715\u2013730. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46475-6_44"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1038\/nmeth.4151","volume":"14","author":"T Beier","year":"2017","unstructured":"Beier, T., et al.: Multicut brings automated neurite segmentation closer to human performance. Nat. Methods 14, 101 (2017)","journal-title":"Nat. Methods"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S Chopra","year":"1993","unstructured":"Chopra, S., Rao, M.: The partition problem. Math. Programm. 59, 87\u2013115 (1993)","journal-title":"Math. Programm."},{"key":"5_CR7","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"MM Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. AC, vol. 15. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-04295-9"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TPAMI.2010.161","volume":"33","author":"P Arbelaez","year":"2011","unstructured":"Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. IEEE TPAMI 33(5), 898\u2013916 (2011)","journal-title":"IEEE TPAMI"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1109\/TPAMI.2011.280","volume":"34","author":"A Alush","year":"2012","unstructured":"Alush, A., Goldberger, J.: Ensemble segmentation using efficient integer linear programming. TPAMI 34, 1966\u20131977 (2012)","journal-title":"TPAMI"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Andres, B., Kappes, J.H., Beier, T., K\u00f6the, U., Hamprecht, F.A.: Probabilistic image segmentation with closedness constraints. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126550"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/978-3-642-33712-3_56","volume-title":"Computer Vision \u2013 ECCV 2012","author":"B Andres","year":"2012","unstructured":"Andres, B., et al.: Globally Optimal Closed-Surface Segmentation for Connectomics. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7574, pp. 778\u2013791. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33712-3_56"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-40395-8_20","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"B Andres","year":"2013","unstructured":"Andres, B., et al.: Segmenting planar superpixel adjacency graphs w.r.t. non-planar superpixel affinity graphs. In: Heyden, A., Kahl, F., Olsson, C., Oskarsson, M., Tai, X.-C. (eds.) EMMCVPR 2013. LNCS, vol. 8081, pp. 266\u2013279. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40395-8_20"},{"key":"5_CR13","unstructured":"Bagon, S., Galun, M.: Large scale correlation clustering optimization. CoRR abs\/1112.2903 (2011)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Beier, T., Hamprecht, F.A., Kappes, J.H.: Fusion moves for correlation clustering. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298973"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Beier, T., Kroeger, T., Kappes, J., K\u00f6the, U., Hamprecht, F.: Cut, glue, & cut: a fast, approximate solver for multicut partitioning. In: CVPR (2014)","DOI":"10.1109\/CVPR.2014.17"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-23094-3_3","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"JH Kappes","year":"2011","unstructured":"Kappes, J.H., Speth, M., Andres, B., Reinelt, G., Schn\u00f6rr, C.: Globally optimal image partitioning by multicuts. In: Boykov, Y., Kahl, F., Lempitsky, V., Schmidt, F.R. (eds.) EMMCVPR 2011. LNCS, vol. 6819, pp. 31\u201344. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23094-3_3"},{"key":"5_CR17","unstructured":"Kappes, J.H., Speth, M., Reinelt, G., Schn\u00f6rr, C.: Higher-order segmentation via multicuts. CoRR abs\/1305.6387 (2013)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-18461-6_19","volume-title":"Scale Space and Variational Methods in Computer Vision","author":"JH Kappes","year":"2015","unstructured":"Kappes, J.H., Swoboda, P., Savchynskyy, B., Hazan, T., Schn\u00f6rr, C.: Probabilistic correlation clustering and image partitioning using perturbed multicuts. In: Aujol, J.-F., Nikolova, M., Papadakis, N. (eds.) SSVM 2015. LNCS, vol. 9087, pp. 231\u2013242. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18461-6_19"},{"key":"5_CR19","unstructured":"Kim, S., Nowozin, S., Kohli, P., Yoo, C.D.: Higher-order correlation clustering for image segmentation. In: NIPS (2011)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1109\/TPAMI.2014.2303095","volume":"36","author":"S Kim","year":"2014","unstructured":"Kim, S., Yoo, C.D., Nowozin, S.: Image segmentation using higher-order correlation clustering. IEEE TPAMI 36, 1761\u20131774 (2014)","journal-title":"IEEE TPAMI"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Jegelka, S.: Solution stability in linear programming relaxations: graph partitioning and unsupervised learning. In: ICML (2009)","DOI":"10.1145\/1553374.1553473"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-33783-3_41","volume-title":"Computer Vision \u2013 ECCV 2012","author":"J Yarkony","year":"2012","unstructured":"Yarkony, J., Ihler, A., Fowlkes, C.C.: Fast planar correlation clustering for image segmentation. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7577, pp. 568\u2013581. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33783-3_41"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-14612-6_36","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"J Yarkony","year":"2015","unstructured":"Yarkony, J., Zhang, C., Fowlkes, C.C.: Hierarchical planar correlation clustering for cell segmentation. In: Tai, X.-C., Bae, E., Chan, T.F., Lysaker, M. (eds.) EMMCVPR 2015. LNCS, vol. 8932, pp. 492\u2013504. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14612-6_36"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. TPAMI 22, 888\u2013905 (2000)","journal-title":"TPAMI"},{"key":"5_CR25","unstructured":"Hor\u0148\u00e1kov\u00e1, A., Lange, J.H., Andres, B.: Analysis and optimization of graph decompositions by lifted multicuts. In: ICML (2017)"},{"key":"5_CR26","first-page":"73","volume":"28","author":"X Chen","year":"2009","unstructured":"Chen, X., Golovinskiy, A., Funkhouser, T.: A benchmark for 3D mesh segmentation. ACM Trans. Graph. (Proc. SIGGRAPH) 28, 73 (2009)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 361, 172\u2013187 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. In: IJCV (2015)","DOI":"10.1007\/s11263-015-0809-x"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"J Kappes","year":"2015","unstructured":"Kappes, J., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Int. J. Comput. Vis. 115, 155\u2013184 (2015)","journal-title":"Int. J. Comput. Vis."},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pbio.1000502","volume":"8","author":"A Cardona","year":"2010","unstructured":"Cardona, A., et al.: An integrated micro- and macroarchitectural analysis of the drosophila brain by computer-assisted serial section electron microscopy. PLOS Biol. 8, 1\u201317 (2010)","journal-title":"PLOS Biol."},{"key":"5_CR32","first-page":"1","volume":"9","author":"I Carreras","year":"2015","unstructured":"Carreras, I., et al.: Crowdsourcing the creation of image segmentation algorithms for connectomics. Frontiers Neuroanat. 9, 1\u201313 (2015)","journal-title":"Frontiers Neuroanat."},{"key":"5_CR33","unstructured":"Andres, B.: Lifting of multicuts. CoRR abs\/1503.03791 (2015)"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M Meil\u0103","year":"2007","unstructured":"Meil\u0103, M.: Comparing clusterings-an information based distance. J. Multivar. Anal. 98, 873\u2013895 (2007)","journal-title":"J. Multivar. Anal."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20870-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T11:18:23Z","timestamp":1633432703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20870-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208691","9783030208707"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20870-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"2 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2018","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":"accv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/accv2018.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"979","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"274","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}