【24h】

Fast approximate focal stack transform

机译:快速近似焦点堆栈转换

获取原文

摘要

In this work we develop a new algorithm, extending the fast digital Radon transform from Gotz and Druckmuller (1996), that is capable of generating the approximate focal stack of a scene, previously measured with a plenoptic camera, with the minimum number of operations. This new algorithm does not require multiplications, just sums, and its computational complexity is O(N4) to achieve a volume consisting of 2N - 1 photographic planes focused at different depths, from a N4 light field. The method is close to real-time performance, and its output can be used to estimate the distances to objects of a scene.
机译:在这项工作中,我们开发了一种新算法,扩展了Gotz和Druckmuller(1996)的快速数字Radon变换,该算法能够以最少的操作次数生成场景的近似焦点堆栈,该场景以前是用全光摄像机测量的。这种新算法不需要乘法,只需求和,其计算复杂度为O(N 4 ),即可从N 到一个聚焦于不同深度的2N-1摄影平面组成的体积4 光场。该方法接近实时性能,其输出可用于估计到场景对象的距离。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号