Parameter Selection by GCV and a $χ^2$ test within Iterative Methods for $\ell_1$-regularized Inverse Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912154193494016 |
|---|---|
| author | Sweeney, Brian Renaut, Rosemary Español, Malena |
| author_facet | Sweeney, Brian Renaut, Rosemary Español, Malena |
| contents | $\ell_1$ regularization is used to preserve edges or enforce sparsity in a solution to an inverse problem. We investigate the Split Bregman and the Majorization-Minimization iterative methods that turn this non-smooth minimization problem into a sequence of steps that include solving an $\ell_2$-regularized minimization problem. We consider selecting the regularization parameter in the inner generalized Tikhonov regularization problems that occur at each iteration in these $\ell_1$ iterative methods. The generalized cross validation and $χ^2$ degrees of freedom methods are extended to these inner problems. In particular, for the $χ^2$ method this includes extending the $χ^2$ result for problems in which the regularization operator has more rows than columns, and showing how to use the $A-$weighted generalized inverse to estimate prior information at each inner iteration. Numerical experiments for image deblurring problems demonstrate that it is more effective to select the regularization parameter automatically within the iterative schemes than to keep it fixed for all iterations. Moreover, an appropriate regularization parameter can be estimated in the early iterations and used fixed to convergence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_19156 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parameter Selection by GCV and a $χ^2$ test within Iterative Methods for $\ell_1$-regularized Inverse Problems Sweeney, Brian Renaut, Rosemary Español, Malena Numerical Analysis 65F22, 65F10, 68W40 $\ell_1$ regularization is used to preserve edges or enforce sparsity in a solution to an inverse problem. We investigate the Split Bregman and the Majorization-Minimization iterative methods that turn this non-smooth minimization problem into a sequence of steps that include solving an $\ell_2$-regularized minimization problem. We consider selecting the regularization parameter in the inner generalized Tikhonov regularization problems that occur at each iteration in these $\ell_1$ iterative methods. The generalized cross validation and $χ^2$ degrees of freedom methods are extended to these inner problems. In particular, for the $χ^2$ method this includes extending the $χ^2$ result for problems in which the regularization operator has more rows than columns, and showing how to use the $A-$weighted generalized inverse to estimate prior information at each inner iteration. Numerical experiments for image deblurring problems demonstrate that it is more effective to select the regularization parameter automatically within the iterative schemes than to keep it fixed for all iterations. Moreover, an appropriate regularization parameter can be estimated in the early iterations and used fixed to convergence. |
| title | Parameter Selection by GCV and a $χ^2$ test within Iterative Methods for $\ell_1$-regularized Inverse Problems |
| topic | Numerical Analysis 65F22, 65F10, 68W40 |
| url | https://arxiv.org/abs/2404.19156 |