CVApr 1, 2021

Efficient and Differentiable Shadow Computation for Inverse Problems

arXiv:2104.00359v116 citations
Originality Incremental advance
AI Analysis

This incremental improvement enables more practical use of differentiable rendering for inverse problems like texture and illumination recovery, benefiting researchers in computer vision and graphics.

The paper tackles the problem of slow and inaccurate differentiable shadow computation in inverse rendering by proposing an efficient method using spherical harmonics and sphere approximations, achieving significantly faster shadow computation compared to ray-tracing methods.

Differentiable rendering has received increasing interest for image-based inverse problems. It can benefit traditional optimization-based solutions to inverse problems, but also allows for self-supervision of learning-based approaches for which training data with ground truth annotation is hard to obtain. However, existing differentiable renderers either do not model visibility of the light sources from the different points in the scene, responsible for shadows in the images, or are too slow for being used to train deep architectures over thousands of iterations. To this end, we propose an accurate yet efficient approach for differentiable visibility and soft shadow computation. Our approach is based on the spherical harmonics approximations of the scene illumination and visibility, where the occluding surface is approximated with spheres. This allows for a significantly more efficient shadow computation compared to methods based on ray tracing. As our formulation is differentiable, it can be used to solve inverse problems such as texture, illumination, rigid pose, and geometric deformation recovery from images using analysis-by-synthesis optimization.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes