Navigating through a forest of quad trees to spot images in a database

Authors:
H. G.P. Bosch;Niels Nes;Martin L. Kersten
Affiliations:
-;-;-
Venue:
Navigating through a forest of quad trees to spot images in a database
Year:
2000

Citing 0
Cited 2

Macro- and Micro-parallelism in a DBMS

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Partial servicing of on-line jobs

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes how we maintain color and spatial index information on more than 1,000,000 images and how we allow users to browse the spatial color feature space. We break down all our images in color-based quad trees and we store all quad trees in our main-memory database. We allow users to browse the quad trees directly, or they can pre-select images through our color bit vector, which acts as an index accelerator. A Java based \textsc{gui} is used to navigate through our image indexes.