期刊文献+

基于能量最小化扩展景深的实现方法 被引量:1

An Energy Minimization Based Extended Depth-of-field Method
下载PDF
导出
摘要 提出并实现了一种基于能量最小化的扩展景深方法,该方法使用对比度作为评价标准来拼接源图像,它的创新之处是利用了基于图分割的能量最小化方法提供的空间一致性来解决拼接赝像问题,并用最大流算法来解决图分割问题。最后给出了实验结果,将实验结果与缺乏空间规范化的结果进行了比较。实验结果证明,本文方法能够在用户可以接受的时间范围内得到较为优越的扩展景深效果。 This paper proposes a kind of energy minimization based extended depth-of-field method, which uses a measure of contrast to compose source images. The innovation point is that it makes use of the spatial consistency afforded by the energy minimization via graph-cut to solve the problem of composite artifacts, and uses the max-flaw algorithm to solve the graph-cut problem. In the end of the paper, we present the result, and then compare it with the result of the algorithm without spatial consistency. The result shows that the method can produce more perfect effect within an acceptable execution time.
出处 《中国图象图形学报》 CSCD 北大核心 2006年第12期1854-1858,T0004,共6页 Journal of Image and Graphics
基金 国家自然科学基金重点项目(60533080)
关键词 扩展景深 能量最小化 图分割 最大流/最小割 extended depth-of-field, energy minimization, graph cut, max-flow/min-cut
  • 相关文献

参考文献9

  • 1Ogden J M,Adelson E H,Bergen J.et al.Pyramid-based computer graphics[J].RCA Engineer,1985,30(5):4~15. 被引量:1
  • 2Burt P,Kolcztnski R.Enhanced image capture through fusion[A].In:International Conference on Computer Vision(ICCV 93[C],Germany,Berlin,1993:173~182. 被引量:1
  • 3Haeberli Paul.A Multifocus Method for Controlling Depth of Field on Grafica Obscura Web Site[EB/OL].http://www.graficaobsura.com/depth/index.html,1994-08. 被引量:1
  • 4Agarwala A,Dontcheva M,Agrawala M,et al.Interactive digital photomontage[A].In:Proceedings of ACM SIGGRAPH 2004[C],USA,California,Los Angeles,2004:294~302. 被引量:1
  • 5Boykov 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. 被引量:1
  • 6Kwatra V,Schdl A,Essa I,et al.Graphcut textures:image and video synthesis using graph cuts[A].In:Proceedings of ACM SIGGRAPH 2003[C],San Diego,California,USA,2003:277~286. 被引量:1
  • 7Boykov Y,Kolmogorov V.An experimental comparison of mincut/max-flow algorithms for energy minimization in vision[J].IEEE Transactions on Pattern Analysis and Machine Interlligence,2004,26(9):1124~1137. 被引量:1
  • 8Greig D,Porteous B,Seheult A.Exact maximum a posteriori estimation for binary images[J].Journal of the Royal Statistical Society,Series B,1989,51(2):271~279. 被引量:1
  • 9Ford L,Fulkerson D.Flows in Networks[M].New Jersey:Princeton University Press,1962. 被引量:1

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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