Advertisement

The Design of an Efficient Data Structure for Manipulating Data in an Image DataBase System

  • A. Touir
Conference paper

Abstract

This paper reports the design of the Inverted Quadtree, a dynamic index structure for image database. The set of the inserted images are stored in a way that permits to perform content-oriented retrieval. The content search manipulates directly the bitmap representation of the image, so this structure support the pattern searching. Thus, we consider the problem to resolve as a fuzzy search of pattern in an image database. We specially describe the behavior of the proposed structure for this kind of manipulation. We analyze the distribution of the data in the base, and some operations of manipulation. We suggest a parallel processing to execute a fuzzy search.

Keywords

Image Database Correspondent Node Nonterminal Node Quad Tree Efficient Data Structure 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C.H. Ang, H. Samet, “Node Distribution in a PR Quadtree”, In Proceedings 1st International Symposium on Large Spatial Databases, Santa Barbara, USA, July 1989.Google Scholar
  2. [2]
    S.K. Chang, C.W. Yan, T. Amdt, D. Dimitroff, “An Intelligent Image Database System”, IEEE Transactions on Software Engineering, Vol.14, N°5, 1988.Google Scholar
  3. [3]
    S.K. Chang, E. Jungert, Y. LI, “ The Design of Pictorial Database Based Upon the Theory of Symbolic Projections”, In Proceedings 1st International Symposium on Large Spatial Databases, Santa Barbara, USA, July 1989.Google Scholar
  4. [4]
    J.P. Cheiney, B. Kerhervé: “Image Data Storage and Manipulations for Multimedia Database Systems”, In Proceedings 4th International Conference on Spatial Data Handling, Zurich, Switzerland, July 1990.Google Scholar
  5. [5]
    C.H. Chien, T. Kanade: “Distributed Quadtree Processing”, In Proceedings 1st International Symposium on Large Spatial Databases,Santa Barbara, USA, July 1989.Google Scholar
  6. [6]
    D. Comer, “The Ubiquitous B-tree”, In ACM Computing Surveys, Vol.11, N°2, 1979.Google Scholar
  7. [7]
    I. Gargantini: “An Efficient Way to Represent Quadtrees”, In Communications of the ACM, Vol.25, N° 12, 1982.Google Scholar
  8. [8]
    T. Joseph, A. F. Cardenas, “ PICQUERY: A High Level Query Language for Pictorial Database Management”, IEEE Transactions on Software Engineering, Vol.14, N°5, 1988.Google Scholar
  9. [9]
    K. Meyer, V.Y. Lum, C.T. Wu:“Image Management in Multimedia Database System”, In Proceedings IFIP TC 2/WG 2.6 Working Conference on Visual Database Systems, Tokyo, Japan, April 1989.Google Scholar
  10. [10]
    G. Kedem, “The Quadtree-CIF tree: a Data Structure for Hierarchical on-line algorithms”, In Proceedings 19h Design Automation Conference, Las Vegas, USA, June 1983.Google Scholar
  11. [11]
    G.M. Morton, “ A Computer Oriented Geodetic Database and a New Technique in File Sequencing” IBM Ltd., Ottawa, Canada, 1966.Google Scholar
  12. [12]
    J. A. Orenstein, T.H. Merrett, “A Class of Data Structure for Associative Searching”,,In Proceedings 3rd ACM SIGACTSIGMOD Symposium of Principles of DataBase Systems, 1984Google Scholar
  13. [13]
    J. A. Orenstein, F. A. Manola, “PROBE Spatial Data Modeling and Query Processing in an Image DataBase Application”, IEEE Transactions on Software Engineering, Vol.14, N°5, 1988.Google Scholar
  14. [14]
    N. Roussopoulos, C. Faloutsos, T Sellis, “An Efficient Pictorial DataBase System for PSQL”, IEEE Transactions on Software Engineering, Vol.14, N°5, 1988.Google Scholar
  15. [15]
    H.Samet, “The Quadtree and Related Hierarchical Data Structures”,In ACM Computing Surveys, Vol.16, N°2, 1984.Google Scholar
  16. [16]
    H. Samet: “Applications of Spatial Data Structures”, Addison-Wesley, 1990.Google Scholar
  17. [17]
    H. Samet: “The Design and Analysis of Spatial Data Structures”, Addison-Wesley, 1990.Google Scholar
  18. [18]
    C.A. Shaffer, H. Samet, “Optimal Quadtree Construction Algorithms”, In Computer Vision, Graphics and Image Processing, Vol 37,N°3, 1987.Google Scholar
  19. [19]
    H.Tamoura, N.Yokoya: “Image Database System: A Survey”, In Pattern Recognition, Vol.17, N°1, 1984.Google Scholar
  20. [20]
    A. Touir, B. Kerhervé: “Shape Translation in Images Encoded by Linear Quadtree”, In Proceedings IFIP TC 5. 10 Working Conference on Modeling in Computer Graphics, Tokyo, Japan April 1991.Google Scholar
  21. [21]
    A. Touir: “Search Algorithms in Image Databases”,Internal Report ENST/INFBD/90_10Google Scholar
  22. [22]
    T.R. Walsh: “Efficient Axis-Translation of Binary Digital Pictures by Blocks by Linear Quadtree Representation” Computer Vision, Graphics and Images Processing Vol.41, N°3, 1988.Google Scholar
  23. [23]
    D. Woelk, W. Kim, W. Luther, “An Oriented Approach to Multimedia Databases”,In Proceedings ACM SIGMOD’86 International Conference on Management of Data, Washington, USA, May 1986.Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • A. Touir
    • 1
  1. 1.Ecole Nationale Supérieure des TélécommunicationsParisFrance

Personalised recommendations