skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: On median filters for motion by mean curvature
The median filter scheme is an elegant, monotone discretization of the level set formulation of motion by mean curvature. It turns out to evolve every level set of the initial condition precisely by another class of methods known as threshold dynamics. Median filters are, in other words, the natural level set versions of threshold dynamics algorithms. Exploiting this connection, we revisit median filters in light of recent progress on the threshold dynamics method. In particular, we give a variational formulation of, and exhibit a Lyapunov function for, median filters, resulting in energy based unconditional stability properties. The connection also yields analogues of median filters in the multiphase setting of mean curvature flow of networks. These new multiphase level set methods do not require frequent redistancing, and can accommodate a wide range of surface tensions.  more » « less
Award ID(s):
2012015
PAR ID:
10573243
Author(s) / Creator(s):
; ;
Publisher / Repository:
American Mathematical Society
Date Published:
Journal Name:
Mathematics of Computation
ISSN:
0025-5718
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We propose a level-set approach to characterize the region occupied by the solid in Stefan problems with and without surface tension, based on their recent probabilistic reformulation. The level-set function is parameterized by a feed-forward neural network, whose parameters are trained using the probabilistic formulation of the Stefan growth condition. The algorithm can handle Stefan problems where the liquid is supercooled and can capture surface tension effects through the simulation of particles along the moving boundary together with an efficient approximation of the mean curvature. We demonstrate the effectiveness of the method on a variety of examples with and without radial symmetry. 
    more » « less
  2. Using harmonic mean curvature flow, we establish a sharp Minkowski-type lower bound for total mean curvature of convex surfaces with a given area in Cartan-Hadamard $$3$$-manifolds. This inequality also improves the known estimates for total mean curvature in hyperbolic $$3$$-space. As an application, we obtain a Bonnesen-style isoperimetric inequality for surfaces with convex distance function in nonpositively curved $$3$$-spaces, via monotonicity results for total mean curvature. This connection between the Minkowski and isoperimetric inequalities is extended to Cartan–Hadamard manifolds of any dimension. 
    more » « less
  3. We study the problem of Robust Outlier Arm Identification (ROAI), where the goal is to identify arms whose expected rewards deviate substantially from the majority, by adaptively sampling from their reward distributions. We compute the outlier threshold using the median and median absolute deviation of the expected rewards. This is a robust choice for the threshold compared to using the mean and standard deviation, since it can identify outlier arms even in the presence of extreme outlier values. Our setting is different from existing pure exploration problems where the threshold is pre-specified as a given value or rank. This is useful in applications where the goal is to identify the set of promising items but the cardinality of this set is unknown, such as finding promising drugs for a new disease or identifying items favored by a population. We propose two 𝛿 -PAC algorithms for ROAI, which includes the first UCB-style algorithm for outlier detection, and derive upper bounds on their sample complexity. We also prove a matching, up to logarithmic factors, worst case lower bound for the problem, indicating that our upper bounds are generally unimprovable. Experimental results show that our algorithms are both robust and about 5 x sample efficient compared to state-of-the-art. 
    more » « less
  4. We study Mean Field stochastic control problems where the cost function and the state dynamics depend upon the joint distribution of the controlled state and the control process. We prove suitable versions of the Pontryagin stochastic maximum principle, both in necessary and in sufficient form, which extend the known conditions to this general framework. Furthermore, we suggest a variational approach to study a weak formulation of these control problems. We show a natural connection between this weak formulation and optimal transport on path space, which inspires a novel discretization scheme. 
    more » « less
  5. Abstract The skew mean curvature flow is an evolution equation forddimensional manifolds embedded in$${\mathbb {R}}^{d+2}$$ R d + 2 (or more generally, in a Riemannian manifold). It can be viewed as a Schrödinger analogue of the mean curvature flow, or alternatively as a quasilinear version of the Schrödinger Map equation. In an earlier paper, the authors introduced a harmonic/Coulomb gauge formulation of the problem, and used it to prove small data local well-posedness in dimensions$$d \geqq 4$$ d 4 . In this article, we prove small data local well-posedness in low-regularity Sobolev spaces for the skew mean curvature flow in dimension$$d\geqq 2$$ d 2 . This is achieved by introducing a new, heat gauge formulation of the equations, which turns out to be more robust in low dimensions. 
    more » « less