{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:22:36Z","timestamp":1783095756344,"version":"3.54.6"},"reference-count":20,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2020,3,23]]},"abstract":"<jats:p>Stereo vision is a flourishing field, attracting the attention of many researchers. Recently, leveraging on the development of deep learning, stereo matching algorithms have achieved remarkable performance far exceeding traditional approaches. This review presents an overview of different stereo matching algorithms based on deep learning. For convenience, we classified the algorithms into three categories: (1) non-end-to-end learning algorithms, (2) end-to-end learning algorithms, and (3) unsupervised learning algorithms. We have provided a comprehensive coverage of the remarkable approaches in each category and summarized the strengths, weaknesses, and major challenges, respectively. The speed, accuracy, and time consumption were adopted to compare the different algorithms.<\/jats:p>","DOI":"10.1155\/2020\/8562323","type":"journal-article","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T23:31:50Z","timestamp":1585006310000},"page":"1-12","source":"Crossref","is-referenced-by-count":71,"title":["Review of Stereo Matching Algorithms Based on Deep Learning"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7589-450X","authenticated-orcid":true,"given":"Kun","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Mathematics Science, Peking University, Beijing, China"},{"name":"Suzhou Automotive Research Institute, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangxi","family":"Meng","sequence":"additional","affiliation":[{"name":"Key Laboratory of Carcinogenesis and Translational Research (Ministry of Education\/Beijing), Department of Nuclear Medicine, Peking University Cancer Hospital & Institute, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5114-3771","authenticated-orcid":true,"given":"Bo","family":"Cheng","sequence":"additional","affiliation":[{"name":"Suzhou Automotive Research Institute, Tsinghua University, Beijing, China"},{"name":"Su Zhou Automobile Research Institute, Suzhou, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2016.03.012"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.3390\/rs10111844"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2007.1166"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2007.36"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1023\/a:1014573219977"},{"key":"10","first-page":"778","volume-title":"BRIEF: binary robust independent elementary features","volume":"6314","year":"2010"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/8742920"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1080\/15599610802438680"},{"key":"27","first-page":"1","year":"2019","journal-title":"International Journal of Computer Vision"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46484-8_45"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_51"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46487-9_38"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.12.002"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57240-6_14"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1364\/ao.56.003411"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2017.2766072"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1109\/lsp.2016.2637355"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2898988"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2018.2878325"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49409-8_1"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/8562323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/8562323.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2020\/8562323.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T23:31:51Z","timestamp":1585006311000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/cin\/2020\/8562323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":20,"alternative-id":["8562323","8562323"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8562323","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,23]]}}}