Graph approximation and generalized Tikhonov regularization for signal deblurring

MaRDI QIDQ6370725zbMATH OpenFDO

Authors Davide Bianchi, Marco Donatelli

Publication date 19 June 2021

Abstract: Given a compact linear operator $K$, the (pseudo) inverse $K^{d}agger$ is usually substituted by a family of regularizing operators $R_{a}lpha$ which depends on $K$ itself. Naturally, in the actual computation we are forced to approximate the true continuous operator $K$ with a discrete operator $K^{(n)}$ characterized by a finesses discretization parameter $n$, and obtaining then a discretized family of regularizing operators $R_{a}lph{a}^{(n)}$. In general, the numerical scheme applied to discretize $K$ does not preserve, asymptotically, the full spectrum of $K$. In the context of a generalized Tikhonov-type regularization, we show that a graph-based approximation scheme that guarantees, asymptotically, a zero maximum relative spectral error can significantly improve the approximated solutions given by $R_{a}lph{a}^{(n)}$. This approach is combined with a graph based regularization technique with respect to the penalty term.

This page was built for publication: Graph approximation and generalized Tikhonov regularization for signal deblurring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370725)