期刊文献+

基于最小生成树的二维图像深度分配

A Depth Assignment Method for Two-dimensional Map Based on Minimum Spanning Tree
原文传递
导出
摘要 随着三维视频资源需求的增长,二维转三维(2D-3D)转换技术成为三维(3D)图像处理技术研究的焦点.由于2D视频中没有包含深度信息,2D-3D转换技术的关键在于2D视频中深度信息的提取.提出一种基于最小生成树的二维图像深度分配方法.利用最小生成树的方法对图像进行分割,然后先验理论对分割区域进行深度分配以产生合适的深度图像.最小生成树的方法不需要设置较多参数,对于不同场景的图像有较强的自适应性,而且最小生成树算法具有算法简单,运行速度快的优势. With the development of demand for three-dimensional video resources, three-dimensional (2D-3D) conversion technology become the the focus of three-dimensional image (3D) processing technology research. However, 2D video does not contain depth information.Therefore, the key technique of 2D-3D conversion is the extraction of the depth information in 2D video. This paper presents a depth assignment methods for two-dimensional map based on minimum spanning tree(MST). The methods use the an approach based minimum spanning tree to do image segmentation, and then assign a depth value to every region according to a prior theory, to produce a right depth map. Minimum Spanning Tree method does not require setting many parameters, and has a strong adaptability for images of different scenes, moreover, minimum spanning tree algorithm is simple,and has a advantage of running speed.
作者 高鹏 魏姗姗 石晓龙 胡天宇 沈涛 陈从周 GAO Peng;WEI Shan-shan;SHI Xiao-long;HU Tian-yu;SHEN Tao;CHEN Cong-zhou(School of Automation, HUST Wuhan 430074, China;MOE Key Laboratory of Image Processing and Intelligence Control, Wuhan 430074, China)
出处 《数学的实践与认识》 北大核心 2018年第9期163-167,共5页 Mathematics in Practice and Theory
基金 国家自然科学基金(61572213) 湖北省自然科学基金(2014CFB730)
关键词 2D-3D视频转换 深度图像 最小生成树 2D-3D video conversion depth map minimum spanning tree
  • 相关文献

参考文献6

二级参考文献107

  • 1唐鹏,高琳,盛鹏.基于动态形状的红外目标提取算法[J].光电子.激光,2009,20(8):1049-1052. 被引量:3
  • 2闫成新,桑农,张天序.基于图论的图像分割研究进展[J].计算机工程与应用,2006,42(5):11-14. 被引量:33
  • 3陶文兵,金海.一种新的基于图谱理论的图像阈值分割方法[J].计算机学报,2007,30(1):110-119. 被引量:58
  • 4Kass M, Witkin A, Terzopoulos D. Snakes, active contours models [J]. International Journal of Computer Vision, 1987, 1(4): 321-331. 被引量:1
  • 5Osher S, Sethian J A. Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations [J]. Journal of Computational Physics, 1988, 79(1): 12-49. 被引量:1
  • 6Mumford D, Shah J. Optimal approximations by piecewise smooth functions and associated variational problems [J]. Communications on Pure and Applied Mathematics, 1989, 42 (5) : 577-685. 被引量:1
  • 7Chan T F, Vese L A. Active contours without edges [J]. IEEE Transactions on Image Processing, 2001, 10(2) : 266- 277. 被引量:1
  • 8Vese L A, Chan T F. A multiphase level set framework for image segmentation using the Mumford and Shah model [J]. International Journal of Computer Vision, 2002, 50(3) : 271- 293. 被引量:1
  • 9Xu Y, Uberbacher E C. 2 D image segmentation using minimum spanning trees [J]. Image and Vision Computing, 1997, 15(1): 47-57. 被引量:1
  • 10Felzenszwalb P F, Huttenlocher D P. Efficient graph-based image segmentation [J]. International Journal of Computer Vision, 2004, 59(2): 167-181. 被引量:1

共引文献176

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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