@Article{JCM-41-2,
author = {V., Churchill and Gelb, A.},
title = {Estimation and Uncertainty Quantification for Piecewise Smooth Signal Recovery},
journal = {Journal of Computational Mathematics},
year = {2023},
volume = {41},
number = {2},
pages = {246--262},
abstract = {<p style="text-align: justify;">This paper presents an application of the sparse Bayesian learning (SBL) algorithm to linear inverse problems with a high order total variation (HOTV) sparsity prior. For the problem of sparse signal recovery, SBL often produces more accurate estimates than maximum a posteriori&nbsp;estimates, including those that use $\ell_1$ regularization. Moreover, rather than a single signal estimate, SBL yields a full posterior density estimate which can be used for uncertainty quantification. However, SBL is only immediately applicable to problems having a direct&nbsp;sparsity prior, or to those that can be formed via synthesis. This paper demonstrates how a problem with an HOTV sparsity prior can be formulated via synthesis, and then utilizes SBL. This expands the class of problems available to Bayesian learning to include, e.g., inverse problems dealing with the recovery of piecewise smooth functions or signals from data. Numerical examples are provided to demonstrate how this new technique is effectively employed.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2110-m2021-0157},
url = {https://global-sci.com/article/84114/estimation-and-uncertainty-quantification-for-piecewise-smooth-signal-recovery}
}