Searcharxiv⌕ Search

arXiv subjects

Martin Burger

Publications and source records attributed to Martin Burger.

At least 91 records · Page 5Linked to original sources

Computing Nonlinear Eigenfunctions via Gradient Flow Extinction

In this work we investigate the computation of nonlinear eigenfunctions via the extinction profiles of gradient flows. We analyze a scheme that recursively subtracts such eigenfunctions from given data and show that this procedure yields a decomposition of the data into eigenfunctions in some cases as the 1-dimensional total variation, for instance. We discuss results of numerical experiments in which we use extinction profiles and the gradient flow for the task of spectral graph clustering as used, e.g., in machine learning applications.

math.NA↗

On a Class of Singularly Perturbed Elliptic Systems with Asymptotic Phase Segregation

This work is devoted to study of a class of elliptic singular perturbed systems and their singular limit to a phase segregating system. We prove existence and uniqueness and study the asymptotic behaviour with convergence to a limiting problem as the interaction rate tends to infinity. The limiting problem is a free boundary problem such that at each point in the domain at least one of the components is zero which implies simultaneously all components can not coexist. We present a novel method, which provides an explicit solution of limiting problem for special choice of parameters. Moreover, we present some numerical simulations of the asymptotic problem.

math.AP↗

Mean field models for segregation dynamics

In this paper we derive and analyse mean-field models for the dynamics of groups of individuals undergoing a random walk. The random motion of individuals is only influenced by the perceived densities of the different groups present as well as the available space. All individuals have the tendency to stay within their own group and avoid the others. These interactions lead to the formation of aggregates in case of a single species, and to segregation in the case of multiple species. We derive two different mean-field models, which are based on these interactions and weigh local and non-local effects differently. We discuss existence and stability properties of solutions for both models and illustrate the rich dynamics with numerical simulations.

math.AP↗

On Fokker-Planck Equations with In- and Outflow of Mass

Motivated by modeling transport processes in the growth of neurons, we present results on (nonlinear) Fokker-Planck equations where the total mass is not conserved. This is either due to in- and outflow boundary conditions or to spatially distributed reaction terms. We are able to prove exponential decay towards equilibrium using entropy methods in several situations. As there is no conservation of mass it is difficult to exploit the gradient flow structure of the differential operator which renders the analysis more challenging. In particular, classical logarithmic Sobolev inequalities are not applicable any more. Our analytic results are illustrated by extensive numerical studies.

math.AP↗

Convergence rates and structure of solutions of inverse problems with imperfect forward models

The goal of this paper is to further develop an approach to inverse problems with imperfect forward operators that is based on partially ordered spaces. Studying the dual problem yields useful insights into the convergence of the regularised solutions and allow us to obtain convergence rates in terms of Bregman distances - as usual in inverse problems, under an additional assumption on the exact solution called the source condition. These results are obtained for general absolutely one-homogeneous functionals. In the special case of TV-based regularisation we also study the structure of regularised solutions and prove convergence of their level sets to those of an exact solution. Finally, using the developed theory, we adapt the concept of debiasing to inverse problems with imperfect operators and propose an approach to pointwise error estimation in TV-based regularisation.

math.NA↗

Unified Models for Second-Order TV-Type Regularisation in Imaging - A New Perspective Based on Vector Operators

We introduce a novel regulariser based on the natural vector field operations gradient, divergence, curl and shear. For suitable choices of the weighting parameters contained in our model it generalises well-known first- and second-order TV-type regularisation methods including TV, ICTV and TGV$^2$ and enables interpolation between them. To better understand the influence of each parameter, we characterise the nullspaces of the respective regularisation functionals. Analysing the continuous model, we conclude that it is not sufficient to combine penalisation of the divergence and the curl to achieve high-quality results, but interestingly it seems crucial that the penalty functional includes at least one component of the shear or suitable boundary conditions. We investigate which requirements regarding the choice of weighting parameters yield a rotational invariant approach. To guarantee physically meaningful reconstructions, implying that conservation laws for vectorial differential operators remain valid, we need a careful discretisation that we therefore discuss in detail.

math.NA↗

A mesoscopic model of biological transportation networks

We introduce a mesoscopic model for natural network formation processes, acting as a bridge between the discrete and continuous network approach proposed by Hu and Cai. The models are based on a common approach where the dynamics of the conductance network is subject to pressure force effects. We first study topological properties of the discrete model and we prove that if the metabolic energy consumption term is concave with respect to the conductivities, the optimal network structure is a tree (i.e., no loops are present). We then analyze various aspects of the mesoscopic modeling approach, in particular its relation to the discrete model and its stationary solutions, including discrete network solutions. Moreover, we present an alternative formulation of the mesoscopic model that avoids the explicit presence of the pressure in the energy functional.

math.AP↗

Asymptotic gradient flow structures of a nonlinear Fokker-Planck equation

In this paper we consider a nonlinear Fokker-Planck equation with asymptotically small parameters. It describes the diffusion of finite-size particles in the presence of a fixed distribution of obstacles in the limit of low-volume fraction. The equation does not have a gradient flow structure, but can be interpreted as an asymptotic gradient flow, that is, as a gradient flow up to a certain asymptotic order. We use this scalar equation as a simple testbed model for more complicated systems of this kind. We discuss several possible entropy-mobility pairs, illustrate their dynamics with numerical simulations, present global in time existence results and study the long time behavior of solutions.

math.AP↗

Sorting Phenomena in a Mathematical Model For Two Mutually Attracting/Repelling Species

Macroscopic models for systems involving diffusion, short-range repulsion, and long-range attraction have been studied extensively in the last decades. In this paper we extend the analysis to a system for two species interacting with each other according to different inner- and intra-species attractions. Under suitable conditions on this self- and crosswise attraction an interesting effect can be observed, namely phase separation into neighbouring regions, each of which contains only one of the species. We prove that the intersection of the support of the stationary solutions of the continuum model for the two species has zero Lebesgue measure, while the support of the sum of the two densities is simply connected. Preliminary results indicate the existence of phase separation, i.e. spatial sorting of the different species. A detailed analysis in one spatial dimension follows. The existence and shape of segregated stationary solutions is shown via the Krein-Rutman theorem. Moreover, for small repulsion/nonlinear diffusion, also uniqueness of these stationary states is proved.

math.AP↗

Large Noise in Variational Regularization

In this paper we consider variational regularization methods for inverse problems with large noise that is in general unbounded in the image space of the forward operator. We introduce a Banach space setting that allows to define a reasonable notion of solutions for more general noise in a larger space provided one has sufficient mapping properties of the forward operators. A key observation, which guides us through the subsequent analysis, is that such a general noise model can be understood with the same setting as approximate source conditions (while a standard model of bounded noise is related directly to classical source conditions). Based on this insight we obtain a quite general existence result for regularized variational problems and derive error estimates in terms of Bregman distances. The latter are specialized for the particularly important cases of one- and p-homogeneous regularization functionals. As a natural further step we study stochastic noise models and in particular white noise, for which we derive error estimates in terms of the expectation of the Bregman distance. The finiteness of certain expectations leads to a novel class of abstract smoothness conditions on the forward operator, which can be easily interpreted in the Hilbert space case. We finally exemplify the approach and in particular the conditions for popular examples of regularization functionals given by squared norm, Besov norm and total variation, respectively.

math.NA↗

Modern Regularization Methods for Inverse Problems

Regularization methods are a key tool in the solution of inverse problems. They are used to introduce prior knowledge and make the approximation of ill-posed (pseudo-)inverses feasible. In the last two decades interest has shifted from linear towards nonlinear regularization methods even for linear inverse problems. The aim of this paper is to provide a reasonably comprehensive overview of this development towards modern nonlinear regularization methods, including their analysis, applications, and issues for future research. In particular we will discuss variational methods and techniques derived from those, since they have attracted particular interest in the last years and link to other fields like image processing and compressed sensing. We further point to developments related to statistical inverse problems, multiscale decompositions, and learning theory.

math.NA↗

Dynamic SPECT reconstruction with temporal edge correlation

In dynamic imaging, a key challenge is to reconstruct image sequences with high temporal resolution from strong undersampling projections due to a relatively slow data acquisition speed. In this paper, we propose a variational model using the infimal convolution of Bregman distance with respect to total variation to model edge dependence of sequential frames. The proposed model is solved via an alternating iterative scheme, for which each subproblem is convex and can be solved by existing algorithms. The proposed model is formulated under both Gaussian and Poisson noise assumption and the simulation on two sets of dynamic images shows the advantage of the proposed method compared to previous methods.

math.NA↗

Dynamic MRI Reconstruction from Undersampled Data with an Anatomical Prescan

The goal of dynamic magnetic resonance imaging (dynamic MRI) is to visualize tissue properties and their local changes over time that are traceable in the MR signal. We propose a new variational approach for the reconstruction of subsampled dynamic MR data, which combines smooth, temporal regularization with spatial total variation regularization. In particular, it furthermore uses the infimal convolution of two total variation Bregman distances to incorporate structural a-priori information from an anatomical MRI prescan into the reconstruction of the dynamic image sequence. The method promotes the reconstructed image sequence to have a high structural similarity to the anatomical prior, while still allowing for local intensity changes which are smooth in time. The approach is evaluated using artificial data simulating functional magnetic resonance imaging (fMRI), and experimental dynamic contrast-enhanced magnetic resonance data from small animal imaging using radial golden angle sampling of the k-space.

math.NA↗

On a Reaction-Cross-Diffusion System Modelling the Growth of Glioblastoma

We investigate a recently proposed cross-diffusion system modelling the growth of gliobastoma taking into account size exclusion both in the migration and proliferation process. In addition to degenerate nonlinear cross-diffusion the model includes reaction terms as in the Fisher-Kolmogorov equation and linear ones modelling transition between states of proliferation and migration. We discuss the mathematical structure of the system and provide a complete existence analysis in spatial dimension one. The proof is based on exploiting partial entropy dissipation techniques and fully implicit time discretisations. In order to prove existence of the latter appropriate variational and fixed-point techniques are used, together with suitable a-priori estimates. Moreover, we review the existence of travelling waves and their relation to potential growth or decay of glioblastoma. Finally we provide extensive numerical studies in one and two spatial dimensions, including the effect of anisotropic diffusions as found in neural tissues.

math.AP↗

Risk Estimators for Choosing Regularization Parameters in Ill-Posed Problems - Properties and Limitations

This paper discusses the properties of certain risk estimators recently proposed to choose regularization parameters in ill-posed problems. A simple approach is Stein's unbiased risk estimator (SURE), which estimates the risk in the data space, while a recent modification (GSURE) estimates the risk in the space of the unknown variable. It seems intuitive that the latter is more appropriate for ill-posed problems, since the properties in the data space do not tell much about the quality of the reconstruction. We provide theoretical studies of both estimators for linear Tikhonov regularization in a finite dimensional setting and estimate the quality of the risk estimators, which also leads to asymptotic convergence results as the dimension of the problem tends to infinity. Unlike previous papers, who studied image processing problems with a very low degree of ill-posedness, we are interested in the behavior of the risk estimators for increasing ill-posedness. Interestingly, our theoretical results indicate that the quality of the GSURE risk can deteriorate asymptotically for ill-posed problems, which is confirmed by a detailed numerical study. The latter shows that in many cases the GSURE estimator leads to extremely small regularization parameters, which obviously cannot stabilize the reconstruction. Similar but less severe issues with respect to robustness also appear for the SURE estimator, which in comparison to the rather conservative discrepancy principle leads to the conclusion that regularization parameter choice based on unbiased risk estimation is not a reliable procedure for ill-posed problems. A similar numerical study for sparsity regularization demonstrates that the same issue appears in nonlinear variational regularization approaches.

math.ST↗

Joint Reconstruction via Coupled Bregman Iterations with Applications to PET-MR Imaging

Joint reconstruction has recently attracted a lot of attention, especially in the field of medical multi-modality imaging such as PET-MRI. Most of the developed methods rely on the comparison of image gradients, or more precisely their location, direction and magnitude, to make use of structural similarities between the images. A challenge and still an open issue for most of the methods is to handle images in entirely different scales, i.e. different magnitudes of gradients that cannot be dealt with by a global scaling of the data. We propose the use of generalized Bregman distances and infimal convolutions thereof with regard to the well-known total variation functional. The use of a total variation subgradient respectively the involved vector field rather than an image gradient naturally excludes the magnitudes of gradients, which in particular solves the scaling behavior. Additionally, the presented method features a weighting that allows to control the amount of interaction between channels. We give insights into the general behavior of the method, before we further tailor it to a particular application, namely PET-MRI joint reconstruction. To do so, we compute joint reconstruction results from blurry Poisson data for PET and undersampled Fourier data from MRI and show that we can gain a mutual benefit for both modalities. In particular, the results are superior to the respective separate reconstructions and other joint reconstruction methods.

math.NA↗

Bias-Reduction in Variational Regularization

The aim of this paper is to introduce and study a two-step debiasing method for variational regularization. After solving the standard variational problem, the key idea is to add a consecutive debiasing step minimizing the data fidelity on an appropriate set, the so-called model manifold. The latter is defined by Bregman distances or infimal convolutions thereof, using the (uniquely defined) subgradient appearing in the optimality condition of the variational method. For particular settings, such as anisotropic $\ell^1$ and TV-type regularization, previously used debiasing techniques are shown to be special cases. The proposed approach is however easily applicable to a wider range of regularizations. The two-step debiasing is shown to be well-defined and to optimally reduce bias in a certain setting. In addition to visual and PSNR-based evaluations, different notions of bias and variance decompositions are investigated in numerical studies. The improvements offered by the proposed scheme are demonstrated and its performance is shown to be comparable to optimal results obtained with Bregman iterations.

math.NA↗

Sparsity-promoting and edge-preserving maximum a posteriori estimators in non-parametric Bayesian inverse problems

We consider the inverse problem of recovering an unknown functional parameter $u$ in a separable Banach space, from a noisy observation $y$ of its image through a known possibly non-linear ill-posed map ${\mathcal G}$. The data $y$ is finite-dimensional and the noise is Gaussian. We adopt a Bayesian approach to the problem and consider Besov space priors (see Lassas et al. 2009), which are well-known for their edge-preserving and sparsity-promoting properties and have recently attracted wide attention especially in the medical imaging community. Our key result is to show that in this non-parametric setup the maximum a posteriori (MAP) estimates are characterized by the minimizers of a generalized Onsager--Machlup functional of the posterior. This is done independently for the so-called weak and strong MAP estimates, which as we show coincide in our context. In addition, we prove a form of weak consistency for the MAP estimators in the infinitely informative data limit. Our results are remarkable for two reasons: first, the prior distribution is non-Gaussian and does not meet the smoothness conditions required in previous research on non-parametric MAP estimates. Second, the result analytically justifies existing uses of the MAP estimate in finite but high dimensional discretizations of Bayesian inverse problems with the considered Besov priors.

math.ST↗