28 research outputs found
First order algorithms in variational image processing
Variational methods in imaging are nowadays developing towards a quite
universal and flexible tool, allowing for highly successful approaches on tasks
like denoising, deblurring, inpainting, segmentation, super-resolution,
disparity, and optical flow estimation. The overall structure of such
approaches is of the form ; where the functional is a data fidelity term also
depending on some input data and measuring the deviation of from such
and is a regularization functional. Moreover is a (often linear)
forward operator modeling the dependence of data on an underlying image, and
is a positive regularization parameter. While is often
smooth and (strictly) convex, the current practice almost exclusively uses
nonsmooth regularization functionals. The majority of successful techniques is
using nonsmooth and convex functionals like the total variation and
generalizations thereof or -norms of coefficients arising from scalar
products with some frame system. The efficient solution of such variational
problems in imaging demands for appropriate algorithms. Taking into account the
specific structure as a sum of two very different terms to be minimized,
splitting algorithms are a quite canonical choice. Consequently this field has
revived the interest in techniques like operator splittings or augmented
Lagrangians. Here we shall provide an overview of methods currently developed
and recent results as well as some computational studies providing a comparison
of different methods and also illustrating their success in applications.Comment: 60 pages, 33 figure
On the Adjoint Operator in Photoacoustic Tomography
Photoacoustic Tomography (PAT) is an emerging biomedical "imaging from
coupled physics" technique, in which the image contrast is due to optical
absorption, but the information is carried to the surface of the tissue as
ultrasound pulses. Many algorithms and formulae for PAT image reconstruction
have been proposed for the case when a complete data set is available. In many
practical imaging scenarios, however, it is not possible to obtain the full
data, or the data may be sub-sampled for faster data acquisition. In such
cases, image reconstruction algorithms that can incorporate prior knowledge to
ameliorate the loss of data are required. Hence, recently there has been an
increased interest in using variational image reconstruction. A crucial
ingredient for the application of these techniques is the adjoint of the PAT
forward operator, which is described in this article from physical, theoretical
and numerical perspectives. First, a simple mathematical derivation of the
adjoint of the PAT forward operator in the continuous framework is presented.
Then, an efficient numerical implementation of the adjoint using a k-space time
domain wave propagation model is described and illustrated in the context of
variational PAT image reconstruction, on both 2D and 3D examples including
inhomogeneous sound speed. The principal advantage of this analytical adjoint
over an algebraic adjoint (obtained by taking the direct adjoint of the
particular numerical forward scheme used) is that it can be implemented using
currently available fast wave propagation solvers.Comment: submitted to "Inverse Problems
Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous Motion Estimation
A crucial limitation of current high-resolution 3D photoacoustic tomography
(PAT) devices that employ sequential scanning is their long acquisition time.
In previous work, we demonstrated how to use compressed sensing techniques to
improve upon this: images with good spatial resolution and contrast can be
obtained from suitably sub-sampled PAT data acquired by novel acoustic scanning
systems if sparsity-constrained image reconstruction techniques such as total
variation regularization are used. Now, we show how a further increase of image
quality can be achieved for imaging dynamic processes in living tissue (4D
PAT). The key idea is to exploit the additional temporal redundancy of the data
by coupling the previously used spatial image reconstruction models with
sparsity-constrained motion estimation models. While simulated data from a
two-dimensional numerical phantom will be used to illustrate the main
properties of this recently developed
joint-image-reconstruction-and-motion-estimation framework, measured data from
a dynamic experimental phantom will also be used to demonstrate their potential
for challenging, large-scale, real-world, three-dimensional scenarios. The
latter only becomes feasible if a carefully designed combination of tailored
optimization schemes is employed, which we describe and examine in more detail