Greedy techniques for inverse problems
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917122530082816 |
|---|---|
| author | Bruno, L. Bruni Massa, P. Perracchione, E. Trombini, M. |
| author_facet | Bruno, L. Bruni Massa, P. Perracchione, E. Trombini, M. |
| contents | Inverse imaging problems rely on limited and indirect measurements, making reconstruction highly dependent on both regularization and sample locations. We introduce a novel greedy framework for the optimal selection of indirect measurements in the operator codomain, specifically tailored to inverse problems. Our approach employs a two-step scheme combining kernel-based interpolation and extrapolation. Within this framework, greedy schemes can be residual-based, where points are selected according to the current approximation error for a specific target function, or error-based, where points are chosen using a priori error indicators independent of the residual. For the latter, we derive explicit error bounds that quantify the propagation of approximation errors through both interpolation and extrapolation. Numerical applications to solar hard X-ray imaging demonstrate that the proposed greedy sampling strategy achieves high-quality reconstructions using only a few available measurements. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_04046 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Greedy techniques for inverse problems Bruno, L. Bruni Massa, P. Perracchione, E. Trombini, M. Numerical Analysis Inverse imaging problems rely on limited and indirect measurements, making reconstruction highly dependent on both regularization and sample locations. We introduce a novel greedy framework for the optimal selection of indirect measurements in the operator codomain, specifically tailored to inverse problems. Our approach employs a two-step scheme combining kernel-based interpolation and extrapolation. Within this framework, greedy schemes can be residual-based, where points are selected according to the current approximation error for a specific target function, or error-based, where points are chosen using a priori error indicators independent of the residual. For the latter, we derive explicit error bounds that quantify the propagation of approximation errors through both interpolation and extrapolation. Numerical applications to solar hard X-ray imaging demonstrate that the proposed greedy sampling strategy achieves high-quality reconstructions using only a few available measurements. |
| title | Greedy techniques for inverse problems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2512.04046 |