Query Processing and Optimization for Pictorial Query Trees

Authors:
Aya Soffer;Hanan Samet
Affiliations:
-;-
Venue:
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Year:
1999

Citing 5
Cited 0

Iconic indexing by 2-D strings

IEEE Transactions on Pattern Analysis and Machine Intelligence
A pictorial index mechanism for model-based matching

Data & Knowledge Engineering
VisualSEEk: a fully automated content-based image query system

MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Pictorial Queries by Image Similarity

ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume III-Volume 7276 - Volume 7276
Pictorial Query Trees for Query Specification in Image Databases

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Methods for processingo f pictorial queries specified by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries while internal nodes correspond to logical operations on them. Algorithms for processing individual pictorial queries and for parsing and computingt he overall result of a pictorial query tree are presented. Issues involved in optimizingq uery processing of pictorial query trees are outlined and some initial solutions are suggested.