Diffuse interface models on graphs for classification of high dimensional data

Multiscale Modeling and Simulation

Volumn 10, Issue 3, 2012, Pages 1090-1118

  Bertozzi, Andrea L ^a   Flenner, Arjuna ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NAVAL AIR WARFARE CENTER   (United States)

Author keywords

Diffuse interfaces; High dimensional data; Image processing; Nystr m extension

Indexed keywords

DETECTION METHODS; DIFFUSE INTERFACE; DIFFUSE INTERFACE MODELS; FEATURE IDENTIFICATION; GINZBURG-LANDAU FUNCTIONAL; GRAPH-THEORETIC PROBLEM; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL DATASETS; IMAGING COMMUNITY; SEMI-SUPERVISED LEARNING; SOCIAL NETWORKS; SPECTRAL METHODS; TOTAL VARIATION MINIMIZATION; VARIATIONAL ALGORITHMS;

ALGORITHMS; GRAPH THEORY; IMAGE PROCESSING; IMAGE SEGMENTATION;

DATA MINING;

EID: 84867006275     PISSN: 15403459     EISSN: 15403467     Source Type: Journal    
DOI: 10.1137/11083109X     Document Type: Article

References (59)

1. Georgia Tech Face Database, ftp://ftp.ee.gatech.edu/pub/users/hayes/ facedb/.
2. Microsoft Research Cambridge Object Recognition Image Database, Version 1.0, http://research.microsoft.com/downloads (2005).
3. L. Ambrosio and V. M. Tortorelli, On the approximation of free discontinuity problems, Boll. Un. Mat. Ital. B (7), 6 (1992), pp. 105-123.
4. S. Amghibech, Eigenvalues of the discrete p-Laplacian for graphs, Ars Combin., 67 (2003), pp. 283-302.
5. S. Belongie, C. Fowlkes, F. Chung, and J. Malik, Spectral partitioning with indefinite kernels using the Nyström extension, in Proceedings of the 7th European Conference on Computer Vision (ECCV), Copenhagen, 2002.
6. A. Bertozzi, S. Esedoglu, and A. Gillette, Analysis of a two-scale Cahn-Hilliard model for binary image inpainting, Multiscale Model. Simul., 6 (2007), pp. 913-936.
7. A. L. Bertozzi, S. Esedoglu, and A. Gillette, Inpainting of binary images using the Cahn- Hilliard equation, IEEE Trans. Image Process., 16 (2007), pp. 285-291.
8. A. L. Bertozzi, N. Ju, and H.-W. Lu, A biharmonic-modified forward time stepping method for fourth order nonlinear diffusion equations, Discrete Contin. Dyn. Syst., 29 (2011), pp. 1367-1391.
9. A. Buades, B. Coll, and J. M. Morel, A review of image denoising algorithms, with a new one, Multiscale Model. Simul., 4 (2005), pp. 490-530.
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. I. Capuzzo Dolcetta, S. Finzi Vita, and R. March, Area-preserving curve-shortening flows: From phase separation to image processing, Interfaces Free Bound., 4 (2002), pp. 325-343.
12. T. F. Chan and J. Shen, Image Processing and Analysis: Variational, PDE, Wavelet, and Stochastic Methods, SIAM, Philadelphia, 2005.
13. T. F. Chan and L. A. Vese, Active contours without edges, IEEE Trans. Image Process., 10 (2001), pp. 266-277.
14. F. R. K. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, AMS, Providence, RI, 1997.
15. R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. W. Zucker, Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps, Proc. Natl. Acad. Sci. USA, 102 (2005), pp. 7426-7431.
16. J. Darbon and M. Sigelle, A fast and exact algorithm for total variation minimization, in Pattern Recognition and Image Analysis, Lecture Notes in Comput. Sci. 3522, Springer, Berlin, 2005, pp. 351-359.
17. J. A. Dobrosotskaya and A. L. Bertozzi, A wavelet-Laplace variational technique for image deconvolution and inpainting, IEEE Trans. Image Process., 17 (2008), pp. 657-663.
18. J. A. Dobrosotskaya and A. L. Bertozzi, Wavelet analogue of the Ginzburg-Landau energy and its Gamma;-convergence, Interfaces Free Bound., 12 (2010), pp. 497-525.
19. 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.
20. S. Esedoglu, Blind deconvolution of bar code signals, Inverse Problems, 20 (2004), pp. 121-135.
21. S. Esedoglu and R. March, Segmentation with depth but without detecting junctions, J. Math. Imaging Vision, 18 (2003), pp. 7-15.
22. S. Esedoglu and J. Shen, Digital inpainting based on the Mumford-Shah-Euler image model, European J. Appl. Math., 13 (2002), pp. 353-370.
23. S. Esedoglu and Y.-H. R. Tsai, Threshold dynamics for the piecewise constant Mumford- Shah functional, J. Comput. Phys., 211 (2006), pp. 367-384.
24. D. J. Eyre, An Unconditionally Stable One-step Scheme for Gradient Systems, Technical report, Department of Mathematics, University of Utah, Salt Lake City, UT, 1998.
25. C. Fowlkes, S. Belongie, F. Chung, and J. Malik, Spectral grouping using the Nyström method, IEEE Trans. Pattern Anal. Mach. Intell., 26 (2004), pp. 214-225.
26. C. Fowlkes, S. Belongie, and J. Malik, Efficient spatiotemporal grouping using the Nyström method, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2001, pp. 231-238.
27. A. Frank and A. Asuncion, UCI Machine Learning Repository, School of Information and Computer Science, University of California, Irvine, CA, http://archive.ics.uci.edu/ml (2010).
28. G. Gilboa and S. Osher, Nonlocal linear image regularization and supervised segmentation, Multiscale Model. Simul., 6 (2007), pp. 595-630.
29. G. Gilboa and S. Osher, Nonlocal operators with applications to image processing, Multiscale Model. Simul., 7 (2008), pp. 1005-1028.
30. A. Gionis, H. Mannila, and P. Tsaparas, Clustering aggregation, ACM Trans. Knowl. Discov. Data, 1 (2007), 4.
31. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci., 2 (2009), pp. 323-343.
32. S. Guattery and G. L. Miller, On the quality of spectral separators, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 701-719.
33. H. Hein and T. Bühler, An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse PCA, in Advances in Neural Information Processing Systems 23 (NIPS 2010), MIT Press, Cambridge, MA, 2010, pp. 847-855.
34. D. Kay and R. Welford, A multigrid finite element solver for the Cahn-Hilliard equation, J. Comput. Phys., 212 (2006), pp. 288-304.
35. J. Kim, K. Kang, and J. Lowengrub, Conservative multigrid methods for Cahn-Hilliard fluids, J. Comput. Phys., 193 (2004), pp. 551-543.
36. R. V. Kohn and P. Sternberg, Local minimisers and singular perturbations, Proc. Roy. Soc. Edinburgh Sect. A, 111 (1989), pp. 69-84.
37. S. S. Lafon, Diffusion Maps and Geometric Harmonics, Ph.D. dissertation, Department of Mathematics, Yale University, New Haven, CT, 2004.
38. K. Lang, Fixing two weaknesses of the spectral method, in Advances in Neural Information Processing Systems 18 (NIPS 2006), MIT Press, Cambridge, MA, 2006, pp. 715-722.
39. A. McAdams, E. Sifakis, and J. Teran, A parallel multigrid Poisson solver for fluids simulation on large grids, in Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA), M. Otaduy and Z. Popovic, eds., 2010, pp. 1-10.
40. B. Merriman, J. K. Bence, and S. J. Osher, Motion of multiple functions: A level set approach, J. Comput. Phys., 112 (1994), pp. 334-363.
41. 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, University of Tokyo, Tokyo, Japan, 2007.
42. C. A. Ratanamahatana and D. Gunopulos, Scaling up the naive Bayesian classifier: Using decision trees for feature selection, in Proceedings of the IEEE Workshop on Data Cleaning and Preprocessing (DCAP 2002) at IEEE International Conference on Data Mining (ICDM 2002), Maebashi, Japan, 2002.
43. J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 22 (2000), pp. 888-905.
44. M. Stoer and F. Wagner, A simple min-cut algorithm, J. ACM, 44 (1997), pp. 585-591.
45. A. Szlam and X. Bresson, A Total Variation-Based Graph Clustering Algorithm for Cheeger Ratio Cuts, UCLA CAM Report 09-68, University of California, Los Angeles, CA, 2009.
46. A. Szlam and X. Bresson, Total variation and Cheeger cuts, in Proceedings of the 27th International Conference on Machine Learning (ICML-10), J. Fürnkranz and T. Joachims, eds., Haifa, Israel, Omnipress, 2010, pp. 1039-1046.
47. A. D. Szlam, M. Maggioni, and R. R. Coifman, Regularization on graphs with functionadapted diffusion processes, J. Mach. Learn. Res., 9 (2008), pp. 1711-1739.
48. J. van de Weijer and C. Schmid, Coloring local feature extraction, in Proceedings of the 9th European Conference on Computer Vision (ECCV 2006), A. Leonardis, H. Bischof, and A. Pinz, eds., Lecture Notes in Comput. Sci. 3952, Springer, Berlin, Heidelberg, 2006, pp. 334-348.
49. M. Varma and A. Zisserman, A statistical approach to texture classification from single images, Int. J. Comput. Vision, 62 (2005), pp. 61-81.
50. P. B. Vollmayr-Lee and A. D. Rutenberg, Fast and accurate coarsening simulation with an unconditionally stable time step, Phys. Rev. E, 68 (2003), 066703.
51. U. von Luxburg, A Tutorial on Spectral Clustering, Technical report TR-149, Max Planck Institute for Biological Cybernetics, Tübingen, Germany, 2006.
52. U. von Luxburg, M. Belkin, and O. Bousquet, On the convergence of spectral clustering on random samples: The normalized case, in Proceedings of the 17th Annual Conference on Learning Theory (COLT 2004), Banff, Canada, J. Shawe-Taylor and Y. Singer, eds., Lecture Notes in Comput. Sci. 3120, Springer-Verlag, Berlin, Heidelberg, 2004, pp. 457-471.
53. U. von Luxburg, M. Belkin, and O. Bousquet, Consistency of spectral clustering, Ann. Statist., 36 (2008), pp. 555-586.
54. D. Wagner and F. Wagner, Between min cut and graph bisection, in Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 711, Springer, Berlin, 1993, pp. 744-750.
55. L. P. Yaroslavsky, Digital Picture Processing. An Introduction, Springer-Verlag, Berlin, 1985.
56. A. L. Yuille and A. Rangarajan, The concave-convex procedure, Neural Comput., 15 (2003), pp. 915-936.
57. L. Zelnik-Manor and P. Perona, Self-tuning spectral clustering, in Advances in Neural Information Processing Systems 17 (NIPS 2004), MIT Press, Cambridge, MA, 2004, pp. 1601-1608.
58. X. Zhu, Z. Ghahramani, and J. Lafferty, Semi-supervised learning using Gaussian fields and harmonic functions, in Proceedings of the Twentieth International Conference on Machine Learning (ICML), 2003, pp. 912-919.
59. D. Zou and B. Scholkopf, A regularization framework for learning from graph data, in Proceedings of the ICML Workshop on Statistical Learning and Its Connection to Other Fields, International Conference Proceedings, Vol. 69, ACM, New York, 2004.