- Journal Home
- Volume 42 - 2024
- Volume 41 - 2023
- Volume 40 - 2022
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Cited by
- BibTex
- RIS
- TXT
The method of data-driven tight frame has been shown very useful in image restoration problems. We consider in this paper extending this important technique, by incorporating $L_1$ data fidelity into the original data-driven model, for removing impulsive noise which is a very common and basic type of noise in image data. The model contains three variables and can be solved through an efficient iterative alternating minimization algorithm in patch implementation, where the tight frame is dynamically updated. It constructs a tight frame system from the input corrupted image adaptively, and then removes impulsive noise by the derived system. We also show that the sequence generated by our algorithm converges globally to a stationary point of the optimization model. Numerical experiments and comparisons demonstrate that our approach performs well for various kinds of images. This benefits from its data-driven nature and the learned tight frames from input images capture richer image structures adaptively.
}, issn = {1991-7139}, doi = {https://doi.org/10.4208/jcm.2008-m2018-0092}, url = {http://global-sci.org/intro/article_detail/jcm/19971.html} }The method of data-driven tight frame has been shown very useful in image restoration problems. We consider in this paper extending this important technique, by incorporating $L_1$ data fidelity into the original data-driven model, for removing impulsive noise which is a very common and basic type of noise in image data. The model contains three variables and can be solved through an efficient iterative alternating minimization algorithm in patch implementation, where the tight frame is dynamically updated. It constructs a tight frame system from the input corrupted image adaptively, and then removes impulsive noise by the derived system. We also show that the sequence generated by our algorithm converges globally to a stationary point of the optimization model. Numerical experiments and comparisons demonstrate that our approach performs well for various kinds of images. This benefits from its data-driven nature and the learned tight frames from input images capture richer image structures adaptively.