{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T21:38:47Z","timestamp":1770413927926,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642337147","type":"print"},{"value":"9783642337154","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33715-4_1","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T08:06:38Z","timestamp":1348646798000},"page":"1-16","source":"Crossref","is-referenced-by-count":49,"title":["Diverse M-Best Solutions in Markov Random Fields"],"prefix":"10.1007","author":[{"given":"Dhruv","family":"Batra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Payman","family":"Yadollahpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abner","family":"Guzman-Rivera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Shakhnarovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1109\/TPAMI.2005.161","volume":"27","author":"A. Barbu","year":"2005","unstructured":"Barbu, A., Zhu, S.-C.: Generalizing swendsen-wang to sampling arbitrary posterior probabilities. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027, 1239\u20131253 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barinova, O., Lempitsky, V., Kohli, P.: On detection of multiple object instances using hough transforms. In: CVPR, pp. 2233\u20132240 (2010)","DOI":"10.1109\/CVPR.2010.5539905"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-23094-3_28","volume-title":"Energy Minimazation Methods in Computer Vision and Pattern Recognition","author":"M. Blaschko","year":"2011","unstructured":"Blaschko, M.: Branch and Bound Strategies for Non-maximal Suppression in Object Detection. In: Boykov, Y., Kahl, F., Lempitsky, V., Schmidt, F.R. (eds.) EMMCVPR 2011. LNCS, vol.\u00a06819, pp. 385\u2013398. Springer, Heidelberg (2011)"},{"key":"1_CR4","unstructured":"Bottou, L., Bousquet, O.: The tradeoffs of large scale learning. In: Adv. in NIPS, pp. 161\u2013168 (2008)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (March 2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"1_CR6","unstructured":"Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: ICCV (2001)"},{"issue":"12","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"20","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Efficient approximate energy minimization via graph cuts. PAMI\u00a020(12), 1222\u20131239 (2001)","journal-title":"PAMI"},{"key":"1_CR8","unstructured":"Emma Rollon, N.F., Dechter, R.: Inference schemes for m best solutions for soft csps. In: Proceedings of Workshop on Preferences and Soft Constraints (2011)"},{"key":"1_CR9","unstructured":"Fromer, M., Globerson, A.: An LP view of the m-best MAP problem. In: NIPS (2009)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kohli, P., Kumar, M.P.: Energy minimization for linear envelope mrfs. In: CVPR, pp. 1863\u20131870 (2010)","DOI":"10.1109\/CVPR.2010.5539858"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kohli, P., Torr, P.H.S.: Effciently solving dynamic markov random fields using graph cuts. In: ICCV, pp. 922\u2013929 (2005)","DOI":"10.1109\/ICCV.2005.81"},{"issue":"1","key":"1_CR12","first-page":"30","volume":"112","author":"P. Kohli","year":"2008","unstructured":"Kohli, P., Torr, P.H.S.: Measuring uncertainty in graph cut solutions. CVIU\u00a0112(1), 30\u201338 (2008)","journal-title":"CVIU"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? PAMI\u00a026(2), 147\u2013159 (2004)","journal-title":"PAMI"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond pairwise energies: Efficient optimization for higher-order MRFs. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206846"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ladick\u1ef3, L., Russell, C., Kohli, P., Torr, P.H.S.: Associative hierarchical CRFs for object class image segmentation. In: ICCV (2009)","DOI":"10.1109\/ICCV.2009.5459248"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-15555-0_18","volume-title":"Computer Vision \u2013 ECCV 2010","author":"L. Ladicky","year":"2010","unstructured":"Ladicky, L., Russell, C., Kohli, P., Torr, P.H.S.: Graph Cut Based Inference with Co-occurrence Statistics. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol.\u00a06315, pp. 239\u2013253. Springer, Heidelberg (2010)"},{"key":"1_CR17","unstructured":"Ladicky, L., Torr, P.H.: The automatic labelling environment, \n                    \n                      http:\/\/cms.brookes.ac.uk\/staff\/PhilipTorr\/ale.html"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Li, F., Carreira, J., Sminchisescu, C.: Object recognition as ranking holistic figure-ground hypotheses. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5539839"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: ICCV, pp. 428\u2013435 (2005)","DOI":"10.1109\/ICCV.2005.110"},{"key":"1_CR21","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.\u00a07205, pp. 91\u2013118. Springer, Heidelberg (2012)"},{"key":"1_CR22","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, 159\u2013173 (1998), doi:10.1023\/A:1008990218483","journal-title":"Statistics and Computing"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Lampert, C.: Global connectivity potentials for random field models. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206567"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Papandreou, G., Yuille, A.: Perturb-and-map random fields: Using discrete optimization to learn and sample from energy models. In: ICCV, pp. 193\u2013200 (November 2011)","DOI":"10.1109\/ICCV.2011.6126242"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Park, D., Ramanan, D.: N-best maximal decoders for part models. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126552"},{"issue":"9","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1109\/TPAMI.2011.27","volume":"33","author":"J. Porway","year":"2011","unstructured":"Porway, J., Zhu, S.-C.: C\n                  4: Exploring multiple solutions in graphical models by cluster sampling. PAMI\u00a033(9), 1713\u20131727 (2011)","journal-title":"PAMI"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Roth, S., Black, M.: Fields of experts. IJCV\u00a082(2) (April 2009)","DOI":"10.1007\/s11263-008-0197-6"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR, pp. 1382\u20131389 (2009)","DOI":"10.1109\/CVPR.2009.5206739"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Blake, A.: \u201cGrabcut\u201d: interactive foreground extraction using iterated graph cuts. In: SIGGRAPH (2004)","DOI":"10.1145\/1186562.1015720"},{"issue":"3","key":"1_CR30","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. Int. J. of Approx. Reasoning\u00a011(3), 205\u2013233 (1994)","journal-title":"Int. J. of Approx. Reasoning"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Shor, N.: Minimization methods for non-differentiable functions. Springer Series in Computational Mathematics. Springer (1985)","DOI":"10.1007\/978-3-642-82118-9"},{"issue":"6","key":"1_CR32","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI\u00a030(6), 1068\u20131080 (2008)","journal-title":"PAMI"},{"key":"1_CR33","unstructured":"Tarlow, D., Givoni, I.E., Zemel, R.S.: Hop-map: Efficient message passing with high order potentials. In: AISTATS, pp. 812\u2013819 (2010)"},{"key":"1_CR34","first-page":"1453","volume":"6","author":"I. Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. JMLR\u00a06, 1453\u20131484 (2005)","journal-title":"JMLR"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/34.1000239","volume":"24","author":"Z. Tu","year":"2002","unstructured":"Tu, Z., Zhu, S.-C.: Image segmentation by data-driven markov chain monte carlo. IEEE Trans. Pattern Anal. Mach. Intell.\u00a024, 657\u2013673 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"1_CR36","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPAMI.2007.1036","volume":"29","author":"T. Werner","year":"2007","unstructured":"Werner, T.: A linear programming approach to max-sum problem: A review. PAMI\u00a029(7), 1165\u20131179 (2007)","journal-title":"PAMI"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Yang, Y., Ramanan, D.: Articulated pose estimation with flexible mixtures-of-parts. In: CVPR, pp. 1385\u20131392 (2011)","DOI":"10.1109\/CVPR.2011.5995741"},{"key":"1_CR38","unstructured":"Yanover, C., Weiss, Y.: Finding the m most probable configurations using loopy belief propagation. In: NIPS (2003)"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Yue, Y., Joachims, T.: Predicting diverse subsets using structural SVMs. In: ICML, pp. 271\u2013278 (2008)","DOI":"10.1145\/1390156.1390310"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33715-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T13:36:06Z","timestamp":1575293766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33715-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337147","9783642337154"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33715-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}