首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于能量最小化扩展景深的实现方法
引用本文:姜晓红,戴芬,姜翰青.基于能量最小化扩展景深的实现方法[J].中国图象图形学报,2006,11(12):1854-1858,T0004.
作者姓名:姜晓红  戴芬  姜翰青
作者单位:浙江大学CAD&CG国家重点实验室,杭州310027
摘    要:提出并实现了一种基于能量最小化的扩展景深方法,该方法使用对比度作为评价标准来拼接源图像,它的创新之处是利用了基于图分剖的能量最小化方法提供的空间一致性来解决拼接赝像问题,并用最大流算法来解决图分割问题。最后给出了实验结果,将实验结果与缺乏空间规范化的结果进行了比较。实验结果证明,本文方法能够在用户可以接受的时间范围内得到较为优越的扩展景深效果。

关 键 词:扩展景深  能量最小化  图分割  最大流/最小割
文章编号:1006-8961(2006)12-1854-05
收稿时间:2006-05-30
修稿时间:2006-06-19

An Energy Minimization Based Extended Depth-of-field Method
JIANG Xiao-hong,DAI Fen,JIANG Han-qing,JIANG Xiao-hong,DAI Fen,JIANG Han-qing and JIANG Xiao-hong,DAI Fen,JIANG Han-qing.An Energy Minimization Based Extended Depth-of-field Method[J].Journal of Image and Graphics,2006,11(12):1854-1858,T0004.
Authors:JIANG Xiao-hong  DAI Fen  JIANG Han-qing  JIANG Xiao-hong  DAI Fen  JIANG Han-qing and JIANG Xiao-hong  DAI Fen  JIANG Han-qing
Abstract: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.
Keywords:extended depth-of-field  energy minimization  graph cut  max-flow/min-cut
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《中国图象图形学报》浏览原始摘要信息
点击此处可从《中国图象图形学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号