{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:17:28Z","timestamp":1742959048908,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021237"},{"type":"electronic","value":"9783642021244"}],"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-02124-4_16","type":"book-chapter","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T03:48:05Z","timestamp":1247024885000},"page":"154-163","source":"Crossref","is-referenced-by-count":16,"title":["Graph Matching Based on Node Signatures"],"prefix":"10.1007","author":[{"given":"Salim","family":"Jouili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Tabbone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"16_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":"3","key":"16_CR2","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. on Pattern Analysis and Machine Intelligence\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"16_CR3","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. on Pattern Analysis and Machine Intelligence\u00a010(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters\u00a019, 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"issue":"11-13","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0167-8655(99)00094-X","volume":"20","author":"H. Bunke","year":"1999","unstructured":"Bunke, H., Munger, A., Jiang, X.: Combinatorial Search vs. Genetic Algorithms: A Case Study Based on the Generalized Median Graph Problem. Pattern Recognition Letters\u00a020(11-13), 1271\u20131279 (1999)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR6","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"},{"issue":"4","key":"16_CR7","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. on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR8","unstructured":"Shokoufandeh, A., Dickinson, S.: Applications of Bipartite Matching to Problems in Object Recognition. In: Proceedings, ICCV Workshop on Graph Algorithms and Computer Vision, September 21 (1999)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45129-3_6","volume-title":"Visual Form 2001","author":"A. Shokoufandeh","year":"2001","unstructured":"Shokoufandeh, A., Dickinson, S.: A unified framework for indexing and matching hierarchical shape structures. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 67\u201384. Springer, Heidelberg (2001)"},{"key":"16_CR10","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":"16_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-540-68020-8_6","volume":"52","author":"S. Sorlin","year":"2007","unstructured":"Sorlin, S., Solnon, C., Jolion, J.M.: A Generic Multivalent Graph Distance Measure Based on Multivalent Matchings. Applied Graph Theory in Computer Vision and Pattern Recognition\u00a052, 151\u2013181 (2007)","journal-title":"Applied Graph Theory in Computer Vision and Pattern Recognition"},{"issue":"4","key":"16_CR12","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":"16_CR13","doi-asserted-by":"crossref","unstructured":"Sanfeliu, A., Fu, K.S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Trans. Systems, Man, and Cybernetics\u00a013(353-362) (1983)","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"16_CR14","unstructured":"Apostolos, N.P., Yannis, M.: Structure-Based Similarity Search with Graph Histograms. In: Proc. of the 10th International Workshop on Database & Expert Systems Applications (1999)"},{"issue":"7","key":"16_CR15","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. on Pattern Analysis and Machine Intelligence\u00a027(7), 1100\u20131111 (2005)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Chung, R.K.: FAN, Spectral Graph Theory. AMS Publications (1997)","DOI":"10.1090\/cbms\/092"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/3477.956043","volume":"31","author":"L. Xu","year":"2001","unstructured":"Xu, L., King, I.: A PCA approach for fast retrieval of structural patterns in attributed graphs. IEEE Trans. Systems, Man, and Cybernetics\u00a031(5), 812\u2013817 (2001)","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"issue":"10","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo","year":"2001","unstructured":"Luo, B., Hancock, E.R.: Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a023(10), 1120\u20131136 (2001)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"16_CR19","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"},{"key":"16_CR20","unstructured":"Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-100), technical report, Columbia Univ. (1996)"},{"key":"16_CR21","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":"16_CR22","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"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Harris, C., Stephens, M.: A combined corner and edge detection. In: Proc. 4th Alvey Vision Conf., pp. 189\u2013192 (1988)","DOI":"10.5244\/C.2.23"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Computing in Euclidean Geometry, pp. 193\u2013233 (1992)","DOI":"10.1142\/9789814355858_0006"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"C-20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and describing Gestalt clusters. IEEE Trans. on Computers\u00a0C-20, 68\u201386 (1971)","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR26","first-page":"459","volume-title":"Advances in Neural Information Processing Systems (NIPS 7)","author":"T. Hofmann","year":"1995","unstructured":"Hofmann, T., Buhmann, J.M.: Multidimensional Scaling and Data Clustering. In: Advances in Neural Information Processing Systems (NIPS 7), pp. 459\u2013466. Morgan Kaufmann Publishers, San Francisco (1995)"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association\u00a066, 846\u2013850 (1971)","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"16_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01969727408546059","volume":"4","author":"J. Dunn","year":"1974","unstructured":"Dunn, J.: Well separated clusters and optimal fuzzy partitions. Journal of Cybernetics\u00a04(1), 95\u2013104 (1974)","journal-title":"Journal of Cybernetics"},{"key":"16_CR29","unstructured":"Carnegie Mellon University face expression database, http:\/\/amp.ece.cmu.edu\/downloads.htm"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02124-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T04:53:26Z","timestamp":1558414406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02124-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021237","9783642021244"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02124-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}