全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种基于分割的两步立体匹配算法

DOI: 10.11834/jig.20071126

Keywords: 图像分割,立体匹配,地面控制点,遗传算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

提出了一种基于分割的两步立体匹配算法。第1步,利用动态规划和左右一致性约束计算地面控制点,将原始图像分割为许多小区域,假定每一个区域为同一个视差,并通过地面控制点计算部分区域的视差值;第2步将剩余未匹配的区域编码为一条染色体,用遗传算法进行优化,得到最终的稠密视差图。选用了一些标准图像对进行测试,实验结果表明,该算法具有很好的性能。

References

[1]  Scharstein D,Szeliski R.Middlebury stereo vision page[EB/OL].http://www.Middlebury.edu/stereo/.2002-01-10.
[2]  Wei Y,Quan L.Region-based progressive stereo matching[A].In:Proceedings of IEEE Conference on Computer Vision and Pattern Recognition[C],Washington,DC,USA,2004:106~113.
[3]  Wei Y,Lhuillier M,Quan L.Fast segmentation-based dense stereo from quasi dense matching[A].In:Proceedings of the 6th Asian Conference on Computer Vision[C],Jeju,Korea,2004:360~365.
[4]  Han K P,Song K W,Chung E Y,et al Stereo matching using genetic algorithm with adaptive chromosomes[J].Pattern Recognition,2001,34(9):1729~1740.
[5]  Gong M L,Yang Y H.Genetic-based stereo algorithm and disparity map evaluation[J].International Journal of Computer Vision,2002,47(1/2/3):63~77.
[6]  Bobick A F,Intille S S.Large occlusion stereo[J].International Journal of Computer Vision,1999,33(3):181~200.
[7]  Boykov Y,Veksler O,Zabih R.Fast approximate energy minimization via graph cuts[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,23(11):1222~1239.
[8]  Scharstein D,Szeliski R.A taxonomy and evaluation of dense twoframe stereo correspondence algorithms[J].International Journal of Computer Vision,2002,47(1/2/3):7~42.
[9]  Lin M,Tomasi C.Surfaces with occlusions from layered stereo[A].In:Proceedings of IEEE Conference on Computer Vision and Pattern Recognition[C],Madison,Wisconsin,USA,2003:710~717.
[10]  Birchfield S,Tomasi C.A pixel dissimilarity measure that is insensitive to sampling[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1998,20(4):401~406.
[11]  Comaniciu D and Meer P.Mean shift:A robust approach toward feature space analysis[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2002,24(5):603~619.
[12]  Veksler O.Stereo correspondence by dynamic programming on a tree[A].In:Proceedings of IEEE Conference on Computer Vision and Pattern Recognition[C],San Diego,CA,USA,2005:384~390.
[13]  Kolmogorov V,Zabih R.Computing visual correspondence with occlusions using graph cuts[A].In:Proceedings of International Conference on Computer Vision[C],Vancouver,Canada,2001:508~515.
[14]  Kolmogorov V,Zabih R.Multi-camera scene reconstruction via graph cuts[A].In:Proceedings of Seventh European Conference on Computer Vision[C],Copenhagen,Denmark,2002:82~96.
[15]  Gong M L,Yang Y H.Near real-time reliable stereo matching using programmable graphics hardware[A].In:Proceedings of IEEE Conference on Computer Vision and Pattern Recognition[C],San Diego,CA,USA,2005:924~931.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133