全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

一种基于图割的快速立体匹配方法

Keywords: 立体匹配,图割,能量函数

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对图割算法中引入辅助节点,算法复杂度过高的问题,提出了一种无需引入辅助节点的图构造方法来解决立体匹配问题.由于无需引入辅助节点,所构造出的图所需空间较小,同时可以更快地找到能量函数的最小值.实验结果表明,该方法可以快速有效地得到立体匹配的结果.

References

[1]  Ishikawa H, Geier D. Occlusion, discontinuities and epipolar lines in stereo[C]//Proceedings of the 5th European Conference on Computer Vision. Freiburg, Germany: Springer Press, 1998:242 - 256.
[2]  Sun J, Shum H Y. Stereo matching using belief propagation[C]// Proceedings of the 7th European Conference on Computer Vision. Copenhagen, Denmark Springer Press, 2002:510 - 524.
[3]  Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal on Computer Vision, 2002,47 ( 1 ) : 7 -42.
[4]  Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004,26(9):1124 - 1137.
[5]  Boykov Y, Veksler O. Fast approximate energy minimization via graph cuts[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2001,23(11):1222-1239.
[6]  Kolmogorov V, Zabih R. What energy functions can be minimized via graph cuts[J]. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004,26(2):147 -159.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133