The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
Abstract
We address the minimization of regularized convex cost functions which are customarily used for edge-preserving restoration and reconstruction of signals and images. In order to accelerate computation, the multiplicative and the additive half-quadratic reformulation of the original cost-function have been pioneered in Geman and Reynolds [IEEE Trans. Pattern Anal. Machine Intelligence, 14 (1992), pp. 367--383] and Geman and Yang IEEE Trans. Image Process., 4 (1995), pp. 932--946]. The alternate minimization of the resultant (augmented) cost-functions has a simple explicit form. The goal of this paper is to provide a systematic analysis of the convergence rate achieved by these methods. For the multiplicative and additive half-quadratic regularizations, we determine their upper bounds for their root-convergence factors. The bound for the multiplicative form is seen to be always smaller than the bound for the additive form. Experiments show that the number of iterations required for convergence for the multiplicative form is always less than that for the additive form. However, the computational cost of each iteration is much higher for the multiplicative form than for the additive form. The global assessment is that minimization using the additive form of half-quadratic regularization is faster than using the multiplicative form. When the additive form is applicable, it is hence recommended. Extensive experiments demonstrate that in our MATLAB implementation, both methods are substantially faster (in terms of computational times) than the standard MATLAB Optimization Toolbox routines used in our comparison study.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Inverse Problem Theory: Methods for Data Fitting and Model Parameter Estimation
Tarantola, A. (1987) · International Linear Collider · Cited by 2,193
Deterministic edge-preserving regularization in computed imaging
Charbonnier, P., Blanc-Feraud, L., Aubert, G., & Barlaud, M. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.551699 · Cited by 1,301
Markov Random Field Modeling in Computer Vision
Li, S. Z. (1995) · Computer Science Workbench · doi:10.1007/978-4-431-66933-3 · Cited by 1,276
Bayesian reconstructions from emission tomography data using a modified EM algorithm
Green, P. J. (1990) · IEEE Transactions on Medical Imaging · doi:10.1109/42.52985 · Cited by 1,241
Iterative solution of nonlinear equations
Murphy, R. D. (1994) · Cited by 1,192
Constrained restoration and the recovery of discontinuities
Geman, D., & Reynolds, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.120331 · Cited by 1,085
Aubert, G., & Kornprobst, P. (2006) · Applied Mathematical Sciences · doi:10.1007/978-0-387-44588-5 · Cited by 1,060
Nonlinear image recovery with half-quadratic regularization
Geman, D., & Yang, C. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.392335 · Cited by 1,000
Aubert, G., & Kornprobst, P. (2002) · Applied Mathematical Sciences · doi:10.1007/b97428 · Cited by 983
A generalized Gaussian image model for edge-preserving MAP estimation
Bouman, C., & Sauer, K. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.236536 · Cited by 884
Two deterministic half-quadratic regularization algorithms for computed imaging
Charbonnier, P., Blanc-Feraud, L., Aubert, G., & Barlaud, M. (2002) · Proceedings of 1st International Conference on Image Processing · doi:10.1109/icip.1994.413553 · Cited by 879
Analysis of bounded variation penalty methods for ill-posed problems
Acar, R., & Vogel, C. R. (1994) · Inverse Problems · doi:10.1088/0266-5611/10/6/003 · Cited by 818
Conjugate Gradient Methods for Toeplitz Systems
Chan, R. H., & Ng, M. K. (1996) · SIAM Review · doi:10.1137/s0036144594276474 · Cited by 801
Self-citationBlack, M. J., & Rangarajan, A. (1996) · International Journal of Computer Vision · doi:10.1007/bf00131148 · Cited by 757
Image reconstruction and restoration: overview of common estimation structures and problems
Demoment, G. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45551 · Cited by 647
A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
Ng, M. K., Chan, R. H., & Tang, W.-C. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598341384 · Cited by 452
Self-citationDisplacement Structure: Theory and Applications
Kailath, T., & Sayed, A. H. (1995) · SIAM Review · doi:10.1137/1037082 · Cited by 436
A Variational Method in Image Recovery
Aubert, G., & Vese, L. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s003614299529230x · Cited by 309
Delaney, A. H., & Bresler, Y. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.660997 · Cited by 304
Local Strong Homogeneity of a Regularized Estimator
Nikolova, M. (2000) · SIAM Journal on Applied Mathematics · doi:10.1137/s0036139997327794 · Cited by 291
Self-citationConvex half-quadratic criteria and interacting auxiliary variables for image restoration
Idier, J. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.931094 · Cited by 151
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
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Hyperspectral Image Denoising via Tensor Low-Rank Prior and Unsupervised Deep Spatial–Spectral Prior
Wu, W.-H., Huang, T.-Z., Zhao, X.-L., Wang, J.-L., & Zheng, Y.-B. (2022) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2022.3228927 · Cited by 425
Robust Principal Component Analysis Based on Maximum Correntropy Criterion
He, R., Hu, B.-G., Zheng, W.-S., & Kong, X.-W. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2103949 · Cited by 359
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
He, R., Zheng, W.-S., Tan, T., & Sun, Z. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.102 · Cited by 342
Metadata
- Authors
- Nikolova, M., & Ng, M. K.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2005-01
- Volume
- 27
- Issue
- 3
- Pages
- 937-966
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2030507150
- Cited by
- 478
- References
- 27
- FWCI
- 6.38
- 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.