相关论文: Large data limit of the MBO scheme for data cluste…
In this work we begin to rigorously analyze the MBO scheme for data clustering in the large data limit. Each iteration of the MBO scheme corresponds to one step of implicit gradient descent for the thresholding energy on the similarity…
We propose and study a novel efficient algorithm for clustering and classification tasks based on the famous MBO scheme. On the one hand, inspired by Jacobs et al. [J. Comp. Phys. 2018], we introduce constraints on the size of clusters…
We present an efficient scheme for level set mean curvature flow using a domain discretization and median filters. For this scheme, we show convergence in $L^\infty$-norm under mild assumptions on the number of points in the discretization.…
The hyperbolic MBO is a threshold dynamic algorithm which approximates interfacial motion by hyperbolic mean curvature flow. We introduce a generalization of this algorithm for imparting damping terms onto the equation of motion. We also…
The famous thresholding scheme by Merriman, Bence, and Osher (Motion of multiple junctions: A level set approach. Journal of Computational Physics 112.2 (1994): 334-363.) proved itself as a very efficient time discretization of mean…
The evolution of a closed two-dimensional surface driven by both mean curvature flow and a reaction--diffusion process on the surface is formulated into a system, which couples the velocity law not only to the surface partial differential…
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…
The Merriman-Bence-Osher (MBO) scheme, also known as thresholding or diffusion generated motion, is an efficient numerical algorithm for computing mean curvature flow (MCF). It is fairly well understood in the case of hypersurfaces. This…
We consider the thresholding scheme, a time discretization for mean curvature flow introduced by Merriman, Bence and Osher. We prove a convergence result in the multi-phase case. The result establishes convergence towards a weak formulation…
In this paper we establish the convergence of three computational algorithms for interface motion in a multi-phase system, which incorporate bulk effects. The algorithms considered fall under the classification of thresholding schemes, in…
An evolving surface finite element discretisation is analysed for the evolution of a closed two-dimensional surface governed by a system coupling a generalised forced mean curvature flow and a reaction--diffusion process on the surface,…
A novel multiscale consensus-based optimization (CBO) algorithm for solving bi- and tri-level optimization problems is introduced. Existing CBO techniques are generalized by the proposed method through the employment of multiple interacting…
We present an unsupervised data processing workflow that is specifically designed to obtain a fast conformational clustering of long molecular dynamics simulation trajectories. In this approach we combine two dimensionality reduction…
Consensus-based optimization (CBO) is a class of metaheuristic algorithms designed for global optimization problems. In the many-particle limit, classical CBO dynamics can be rigorously connected to mean-field equations that ensure…
We introduce a simple and efficient numerical method to compute mean curvature flow with obstacles. The method augments the Merrimam-Bence-Osher scheme with a pointwise update that enforces the constraint and therefore retains the…
In this work, we analyze Merriman, Bence and Osher's thresholding scheme, a time discretization for mean curvature flow. We restrict to the two-phase setting and mean convex initial conditions. In the sense of the minimizing movements…
We study large deviations for a Markov process on curves in $\mathbb{Z}^2$ mimicking the motion of an interface. Our dynamics can be tuned with a parameter $\beta$, which plays the role of an inverse temperature, and coincides at $\beta$ =…
An algorithm is proposed for generalized mean curvature flow of closed two-dimensional surfaces, which include inverse mean curvature flow, powers of mean and inverse mean curvature flow, etc. Error estimates are proven for semi- and full…
We present a data segmentation method based on a first-order density-induced consensus protocol. We provide a mathematically rigorous analysis of the consensus model leading to the stopping criteria of the data segmentation algorithm. To…
Clustering large, mixed data is a central problem in data mining. Many approaches adopt the idea of k-means, and hence are sensitive to initialisation, detect only spherical clusters, and require a priori the unknown number of clusters. We…