A linearly convergent first-order algorithm for total variation minimisation in image processing Online publication date: Wed, 22-Oct-2014
by Cong D. Dang; Kaiyu Dai; Guanghui Lan
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 10, No. 1, 2014
Abstract: We introduce a new formulation for total variation minimisation in image denoising. We also present a linearly convergent first-order method for solving this reformulated problem and show that it possesses a nearly dimension-independent iteration complexity bound.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com