Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization

Mila Nikolova, Kwok Po NG*, Shuqin Zhang, Wai Ki Ching

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

125 Citations (Scopus)

Abstract

We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant values between neighboring regions, from noisy data obtained at the output of a linear operator (e.g., a blurring kernel or a Radon transform). Thus we also address the generic problem of unsupervised segmentation in the context of linear inverse problems. The segmentation and the restoration tasks are solved jointly by minimizing an objective function (an energy) composed of a quadratic data-fidelity term and a nonsmooth nonconvex regularization term. The pertinence of such an energy is ensured by the analytical properties of its minimizers. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonsmooth nonconvex minimization. Indeed, the existing methods are unsatisfactory since they (implicitly or explicitly) involve a smooth approximation of the regularization term and often get stuck in shallow local minima. The goal of this paper is to design a method that efficiently handles the nonsmooth nonconvex minimization. More precisely, we propose a continuation method where one tracks the minimizers along a sequence of approximate nonsmooth energies {Jε}, the first of which being strictly convex and the last one the original energy to minimize. Knowing the importance of the nonsmoothness of the regularization term for the segmentation task, each Jε is nonsmooth and is expressed as the sum of an ℓ1 regularization term and a smooth nonconvex function. Furthermore, the local minimization of each Jε is reformulated as the minimization of a smooth function subject to a set of linear constraints. The latter problem is solved by the modified primal-dual interior point method, which guarantees the descent direction at each step. Experimental results are presented and show the effectiveness and the efficiency of the proposed method. Comparison with simulated annealing methods further shows the advantage of our method.

Original languageEnglish
Pages (from-to)2-25
Number of pages24
JournalSIAM Journal on Imaging Sciences
Volume1
Issue number1
DOIs
Publication statusPublished - 2008

Scopus Subject Areas

  • Mathematics(all)
  • Applied Mathematics

User-Defined Keywords

  • Constrained optimization
  • Continuation
  • Deblurring
  • Graduated nonconvexity (GNC)
  • Image restoration
  • Interior point method
  • Inverse problems
  • Nonsmooth and nonconvex optimization
  • Regularization
  • Unsupervised segmentation

Fingerprint

Dive into the research topics of 'Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization'. Together they form a unique fingerprint.

Cite this