Indexing through laplacian spectra

Computer Vision and Image Understanding

Volumn 110, Issue 3, 2008, Pages 312-325

  Demirci, M Fatih ^a,b   van Leuken, Reinier H ^a   Veltkamp, Remco C ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b TOBB UNIVERSITY OF ECONOMICS AND TECHNOLOGY   (Turkey)

Author keywords

Indexing; Information retrieval; Laplacian spectrum; Spectral graph theory; Spectral integral variation

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; INDEXING (OF INFORMATION); MULTIMEDIA SERVICES;

LAPLACIAN EIGENVALUES; LAPLACIAN SPECTRA; SPECTRAL INTEGRAL VARIATION;

DATABASE SYSTEMS;

EID: 43049174583     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2007.09.012     Document Type: Article

References (55)

1. Anderson W.N., and Morley T.D. Eigenvalues of the laplacian of a graph. Linear and Multilinear Algebra 18 (1985) 141-145
2. Arya S., Mount D.M., Netanyahu N.S., Silverman R., and Wu A.Y. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM 45 6 (1998) 891-923
3. Attene M., Biasotti S., and Spagnuolo M. Shape understanding by contour-driven retiling. The Visual Computer 19 2-3 (2003) 127-138
4. Balińska K., Cvetković D., Radosavljevic Z., Simić S., and Stevanović D. A survey on integral graphs. Univerzitet Beogradu Publikacije Elektrotehnickog Fakulteta Serija Matematika 13 (2002) 42-65
5. Barik S., and Pati S. On algebraic connectivity and spectral integral variations of graphs. Linear Algebra and its Applications 397 (2005) 209-222
6. Biasotti S. Reeb graph representation of surfaces with boundary. SMI'04: Proceedings of the Shape Modeling International 2004 (2004), IEEE Computer Society, Washington, DC, USA 371-374
7. Biasottia S., Marini S., Spagnuoloa M., and Falcidieno B. Sub-part correspondence by structural descriptors of 3D shapes. Computer-Aided Design 38 9 (2006) 1002-1019
8. Chandrasekaran S., Manjunath B.S., Wang Y.F., Winkeler J., and Zhang H. An eigenspace update algorithm for image analysis. Graphical Models and Image Processing: GMIP 59 5 (1997) 321-332
9. Cole-McLaughlin K., Edelsbrunner H., Harer J., Natarajan V., and Pascucci V. Loops in Reeb graphs of 2-manifolds. Discrete and Computational Geometry (2004) 231-244
10. Costa M.S., and Shapiro L.G. Relational indexing. SSPR'96: Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition (1996), Springer-Verlag, London, UK 130-139
11. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs: Theory and Application. second ed. (1982), VEB Deutscher Verlag der Wissenschaften, Berlin
12. Dam E.R.V., and Haemers W.H. Spectral characterizations of some distance-regular graphs. Journal of Algebraic Combinatorics 15 2 (2002) 189-202
13. Demirci F., Shokoufandeh A., Keselman Y., Bretzner L., and Dickinson S. Object recognition as many-to-many feature matching. International Journal of Computer Vision 69 2 (2006) 203-222
14. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematics 23 (1973) 298-305
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman & Co., New York, NY, USA
16. Godsil C.D., and McKay B.D. Constructing cospectral graphs. Aequationes Mathematicae vol. 25 (1982), Birkhãuser Basel, University of Waterloo 257-268
17. Goldgof H.L.D.B., and Huang T.S. Matching and motion estimation of three-dimensional point and line sets using eigenstructure without correspondences. Pattern Recognition 25 3 (1992) 271-286
18. Grone R., Merris R., and Sunder V.S. The Laplacian spectrum of a graph. SIAM Journal on Matrix Analysis and Applications 11 (1990) 218-238
19. Haemers W.H., and Spence E. Enumeration of cospectral graphs. European Journal of Combinatorics 25 2 (2004) 199-211
20. Hilaga M., Shinagawa Y., Kohmura T., and Kunii T.L. Topology matching for fully automatic similarity estimation of 3D shapes. SIGGRAPH'01: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (2001), ACM Press, New York, NY, USA 203-212
21. Hoffmann C.M. Group-theoretic algorithms and graph isomorphism (1982), Springer-Verlag, Berlin
22. Hopcroft J.E., and Wong J.K. Linear time algorithm for isomorphism of planar graphs. STOC'74: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing (1974), ACM Press, New York, NY, USA 172-184
23. R. Horaud, T. Skordas, Structural matching for stereo vision, in: Ninth International Conference on Pattern Recognition, Rome, Italy, 1988, pp. 439-445.
24. Huttenlocher D., Klanderman D., and Rucklige A. Comparing images using the Hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 9 (1993) 850-863
25. Jesorsky O., Kirchberg K., and Frischholz R. Robust face detection using the Hausdorff distance. AVBPA'01: Proceedings of the Third International Conference on Audio and Video-Based Biometric Person Authentication (2001), Springer-Verlag, London, UK 90-95
26. Kim W., and Kak A. 3-D object recognition using bipartite matching embedded in discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 13 3 (1991) 224-251
27. Kirkland S. A characterization of spectral integral variation in two places for Laplacian matrices. Linear and Multilinear Algebra 52 2 (2004) 79-98
28. Koenderink J., and van Doorn A. The internal representation of solid shape with respect to vision. Biological Cybernetics 32 (1979) 211-216
29. Lee S.W., and Kim J.H. Attributed stroke graph matching for seal imprint verification. Pattern Recognition Letters 9 (1989) 137-145
30. Lu S.W., Ren Y., and Suen C.Y. Hierarchical attributed graph representation and recognition of handwritten Chinese characters. Pattern Recognition 24 7 (1991) 617-632
31. Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Applications 197 (1994) 143-176
32. Messmer B.T., and Bunke H. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition 32 12 (1999) 1979-1998
33. B. Mohar, The Laplacian spectrum of graphs, in: Sixth International Conference on the Theory and Applications of Graphs, 1988, pp. 871-898.
34. Mohar B. Laplace eigenvalues of graphs: a survey. Discrete Mathematics 109 1-3 (1992) 171-183
35. Mohar B. Some applications of Laplace eigenvalues of graphs. Graph Symmetry: Algebraic Methods and Applications vol. 497 (1997), Kluwer 227-275
36. Pati S. The third smallest eigenvalue of the Laplacian matrix. Electronic Journal of Linear Algebra 8 (2001) 128-139
37. Rouvray D.H., and Balaban A.T. Chemical applications of graph theory. Applications of Graph Theory (1979), Academic Press, London 177-221
38. Rucklidge W.J. Locating objects using the hausdorff distance. ICCV'95: Proceedings of the Fifth International Conference on Computer Vision (1995), IEEE Computer Society, Washington, DC, USA 457
39. Sclaroff S., and Pentland A. Modal matching for correspondence and recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 6 (1995) 545-561
40. Sengupta K., and Boyer K. Organizing large structural modelbases. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 4 (1995) 321-332
41. Sengupta K., and Boyer K.L. Modelbase partitioning using property matrix spectra. Computer Vision and Image Understanding 70 2 (1998) 177-196
42. Shapiro L.G., and Haralick R.M. Organization of relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence 4 11 (1982) 595-602
43. Shapiro L.S., and Brady J.M. Feature-based correspondence: an eigenvector approach. Image Vision Computing 10 5 (1992) 283-288
44. Shokoufandeh A., Macrini D., Dickinson S., Siddiqi K., and Zucker S.W. Indexing hierarchical structures using graph spectra. IEEE Transactions on Pattern Analysis and Machine Intelligence 27 7 (2005) 1125-1140
45. Siddiqi K., Bouix S., Tannenbaum A., and Zucker S.W. The Hamilton-Jacobi skeletons. International Journal of Computer Vision 48 3 (2002) 215-231
46. Siddiqi K., Shokoufandeh A., Dickinson S., and Zucker S. Shock graphs and shape matching. International Journal of Computer Vision 35 1 (1999) 13-32
47. So W. Rank one perturbation and its application to the Laplacian spectrum of a graph. Linear and Multilinear Algebra 46 (1999) 193-198
48. H. Sossa, R. Horaud, Model indexing: the graph-hashing approach, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1992, Champaign, IL, USA, pp. 811-814.
49. Tewfik A.H., and Deriche M. An eigenstructure approach to edge detection. IEEE Transactions on Image Processing 2 3 (1993) 353-368
50. Turk M., and Pentland A.P. Eigenfaces for recognition. Journal of Cognitive Neuroscience 3 1 (1991) 71-86
51. Wong A., Lu S., and Rioux M. Recognition and shape synthesis of 3-d objects based on attributed hypergraphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 11 3 (1989) 279-290
52. Wong E.K. Model matching in robot vision by subgraph isomorphism. Pattern Recognition 25 3 (1992) 287-303
53. Yizheng F. On spectral integral variations of graphs. Linear and Multilinear Algebra 50 2 (2002) 133-142
54. J. Zhang, K. Siddiqi, D. Macrini, A. Shokoufandeh, S.J. Dickinson, Retrieving articulated 3-D models using medial surfaces and their graph spectra, in: International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, St. Augustine, FL, USA, 2005, pp. 285-300.
55. P. Zhu, R.C. Wilson, A study of graph spectra for comparing graphs, in: British Machine Vision Conference, Oxford, UK, 2005.