Supervised Learning of Graph Structure
Graph-based representations have been used with considerable success in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the methodology available for learning structural representations from sets of training examples is relatively limited. In this paper we take a simple yet effective Bayesian approach to attributed graph learning. We present a naïve node-observation model, where we make the important assumption that the observation of each node and each edge is independent of the others, then we propose an EM-like approach to learn a mixture of these models and a Minimum Message Length criterion for components selection. Moreover, in order to avoid the bias that could arise with a single estimation of the node correspondences, we decide to estimate the sampling probability over all the possible matches. Finally we show the utility of the proposed approach on popular computer vision tasks such as 2D and 3D shape recognition.
KeywordsMessage Length Model Node External Node Observation Probability Minimum Message Length
Unable to display preview. Download preview PDF.
- 5.Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advances in NIPS (2006)Google Scholar
- 7.He, X.C., Yung, N.H.C.: Curvature scale space corner detector with adaptive threshold and dynamic region of support. In: Proceedings of the Pattern Recognition, 17th International Conference on (ICPR 2004), vol. 2, pp. 791–794. IEEE Computer Society, Washington, DC, USA (2004)Google Scholar
- 9.Nene, S.A., Nayar, S.K., Murase, H.: Columbia Object Image Library (COIL-20). Technical report (February 1996)Google Scholar
- 15.Torsello, A.: An Importance Sampling Approach to Learning Structural Representations of Shape. In: IEEE CVPR (2008)Google Scholar
- 18.White, D., Wilson, R.C.: Spectral Generative Models for Graphs. In: Int. Conf. Image Analysis and Processing, pp. 35–42. IEEE Computer Society, Los Alamitos (2007)Google Scholar