Estimating perimeter using graph cuts

DOI10.1017/apr.2017.34zbMath1425.60014arXiv1602.04102OpenAlexW2963988444MaRDI QIDQ5233201

James H. von Brecht, Dejan Slepčev, Nicolás García Trillos

Publication date: 16 September 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04102

zbMATH Keywords

concentration inequalityperimeternonparametric estimationrandom geometric graphpoint cloudgraph cut

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Geometric probability and stochastic geometry (60D05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Lipschitz Regularity of Graph Laplacians on Random Data Clouds ⋮ From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds ⋮ Consistent Dynamics of Stripes Formed by Cell-Type Interfaces ⋮ Optimal Cheeger cuts and bisections of random geometric graphs ⋮ Rates of convergence for Laplacian semi-supervised learning with low labeling rates ⋮ Nonparametric estimation of surface integrals on level sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuum limit of total variation on point clouds
• Nonparametric estimation of surface integrals
• A nonparametric approach to the estimation of lengths and surface areas
• Consistency of Cheeger and Ratio Graph Cuts
• Heat flow and a faster algorithm to compute the surface area of a convex body
• Length and surface area estimation under smoothness restrictions
• On clusterings
• A non-local anisotropic model for phase transitions: asymptotic behaviour of rescaled energies
• The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
• Testing surface area with arbitrary accuracy
• Nonparametric estimation of boundary measures and related functionals: asymptotic results
• Probability Inequalities for Sums of Bounded Random Variables
• Testing Surface Area
• Towards a universally consistent estimator of the Minkowski content
• Testing problems with sublearning sample complexity

This page was built for publication: Estimating perimeter using graph cuts