An MBO scheme on graphs for classification and image processing

SIAM Journal on Imaging Sciences

Volumn 6, Issue 4, 2013, Pages 1903-1930

  Merkurjev, Ekaterina ^a   Kostić, Tijana ^a   Bertozzi, Andrea L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Ginzburg Landau functional; Image processing; MBO scheme; Nystr m extension

Indexed keywords

COMPUTATIONALLY EFFICIENT; DATA CLASSIFICATION; DIFFUSE INTERFACE MODELS; EIGENVALUES AND EIGENVECTORS; GINZBURG-LANDAU FUNCTIONAL; MBO SCHEME; MULTI-SCALE MODELING; REPETITIVE STRUCTURE;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPHIC METHODS; IMAGE PROCESSING; LAPLACE TRANSFORMS;

CLASSIFICATION (OF INFORMATION);

EID: 84891081628     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/120886935     Document Type: Article

References (67)

1. C. Anderson, A Raleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices, J. Comput. Phys., 229 (2010), pp. 7477-7487.
2. P. Arias, V. Caselles, and G. Sapiro, A variational framework for nonlocal image inpainting, in Proceedings of EMMCVPR 2009, Bonn, Germany, 2009, pp. 345-358.
3. G. Barles and C. Georgelin, A simple proof of convergence for an approximation scheme for computing motions by mean curvature, SIAM J. Numer. Anal., 32 (1995), pp. 484-500.
4. S. Belongie, C. Fowles, F. Chung, and J. Malik, Partitioning with indefinite kernels using the Nyström extension, in Proceedings of the European Conference on Computer Vision, Copenhagen, 2002.
5. M. Bertalmio, L. Vese, G. Sapiro, and S. Osher, Simultaneous structure and texture inpainting, IEEE Trans. Image Process., 12 (2003), pp. 882-889.
6. A. Bertozzi, M. Bertalmio, and G. Sapiro, Navier-Stokes fluid dynamics and image and video inpainting, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2001, pp. 355-362.
7. A. Bertozzi, S. Esedoḡlu, and A. Gillette, Inpainting by the Cahn-Hilliard equation, IEEE Trans. Image Process., 16 (2007), pp. 285-291.
8. A. Bertozzi and A. Flenner, Diffuse interface models of graphs for classification of high dimensional data, Multiscale Model. Simul., 10 (2012), pp. 1090-1118.
9. A. Buades, B. Coll, and J.-M. Morel, A non-local algorithm for image denoising, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2005, vol. 2, pp. 60-65.
10. T. Bühler and M. Hein, Spectral clustering based on the graph p-Laplacian, in Proceedings of the 26th International Conference on Machine Learning, 2009, pp. 81-88.
11. J.-F. Cai, R. Chan, and Z. Shen, A framelet based image inpainting algorithm, Appl. Comput. Harmon. Anal., 24 (2008), pp. 131-149.
12. T. Chan and L. Vese Active contours without edges, IEEE Trans. Image Process., 10 (2001), pp. 266-277.
13. F. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, Providence, RI, 1997.
14. T. Cour, F. Benezit, and J. Shi, Spectral segmentation with multiscale graph decomposition, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2005, vol. 2, pp. 1124-1131.
15. X. Desquesnes, A. Elmoataz, and O. Lezoray, PDEs level sets on weighted graphs, in Proceedings of the 18th IEEE International Conference on Image Processing (ICIP), 2011, pp. 3377-3380.
16. J. Dobrosotskaya and A. Bertozzi, A wavelet-Laplace variational technique for image deconvolution and inpainting, IEEE Trans. Image Process, 17 (2008), pp. 657-663.
17. P. Drineas and M.W. Mahoney, On the Nyström method for approximating a Gram matrix for improved kernel-based learning, J. Mach. Learn. Res., 6 (2005), pp. 2153-2175.
18. A. Elmoataz, O. Lezoray, and S. Bougleux, Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing, IEEE Trans. Image Process., 17 (2008), pp. 1047-1060.
19. S. Esedoḡlu and R. March, Segmentation with depth but without detecting junctions, J. Math. Imaging Vision, 18 (2003), pp. 7-15.
20. S. Esedoḡlu, S.J. Ruuth, and R. Tsai, Diffusion generated motion using signed distance functions, J. Comput. Phys., 229 (2010), pp. 1017-1042.
21. S. Esedoḡlu, S.J. Ruuth, and R. Tsai, Threshold dynamics for high order geometric motions, Interfaces Free Bound., 10 (2008), pp. 263-282.
22. S. Esedoḡlu and Y.R. Tsai, Threshold dynamics for the piecewise constant Mumford-Shah functional, J. Comput. Phys., 26 (2004), pp. 367-384.
23. L.C. Evans, Convergence of an algorithm for mean curvature motion, Indiana Univ. Math. J., 42 (1993), pp. 553-557.
24. G. Facciolo, P. Arias, V. Caselles, and G. Sapiro, Exemplar-based interpolation of sparsely sampled images, in Proceedings of the Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, 2009, pp. 331-344.
25. C. Fowlkes, S. Belongie, and J. Malik, Spectral grouping using the Nyström method, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 469-475.
26. C. Fowlkes, S. Belongie, F. Chung, and J. Malik, Efficient spatiotemporal grouping using the Nyström method, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, HI, 2001, pp. 214-225.
27. C. Frohn-Schauf, S. Henn, and K. Witsch, Nonlinear multigrid methods for total variation image denoising, Comput. Vis. Sci., 7 (2004), pp. 199-206.
28. C. Garcia-Cardona, E. Merkurjev, A.L. Bertozzi, A. Flenner, and A. Percus, Fast multiclass segmentation using diffuse interface methods on graphs, IEEE Trans. Pattern Anal. Mach. Intell., submitted.
29. G. Gilboa and S. Osher, Nonlocal operators with applications to image processing, Multiscale Model. Simul., 7 (2008), pp. 1005-1028.
30. G. Gilboa and S. Osher, Nonlocal linear image regularization and supervised segmentation, Multiscale Model. Simul., 6 (2007), pp. 595-630.
31. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci., 2 (2009), pp. 323-343.
32. T. Goldstein, X. Bresson, and S. Osher, Geometric applications of the split Bregman method: Segmentation and surface reconstruction, J. Sci. Comput., 45 (2010), pp. 272-293.
33. L. Grady and E.L. Schwartz, Isoperimetric graph partitioning for image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 469-475.
34. A. Harten, High resolution schemes for hyperbolic conservation laws, J. Comput. Phys., 49 (1983), pp. 357-393.
35. H. Hein and T. Buehler, An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA, Adv. Neural Inform. Process. Syst., 23 (2010), pp. 847-855.
36. H. Hu, T. Laurent, M.A. Porter, and A.L. Bertozzi, A method based on total variation for network modularity optimization using the MBO scheme, SIAM J. Appl. Math., (2013), submitted.
37. D. Karger, and C. Stein, A new approach to the minimum cut problem, J. ACM, 43 (1996), pp. 601-640.
38. D. Karger, Minimum cuts in near-linear time, J. ACM, 47 (2000), pp. 46-76.
39. R.V. Kohn and P. Sternberg, Local minimizers and singular perturbations, Proc. Roy. Soc. Edinburgh Sect. A, 11 (1989), pp. 69-84.
40. Y. Lou, X. Zhang, S. Osher, and A. Bertozzi, Image recovery via nonlocal operators, J. Sci. Comput., 42 (2010), pp. 185-197.
41. J. Mairal, M. Elad, and G. Sapiro, Sparse representation for color image restoration, IEEE Trans. Image Process., 17 (2008), pp. 53-69.
42. B. Merriman and S.J. Ruuth, Diffusion generated motion of curves on surfaces, J. Comput. Phys., 225 (2007), pp. 2267-2282.
43. B. Merriman, J. Bence, and S. Osher, Diffusion generated motion by mean curvature, in Proceedings of the Computational Crystal Growers Workshop, Providence, RI, 1992, pp. 73-83.
44. E. Mezuman and Y. Weiss, Globally optimizing graph partitioning problems using message passing, in Proceedings of the 15th International Conference on Artificial Intelligence and Statistics, 22, 2012, pp. 770-778.
45. B. Mohar, The Laplacian spectrum of graphs, Graph Theory Combin. Appl., 2 (1991), pp. 871-898.
46. D. Mumford and J. Shah Optimal approximations by piecewise smooth functions and associated variational problems, Comm. Pure Appl. Math., 42 (1989), pp. 577-685.
47. M.M. Naeini, G. Dutton, K. Rothley, and G. Mori, Action recognition of insects using spectral clustering, in Proceedings of the IAPR Conference on Machine Vision Applications, 2007, pp. 1-4.
48. S. Osher and J. Shen, Digitalized PDE method for data restoration, in Analytical-Computational Methods in Applied Mathematics, E.G.A. Anastassiou, ed., Chapman & Hall/CRC, New York, 2000, pp. 751-771.
49. G. Peyre, S. Bougleux, and L. Cohen, Non-local regularization of inverse problems, in Proceedings of the European Conference on Computer Vision (ECCV 2008), Springer, Berlin, 2008, pp. 57-68.
50. C.A. Ratanamahatana and D. Gunopulos, Scaling up the naive Bayesian classifier: Using decision trees for feature selection, in Proceedings of the IEEE International Conference on Data Mining (ICDM 2002), Maebashi, Japan, 2002, pp. 475-487.
51. J. Rubinstein, P. Sternberg, and J.B. Keller, Fast reaction, slow diffusion, and curve shortening, SIAM J. Appl. Math., 49 (1989), pp. 116-133.
52. S.J. Ruuth, Efficient algorithms for diffusion-generated motion by mean curvature, J. Comput. Phys., 144 (1998), pp. 603-625.
53. H. Schaeffer and S. Osher, A low patch-rank interpretation of texture, SIAM J. Imaging Sci., 6 (2013), pp. 226-262.
54. J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 22 (2000), pp. 888-905.
55. M. Stoer and F. Wagner, A simple min-cut algorithm, J. ACM, 44 (1997), pp. 585-591.
56. A. Szlam and X. Bresson, Total variation-based graph clustering algorithm for Cheeger ratio cuts, in Proceedings of the 27th International Conference on Machine Learning, 2010, pp. 1039-1046.
57. Y. van Gennip and A.L. Bertozzi, Γ-convergence of graph Ginzburg-Landau functionals, Adv. Differential Equations, 17 (2012), pp. 1115-1180.
58. Y. van Gennip, N. Guillen, B. Osting, and A.L. Bertozzi, Mean curvature, threshold dynamics, and phase field theory on finite graphs, (2013) (journal unknown).
59. U. von Luxburg, A tutorial on spectral clustering, Statist. Comput., 17 (2007), pp. 395-416.
60. D. Wagner and F. Wagner, Between min cut and graph bisection, in Mathematical Foundations of Computer Science 1993, Lecture Notes in Comput. Sci. 711, Springer, New York, 1993, pp. 744-750.
61. L. Zelnik-Manor and P. Perona, Self-tuning spectral clustering, Adv. Neutral Inform. Process. Syst., 17 (2004), pp. 1601-1608.
62. X. Zhang, M. Burger, X. Bresson, and S. Osher, Bregmanized nonlocal regularization for deconvolution and sparse reconstruction, SIAM J. Imaging Sci., 3 (2010), pp. 253-276.
63. X. Zhang and T. Chan, Wavelet inpainting by nonlocal total variation, Inverse Problems Imag., 4 (2010), pp. 1-20.
64. D. Zhou and B. Schölkopf, Regularization on discrete spaces, in Pattern Recognition, Springer, Berlin, Germany, 2005, pp. 361-368.
65. D. Zhou and B. Schölkopf, Discrete regularization, in Semi-Supervised Learning, MIT Press, Cambridge, MA, 2006, pp. 221-232.
66. D. Zhou, J. Huang, and B. Schölkopf, Learning from labeled and unlabeled data on a directed graph, in Proceedings of the 22nd International Conference on Machine Learning, 2005, pp. 1041-1048.
67. D. Zhou, B. Schölkopf, and T. Hofmann, Semi-supervised learning on directed graphs, Adv. Neutral Inform. Process. Syst., 17 (2005), pp. 1633-1640.