Related papers: Median filter method for mean curvature flow using…
The mean shift algorithm is a popular way to find modes of some probability density functions taking a specific kernel-based shape, used for clustering or visual tracking. Since its introduction, it underwent several practical improvements…
We consider the application of multilevel Monte Carlo methods to steady state Darcy flow in a random porous medium, described mathematically by elliptic partial differential equations with random coefficients. The levels in the multilevel…
This work is motivated by the need to develop efficient tools for uncertainty quantification in subsurface flows associated with radioactive waste disposal studies. We consider single phase flow problems in random porous media described by…
We provide a new proof of convergence to motion by mean curvature (MMC) for the Merriman-Bence-Osher (MBO) thresholding algorithm. The proof is elementary and does not rely on maximum principle for the scheme. The strategy is to construct a…
We introduce a novel partial differential equations approach for addressing the problem of partisan gerrymandering. Our method is based on volume preserving curvature flow, a partial differential equation which we adapt to smooth voting…
Efficient gradient computation of the Jacobian determinant term is a core problem in many machine learning settings, and especially so in the normalizing flow framework. Most proposed flow models therefore either restrict to a function…
The computation of multiphase flows presents a subtle energetic equilibrium between potential (i.e., surface) and kinetic energies. The use of traditional interface-capturing schemes provides no control over such a dynamic balance. In the…
We prove that for the mean curvature flow of two-convex hypersurfaces the intrinsic diameter stays uniformly controlled as one approaches the first singular time. We also derive sharp $L^{n-1}$-estimates for the regularity scale of the…
In this paper we study a neighborhood of generic singularities formed by mean curvature flow (MCF). We limit our consideration to the singularities modelled on $\mathbb{S}^3\times\mathbb{R}$ because, compared to the cases…
The mean curvature flow is an evolution process under which a submanifold deforms in the direction of its mean curvature vector. The hypersurface case has been much studied since the eighties. Recently, several theorems on regularity,…
Accurate boundary detection in high-dimensional data remains a central challenge in unsupervised learning, particularly in the presence of non-linear structures and heterogeneous densities. In this work, we introduce Mean Curvature Boundary…
Under mean curvature flow, a closed, embedded hypersurface $M(t)$ becomes singular in finite time. For certain classes of mean-convex mean curvature flows, we show the continuity of the first singular time $T$ and the limit set "$M(T)$",…
The main objective of this article is to study the mean curvature flow into an ambient compact smooth manifold M with boundary and with a Riemannian metric that evolves by a self-similar solution of the Ricci flow coupled with the harmonic…
We examine the use of domain decomposition for potentially more efficient mean curvature flow of surface meshes, whose faces are arbitrary simple polygons. We first test traditional domain decomposition methods with and without overlap of…
Accelerated gradient methods are the cornerstones of large-scale, data-driven optimization problems that arise naturally in machine learning and other fields concerning data analysis. We introduce a gradient-based optimization framework for…
We consider here a fully discrete variant of the implicit variational scheme for mean curvature flow [AlmTayWan,LucStu], in a setting where the flow is governed by a crystalline surface tension defined by the limit of pairwise interactions…
In this paper we study a gradient flow approach to the problem of quantization of measures in one dimension. By embedding our problem in $L^2$, we find a continuous version of it that corresponds to the limit as the number of particles…
In this paper we introduce an iterative Jacobi algorithm for solving distributed model predictive control (DMPC) problems, with linear coupled dynamics and convex coupled constraints. The algorithm guarantees stability and persistent…
We consider a sharp interface formulation for the multi-phase Mullins-Sekerka flow. The flow is characterized by a network of curves evolving such that the total surface energy of the curves is reduced, while the areas of the enclosed…
An analytic framework based on partial differential equations is derived for certain dynamic clustering methods. The proposed mathematical framework is based on the application of the conservation law in physics to characterize successive…