Abstract
In this paper, we develop a method of matching and recognizing aerial road network images based on road network models. We use attributed relational graphs to describe images and models. The correspondences are found using a relaxation labelling algorithm, which optimises a criterion of similarity.
This work was supported by IED and SERC, project number IED-1936. The images were kindly provided by the Defence Research Agency, RSRE, UK.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. A. Hummel and S. W. Zucker. “On the foundations of relaxation labeling process”. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-5(3):267–286, May 1983.
J. Kittler and J. Illingworth. “Relaxation labeling algorithms — a review”. Image and Vision Computing, 3(4):206–216, November 1985.
S. Z. Li. “Towards 3D vision from range images: An optimization framework and parallel distributed networks”. CVGIP: Image Understaning, to appear.
J. Mohammed, R. Hummel, and S. Zucker. “A feasible direction operator for relaxation method”. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-5(3):330–332, May 1983.
M. Petrou. “Optimal convolution filters and an algorithm for the detection of linear features”. VSSP-TR-21/90, Electronic and Electrical Engineering Department, Surrey University, 1990.
A. Rosenfeld, R. Hummel, and S. Zucker. “Scene labeling by relaxation operations”. IEEE Transactions on Systems, Man and Cybernetics, 6:420–433, June 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, S.Z., Kittler, J., Petrou, M. (1992). Matching and recognition of road networks from aerial images. In: Sandini, G. (eds) Computer Vision — ECCV'92. ECCV 1992. Lecture Notes in Computer Science, vol 588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55426-2_99
Download citation
DOI: https://doi.org/10.1007/3-540-55426-2_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55426-4
Online ISBN: 978-3-540-47069-4
eBook Packages: Springer Book Archive