pith. sign in

arxiv: 1703.08240 · v1 · pith:HP3YCWCMnew · submitted 2017-03-23 · 🧮 math.OC

Efficient regularization with wavelet sparsity constraints in PAT

classification 🧮 math.OC
keywords reconstructionmethodcaseconstraintsdataefficientformularegularization
0
0 comments X
read the original abstract

In this paper we consider the reconstruction problem of photoacoustic tomography (PAT) with a flat observation surface. We develop a direct reconstruction method that employs regularization with wavelet sparsity constraints. To that end, we derive a wavelet-vaguelette decomposition (WVD) for the PAT forward operator and a corresponding explicit reconstruction formula in the case of exact data. In the case of noisy data, we combine the WVD reconstruction formula with soft-thresholding which yields a spatially adaptive estimation method. We demonstrate that our method is statistically optimal for white random noise if the unknown function is assumed to lie in any Besov-ball. We present generalizations of this approach and, in particular, we discuss the combination of vaguelette soft-thresholding with a TV prior. We also provide an efficient implementation of the vaguelette transform that leads to fast image reconstruction algorithms supported by numerical results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.