{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:23:43Z","timestamp":1725747823085},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406010"},{"type":"electronic","value":"9783642406027"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40602-7_40","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:38:06Z","timestamp":1378539486000},"page":"375-384","source":"Crossref","is-referenced-by-count":3,"title":["K-Smallest Spanning Tree Segmentations"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Straehle","sequence":"first","affiliation":[]},{"given":"Sven","family":"Peter","sequence":"additional","affiliation":[]},{"given":"Ullrich","family":"K\u00f6the","sequence":"additional","affiliation":[]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33715-4_1","volume-title":"Computer Vision \u2013 ECCV 2012","author":"D. Batra","year":"2012","unstructured":"Batra, D., Yadollahpour, P., Guzman-Rivera, A., Shakhnarovich, G.: Diverse M-best solutions in markov random fields. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part V. LNCS, vol.\u00a07576, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Blake, A., Kohli, P., Rother, C.: Markov random fields for vision and image processing. MIT Press (2011)","DOI":"10.7551\/mitpress\/8579.001.0001"},{"key":"40_CR3","unstructured":"Boykov, Y., Jolly, M.: Interactive graph cuts for optimal boundary and region segmentation of objects in ND images. In: ICCV (2001)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Brendel, W., Todorovic, S.: Segmentation as maximumweight independent set. In: NIPS, vol.\u00a04 (2010)","DOI":"10.1109\/CVPR.2011.5995395"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Briggman, K.L., Denk, W., et al.: Towards neural circuit reconstruction with volume electron microscopy techniques. Current Opinion in Neurobiology (2006)","DOI":"10.1016\/j.conb.2006.08.010"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Couprie, C., Grady, L., Najman, L., Talbot, H.: Power watershed: A unifying graph-based optimization framework. IEEE PAMI (2010)","DOI":"10.1109\/TPAMI.2010.200"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: Minimum spanning forests and the drop of water principle. IEEE PAMI, 1362\u20131374 (2009)","DOI":"10.1109\/TPAMI.2008.173"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Falc\u00e3o, A.X., Stolfi, J., Lotufo, R.A.: The image foresting transform: Theory, algorithms, and applications. IEEE PAMI\u00a026 (2004)","DOI":"10.1109\/TPAMI.2004.1261076"},{"key":"40_CR9","unstructured":"Fromer, M., Globerson, A.: An LP view of the M-best MAP problem. NIPS (2009)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Gabow, H.: Two algorithms for generating weighted spanning trees in order. SIAM Journal on Computing (1977)","DOI":"10.1137\/0206011"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Grady, L.: Random walks for image segmentation. IEEE PAMI 28 (2006)","DOI":"10.1109\/TPAMI.2006.233"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Meyer, F.: Minimum spanning forests for morphological segmentation. In: Mathematical Morphology and its Applications to Image Processing, pp. 77\u201384. Springer (1994)","DOI":"10.1007\/978-94-011-1040-2_11"},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/1047-3203(90)90014-M","volume":"1","author":"F. Meyer","year":"1990","unstructured":"Meyer, F., Beucher, S.: Morphological segmentation. Journal of Visual Communication and Image Representation\u00a01(1), 21\u201346 (1990)","journal-title":"Journal of Visual Communication and Image Representation"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008990218483","volume":"8","author":"D. Nilsson","year":"1998","unstructured":"Nilsson, D.: An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Statistics and Computing\u00a08(2), 159\u2013173 (1998)","journal-title":"Statistics and Computing"},{"key":"40_CR15","unstructured":"Rollon, N.E., Dechter, R.: Inference schemes for M-best solutions for soft CSPs. In: Proceedings of Workshop on Preferences and Soft Constraints, vol.\u00a02 (2011)"},{"issue":"3","key":"40_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0888-613X(94)90031-0","volume":"11","author":"B. Seroussi","year":"1994","unstructured":"Seroussi, B., Golmard, J.: An algorithm directly finding the K most probable configurations in bayesian networks. International Journal of Approximate Reasoning\u00a011(3), 205\u2013233 (1994)","journal-title":"International Journal of Approximate Reasoning"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-23623-5_82","volume-title":"Medical Image Computing and Computer-Assisted Intervention \u2013 MICCAI 2011","author":"C.N. Straehle","year":"2011","unstructured":"Straehle, C.N., K\u00f6the, U., Knott, G., Hamprecht, F.A.: Carving: Scalable interactive segmentation of neural volume electron microscopy images. In: Fichtinger, G., Martel, A., Peters, T. (eds.) MICCAI 2011, Part I. LNCS, vol.\u00a06891, pp. 653\u2013660. Springer, Heidelberg (2011)"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Tzeng, W.J., Wu, F.: Spanning trees on hypercubic lattices and nonorientable surfaces. Applied Mathematics Letters\u00a013 (2000)","DOI":"10.1016\/S0893-9659(00)00071-9"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Vincent, L., Soille, P.: Watersheds in digital spaces: an efficient algorithm based on immersion simulations. IEEE PAMI (1991)","DOI":"10.1109\/34.87344"},{"key":"40_CR20","unstructured":"Yanover, C., Weiss, Y.: Finding the AI most probable configurations using loopy belief propagation. In: NIPS (2004)"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40602-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T22:03:09Z","timestamp":1558044189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40602-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406010","9783642406027"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40602-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}