Robust surface reconstruction from gradient fields

Surface reconstruction from gradient fields is a fundamental problem to shape from shading and photometric stereo. Proposed is a surface reconstruction method that is robust to both noise and outliers. The reconstruction problem is formulated to linear decoding in compressed sensing, by assuming the outliers are sparsely distributed. A Laplacian term is additionally employed to increase information in the construction matrix and suppress noise and/or outliers. Experimental results validate that the proposed method significantly outperforms the state of the art, and can produce satisfactory reconstruction even in the very extreme situation of 60% outliers.

[1]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[2]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[3]  Jiang Zhu,et al.  Removal of salt-and-pepper noise based on compressed sensing , 2010 .

[4]  Rama Chellappa,et al.  Enforcing integrability by error correction using l1-minimization , 2009, CVPR.

[5]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..