{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:28Z","timestamp":1725471988877},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540465560"},{"type":"electronic","value":"9783540465577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11892755_80","type":"book-chapter","created":{"date-parts":[[2006,10,13]],"date-time":"2006-10-13T20:51:29Z","timestamp":1160772689000},"page":"774-783","source":"Crossref","is-referenced-by-count":2,"title":["Spectral Median Graphs Applied to Graphical Symbol Recognition"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Ferrer","sequence":"first","affiliation":[]},{"given":"Ernest","family":"Valveny","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"80_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman, J.R.: An algorithm for subgraph isomorphism. Journal of ACM\u00a023(1), 31\u201342 (1976)","journal-title":"Journal of ACM"},{"issue":"1","key":"80_CR2","first-page":"169","volume":"11","author":"H. Bunke","year":"1997","unstructured":"Bunke, H., Messmer, B.T.: Recent advances in graph matching. IJPRAI\u00a011(1), 169\u2013203 (1997)","journal-title":"IJPRAI"},{"issue":"10","key":"80_CR3","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/34.954604","volume":"23","author":"X. Jiang","year":"2001","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(10), 1144\u20131151 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"80_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-40953-X_15","volume-title":"Graphics Recognition. Recent Advances","author":"X. Jiang","year":"2000","unstructured":"Jiang, X., M\u00fcnger, A., Bunke, H.: Synthesis of representative graphical symbols by computing generalized median graph. In: Chhabra, A.K., Dori, D. (eds.) GREC 1999. LNCS, vol.\u00a01941, pp. 183\u2013192. Springer, Heidelberg (2000)"},{"issue":"5","key":"80_CR5","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Recognition and Image Analysis\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Transactions on Pattern Recognition and Image Analysis"},{"key":"80_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11492542_18","volume-title":"Pattern Recognition and Image Analysis","author":"M. Ferrer","year":"2005","unstructured":"Ferrer, M., Serratosa, F., Sanfeliu, A.: Synthesis of median spectral graph. In: Marques, J.S., P\u00e9rez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol.\u00a03523, pp. 139\u2013146. Springer, Heidelberg (2005)"},{"key":"80_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45868-9_9","volume-title":"Graphics Recognition. Algorithms and Applications","author":"J. Llad\u00f3s","year":"2002","unstructured":"Llad\u00f3s, J., Valveny, E., S\u00e1nchez, G., Mart\u00ed, E.: Symbol Recognition: Current Advances and Perspectives. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol.\u00a02390, pp. 104\u2013127. Springer, Heidelberg (2002)"},{"issue":"4","key":"80_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell.\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"80_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013(3), 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"doi-asserted-by":"crossref","unstructured":"Dosch, P., Valveny, E.: Report on the second symbol recognition contest (to appear in lncs series) (2006)","key":"80_CR10","DOI":"10.1007\/11767978_35"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11892755_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:43Z","timestamp":1605642763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11892755_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540465560","9783540465577"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11892755_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}