Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction.
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.
Nikolova
Mila
M
Centre de Mathématiques et de Leurs Applications, CNRS, Cachan, France. nikolova@cmla.ens-cachan.fr
Ng
Michael K
MK
Tam
Chi-Pan
CP
D000465:Algorithms; D003198:Computer Simulation; D007090:Image Interpretation, Computer-Assisted; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods