首页> 中文期刊> 《电子学报》 >具有容错能力的L1最优化半自动2D转3D

具有容错能力的L1最优化半自动2D转3D

         

摘要

Sparse-to-dense depth conversion is an important task in semi-automatic 2D-to-3D conversion. Existing methods do not handle structural difference between texture image and depth map,and the error-tolerance of 2D-to-3D is not considered.Inspired by compressive sensing studies,we address these problems in an optimization framework via L1norm. First,data term is built with L1norm to measure the fidelity between estimated depth and user assigned depth.Second,local regularized term is defined by using feature weighted L1norm to measure difference between local neighboring pixels.Third, super-pixels are generated from input image and global regularized term is introduced by using feature weighted L1norm to measure difference between representative pixels from these super-pixels.Then,the energy function for sparse-to-dense depth conversion is defined based on the data term,local regularized term and global regularized term.The split Bregman algorithm is used to solve the energy.Experimental comparisons with optimization based interpolation,random-walks,hybrid graph-cuts and random-walks,soft segmentation constrained interpolation and nonlocal random-walks show that our method dem-onstrates significant advantages over hole and ghosting artifacts for viewpoint synthesis.The PSNR is improved by more than 0.9 dB compared with these methods when user assigns error depth.%半自动2D转3D的关键是将用户分配的稀疏深度转换为稠密深度.现有方法没有充分考虑纹理图像和深度图之间的结构差异,以及2D转3D对用户误标注的容错性.针对上述问题,借助L1范数对异常数据的抵制,在一个统一框架下实现结构相关具有容错能力的稀疏深度稠密插值.首先,利用L1范数表示估计深度和用户分配深度在标注位置的差异,建立数据项;其次,根据特征的相似性用L1范数计算局部相邻像素点之间的深度差异,建立局部正则项;再次,对图像进行超像素分割,根据不同超像素内代表性像素点之间深度差异的L1测度,建立全局正则项;最后,用上述数据项和正则项构建能量函数,并通过分裂Bregman算法予以求解.无误差和有误差情况下的实验结果表明,与边缘保持的最优化插值、随机游走、混合图割与随机游走、软分割约束的最优化插值和非局部化随机游走相比,本文估计深度图绘制的虚拟视点图像空洞和伪影损伤更小.在误操作情况下,本文比上述方法PSNR改善了0.9dB以上,且在视觉上屏蔽了用户误操作的影响.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号