Kontextunterstützte Analyse von Szenen mit bewegten Objekten

Der Versuch, statische Szenen zu erkennen, begann mit heuristischen Programmen, die auf eine spezielle Klasse von Szenen, die “Blocks-World” zugeschnitten waren /1,2/. Eine Verallgemeinerung dieser heuristischen Ansatze durch Formulierung von graphahnlichen Modellen wurde in /3,4/ dargestellt. Eine Erweiterung der Komplexitat der Vorlagen auf naturliche Szenen begann mit den Arbeiten von Yakimovsky, Ohlander und Shirai /5, 6, 7/. Gleichzeitig vollzog sich der Ubergang von heuristischen Programmen zur Formalisierung der Beschreibung von Segmentierung, Modellbildung und Interpretation der Szene /8/.

[1]  Lawrence G. Roberts,et al.  Machine Perception of Three-Dimensional Solids , 1963, Outstanding Dissertations in the Computer Sciences.

[2]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[3]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[4]  Adolfo Guzmán-Arenas,et al.  COMPUTER RECOGNITION OF THREE-DIMENSIONAL OBJECTS IN A VISUAL SCENE , 1968 .

[5]  Y. Shirai,et al.  Edge Finding, Segmentation Of Edges And Recognition Of Complex Objects , 1975, IJCAI.

[6]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[7]  Norman I. Badler,et al.  Temporal scene analysis: conceptual descriptions of object movements. , 1975 .

[8]  Harry G. Barrow,et al.  SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .

[9]  James William Mckee.  Computer recognition of partial views of three-dimensional curved objects. , 1975 .

[10]  Jerome A. Feldman,et al.  An ALGOL-based associative language , 1969, CACM.

[11]  Jake K. Aggarwal,et al.  Computer Analysis of Moving Polygonal Images , 1975, IEEE Transactions on Computers.

[12]  J. Moon,et al.  On cliques in graphs , 1965 .

[13]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[14]  J. Potter,et al.  Scene Segmentation By Velocity Measurements Obtained With A Cross-Shaped Template , 1975, IJCAI.

[15]  Harry G. Barrow,et al.  A Versatile System for Computer-Controlled Assembly , 1975, Artif. Intell..

[16]  David Marr,et al.  On the Purpose of Low-level Vision , 1974 .

[17]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[18]  Hans-Hellmut Nagel,et al.  Formation of an object concept by analysis of systematic time variations in the optically perceptible environment , 1978 .

[19]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[20]  D. Marr.  The Low-level Symbolic Representation of Intensity Changes in an Image , 1974 .

[21]  Kurt VanLehn.  SAIL user manual. , 1973 .

[22]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[23]  Yoram Yakimovsky.  Scene Analysis Using a Semantic Base for Region Growing. , 1973 .

[24]  Yoram Yakimovsky,et al.  Boundary and Object Detection in Real World Images , 1974, JACM.

[25]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[26]  Jake K. Aggarwal,et al.  Computer Analysis of Planar Curvilinear Moving Images , 1977, IEEE Transactions on Computers.

[27]  Frederick Hayes-Roth.  Patterns of induction and associated knowledge acquisition algorithms , 1976 .

[28]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[29]  Kurt Maly.  Compressed tries , 1976, CACM.

[30]  Ronald Bert Ohlander,et al.  Analysis of natural scenes. , 1975 .