Author:
Ennaji Hamza,Igbida Noureddine,Nguyen Van Thanh
Abstract
The continuous Lambertian shape from shading is studied using a PDE approach in terms of Hamilton–Jacobi equations. The latter will then be characterized by a maximization problem. In this paper we show the convergence of discretization and propose to use the well-known Chambolle–Pock primal-dual algorithm to solve numerically the shape from shading problem. The saddle-point structure of the problem makes the Chambolle–Pock algorithm suitable to approximate solutions of the discretized problems.
Reference44 articles.
1. On the minimizing movement with the 1-Wasserstein distance
2. Ahmed A. and Farag A., A new formulation for shape from shading for non-Lambertian surfaces. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol. 2 (2006) 1817–1824.
3. Ambrosio L., Fusco N. and Pallara D., Functions of Bounded Variation and Free Discontinuity Problems. Clarendon Press, Oxford (2000).
4. Discrete approximation of the minimal time function for systems with regular optimal trajectories
5. Augmented Lagrangian Methods for Transport Optimization, Mean Field Games and Degenerate Elliptic Equations
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献