The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
Abstract
Blur removal is an important problem in signal and image processing. The blurring matrices obtained by using the zero boundary condition (corresponding to assuming dark background outside the scene) are Toeplitz matrices for one-dimensional problems and block-Toeplitz--Toeplitz-block matrices for two-dimensional cases. They are computationally intensive to invert especially in the block case. If the periodic boundary condition is used, the matrices become (block) circulant and can be diagonalized by discrete Fourier transform matrices. In this paper, we consider the use of the Neumann boundary condition (corresponding to a reflection of the original scene at the boundary). The resulting matrices are (block) Toeplitz-plus-Hankel matrices. We show that for symmetric blurring functions, these blurring matrices can always be diagonalized by discrete cosine transform matrices. Thus the cost of inversion is significantly lower than that of using the zero or periodic boundary conditions. We also show that the use of the Neumann boundary condition provides an easy way of estimating the regularization parameter when the generalized cross-validation is used. When the blurring function is nonsymmetric, we show that the optimal cosine transform preconditioner of the blurring matrix is equal to the blurring matrix generated by the symmetric part of the blurring function. Numerical results are given to illustrate the efficiency of using the Neumann boundary condition.
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
Fundamentals of digital image processing
Jain, A. K. (1988) · Cited by 7,111
Regularization of Inverse Problems
Engl, H. W., Hanke, M., & Neubauer, A. (1996) · Springer eBooks · doi:10.1007/978-94-009-1740-8 · Cited by 5,275
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
Two-Dimensional Signal and Image Processing
Lim, J. S. (1989) · Medical Entomology and Zoology · Cited by 2,561
Discrete Cosine Transform: Algorithms, Advantages, Applications
Rao, K. R., Yip, P. C. Y., & Britaňák, V. (1990) · Cited by 1,862
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
Banham, M. R., & Katsaggelos, A. K. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.581363 · Cited by 1,678
An exact recursion for the composite nearest-neighbor degeneracy for a 2×N lattice space
McQuistan, R. B., & Hock, J. L. (1984) · Journal of Mathematical Physics · doi:10.1063/1.526133 · Cited by 924
Conjugate Gradient Methods for Toeplitz Systems
Chan, R. H., & Ng, M. K. (1996) · SIAM Review · doi:10.1137/s0036144594276474 · Cited by 801
Self-citationStrang, G. (1999) · SIAM Review · doi:10.1137/s0036144598336745 · Cited by 788
Cited by
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
A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
Yang, J., Yin, W., Zhang, Y., & Wang, Y. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080730421 · Cited by 529
Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
Nikolova, M., & Ng, M. K. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030600862 · Cited by 478
Self-citationA framelet-based image inpainting algorithm
Cai, J.-F., Chan, R. H., & Shen, Z. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.10.002 · Cited by 338
Self-citationAn Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
Yang, J., Zhang, Y., & Yin, W. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080732894 · Cited by 336
Metadata
- Authors
- Ng, M. K., Chan, R. H., & Tang, W.-C.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1999-01
- Volume
- 21
- Issue
- 3
- Pages
- 851-866
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2086600055
- Cited by
- 452
- References
- 17
- FWCI
- 5.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions. https://app.cochat.ai/papers/10.1137/s1064827598341384
- The paper
- Ng, M. K., Chan, R. H., & Tang, W.-C. (1999). A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827598341384
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.