arXiv subjects

Markus Haltmeier

Publications and source records attributed to Markus Haltmeier.

At least 109 records · Page 6Linked to original sources

arXiv2018

Reconstruction algorithms for photoacoustic tomography in heterogenous damping media

In this article, we study several reconstruction methods for the inverse source problem of photoacoustic tomography (PAT) with spatially variable sound speed and damping. The backbone of these methods is the adjoint operators, which we thoroughly analyze in both the $L^2$- and $H^1$-settings. They are casted in the form of a nonstandard wave equation. We derive the well-pawedness of the aforementioned wave equation in a natural functional space, and also prove the finite speed of propagation. Under the uniqueness and visibility condition, our formulations of the standard iterative reconstruction methods, such as Landweber's and conjugate gradients (CG), achieve a linear rate of convergence in either $L^2$- or $H^1$-norm. When the visibility condition is not satisfied, the problem is severely ill-posed and one must apply a regularization technique to stabilize the solutions. To that end, we study two classes of regularization methods: (i) iterative, and (ii) variational regularization. In the case of full data, our simulations show that the CG method works best; it is very fast and robust. In the ill-posed case, the CG method behaves unstably. Total variation regularization method (TV), in this case, significantly improves the reconstruction quality.

math.AP↗

arXiv2018

Deep Null Space Learning for Inverse Problems: Convergence Analysis and Rates

Recently, deep learning based methods appeared as a new paradigm for solving inverse problems. These methods empirically show excellent performance but lack of theoretical justification; in particular, no results on the regularization properties are available. In particular, this is the case for two-step deep learning approaches, where a classical reconstruction method is applied to the data in a first step and a trained deep neural network is applied to improve results in a second step. In this paper, we close the gap between practice and theory for a new network structure in a two-step approach. For that purpose, we propose so called null space networks and introduce the concept of M-regularization. Combined with a standard regularization method as reconstruction layer, the proposed deep null space learning approach is shown to be a M-regularization method; convergence rates are also derived. The proposed null space network structure naturally preserves data consistency which is considered as key property of neural networks for solving inverse problems.

math.NA↗

arXiv2018

Variational regularization of the weighted conical Radon transform

Recovering a function from integrals over conical surfaces recently got significant interest. It is relevant for emission tomography with Compton cameras and other imaging applications. In this paper, we consider the weighted conical Radon transform with vertices on the sphere. Opposed to previous works on conical Radon transform, we allow a general weight depending on the distance of the integration point from the vertex. As first main result, we show uniqueness of inversion for that transform. To stably invert the weighted conical Radon transform, we use general convex variational regularization. We present numerical minimization schemes based on the Chambolle-Pock primal dual algorithm. Within this framework, we compare various regularization terms, including non-negativity constraints, $H^1$-regularization and total variation regularization. Compared to standard quadratic Tikhonov regularization, TV-regularization is demonstrated to significantly increase the reconstruction quality from conical Radon data.

math.NA↗

arXiv2018

Full field inversion in photoacoustic tomography with variable sound speed

Recently, a novel measurement setup has been introduced to photoacoustic tomography, that collects data in the form of projections of the full 3D acoustic pressure distribution at a certain time instant. Existing imaging algorithms for this kind of data assume a constant speed of sound. This assumption is not always met in practice and thus leads to erroneous reconstructions. In this paper, we present a two-step reconstruction method for full field detection photoacoustic tomography that takes variable speed of sound into account. In the first step, by applying the inverse Radon transform, the pressure distribution at the measurement time is reconstructed point-wise from the projection data. In the second step, one solves a final time wave inversion problem where the initial pressure distribution is recovered from the known pressure distribution at the measurement time. For the latter problem, we derive an iterative solution approach, compute the required adjoint operator, and show its uniqueness and stability.

math.NA↗

arXiv2018

Image Based Fashion Product Recommendation with Deep Learning

We develop a two-stage deep learning framework that recommends fashion images based on other input images of similar style. For that purpose, a neural network classifier is used as a data-driven, visually-aware feature extractor. The latter then serves as input for similarity-based recommendations using a ranking algorithm. Our approach is tested on the publicly available Fashion dataset. Initialization strategies using transfer learning from larger product databases are presented. Combined with more traditional content-based recommendation systems, our framework can help to increase robustness and performance, for example, by better matching a particular customer style.

cs.CV↗

arXiv2018

Operator learning approach for the limited view problem in photoacoustic tomography

In photoacoustic tomography, one is interested to recover the initial pressure distribution inside a tissue from the corresponding measurements of the induced acoustic wave on the boundary of a region enclosing the tissue. In the limited view problem, the wave boundary measurements are given on the part of the boundary, whereas in the full view problem, the measurements are known on the whole boundary. For the full view problem, there exist various fast and robust reconstruction methods. These methods give severe reconstruction artifacts when they are applied directly to the limited view data. One approach for reducing such artefacts is trying to extend the limited view data to the whole region boundary, and then use existing reconstruction methods for the full view data. In this paper, we propose an operator learning approach for constructing an operator that gives an approximate extension of the limited view data. We consider the behavior of a reconstruction formula on the extended limited view data that is given by our proposed approach. Approximation errors of our approach are analyzed. We also present numerical results with the proposed extension approach supporting our theoretical analysis.

math.NA↗

arXiv2018

Stochastic Proximal Gradient Algorithms for Multi-Source Quantitative Photoacoustic Tomography

The development of accurate and efficient image reconstruction algorithms is a central aspect of quantitative photoacoustic tomography (QPAT). In this paper, we address this issues for multi-source QPAT using the radiative transfer equation (RTE) as accurate model for light transport. The tissue parameters are jointly reconstructed from the acoustical data measured for each of the applied sources. We develop stochastic proximal gradient methods for multi-source QPAT, which are more efficient than standard proximal gradient methods in which a single iterative update has complexity proportional to the number applies sources. Additionally, we introduce a completely new formulation of QPAT as multilinear (MULL) inverse problem which avoids explicitly solving the RTE. The MULL formulation of QPAT is again addressed with stochastic proximal gradient methods. Numerical results for both approaches are presented. Besides the introduction of stochastic proximal gradient algorithms to QPAT, we consider the new MULL formulation of QPAT as main contribution of this paper.

math.NA↗

arXiv2018

The Averaged Kaczmarz Iteration for Solving Inverse Problems

We introduce a new iterative regularization method for solving inverse problems that can be written as systems of linear or non-linear equations in Hilbert spaces. The proposed averaged Kaczmarz (AVEK) method can be seen as a hybrid method between the Landweber and the Kaczmarz method. As the Kaczmarz method, the proposed method only requires evaluation of one direct and one adjoint sub-problem per iterative update. On the other, similar to the Landweber iteration, it uses an average over previous auxiliary iterates which increases stability. We present a convergence analysis of the AVEK iteration. Further, detailed numerical studies are presented for a tomographic image reconstruction problem, namely the limited data problem in photoacoustic tomography. Thereby, the AVEK is compared with other iterative regularization methods including standard Landweber and Kaczmarz iterations, as well as recently proposed accelerated versions based on error minimizing relaxation strategies.

math.NA↗

arXiv2017

A New Sparsification and Reconstruction Strategy for Compressed Sensing Photoacoustic Tomography

Compressed sensing (CS) is a promising approach to reduce the number of measurements in photoacoustic tomography (PAT) while preserving high spatial resolution. This allows to increase the measurement speed and to reduce system costs. Instead of collecting point-wise measurements, in CS one uses various combinations of pressure values at different sensor locations. Sparsity is the main condition allowing to recover the photoacoustic (PA) source from compressive measurements. In this paper we introduce a new concept enabling sparse recovery in CS PAT. Our approach is based on the fact that the second time derivative applied to the measured pressure data corresponds to the application of the Laplacian to the original PA source. As typical PA sources consist of smooth parts and singularities along interfaces the Laplacian of the source is sparse (or at least compressible). To efficiently exploit the induced sparsity we develop a reconstruction framework to jointly recover the initial and the modified sparse source. Reconstruction results with simulated as well as experimental data are given.

math.NA↗

arXiv2017

Galaxy And Mass Assembly: Automatic Morphological Classification of Galaxies Using Statistical Learning

We apply four statistical learning methods to a sample of $7941$ galaxies ($z<0.06$) from the Galaxy and Mass Assembly (GAMA) survey to test the feasibility of using automated algorithms to classify galaxies. Using $10$ features measured for each galaxy (sizes, colours, shape parameters \& stellar mass) we apply the techniques of Support Vector Machines (SVM), Classification Trees (CT), Classification Trees with Random Forest (CTRF) and Neural Networks (NN), returning True Prediction Ratios (TPRs) of $75.8\%$, $69.0\%$, $76.2\%$ and $76.0\%$ respectively. Those occasions whereby all four algorithms agree with each other yet disagree with the visual classification (`unanimous disagreement') serves as a potential indicator of human error in classification, occurring in $\sim9\%$ of ellipticals, $\sim9\%$ of Little Blue Spheroids, $\sim14\%$ of early-type spirals, $\sim21\%$ of intermediate-type spirals and $\sim4\%$ of late-type spirals \& irregulars. We observe that the choice of parameters rather than that of algorithms is more crucial in determining classification accuracy. Due to its simplicity in formulation and implementation, we recommend the CTRF algorithm for classifying future galaxy datasets. Adopting the CTRF algorithm, the TPRs of the 5 galaxy types are : E, $70.1\%$; LBS, $75.6\%$; S0-Sa, $63.6\%$; Sab-Scd, $56.4\%$ and Sd-Irr, $88.9\%$. Further, we train a binary classifier using this CTRF algorithm that divides galaxies into spheroid-dominated (E, LBS \& S0-Sa) and disk-dominated (Sab-Scd \& Sd-Irr), achieving an overall accuracy of $89.8\%$. This translates into an accuracy of $84.9\%$ for spheroid-dominated systems and $92.5\%$ for disk-dominated systems.

astro-ph.GA↗

arXiv2017

A Galerkin least squares approach for photoacoustic tomography

The development of fast and accurate image reconstruction algorithms is a central aspect of computed tomography. In this paper we address this issue for photoacoustic computed tomography in circular geometry. We investigate the Galerkin least squares method for that purpose. For approximating the function to be recovered we use subspaces of translation invariant spaces generated by a single Funktion. This includes many systems that have previously been employed in PAT such as generalized Kaiser-Bessel basis functions or the natural pixel basis. By exploiting an isometry property of the forward problem we are able to efficiently set up the Galerkin equation for a wide class of generating functions and Devise efficient algorithms for its solution. We establish a convergence analysis and present numerical simulations that demonstrate the efficiency and accuracy of the derived algorithm.

math.NA↗

arXiv2017

Iterative Methods for Photoacoustic Tomography in Attenuating Acoustic Media

The development of efficient and accurate reconstruction methods is an important aspect of tomographic imaging. In this article, we address this issue for photoacoustic tomography. To this aim, we use models for acoustic wave propagation accounting for frequency dependent attenuation according to a wide class of attenuation laws that may include memory. We formulate the inverse problem of photoacoustic tomography in attenuating medium as an ill-posed operator equation in a Hilbert space framework that is tackled by iterative regularization methods. Our approach comes with a clear convergence analysis. For that purpose we derive explicit expressions for the adjoint problem that can efficiently be implemented. In contrast to time reversal, the employed adjoint wave equation is again damping and, thus has a stable solution. This stability property can be clearly seen in our numerical results. Moreover, the presented numerical results clearly demonstrate the Efficiency and accuracy of the derived iterative reconstruction algorithms in various situations including the limited view case.

math.NA↗

arXiv2017

Analysis of Iterative Methods in Photoacoustic Tomography with Variable Sound Speed

In this article, we revisit iterative methods for solving the inverse problem of photoacoustic tomography in free space. Recently, there have been interesting developments on explicit formulations of the adjoint operator, demonstrating that iterative methods are an attractive choice for photoacoustic image reconstruction. In this work, we propose several modifications of current formulations of the adjoint operator which help speed up the convergence and yield improved error estimates. We establish a stability analysis and show that, with our choices of the adjoint operator, the iterative methods can achieve a linear rate of convergence, in the $L^2$-norm as well as in the $H^1$-norm. In addition, we analyze the normal operator from the microlocal analysis point of view. This gives insight into the convergence speed of the iterative methods and choosing proper weights for the mapping spaces. Finally, we present numerical results using various iterative reconstruction methods for full as well as limited view data. Our results demonstrate that Nesterov's fast gradient and the CG methods converge faster than Landweber's and iterative time reversal methods in the visible as well as the invisible case.

math.AP↗

arXiv2017

Efficient regularization with wavelet sparsity constraints in PAT

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.

math.OC↗

arXiv2017

Analysis of the Linearized Problem of Quantitative Photoacoustic Tomography

Quantitative image reconstruction in photoacoustic tomography requires the solution of a coupled physics inverse problem involvier light transport and acoustic wave propagation. In this paper we address this issue employing the radiative transfer equation as accurate model for light transport. As main theoretical results, we derive several stability and uniqueness results for the linearized inverse problem. We consider the case of single illumination as well as the case of multiple illuminations assuming full or partial data. The numerical solution of the linearized problem is much less costly than the solution of the non-linear problem. We present numerical simulations supporting the stability results for the linearized problem and demonstrate that the linearized problem already gives accurate quantitative results.

math.AP↗

arXiv2016

Inversion of the attenuated V-line transform for SPECT with Compton cameras

The Compton camera is a promising alternative to the Anger camera for imaging gamma radiation, with the potential to significantly increase the sensitivity of SPECT. Two-dimensional Compton camera image reconstruction can be implemented by inversion of the V-line transform, which integrates the emission distribution over V-lines (unions of two half-lines), that have vertices on a surrounding detector array. Inversion of the V-line transform without attenuation has recently been addressed by several authors. However, it is well known from standard SPECT that ignoring attenuation can significantly degrade the quality of the reconstructed image. In this paper we address this issue and study the attenuated V-line transform accounting for attenuation of photons in SPECT with Compton cameras. We derive an analytic inversion approach based on circular harmonics expansion, and show uniqueness of reconstruction for the attenuated V-line transform. We further develop a discrete image reconstruction algorithm based on our analytic studies, and present numerical results that demonstrate the effectiveness of our algorithm.

math.NA↗

arXiv2016

Compressed sensing and sparsity in photoacoustic tomography

Increasing the imaging speed is a central aim in photoacoustic tomography. This issue is especially important in the case of sequential scanning approaches as applied for most existing optical detection schemes. In this work we address this issue using techniques of compressed sensing. We demonstrate, that the number of measurements can significantly be reduced by allowing general linear measurements instead of point-wise pressure values. A main requirement in compressed sensing is the sparsity of the unknowns to be recovered. For that purpose we develop the concept of sparsifying temporal transforms for three-dimensional photoacoustic tomography. We establish a two-stage algorithm that recovers the complete pressure Signals in a first step and then applies a standard reconstruction algorithm such as back-projection. This yields a novel reconstruction method with much lower complexity than existing compressed sensing approaches for photoacoustic tomography. Reconstruction results for simulated and for experimental data verify that the proposed compressed sensing scheme allows to significantly reducing the number of spatial measurements without reducing the spatial resolution.

math.NA↗

arXiv2016

The spherical mean Radon transform with centers on cylindrical surfaces

Recovering a function from its spherical Radon transform with centers of spheres of integration restricted to a hypersurface is at the heart of several modern imaging technologies, including SAR, ultrasound imaging, and photo- and thermoacoustic tomography. In this paper we study an inversion of the spherical Radon transform with centers of integration restricted to cylindrical surfaces of the form $Γ\times \mathbb{R}^m$, where $Γ$ is a hypersurface in $\mathbb{R}^n$. We show that this transform can be decomposed into two lower dimensional spherical Radon transforms, one with centers on $Γ$ and one with a planar center-set in $\mathbb{R}^{m+1}$. Together with explicit inversion formulas for the spherical Radon transform with a planar center-set and existing algorithms for inverting the spherical Radon transform with a center-set $\mathbb{R}$, this yields reconstruction procedures for general cylindrical domains. In the special case of spherical or elliptical cylinders we obtain novel explicit inversion formulas. For three spatial dimensions, these inversion formulas can be implemented efficiently by backprojection type algorithms only requiring $\mathcal O(N^{4/3})$ floating point operations, where $N$ is the total number of unknowns to be recovered. We present numerical results demonstrating the efficiency of the derived algorithms.

math.NA↗