What is the range of surface reconstructions from a gradient field?

  • Authors:

  • Amit Agrawal;Ramesh Raskar;Rama Chellappa

  • Affiliations:

  • Center for Automation Research, University of Maryland, College Park, MD;Mitsubishi Electric Research Labs (MERL), Cambridge, MA;Center for Automation Research, University of Maryland, College Park, MD

  • Venue:
  • ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

We propose a generalized equation to represent a continuum of surface reconstruction solutions of a given non-integrable gradient field. We show that common approaches such as Poisson solver and Frankot-Chellappa algorithm are special cases of this generalized equation. For a N × N pixel grid, the subspace of all integrable gradient fields is of dimension N2 – 1. Our framework can be applied to derive a range of meaningful surface reconstructions from this high dimensional space. The key observation is that the range of solutions is related to the degree of anisotropy in applying weights to the gradients in the integration process. While common approaches use isotropic weights, we show that by using a progression of spatially varying anisotropic weights, we can achieve significant improvement in reconstructions. We propose (a) α-surfaces using binary weights, where the parameter α allows trade off between smoothness and robustness, (b) M-estimators and edge preserving regularization using continuous weights and (c) Diffusion using affine transformation of gradients. We provide results on photometric stereo, compare with previous approaches and show that anisotropic treatment discounts noise while recovering salient features in reconstructions.