{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:25:27Z","timestamp":1777656327356,"version":"3.51.4"},"reference-count":90,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tpami.2022.3233884","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T18:52:38Z","timestamp":1673031158000},"page":"1-16","source":"Crossref","is-referenced-by-count":11,"title":["Convolutional Hough Matching Networks for Robust and Efficient Visual Correspondence"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7583-0867","authenticated-orcid":false,"given":"Juhong","family":"Min","sequence":"first","affiliation":[{"name":"CSE, POSTECH, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1892-7886","authenticated-orcid":false,"given":"Seungwook","family":"Kim","sequence":"additional","affiliation":[{"name":"Graduate School of Artificial Intelligence, Pohang University of Science and Technology, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7030-1958","authenticated-orcid":false,"given":"Minsu","family":"Cho","sequence":"additional","affiliation":[{"name":"Computer Science, POSTECH, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.458"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58555-6_21"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.122"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00349"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.147"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00723"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.299"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.12"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.378"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.363"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00452"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2724510"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00238"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"ref16","first-page":"1658","article-title":"Neighbourhood consensus networks","author":"rocco","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.11"},{"key":"ref18","article-title":"Method and means for recognizing complex patterns","author":"hough","year":"1962"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46487-9_13"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1877808.1877813"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00905"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01246-5_6"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58545-7_35"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2017.04.002"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00937"},{"key":"ref86","article-title":"SPair-71k: A large-scale benchmark for semantic correspondence","author":"min","year":"2019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.218"},{"key":"ref85","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2017.118"},{"key":"ref88","article-title":"Dual-resolution correspondence networks","author":"li","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206740"},{"key":"ref87","first-page":"6129","article-title":"Recurrent transformer networks for semantic correspondence","author":"kim","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.5244\/C.17.78"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/3DIMPVT.2011.30"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00210"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.203"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.485"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00745"},{"key":"ref6","first-page":"1","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref5","first-page":"1097","article-title":"ImageNet classification with deep convolutional neural networks","author":"krizhevsky","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00742"},{"key":"ref81","first-page":"2414","article-title":"Universal correspondence network","author":"choy","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref84","article-title":"PyTorch: An imperative style, high-performance deep learning library","author":"paszke","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","first-page":"5153","article-title":"Pairwise geometric matching for large-scale object retrieval","author":"li","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01295"},{"key":"ref80","article-title":"Semantic correspondence with transformers","author":"cho","year":"2021"},{"key":"ref79","first-page":"794","article-title":"Volumetric correspondence networks for optical flow","author":"yang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.356"},{"key":"ref78","first-page":"234","article-title":"U-Net: Convolutional networks for biomedical image segmentation","author":"ronneberger","year":"2015","journal-title":"Proc Int Conf Med Image Comput Comput -Assisted Intervention"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(81)90009-1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"ref36","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref75","article-title":"Speeding-up convolutional neural networks using fine-tuned CP-decomposition","author":"lebedev","year":"2015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459459"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.5244\/C.28.88"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.111"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.316"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58529-7_45"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2644615"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.302"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref1","author":"forsyth","year":"2011","journal-title":"Computer Vision A Modern Approach (2nd Edition)"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-013-0659-3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.12.002"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.195"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00716"},{"key":"ref72","article-title":"MobileNets: Efficient convolutional neural networks for mobile vision applications","author":"howard","year":"2017"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01021"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00267"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298724"},{"key":"ref26","article-title":"Hypercorrelation squeeze for few-shot segmentation","author":"min","year":"2021"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47977-5_2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00629"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01231-1_22"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01225-0_22"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58604-1_25"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58604-1_38"},{"key":"ref21","first-page":"1","article-title":"Deep graph matching consensus","author":"fey","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00022-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00296"},{"key":"ref29","first-page":"538","article-title":"A robust interest points matching algorithm","author":"jung","year":"2001","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.460"},{"key":"ref62","first-page":"404","article-title":"SURF: Speeded up robust features","author":"bay","year":"2006","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.442"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/10008958.pdf?arnumber=10008958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T01:45:10Z","timestamp":1686102310000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10008958\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":90,"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3233884","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}