Theoretical Analysis of Active Contours on Graphs

Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their formulation on arbitrary geometric graphs, which place no restrictions in the spatial configuration of samples, is still at an early stage. In this paper, we introduce geometric approximations of gradient and curvature on arbitrary graphs, which enable a straightforward extension of active contour models that are formulated through level sets to such general inputs. 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 Gaussia...

[1]  L. Vincent.  Graphs and mathematical morphology , 1989 .

[2]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Nicolás García Trillos,et al.  Continuum Limit of Total Variation on Point Clouds , 2014, Archive for Rational Mechanics and Analysis.

[4]  Abderrahim Elmoataz,et al.  Eikonal Equation Adaptation on Weighted Graphs: Fast Geometric Diffusion Process for Local and Non-local Image and Data Processing , 2012, Journal of Mathematical Imaging and Vision.

[5]  Alexander Toet,et al.  Graph morphology , 1992, J. Vis. Commun. Image Represent..

[6]  Mikhail Belkin,et al.  Convergence of Laplacian Eigenmaps , 2006, NIPS.

[7]  Pierre Pudlo,et al.  The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous , 2010, Advances in Applied Probability.

[8]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , 1997 .

[9]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[10]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[11]  Petros Maragos,et al.  Active Contours on Graphs: Multiscale Morphology and Graphcuts , 2012, IEEE Journal of Selected Topics in Signal Processing.

[12]  Ulrike von Luxburg,et al.  How the result of graph clustering methods depends on the construction of the graph , 2011, ArXiv.

[13]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[14]  Leo Grady,et al.  Discrete Calculus - Applied Analysis on Graphs for Computational Science , 2010 .

[15]  Gilles Bertrand,et al.  Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[18]  Ling Huang,et al.  An Analysis of the Convergence of Graph Laplacians , 2010, ICML.

[19]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[20]  Abderrahim Elmoataz,et al.  Nonlocal PdES on graphs for active contours models with applications to image segmentation and data clustering , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[21]  Abderrahim Elmoataz,et al.  Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing , 2008, IEEE Transactions on Image Processing.

[22]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[23]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[24]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[25]  Christopher V. Alvino,et al.  The Piecewise Smooth Mumford–Shah Functional on an Arbitrary Graph , 2009, IEEE Transactions on Image Processing.

[26]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[27]  Mikhail Belkin,et al.  Consistency of spectral clustering , 2008, 0804.0678.

[28]  Camille Couprie,et al.  Power Watershed: A Unifying Graph-Based Optimization Framework , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Abderrahim Elmoataz,et al.  Partial Difference Operators on Weighted Graphs for Image Processing on Surfaces and Point Clouds , 2014, IEEE Transactions on Image Processing.

[30]  Erkki Oja,et al.  Clustering by Nonnegative Matrix Factorization Using Graph Random Walk , 2012, NIPS.

[31]  Erkki Oja,et al.  Projective Nonnegative Matrix Factorization for Image Compression and Feature Extraction , 2005, SCIA.

[32]  Olivier Lezoray,et al.  Image Processing and Analysis With Graphs: theory and Practice , 2017 .

[33]  Abderrahim Elmoataz,et al.  Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing , 2011, IEEE Transactions on Image Processing.

[34]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[35]  Camille Couprie,et al.  Combinatorial Continuous Maximum Flow , 2010, SIAM J. Imaging Sci..

[36]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[37]  Abderrahim Elmoataz,et al.  Nonlocal PDEs on Graphs: From Tug-of-War Games to Unified Interpolation on Images and Point Clouds , 2017, Journal of Mathematical Imaging and Vision.

[38]  Gilles Bertrand,et al.  Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[39]  D. Pollard.  Strong Consistency of $K$-Means Clustering , 1981 .

[40]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[41]  Abderrahim Elmoataz,et al.  On the p-Laplacian and ∞-Laplacian on Graphs with Applications in Image and Data Processing , 2015, SIAM J. Imaging Sci..

[42]  Camille Couprie,et al.  Dual constrained TV-based regularization , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[43]  Abderrahim Elmoataz,et al.  Discrete Regularization on Weighted Graphs for Image and Mesh Filtering , 2007, SSVM.

[44]  Jean Cousty,et al.  Some Morphological Operators in Graph Spaces , 2009, ISMM.

[45]  Anil N. Hirani,et al.  Discrete exterior calculus , 2005, math/0508341.

[46]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .