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.
KeywordsQuadrature Rule Quadrature Point Preconditioned Conjugate Gradient Ematical Programming Gaussian Rule
Unable to display preview. Download preview PDF.
- 13.Guermond, J.L., Popov, B.: l1-minimization methods for Hamilton-Jacobi equations. SIAM J. Numer. Anal. (accepted)Google Scholar