{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:28:57Z","timestamp":1743118137327,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319667089"},{"type":"electronic","value":"9783319667096"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66709-6_21","type":"book-chapter","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:13:01Z","timestamp":1502669581000},"page":"255-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diverse M-Best Solutions by Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Haubold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virginie","family":"Uhlmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Unser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arteta, C., Lempitsky, V., Noble, J.A., Zisserman, A.: Learning to detect partially overlapping instances. In: Proceedings of the IEEE Conference on Computer Vision And Pattern Recognition (CVPR 2013), Portland, OR, USA, 25\u201327 June 2013, pp. 3230\u20133237 (2013)","key":"21_CR1","DOI":"10.1109\/CVPR.2013.415"},{"key":"21_CR2","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. LNCS, vol. 7576, pp. 1\u201316. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-33715-4_1"},{"unstructured":"Batra, D.: An efficient message-passing algorithm for the M-best map problem. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI 2012) (2012)","key":"21_CR3"},{"issue":"8","key":"21_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1073\/pnas.38.8.716","volume":"38","author":"R Bellman","year":"1952","unstructured":"Bellman, R.: On the theory of dynamic programming. Proc. Nat. Acad. Sci. 38(8), 716\u2013719 (1952)","journal-title":"Proc. Nat. Acad. Sci."},{"unstructured":"Chen, C., Liu, H., Metaxas, D., Zhao, T.: Mode estimation for high dimensional discrete tree graphical models. In: Advances in Neural Information Processing Systems (NIPS 2014), Montr\u00e9al, Canada, 8\u201313 December 2014, pp. 1323\u20131331 (2014)","key":"21_CR5"},{"unstructured":"Chen, C., Kolmogorov, V., Zhu, Y., Metaxas, D.N., Lampert, C.H.: Computing the M most probable modes of a graphical model. In: AISTATS, pp. 161\u2013169 (2013)","key":"21_CR6"},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"21_CR8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-29449-5_4","volume-title":"Graph Structures for Knowledge Representation and Reasoning","author":"N Flerova","year":"2012","unstructured":"Flerova, N., Rollon, E., Dechter, R.: Bucket and mini-bucket schemes for M Best solutions over graphical models. In: Croitoru, M., Rudolph, S., Wilson, N., Howse, J., Corby, O. (eds.) GKR 2011. LNCS, vol. 7205, pp. 91\u2013118. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-29449-5_4"},{"unstructured":"Fromer, M., Globerson, A.: An LP view of the M-best MAP problem. In: Advances in Neural Information Processing Systems, pp. 567\u2013575 (2009)","key":"21_CR10"},{"doi-asserted-by":"crossref","unstructured":"Fujita, Y., Nakamura, Y., Shiller, Z.: Dual Dijkstra search for paths with different topologies. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA 2003), vol. 3, Taipei, Taiwan, 14\u201319 September 2003, pp. 3359\u20133364 (2003)","key":"21_CR11","DOI":"10.1109\/ROBOT.2003.1242109"},{"issue":"9","key":"21_CR12","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1038\/nmeth.1486","volume":"7","author":"M Held","year":"2010","unstructured":"Held, M., Schmitz, M., Fischer, B., Walter, T., Neumann, B., Olma, M., Peter, M., Ellenberg, J., Gerlich, D.: Cellcognition: time-resolved phenotype annotation in high-throughput live cell imaging. Nat. Methods 7(9), 747\u2013754 (2010)","journal-title":"Nat. Methods"},{"doi-asserted-by":"crossref","unstructured":"Jug, F., Pietzsch, T., Kainm\u00fcller, D., Funke, J., Kaiser, M., van Nimwegen, E., Rother, C., Myers, G.: Optimal joint segmentation and tracking of Escherichia coli in the mother machine. In: Proceedings of the First International Workshop on Bayesian and grAphical Models for Biomedical Imaging (BAMBI 2014), Cambridge, MA, USA, 18 September 2014, pp. 25\u201336 (2014)","key":"21_CR13","DOI":"10.1007\/978-3-319-12289-2_3"},{"doi-asserted-by":"crossref","unstructured":"Kirillov, A., Savchynskyy, B., Schlesinger, D., Vetrov, D., Rother, C.: Inferring M-best diverse labelings in a single one. In: Proceedings of the IEEE International Conference on Computer Vision (ICCV 2015), Santiago, Chile, 13\u201316 December 2015, pp. 1814\u20131822 (2015)","key":"21_CR14","DOI":"10.1109\/ICCV.2015.211"},{"key":"21_CR15","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"unstructured":"Lampert, C.H.: Maximum margin multi-label structured prediction. In: Advances in Neural Information Processing Systems, pp. 289\u2013297 (2011)","key":"21_CR16"},{"issue":"7","key":"21_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E Lawler","year":"1972","unstructured":"Lawler, E.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Milan, A., Schindler, K., Roth, S.: Detection-and trajectory-level exclusion in multiple object tracking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3682\u20133689 (2013)","key":"21_CR18","DOI":"10.1109\/CVPR.2013.472"},{"issue":"2","key":"21_CR19","doi-asserted-by":"crossref","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 configurationsin probabilistic expert systems. Stat. Comput. 8(2), 159\u2013173 (1998)","journal-title":"Stat. Comput."},{"doi-asserted-by":"crossref","unstructured":"Papandreou, G., Yuille, A.L.: Perturb-and-map random fields: using discrete optimization to learn and sample from energy models. In: 2011 International Conference on Computer Vision, pp. 193\u2013200. IEEE (2011)","key":"21_CR20","DOI":"10.1109\/ICCV.2011.6126242"},{"key":"21_CR21","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Burlington (1988)"},{"unstructured":"Prasad, A., Jegelka, S., Batra, D.: Submodular meets structured: finding diverse subsets in exponentially-large structured item sets. In: Advances in Neural Information Processing Systems (NIPS 2014), Montr\u00e9al, Canada, 8\u201313 December 2014, pp. 2645\u20132653 (2014)","key":"21_CR22"},{"unstructured":"Rollon, E., Flerova, N., Dechter, R.: Inference schemes for M best solutions for soft CSPs. In: Proceedings of the Seventh International Workshop on Preferences and Soft Constraints, vol. 2. Sitges, Spain, 1 October 2011","key":"21_CR23"},{"issue":"6","key":"21_CR24","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1093\/bioinformatics\/btu764","volume":"31","author":"M Schiegg","year":"2015","unstructured":"Schiegg, M., Hanslovsky, P., Haubold, C., Koethe, U., Hufnagel, L., Hamprecht, F.: Graphical model for joint segmentation and tracking of multiple dividing cells. Bioinformatics 31(6), 948\u2013956 (2015)","journal-title":"Bioinformatics"},{"key":"21_CR25","volume-title":"Ten Lectures on Statistical and Structural Pattern Recognition","author":"MI Schlesinger","year":"2013","unstructured":"Schlesinger, M.I., Hlav\u00e1c, V.: Ten Lectures on Statistical and Structural Pattern Recognition, vol. 24. Springer Science & Business Media, New York (2013)"},{"issue":"3","key":"21_CR26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0888-613X(94)90031-0","volume":"11","author":"B Seroussi","year":"1994","unstructured":"Seroussi, B., Golmard, J.L.: An algorithm directly finding the k most probable configurations in Bayesian networks. Int. J. Approx. Reason. 11(3), 205\u2013233 (1994)","journal-title":"Int. J. Approx. Reason."},{"issue":"4","key":"21_CR27","doi-asserted-by":"crossref","first-page":"83:1","DOI":"10.1145\/2185520.2185579","volume":"31","author":"B Summa","year":"2012","unstructured":"Summa, B., Tierny, J., Pascucci, V.: Panorama weaving: fast and flexible seam processing. ACM Trans. Graph. 31(4), 83:1\u201383:11 (2012)","journal-title":"ACM Trans. Graph."},{"doi-asserted-by":"crossref","unstructured":"Yadollahpour, P., Batra, D., Shakhnarovich, G.: Discriminative re-ranking of diverse segmentations. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2013","key":"21_CR28","DOI":"10.1109\/CVPR.2013.251"},{"unstructured":"Yanover, C., Weiss, Y.: Finding the m most probable configurations using loopy belief propagation. In: Advances in Neural Information Processing Systems, vol. 16, p. 289 (2004)","key":"21_CR29"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66709-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T20:03:05Z","timestamp":1511899385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66709-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319667089","9783319667096"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66709-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}