Pattern vectors from algebraic graph theory

Subject:acm: ComputerApplications_COMPUTERSINOTHERSYSTEMSarxiv: Computer Science::Databases

References
(39)
[1] A.D. Bagdanov and M. Worring, “First Order Gaussian Graphs for Efficient Structure Classification,” Pattern Recogntion, vol. 36, pp. 13111324, 2003.
[2] M. Belkin and P. Niyogi, “Laplacian Eigenmaps for Dimensionality Reduction and Data Representation,” Neural Computation, vol. 15, no. 6, pp. 13731396, 2003.
[3] N. Biggs, Algebraic Graph Theory. Cambridge Univ. Press, 1993.
[4] P. Botti and R. Morris, “Almost All Trees Share a Complete Set of Inmanantal Polynomials,” J. Graph Theory, vol. 17, pp. 467476, 1993.
[5] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, pp. 749764, 1995.
[6] F.R.K. Chung, “Spectral Graph Theory,” Am. Math. Soc. Edition., CBMS series 92, 1997.
[7] T. Cox and M. Cox, Multidimensional Scaling. ChapmanHall, 1994.
[8] D. Cvetkovic, P. Rowlinson, and S. Simic, Eigenspaces of Graphs. Cambridge Univ. Press, 1997.
[9] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 377388, 1996.
[10] X. He and P. Niyogi, “Locality Preserving Projections,” Advances in Neural Information Processing Systems 16, MIT Press, 2003.

Metrics
No metrics available

 Download from


Cite this publication