Abstract
This paper describes the development of a Bayesian framework for multiple graph matching. The study is motivated by the plethora of multi-sensor fusion problems which can be abstracted as multiple graph matching tasks. The study uses as its starting point the Bayesian consistency measure recently developed by Wilson and Hancock. Hitherto, the consistency measure has been used exclusively in the matching of graph-pairs. In the multiple graph matching study reported in this paper, we use the Bayesian framework to construct an inference matrix which can be used to gauge the mutual consistency of multiple graph-matches. The multiple graph-matching process is realised as an iterative discrete relaxation process which aims to maximise the elements of the inference matrix. We experiment with our multiple graph matching process using an application vehicle furnished by the matching of aerial imagery. Here we are concerned with the simultaneous fusion of optical, infra-red and synthetic aperture radar images in the presence of digital map data.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Barrow H.G. and R.J. Popplestone, “Relational Descriptions in Picture Processing”, Machine Intelligence, 6, 1971.
Cross A.D.J., R.C. Wilson and E.R. Hancock, “Discrete Relaxation on a Boltzmann Machine”, Proceedings ICANN 95, pp. 491–496,1995.
Cross A.D.J., R.C.Wilson and E.R. Hancock, “Genetic Search for structural matching”, Proceedings ECCV96, LNCS 1064, pp. 514–525, 1996.
Cross A.D.J. and E.R.Hancock, “Relational Matching with stochastic optimisation” IEEE Computer Society International Symposium on Computer Vision, pp. 365–370, 1995.
Finch A.M., Wilson R.C. and Hancock E.R., “Softening Discrete Relaxation”, to appear in Neural Information Processing Systems 9, MIT Press 1997.
Gold S., A. Rangarajan and E. Mjolsness, “Learning with pre-knowledge: Clustering with point and graph-matching distance measures”, Neural Computation, 8, pp. 787–804, 1996.
Gold S. and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching”, IEEE PAMI, 18, pp. 377–388, 1996.
Hathaway R.J., J.C. Bezdek, W. Pedrycz, “A parametric model for fusing heterogeneous fuzzy data”, IEEE Transactions on Fuzzy Systems, 4, pp. 270–281, 1996.
Kittler J., W.J. Christmas and M.Petrou, “Probabilistic Relaxation for Matching Problems in Machine Vision”, Proceedings of the Fourth International Conference on Computer Vision, pp. 666–674, 1993.
Messmer B.T. and H. Bunke, " Efficient error-tolerant subgraph isomorphism detection”, Shape, Structure and Pattern Recognition, edited by D. Dori and A. Bruckstein, pp. 231–240, 1994.
Mjolsness E., G.Gindi and P. Anandan, “Optimisation in model matching and perceptual organisation”, Neural Computation, 1, pp. 218–219, 1989.
Sanfeliu A. and Fu K.S., “A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE SMC, 13, pp 353–362, 1983.
Shapiro L. and R.M. Haralick, “Structural Description and Inexact Matching”, IEEE PAMI, 3, pp 504–519, 1981.
Shapiro L. and R.M.Haralick, “A Metric for Comparing Relational Descriptions”, IEEE PAMI, 7, pp 90–94, 1985.
Simic P., “Constrained nets for graph matching and other quadratic assignment problems”, Neural Computation, 3, pp. 268–281, 1991.
Suganathan P.N., E.K. Teoh and D.P. Mital, “Pattern Recognition by Graph Matching using Potts MFT Networks”, Pattern Recognition, 28, pp. 997–1009, 1995.
Tang Y.C. and C.S.G. Lee, “A Geometric Feature Relation Graph Formalism for Consistent Sensor Fusion”, IEEE SMC, 22, pp 115–129, 1992.
Tang Y.C. and C.S.G. Lee, “Optimal strategic recognition of objects based on candidate discriminating graph with coordinated sensors”, IEEE SMC, 22, pp. 647–661, 1992.
Wilson R.C., Evans A.N. and Hancock E.R., “Relational Matching by Discrete Relaxation”, Image and Vision Computing, 13, pp. 411–421, 1995.
Wilson R.C and Hancock E.R., “Relational Matching with Dynamic Graph Structures”, Proceedings of the Fifth International Conference on Computer Vision, pp. 450–456, 1995.
Wilson R.C. and E.R. Hancock, “Gauging relational consistency and correcting structural errors”, IEEE Computer Society Computer Vision and Pattern Recognition Conference, pp. 47–54, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Williams, M.L., Wilson, R.C., Hancock, E.R. (1997). Multi-sensor fusion with Bayesian inference. In: Sommer, G., Daniilidis, K., Pauli, J. (eds) Computer Analysis of Images and Patterns. CAIP 1997. Lecture Notes in Computer Science, vol 1296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63460-6_96
Download citation
DOI: https://doi.org/10.1007/3-540-63460-6_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63460-7
Online ISBN: 978-3-540-69556-1
eBook Packages: Springer Book Archive