{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:40:10Z","timestamp":1746157210537,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T00:00:00Z","timestamp":1395273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Machine Vision and Applications"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s00138-014-0598-1","type":"journal-article","created":{"date-parts":[[2014,3,19]],"date-time":"2014-03-19T05:47:39Z","timestamp":1395208059000},"page":"823-844","source":"Crossref","is-referenced-by-count":3,"title":["Attributed hypergraph matching on a Riemannian manifold"],"prefix":"10.1007","volume":"25","author":[{"given":"J. M.","family":"Wang","sequence":"first","affiliation":[]},{"given":"S. W.","family":"Chen","sequence":"additional","affiliation":[]},{"given":"C. S.","family":"Fuh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,20]]},"reference":[{"key":"598_CR1","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, USA (1995)"},{"key":"598_CR2","volume-title":"Artificial intelligence\u2014a modern approach","author":"S Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial intelligence\u2014a modern approach, 2nd edn. Prentice Hall, New Jersey (2003)","edition":"2"},{"issue":"3","key":"598_CR3","doi-asserted-by":"crossref","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. J. Pattern Recognit. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"598_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-1-4419-6045-0_7","volume-title":"Exact and inexact graph matching: methodology and applications. Managing and mining graph data","author":"K Riesen","year":"2010","unstructured":"Riesen, K., Jiang, X., Bunke, H.: Exact and inexact graph matching: methodology and applications. Managing and mining graph data, pp. 217\u2013247. Springer, New York (2010)"},{"issue":"20","key":"598_CR5","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (Sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal. Mach. Intell. 26(20), 1367\u20131372 (2004)","journal-title":"IEEE Trans Pattern Anal. Mach. Intell."},{"issue":"4","key":"598_CR6","first-page":"252","volume":"64","author":"DM Campbell","year":"1991","unstructured":"Campbell, D.M., Radford, D.: Tree isomorphism algorithms: speed vs. clarity. Math Assoc. Am. 64(4), 252\u2013261 (1991)","journal-title":"Math Assoc. Am."},{"key":"598_CR7","doi-asserted-by":"crossref","unstructured":"Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computer, pp. 236\u2013243. ACM, New York (1980)","DOI":"10.1145\/800141.804671"},{"key":"598_CR8","first-page":"45","volume":"30","author":"BD McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congr. Numerantium 30, 45\u201387 (1981)","journal-title":"Congr. Numerantium"},{"issue":"1","key":"598_CR9","doi-asserted-by":"crossref","first-page":"l31","DOI":"10.1145\/321921.321925","volume":"13","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isoorphism. J. Assoc. Comput. Mach. 13(1), l31\u201342 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"598_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2005","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discret. Math. 18(2), 219\u2013225 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"1998","key":"598_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0033223","volume":"1451","author":"H Bunke","year":"1998","unstructured":"Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. Lect. Notes Comput. Sci. 1451(1998), 1\u201314 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"key":"598_CR12","unstructured":"Abdulkader, A.M.: Parallel algorithm for labeled graph matching. PhD Thesis, Colorado School of Mines (1998)"},{"key":"598_CR13","unstructured":"Shapiro L.G., Haralick R.M.: Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell. 3(5), 504\u2013519 (1981)"},{"key":"598_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.neucom.2004.01.189","volume":"63","author":"BJ Jain","year":"2005","unstructured":"Jain, B.J., Wysotzki, F.: Solving inexact graph isomorphism problems using neural networks. Neurocomputing 63, 45\u201367 (2005)","journal-title":"Neurocomputing"},{"issue":"6","key":"598_CR15","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/34.601251","volume":"19","author":"RC Wilson","year":"1997","unstructured":"Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19(6), 634\u2013648 (1997)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR16","doi-asserted-by":"crossref","unstructured":"Cross, A.D.J., Wilson, R.C., Hancock, E.R.: Inexact graph matching using genetic search. Pattern Recognit. 30(6), 953\u2013970 (1997)","DOI":"10.1016\/S0031-3203(96)00123-9"},{"key":"598_CR17","first-page":"127","volume-title":"Chapter 4: The BAM and the Hopfield memory. Neural networks algorithms, applications, and programming techniques","author":"JA Freeman","year":"1991","unstructured":"Freeman, J.A., Skapura, D.M.: Chapter 4: The BAM and the Hopfield memory. Neural networks algorithms, applications, and programming techniques, pp. 127\u2013168. Addison Wesley, USA (1991)"},{"issue":"1","key":"598_CR18","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/j.imavis.2011.07.008","volume":"29","author":"J Lebrun","year":"2011","unstructured":"Lebrun, J., Gosselin, P.H., Philipp-Foliguet, S.: Inexact graph matching based on kernels for object retrieval in image databases. Image Vis. Comput. 29(1), 716\u2013729 (2011)","journal-title":"Image Vis. Comput."},{"issue":"12","key":"598_CR19","doi-asserted-by":"crossref","first-page":"2205","DOI":"10.1109\/TPAMI.2010.51","volume":"32","author":"M Chertok","year":"2010","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2205\u20132215 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR20","first-page":"131","volume":"91","author":"H Bunke","year":"2008","unstructured":"Bunke, H., Dickinson, P., Karetzl, M., Neuhaus, M., Stettler, M.: Matching of hypergraphs\u2014algorithms, applications, and experiments. Appl. Pattern Recognit. 91, 131\u2013154 (2008)","journal-title":"Appl. Pattern Recognit."},{"key":"598_CR21","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138. Alaska (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"issue":"12","key":"598_CR22","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I.S., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(12), 2383\u20132395 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR23","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"SMC\u20139","author":"WH Tsai","year":"1979","unstructured":"Tsai, W.H., Fu, K.S.: Error-correcting isomorphism for attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. SMC\u20139, 757\u2013768 (1979)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"7","key":"598_CR24","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/TPAMI.2002.1017624","volume":"24","author":"MA Wyk van","year":"2002","unstructured":"van Wyk, M.A., Durrani, T.S., van Wyj, B.J.: A RKHS interpolator-base graph matching algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 988\u2013995 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR25","unstructured":"van Wyk M.A., Clark J.: An algorithm for approximate least-squares attributed graph matching. In: Problems in applied mathematics and computational intelligence, pp. 67\u201372 (2001)"},{"issue":"1","key":"598_CR26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/34.273716","volume":"16","author":"K Ho","year":"1994","unstructured":"Ho, K., Hull, J.J., Srihari, S.N.: Decision combination in multiple classifier systems. IEEE Trans. Pattern Anal. Mach. Intell. 16(1), 66\u201375 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR27","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment problems. Society for Industrial and Applied Mathematics, USA (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"598_CR28","first-page":"1482","volume":"2","author":"M Leordeanu","year":"2005","unstructured":"Leordeanu, M., Hebert, H.: A spectral technique for correspondence problems using pairwise constraints. IEEE Int. Conf. Comput. Vis. 2, 1482\u20131489 (2005)","journal-title":"IEEE Int. Conf. Comput. Vis."},{"key":"598_CR29","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Zanfir, A., Sminchisescu, C.: Semi-supervised learning and optimization for hypergraph matching. In: IEEE International Conference on Computer Vision, pp. 2274\u20132281. Barcelona (2011)","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"598_CR30","doi-asserted-by":"crossref","unstructured":"Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: European Conference on Computer Vision, pp. 1633\u20131640. Crete, Greece (2010)","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"598_CR31","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: IEEE Conference on Pattern Recognition, pp. 1633\u20131640. Providence, RI (2011)","DOI":"10.1109\/CVPR.2011.5995387"},{"issue":"4","key":"598_CR32","doi-asserted-by":"crossref","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. 18(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"598_CR33","unstructured":"Luo, B., Hancock, E.: Structural graph matching using the EM algorithm and singular value decomposition. In: The Asian Conference on Computer Vision, pp. 1\u20136. Melbourne (2002)"},{"issue":"5","key":"598_CR34","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 Trans. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"598_CR35","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"598_CR36","doi-asserted-by":"crossref","unstructured":"Lu, J., Caelli, T., Yang, J.: A graph decomposition approach to least squares attributed graph matching. International Conference on Pattern Recognition, vol. 2, pp. 471\u2013474. Cambridge (2004)","DOI":"10.1109\/ICPR.2004.1334265"},{"key":"598_CR37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"issue":"8","key":"598_CR38","doi-asserted-by":"crossref","first-page":"1580","DOI":"10.1587\/transinf.E92.D.1580","volume":"E92\u2013D","author":"KJ Zheng","year":"2009","unstructured":"Zheng, K.J., Peng, Jg, Ying, S.H.: A new approach to weighted graph matching. IEICE Trans. Inf. Syst. E92\u2013D(8), 1580\u20131583 (2009)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"598_CR39","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0167-7152(95)00125-5","volume":"28","author":"LY Deng","year":"1996","unstructured":"Deng, L.Y., Lin, D.K.J., Wang, J.: A measurement of multi-factor orthogonality. Stat. Probab. Lett. 28, 203\u2013209 (1996)","journal-title":"Stat. Probab. Lett."},{"key":"598_CR40","doi-asserted-by":"crossref","unstructured":"Wang, J.M., Fuh, C.S., Chen, S.W.: Video stabilization for a hand-held camera based on 3D motion model. In: IEEE International Conference on Image Processing, pp. 3477\u20133480. Cairo (2009)","DOI":"10.1109\/ICIP.2009.5413831"}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-014-0598-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00138-014-0598-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-014-0598-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:02:39Z","timestamp":1746154959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00138-014-0598-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,20]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["598"],"URL":"https:\/\/doi.org\/10.1007\/s00138-014-0598-1","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"type":"print","value":"0932-8092"},{"type":"electronic","value":"1432-1769"}],"subject":[],"published":{"date-parts":[[2014,3,20]]}}}