Skip to main content
SpringerLink
Log in

Hierarchical data structures for picture storage, retrieval and classification

  • Chapter
  • First Online:
Pictorial Information Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 80))

Abstract

This chapter discusses several approaches to tackle the problem of efficiently storing and accessing a large set of pictorial data for analysis and classification. The main idea behind these approaches deals with the use of hierarchical data structures that allow different levels of picture details to be stored and analyzed. By using this hierarchy, searching and classification of pictorial data can be much faster compared with conventional, sequential storage.

Two major hierarchical structures and their applications are presented. The first is applicable to situations where pictorial data have been transformed into multidimensional vectors. A hierarchical projection tree, which combines hierarchical clustering algorithms with one dimensional projection, provides an efficient means for storing and accessing these vectors. This data structure is especially useful for nearest neighbor search or classification. The second data structure discussed in this paper attempts to construct a hierarchy of pictorial data by utilizing their global characteristics, eliminating the need to extract feature vectors. A preliminary implementation and evaluation of this approach, based upon gray level histograms as a similarity measure, is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bentley, J. L., Multidimensional Binary Search Trees Used for Searching, Comm ACM, Vol. 18, No. 9, pp. 509–517, September 1975.

    Google Scholar 

  2. Boulton, D. and Wallace, C., An Information Measure for Hierarchic Classification, The Computer Journal, Vol. 16, No. 3, 1973, p. 254.

    Google Scholar 

  3. Cover, T. and Hart, P., Nearest Neighbor Pattern Classification, IEEE Trans. on Information Theory, Vol. IT-13, No. 1, January 1967, p. 21.

    Google Scholar 

  4. Duda, R. and Fossum, H., Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions, IEEE Trans. Elect. Comp., Vol. EC 15, No. 2, April 1966, p. 220.

    Google Scholar 

  5. Duda, R. and Hart, P., Pattern Classification and Scene Analysis, Wiley-Interscience, 1973.

    Google Scholar 

  6. Dudani, S., The Distance Weighted Nearest Neighbor Rule, IEEE Trans. Systems, Man, and Cybernetics, April 1976, p. 256.

    Google Scholar 

  7. Fisher, R.A., The Use of Multiple Measurements in Taxonomic Problems, Ann. Eugen., Vol. 7, September 1936, p. 179.

    Google Scholar 

  8. Foley, D. H. and Sammon, J. W., An Optimal Set of Discriminant Vectors, IEEE Trans. Comp., Vol. vc-24, No. 3, March 1973, p. 281.

    Google Scholar 

  9. Friedman, J. H. Baskett, F., and Shustek, L., An Algorithm for Finding Nearest Neighbors, IEEE Trans. Comp., Vol. 24, No. 10, October 1975, p. 1000.

    Google Scholar 

  10. Fukunaga, K. and Narendra, P. M., A Branch and Bound Algorithm for Computing k-Nearest Neighbors, IEEE Trans. Comp. Vol. C-24, No. 7, July 1975, p. 750.

    Google Scholar 

  11. Haralick, R. M. and Dinstein, I., An Iterative Clustering Procedure, IEEE Trans. Systems, Man, and Cybernetics, Vol. SMC-1, No. 3, July 1971, p. 275.

    Google Scholar 

  12. Hart, P.E., The Condensed Nearest Neighbor Rule, IEEE Trans. Info. Theory, May 1968, p. 515.

    Google Scholar 

  13. Johnson, S.C., Hierarchical Clustering Schemes, Psychometrika, Vol. 32, No. 3, September 1967, p. 241.

    PubMed  Google Scholar 

  14. Kashyap, R. L., Subas, S. K. C. and Yao, S. B., Analysis of multiple-attribute-tree data-base organization, IEEE Trans. Software Engineering, Vol. SE-3, 6, Nov. 1973, p. 451.

    Google Scholar 

  15. Sammon, J. W., An Optimal Discriminant Plane, IEEE Trans. Comp., Sept. 1970 p. 826.

    Google Scholar 

  16. Slagle, J. R., Chang, C. L. and Heller, S. R., A Clustering and Data Reorganizing Algorithm, IEEE Trans, SMC-6, June 1976, p. 448.

    Google Scholar 

  17. Tomek, I., An Experiment With the Edited Nearest Neighbor Rule, IEEE Trans. SMC-6, June 1976, p. 448.

    Google Scholar 

  18. Yunch, T. P., A Technique to Identify Nearest Neighbors, IEEE Trans. SMC, Vol. SMC-6, No. 10, October 1976, p. 678.

    Google Scholar 

  19. Zahn, C. T., Graph Theoretical Methods for Detecting and Describing Gestalt Clusters, IEEE Trans. Computer, Vol. C-20, No. 1, January 1971, pp. 68–86.

    Google Scholar 

  20. Hlynka, A., and Chien, Y. T., The Hierarchical Projection Tree as a Data Structure for Pattern Recognition, University of Connecticut, Department of EECS, Tech. Report 78-5, 1978.

    Google Scholar 

  21. Proceedings of the Workshop on Picture Data Description and Management, 1977.

    Google Scholar 

  22. Third International Joint Conference on Pattern Recognition.

    Google Scholar 

  23. Donato, N., McCormick, B. H., Reuss, J., and Rochetti, R., "A Relational Database System for Pictures," [1], p. 142

    Google Scholar 

  24. Haralick, R. M., Shanmugam, K., And Dinstein, I., "Textural Features for Image Classification," IEEE Trans. SMC, Vol. 3, No. 6, November 1973, p. 610.

    Google Scholar 

  25. Leboucher, G., and Lowitz, G. E., "What Can a Histogram Really Tell the Classifier," [22], p. 689.

    Google Scholar 

  26. Lee, E. T., "Similarity Directed Picture Storage and Management," [21], p. 150.

    Google Scholar 

  27. Lien, Y. E. and Utter, D. F. Jr., "Design of an Image Database," [21], p. 131.

    Google Scholar 

  28. McKeown, D. M., Jr., and Reddy, D. R., "A Hierarchical Symbolic Representation for an Image Database," [21], p. 40.

    Google Scholar 

  29. Nagao, M., Tanabe, H., Ito, K., "Agricultural Land Use Classification of Aerial Photographs by Histogram Similary Method," [22], p. 689.

    Google Scholar 

  30. Stieg, M., Sanyal, B., Leist, K., "Organization of Object Data for an Image Classification System," [22], p. 863.

    Google Scholar 

  31. Tamura, H., Mori, S., "A Data Management System for Manipulating Large Images," [21], p. 45.

    Google Scholar 

  32. Tanimoto, S., Pavlidis, T., "A Hierarchical Data Structure for Picture Processing," Comp. Graphics and Image Processing, Vol. 4, p. 104–119, 1975.

    Google Scholar 

  33. Zobrist, A. L., "Elements of an Image-Based Information System," [21], p. 45.

    Google Scholar 

  34. Hlynka, A. and Y. T. Chien, "The Hierarchical Projection Tree as a Data Structure for Pattern Recognition," CS Tech. Rept. 78-5, Univ. of Connecticut, 1978.

    Google Scholar 

  35. Ward, M. and Y. T. Chien, "A Similarity Directed Pictorial Database System Which Uses Histogram Classification as a Similarity Measure," CS Tech. Rept. 79-10, University of Connecticut, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of EECS, Univ. of Connecticut, 06268, Storrs, CT

    Y. T. Chien

Authors
  1. Y. T. Chien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. K. Chang K. S. Fu

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chien, Y.T. (1980). Hierarchical data structures for picture storage, retrieval and classification. In: Chang, S.K., Fu, K.S. (eds) Pictorial Information Systems. Lecture Notes in Computer Science, vol 80. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09757-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-09757-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09757-0

  • Online ISBN: 978-3-540-38634-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation