Sciweavers

17 search results - page 1 / 4
» Time split linear quadtree for indexing image databases
Sort
View
ICIP
2001
IEEE
14 years 6 months ago
Time split linear quadtree for indexing image databases
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
ADBIS
2000
Springer
117views Database» more  ADBIS 2000»
13 years 8 months ago
Multiversion Linear Quadtree for Spatio-Temporal Data
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present th...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
ICIP
1999
IEEE
14 years 6 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
MM
1994
ACM
143views Multimedia» more  MM 1994»
13 years 9 months ago
Quad-Tree Segmentation for Texture-Based Image Query
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
Jonathan M. Smith, Shih-Fu Chang
GIS
2006
ACM
14 years 5 months ago
Efficient position-independent iconic search using an R-theta index
An iconic image database is a collection of symbolic images where each image is a collection of labeled point features called icons. A method is presented to support fast position...
Charles Ben Cranston, Hanan Samet