Theoretical Analysis of Active Contours on Graphs

DOI10.1137/16M1100101MaRDI QIDQ3130754zbMATH OpenFDO

Authors Christos Sakaridis, Kimon Drakopoulos, Petros Maragos

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

zbMATH Keywords

active contoursgraph segmentationimage segmentationrandom geometric graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80) PDEs in connection with computer science (35Q68) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Geometric probability and stochastic geometry (60D05) Numerical differentiation (65D25) Computing methodologies for image processing (68U10)

Abstract: Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce geometric approximations of gradient and curvature, which are used in the geodesic active contour model. We prove convergence in probability of our gradient approximation to the true gradient value and derive an asymptotic upper bound for the error of this approximation for the class of random geometric graphs. Two different approaches for the approximation of curvature are presented and both are also proved to converge in probability in the case of random geometric graphs. We propose neighborhood-based filtering on graphs to improve the accuracy of the aforementioned approximations and define two variants of Gaussian smoothing on graphs which include normalization in order to adapt to graph non-uniformities. The performance of our active contour framework on graphs is demonstrated in the segmentation of regular images and geographical data defined on arbitrary graphs.

Recommendations

• Active contour methods on arbitrary graphs based on partial differential equations
• Computational and structural analysis of the contour of graphs
• Topology preserving active contours
• Variational, Geometric, and Level Set Methods in Computer Vision
• Sobolev active contours
• Geodesic active contours
• On the contour of graphs
• A geometric model for active contours in image processing
• Shape and topology constraints on parametric active contours

Cites work

• A geometric model for active contours in image processing
• Active contours without edges
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• Combinatorial continuous maximum flow
• Consistency of spectral clustering
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• Continuum limit of total variation on point clouds
• Discrete calculus. Applied analysis on graphs for computational science
• Dual constrained TV-based regularization on graphs
• Eikonal equation adaptation on weighted graphs: fast geometric diffusion process for local and non-local image and data processing
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geodesic active contours
• How the result of graph clustering methods depends on the construction of the graph
• Image processing and analysis with graphs. Theory and practice.
• Local and nonlocal discrete regularization on weighted graphs for image and mesh processing
• Nonlocal discrete p-Laplacian driven image and manifold processing
• Nonlocal PDEs on graphs: from tug-of-war games to unified interpolation on images and point clouds
• Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing
• On the p-Laplacian and -Laplacian on graphs with applications in image and data processing
• Optimal approximations by piecewise smooth functions and associated variational problems
• Partial Difference Operators on Weighted Graphs for Image Processing on Surfaces and Point Clouds
• Random Geometric Graphs
• Some Morphological Operators in Graph Spaces
• Strong consistency of k-means clustering
• The normalized graph cut and Cheeger constant: from discrete to continuous
• The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph

Cited in

(2)

• Active contour methods on arbitrary graphs based on partial differential equations
• Segmentation and skeletonization on arbitrary graphs using multiscale morphology and active contours

Describes a project that uses

Uses Software

• BSDS

This page was built for publication: Theoretical Analysis of Active Contours on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130754)