Theoretical Analysis of Active Contours on Graphs
DOI10.1137/16M1100101zbMath1386.35392arXiv1610.07381MaRDI QIDQ3130754
Kimon Drakopoulos, Petros Maragos, Christos Sakaridis
Publication date: 26 January 2018
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07381
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Computing methodologies for image processing (68U10) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical differentiation (65D25) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) PDEs in connection with computer science (35Q68)
Uses Software
Cites Work
- Unnamed Item
- Continuum limit of total variation on point clouds
- Local and nonlocal discrete regularization on weighted graphs for image and mesh processing
- Nonlocal discrete \(p\)-Laplacian driven image and manifold processing
- Constraints on deformable models: Recovering 3D shape and nonrigid motion
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Strong consistency of k-means clustering
- A geometric model for active contours in image processing
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Geodesic active contours
- Nonlocal PDEs on graphs: from tug-of-war games to unified interpolation on images and point clouds
- Consistency of spectral clustering
- Eikonal equation adaptation on weighted graphs: fast geometric diffusion process for local and non-local image and data processing
- Dual Constrained TV-based Regularization on Graphs
- Optimal approximations by piecewise smooth functions and associated variational problems
- Combinatorial Continuous Maximum Flow
- Some Morphological Operators in Graph Spaces
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- On the $p$-Laplacian and $\infty$-Laplacian on Graphs with Applications in Image and Data Processing
- Discrete Calculus
- Active contours without edges
- Random Geometric Graphs
- Partial Difference Operators on Weighted Graphs for Image Processing on Surfaces and Point Clouds
- The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
- The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph
- Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing
- How the result of graph clustering methods depends on the construction of the graph
This page was built for publication: Theoretical Analysis of Active Contours on Graphs
