{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:18:55Z","timestamp":1762251535965,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046964"},{"type":"electronic","value":"9783642046971"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04697-1_9","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T04:50:54Z","timestamp":1253076654000},"page":"89-99","source":"Crossref","is-referenced-by-count":29,"title":["Attributed Graph Matching Using Local Descriptions"],"prefix":"10.1007","author":[{"given":"Salim","family":"Jouili","sequence":"first","affiliation":[]},{"given":"Ines","family":"Mili","sequence":"additional","affiliation":[]},{"given":"Salvatore","family":"Tabbone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Myers, R., Wilson, R.C., Hancock, E.R.: Bayesian Graph Edit Distance. IEEE Trans. Pattern Anal. Mach. Intell.\u00a022(6), 628\u2013635 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"10","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1016\/j.patcog.2006.04.012","volume":"39","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. Pattern Recognition\u00a039(10), 1852\u20131863 (2006)","journal-title":"Pattern Recognition"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. (2008), doi:10.1016\/j.imavis.2008.04.004","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Riesen, K., Bunke, H.: IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. In: IAPR Workshop SSPR & SPR, pp. 287\u2013297 (2008)","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Dosch, P., Valveny, E.: Report on the Second Symbol Recognition Contest. In: Proc. 6th IAPR Workshop on Graphics Recognition, pp. 381\u2013397 (2005)","DOI":"10.1007\/11767978_35"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10032-003-0106-z","volume":"6","author":"D. Lopresti","year":"2004","unstructured":"Lopresti, D., Wilfong, G.: A fast technique for comparing graph representations with applications to performance evaluation. International Journal on Document Analysis and Recognition\u00a06(4), 219\u2013229 (2004)","journal-title":"International Journal on Document Analysis and Recognition"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/BFb0055688","volume-title":"Computer Vision - ECCV\u201998","author":"J. Shi","year":"1998","unstructured":"Shi, J., Malik, J.: Self Inducing Relational Distance and Its Application to Image Segmentation. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, vol.\u00a01406, pp. 528\u2013543. Springer, Heidelberg (1998)"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. Int\u2019l J. Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"Int\u2019l J. Pattern Recognition and Artificial Intelligence"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-642-02124-4_16","volume-title":"GbRPR 2009","author":"S. Jouili","year":"2009","unstructured":"Jouili, S., Tabbone, S.: Graph matching using node signatures. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 154\u2013163. Springer, Heidelberg (2009)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.-S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Transactions on Systems, Man and Cybernetics\u00a013, 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Kim, D.H., Yun, I.D., Lee, S.U.: A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover\u2019s Distance. In: 17th International Conference on Pattern Recognition, pp. 48\u201351 (2004)","DOI":"10.1109\/ICPR.2004.1334002"},{"issue":"5","key":"9_CR12","doi-asserted-by":"publisher","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 Trans. Pattern Anal. Mach. Intell.\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A. Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Harris, C., Stephens, M.: A combined corner and edge detection. In: Proceeding of the 4th Alvey Vision Conference, pp. 189\u2013192 (1988)","DOI":"10.5244\/C.2.23"},{"issue":"7","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","volume":"27","author":"M. Gori","year":"2005","unstructured":"Gori, M., Maggini, M., Sarti, L.: Exact and Approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027(7), 1100\u20131111 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"9_CR18","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."},{"key":"9_CR19","unstructured":"Shokoufandeh, A., Dickinson, S.: Applications of Bipartite Matching to Problems in Object Recognition. In: Proceedings of ICCV Workshop on Graph Algorithms and Computer Vision, September 21 (1999)"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/TSMC.1984.6313232","volume":"14","author":"M.A. Eshera","year":"1984","unstructured":"Eshera, M.A., Fu, K.S.: A graph distance measure for image analysis. IEEE Trans. Syst. Man Cybern.\u00a014, 398\u2013408 (1984)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9_CR21","unstructured":"Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-100), Technical report, Columbia Univ. (1996)"},{"issue":"1","key":"9_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","volume":"6","author":"D.R. Wilson","year":"1997","unstructured":"Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. Journal of Artificial Intelligence Research\u00a06(1), 1\u201334 (1997)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Advanced Concepts for Intelligent Vision Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04697-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:17:06Z","timestamp":1739337426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04697-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046964","9783642046971"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04697-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}