Le Pendu Mikael, Jiang Xiaoran, Guillemot Christine
IEEE Trans Image Process. 2018 Jan 10. doi: 10.1109/TIP.2018.2791864.
Building up on the advances in low rank matrix completion, this article presents a novel method for propagating the inpainting of the central view of a light field to all the other views. After generating a set of warped versions of the inpainted central view with random homographies, both the original light field views and the warped ones are vectorized and concatenated into a matrix. Because of the redundancy between the views, the matrix satisfies a low rank assumption enabling us to fill the region to inpaint with low rank matrix completion. To this end, a new matrix completion algorithm, better suited to the inpainting application than existing methods, is also developed in this paper. In its simple form, our method does not require any depth prior, unlike most existing light field inpainting algorithms. The method has then been extended to better handle the case where the area to inpaint contains depth discontinuities. In this case, a segmentation map of the different depth layers of the inpainted central view is required. This information is used to warp the depth layers with different homographies. Our experiments with natural light fields captured with plenoptic cameras demonstrate the robustness of the low rank approach to noisy data as well as large color and illumination variations between the views of the light field.
基于低秩矩阵补全的进展,本文提出了一种将光场中心视图的修复结果传播到所有其他视图的新方法。在用随机单应性变换生成一组修复后的中心视图的扭曲版本后,将原始光场视图和扭曲后的视图都向量化并连接成一个矩阵。由于视图之间的冗余性,该矩阵满足低秩假设,这使我们能够用低秩矩阵补全来填充待修复区域。为此,本文还开发了一种比现有方法更适合修复应用的新矩阵补全算法。在其简单形式中,与大多数现有的光场修复算法不同,我们的方法不需要任何深度先验信息。该方法随后被扩展以更好地处理待修复区域包含深度不连续的情况。在这种情况下,需要修复后的中心视图不同深度层的分割图。此信息用于用不同的单应性变换扭曲深度层。我们使用全光相机捕获的自然光源进行的实验证明了低秩方法对噪声数据以及光场视图之间的大颜色和光照变化的鲁棒性。