A minimal surface criterion for graph partitioning
DOI10.3934/IPI.2016036zbMATH OpenNoneOpenAlexW2532244855MaRDI QIDQ338611FDOQ338611
Authors: Dominique Zosso, Braxton Osting
Publication date: 7 November 2016
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2016036
Recommendations
- Graph partitions with minimum degree constraints
- scientific article; zbMATH DE number 1792660
- Minimum Cuts in Surface Graphs
- A computational approach to an optimal partition problem on surfaces
- scientific article; zbMATH DE number 3991298
- On minimal arbitrarily partitionable graphs
- Partitioning a graph into minimum gap components
- scientific article; zbMATH DE number 1933255
- On minimum covering partition energy of a graph
- Graph Bipartization and via minimization
clusteringgraph partitionconvex optimizationbilevel optimizationBeltrami energyminimal surfacethreshold dynamicsprimal-dual hybrid gradientsrearrangement algorithm
Computing methodologies for image processing (68U10) Minimal surfaces and optimization (49Q05) Numerical methods for variational inequalities and related problems (65K15) Numerical approximation and computational geometry (primarily algorithms) (65Dxx)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Title not available (Why is that?)
- Graph Partitioning and Graph Clustering
- Least squares quantization in PCM
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Variational methods in shape optimization problems
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Title not available (Why is that?)
- Title not available (Why is that?)
- Isoperimetric Inequalities in Mathematical Physics. (AM-27)
- An optimal partition problem for eigenvalues
- An MBO scheme on graphs for classification and image processing
- Optimal partitions for eigenvalues
- Universally optimal distribution of points on spheres
- Title not available (Why is that?)
- Introduction to some conjectures for spectral minimal partitions
- On spectral minimal partitions: the case of the sphere
- Threshold dynamics for networks with arbitrary surface tensions
- On spectral minimal partitions: a survey
- Title not available (Why is that?)
- Active contours without edges
- Duality-based algorithms for total-variation-regularized image restoration
- Minimization of Region-Scalable Fitting Energy for Image Segmentation
- Minimal Dirichlet energy partitions for graphs
- The honeycomb conjecture
- Some Theorems on the Free Energies of Crystal Surfaces
- Diffusion-generated motion by mean curvature for filaments
- Images as embedded maps and minimal surfaces: Movies, color, texture, and volumetric medical images
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- On the torsion function with Robin or Dirichlet boundary conditions
- Remarks on two notions of spectral minimal partitions
- The Finite Element Method with Penalty
- A general framework for low level vision
- Spectral minimal partitions for a family of tori
- Variational dynamics of free triple junctions
- Title not available (Why is that?)
- Approximation of partitions of least perimeter by \(\Gamma\)-convergence: around Kelvin's conjecture
- Numerical analysis of nodal sets for eigenvalues of Aharonov-Bohm Hamiltonians on the square with application to minimal partitions
- Multiphase Shape Optimization Problems
- Image segmentation with dynamic artifacts detection and bias correction
- On local region models and a statistical interpretation of the piecewise smooth Mumford-Shah functional
Cited In (9)
- Consistency of Dirichlet partitions
- An efficient primal-dual method for the obstacle problem
- PDE acceleration: a convergence rate analysis and applications to obstacle problems
- A level set method for the Dirichlet \(k\)-partition problem
- Efficient algorithm for optimizing spectral partitions
- Diffusion generated methods for denoising target-valued images
- Uniqueness of a solution to a general class of discrete system defined on connected graphs
- A continuum limit for the PageRank algorithm
- A diffusion generated method for computing Dirichlet partitions
This page was built for publication: A minimal surface criterion for graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338611)