The Appearance of the Giant Component in Descriptor Graphs and Its Application for Descriptor Selection
The paper presents a random graph based analysis approach for evaluating descriptors based on pairwise distance distributions on real data. Starting from the Erdős-Rényi model the paper presents results of investigating random geometric graph behaviour in relation with the appearance of the giant component as a basis for choosing descriptors based on their clustering properties. Experimental results prove the existence of the giant component in such graphs, and based on the evaluation of their behaviour the graphs, the corresponding descriptors are compared, and validated in proof-of-concept retrieval tests.
Keywordsfeature selection graph analysis giant components
Unable to display preview. Download preview PDF.
- 1.Zhang, W., Men, S., Xu, L., Xu, B.: Feature distribution based quick image retrieval. In: Proc. of Web Information Systems and Applications Conference, pp. 23–28 (2010)Google Scholar
- 3.Morris, M., Kender, J.: Sort-merge feature selection and fusion methods for classification of unstructured video. In: Proc. of IEEE International Conference on Multimedia and Expo., pp. 578–581 (2009)Google Scholar
- 7.Li, F., Dai, Q., Xu, W.: Improved similarity-based online feature selection in region-based image retrieval. In: Proc. of IEEE Intl. Conference on Multimedia and Expo., pp. 349–352 (2006)Google Scholar
- 8.Spenser, J.: The giant component: The golden anniversary. Notices of the AMS 57, 720–724 (1975)Google Scholar
- 9.Erdős, P., Rényi, A.: On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences (1960)Google Scholar
- 10.Penrose, M.: Random Geometric Graphs. Oxford University Press (2003)Google Scholar
- 11.Meester, R., Roy, R.: Continuum Percolation. Cambridge University Press (1996)Google Scholar
- 14.Ojala, T., Pietikainen, M.: Multiresolution gray-scale and rotation invariant texture classification with local binary patterns. IEEE Trans. on Pattern Analysis and Machine Intelligence 24(7) (2002)Google Scholar