Efficient computation of backprojection arrays for 3D light field deconvolution.
Efficient computation of backprojection arrays for 3D light field deconvolution.
复制标题
DOI：
10.1364/oe.431174
复制
发表时间：
2020-03
期刊：
影响因子：
3.8
通讯作者：
M. Eberhart
中科院分区：
文献类型：
--
作者：
M. Eberhart
光场去卷积允许从全光相机的单个快照记录进行三维调查。它基于线性成像模型，迭代体积重建需要定义单个图像像素到对象空间的反投影。这实际上是点扩散函数（PSF）的反转，并且可以从光学系统的移位可变PSF H导出背投影阵列H'，这对于高分辨率相机是非常耗时的步骤。本文阐述了反投影阵列的一般结构及其高效计算的意义。提出了一种新的由H确定H'的算法，该算法基于两个多维数组中元素位置的不同关系。它允许一个纯粹的数组重排，虽然结果是相同的，从出版的代码，计算时间大大减少。这是通过基准测试的新方法使用各种样本PSF阵列对现有的算法。本文补充了实际的提示，在摄影装置中的光场PSF的实验采集。
Light field deconvolution allows three-dimensional investigations from a single snapshot recording of a plenoptic camera. It is based on a linear image formation model, and iterative volume reconstruction requires to define the backprojection of individual image pixels into object space. This is effectively a reversal of the point spread function (PSF), and backprojection arrays H' can be derived from the shift-variant PSFs H of the optical system, which is a very time consuming step for high resolution cameras. This paper illustrates the common structure of backprojection arrays and the significance of their efficient computation. A new algorithm is presented to determine H' from H, which is based on the distinct relation of the elements' positions within the two multi-dimensional arrays. It permits a pure array rearrangement, and while results are identical to those from published codes, computation times are drastically reduced. This is shown by benchmarking the new method using various sample PSF arrays against existing algorithms. The paper is complemented by practical hints for the experimental acquisition of light field PSFs in a photographic setup.