期刊文献+

Efficient Stereo Matching Scheme Based on Graph Cuts

Efficient Stereo Matching Scheme Based on Graph Cuts
下载PDF
导出
摘要 A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process. A new stereo matching scheme from image pairs based on graph cuts is given,which can solve the problem of large color differences as the result of fusing matching results of graph cuts from different color spaces.This scheme builds normalized histogram and reference histogram from matching results,and uses clustering algorithm to process the two histograms.Region histogram statistical method is adopted to retrieve depth data to achieve final matching results.Regular stereo matching library is used to verify this scheme,and experiments reported in this paper support availability of this method for automatic image processing.This scheme renounces the step of manual selection for adaptive color space and can obtain stable matching results.The whole procedure can be executed automatically and improve the integration level of image analysis process.
出处 《Journal of Beijing Institute of Technology》 EI CAS 2010年第4期445-449,共5页 北京理工大学学报(英文版)
基金 Sponsored by"985"Second Procession Construction of Ministry of Education(3040012040101)
关键词 stereo matching graph cuts Markov random fields color space stereo matching graph cuts Markov random fields color space
  • 相关文献

参考文献11

  • 1Julian B.On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society-Series B:Statisti-cal Methodology . 1986
  • 2Jonathan S Y,William T F,Yair W.Generalized belief propagation. Neural Information Processing Systems2000 . 2000
  • 3Martin J W,Tommi S J,Alan S W.Map estimation via agreement on trees:Message-passing and linear program-ming. IEEE Transactions on Information Theory . 2005
  • 4Richard S,Ramin Z,Daniel Set al.A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. Pattern Analysis and Machine Intelligence,IEEE Transactions on . 2006
  • 5Hong Z,Shuming Z,Jianying W,et al.An algorithm of pornographic image detection. 4th International Con-ference on Image and Graphics (ICIG2007) . 2007
  • 6Daniel S,Chris P.Learning conditional random fields for stereo. 2007Conference on Computer Vision and Pattern Recognition . 2007
  • 7Heiko H,Daniel S.Evaluation of cost functions for stereo matching. 2007Conference on Computer Vision and Pattern Recognition . 2007
  • 8Boykov Y,,Veksler O,Zabih R.Markov Random Fields with Effi-cient Approximations. Proc of the IEEE Computer Society Confer-ence on Computer Vision and Pattern Recognition . 1998
  • 9Marshall F.Tappen,William T.Freeman.Comparison of graph cuts with belief propagation for stereo,using identical mrf parameters. Proceedings of International Conference on Computer Vision . 2003
  • 10Boykov Y,Veksler O,Zabin R.Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence . 2001

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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