arXiv subjects

Markus Haltmeier

Publications and source records attributed to Markus Haltmeier.

120 records · Page 7Linked to original sources

arXiv2016

Analytic inversion of a conical Radon transform arising in application of Compton cameras on the cylinder

Single photon emission computed tomography (SPECT) is a well established clinical tool for functional imaging. A limitation of current SPECT systems is the use of mechanical collimation, where only a small fraction of the emitted photons is actually used for image reconstruction. This results in large noise level and finally in a limited spatial resolution. In order to decrease the noise level and to increase the imaging resolution, Compton cameras have been proposed as an alternative to mechanical collimators. Image reconstruction in SPECT with Compton cameras yields to the problem of recovering a marker distribution from integrals over conical surfaces. Due to this and other applications, such conical Radon transforms recently got significant attention. In the current paper we consider the case where the cones of integration have vertices on a circular cylinder and axis pointing to the symmetry axis of the cylinder. As main results we derive analytic reconstruction methods for the considered transform. We also investigate the V-line transform with vertices on a circle and symmetry axis orthogonal to the circle, which arises in the special case where the absorber distribution is located in a horizontal plane.

math.NA↗

arXiv2016

The Radon Transform over Cones with Vertices on the Sphere and Orthogonal Axes

Recovering a function from its integrals over circular cones recently gained significance because of its relevance to novel medical imaging technologies such emission tomography using Compton cameras. In this paper we investigate the case where the vertices of the cones of integration are restricted to a sphere in $n$-dimensional space and symmetry axes are orthogonal to the sphere. We show invertibility of the considered transform and develop an inversion method based on series expansion and reduction to a system of one-dimensional integral equations of generalized Abel type. Because the arising kernels do not satisfy standard assumptions, we also develop a uniqueness result for generalized Abel equations where the kernel has zeros on the diagonal. Finally, we demonstrate how to numerically implement our inversion method and present numerical results.

math.NA↗

arXiv2015

Single-stage reconstruction algorithm for quantitative photoacoustic tomography

The development of efficient and accurate image reconstruction algorithms is one of the cornerstones of computed tomography. Existing algorithms for quantitative photoacoustic tomography currently operate in a two-stage procedure: First an inverse source problem for the acoustic wave propagation is solved, whereas in a second step the optical parameters are estimated from the result of the first step. Such an approach has several drawbacks. In this paper we therefore propose the use of single-stage reconstruction algorithms for quantitative photoacoustic tomography, where the optical parameters are directly reconstructed from the observed acoustical data. In that context we formulate the image reconstruction problem of quantitative photoacoustic tomography as a single nonlinear inverse problem by coupling the radiative transfer equation with the acoustic wave equation. The inverse problem is approached by Tikhonov regularization with a convex penalty in combination with the proximal gradient iteration for minimizing the Tikhonov functional. We present numerical results, where the proposed single-stage algorithm shows an improved reconstruction quality at a similar computational cost.

math.AP↗

arXiv2015

A Novel Compressed Sensing Scheme for Photoacoustic Tomography

Speeding up the data acquisition is one of the central aims to advance tomographic imaging. On the one hand, this reduces motion artifacts due to undesired movements, and on the other hand this decreases the examination time for the patient. In this article, we propose a new scheme for speeding up the data collection process in photoacoustic tomography. Our proposal is based on compressed sensing and reduces acquisition time and system costs while maintaining image quality. As measurement data we use random combinations of pressure values that we use to recover a complete set of pressure data prior to the actual image reconstruction. We obtain theoretical recovery guarantees for our compressed sensing scheme and support the theory by reconstruction results on simulated data as well as on experimental data.

math.NA↗

arXiv2014

Universal inversion formulas for recovering a function from spherical means

The problem of reconstruction a function from spherical means is at the heart of several modern imaging modalities and other applications. In this paper we derive universal back-projection type reconstruction formulas for recovering a function in arbitrary dimension from averages over spheres centered on the boundary an arbitrarily shaped smooth convex domain. Provided that the unknown function is supported inside that domain, the derived formulas recover the unknown function up to an explicitly computed smoothing integral operator. For elliptical domains the integral operator is shown to vanish and hence we establish exact inversion formulas for recovering a function from spherical means centered on the boundary of elliptical domains in arbitrary dimension.

math.AP↗

arXiv2013

Aggregated motion estimation for real-time MRI reconstruction

Real-time magnetic resonance imaging (MRI) methods generally shorten the measuring time by acquiring less data than needed according to the sampling theorem. In order to obtain a proper image from such undersampled data, the reconstruction is commonly defined as the solution of an inverse problem, which is regularized by a priori assumptions about the object. While practical realizations have hitherto been surprisingly successful, strong assumptions about the continuity of image features may affect the temporal fidelity of the estimated images. Here we propose a novel approach for the reconstruction of serial real-time MRI data which integrates the deformations between nearby frames into the data consistency term. The method is not required to be affine or rigid and does not need additional measurements. Moreover, it handles multi-channel MRI data by simultaneously determining the image and its coil sensitivity profiles in a nonlinear formulation which also adapts to non-Cartesian (e.g., radial) sampling schemes. Experimental results of a motion phantom with controlled speed and in vivo measurements of rapid tongue movements demonstrate image improvements in preserving temporal fidelity and removing residual artifacts.

math.NA↗

arXiv2013

Exact reconstruction formulas for a Radon transform over cones

Inversion of Radon transforms is the mathematical foundation of many modern tomographic imaging modalities. In this paper we study a conical Radon transform, which is important for computed tomography taking Compton scattering into account. The conical Radon transform we study integrates a function in $\R^d$ over all conical surfaces having vertices on a hyperplane and symmetry axis orthogonal to this plane. As the main result we derive exact reconstruction formulas of the filtered back-projection type for inverting this transform.

math.NA↗

arXiv2013

Extreme Value Analysis of Empirical Frame Coefficients and Implications for Denoising by Soft-Thresholding

Denoising by frame thresholding is one of the most basic and efficient methods for recovering a discrete signal or image from data that are corrupted by additive Gaussian white noise. The basic idea is to select a frame of analyzing elements that separates the data in few large coefficients due to the signal and many small coefficients mainly due to the noise ε_n. Removing all data coefficients being in magnitude below a certain threshold yields a reconstruction of the original signal. In order to properly balance the amount of noise to be removed and the relevant signal features to be kept, a precise understanding of the statistical properties of thresholding is important. For that purpose we derive the asymptotic distribution of max_{ω\in Ω_n} |<ϕ_ω^n,ε_n>| for a wide class of redundant frames (ϕ_ω^n: ω\in Ω_n}. Based on our theoretical results we give a rationale for universal extreme value thresholding techniques yielding asymptotically sharp confidence regions and smoothness estimates corresponding to prescribed significance levels. The results cover many frames used in imaging and signal recovery applications, such as redundant wavelet systems, curvelet frames, or unions of bases. We show that `generically' a standard Gumbel law results as it is known from the case of orthonormal wavelet bases. However, for specific highly redundant frames other limiting laws may occur. We indeed verify that the translation invariant wavelet transform shows a different asymptotic behaviour.

math.NA↗

arXiv2013

Inversion of circular means and the wave equation on convex planar domains

We study the problem of recovering the initial data of the two dimensional wave equation from values of its solution on the boundary $\partial \Om$ of a smooth convex bounded domain $\Om \subset \R^2$. As a main result we establish back-projection type inversion formulas that recover any initial data with support in $\Om$ modulo an explicitly computed smoothing integral operator $\K_\Om$. For circular and elliptical domains the operator $\K_\Om$ is shown to vanish identically and hence we establish exact inversion formulas of the back-projection type in these cases. Similar results are obtained for recovering a function from its mean values over circles with centers on $\partial \Om$. Both reconstruction problems are, amongst others, essential for the hybrid imaging modalities photoacoustic and thermoacoustic tomography.

math.AP↗

arXiv2011

The Residual Method for Regularizing Ill-Posed Problems

Although the \emph{residual method}, or \emph{constrained regularization}, is frequently used in applications, a detailed study of its properties is still missing. This sharply contrasts the progress of the theory of Tikhonov regularization, where a series of new results for regularization in Banach spaces has been published in the recent years. The present paper intends to bridge the gap between the existing theories as far as possible. We develop a stability and convergence theory for the residual method in general topological spaces. In addition, we prove convergence rates in terms of (generalized) Bregman distances, which can also be applied to non-convex regularization functionals. We provide three examples that show the applicability of our theory. The first example is the regularized solution of linear operator equations on $L^p$-spaces, where we show that the results of Tikhonov regularization generalize unchanged to the residual method. As a second example, we consider the problem of density estimation from a finite number of sampling points, using the Wasserstein distance as a fidelity term and an entropy measure as regularization term. It is shown that the densities obtained in this way depend continuously on the location of the sampled points and that the underlying density can be recovered as the number of sampling points tends to infinity. Finally, we apply our theory to compressed sensing. Here, we show the well-posedness of the method and derive convergence rates both for convex and non-convex regularization under rather weak conditions.

math.OC↗

arXiv2008

On regularization methods of EM-Kaczmarz type

We consider regularization methods of Kaczmarz type in connection with the expectation-maximization (EM) algorithm for solving ill-posed equations. For noisy data, our methods are stabilized extensions of the well established ordered-subsets expectation-maximization iteration (OS-EM). We show monotonicity properties of the methods and present a numerical experiment which indicates that the extended OS-EM methods we propose are much faster than the standard EM algorithm.

math.NA↗

arXiv2008

Sparse Regularization with $l^q$ Penalty Term

We consider the stable approximation of sparse solutions to non-linear operator equations by means of Tikhonov regularization with a subquadratic penalty term. Imposing certain assumptions, which for a linear operator are equivalent to the standard range condition, we derive the usual convergence rate $O(\sqrtδ)$ of the regularized solutions in dependence of the noise level $δ$. Particular emphasis lies on the case, where the true solution is known to have a sparse representation in a given basis. In this case, if the differential of the operator satisfies a certain injectivity condition, we can show that the actual convergence rate improves up to $O(δ)$.

math.FA↗