arXiv subjects

Martin Burger

Publications and source records attributed to Martin Burger.

140 records · Page 8Linked to original sources

arXiv2014

Total Variation Regularisation in Measurement and Image space for PET reconstruction

The aim of this paper is to test and analyze a novel technique for image reconstruction in positron emission tomography, which is based on (total variation) regularization on both the image space and the projection space. We formulate our variational problem considering both total variation penalty terms on the image and on an idealized sinogram to be reconstructed from a given Poisson distributed noisy sinogram. We prove existence, uniqueness and stability results for the proposed model and provide some analytical insight into the structures favoured by joint regularization. For the numerical solution of the corresponding discretized problem we employ the split Bregman algorithm and extensively test the approach in comparison to standard total variation regularization on the image. The numerical results show that an additional penalty on the sinogram performs better on reconstructing images with thin structures.

math.NA↗

arXiv2014

Maximum-A-Posteriori Estimates in Linear Inverse Problems with Log-concave Priors are Proper Bayes Estimators

A frequent matter of debate in Bayesian inversion is the question, which of the two principle point-estimators, the maximum-a-posteriori (MAP) or the conditional mean (CM) estimate is to be preferred. As the MAP estimate corresponds to the solution given by variational regularization techniques, this is also a constant matter of debate between the two research areas. Following a theoretical argument - the Bayes cost formalism - the CM estimate is classically preferred for being the Bayes estimator for the mean squared error cost while the MAP estimate is classically discredited for being only asymptotically the Bayes estimator for the uniform cost function. In this article we present recent theoretical and computational observations that challenge this point of view, in particular for high-dimensional sparsity-promoting Bayesian inversion. Using Bregman distances, we present new, proper convex Bayes cost functions for which the MAP estimator is the Bayes estimator. We complement this finding by results that correct further common misconceptions about MAP estimates. In total, we aim to rehabilitate MAP estimates in linear inverse problems with log-concave priors as proper Bayes estimators.

math.ST↗

arXiv2013

On the asymptotic behavior of a Boltzmann-type price formation model

In this paper we study the asymptotic behavior of a Boltzmann type price formation model, which describes the trading dynamics in a financial market. In many of these markets trading happens at high frequencies and low transactions costs. This observation motivates the study of the limit as the number of transactions $k$ tends to infinity, the transaction cost $a$ to zero and $ka=const$. Furthermore we illustrate the price dynamics with numerical simulations.

math.AP↗

arXiv2013

Rectification properties of conically shaped nanopores: consequences of miniaturization

Nanopores attracted a great deal of scientific interest as templates for biological sensors as well as model systems to understand transport phenomena at the nanoscale. The experimental and theoretical analysis of nanopores has been so far focused on understanding the effect of the pore opening diameter on ionic transport. In this article we present systematic studies on the dependence of ion transport properties on the pore length. Particular attention was given to the effect of ion current rectification exhibited for conically shaped nanopores with homogeneous surface charges. We found that reducing the length of conically shaped nanopores significantly lowered their ability to rectify ion current. However, rectification properties of short pores can be enhanced by tailoring the surface charge and the shape of the narrow opening. Furthermore we analyze the relationship of the rectification behavior and ion selectivity for different pore lengths. All simulations were performed using MsSimPore, a software package for solving the Poisson-Nernst-Planck (PNP) equations. It is based on a novel finite element solver and allows for simulations up to surface charge densities of -2 e/nm^2. MsSimPore is based on 1D reduction of the PNP model, but allows for a direct treatment of the pore with bulk electrolyte reservoirs, a feature which was previously used in higher dimensional models only. MsSimPore includes these reservoirs in the calculations; a property especially important for short pores, where the ionic concentrations and the electric potential vary strongly inside the pore as well as in the regions next to pore entrance.

cond-mat.soft↗

arXiv2013

Stationary States and Asymptotic Behaviour of Aggregation Models with Nonlinear Local Repulsion

We consider a continuum aggregation model with nonlinear local repulsion given by a degenerate power-law diffusion with general exponent. The steady states and their properties in one dimension are studied both analytically and numerically, suggesting that the quadratic diffusion is a critical case. The focus is on finite-size, monotone and compactly supported equilibria. We also investigate numerically the long time asymptotics of the model by simulations of the evolution equation. Issues such as metastability and local/ global stability are studied in connection to the gradient flow formulation of the model.

math.AP↗

arXiv2013

Mean field games with nonlinear mobilities in pedestrian dynamics

In this paper we present an optimal control approach modeling fast exit scenarios in pedestrian crowds. In particular we consider the case of a large human crowd trying to exit a room as fast as possible. The motion of every pedestrian is determined by minimizing a cost functional, which depends on his/her position, velocity, exit time and the overall density of people. This microscopic setup leads in the mean-field limit to a parabolic optimal control problem. We discuss the modeling of the macroscopic optimal control approach and show how the optimal conditions relate to Hughes model for pedestrian flow. Furthermore we provide results on the existence and uniqueness of minimizers and illustrate the behavior of the model with various numerical results.

math.AP↗

arXiv2013

On a Boltzmann type price formation model

In this paper we present a Boltzmann type price formation model, which is motivated by a parabolic free boundary model for the evolution of the prize presented by Lasry and Lions in 2007. We discuss the mathematical analysis of the Boltzmann type model and show that its solutions converge to solutions of the model by Lasry and Lions as the transaction rate tends to infinity. Furthermore we analyse the behaviour of the initial layer on the fast time scale and illustrate the price dynamics with various numerical experiments.

math.AP↗

arXiv2012

Ground States and Singular Vectors of Convex Variational Regularization Methods

Singular value decomposition is the key tool in the analysis and understanding of linear regularization methods. In the last decade nonlinear variational approaches such as $\ell^1$ or total variation regularizations became quite prominent regularization techniques with certain properties being superior to standard methods. In the analysis of those, singular values and vectors did not play any role so far, for the obvious reason that these problems are nonlinear, together with the issue of defining singular values and singular vectors. In this paper however we want to start a study of singular values and vectors for nonlinear variational regularization of linear inverse problems, with particular focus on singular one-homogeneous regularization functionals. A major role is played by the smallest singular value, which we define as the ground state of an appropriate functional combining the (semi-)norm introduced by the forward operator and the regularization functional. The optimality condition for the ground state further yields a natural generalization to higher singular values and vectors involving the subdifferential of the regularization functional. We carry over two main properties from the world of linear regularization. The first one is gaining information about scale, respectively the behavior of regularization techniques at different scales. This also leads to novel estimates at different scales, generalizing the estimates for the coefficients in the linear singular value expansion. The second one is to provide exact solutions for variational regularization methods. We will show that all singular vectors can be reconstructed up to a scalar factor by the standard Tikhonov-type regularization approach even in the presence of (small) noise. Moreover, we will show that they can even be reconstructed without any bias by the recently popularized inverse scale space method.

math.NA↗

arXiv2012

Exact Relaxation for Classes of Minimization Problems with Binary Constraints

Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important applications ranging from binary image restoration, segmentation, minimal compliance topology optimization to the optimal design of composite membranes and many more. The relaxation approach turns the binary constraint into a box constraint. It is shown that thresholding a solution of the relaxed problem almost surely yields a solution of the original binary-valued problem. Furthermore, stability of solutions under data perturbations is studied, and, for applications such as structure optimization, the inclusion of volume constraints is considered. For the efficient numerical solution of the relaxed problem, a locally superlinearly convergent algorithm is proposed which is based on an exact penalization technique, Fenchel duality, and a semismooth Newton approach. The paper ends by a report on numerical results for several applications in particular in mathematical image processing.

math.OC↗

arXiv2012

Convergence rates in $\mathbf{\ell^1}$-regularization if the sparsity assumption fails

Variational sparsity regularization based on $\ell^1$-norms and other nonlinear functionals has gained enormous attention recently, both with respect to its applications and its mathematical analysis. A focus in regularization theory has been to develop error estimation in terms of regularization parameter and noise strength. For this sake specific error measures such as Bregman distances and specific conditions on the solution such as source conditions or variational inequalities have been developed and used. In this paper we provide, for a certain class of ill-posed linear operator equations, a convergence analysis that works for solutions that are not completely sparse, but have a fast decaying nonzero part. This case is not covered by standard source conditions, but surprisingly can be treated with an appropriate variational inequality. As a consequence the paper also provides the first examples where the variational inequality approach, which was often believed to be equivalent to appropriate source conditions, can indeed go farther than the latter.

math.NA↗

arXiv2012

Mathematical Modelling of Polarizing GTPases in Developing Axons

The aim of this paper is to contribute to the basic understanding of neuronal polarization mechanisms by developing and studying a reaction-diffusion model for protein activation and inactivation. In particular we focus on a feedback loop between PI3 kinase and certain GTPases, and study its behaviour in dependence of neurite lengths. We find that if an ultrasensitive activation is included, the model can produce polarization at a critical length as observed in experiments. Symmetry breaking to polarization in the longer neurite is found only if active transport of a substance, in our case active PI3 kinase, is included into the model.

q-bio.SC↗

arXiv2012

A Framework for Automated Cell Tracking in Phase Contrast Microscopic Videos based on Normal Velocities

This paper introduces a novel framework for the automated tracking of cells, with a particular focus on the challenging situation of phase contrast microscopic videos. Our framework is based on a topology preserving variational segmentation approach applied to normal velocity components obtained from optical flow computations, which appears to yield robust tracking and automated extraction of cell trajectories. In order to obtain improved trackings of local shape features we discuss an additional correction step based on active contours and the image Laplacian which we optimize for an example class of transformed renal epithelial (MDCK-F) cells. We also test the framework for human melanoma cells and murine neutrophil granulocytes that were seeded on different types of extracellular matrices. The results are validated with manual tracking results.

q-bio.QM↗

arXiv2012

Individual based and mean-field modelling of direct aggregation

We introduce two models of biological aggregation, based on randomly moving particles with individual stochasticity depending on the perceived average population density in their neighbourhood. In the first-order model the location of each individual is subject to a density-dependent random walk, while in the second-order model the density-dependent random walk acts on the velocity variable, together with a density-dependent damping term. The main novelty of our models is that we do not assume any explicit aggregative force acting on the individuals; instead, aggregation is obtained exclusively by reducing the individual stochasticity in response to higher perceived density. We formally derive the corresponding mean-field limits, leading to nonlocal degenerate diffusions. Then, we carry out the mathematical analysis of the first-order model, in particular, we prove the existence of weak solutions and show that it allows for measure-valued steady states. We also perform linear stability analysis and identify conditions for pattern formation. Moreover, we discuss the role of the nonlocality for well-posedness of the first-order model. Finally, we present results of numerical simulations for both the first- and second-order model on the individual-based and continuum levels of description.

math.DS↗

arXiv2011

The Iteratively Regularized Gauß-Newton Method with Convex Constraints and Applications in 4Pi-Microscopy

This paper is concerned with the numerical solution of nonlinear ill-posed operator equations involving convex constraints. We study a Newton-type method which consists in applying linear Tikhonov regularization with convex constraints to the Newton equations in each iteration step. Convergence of this iterative regularization method is analyzed if both the operator and the right hand side are given with errors and all error levels tend to zero. Our study has been motivated by the joint estimation of object and phase in 4Pi microscopy, which leads to a semi-blind deconvolution problem with nonnegativity constraints. The performance of the proposed algorithm is illustrated both for simulated and for three-dimensional experimental data.

math.FA↗