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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. Kunii, S. Weyl, and J. M. Tenebaum, “A relational database scheme for describing complex pictures with color and texture,” in Proc. 2nd Int. Joint Conf. on Pattern Recognition, 1974.
D. McKeown and D. Raj Reddy, “A hierarchical symbolic representation for an image database,” in Proc. Picture Data Description and Management Workshop, 40–44, 1977.
H. Tamura and S. Mori, “A data management system for manipulating large images,” in Proc. Picture Data Description and Management Workshop, 45–54, 1977.
A. L. Zobrist, “Elements of an image-based information system,” Proc. Workshop Picture Data Description and Management, Chicago, Il, 55–60, April 1977.
G. Nagy and S. Wagle, “Geographic data processing,” Computing Surveys, 11, 139–181, 1979.
K. S. Fu, “Introduction to syntactic pattern recognition,” in Syntactic Pattern Recognition Applications, (ed. D.S. Fu), Springer-Verlag, Berlin, 1977, 1–31.
T. Pavlidis, Structural Pattern Recognition, Springer-Verlag, Berlin, 1978.
M. R. Anderberg, Cluster Analysis for Applications, Academic Press, NY, 1973.
R. Duda and P. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1972.
K. S. Fu and S. Y. Lu, “Size normalization and pattern organization in syntactic clustering,” IEEET-Systems, Man and Cybernetics, 9, 55–58, 1979.
L. Davis and N. Roussopoulos, “Approximate pattern matching in a pattern database system,” Inf. Systems, 5, 2, 1980.
L. Davis and T. Shepard, “Syntactic identification of partial information in pattern databases,” in preparation.
A. Hanson and E. Riseman, “VISIONS: A computer system for interpreting scences,” in Computer Visions Systems (A. Hanson and E. Riseman, eds.) Academic Press, NY, 1978.
M. Kelley, “Edge detection in pictures by computer using planning,” Machine Intelligence, 6, 379–409, 1971.
A. Klinger and C. Dyer, “Experiments in picture representation using regular decomposition,” Computer Graphics and Image Processing, 5, 68–105, 1976.
S. Tanimoto and T. Pavlidis, “A hierarchical data structure for picture processing,” ibid, 4, 104–119, 1975.
A. Nakamura and C. Dyer, “Bottom-up cellular pyramids for image analysis,” in Proc 4th Int. Joint Conf. on Pattern Recognition, Kyoto, Japan, 494–496, 1978.
G. Hunter, “Efficient computation and data structures for graphics,” Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, 1978.
L. Davis and T. Henderson, “Hierarchical Constraint Processes for Shape Analysis,” to appear in IEEET-Pattern Analysis and Machine Intelligence.
D. Knuth, J. H. Morris Jr, and V. R. Pratt, “Fast pattern matching in strings,” SIAM J. Computing, 6, 323–350, 1977.
L. Davis, N. Roussopoulos and M. Wan, “Quad Tree Database Organizations for Chinese Characters,” in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davis, L.S., Kunii, T.L. (1982). Pattern databases. In: Yao, S.B., Kunii, T.L. (eds) Data Base Design Techniques II:. DBDT 1979. Lecture Notes in Computer Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11215-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-11215-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11215-0
Online ISBN: 978-3-540-39054-1
eBook Packages: Springer Book Archive