The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
Open accessAbstract
Inverse imaging problems are inherently underdetermined, and hence, it is important to employ appropriate image priors for regularization. One recent popular prior-the graph Laplacian regularizer-assumes that the target pixel patch is smooth with respect to an appropriately chosen graph. However, the mechanisms and implications of imposing the graph Laplacian regularizer on the original inverse problem are not well understood. To address this problem, in this paper, we interpret neighborhood graphs of pixel patches as discrete counterparts of Riemannian manifolds and perform analysis in the continuous domain, providing insights into several fundamental aspects of graph Laplacian regularization for image denoising. Specifically, we first show the convergence of the graph Laplacian regularizer to a continuous-domain functional, integrating a norm measured in a locally adaptive metric space. Focusing on image denoising, we derive an optimal metric space assuming non-local self-similarity of pixel patches, leading to an optimal graph Laplacian regularizer for denoising in the discrete domain. We then interpret graph Laplacian regularization as an anisotropic diffusion scheme to explain its behavior during iterations, e.g., its tendency to promote piecewise smooth signals under certain settings. To verify our analysis, an iterative image denoising algorithm is developed. Experimental results show that our algorithm performs competitively with state-of-the-art denoising methods, such as BM3D for natural images, and outperforms them significantly for piecewise smooth images.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Scale-space and edge detection using anisotropic diffusion
Perona, P., & Malik, J. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.56205 · Cited by 12,119
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Image denoising by sparse 3-D transform-domain collaborative filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.901238 · Cited by 9,283
Bilateral Filtering for Gray and Color Images
Tomasi, C., & Manduchi, R. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710815 · Cited by 8,177 · cited 2×
“Such a setting is, at a glance, similar to that of bilateral filtering [29].”
BackgroundMethodA Non-Local Algorithm for Image Denoising
Buades, A., Coll, B., & Morel, J.-M. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.38 · Cited by 7,616
On the generalized distance in statistics
Mahalanobis, P. C. (1936) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 6,068
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
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
Anisotropic diffusion in image processing
Weickert, J. (1998) · Cited by 2,225
REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems
Hansen, P. C. (1994) · Numerical Algorithms · doi:10.1007/bf02149761 · Cited by 1,710
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
Kernel Regression for Image Processing and Reconstruction
Takeda, H., Farsiu, S., & Milanfar, P. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.888330 · Cited by 1,340
Axioms and fundamental equations of image processing
Alvarez, L., Guichard, F., Lions, P. L., & Morel, J. M. (1993) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00375127 · Cited by 994
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
Chan, T. F., Golub, G. H., & Mulet, P. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299767 · Cited by 840
A general framework for low level vision
Sochen, N., Kimmel, R., & Malladi, R. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661181 · Cited by 615
A Tour of Modern Image Filtering: New Insights and Methods, Both Practical and Theoretical
Milanfar, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2179329 · Cited by 605
Nonlocal Linear Image Regularization and Supervised Segmentation
Gilboa, G., & Osher, S. (2007) · Multiscale Modeling & Simulation · doi:10.1137/060669358 · Cited by 468
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing
Elmoataz, A., Lezoray, O., & Bougleux, S. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924284 · Cited by 466
Towards a theoretical foundation for Laplacian-based manifold methods
Belkin, M., & Niyogi, P. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.08.006 · Cited by 464
Chatterjee, P., & Milanfar, P. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2037087 · Cited by 422
Representing Local Structure Using Tensors II
Knutsson, H., Westin, C.-F., & Andersson, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21227-7_51 · Cited by 355
From graph to manifold Laplacian: The convergence rate
Singer, A. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.03.004 · Cited by 316
Patch-Based Near-Optimal Image Denoising
Chatterjee, P., & Milanfar, P. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2172799 · Cited by 296
Theoretical Foundations of Anisotropic Diffusion in Image Processing
Weickert, J. (1996) · Computing Supplement · doi:10.1007/978-3-7091-6586-7_13 · Cited by 264
Graph Laplacians and their convergence on random neighborhood graphs
Hein, M., Audibert, J.-Y., & Ulrike Von Luxburg, A. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0608522 · Cited by 208
Talebi, H., & Milanfar, P. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2293425 · Cited by 200
Graph spectral image smoothing using the heat kernel
Zhang, F., & Hancock, E. R. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.05.007 · Cited by 176
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
Belkin, M. A., & Niyogi, P. (2005) · Lecture notes in computer science · doi:10.1007/11503415_33 · Cited by 174
Random Walk Graph Laplacian-Based Smoothness Prior for Soft Decoding of JPEG Images
Liu, X., Cheung, G., Wu, X., & Zhao, D. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2627807 · Cited by 140
Self-citationStructure Tensor Total Variation
Lefkimmiatis, S., Roussos, A., Maragos, P. A., & Unser, M. A. (2015) · SIAM Journal on Imaging Sciences · doi:10.1137/14098154x · Cited by 132
Progressive Image Denoising Through Hybrid Graph Laplacian Regularization: A Unified Framework
Liu, X., Zhai, D., Zhao, D., Zhai, G., & Gao, W. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2303638 · Cited by 120
A General Framework for Regularized, Similarity-Based Image Restoration
Kheradmand, A., & Milanfar, P. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2362059 · Cited by 114
An Analysis of the Convergence of Graph LaplaciansPreprint
Ting, D., Huang, L., & Jordan, M. I. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.5435 · Cited by 98
Depth map denoising using graph-based transform and group sparsity
Hu, W., Li, X., Cheung, G., & Au, O. C. (2013) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp.2013.6659254 · Cited by 91
Self-citationOptimal graph laplacian regularization for natural image denoising
Pang, J., Cheung, G., Ortega, A., & Au, O. C. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178380 · Cited by 69
Self-citationUniform Convergence of Adaptive Graph-Based Regularization
Hein, M. (2006) · Lecture notes in computer science · doi:10.1007/11776420_7 · Cited by 67
Image Bit-Depth Enhancement via Maximum A Posteriori Estimation of AC Signal
Wan, P., Cheung, G., Florencio, D. A. F., Zhang, C., & Au, O. C. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2553523 · Cited by 54
Self-citationSelf-similarity-based image denoising
Buades, A., Coll, B., & Morel, J. (2011) · Communications of the ACM · doi:10.1145/1941487.1941513 · Cited by 39
A graph-based joint bilateral approach for depth enhancement
Wang, Y., Ortega, A., Tian, D., et al. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6853724 · Cited by 36
Noise Reduction in Surface Reconstruction from a Given Gradient Field
Karaçalı, B., & Snyder, W. E. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000027788.50090.b6 · Cited by 32
Redefining self-similarity in natural images for denoising using graph signal gradient
Pang, J., Cheung, G., Hu, W., et al. (2014) · doi:10.1109/apsipa.2014.7041627 · Cited by 25
Self-citationA general framework for kernel similarity-based image denoising
Kheradmand, A., & Milanfar, P. (2013) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2013.6736903 · Cited by 25
Diffusion and Superposition Distances for Signals Supported on Networks
Segarra, S., Huang, W., & Ribeiro, A. (2015) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2015.2429471 · Cited by 24
Polyakov Action Minimization for Efficient Color Image Processing
Rosman, G., Tai, X., Dascal, L., & Kimmel, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-35740-4_5 · Cited by 16
Efficient Beltrami Flow in Patch-Space
Wetzler, A., & Kimmel, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-24785-9_12 · Cited by 16
Image denoising using local adaptive layered Wiener filter in the gradient domain
Zhang, X., & Feng, X. (2014) · Multimedia Tools and Applications · doi:10.1007/s11042-014-2182-0 · Cited by 9
Cited by
Quantifying the effect of experimental perturbations at single-cell resolution
Burkhardt, D. B., Stanley, J. S., Tong, A., Perdigoto, A. L., Gigante, S. A., Herold, K. C., Wolf, G., Giraldez, A. J., van Dijk, D., & Krishnaswamy, S. (2021) · Nature Biotechnology · doi:10.1038/s41587-020-00803-5 · Cited by 226
Metadata
- Authors
- Pang, J., & Cheung, G.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2017-04
- Volume
- 26
- Issue
- 4
- Pages
- 1770-1785
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2571662414
- Cited by
- 257
- References
- 48
- FWCI
- 9.10
- Type
- journal article
- Language
- en
- Open access
- green
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.