Indexing through laplacian spectra

With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in which entries can be represented as graph structures. In our method, the topological structure of a graph as well as that of its subgraphs are represented as vectors whose components correspond to the sorted laplacian eigenvalues of the graph or subgraphs. Given the laplacian spectrum of graph G, we draw from recently developed techniques in the field of spectral integral variation to generate the laplacian spectrum of graph G

• Type: Journal
• Year: 2008
• Where: CVIU
• Authors: M. Fatih Demirci, Reinier H. van Leuken, Remco C. Veltkamp
• Keywords: CVIU 2008, Indexing Multimedia Databases, Laplacian Spectrum, Sorted Laplacian Eigenvalues