相关论文: Higher-order Spatial Accuracy in Diffeomorphic Ima…

The Hermite-Taylor method evolves all the variables and their derivatives through order $m$ in time to achieve a $2m+1$ order rate of convergence. The data required at each node of the staggered Cartesian meshes used by this method makes…

In this paper, a semi-discrete spatial finite volume (FV) method is proposed and analyzed for approximating solutions of anomalous subdiffusion equations involving a temporal fractional derivative of order $\alpha \in (0,1)$ in a…

I introduce an innovative methodology for deriving numerical models of systems of partial differential equations which exhibit the evolution of spatial patterns. The new approach directly produces a discretisation for the evolution of the…

Superresolution theory and techniques seek to recover signals from samples in the presence of blur and noise. Discrete image registration can be an approach to fuse information from different sets of samples of the same signal. Quantization…

In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However,…

Diffeomorphic matching (only one of several names for this technique) is a technique for non-rigid registration of curves and surfaces in which the curve or surface is embedded in the flow of a time-series of vector fields. One seeks the…

Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for Max-k-Cut and the Max-Agree variant of correlation clustering…

In this work we are interested in stochastic particle methods for multi-objective optimization. The problem is formulated using parametrized, single-objective sub-problems which are solved simultaneously. To this end a consensus based…

In this work, we consider a class of differentiable criteria for sparse image computing problems, where a nonconvex regularization is applied to an arbitrary linear transform of the target image. As special cases, it includes…

We study the asymptotics in $L^2$ for complexity penalized least squares regression for the discrete approximation of finite-dimensional signals on continuous domains - e.g. images - by piecewise smooth functions. We introduce a fairly…

We propose a family of optimization methods that achieve linear convergence using first-order gradient information and constant step sizes on a class of convex functions much larger than the smooth and strongly convex ones. This larger…

Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…

We study the problem of robustly learning multi-dimensional histograms. A $d$-dimensional function $h: D \rightarrow \mathbb{R}$ is called a $k$-histogram if there exists a partition of the domain $D \subseteq \mathbb{R}^d$ into $k$…

Dynamic inverse problems are challenging to solve due to the need to identify and incorporate appropriate regularization in both space and time. Moreover, the very large scale nature of such problems in practice presents an enormous…

We present a procedure to reconstruct objects from holograms recorded in in-line holography settings. Working with one beam of polarized light, the topological derivatives and energies of functionals quantifying hologram deviations yield…

Deep Learning in Image Registration (DLIR) methods have been tremendously successful in image registration due to their speed and ability to incorporate weak label supervision at training time. However, existing DLIR methods forego many of…

We develop a novel Hybrid High-Order method for the simulation of Darcy flows in fractured porous media. The discretization hinges on a mixed formulation in the bulk region and on a primal formulation inside the fracture. Salient features…

We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…

We construct a fully discrete numerical scheme that is linear, decoupled, and unconditionally energy stable, and analyze its optimal error estimates for the Cahn-Hilliard-Navier-Stokes equations. For time discretization, we employ the two…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…