Optimizing Census-based Semi Global Matching by genetic algorithms

Vlad-Cristian Miclea, S. Nedevschi
{"title":"Optimizing Census-based Semi Global Matching by genetic algorithms","authors":"Vlad-Cristian Miclea, S. Nedevschi","doi":"10.1109/ICCP.2016.7737146","DOIUrl":null,"url":null,"abstract":"Recent years have shown a great progress in self-driving vehicles and stereovision has proven to be a key aspect towards this goal. Semi-Global Matching (SGM) algorithm is among the best stereo solutions, capable of producing reliable results at reasonable cost. Census transform is generally preferred as a cost metric due to its robustness and invariance to lighting conditions. This paper proposes an original methodology for finding both the optimal Census mask and the best values for the penalties P1 and P2 in SGM by using genetic algorithms (GA). The obtained census masks are thoroughly analyzed and the best ones can be combined in a weighted center-symmetric census to increase the performance of SGM. Kitti test cases show that our GA-based censuses as well as our novel weighted center-symmetric census outperform dense, sparse and center-symmetric counterparts for Census only and SGM.","PeriodicalId":343658,"journal":{"name":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2016.7737146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Recent years have shown a great progress in self-driving vehicles and stereovision has proven to be a key aspect towards this goal. Semi-Global Matching (SGM) algorithm is among the best stereo solutions, capable of producing reliable results at reasonable cost. Census transform is generally preferred as a cost metric due to its robustness and invariance to lighting conditions. This paper proposes an original methodology for finding both the optimal Census mask and the best values for the penalties P1 and P2 in SGM by using genetic algorithms (GA). The obtained census masks are thoroughly analyzed and the best ones can be combined in a weighted center-symmetric census to increase the performance of SGM. Kitti test cases show that our GA-based censuses as well as our novel weighted center-symmetric census outperform dense, sparse and center-symmetric counterparts for Census only and SGM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的人口普查半全局匹配优化
近年来,自动驾驶汽车取得了巨大进展,而立体视觉已被证明是实现这一目标的关键方面。半全局匹配(Semi-Global Matching, SGM)算法是目前最好的立体定位方法之一,能够以合理的成本产生可靠的结果。由于普查变换对光照条件的鲁棒性和不变性,通常首选作为成本度量。本文提出了一种利用遗传算法(GA)在SGM中寻找最优普查掩码和惩罚P1和P2的最优值的方法。对得到的普查掩码进行了深入的分析,并将最佳掩码组合在加权中心对称普查中,以提高SGM的性能。Kitti测试案例表明,我们基于ga的人口普查以及我们新颖的加权中心对称人口普查在人口普查和SGM中优于密集、稀疏和中心对称的人口普查。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A mobile application to improve the quality of life via exercise Modeling framework for hazard management applied to water pollution and radiation dispersion Modelling eye fatigue in gaze spelling task Bird Mating Optimization method for one-to-n skill matching A trust-enriched approach for item-based collaborative filtering recommendations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1