Iconic indexing by 2-D strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
2D C-string: a new spatial knowledge representation for image database systems
Pattern Recognition
Retrieval of similar pictures on pictorial databases
Pattern Recognition
A robust framework for content-based retrieval by spatial similarity in image databases
ACM Transactions on Information Systems (TOIS)
A generalized prime-number-based matrix strategy for efficient iconic indexing of symbolic pictures
Pattern Recognition Letters
ImageMap: An Image Indexing Method Based on Spatial Similarity
IEEE Transactions on Knowledge and Data Engineering
An Intelligent Image Database System
IEEE Transactions on Software Engineering
Managing the Complexity of Match in Retrieval by Spatial Arrangement
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Direction as a spatial object: a summary of results
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
2D Z-string: a new spatial knowledge representation for image databases
Pattern Recognition Letters
Pattern Recognition Letters
An efficient iconic indexing strategy for image rotation and reflection in image databases
Journal of Systems and Software
Similarity retrieval of videos by using 3D C-string knowledge representation
Journal of Visual Communication and Image Representation
A review on automatic image annotation techniques
Pattern Recognition
Hi-index | 0.10 |
In this paper, we propose an efficient iconic indexing strategy called bit-pattern-based matrix (BP matrix) for symbolic pictures, in which each spatial relationship between any two objects along the x-axis (or y-axis) is represented as a binary-bit pattern, and is recorded in a matrix. There are 12 bits in each bit pattern. When the bits in a certain subset of those 12 bits are set to 1, they denote a certain spatial relationship. Bit-wise-and/bit-wise-or operations are used for query processing; therefore, they are efficient enough as compared to the previous approaches. From our simulation, we show that the proposed BP matrix strategy requires shorter time for query processing than the generalized prime-number-based matrix strategy.