Abstract
Although there are a number of existing measures for quantifying the structural properties of undirected graphs, there are relatively few corresponding measures for directed graphs. To fill this gap in the literature, in this paper, we explore how to extend Estrada’s heterogeneity index from undirected to directed graphs and define an analogous heterogeneity measure for directed graphs. From the perspective of object recognition, this measure opens up the possibility of using directed graphs (such as nearest neighbour graphs) to represent the arrangement of object features. This type of representation is potentially more discriminating than an undirected graph. We show how our new heterogeneity measure can be used to characterize k-nearest neighbour graphs representing the arrangement of object features extracted from objects in the COIL-20 database. We compare the performance of this measure with the original Estrada’s heterogeneity index. Finally we achieve the conclusion that our measure gives a better characterization performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berwanger, D., Gradel, E., Kaiser, L., Rabinovich, R.: Entanglement and the Complexity of Directed Graphs. Theoretical Computer Science 463, 2–25 (2012)
Escolano, F., Hancock, E.R., Lozano, M.A.: Heat Diffusion: Thermodynamic Depth Complexity of Networks. Physical Review E 85, 036206 (2012)
Escolano, F., Bonev, B., Hancock, E.R.: Heat Flow-Thermodynamic Depth Complexity in Directed Networks. Structural, Syntactic, and Statistical Pattern Recognition, 190–198 (2012)
Estrada, E.: Quantifying Network Heterogeneity. Physical Review E 82, 066102 (2010)
Han, L., Escolano, F., Hancock, E.R., Wilson, R.C.: Graph Characterizations from Von Neumann Entropy. Pattern Recognition Letters 33, 1958–1967 (2012)
Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition 36, 2213–2230 (2003)
Nene, A.K., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-20). Technical Report CUCS-005-96 (February 1996)
Ren, P., Wilson, R.C., Hancock, E.R.: Graph Characterization via Ihara Coefficients. IEEE Transactions on Neural Networks 22, 233–245 (2011)
Wilson, R.C., Hancock, E.R., Luo, B.: Pattern Vectors from Algebraic Graph Theory. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 1112–1124 (2005)
Xiao, B., Hancock, E.R., Wilson, R.C.: Graph Characteristics from the Heat Kernel Trace. Pattern Recognition 42, 2589–2606 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, C., Wilson, R.C., Hancock, E.R. (2013). Heterogeneity Index for Directed Graphs. In: Wilson, R., Hancock, E., Bors, A., Smith, W. (eds) Computer Analysis of Images and Patterns. CAIP 2013. Lecture Notes in Computer Science, vol 8048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40246-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-40246-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40245-6
Online ISBN: 978-3-642-40246-3
eBook Packages: Computer ScienceComputer Science (R0)