The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Nonlocal Linear Image Regularization and Supervised Segmentation
Abstract
A nonlocal quadratic functional of weighted differences is examined. The weights are based on image features and represent the affinity between different pixels in the image. By prescribing different formulas for the weights, one can generalize many local and nonlocal linear denoising algorithms, including the nonlocal means filter and the bilateral filter. In this framework one can easily show that continuous iterations of the generalized filter obey certain global characteristics and converge to a constant solution. The linear operator associated with the Euler–Lagrange equation of the functional is closely related to the graph Laplacian. We can thus interpret the steepest descent for minimizing the functional as a nonlocal diffusion process. This formulation allows a convenient framework for nonlocal variational minimizations, including variational denoising, Bregman iterations, and the recently proposed inverse scale space. It is also demonstrated how the steepest descent flow can be used for segmentation. Following kernel based methods in machine learning, the generalized diffusion process is used to propagate sporadic initial user's information to the entire image. Unlike classical variational segmentation methods, the process is not explicitly based on a curve length energy and thus can cope well with highly nonconvex shapes and corners. Reasonable robustness to noise is still achieved.
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
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
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
Self-citationNormalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
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
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Caselles, V., Kimmel, R., & Sapiro, G. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007979827043 · Cited by 5,244
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
Cited by
Nonlocal Operators with Applications to Image Processing
Gilboa, G., & Osher, S. (2009) · Multiscale Modeling & Simulation · doi:10.1137/070698592 · Cited by 1,423
Self-citationNonlocal Image and Movie Denoising
Buades, A., Coll, B., & Morel, J.-M. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0052-1 · Cited by 769
Generalizing the Nonlocal-Means to Super-Resolution Reconstruction
Protter, M., Elad, M., Takeda, H., & Milanfar, P. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2008067 · Cited by 707
Image super-resolution: the techniques, applications, and future
Yue, L., Shen, H., Li, J., Yuan, Q., Zhang, H., & Zhang, L. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.05.002 · Cited by 554
“regularization [47], NLTV regularization [114], and the original HR image.”
BackgroundNonlocal 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
Image Denoising Methods. A New Nonlocal Principle
Buades, A., Coll, B., & Morel, J. M. (2010) · SIAM Review · doi:10.1137/090773908 · Cited by 442
From Local Kernel to Nonlocal Multiple-Model Image Denoising
Katkovnik, V., Foi, A., Egiazarian, K., & Astola, J. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0272-7 · Cited by 353
Image Recovery via Nonlocal Operators
Lou, Y., Zhang, X., Osher, S., & Bertozzi, A. (2010) · Journal of Scientific Computing · doi:10.1007/s10915-009-9320-2 · Cited by 340
Self-citationRemoving Multiplicative Noise by Douglas-Rachford Splitting Methods
Steidl, G., & Teuber, T. (2010) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-009-0179-5 · Cited by 287
Patch-Based Nonlocal Functional for Denoising Fluorescence Microscopy Image Sequences
Boulanger, J., Kervrann, C., Bouthemy, P., Elbau, P., Sibarita, J.-B., & Salamero, J. (2010) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2033991 · Cited by 281
Clustering-Based Denoising With Locally Learned Dictionaries
Chatterjee, P., & Milanfar, P. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2018575 · Cited by 280
A Comprehensive Framework for Image Inpainting
Bugeau, A., Bertalmío, M., Caselles, V., & Sapiro, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049240 · Cited by 257
Graph 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
Metadata
- Authors
- Gilboa, G., & Osher, S.
- Venue
- Multiscale Modeling & Simulation
- Published
- 2007-01
- Volume
- 6
- Issue
- 2
- Pages
- 595-630
- ISSN
- 1540-3459 (ISSN-L)
- 1540-3467
- OpenAlex
- W2019248995
- Cited by
- 468
- References
- 48
- FWCI
- 34.04
- 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.