Adaptive Regularization of Some Inverse Problems in Image Analysis
Not on the map. Why?
Abstract (arXiv)
We present an adaptive regularization scheme for optimizing composite energy functionals arising in image analysis problems. The scheme automatically trades off data fidelity and regularization depending on the current data fit during the iterative optimization, so that regularization is strongest initially, and wanes as data fidelity improves, with the weight of the regularizer being minimized at convergence. We also introduce the use of a Huber loss function in both data fidelity and regularization terms, and present an efficient convex optimization algorithm based on the alternating direction method of multipliers (ADMM) using the equivalent relation between the Huber function and the proximal operator of the one-norm. We illustrate and validate our adaptive Huber-Huber model on synthetic and real images in segmentation, motion estimation, and denoising problems.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2.
4 papers.
- 2021An Adaptive Framework for Learning Unsupervised Depth Completioncited by 30
- 2022Monitored Distillation for Positive Congruent Depth Completioncited by 24
- 2023Heteroscedastic Uncertainty Estimation Framework for Unsupervised Registrationcited by 14
- 2023Adaptive Correspondence Scoring for Unsupervised Medical Image Registrationcited by 9
- 2023Adaptive Correspondence Scoring for Unsupervised Medical Image Registration1 Dec 2023
- 2023Heteroscedastic Uncertainty Estimation Framework for Unsupervised Registration1 Dec 2023
- 2022Monitored Distillation for Positive Congruent Depth Completion30 Mar 2022
- 2021An Adaptive Framework for Learning Unsupervised Depth Completion6 Jun 2021