Abstract
The graph Merriman–Bence–Osher scheme produces, starting from an initial node subset, a sequence of node sets obtained by iteratively applying graph diffusion and thresholding to the characteristic (or indicator) function of the node subsets. One result in [14] gives sufficient conditions on the diffusion time to ensure that the set membership of a given node changes in one iteration of the scheme. In particular, these conditions only depend on local information at the node (information about neighbors and neighbors of neighbors of the node in question). In this paper we show that there does not exist any graph which satisfies these conditions. To make up for this negative result, this paper also presents positive results regarding the Merriman–Bence–Osher dynamics on star graphs and regular trees. In particular, we present sufficient (and in some cases necessary) results for the set membership of a given node to change in one iteration.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. Budd and Y. van Gennip, Deriving graph MBO as a semi-discrete implicit Euler scheme for graph Allen–Cahn, towards a potential link to graph mean curvature flow, in preparation.
A. Chambolle, Total variation minimization and a class of binary MRF models, in: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS Vol. 3757, pp. 136–152, Springer, 2005.
M. Cucuringu, A. Pizzoferrato, and Y. van Gennip, it An MBO scheme for clustering and semi-supervised clustering of signed networks, in preparation; preprint arXiv:1901.03091.
Hu H., Laurent T., Porter M.A., Bertozzi A.L.: A method based on total variation for network modularity optimization using the MBO scheme. SIAM Journal on Applied Mathematics 73(6), 2224–2246 (2013)
H. Hu, J. Sunu, and A.L. Bertozzi, Multi-class graph Mumford-Shah model for plume detection using the MBO scheme, in: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS Vol. 8932, pp. 209–225, Springer, 2015.
Hulin D., Troyanov M.: Mean curvature and asymptotic volume of small balls. The American Mathematical Monthly 110(10), 947–950 (2003)
B. Keetch and Y. van Gennip, A Max-Cut approximation using a graph based MBO scheme, to appear; preprint arXiv:1711.02419.
Merkurjev E., Kostic T., Bertozzi A.L.: An MBO scheme on graphs for segmentation and image processing. SIAM Journal on Imaging Sciences 6(4), 1903–1930 (2013)
E. Merkurjev, J. Sunu, and A.L. Bertozzi, Graph MBO method for multiclass segmentation of hyperspectral stand-off detection video, in: 2014 IEEE International Conference on Image Processing (ICIP), pp. 689–693, IEEE, 2014.
E. Merkurjev, A.L. Bertozzi, and F.R.K. Chung, A semi-supervised heat kernel pagerank MBO algorithm for data classification, Tech. report, University of California, Los Angeles, 2016.
B. Merriman, J.K. Bence, and S. Osher, Diffusion generated motion by mean curvature, UCLA Department of Mathematics CAM report CAM 06–32, 1992.
B. Merriman, J.K. Bence, and S. Osher, Diffusion generated motion by mean curvature, in: AMS Selected Letters, Crystal Grower’s Workshop, pp. 73–83, AMS, 1993.
J. Szarski, Differential inequalities, PWN Warsaw, 1965.
van Gennip Y., Guillen N., Osting B., Bertozzi A.L.: Mean curvature, threshold dynamics, and phase field theory on finite graphs. Milan J. Math. 82(1), 3–65 (2014)
Y. van Gennip, An MBO scheme for Minimizing the Graph Ohta–Kawasaki Functional, Journal of Nonlinear Science (2018); https://doi.org/10.1007/s00332-018-9468-8.
Zalesky B.A.: Network flow optimization for restoration of images. Journal of Applied Mathematics 2(4), 199–218 (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publishers Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
van Gennip, Y. Graph MBO on Star Graphs and Regular Trees. With Corrections to DOI 10.1007/s00032-014-0216-8. Milan J. Math. 87, 141–168 (2019). https://doi.org/10.1007/s00032-019-00296-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00032-019-00296-1