Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction
Related Experiment Video
Updated: Jun 12, 2026

3D Imaging of Soft-Tissue Samples using an X-ray Specific Staining Method and Nanoscopic Computed Tomography
Published on: October 24, 2019
Mila Nikolova1, Michael K Ng, Chi-Pan Tam
1Centre de Mathématiques et de Leurs Applications, CNRS, Cachan, France. nikolova@cmla.ens-cachan.fr
Abstract:
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonconvex nonsmooth minimization. In this paper, we deal with nonconvex nonsmooth minimization methods for image restoration and reconstruction. Our theoretical results show that the solution of the nonconvex nonsmooth minimization problem is composed of constant regions surrounded by closed contours and neat edges. The main goal of this paper is to develop fast minimization algorithms to solve the nonconvex nonsmooth minimization problem. Our experimental results show that the effectiveness and efficiency of the proposed algorithms.
More Related Videos
Related Concept Videos
Reconstruction of Signal using Interpolation
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Lagrange Multipliers: Two Constraints
Newton’s Method
Methods of Medium Optimization
