Isoperimetric Graph Partitioning for Data Clustering and Image Segmentation
暂无分享,去创建一个
[1] J. Maxwell. A Treatise on Electricity and Magnetism , 1873, Nature.
[2] J P Roth,et al. AN APPLICATION OF ALGEBRAIC TOPOLOGY TO NUMERICAL ANALYSIS: ON THE EXISTENCE OF A SOLUTION TO THE NETWORK PROBLEM. , 1955, Proceedings of the National Academy of Sciences of the United States of America.
[3] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[4] Jr. F. Branin. The Inverse of the Incidence Matrix of a Tree and the Formulation of the Algebraic-First-Order Differential Equations of an RLC Network , 1963 .
[5] G. Arfken. Mathematical Methods for Physicists , 1967 .
[6] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian , 1969 .
[7] R. Rohrer. The Generalized Adjoint Network and Network Sensitivities , 1969 .
[8] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[9] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[10] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[11] M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .
[12] Donald E. Knuth,et al. Big Omicron and big Omega and big Theta , 1976, SIGA.
[13] A. Hughes. The Topography of Vision in Mammals of Contrasting Life Style: Comparative Optics and Retinal Organisation , 1977 .
[14] L. Ahlfors. Complex Analysis , 1979 .
[15] Gene H. Golub,et al. Matrix computations , 1983 .
[16] Kishore Singhal,et al. Computer Methods for Circuit Analysis and Design , 1983 .
[17] J. Dodziuk. Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .
[18] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[19] T. D. Morley,et al. Eigenvalues of the Laplacian of a graph , 1985 .
[20] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[21] N. Alon. Eigenvalues and expanders , 1986, Comb..
[22] J. Besag. On the Statistical Analysis of Dirty Pictures , 1986 .
[23] M. Fiedler. Special matrices and their applications in numerical mathematics , 1986 .
[24] Gilbert Strang,et al. Introduction to applied mathematics , 1988 .
[25] B. Mohar. Isoperimetric inequalities, growth, and the spectrum of graphs , 1988 .
[26] Bojan Mohar,et al. Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.
[27] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[28] Jitendra Malik,et al. Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[29] Jack J. Dongarra,et al. Solving linear systems on vector and shared memory computers , 1990 .
[30] Eric L. Schwartz,et al. Design considerations for a space-variant visual sensor with complex-logarithmic geometry , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.
[31] P. Tetali. Random walks and the effective resistance of networks , 1991 .
[32] Chung-Kuan Cheng,et al. Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[33] Horst D. Simon,et al. Partitioning of unstructured problems for parallel processing , 1991 .
[34] Andrew B. Kahng,et al. New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[35] Alex POTHENy,et al. SPECTRAL NESTED DISSECTION , 1992 .
[36] John R. Gilbert,et al. Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..
[37] Richard M. Leahy,et al. An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[38] Bruce Hendrickson,et al. The Chaco user`s guide. Version 1.0 , 1993 .
[39] W. Hackbusch. Iterative Solution of Large Sparse Systems of Equations , 1993 .
[40] T. Chan,et al. Geometric Spectral Partitioning , 1994 .
[41] R. Merris. Laplacian matrices of graphs: a survey , 1994 .
[42] Y. F. Hu,et al. Numerical Experiences with Partitioning of Unstructured Meshes , 1994, Parallel Comput..
[43] Andrew B. Kahng,et al. Recent directions in netlist partitioning: a survey , 1995, Integr..
[44] Shang-Hua Teng,et al. Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[45] Fan Chung,et al. Spectral Graph Theory , 1996 .
[46] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[47] Stephen Guattery,et al. On the Quality of Spectral Separators , 1998, SIAM J. Matrix Anal. Appl..
[48] Pietro Perona,et al. A Factorization Approach to Grouping , 1998, ECCV.
[49] Gary L. Miller,et al. Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..
[50] Chao Yang,et al. ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.
[51] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[52] Olga Veksler,et al. A New Algorithm for Energy Minimization with Discontinuities , 1999, EMMCVPR.
[53] G. R. Schreiber,et al. Cut Size Statistics of Graph Bisection Heuristics , 1999, SIAM J. Optim..
[54] D. A. Van Baak. Variational alternatives to Kirchhoff’s loop theorem in dc circuits , 1999 .
[55] Arno B. J. Kuijlaars,et al. Which Eigenvalues Are Found by the Lanczos Method? , 2000, SIAM J. Matrix Anal. Appl..
[56] Sudeep Sarkar,et al. Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[57] Marie-Pierre Jolly,et al. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[58] 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.
[59] Michael Werman,et al. Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[60] Daniel Cremers,et al. Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[61] Adrian Barbu,et al. Graph partition by Swendsen-Wang cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[62] Leo Grady,et al. The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs , 2003 .
[63] Jeffrey Mark Siskind,et al. Image Segmentation with Ratio Cut , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[64] Gareth Funka-Lea,et al. Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials , 2004, ECCV Workshops CVAMIA and MMBIA.
[65] E. Schwartz,et al. Faster graph-theoretic image processing via small-world and quadtree topologies , 2004, CVPR 2004.
[66] P. Schröder,et al. Sparse matrix solvers on the GPU: conjugate gradients and multigrid , 2003, SIGGRAPH Courses.
[67] Benjamin B. Bederson,et al. Space variant image processing , 1994, International Journal of Computer Vision.
[68] Anil K. Jain. Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.