The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Iterative Methods for Total Variation Denoising
Abstract
Total variation (TV) methods are very effective for recovering “blocky,” possibly discontinuous, images from noisy data. A fixed point algorithm for minimizing a TV penalized least squares functional is presented and compared with existing minimization schemes. A variant of the cell-centered finite difference multigrid method of Ewing and Shen is implemented for solving the (large, sparse) linear subproblems. Numerical results are presented for one- and two-dimensional examples; in particular, the algorithm is applied to actual data obtained from confocal microscopy.
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
Spline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
Cited by
Sidky, E. Y., & Pan, X. (2008) · Physics in Medicine and Biology · doi:10.1088/0031-9155/53/17/021 · Cited by 1,995
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
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
A Fast Total Variation Minimization Method for Image Restoration
Huang, Y., Ng, M. K., & Wen, Y.-W. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070703533 · Cited by 218
Unified Blind Method for Multi-Image Super-Resolution and Single/Multi-Image Blur Deconvolution
Faramarzi, E., Rajan, D., & Christensen, M. P. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2237915 · Cited by 93
Noise correlation in CBCT projection data and its application for noise reduction in low‐dose CBCT
Zhang, H., Ouyang, L., Ma, J., Huang, J., Chen, W., & Wang, J. (2014) · Medical Physics · doi:10.1118/1.4865782 · Cited by 47
Metadata
- Authors
- Vogel, C. R., & Oman, M. E.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1996-01
- Volume
- 17
- Issue
- 1
- Pages
- 227-238
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2167400582
- Cited by
- 1,076
- References
- 1
- FWCI
- 26.84
- 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.
