Papers
Topics
Authors
Recent
Search
2000 character limit reached

Total Variation Bayesian Learning via Synthesis

Published 3 May 2019 in eess.SP | (1905.01199v1)

Abstract: This paper presents a sparse Bayesian learning algorithm for inverse problems in signal and image processing with a total variation (TV) sparsity prior. Because of the prior used, and the fact that the prior parameters are estimated directly from the data, sparse Bayesian learning often produces more accurate results than the typical maximum a posteriori Bayesian estimates for sparse signal recovery. It also provides a full posterior distribution. However, sparse Bayesian learning is only available to problems with a direct sparsity prior or those formed via synthesis. This paper demonstrates how a problem with a TV sparsity prior can be formulated in a synthesis approach. We then develop a method that combines this synthesis-based TV with the sparse Bayesian learning algorithm and provide numerical examples to demonstrate how our new technique is effectively employed.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.