Abstract
The recognition of three-dimensional solid objects is a well known problem from the field of machine vision for industrial applications. In the stereo vision approach two two-dimensional images are obtained from calibrated camera positions. In the method discussed here, a graph is constructed for each of the two images with the nodes corresponding to the object vertices. For both the correspondence problem and the recognition stage, the inexact graph matching is used. In order to reduce the computational complexity, several search and pruning strategies are investigated in connection with both A* and Branch and Bound aiming at speeding up the inexact matching procedure. The discussion is restricted to trihedral objects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Yakimovsky and R. Cunningham, “A system for extracting three dimensional measurements from a stereo pair of TV cameras,” Computer Graphics and Image Processing, 7 (1978) 195–210.
A. Barr and E.A. Feigenbaum, The Handbook of Artificial Intelligence, Ditman, London, 1982.
M. Akkermans and M. van Thillo, “An algorithm for the extraction of line drawings for polyhedral scenes and their use in stereo vision,” Proceedings SPIE, 449 (1984) 534–540.
P. Hofland, “De bepaling van een lijntekening van een scene t.b.v. robot vision,” M.Sc. Thesis Delft University of Technology, 1985.
W.H. Tsai and K.S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” IEEE Trans. SMC, 9 (12), 1979.
H. Bunke and G. Allermann, “Inexact graph matching for structural pattern recognition,” Pattern Recognition Letters, (1) 4, 1983, 245–253.
N.J. Nilsson, Principles of Artificial Intelligence, Springer, 1982.
C.H. Papadimitrou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.
J. Pearl, “Knowledge versus search: A quantitative analysis using A*,” Artificial Intelligence, (20), 1983, 1–13.
J.N.M. Kuipers, “Inexact graph matching,” M.Sc. Thesis Delft University of Technology, 1984.
E.F.P. van Mieghem, “De herkenning van 3-D voorwerpen met behulp van stereovision,” M.Sc. Thesis Delft University of Technology, 1985
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backer, E., Gerbrands, J.J. (1987). Inexact Graph Matching Used in Machine Vision. In: Devijver, P.A., Kittler, J. (eds) Pattern Recognition Theory and Applications. NATO ASI Series, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83069-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-83069-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83071-6
Online ISBN: 978-3-642-83069-3
eBook Packages: Springer Book Archive