Surface Reconstruction via L(1)-Minimization
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
A surface reconstruction technique based on the L1- 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. Springer-Verlag Berlin Heidelberg 2009.