{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:43Z","timestamp":1740122863325,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61402026"],"award-info":[{"award-number":["61402026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61370125"],"award-info":[{"award-number":["61370125"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Foundation of the State Key Laboratory of Software Development Environment","award":["SKLSDE- 2015ZX-04"],"award-info":[{"award-number":["SKLSDE- 2015ZX-04"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11042-017-5194-8","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T12:22:49Z","timestamp":1505391769000},"page":"16177-16198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast graph similarity search via hashing and its application on image retrieval"],"prefix":"10.1007","volume":"77","author":[{"given":"Bo","family":"Lang","sequence":"first","affiliation":[]},{"given":"Bo","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xianglong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Boyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"key":"5194_CR1","doi-asserted-by":"crossref","unstructured":"Baeza-Yates R, Valiente G (2000) An image similarity measure based on graph matching. In: Proceedings of the seventh international symposium on string processing and information retrieval, 2000. SPIRE 2000. IEEE, pp 28\u201338","DOI":"10.1109\/SPIRE.2000.878177"},{"key":"5194_CR2","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-79547-6_30","volume":"5008","author":"SA Chatzichristofis","year":"2008","unstructured":"Chatzichristofis SA, Boutalis YS (2008) Cedd: color and edge directivity descriptor: a compact descriptor for image indexing and retrieval. Comput Vision Syst 5008:312\u2013322","journal-title":"Comput Vision Syst"},{"key":"5194_CR3","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W, Lu A (2007) Fg-index: towards verification-free query processing on graph databases. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data. ACM, pp 857\u2013872","DOI":"10.1145\/1247480.1247574"},{"issue":"5","key":"5194_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D Comaniciu","year":"2002","unstructured":"Comaniciu D, Meer P (2002) Mean shift: a robust approach toward feature space analysis. IEEE Trans Pattern Anal 24(5):603\u2013619","journal-title":"IEEE Trans Pattern Anal"},{"key":"5194_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta A, Kumar R, Sarlos T (2011) Fast locality-sensitive hashing. In: ACM SIGKDD International conference on knowledge discovery and data mining. San Diego, CA, USA, August, pp 1073\u20131081","DOI":"10.1145\/2020408.2020578"},{"key":"5194_CR6","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the twentieth annual symposium on computational geometry. ACM, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"key":"5194_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.sigpro.2014.07.017","volume":"112","author":"C Deng","year":"2015","unstructured":"Deng C, Liu X, Mu Y, Li J (2015) Large-scale multi-task image labeling with adaptive relevance discovery and feature hashing. Signal Process 112:137\u2013145","journal-title":"Signal Process"},{"key":"5194_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24088-1_24","volume-title":"Image segmentation using normalized cuts and efficient graph-based segmentation","author":"N Doggaz","year":"2011","unstructured":"Doggaz N, Ferjani I (2011) Image segmentation using normalized cuts and efficient graph-based segmentation. Springer, Berlin"},{"issue":"10","key":"5194_CR9","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/83.951532","volume":"10","author":"J Fan","year":"2001","unstructured":"Fan J, Yau DY, Elmagarmid AK, Aref WG (2001) Automatic image segmentation by integrating color-edge extraction and seeded region growing. IEEE Trans Image Process 10(10):1454\u20131466","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"5194_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"PF Felzenszwalb","year":"2004","unstructured":"Felzenszwalb PF, Huttenlocher DP (2004) Efficient graph-based image segmentation. Int J Comput Vis 59(2):167\u2013181","journal-title":"Int J Comput Vis"},{"key":"5194_CR11","doi-asserted-by":"crossref","unstructured":"Fischer B, Thies CJ, Guld MO, Lehmann TM (2004) Content-based image retrieval by matching hierarchical attributed region adjacency graphs. In: Medical imaging 2004, international society for optics and photonics, pp 598\u2013606","DOI":"10.1117\/12.535294"},{"issue":"1","key":"5194_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X (2010) A survey of graph edit distance. Pattern Anal Applic 13(1):113\u2013129","journal-title":"Pattern Anal Applic"},{"issue":"4","key":"5194_CR13","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2013","unstructured":"Ge T, He K, Ke Q, Sun J (2013) Optimized product quantization. IEEE Trans Pattern Anal 36(4):744\u2013755","journal-title":"IEEE Trans Pattern Anal"},{"key":"5194_CR14","unstructured":"He H, Singh AK (2006) Closure-tree: an index structure for graph queries. In: 22nd international conference on data engineering (ICDE\u201906). IEEE, pp 38\u201338"},{"key":"5194_CR15","doi-asserted-by":"crossref","unstructured":"Ji T, Liu X, Deng C, Huang L, Lang B (2014) Query-adaptive hash code ranking for fast nearest neighbor search. ACM International Conference on Multimedia, pp 1005\u20131008","DOI":"10.1145\/2647868.2655018"},{"key":"5194_CR16","doi-asserted-by":"crossref","unstructured":"Jiang H, Wang H, Philip S Y, Zhou S (2007) Gstring: a novel approach for efficient search in graph databases. In: 2007 IEEE 23rd international conference on data engineering. IEEE, pp 566\u2013575","DOI":"10.1109\/ICDE.2007.367902"},{"key":"5194_CR17","doi-asserted-by":"crossref","unstructured":"Jouili S, Tabbone S (2009) Graph matching based on node signatures. In: International workshop on graph-based representations in pattern recognition. Springer, pp 154\u2013163","DOI":"10.1007\/978-3-642-02124-4_16"},{"issue":"11","key":"5194_CR18","doi-asserted-by":"publisher","first-page":"4054","DOI":"10.1016\/j.patcog.2012.04.016","volume":"45","author":"S Jouili","year":"2012","unstructured":"Jouili S, Tabbone S (2012) Hypergraph-based image retrieval for graph-based representation. Pattern Recogn 45(11):4054\u20134068","journal-title":"Pattern Recogn"},{"key":"5194_CR19","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel HP, Sch\u00f6nauer S (2004) Content-based image retrieval using multiple representations. In: International conference on knowledge-based and intelligent information and engineering systems. Springer, pp 982\u2013988","DOI":"10.1007\/978-3-540-30133-2_130"},{"issue":"1","key":"5194_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch I (2001) Enumerating all connected maximal common subgraphs in two graphs. Theor Comput Sci 250(1):1\u201330","journal-title":"Theor Comput Sci"},{"key":"5194_CR21","unstructured":"Li CY, Hsu CT (2005) Soft region correspondence estimation for graph-theoretic image retrieval using quadratic programming approach. In: 2005 IEEE international conference on multimedia and expo. IEEE, pp 1416\u20131419"},{"issue":"3","key":"5194_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1109\/TMM.2008.917421","volume":"10","author":"CY Li","year":"2008","unstructured":"Li CY, Hsu CT (2008) Image retrieval with relevance feedback based on graph-theoretic region correspondence estimation. IEEE Trans Multimedia 10(3):447\u2013456","journal-title":"IEEE Trans Multimedia"},{"issue":"5","key":"5194_CR23","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/LSP.2017.2665522","volume":"24","author":"Y Li","year":"2017","unstructured":"Li Y, Xu Y, Wang J, Miao Z, Zhang Y (2017) Ms-rmac: Multiscale regional maximum activation of convolutions for image retrieval. IEEE Signal Process Lett 24(5):609\u2013613","journal-title":"IEEE Signal Process Lett"},{"key":"5194_CR24","doi-asserted-by":"crossref","unstructured":"Liu X, He J, Lang B (2013) Reciprocal hash tables for nearest neighbor search. In: AAAI","DOI":"10.1609\/aaai.v27i1.8582"},{"key":"5194_CR25","doi-asserted-by":"crossref","unstructured":"Liu X, He J, Deng C, Lang B (2014) Collaborative hashing. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2139\u20132146","DOI":"10.1109\/CVPR.2014.275"},{"key":"5194_CR26","doi-asserted-by":"crossref","unstructured":"Liu X, Huang L, Deng C, Lu J, Lang B (2015) Multi-view complementary hash tables for nearest neighbor search. IEEE International Conference on Computer Vision, pp 1107\u20131115","DOI":"10.1109\/ICCV.2015.132"},{"key":"5194_CR27","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K (2007) Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd international conference on very large data bases. VLDB Endowment, pp 950\u2013961"},{"issue":"2","key":"5194_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"8","author":"M Mongiovi","year":"2010","unstructured":"Mongiovi M, Di Natale R, Giugno R, Pulvirenti A, Ferro A, Sharan R (2010) Sigma: a set-cover-based inexact graph matching algorithm. J Bioinforma Comput Biol 8(2):199\u2013218","journal-title":"J Bioinforma Comput Biol"},{"issue":"1","key":"5194_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s13735-012-0003-7","volume":"1","author":"Y Mu","year":"2012","unstructured":"Mu Y, Chen X, Liu X, Chua T, Yan S (2012) Multimedia semantics-aware query-adaptive hashing with bits reconfigurability. Intern J Multimedia Inform Retrieval 1(1):59\u201370","journal-title":"Intern J Multimedia Inform Retrieval"},{"key":"5194_CR30","unstructured":"Niepert M, Ahmed M, Kutzkov K (2016) Learning convolutional neural networks for graphs. International Conference on Machine Learning, pp 2014\u20132023"},{"key":"5194_CR31","unstructured":"Regneri M (2007) Finding all cliques of an undirected graph. In: Seminar current trends in IE WS jun"},{"key":"5194_CR32","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2008) Iam graph database repository for graph based pattern recognition and machine learning. In: Joint IAPR international workshops on statistical techniques in pattern recognition (SPR) and structural and syntactic pattern recognition (SSPR). Springer, pp 287\u2013297","DOI":"10.1007\/978-3-540-89689-0_33"},{"issue":"7","key":"5194_CR33","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(7):950\u2013959","journal-title":"Image Vis Comput"},{"issue":"6","key":"5194_CR34","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1142\/S021800140900748X","volume":"23","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Graph classification based on vector space embedding. Int J Pattern Recognit Artif Intell 23(6):1053\u20131081","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"5194_CR35","unstructured":"Shervashidze N, Borgwardt K M (2009) Fast subtree kernels on graphs. In: Advances in neural information processing systems, pp 1660\u20131668"},{"key":"5194_CR36","doi-asserted-by":"crossref","unstructured":"Tabei Y, Tsuda K (2011) Kernel-based similarity search in massive graph databases with wavelet trees. In: SDM. SIAM, pp 154\u2013163","DOI":"10.1137\/1.9781611972818.14"},{"issue":"3","key":"5194_CR37","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale N, Watson IA, Karypis G (2008) Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl Inf Syst 14(3):347\u2013375","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"5194_CR38","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2012","unstructured":"Wang G, Wang B, Yang X, Yu G (2012) Efficiently indexing large sparse graphs for similarity search. IEEE Trans Knowl Data Eng 24(3):440\u2013451","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5194_CR39","doi-asserted-by":"crossref","unstructured":"Wang X, Ding X, Tung AK, Ying S, Jin H (2012) An efficient graph indexing method. In: 2012 IEEE 28th international conference on data engineering. IEEE, pp 210\u2013221","DOI":"10.1109\/ICDE.2012.28"},{"issue":"suppl 2","key":"5194_CR40","doi-asserted-by":"publisher","first-page":"W623","DOI":"10.1093\/nar\/gkp456","volume":"37","author":"Y Wang","year":"2009","unstructured":"Wang Y, Xiao J, Suzek TO, Zhang J, Wang J, Bryant SH (2009) Pubchem: a public information system for analyzing bioactivities of small molecules. Nucleic Acids Res 37(suppl 2):W623\u2013W633","journal-title":"Nucleic Acids Res"},{"key":"5194_CR41","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data. ACM, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"5194_CR42","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2005) Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data. ACM, pp 766\u2013777","DOI":"10.1145\/1066157.1066244"},{"key":"5194_CR43","doi-asserted-by":"crossref","unstructured":"Zhang B, Liu X, Lang B (2015) Fast graph similarity search via locality sensitive hashing. In: Pacific rim conference on multimedia. Springer, pp 623\u2013633","DOI":"10.1007\/978-3-319-24075-6_60"},{"key":"5194_CR44","unstructured":"Zhao P, Yu JX, Yu P S (2007) Graph indexing: tree + delta <= graph. In: Proceedings of the 33rd international conference on very large data bases. VLDB Endowment, pp 938\u2013949"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-017-5194-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-017-5194-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-017-5194-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T21:08:35Z","timestamp":1659474515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-017-5194-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":44,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["5194"],"URL":"https:\/\/doi.org\/10.1007\/s11042-017-5194-8","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2017,9,14]]},"assertion":[{"value":"1 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}