Solution of steady-state one-dimensional conservation laws by mathematical programming
SIAM Journal on Numerical Analysis
Interior path following primal-dual algorithms. Part I: Linear programming
Mathematical Programming: Series A and B
A unified view of interior point methods for linear programming
Annals of Operations Research
Solution of steady-state, two-dimensional conservation laws by mathematical programming
SIAM Journal on Numerical Analysis
Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Primal-dual interior-point methods
Primal-dual interior-point methods
Computer Aided Geometric Design
Convex Optimization
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
Journal of Mathematical Imaging and Vision
A compressed primal-dual method for generating bivariate cubic L1 splines
Journal of Computational and Applied Mathematics
A frequency domain approach to registration of aliased images with application to super-resolution
EURASIP Journal on Applied Signal Processing
L1-minimization methods for Hamilton–Jacobi equations: the one-dimensional case
Numerische Mathematik
Image Super-Resolution by TV-Regularization and Bregman Iteration
Journal of Scientific Computing
Bayesian Methods for Image Super-Resolution
The Computer Journal
Computer Aided Geometric Design
$L^1$-Approximation of Stationary Hamilton-Jacobi Equations
SIAM Journal on Numerical Analysis
A geometric programming approach for bivariate cubic L1 splines
Computers & Mathematics with Applications
Shape-preserving, multiscale interpolation by bi- and multivariate cubic L1 splines
Computer Aided Geometric Design
Decoding by linear programming
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A surface reconstruction technique based on minimization of the total variation of the gradient is introduced. Convergence of the method is established, and an interior-point algorithm solving the associated linear programming problem is introduced. The reconstruction algorithm is illustrated on various test cases including natural and urban terrain data, and enhancement of low-resolution or aliased images.