乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:16:28Z","timestamp":1740111388400,"version":"3.37.3"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472275","61170239","61303208","61502337","61772359"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1016\/j.patrec.2018.07.005","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T13:49:53Z","timestamp":1530625793000},"page":"362-369","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Subgraph learning for graph matching"],"prefix":"10.1016","volume":"130","author":[{"given":"Weizhi","family":"Nie","sequence":"first","affiliation":[]},{"given":"Hai","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Anan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zonghui","family":"Deng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-204X","authenticated-orcid":false,"given":"Yuting","family":"Su","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2018.07.005_bib0001","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ins.2015.04.042","article-title":"Graph-based characteristic view set extraction and matching for 3d model retrieval","volume":"320","author":"Liu","year":"2015","journal-title":"Inf. Sci. (Ny)"},{"key":"10.1016\/j.patrec.2018.07.005_bib0002","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"4503","article-title":"Clique-graph matching by preserving global & local structure","author":"Nie","year":"2015"},{"key":"10.1016\/j.patrec.2018.07.005_bib0003","unstructured":"W.E. L. Grimson, D.P. Huttenlocher, et\u00a0al., Object recognition by computer: the role of geometric constraints (2015)."},{"key":"10.1016\/j.patrec.2018.07.005_bib0004","series-title":"Experimental Robotics","first-page":"387","article-title":"Unsupervised feature learning for rgb-d based object recognition","author":"Bo","year":"2013"},{"issue":"9","key":"10.1016\/j.patrec.2018.07.005_bib0005","doi-asserted-by":"crossref","first-page":"1834","DOI":"10.1109\/TPAMI.2014.2388226","article-title":"Object tracking benchmark","volume":"37","author":"Wu","year":"2015","journal-title":"Patt. Anal. Mach. Intell. IEEE Trans."},{"issue":"1","key":"10.1016\/j.patrec.2018.07.005_bib0006","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/TIP.2012.2202677","article-title":"Online object tracking with sparse prototypes","volume":"22","author":"Wang","year":"2013","journal-title":"Image Proces. IEEE Trans."},{"issue":"4","key":"10.1016\/j.patrec.2018.07.005_bib0007","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1016\/j.patcog.2014.10.033","article-title":"Interactive graph-matching using active query strategies","volume":"48","author":"Serratosa","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patrec.2018.07.005_bib0008","series-title":"ECCV","first-page":"492","article-title":"Reweighted random walks for graph matching","author":"Cho","year":"2010"},{"key":"10.1016\/j.patrec.2018.07.005_bib0009","series-title":"ICCV","first-page":"1482","article-title":"A spectral technique for correspondence problems using pairwise constraints","author":"Leordeanu","year":"2005"},{"key":"10.1016\/j.patrec.2018.07.005_bib0010","series-title":"Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7\u201310 December 2009, Vancouver, British Columbia, Canada.","first-page":"1114","article-title":"An integer projected fixed point method for graph matching and MAP inference","author":"Leordeanu","year":"2009"},{"issue":"1","key":"10.1016\/j.patrec.2018.07.005_bib0011","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TPAMI.2015.2424894","article-title":"Graph matching: relax at your own risk","volume":"38","author":"Lyzinski","year":"2016","journal-title":"Patt. Anal. Mach. Intell. IEEE Trans."},{"key":"10.1016\/j.patrec.2018.07.005_bib0012","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","article-title":"Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences","volume":"56","author":"Cort\u00e9s","year":"2015","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"10.1016\/j.patrec.2018.07.005_bib0013","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","article-title":"A probabilistic approach to spectral graph matching","volume":"35","author":"Egozi","year":"2013","journal-title":"Patt. Anal. Mach. Intell. IEEE Trans."},{"issue":"5","key":"10.1016\/j.patrec.2018.07.005_bib0014","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1109\/TCYB.2016.2539546","article-title":"Bi-level semantic representation analysis for multimedia event detection","volume":"47","author":"Chang","year":"2017","journal-title":"IEEE Trans. Cybern."},{"issue":"8","key":"10.1016\/j.patrec.2018.07.005_bib0015","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/TPAMI.2016.2608901","article-title":"Semantic pooling for complex event analysis in untrimmed videos","volume":"39","author":"Chang","year":"2017","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"10","key":"10.1016\/j.patrec.2018.07.005_bib0016","doi-asserted-by":"crossref","first-page":"2294","DOI":"10.1109\/TNNLS.2016.2582746","article-title":"Semisupervised feature analysis by mining correlations among multiple tasks","volume":"28","author":"Chang","year":"2017","journal-title":"IEEE Trans. Neural Netw. Learn Syst."},{"issue":"7","key":"10.1016\/j.patrec.2018.07.005_bib0017","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","article-title":"Exact and approximate graph matching using random walks","volume":"27","author":"Gori","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10.1016\/j.patrec.2018.07.005_bib0018","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/34.491619","article-title":"A graduated assignment algorithm for graph matching","volume":"18","author":"Gold","year":"1996","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"10.1016\/j.patrec.2018.07.005_bib0019","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/TPAMI.2004.95","article-title":"A pocs-based graph matching algorithm","volume":"26","author":"van Wyk","year":"2004","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"10.1016\/j.patrec.2018.07.005_bib0020","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","article-title":"A path following algorithm for the graph matching problem","volume":"31","author":"Zaslavskiy","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patrec.2018.07.005_bib0021","series-title":"ICCV","first-page":"1329","article-title":"Learning graph matching: Oriented to category modeling from cluttered scenes","author":"Zhang","year":"2013"},{"key":"10.1016\/j.patrec.2018.07.005_bib0022","series-title":"ICCV","first-page":"1649","article-title":"Joint optimization for consistent multiple graph matching","author":"Yan","year":"2013"},{"key":"10.1016\/j.patrec.2018.07.005_bib0023","series-title":"ICCV","first-page":"3424","article-title":"Improving graph matching via density maximization","author":"Wang","year":"2013"},{"issue":"9","key":"10.1016\/j.patrec.2018.07.005_bib0024","first-page":"4290","article-title":"3-D object retrieval and recognition with hypergraph analysis","volume":"21","author":"Gao","year":"2012","journal-title":"TIP"},{"key":"10.1016\/j.patrec.2018.07.005_bib0025","series-title":"CVPR","article-title":"Probabilistic graph and hypergraph matching","author":"Zass","year":"2008"},{"issue":"12","key":"10.1016\/j.patrec.2018.07.005_bib0026","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","article-title":"A tensor-based algorithm for high-order graph matching","volume":"33","author":"Duchenne","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patrec.2018.07.005_bib0027","series-title":"CVPR","first-page":"1633","article-title":"Hyper-graph matching via reweighted random walks","author":"Lee","year":"2011"},{"key":"10.1016\/j.patrec.2018.07.005_bib0028","series-title":"Computer Vision and Pattern Recognition (CVPR), 2015 IEEE Conference on","first-page":"5070","article-title":"Subgraph matching using compactness prior for robust feature correspondence","author":"Suh","year":"2015"},{"issue":"9","key":"10.1016\/j.patrec.2018.07.005_bib0029","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1109\/TPAMI.2013.16","article-title":"Fast detection of dense subgraphs with iterative shrinking and expansion","volume":"35","author":"Liu","year":"2013","journal-title":"Patt. Anal. Mach. Intell. IEEE Trans."},{"issue":"2","key":"10.1016\/j.patrec.2018.07.005_bib0030","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.patcog.2014.05.018","article-title":"Efficient subgraph matching using topological node feature constraints","volume":"48","author":"Dahm","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patrec.2018.07.005_bib0031","series-title":"CVPR","first-page":"127","article-title":"Factorized graph matching","author":"Zhou","year":"2012"},{"key":"10.1016\/j.patrec.2018.07.005_bib0032","series-title":"NIPS","first-page":"313","article-title":"Balanced graph matching","author":"Cour","year":"2006"},{"issue":"4","key":"10.1016\/j.patrec.2018.07.005_bib0033","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1109\/TIP.2011.2170081","article-title":"Camera constraint-free view-based 3-d object retrieval","volume":"21","author":"Gao","year":"2012","journal-title":"Image Process. IEEE Trans."},{"issue":"1","key":"10.1016\/j.patrec.2018.07.005_bib0034","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TMM.2006.886359","article-title":"A bayesian 3-d search engine using adaptive views clustering","volume":"9","author":"Ansary","year":"2007","journal-title":"Multim. IEEE Trans."},{"key":"10.1016\/j.patrec.2018.07.005_bib0035","series-title":"ACM MM","first-page":"897","article-title":"View-based 3d object retrieval by bipartite graph matching","author":"Wen","year":"2012"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865518302897?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865518302897?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T13:45:43Z","timestamp":1581342343000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865518302897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":35,"alternative-id":["S0167865518302897"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2018.07.005","relation":{},"ISSN":["0167-8655"],"issn-type":[{"type":"print","value":"0167-8655"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Subgraph learning for graph matching","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2018.07.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}