{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T09:13:32Z","timestamp":1790673212853,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425960","type":"print"},{"value":"9783540454045","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45404-7_48","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:02:13Z","timestamp":1186056133000},"page":"361-368","source":"Crossref","is-referenced-by-count":13,"title":["Evaluation of Convex Optimization Techniques for the Weighted Graph-Matching Problem in Computer Vision"],"prefix":"10.1007","author":[{"given":"Christian","family":"Schellewald","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Roth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"48_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Object Representation in Computer Vision","year":"1995","unstructured":"M. Herbert, J. Ponce, T. Boult, and A. Gross, editors. Object Representation in Computer Vision, volume 994 of Lect. Not. Comp. Sci. Springer-Verlag, 1995."},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1073\/pnas.89.1.60","volume":"92","author":"H.H. B\u00fcltho","year":"1992","unstructured":"H.H. B\u00fcltho and S. Edelman. Psychophysical support for a two-dimensional view interpolation theory of object recognition. Proc. Nat. Acad. Science,, 92:60\u201364, 1992.","journal-title":"Proc. Nat. Acad. Science"},{"issue":"5","key":"48_CR3","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Patt. Anal. Mach. Intell., 10(5):695\u2013703, 1988.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"48_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55798-9","volume-title":"Relational matching","author":"G. Vosselmann","year":"1992","unstructured":"G. Vosselmann. Relational matching, volume 628 of Lect. Not. Comp. Sci. Springer, 1992."},{"issue":"6\/7","key":"48_CR5","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/S0893-6080(05)80157-1","volume":"7","author":"W.K. Konen","year":"1994","unstructured":"W.K. Konen, T. Maurer, and C. von der Malsburg. A fast dynamic link matching algorithm for invariant pattern recognition. Neural Networks, 7(6\/7):1019\u20131030, 1994.","journal-title":"Neural Networks"},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Patt. Anal. Mach. Intell., 18(4):377\u2013388, 1996.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"issue":"6","key":"48_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A.D.J. Cross","year":"1997","unstructured":"A.D.J. Cross, R.C. Wilson, and E.R. Hancock. Inexact graph matching using genetic search. Pattern Recog., 30(6):953\u2013970, 1997.","journal-title":"Pattern Recog."},{"issue":"11","key":"48_CR8","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1109\/34.730557","volume":"20","author":"A.D.J. Cross","year":"1998","unstructured":"A.D.J. Cross and E.R. Hancock. Graph-matching with a dual-step em algorithm. IEEE Trans. Patt. Anal. Mach. Intell., 20(11):1236\u20131253, 1998.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"48_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0028370","volume-title":"Computer Vision-ECCV\u2019 94","author":"W. F\u00f6rstner","year":"1994","unstructured":"W. F\u00f6rstner. A framework for low level feature extraction. In J.O. Eklundh, editor, Computer Vision-ECCV\u2019 94, volume 801 of Lect. Not. Comp. Sci., pages 61\u201370. Springer-Verlag, 1994."},{"key":"48_CR10","unstructured":"S. Ishii and M. Sato. Doubly constrained network for combinatorial optimization. Neurocomputing, 2001. to appear."},{"key":"48_CR11","first-page":"61","volume":"31","author":"G. Finke","year":"1987","unstructured":"G. Finke, R.E. Burkard, and F. Rendl. Quadratic assignment problems. Annals of Discrete Mathematics, 31:61\u201382, 1987.","journal-title":"Annals of Discrete Mathematics"},{"key":"48_CR12","unstructured":"K.M. Anstreicher and N.W. Brixius. A new bound for the quadratic assignment problem based on convex quadratic programming. Technical report, Dept. of Management Sciences, University of Iowa, 1999."},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"R.E. Burkard, S. Karisch, and F. Rendl. Qaplib \u2010 a quadratic assignment problem library. J. Global Optimization, 10:391\u2013403, 1997.","journal-title":"J. Global Optimization"},{"issue":"9","key":"48_CR14","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"H. Bunke. Error correcting graph matching: On the in uence of the underlying cost function. IEEE Trans. Patt. Anal. Mach. Intell., 21(9):917\u2013922, 1999.","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"issue":"6","key":"48_CR15","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1162\/089976699300016313","volume":"11","author":"A. Rangarajan","year":"1999","unstructured":"A. Rangarajan, A. Yuille, and E. Mjolsness. Convergence properties of the softassign quadratic assignment algorithm. Neural Computation, 11(6):1455\u20131474, 1999.","journal-title":"Neural Computation"},{"key":"48_CR16","series-title":"technical report","volume-title":"Comp. science series","author":"C. Schellewald","year":"2001","unstructured":"C. Schellewald, S. Roth, and C. Schn\u00f6rr. Evaluation of spectral and convex relaxations to the quadratic assignment of relational object views. Comp. science series, technical report, Dept. Math. and Comp. Science, University of Mannheim, Germany, 2001. in preparation."},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S.W. Hadley","year":"1992","unstructured":"S.W. Hadley, F. Rendl, and H. Wolkowicz. A new lower bound via projection for the quadratic assignment problem. Math. of Operations Research,, 17:727\u2013739, 1992.","journal-title":"Math. of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45404-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T17:20:21Z","timestamp":1550424021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45404-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425960","9783540454045"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45404-7_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}