A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Citations Over TimeTop 1% of 2008 papers
Abstract
We propose, analyze, and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorithm arises from a new half-quadratic model applicable to not only the anisotropic but also the isotropic forms of TV discretizations. The per-iteration computational complexity of the algorithm is three fast Fourier transforms. We establish strong convergence properties for the algorithm including finite convergence for some variables and relatively fast exponential (or q-linear in optimization terminology) convergence for the others. Furthermore, we propose a continuation scheme to accelerate the practical convergence of the algorithm. Extensive numerical results show that our algorithm performs favorably in comparison to several state-of-the-art algorithms. In particular, it runs orders of magnitude faster than the lagged diffusivity algorithm for TV-based deblurring. Some extensions of our algorithm are also discussed.
Related Papers
- → Image Restoration Under Significant Additive Noise(2007)21 cited
- A Comparative Approach for Analysis of Image Restoration using Image Deblurring Techniques(2015)
- → A hybrid algorithm for spatial and wavelet domain image restoration(2005)2 cited
- Efficient methodologies for single-image blind deconvolution and deblurring(2014)
- → A Survey on Image Restoration by Comparing the Different Deblurring Process and Filtration(2014)