Iconic indexing by 2-D strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Tri-cell—a data structure for spatial objects
Information Systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
2D C-string: a new spatial knowledge representation for image database systems
Pattern Recognition
Design and evaluation of algorithms for image retrieval by spatial similarity
ACM Transactions on Information Systems (TOIS)
MARCO: MAp Retrieval by COntent
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Spatial Join Processing Using Corner Transformation
IEEE Transactions on Knowledge and Data Engineering
Reasoning About Spatial Relationships in Picture Retrieval Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Similarity of Cardinal Directions
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Techniques for Design and Implementation of Efficient Spatial Access Methods
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Joining interval data in relational databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Fast retrieval of similar configurations
IEEE Transactions on Multimedia
Indexing planar point quartets via geometric attributes
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Hi-index | 0.00 |
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.