Framelet Algorithms for De-Blurring Images Corrupted by Impulse Plus Gaussian Noise
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
This paper studies a problem of image restoration that observed images are contaminated by Gaussian and impulse noise. Existing methods for this problem in the literature are based on minimizing an objective functional having the l(1) fidelity term and the Mumford-Shah regularizer. We present an algorithm on this problem by minimizing a new objective functional. The proposed functional has a content-dependent fidelity term which assimilates the strength of fidelity terms measured by the l(1) and l(2) norms. The regularizer in the functional is formed by the l(1) norm of tight framelet coefficients of the underlying image. The selected tight framelet filters are able to extract geometric features of images. We then propose an iterative framelet-based approximation/sparsity deblurring algorithm (IFASDA) for the proposed functional. Parameters in IFASDA are adaptively varying at each iteration and are determined automatically. In this sense, IFASDA is a parameter-free algorithm. This advantage makes the algorithm more attractive and practical. The effectiveness of IFASDA is experimentally illustrated on problems of image deblurring with Gaussian and impulse noise. Improvements in both PSNR and visual quality of IFASDA over a typical existing method are demonstrated. In addition, Fast_IFASDA, an accelerated algorithm of IFASDA, is also developed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952 · cited 1×
“We adopt here the idea from [56] and propose a fast algorithm (referred to as Fast_IFASDA) for (18) as follows.”
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“The iterative scheme (20) for a specific selection of , , and hasappearedintheliterature.Forinstance,with , , and , the corresponding scheme (20) was discussed in [28] and [ 48 ]‐[51].”
BackgroundAn Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
Cited by
SimVascular: An Open Source Pipeline for Cardiovascular Simulation
Updegrove, A., Wilson, N. M., Merkow, J., Lan, H., Marsden, A. L., & Shadden, S. C. (2017) · Annals of Biomedical Engineering · doi:10.1007/s10439-016-1762-8 · Cited by 651
Image Restoration Using Joint Statistical Modeling in a Space-Transform Domain
Zhang, J., Zhao, D., Xiong, R., Ma, S., & Gao, W. (2014) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2014.2302380 · Cited by 184
“f noise don’t work well due to the distinct characteristics of both types of degradation processes. Here, two state-of-the-art algorithms compared with our proposed method 26 are: FTV [48] and IFASDA [49]. Experiments are carried out on four benchmark gray images in Fig. 7, where the standard variance of Gaussian nois…”
BackgroundMethodInfluentialFeng, C., Zhao, D., & Huang, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-30858-6_20 · Cited by 24
Metadata
- Authors
- Li, Y.-R., Shen, L., Dai, D.-Q., & Suter, B. W.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2011-07
- Volume
- 20
- Issue
- 7
- Pages
- 1822-1837
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2155055620
- Cited by
- 177
- References
- 5
- FWCI
- 10.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.