ROF model on the graph
2014 (English)Report (Other academic)
In this paper 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. We consider the space BV 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 ℓinfinity on the graph by a divergence operator. Based on this result, we propose a new fast algorithm to find the exact minimizer for the ROF model. Finally we prove convergence of the algorithm and illustrate its performance on some image denoising test examples.
Place, publisher, year, edition, pages
Linköping University Electronic Press, 2014. , 25 p.
LiTH-MAT-R, ISSN 0348-2960 ; 2014:06
ROF model, Directed graph, L–functional, Image processing, Dual BV, Regularization.
IdentifiersURN: urn:nbn:se:liu:diva-106920ISRN: LiTH-MAT-R--2014/06--SEOAI: oai:DiVA.org:liu-106920DiVA: diva2:719719