Approximation et optimisation

TL;DR: This paper proposes a general class of controlled-continuity stabilizers which provide the necessary control over smoothness in visual reconstruction problems that involve both continuous regions and discontinuities, for which global smoothness constraints fail.

TL;DR: The computational efficiency of DCA suggests to us a deeper and more complete study on DC programming, using the special class of DC programs (when either g or h is polyhedral convex) called polyhedral DC programs.

TL;DR: A thorough study on convex analysis approach to d.C.c. (difierence of convex functions) programming and gives the State of the Art results and the application of the DCA to solving a lot of important real-life d.c., polyhedral programming problems.

TL;DR: A modified variational scheme for contour modeling is proposed, which uses no edge detection step, but local computations instead—only around contour neighborhoods—as well as an “anticipating” strategy that enhances the modeling activity of deformable contour curves.