{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:21:42Z","timestamp":1730254902651,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T00:00:00Z","timestamp":1661040000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8,21]]},"DOI":"10.1109\/icpr56361.2022.9956187","type":"proceedings-article","created":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T19:34:13Z","timestamp":1669750453000},"page":"699-705","source":"Crossref","is-referenced-by-count":0,"title":["A Learning Method for Feature Correspondence with Outliers"],"prefix":"10.1109","author":[{"given":"Xu","family":"Yang","sequence":"first","affiliation":[{"name":"Institute of Automation of Chinese Academy of Sciences,State Key Laboratory of Management and Control for Complex Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shao-Feng","family":"Zeng","sequence":"additional","affiliation":[{"name":"Institute of Automation of Chinese Academy of Sciences,State Key Laboratory of Management and Control for Complex Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Han","sequence":"additional","affiliation":[{"name":"Institute of Automation of Chinese Academy of Sciences,State Key Laboratory of Management and Control for Complex Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Chen","family":"Lu","sequence":"additional","affiliation":[{"name":"Institute of Automation of Chinese Academy of Sciences,State Key Laboratory of Management and Control for Complex Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Yong","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Automation of Chinese Academy of Sciences,State Key Laboratory of Management and Control for Complex Systems"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3078053"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00759"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2018.00060"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"ref14","first-page":"6000","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Int’l Conf Neural Information Processing Systems"},{"key":"ref15","first-page":"hpl?2012","article-title":"On minimum-cost assignments in unbalanced bipartite graphs","author":"ramshaw","year":"2012","journal-title":"HP Lab Technical Report"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref17","first-page":"2162","article-title":"An algorithm for finding the most similar given sized subgraphs in two weighted graphs","volume":"29","author":"yang","year":"2018","journal-title":"IEEE Trans Neural Networks and Learning Systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2697968"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref4","first-page":"1114","article-title":"An integer projected fixed point method for graph matching and map inference","author":"leordeanu","year":"2009","journal-title":"Proc Int’l Conf Neural Information Processing Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15561-1_56"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2903483"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0442-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IVL.2000.853834"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref22","first-page":"1965","article-title":"Near-linear time approximation algorithms for optimal transport via sinkhorn iteration","author":"altschuler","year":"2017","journal-title":"Proc Int’l Conf Neural Information Processing Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"ref24","first-page":"740","article-title":"Microsoft COCO: Common objects in context","author":"lin","year":"2014","journal-title":"Proc European Conf Computer Vision"},{"article-title":"Joint deep multi-graph matching and 3d geometry learning from inhomogeneous 2d image collections","year":"2021","author":"ye","key":"ref23"}],"event":{"name":"2022 26th International Conference on Pattern Recognition (ICPR)","start":{"date-parts":[[2022,8,21]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2022,8,25]]}},"container-title":["2022 26th International Conference on Pattern Recognition (ICPR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9956007\/9955631\/09956187.pdf?arnumber=9956187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:05:14Z","timestamp":1671480314000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9956187\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,21]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icpr56361.2022.9956187","relation":{},"subject":[],"published":{"date-parts":[[2022,8,21]]}}}