Abstract
In this paper we propose and analyze a new spatial access method, namely the S*-tree, for the efficient secondary memory encoding and manipulation of images containing multiple non-overlapping features (i.e., coloured images). We show that the S*-tree is more space efficient than its precursor, namely the S+-tree, which was explicitly designed for binary images, and whose straightforward extension to coloured images can lead to large space wastage. Moreover, we tested time efficiency of the S*-tree in answering classical window queries, comparing it against a previous efficient access method, namely the HL-quadtree [7]. Our experiments show that the S*-tree can reach up to a 30% of time saving.
Abstract
This research was partially supported by the CHOROCHRONOS TMR Program of the European Community.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W.G. Aref and H. Samet. A B+-tree structure for large quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19–31, July 1984.
W.G. Aref and H. Samet. Efficient processing of window queries in the pyramid data In Proc. of the 9th ACM-SIGMOD Symposium on Principles of Database Systems, pages 265–272, Nashville, TN, 1990.
W. de Jonge, P. Scheuermann, and A. Schijf. S+-trees: an efficient structure for the representation of large pictures. Computer Vision, Graphics and Image Processing: Image Understanding, 59(3):265–280, May 1994.
C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos. Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles. IEEE Transactions on Knowledge and Data Engineering, 9(3):373–383, 1997.
I. Gargantini. An effective way to represent quadtrees. IEEE Trans. on Pattern Analysis and Machine Intelligence, 25(12):905–910, 1982.
E. Kawaguchi, T. Endo, and M. Yokota. Depth-first expression viewed from digital picture processing. IEEE Trans. on Pattern Analysis and Machine Intelligence, pages 373–384, July 1983.
E. Nardelli and G. Proietti. Time and space efficient secondary memory representation of quadtrees. Information Systems, 22(1):25–37, 1997.
G. Proietti. An optimal algorithm for decomposing a window into maximal quadtree blocks. Acta Informatica, 1999. To appear.
H. Samet. The quadtree and related hierarchical data structures. Computing Surveys, 16(2):187–260, June 1984.
H. Samet and R.E. Webber. A comparison of the space requirements of multi-dimensional quadtree-based file structures. Visual Computer, 5(6):349–359, December 1989.
C.A. Shaffer and P.R. Brown. A paging scheme for pointer-based quadtrees. In D. Abel and B.C. Ooi, editors, Advances in Spatial Databases, pages 89–104. Lecture Notes in Computer Science 692, Springer Verlag, 1993.
M. Tamminen. Encoding pixel trees. Computer Vision, Graphics and Image Processing, 2:174–196, 1984.
M. Vassilakopoulos and Y. Manolopoulos. Analytical comparison of two spatial data structures. Information Systems, 19(7):269–282, 1994.
M. Vassilakopoulos, Y. Manolopoulos, and K. Economou. Overlapping quadtrees for the representation of similar images. Image and Vision Computing, 11(5):257–262, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nardelli, E., Proietti, G. (1999). S*-Tree: An Improved S+-Tree for Coloured Images. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-48252-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66485-7
Online ISBN: 978-3-540-48252-9
eBook Packages: Springer Book Archive