Explicit Nonflat Time Evolution for PDE-Based Image Restoration
This article is concerned with new strategies with which explicit time-stepping procedures of PDE-based restoration models converge with a similar efficiency to implicit algorithms. Conventional explicit algorithms often require hundreds of iterations to converge. In order to overcome the difficulty and to further improve image quality, the article introduces new spatially variable constraint term and timestep size, as a method of nonflat time evolution (MONTE). It has been verified that the explicit time-stepping scheme incorporating MONTE converges in only 4-15 iterations for all restoration examples we have tested. It has proved more effective than the additive operator splitting (AOS) method in both computation time and image quality (measured in PSNR), for most cases. Since the explicit MONTE procedure is efficient in computer memory, requiring only twice the image size, it can be applied particularly for huge data sets with a great efficiency in computer memory as well.
KeywordsImage Restoration Computer Memory Constraint Parameter Spatial Scheme Explicit Algorithm
Unable to display preview. Download preview PDF.
- 5.Kim, S., Lim, H.: A non-convex diffusion model for simultaneous image denoising and edge enhancement. Electronic Journal of Differential Equations (accepted, 2006)Google Scholar
- 16.Cha, Y., Kim, S.: Edge-forming methods for image zooming. J. Mathematical Imaging and Vision (in press, 2006)Google Scholar
- 18.Kim, S., Kwon, S.H.: Efficiency and reliability in nonlinear diffusion filtering (in preparation)Google Scholar