Image Restoration with Discrete Constrained Total Variation Part II: Levelable Functions, Convex Priors and Non-Convex Cases
- First Online:
- Cite this article as:
- Darbon, J. & Sigelle, M. J Math Imaging Vis (2006) 26: 277. doi:10.1007/s10851-006-0644-3
In Part II of this paper we extend the results obtained in Part I for total variation minimization in image restoration towards the following directions: first we investigate the decomposability property of energies on levels, which leads us to introduce the concept of levelable regularization functions (which TV is the paradigm of). We show that convex levelable posterior energies can be minimized exactly using the level-independant cut optimization scheme seen in Part I. Next we extend this graph cut scheme to the case of non-convex levelable energies.We present convincing restoration results for images corrupted with impulsive noise. We also provide a minimum-cost based algorithm which computes a global minimizer for Markov Random Field with convex priors. Last we show that non-levelable models with convex local conditional posterior energies such as the class of generalized Gaussian models can be exactly minimized with a generalized coupled Simulated Annealing.
Keywordstotal variation level sets convexity Markov Random fields graph cuts levelable functions
Kluwer Academic Publishers
Electronically submitted article
Unable to display preview. Download preview PDF.