1 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
Iterated graph Laplacian for image restoration problems
Stefano Aleotti, Davide Bianchi, Florian Bossmann +2
We study the graph Laplacian operator as a regularizer in a generalized Tikhonov framework for linear ill-posed problems. The Laplacian is updated iteratively from the current reco…
The iterated Golub-Kahan-Tikhonov method
Davide Bianchi, Marco Donatelli, Davide Furchì +1
The Golub-Kahan-Tikhonov method is a popular solution technique for large linear discrete ill-posed problems. This method first applies partial Golub-Kahan bidiagonalization to red…
A data-dependent regularization method based on the graph Laplacian
Davide Bianchi, Davide Evangelista, Stefano Aleotti +3
We investigate a variational method for ill-posed problems, named , which embeds a graph Laplacian operator in the regularization term. The novelty of this meth…
Convergence analysis and parameter estimation for the iterated Arnoldi-Tikhonov method
Davide Bianchi, Marco Donatelli, Davide Furchì +1
The Arnoldi-Tikhonov method is a well-established regularization technique for solving large-scale ill-posed linear inverse problems. This method leverages the Arnoldi decompositio…