Approximate Methods for Constrained Total Variation Minimization
Constrained total variation minimization and related convex optimization problems have applications in many areas of image processing and computer vision such as image reconstruction, enhancement, noise removal, and segmentation. We propose a new method to approximately solve this problem. Numerical experiments show that this method gets close to the globally optimal solution, and is 15-100 times faster for typical images than a state-of-the-art interior point method. Our method’s denoising performance is comparable to that of a state-of-the-art noise removal method of . Our work extends our previously published algorithm for solving the constrained total variation minimization problem for 1D signals  which was shown to produce the globally optimal solution exactly in O(Nlog N) time where N is the number of data points.
KeywordsElectrical Impedance Tomography Noisy Image Interior Point Method Noise Removal Total Variation Minimization
Unable to display preview. Download preview PDF.
- 9.Dong, X., Pollak, I.: Multiscale segmentation with vector-valued nonlinear diffusions on arbitrary graphs. IEEE Trans. Image Proc. (to appear)Google Scholar
- 10.Foi, A., Katkovnik, V., Egiazarian, K.: Pointwise shape-adaptive DCT as an overcomplete denoising tool. In: Proc. Int. TICSP Workshop on Spectral Methods and Multirate Signal Processing, SMMSP 2005, Riga, Latvia (June 2005)Google Scholar
- 20.Vogel, C.R., Oman, M.E.: Fast, robust total variation-based reconstruction of noisy, blurred images. IEEE Trans. Image Proc. 7(6) (June 1998)Google Scholar