Surface Reconstruction via L1-Minimization

A surface reconstruction technique based on the L 1- minimization of the variation of the gradient is introduced. This leads to a non-smooth convex programming problem. Well-posedness and convergence of the method is established and an interior point based algorithm is introduced. The L 1-surface reconstruction algorithm is illustrated on various test cases including natural and urban terrain data.

[1]  J. Guermond,et al.  LINEAR ADVECTION WITH ILL-POSED BOUNDARY CONDITIONS VIA L-MINIMIZATION , 2006 .

[2]  J. Guermond,et al.  A FINITE ELEMENT TECHNIQUE FOR SOLVING , 2004 .

[3]  J. Guermond,et al.  Numerische Mathematik L 1-minimization methods for Hamilton – Jacobi equations : the one-dimensional case , 2008 .

[4]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[5]  John E. Lavery.  Univariate cubic Lp splines and shape-preserving, multiscale interpolation by univariate cubic L1 splines , 2000, Comput. Aided Geom. Des..

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

[7]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[8]  Jean-Luc Guermond,et al.  L1-minimization methods for Hamilton–Jacobi equations: the one-dimensional case , 2008, Numerische Mathematik.

[9]  John E. Lavery,et al.  Solution of steady-state one-dimensional conservation laws by mathematical programming , 1989 .

[10]  Jérôme Darbon,et al.  Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization , 2006, Journal of Mathematical Imaging and Vision.

[11]  John E. Lavery,et al.  Shape-preserving interpolation of irregular data by bivariate curvature-based cubic L1 splines in spherical coordinates , 2005, Comput. Aided Geom. Des..

[12]  P. Lions,et al.  Image recovery via total variation minimization and related problems , 1997 .

[13]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

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

[15]  John E. Lavery,et al.  A compressed primal-dual method for generating bivariate cubic L1 splines , 2007 .

[16]  Jean-Luc Guermond,et al.  L1-Approximation of Stationary Hamilton-Jacobi Equations , 2008, SIAM J. Numer. Anal..