{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:54:20Z","timestamp":1743054860572,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337178"},{"type":"electronic","value":"9783642337185"}],"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-33718-5_27","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T04:06:45Z","timestamp":1348632405000},"page":"370-384","source":"Crossref","is-referenced-by-count":6,"title":["Fast Fusion Moves for Multi-model Estimation"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Delong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Veksler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0028365","volume-title":"Computer Vision - ECCV \u201994","author":"P.H.S. Torr","year":"1994","unstructured":"Torr, P.H.S., Murray, D.: Stochastic Motion Clustering. In: Eklundh, J.-O. (ed.) ECCV 1994, Part II. LNCS, vol.\u00a0801, pp. 328\u2013337. Springer, Heidelberg (1994)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Torr, P.H.S.: Geometric Motion Segmentation and Model Selection. In: Philosophical Transactions of the Royal Society A, pp. 1321\u20131340 (1998)","DOI":"10.1098\/rsta.1998.0224"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TPAMI.2006.130","volume":"28","author":"K. Schindler","year":"2006","unstructured":"Schindler, K., Suter, D.: Two-view multibody structure-and-motion with outliers through model selection. IEEE Trans. on Patt. Analysis and Mach. Intelligence\u00a028, 983\u2013995 (2006)","journal-title":"IEEE Trans. on Patt. Analysis and Mach. Intelligence"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Li, H.: Two-view Motion Segmentation from Linear Programming Relaxation. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2007)","DOI":"10.1109\/CVPR.2007.382975"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Barinova, O., Lempitsky, V., Kohli, P.: On the Detection of Multiple Object Instances using Hough Transforms. In: IEEE Conf. on Comp. Vision and Patt. Recognition, CVPR (2010)","DOI":"10.1109\/CVPR.2010.5539905"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-011-0437-z","volume":"96","author":"A. Delong","year":"2011","unstructured":"Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast Approximate Energy Minimization with Label Costs. International Journal of Computer Vision (IJCV)\u00a096, 1\u201327 (2011)","journal-title":"International Journal of Computer Vision (IJCV)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S.: Heuristics for the fixed cost median problem. Math.\u00a0Prog. 22 (1982)","DOI":"10.1007\/BF01581035"},{"key":"27_CR8","unstructured":"Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The Uncapacitated Facility Location Problem. Technical Report 605, Operations Research, Cornell University (1983)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: ACM Symposium on Theory of Computing (STOC), pp. 265\u2013274 (1998)","DOI":"10.1145\/258533.258600"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. Jour.\u00a0of the ACM 45 (1998)","DOI":"10.1145\/285055.285059"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C.C. Aggarwal","year":"1997","unstructured":"Aggarwal, C.C., Orlin, J.B., Tai, R.P.: Optimized Crossover for the Independent Set Problem. Operations Research\u00a045, 226\u2013234 (1997)","journal-title":"Operations Research"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Rother, C., Roth, S., Blake, A.: Fusion moves for markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Inference (TPAMI) 32 (2010)","DOI":"10.1109\/TPAMI.2009.143"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123, 75\u2013202 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast Approximate Energy Minimization via Graph Cuts. IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI) 23 (2001)","DOI":"10.1109\/34.969114"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0097539791199334","volume":"23","author":"R. Ahuja","year":"1994","unstructured":"Ahuja, R., Orlin, J., Stein, C., Tarjan, R.: Improved algorithms for bipartite network flow. SIAM Journal on Computing\u00a023, 906\u2013933 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. Nemhauser","year":"1975","unstructured":"Nemhauser, G., Trotter, L.: Vertex packings: Structural properties and algorithms. Mathematical Programming\u00a08, 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"M.A. Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Comm. ACM\u00a024, 381\u2013395 (1981)","journal-title":"Comm. ACM"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Stephens, R.: Probabilistic approach to the Hough transform. Image and Vis.\u00a0Comp. 9 (1991)","DOI":"10.1016\/0262-8856(91)90051-P"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Akaike, H.: A new look at statistical model identification. Trans.\u00a0on Auto.\u00a0Control 19 (1974)","DOI":"10.1109\/TAC.1974.1100705"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Lazic, N., Givoni, I., Frey, B.J., Aarabi, P.: FLoSS: Facility Location for Subspace Segmentation. In: International Conference on Computer Vision, ICCV (2009)","DOI":"10.1109\/ICCV.2009.5459302"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"B.J. Frey","year":"2007","unstructured":"Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science\u00a0315, 972\u2013976 (2007)","journal-title":"Science"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Chum, O., Matas, J., Kittler, J.: Locally Optimized RANSAC. Pattern Recognition (2003)","DOI":"10.1007\/978-3-540-45243-0_31"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.: Approximating clique and biclique problems. Jour.\u00a0of Algorithms 29 (1998)","DOI":"10.1006\/jagm.1998.0964"},{"key":"27_CR24","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P.L. Hammer","year":"1965","unstructured":"Hammer, P.L.: Some network flow problems solved with pseudo-boolean programming. Operations Research\u00a013, 388\u2013399 (1965)","journal-title":"Operations Research"},{"key":"27_CR25","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 Optimized via Graph Cuts. IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI)\u00a026, 147\u2013159 (2004)","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Boros, E., Hammer, P.L.: Pseudo-Boolean Optimization. Discrete Applied Math. 123 (2002)","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/0216020","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D., Martel, C., Fernandez-Baca, D.: Fast algorithms for bipartite network flow. SIAM Journal on Computing\u00a016, 237\u2013251 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"29","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut\/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI)\u00a029, 1124\u20131137 (2004)","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI)"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: The importance of being biased. In: ACM STOC (2002)","DOI":"10.1145\/509914.509915"},{"key":"27_CR30","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.dam.2007.03.026","volume":"156","author":"M. Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Crown reductions for the Minimum Weighted Vertex Cover problem. Discrete Applied Mathematics\u00a0156, 292\u2013312 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR31","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P. Hammer","year":"1984","unstructured":"Hammer, P., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematical Programming\u00a028, 121\u2013125 (1984)","journal-title":"Mathematical Programming"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing Binary MRFs via Extended Roof Duality. In: IEEE Conf.\u00a0on Comp.\u00a0Vis.\u00a0and Patt.\u00a0Recognition, CVPR (2007)","DOI":"10.1109\/CVPR.2007.383203"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Sheikh, Y., Khan, E., Kanade, T.: Mode-seeking by medoidshifts. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408978"},{"key":"27_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-47969-4_6","volume-title":"Computer Vision - ECCV 2002","author":"B. Tordoff","year":"2002","unstructured":"Tordoff, B., Murray, D.W.: Guided Sampling and Consensus for Motion Estimation. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol.\u00a02350, pp. 82\u201396. Springer, Heidelberg (2002)"},{"key":"27_CR35","unstructured":"Pham, T.T., Chin, T.J., Yu, J., Suter, D.: The Random Cluster Model for Robust Geometric Fitting. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2012)"},{"key":"27_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-88688-4_15","volume-title":"Computer Vision \u2013 ECCV 2008","author":"P. Denis","year":"2008","unstructured":"Denis, P., Elder, J.H., Estrada, F.J.: Efficient Edge-Based Methods for Estimating Manhattan Frames in Urban Imagery. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol.\u00a05303, pp. 197\u2013210. Springer, Heidelberg (2008)"}],"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-33718-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:24:17Z","timestamp":1575278657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33718-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337178","9783642337185"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33718-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}