A New Reiterative Algorithm for the Rudin-Osher-Fatemi Denoising Model on the Graph
2014 (English)In: Proceedings of The 2nd International Conference on Intelligent Systems and Image Processing 2014, ICISIP2014, 2014, 81-88 p.Conference paper (Refereed)
We consider an analogue of the well-known in image processing Rudin-Osher-Fatemi (ROF) denoising model on a general finite directed and connected graph. Then we consider the space BV of functions of bounded variation on the graph and show that the unit ball of its dual space can be described as the image of the unit ball of the space ℓ∞ on the graph by a divergence operator. Based on this result, we propose a new fast reiterative algorithm to find the exact minimizer for the ROF model. Finally we prove convergence of the algorithm and illustrate its performance on some test examples. We would like to note that consideration of an image on the graph is important in the sense that it provides useful insights when instead of rectangular domain we have some manifold, which is a good representation for images arising in applications.
Place, publisher, year, edition, pages
2014. 81-88 p.
L–functional, Image processing, Dual BV, Regularization
Mathematics Other Natural Sciences
IdentifiersURN: urn:nbn:se:liu:diva-111218DOI: 10.12792/icisip2014.018OAI: oai:DiVA.org:liu-111218DiVA: diva2:754704
The 2nd International Conference on Intelligent Systems and Image Processing 2014, ICISIP2014, September 26 – September 29, 2014, Kitakyushu, Japan