• Heinrich Niemann
Part of the Springer Series in Information Sciences book series (SSINF, volume 4)


The result of recording a pattern is a vector or array of sample points. This kind of data may even be represented in assembly language. The result of preprocessing usually is another vector or array, so that in these cases there would be no reason to talk about data at all. However, there are more complicated cases, too. For instance, the split and merge algorithm of Sect. 3. 4. 4 made explicit use of a picture tree. This shows that already at this stage of processing more sophisticated structures become necessary or, at least, useful. Thinking of further stages one might be interested in representing results (for instance, hypotheses) of analysis, in linking results to other results or to pattern sample values, and in deleting results which are not needed any longer. One also might be interested in representing information about structural properties or the field of problems. It seems that it will be very comfortable, to say the least, if one has the possibility of building general structures and of changing them as analysis progresses. Storage of a sample ω of patterns for experimental or archival purposes is another point. It is not useful to store just arrays of points, rather these arrays should be accompanied by additional information facilitating retrieval of particular patterns. For instance, one might wish to inspect all images containing a certain object or all utterances with at least 100 vowels. Obviously this requires a good deal of data management.


Data Base Storage Structure Small Line Longe Line Data Base Management 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 5.1
    N. Wirth: Algorithmen und Datenstrukturen (Teubner, Stuttgart 1975)MATHGoogle Scholar
  2. 5.2
    E. Horowitz, S. Sahni: Fundamentals of Data Structures (Pitman, London 1976)MATHGoogle Scholar
  3. 5.3
    J.L. Pfaltz: Computer Data Structures (McGraw-Hill, New York 1977)Google Scholar
  4. 5.4
    K. Jensen, N. Wirth: PASCAL—User Manual and Report, 2nd ed. (Springer, Berlin, Heidelberg, New York 1978)Google Scholar
  5. 5.5
    W.E. Gull, M.A. Jenkins: Recursive data structures in APL. Commun. ACM 22, 79–96 (1979)MathSciNetMATHCrossRefGoogle Scholar
  6. 5.6
    J. Guttag: Abstract data types and the development of data structures. Commun. ACM 20, 396–404 (1977)MATHCrossRefGoogle Scholar
  7. 5.7
    C.J. Date: An Introduction to Database Systems, 2nd ed. (Addison-Wesley, Reading 1977)Google Scholar
  8. 5.8
    H. Wedekind: Datenbanksysteme 1 und 2 (Bibliographisches Institut, Mannheim 1974, 1976)Google Scholar
  9. 5.9
    H. Wedekind: Structured Database Programming (Hanser, München 1977)MATHGoogle Scholar
  10. 5.10
    P.C. Lockemann, E.J. Neuhold (eds.): Systems for Large Data Bases (North Holland, Amsterdam 1977)MATHGoogle Scholar
  11. 5.11
    C. Mohan: An overview of recent data base research. Data Base, 3–24 (Fall 1978)Google Scholar
  12. 5.12
    H. Barsamian: Guest editor’s introduction: technology and architecture for data base management — an overview and perspective. Computer 12, No.5, 8–10 (1979)CrossRefGoogle Scholar
  13. 5.13
    Special Issue: Databases. Comput. Aided Design 11, No.3 (1979)Google Scholar
  14. 5.14
    Special Issue: Database Machines. IEEE Trans. C-28, No.6 (1979)Google Scholar
  15. 5.15
    J.P. Fry, E.H. Sibley: Evolution of data-base management systems. Comput. Surv. 8, 7–42 (1976)MATHCrossRefGoogle Scholar
  16. 5.16
    L.G. Shapiro: Data structures for picture processing. Comput. Graph. (ACM) 12, No.3, 140–146 (1978); see also Comput. Graph. Image Proc. 11, 162-184 (1979)Google Scholar
  17. 5.17
    A. Klinger: “Data Structures and Pattern Recognition”, in Advances in Information System Sciences, ed. by J.T. Tou (Plenum Press, New York 1978) pp. 273–310CrossRefGoogle Scholar
  18. 5.18
    S. Fernandez, P. Haberäcker, E. Krauth, G. Kritikos, P. Nowak, E. Triendl: “DIBIAS-Handbuch”; Deutsche Forschungs-und Versuchsanstalt für Luft-und Raumfahrt DFVLR, Inst, für Nachrichtentechnik, Oberpfaffenhofen, FRG (1976)Google Scholar
  19. 5.19
    R.M. Haralick, G. Minden: KANDIDATS, and interactive image processing system. Comput. Graph. Image Proc. 8, 1–15 (1978)CrossRefGoogle Scholar
  20. 5.20
    H. Tamura, S. Mori: “A Data Management System for Manipulating Large Images”, Proc. Workshop on Picture Data Description and Management, Chicago, 1977, pp. 45–54Google Scholar
  21. 5.21
    D.C. Van Voorhis, T.H. Morrin: Memory systems for image processing. IEEE Trans. C-27, 113–125 (1978)MATHCrossRefGoogle Scholar
  22. 5.22
    U. Ramer: Extraction of line structures from photographs of curved objects. Comput. Graph. Image Proc. 4, 81–103 (1975)CrossRefGoogle Scholar
  23. 5.23
    R.D. Giustini, M.D. Levine, A.S. Malowany: Picture generation using semantic nets. Comput. Graph. Image Proc. 7, 1–29 (1978)CrossRefGoogle Scholar
  24. 5.24
    R.D. Merrill: Representation of contours and regions for efficient computer search. Commun. ACM 16, 69–82 (1973)MathSciNetCrossRefGoogle Scholar
  25. 5.25
    R. Nevatia: Computer Analysis of Scenes of 3-Dimensional Objects (Birkhäuser, Basel 1976)Google Scholar
  26. 5.26
    N. Alexandridis, A. Klinger: Picture decomposition, tree data structures, and identifying directional symmetries as node combinations. Comput. Graph. Image Proc. 8, 43–77 (1978)CrossRefGoogle Scholar
  27. 5.27
    S. Tanimoto, T. Pavlidis: A hierarchical data structure for picture processing. Comput. Graph. Image Proc. 4, 104–119 (1975)CrossRefGoogle Scholar
  28. 5.28
    A.R. Hanson, E.M. Riseman: “Preprocessing Cones—A Computational Structure for Scene Analysis”; COINS Tech. Report, Univ. of Mass., Amherst (1974)Google Scholar
  29. 5.29
    S.L. Tanimoto: “A Software Laboratory for Image Search Techniques”, Proc. 4th Int. Joint Conf. on Pattern Recognition, Kyoto, Jpn. 1978, pp. 1096–1099Google Scholar
  30. 5.30
    T. Pavlidis, K. Steiglitz: “The Automatic Counting of Asbestos Fibers in Air Samples”, Proc. 3rd Int. Joint Conf. on Pattern Recognition, Coronado, CA 1976, pp. 789–792Google Scholar
  31. 5.31
    J.L. Pfaltz: Web grammars and picture description. Comput. Graph. Image Proc. 1, 193–220 (1972)MathSciNetCrossRefGoogle Scholar
  32. 5.32
    F. Hayes-Roth: Representation of structured events and efficient procedures for their recognition. Pattern Recognition 8, 141–150 (1976)MATHCrossRefGoogle Scholar
  33. 5.33
    L.S. Davis: “Shape Matching Using Relaxation Techniques”, Proc. Conf. on Pattern Recognition and Image Proc, Troy 1977, pp. 191–197Google Scholar
  34. 5.34
    R.M. Haralick, L.G. Shapiro: The consistent labeling problem, part I. IEEE Trans. PAMI-1, 173–184 (1979)MATHCrossRefGoogle Scholar
  35. 5.35
    S.L. Tanimoto: “An Iconic/Symbolic Data Structuring Scheme”, in Ref. 1.15, pp. 452–471Google Scholar
  36. 5.36
    L.G. Shapiro, R.J. Baron: ESP—a language for pattern description and a system for pattern recognition. IEEE Trans. SE-3, 169–183 (1977)Google Scholar
  37. 5.37
    L.G. Shapiro, R.M. Haralick: “A General Spatial Data Structure”, Proc. Conf. on Pattern Recognition and Image Proc, Chicago 1978, pp. 238–249Google Scholar
  38. 5.38
    T.L. Kunii, S. Weyl, J.M. Tenenbaum: “A Relational Data Base Schema for Describing Complex Pictures with Color and Texture”, Proc 2nd Int. Joint Conf. on Pattern Recognition, Copenhagen, Denmark 1974, pp. 310–316Google Scholar
  39. 5.39
    M. Sties, B. Sanyal, K. Leist: “Organization of Object Data for an Image Information System”, Proc. 3rd Int. Joint Conf. on Pattern Recognition, Coronado, CA 1976, pp. 863–869Google Scholar
  40. 5.40
    D.M. McKeown, D.R. Reddy: “A Hierarchical Symbolic Representation for an Image Database”, Proc Workshop on Picture Data Description and Management, Chicago 1977, pp. 40–44Google Scholar
  41. 5.41
    Y. Yakimovski, R. Cunningham: “DABI—a Data Base for Image Analysis with Nondeterministic Inference Capability”, in Ref.1.15, pp. 554–592Google Scholar
  42. 5.42
    S.K. Chang, K.S. Fu (eds.): Pictorial Information Systems, Lecture Notes in Computer Science, Vol.80 (Springer, Berlin, Heidelberg, New York 1980)Google Scholar
  43. 5.43
    R.D. Fennell, V.R. Lesser: Parallelism in artificial intelligence problem solving, a case study of HEARSAY II. IEEE Trans. C-26, 98–111 (1977)MATHCrossRefGoogle Scholar
  44. 5.44
    R.D. Fennel!: “Multiprocess Software Architecture for AI Problem Solving”; PhD Thesis, Comp. Science Dept., Carnegie-Mellon Univ. (Pittsburgh, PA 1975)Google Scholar
  45. 5.45
    R.H. Bonczek, N. Ghiaseddin, A.B. Whinston: “Storage and Processing of Picture Data in an Information Base”, Proc. 4th Int. Joint Conf. on Pattern Recognition, Kyoto, Jpn. 1978, pp. 1090–1095Google Scholar
  46. 5.46
    R.H. Bonczek, A.B. Whinston: Picture processing and automatic data base design. Comput. Graph. Image Proc. 5, 484–495 (1975)CrossRefGoogle Scholar
  47. 5.47
    M. Hammer, A. Chan: “Acquisition and Utilisation of Access Patterns in Relational Data Base Implementation”, in Ref.1.15, pp. 292–313Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Heinrich Niemann
    • 1
  1. 1.Lehrstuhl für Informatik 5 (Mustererkennung)Universität Erlangen-NürnbergErlangenFed. Rep. of Germany

Personalised recommendations