{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:21:57Z","timestamp":1743106917644,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886815"},{"type":"electronic","value":"9783540886822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88682-2_11","type":"book-chapter","created":{"date-parts":[[2008,10,11]],"date-time":"2008-10-11T19:59:49Z","timestamp":1223755189000},"page":"127-140","source":"Crossref","is-referenced-by-count":14,"title":["Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities"],"prefix":"10.1007","author":[{"given":"Ady","family":"Ecker","sequence":"first","affiliation":[]},{"given":"Allan D.","family":"Jepson","sequence":"additional","affiliation":[]},{"given":"Kiriakos N.","family":"Kutulakos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization. Technical Report ZIB-Report ZR-00-34, TU Berlin (2000)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Handbook on Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Handbook on Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"M.J. Todd","year":"2001","unstructured":"Todd, M.J.: Semidefinite optimization. Acta Numerica\u00a010, 515\u2013560 (2001)","journal-title":"Acta Numerica"},{"issue":"11","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1109\/TPAMI.2003.1240111","volume":"25","author":"J. Keuchel","year":"2003","unstructured":"Keuchel, J., Schnorr, C., Schellewald, C., Cremers, D.: Binary partitioning, perceptual grouping, and restoration with semidefinite programming. PAMI\u00a025(11), 1364\u20131379 (2003)","journal-title":"PAMI"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/11744047_35","volume-title":"Computer Vision \u2013 ECCV 2006","author":"J. Keuchel","year":"2006","unstructured":"Keuchel, J.: Multiclass image labeling with semidefinite programming. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03954, pp. 454\u2013467. Springer, Heidelberg (2006)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Carl Olsson, A.E., Kahl, F.: Solving large scale binary quadratic problems: Spectral methods vs. semidefinite programming. In: CVPR 2007, pp. 1\u20138 (2007)","DOI":"10.1109\/CVPR.2007.383202"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bai, X., Yu, H., Hancock, E.: Graph matching using spectral embedding and semidefinite programming. In: BMVC 2004, pp. 297\u2013307 (2004)","DOI":"10.5244\/C.18.32"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-31988-7_7","volume-title":"Graph-Based Representations in Pattern Recognition","author":"H. Yu","year":"2005","unstructured":"Yu, H., Hancock, E.R.: Graph seriation using semi-definite programming. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol.\u00a03434, pp. 63\u201371. Springer, Heidelberg (2005)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11585978_12","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C. Schellewald","year":"2005","unstructured":"Schellewald, C., Schn\u00f6rr, C.: Probabilistic subgraph matching based on convex relaxation. In: Rangarajan, A., Vemuri, B.C., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol.\u00a03757, pp. 171\u2013186. Springer, Heidelberg (2005)"},{"key":"11_CR10","unstructured":"Torr, P.: Solving markov random fields using semi definite programming. In: Proc. Ninth International Workshop on Artificial Intelligence and Statistics (2003)"},{"key":"11_CR11","unstructured":"Zhu, Q., Shi, J.: Shape from shading: Recognizing the mountains through a global view. In: CVPR 2006, pp. 1839\u20131846 (2006)"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Forsyth, D.: Shape from texture and integrability. In: ICCV 2001, pp. 447\u2013452 (2001)","DOI":"10.1109\/ICCV.2001.937659"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-47977-5_15","volume-title":"Computer Vision - ECCV 2002","author":"D. Forsyth","year":"2002","unstructured":"Forsyth, D.: Shape from texture without boundaries. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 225\u2013239. Springer, Heidelberg (2002)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00056773","volume":"5","author":"R. Onn","year":"1990","unstructured":"Onn, R., Bruckstein, A.: Integrability disambiguates surface recovery in two-image photometric stereo. Int. J. Comput. Vision\u00a05(1), 105\u2013113 (1990)","journal-title":"Int. J. Comput. Vision"},{"issue":"3","key":"11_CR16","first-page":"345","volume":"42","author":"S. Naito","year":"1988","unstructured":"Naito, S., Rosenfeld, A.: Shape from random planar features. CVGIP\u00a042(3), 345\u2013370 (1988)","journal-title":"CVGIP"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BFb0054743","volume-title":"Computer Vision - ECCV\u201998","author":"J. Koenderink","year":"1998","unstructured":"Koenderink, J., van Doorn, A.: Shape from chebyshev nets. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol.\u00a01407, pp. 215\u2013225. Springer, Heidelberg (1998)"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TPAMI.1987.4767940","volume":"9","author":"A.P. Pentland","year":"1987","unstructured":"Pentland, A.P.: A new sense for depth of field. PAMI\u00a09(4), 523\u2013531 (1987)","journal-title":"PAMI"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Arora, S., Berger, E., Hazan, E., Kindler, G., Safra, M.: On non-approximability for quadratic programs. In: FOCS 2005, pp. 206\u2013215 (2005)","DOI":"10.1109\/SFCS.2005.57"},{"key":"11_CR20","unstructured":"Chan, T.F., Gilbert, J.R., Teng, S.H.: Geometric spectral partitioning. Technical Report Tech. Report CSL-94-15, Xerox PARC (1995)"},{"key":"11_CR21","unstructured":"Fjallstrom, P.O.: Algorithms for graph partitioning: A survey. Linkoping Electronic Articles in Computer and Information Science\u00a03(10) (1998)"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J. on Optimization\u00a012(2), 503\u2013521 (2002)","journal-title":"SIAM J. on Optimization"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell system technical journal"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A linear-time heuristic for improving network partitions. In: Proc. 19th Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput.\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10589-005-5958-3","volume":"33","author":"K. Krishnan","year":"2006","unstructured":"Krishnan, K., Mitchell, J.E.: A semidefinite programming based polyhedral cut and price approach for the maxcut problem. Comp. Optim. Appl.\u00a033(1), 51\u201371 (2006)","journal-title":"Comp. Optim. Appl."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Benson, S.J., Ye, Y.: Algorithm 875: DSDP5: Software for semidefinite programming. ACM Trans. Math. Software\u00a034(3) (2008)","DOI":"10.1145\/1356052.1356057"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithms for maxk-cut and max bisection. Algorithmica\u00a018(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/B:JOCO.0000038911.67280.3f","volume":"8","author":"E. Klerk de","year":"2004","unstructured":"de Klerk, E., Pasechnik, D.V., Warners, J.P.: On approximate graph colouring and max-k-cut algorithms based on the theta-function. J. Comb. Optim.\u00a08(3), 267\u2013294 (2004)","journal-title":"J. Comb. Optim."},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Technical report, Alpen-Adria-Universit\u00e4t Klagenfurt, Inst. f. Mathematik (2007)","DOI":"10.1007\/s10107-008-0235-8"},{"issue":"6","key":"11_CR31","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1162\/neco.1996.8.6.1321","volume":"8","author":"J.J. Atick","year":"1996","unstructured":"Atick, J.J., Griffin, P.A., Redlich, A.N.: Statistical approach to shape from shading: Reconstruction of three-dimensional face surfaces from single two-dimensional images. Neural Computation\u00a08(6), 1321\u20131340 (1996)","journal-title":"Neural Computation"},{"key":"11_CR32","unstructured":"Zhang, L., Dugas-Phocion, G., Samson, J.S., Seitz, S.M.: Single view modeling of free-form scenes. In: CVPR 2001, pp. 990\u2013997 (2001)"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"White, R., Forsyth, D.: Combining cues: Shape from shading and texture. In: CVPR 2006, pp. 1809\u20131816 (2006)","DOI":"10.1109\/CVPR.2006.79"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88682-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T18:15:35Z","timestamp":1738433735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88682-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886815","9783540886822"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88682-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}