{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:04:00Z","timestamp":1747224240899,"version":"3.40.5"},"reference-count":22,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7,1]]},"abstract":"<p>In order to generate continuous and dense disparity images, a stereo matching method based on mesh aggregation and Snake optimization is proposed in this article. First, the reference pixels are obtained, so as to improve the suppression effect of the brightness difference in Census transform and improve the accuracy of initial matching cost calculation. Second, the image is divided by SLIC super pixel segmentation method, and the neighborhood pixels are searched according to the mesh search in the region, and the matching cost of these pixels are aggregated together according to the corresponding weight to complete cost aggregation of the pixels to be matched. Third, the Snake algorithm is used in optimizing the boundary of the disparity region. Eight classes of images on the Middlebury platform are selected as the test images, and the four algorithms on the Middlebury platform are selected as reference algorithms to carry out the experimental research. The experimental results show that proportion to bad pixels is low and disparity is continuous and dense on the disparity image calculated by the algorithm proposed in this article. Performance of the proposed method is close to LocalExp algorithm which is the best on the Middlebury platform, and the proposed method can be better applied in the stereo vision.<\/p>","DOI":"10.4018\/jitr.2020070106","type":"journal-article","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T15:54:17Z","timestamp":1595001257000},"page":"95-112","source":"Crossref","is-referenced-by-count":1,"title":["Dense Disparity Computing Method Based on Mesh Aggregation and Snake Optimization for Stereo Vision"],"prefix":"10.4018","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5911-5580","authenticated-orcid":true,"given":"Liu","family":"Shuang","sequence":"first","affiliation":[{"name":"School of Computer and Information Engineering, Harbin University of Commerce, Harbin, China"}]},{"given":"Yu","family":"Shuchun","sequence":"additional","affiliation":[{"name":"Harbin University of Science and Technology, Harbin, China"}]}],"member":"2432","reference":[{"key":"JITR.2020070106-0","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.120"},{"key":"JITR.2020070106-1","doi-asserted-by":"crossref","unstructured":"Altantawy, D. A., Obbaya, M., & Kishk, S. (2015). A fast non-local based stereo matching algorithm using graph cuts. In Proceedings of theInternational Conference on Computer Engineering & Systems (pp. 130-135). Academic Press.","DOI":"10.1109\/ICCES.2014.7030943"},{"key":"JITR.2020070106-2","doi-asserted-by":"publisher","DOI":"10.2352\/ISSN.2470-1173.2016.5.SDA-449"},{"key":"JITR.2020070106-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.01.002"},{"key":"JITR.2020070106-4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2010.2045814"},{"key":"JITR.2020070106-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.10.022"},{"key":"JITR.2020070106-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2016.11.016"},{"key":"JITR.2020070106-7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1166"},{"key":"JITR.2020070106-8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383248"},{"key":"JITR.2020070106-9","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2013.2291685"},{"key":"JITR.2020070106-10","doi-asserted-by":"publisher","DOI":"10.1364\/AO.56.003411"},{"key":"JITR.2020070106-11","doi-asserted-by":"publisher","DOI":"10.3390\/s150820894"},{"key":"JITR.2020070106-12","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2578944"},{"journal-title":"Vision: A computational Investigation into the human representation and processing of visual information","year":"1982","author":"D.Marr","key":"JITR.2020070106-13"},{"key":"JITR.2020070106-14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1996.517099"},{"key":"JITR.2020070106-15","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2016.52"},{"key":"JITR.2020070106-16","doi-asserted-by":"publisher","DOI":"10.3390\/s17020426"},{"key":"JITR.2020070106-17","doi-asserted-by":"crossref","unstructured":"D. Scharstein and R. Szeliski. (2002). A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International Journal of Computer Vision, 47(1\/2\/3), 7-42.","DOI":"10.1023\/A:1014573219977"},{"key":"JITR.2020070106-18","doi-asserted-by":"publisher","DOI":"10.5194\/isprsannals-III-3-123-2016"},{"key":"JITR.2020070106-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2014.02.006"},{"key":"JITR.2020070106-20","doi-asserted-by":"crossref","unstructured":"Zhang, K., Fang, Y., & Min, D. (2014). Cross-scale cost aggregation for stereo matching. In Proceedings of theIEEE Conference on Computer Vision & Pattern Recognition (pp. 1590-1597). IEEE Press.","DOI":"10.1109\/CVPR.2014.206"},{"key":"JITR.2020070106-21","first-page":"208","article-title":"Stereo matching algorithm based on improved census transform and dynamic programming.","volume":"4","author":"S.Zhu","year":"2016","journal-title":"Acta Optica Sinica"}],"container-title":["Journal of Information Technology Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=258835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T01:48:17Z","timestamp":1651888097000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/JITR.2020070106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,7,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jitr.2020070106","relation":{},"ISSN":["1938-7857","1938-7865"],"issn-type":[{"type":"print","value":"1938-7857"},{"type":"electronic","value":"1938-7865"}],"subject":[],"published":{"date-parts":[[2020,7,1]]}}}