@conference {18454,
	title = {Pictorial query trees for query specification in image databases},
	booktitle = {Fourteenth International Conference on Pattern Recognition, 1998. Proceedings},
	volume = {1},
	year = {1998},
	month = {1998/08//},
	pages = {919-921 vol.1 - 919-921 vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A technique that enables specifying complex queries in image databases using pictorial query trees is presented. The leaves of a pictorial query tree correspond to individual pictorial queries that specify which objects should appear in the target images as well as how many occurrences of each object are required. In addition, the minimum required certainty of matching between query-image objects and database-image objects, as well as spatial constraints that specify bounds on the distance between objects and the relative direction between them are also specified. Internal nodes in the query tree represent logical operations (AND, OR, XOR) and their negations on the set of pictorial queries (or subtrees) represented by its children. The syntax of query trees is described. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are outlined},
	keywords = {Automation, complex queries, Computer science, content-based retrieval, Database systems, database-image objects, Educational institutions, Electrical capacitance tomography, grammars, Image databases, Image matching, parsing, pictorial query trees, Postal services, query specification, query-image objects, spatial constraints, syntax, visual databases},
	isbn = {0-8186-8512-3},
	doi = {10.1109/ICPR.1998.711383},
	author = {Soffer,A. and Samet, Hanan and Zotkin,Dmitry N}
}
