A General Framework for Regularized, Similarity-Based Image Restoration
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Any image can be represented as a function defined on a weighted graph, in which the underlying structure of the image is encoded in kernel similarity and associated Laplacian matrices. In this paper, we develop an iterative graph-based framework for image restoration based on a new definition of the normalized graph Laplacian. We propose a cost function, which consists of a new data fidelity term and regularization term derived from the specific definition of the normalized graph Laplacian. The normalizing coefficients used in the definition of the Laplacian and associated regularization term are obtained using fast symmetry preserving matrix balancing. This results in some desired spectral properties for the normalized Laplacian such as being symmetric, positive semidefinite, and returning zero vector when applied to a constant image. Our algorithm comprises of outer and inner iterations, where in each outer iteration, the similarity weights are recomputed using the previous estimate and the updated objective function is minimized using inner conjugate gradient iterations. This procedure improves the performance of the algorithm for image deblurring, where we do not have access to a good initial estimate of the underlying image. In addition, the specific form of the cost function allows us to render the spectral analysis for the solutions of the corresponding linear equations. In addition, the proposed approach is general in the sense that we have shown its effectiveness for different restoration problems, including deblurring, denoising, and sharpening. Experimental results verify the effectiveness of the proposed algorithm on both synthetic and real examples.
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
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421 · cited 4×
“Note that the regularization term (7) can be expressed based on the un-normalized graph Laplacian D − K as [23], [34], and [38]: where D = diag { K 1 N } is a diagonal matrix whose i th diagonal element is the sum of the elements of the i th row of K , and 1 N is the N -dimensional vector of all…”
BackgroundInfluentialMean squared error: Love it or leave it? A new look at Signal Fidelity Measures
Wang, Z., & Bovik, A. C. (2009) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.930649 · Cited by 3,175
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
BM3D Frames and Variational Image Deblurring
Danielyan, A., Katkovnik, V., & Egiazarian, K. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2176954 · Cited by 611
Cited by
The Little Engine That Could: Regularization by Denoising (RED)
Romano, Y., Elad, M., & Milanfar, P. (2017) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1102884 · Cited by 934
Self-citationBrief review of image denoising techniques
Fan, L., Zhang, F., Fan, H., & Zhang, C. (2019) · Visual Computing for Industry, Biomedicine, and Art · doi:10.1186/s42492-019-0016-7 · Cited by 669
Deep Image Deblurring: A Survey
Zhang, K., Ren, W., Luo, W., Lai, W.-S., Stenger, B., Yang, M.-H., & Li, H. (2022) · International Journal of Computer Vision · doi:10.1007/s11263-022-01633-5 · Cited by 390
RAISR: Rapid and Accurate Image Super Resolution
Romano, Y., Isidoro, J., & Milanfar, P. (2017) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2016.2629284 · Cited by 280
Self-citationGraph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
Pang, J., & Cheung, G. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2651400 · Cited by 257
Turning a denoiser into a super-resolver using plug and play priors
Brifman, A., Romano, Y., & Elad, M. (2016) · 2016 IEEE International Conference on Image Processing (ICIP) · doi:10.1109/icip.2016.7532589 · Cited by 91
Fast Weighted Total Variation Regularization Algorithm for Blur Identification and Image Restoration
Liu, H., Gu, J., Meng, M. Q.-H., & Lu, W.-S. (2016) · IEEE Access · doi:10.1109/access.2016.2516949 · Cited by 16
“Some researchers also developed an iterative graph-based framework for image restoration based on a new definition of the normalized graph Laplacian methods [34], [35] and their effectiveness for different restoration problems is proved.”
Background
Metadata
- Authors
- Kheradmand, A., & Milanfar, P.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2014-12
- Volume
- 23
- Issue
- 12
- Pages
- 5136-5151
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W1971524069
- Cited by
- 119
- References
- 4
- FWCI
- 12.17
- 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.