期刊文献+

基于前景检测的视差优化算法

Parallax optimization algorithm based on foreground detection
下载PDF
导出
摘要 目前立体匹配算法分两类,传统的匹配算法通过计算两幅图的像素点相似程度,采用的是一种局部优先的方法。而当前的策略主要将问题转化为求解能量方程,进而对全局空间进行优化,提高匹配精度,获得更好的视差图。但是在实际应用过程中,由于光学失真和噪声,平滑表面的镜面反射,投影缩减,透视失真,低纹理和重复纹理等影响,导致误匹配或者找不到匹配点,从而得不到有效视差。然而在特定的场合,可以利用有限的有效视差,基于前景检测以及最小二乘法,优化得到较为完整的前景视差图。 Currently, there are two types of stereo matching algorithms, the traditional stereo matching algorithm use a local optimum method by calculating the similarity of the pixels in two images. The current strategy is to create its energy equation, and then to optimize the global space, improve matching accuracy and obtain better disparity map. However, in practical application process, the photometric distortions and noise, specular surfaces, foreshortening, transparent objects and repetitive or ambiguous patterns will lead to false match or no match point, which lead to noneffective parallax. However, in certain situations, you can optimize the limited effective parallax to get a more complete disparity map, based on foreground detection and least square method.
作者 唐望平 袁华
出处 《大众科技》 2014年第3期25-27,31,共4页 Popular Science & Technology
基金 广西自然科学基金(No.2013GXNSFDA019030 2013GXNSFAA019331 2012GXNSFBA053014 2012GXNSFAA053231) 广西科技开发项目(桂科攻1348020-6 桂科能1298025-7) 广西教育厅项目(No.201202ZD040 201202ZD044 2013YB091)
关键词 立体视觉 视差优化 立体匹配 前景检测 最小二乘法 Stereo vision parallax optimization stereo matching foreground detection least square method
  • 相关文献

参考文献1

二级参考文献10

  • 1刘正东,杨静宇.自适应窗口的时间规整立体匹配算法[J].计算机辅助设计与图形学学报,2005,17(2):291-294. 被引量:12
  • 2夏永泉,刘正东,杨静宇.不变矩方法在区域匹配中的应用[J].计算机辅助设计与图形学学报,2005,17(10):2152-2156. 被引量:21
  • 3Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms [J]. International Journal of Computer Vision, 2002,47(1/2/3) : 7 -42
  • 4Forstmann S, Kanou Y, Ohya J, et al. Real-time stereo by using dynamic programming [C] //Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington, D C, 2004, 3:29-37
  • 5Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts[C]//Proceedings of International Conference on Computer Vision, Vancouver, 2001, 2:508-515
  • 6Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(9): 1124-1137
  • 7Bleyer M, Gelautz M. A layered stereo algorithm using image segmentation and global visibility constraints[J]. ISPRS Journal of Photogrammetry and Remote Sensing, 2005, 59(3): 128-150
  • 8Bleyer M, Gelautz M. Graph-cut-based stereo matching using image segmentation with symmetrical treatment of occlusions [J]. Signal Processing & Image Communication, 2007, 22(2): 127-143
  • 9Comaniciu D, 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
  • 10张爱武,李明哲,胡少兴.一种用于三维曲面视觉测量的立体精匹配方法[J].光学技术,2001,27(2):115-117. 被引量:7

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部