@conference {16876,
	title = {Efficient position-independent iconic search using an R-theta index},
	booktitle = {Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems},
	series = {GIS {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {27 - 34},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {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-independent similarity search in an iconic database for symbolic images where the similarity condition involves finding icon pairs that satisfy a specific spatial relationship. This is achieved by introducing an index data structure based on r-θ space, which corresponds to the Cartesian product of separation (i.e., inter-icon distance) and (some representation of) relative spatial orientation. In this space, each pairing of two icons is represented by a single point, and all pairs with the same separation and relative orientation (regardless of absolute position) map to the same point. Similarly, all icon pairs with the same separation but different relative orientations map to points on a line parallel to the θ axis, while all pairs with different separations but the same relative orientation map to points on a line parallel to the r axis. Using such an index, database search for icon pairs with a given spatial relationship or range is accomplished by examining the subarea of the index space into which desired pairs would map. This r-θ index space can be organized using well-known spatial database techniques, such as quadtrees or R-trees. Although the size of such an index grows only linearly with respect to the number of images in the collection, it grows quadratically with the average number of icons in an image. A scheme is described to reduce the size of the index by pruning away a subset of the pairs, at the cost of incurring additional work when searching the database. This pruning is governed by a parameter φ, whose variation provides a continuous range of trade-offs between index size and search time.},
	keywords = {iconic database, position-independent, spatial indexing},
	isbn = {1-59593-529-0},
	doi = {10.1145/1183471.1183478},
	url = {http://doi.acm.org/10.1145/1183471.1183478},
	author = {Cranston,Charles B. and Samet, Hanan}
}
