Surface Reconstruction via L 1-Minimization

DOI10.1007/978-3-642-00464-3_4zbMath1233.65019OpenAlexW149372811MaRDI QIDQ3615640

Veselin A. Dobrev, Bojan Popov, Jean-Luc Guermond

Publication date: 24 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00464-3_4

zbMATH Keywords

convergence\(L^{1}\)-minimization\(L ^{1}\)-surface reconstruction algorithmsurface reconstruction techniquewllposedness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control ⋮ Robust Surface Reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
• Image recovery via total variation minimization and related problems
• Univariate cubic \(L_{p}\) splines and shape-preserving, multiscale interpolation by univariate cubic \(L_{1}\) splines
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• \(L^{1}\)-minimization methods for Hamilton-Jacobi equations: the one-dimensional case
• Shape-preserving interpolation of irregular data by bivariate curvature-based cubic \(L_1\) splines in spherical coordinates
• Decoding by Linear Programming
• Solution of Steady-State, Two-Dimensional Conservation Laws by Mathematical Programming
• A Finite Element Technique for Solving First-Order PDEs inL^p
• Solution of Steady-State One-Dimensional Conservation Laws by Mathematical Programming
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Surface Reconstruction via L 1-Minimization