{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:49:58Z","timestamp":1648748998994},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Image Video Proc."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13640-019-0407-x","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:04:43Z","timestamp":1548767083000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph matching using conformal module"],"prefix":"10.1186","volume":"2019","author":[{"given":"Jialing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"407_CR1","first-page":"127","volume":"38","author":"F Zhou","year":"2012","unstructured":"F. Zhou, F. De la Torre, Factorized graph matching. IEEE Conference on Computer Vision and Pattern Recognition. 38, 127\u2013134 (2012)","journal-title":"IEEE Conference on Computer Vision and Pattern Recognition."},{"key":"407_CR2","unstructured":"O. Duchenne, A. Joulin, J. Ponce, A graph-matching kernel for object categorization. International Conference on Computer Vision (2011), pp. 1792\u20131799"},{"key":"407_CR3","doi-asserted-by":"crossref","unstructured":"H. Jiang, S. X. Yu, D. R. Martin, Linear scale and rotation invariant matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(7), 1339\u20131355 (2011)","DOI":"10.1109\/TPAMI.2010.212"},{"key":"407_CR4","doi-asserted-by":"crossref","unstructured":"J. Hays, M. Leordeanu, A. A. Efros, Y. Liu, Discovering texture regularity as a higher-order correspondence problem. European Conference on Computer Vision. (Springer, Berlin, Heidelberg, 2006), pp. 522\u2013535.","DOI":"10.1007\/11744047_40"},{"key":"407_CR5","doi-asserted-by":"crossref","unstructured":"U. Gaur, Y. Zhu, B. Song, A. Roychowdhury, A \"string of feature graphs\" model for recognition of complex activities in natural videos. IEEE International Conference on Computer Vision (ICCV), (IEEE, 2011), pp. 2595-2602","DOI":"10.1109\/ICCV.2011.6126548"},{"key":"407_CR6","unstructured":"W. Brendel, S. Todorovic, Learning spatiotemporal graphs of human activities. IEEE International Conference on Computer Vision (2011), pp. 778\u2013785"},{"issue":"03","key":"407_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"D. Conte, P. Foggia, C. Sansone, M. Vento, Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(03), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"407_CR8","unstructured":"F. Zhou, F. De la Torre, Deformable graph matching.\u00a0IEEE Conference on Computer Vision and Pattern Recognition (2013), pp. 2922\u20132929"},{"issue":"6","key":"407_CR9","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TVCG.2010.200","volume":"16","author":"W Zeng","year":"2010","unstructured":"W. Zeng, J. Marino, K. Chaitanya Gurijala, X. Gu, A. Kaufman, Supine and prone colon registration using quasi-conformal mapping. IEEE Trans. Vis. Comput. Graph. 16(6), 1348\u20131357 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"407_CR10","doi-asserted-by":"crossref","unstructured":"W. Zeng, Y. Zeng, Y. Wang, X. Yin, X. Gu, D. Samaras, 3d non-rigid surface matching and registration based on holomorphic differentials. European Conference on Computer Vision (Springer, Marseille, France, October 12\u201318, 2008), pp. 1\u201314","DOI":"10.1007\/978-3-540-88690-7_1"},{"issue":"7","key":"407_CR11","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/TPAMI.2013.215","volume":"36","author":"L Lui","year":"2014","unstructured":"L. Lui, W. Zeng, S. Yau, X. Gu, Shape analysis of planar multiplyconnected objects using conformal welding. IEEE Trans. Pattern Anal. Mach. Intell. 36(7), 1384\u20131401 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"407_CR12","unstructured":"X. D. Gu, S. T. Yau,\u00a0Computational conformal geometry. (Somerville, Mass, USA: International Press, 2008)"},{"key":"407_CR13","doi-asserted-by":"crossref","unstructured":"J. R. Ullmann, An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","DOI":"10.1145\/321921.321925"},{"key":"407_CR14","unstructured":"L. P. Cordella, P. Foggia, C. Sansone, F. Tortorella, M. Vento, Graph matching: a fast algorithm and its evaluation. International Conference on Pattern Recognition. 2, 1582\u20131584 (1998)"},{"key":"407_CR15","unstructured":"L. P. Cordella, P. Foggia, C. Sansone, M. Vento, Fast graph matching for detecting cad image components. 15th International Conference on Pattern Recognition. 2, 1034\u20131037 (2000)"},{"key":"407_CR16","doi-asserted-by":"crossref","unstructured":"B. D. McKay, Practical graph isomorphism[J]. J. Symb. Comput. 60(1), 94\u2013112 (2014)","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"407_CR17","unstructured":"C. Irniger, H. Bunke, Graph matching: filtering large databases of graphs using decision trees[C]. Graph-Based Representations in Pattern Recognition (2001), pp. 239-249"},{"key":"407_CR18","doi-asserted-by":"crossref","unstructured":"M. Lazarescu, H. Bunke, S. Venkatesh, Graph matching: fast candidate elimination using machine learning techniques. Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR). (Springer, Berlin, Heidelberg, 2000), pp. 236-245","DOI":"10.1007\/3-540-44522-6_25"},{"key":"407_CR19","doi-asserted-by":"crossref","unstructured":"E. M. Loiola, N. M. M. de Abreu, P.O. Boaventura-Netto, P. Hahn, T. Querido, A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","DOI":"10.1016\/j.ejor.2005.09.032"},{"issue":"5","key":"407_CR20","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. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"407_CR21","unstructured":"L. S. Shapiro, J. Michael Brady, Feature-based correspondence: an eigenvector approach. Image Vis. Comput. 10(5), 283\u2013288 (1992)"},{"issue":"4","key":"407_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TPAMI.2004.1265866","volume":"26","author":"T Caelli","year":"2004","unstructured":"T. Caelli, S. Kosinov, An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 26(4), 515\u2013519 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"407_CR23","first-page":"1482","volume":"2","author":"M Leordeanu","year":"2005","unstructured":"M. Leordeanu, M. Hebert, A spectral technique for correspondence problems using pairwise constraints. Tenth IEEE International Conference on Computer Vision. 2, 1482\u20131489 (2005)","journal-title":"Tenth IEEE International Conference on Computer Vision."},{"key":"407_CR24","doi-asserted-by":"crossref","unstructured":"H. Qiu, E. R. Hancock, Graph matching and clustering using spectral partitions. Pattern Recogn. 39(1), 22\u201334 (2006)","DOI":"10.1016\/j.patcog.2005.06.014"},{"issue":"4","key":"407_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"S. Gold, A. Rangarajan, A graduated assignment algorithm for graph matching[J]. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"407_CR26","doi-asserted-by":"crossref","unstructured":"M. Zaslavskiy, F. Bach, J. P. Vert, A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2227\u20132242 (2009)","DOI":"10.1109\/TPAMI.2008.245"},{"key":"407_CR27","doi-asserted-by":"crossref","unstructured":"R. Zass, A. Shashua, Probabilistic graph and hypergraph matching. IEEE Conference on Computer Vision and Pattern Recognition(CVPR), (IEEE, 2008), pp. 1\u20138","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"407_CR28","doi-asserted-by":"crossref","unstructured":"M. Chertok, Y. Keller, Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence. 32(12), 2205-2215(2010)","DOI":"10.1109\/TPAMI.2010.51"},{"key":"407_CR29","doi-asserted-by":"crossref","unstructured":"O. Duchenne, F. Bach, I. S. Kweon, J. Ponse, A tensor-based algorithm for high-order graph matching. IEEE transactions on pattern analysis and machine intelligence. 33(12), 2383-2395(2011)","DOI":"10.1109\/TPAMI.2011.110"},{"issue":"1\u20132","key":"407_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02761693","volume":"84","author":"O Schramm","year":"1993","unstructured":"O. Schramm, Square tilings with prescribed combinatorics[J]. Israel Journal of Mathematics. 84(1\u20132), 97\u2013118 (1993)","journal-title":"Israel Journal of Mathematics."},{"key":"407_CR31","unstructured":"G. Guennebaud, B. Jacob, et al., Eigen v3. \n                    http:\/\/eigen.tuxfamily.org\/index.php?title=Main_Page\n                    \n                   (2010)"}],"container-title":["EURASIP Journal on Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13640-019-0407-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13640-019-0407-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13640-019-0407-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T01:31:32Z","timestamp":1580261492000},"score":1,"resource":{"primary":{"URL":"https:\/\/jivp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13640-019-0407-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["407"],"URL":"https:\/\/doi.org\/10.1186\/s13640-019-0407-x","relation":{},"ISSN":["1687-5281"],"issn-type":[{"value":"1687-5281","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"25 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Jialing Zhang was born in Yunnan, P.R. China, in 1981. She received her Master of Science degree from Yunnan Normal University in 2006. She has been a faculty in Kunming University of Science and Technology since 2006. Her main research interests focus on Computational Geometry-Theory and Applications.Kun Qian was born in Yunnan, P.R. China, in 1982. He received his M.S. degree in Mechanical and Electronic Engineering from Xidian University in China in 2009. He was a visiting scholar at the State University of New York at Stony Brook and University of Louisiana at Lafayette, US from January 2015 to January 2016. He is currently pursuing his Ph.D. degree in Kunming University of Science and Technology in China. His research interests are in the area of computational geometry, computer graphics and computer vision.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Authors\u2019 information"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"26"}}