Abstract
Images of a sequence may be described by assignments of symbols, where attributes of symbols and relationships between symbols are computed from the sampled intensity or colour measurements. Relational structures are the mathematical formulation of such descriptions. To establish correspondence relations between symbols of an image sequence, mappings between image descriptions can be generated by searching for cliques in a compatibility graph. Different types of morphisms between relational structures (RS-morphisms) are proposed which tolerate various structural dissimilarities between image descriptions. The same technique of inexact matching can be applied to the synthesis of objects from prototypes which are composed as relational structures. The common formalism, presented here, is an attempt to unify the essential steps of object instantiation and object correspondence in the analysis of image sequences.
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.
Similar content being viewed by others
References
E. A. Akkoyunlu: The Enumeration of Maximal Cliques of Large Graphs, SIAM J. Comput. 2 (1973) 1–6
A. P. Ambler, H. G. Barrow, C. M. Brown, R. M. Burstall, R. J. Popplestone: A Versatile System for Computer Controlled Assembly, Artificial Intelligence 6 (1975) 129–156
H. G. Barrow, R. J. Popplestone: Relational Descriptions in Picture Processing, Machine Intelligence 6 (B. Meltzer, D. Michie, eds.), University Press Edinburgh 1971, pp. 377–396
H. G. Barrow, A. P. Ambler, K. M. Burstall: Some Techniques for Recognising Structures in Pictures, in [WATANABE 72] pp. 1–29
R. C. Bolles: Robust Feature Matching Through Maximal Cliques, SPIE 182 (1980) 140–149
C. Bron, J. Kerbosch: Finding All Cliques of an Undirected Graph, Comm.ACM 16 (1973) 525–577
J.-K. Cheng, T. S. Huang: Algorithms for Matching Relational Structures and their Applications to Image Processing, Report TR-EE 80–53, Purdue Univ., West Lafayette, IN., Dec. 1980
J.-K. Cheng, T. S. Huang: A Subgraph Isomorphism Algorithm Using Resolution, Pattern Recognition 13 (1981) 371–379
J. P. Foith (ed): Angewandte Szenenanalyse, 2. DAGM Symposium, Okt. 1979 in Karlsruhe, Informatik Fachberichte 20, Springer-Verlag Heidelberg 1979
L. Gerhards, W. Lindenberg: Clique Detection for Nondirected Graphs: Two New Algorithms, Computing 21 (1979) 295–322
C. J. Jacobus, R. T. Chien, J. M.Selander: Detection and Analysis of Matching Graphs of Intermediate-Level Primitives, IEEE Trans. PAMI-2 (1980) 495–510
H. C. Johnston: Cliques of a Graph -Variations on the Bron-Kerbosch Algorithm, Int. J. Comp. Inf. Sciences 5 (1976) 209–238
D. Kozen: A Clique Problem Equivalent to Graph Isomorphism, SIGACT News 10 (1978) 50–52
R. Kraasch, W. Zach: SERF -Eine Untersuchung zur Segmentation und symbolischen Beschreibung von Fernsehbildern, Mitteilung IfI-HH-M-59/78 des Fachbereichs Informatik der Universität Hamburg 1978
R. Kraasch, W. Zach: Dreidimensionale Beschreibung einfacher bewegter Gegenstände, Diplomarbeit am Fachbereich Informatik der Universität Hamburg 1979
R. Kraasch, B. Radig, W. Zach: Automatische dreidimensionale Beschreibung bewegter Gegenstände, in [FOITH 79]. pp. 208–215
J. Misra: Necessary Subproblems in Maximal Clique Construction, 7th Hawai Int. Conf. on System Sciences, Honolulu 1974, pp. 124–128
G. D. Mulligan: Algorithms for Finding Cliques of a Graph, Report TR41, Dept. Comp. Science, Univ. Toronto 1977
B. Neumann, B. Radig: Strategien zur Analyse von Szenen mit Bewegung, 4. Arbeitstagung der GI-Fachgruppe für Künstliche Intelligenz, Bad Honnef 1979, Bericht des Instituts für Informatik der Universität Bonn
R. E. Osteen: Clique Detection Algorithms Based on Line Addition and Line Removal, SIAM J. Appl. Math. 26 (1974) 126–135
J. Potter: Motion as a Cue to Segmentation, IEEE Trans. SMC-5 (1975) 390–394
B. Radig, R. Kraasch, W. Zach: Matching Symbolic Descriptions for 3-D Reconstruction of Simple Moving Objects, ICPR-80, pp. 1081 -1084
B. Radig: Symbolische Beschreibung von Bildfolgen I: Relationengebilde und Morphismen, Bericht IfI-HH-B-90/82 des Fachbereichs Informatik der Universität Hamburg 1982
B. Radig: Hierarchical Symbolic Description and Matching of Time Varying Images, Proc. Int. Conf. Pattern Recognition, München, Okt. 1982
A. Sen Gupta, A. Palit: On Clique Generation Using Boolean Equations, Proc. IEEE 67 (1979) 178–180
L. G. Shapiro, R. M. Haralick: Structural Descriptions and Inexact Matching, IEEE Trans PAMI-3 (1981) 504–519
K. J. Turner: Computer Perception of Curved Objects Using a Television Camera, Ph.D. Thesis, Univ. of Edinburgh, 1974
S. Watanabe (ed): Frontiers of Pattern Recognition, Academic Press, New York, NY. 1972
Y. Yakimovsky: Boundary and Object Detection in Real World Images J.ACM 23 (1976) 599–618
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radig, B. (1982). Symbolic Description and Matching of Image Sequences. In: Wahlster, W. (eds) GWAI-82. Informatik-Fachberichte, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68826-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-68826-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11960-9
Online ISBN: 978-3-642-68826-3
eBook Packages: Springer Book Archive