Iconic indexing by 2-D strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity retrieval of iconic image database
Pattern Recognition
2D C-string: a new spatial knowledge representation for image database systems
Pattern Recognition
Picture algebra for spatial reasoning of iconic images represented in 2D C-string
Pattern Recognition Letters
Retrieving the most similar symbolic pictures from pictorial databases
Information Processing and Management: an International Journal
Application of geometric hashing to iconic database retrieval
Pattern Recognition Letters
An exact match retrieval scheme based upon principal component analysis
Pattern Recognition Letters
A spatial data representation: an adaptive 2D-H string
Pattern Recognition Letters
Retrieving similar pictures from a pictorial database by an improved hashing table
Pattern Recognition Letters
A note on adaptive 2D-H strings
Pattern Recognition Letters
Image retrieval based on object's orientation spatial relationship
Pattern Recognition Letters - Special issue on image/video indexing and retrieval
Pattern Recognition Letters
Journal of Visual Languages and Computing
Multiple-instance image database retrieval by spatial similarity based on Interval Neighbor Group
Proceedings of the ACM International Conference on Image and Video Retrieval
Hi-index | 0.10 |
In this paper, a novel method of representing symbolic images in a symbolic image database (SID) invariant to image transformations, useful for exact match retrieval is presented. The proposed model is based on Triangular Spatial Relationship (TSR) [Guru, D.S., Nagabhushan, P., 2001. Triangular spatial relationship: A new approach for spatial knowledge representation, Pattern Recognition Lett. 22, 999-1006]. The proposed model preserves TSR among the components in a symbolic image by the use of quadruples. A distinct and unique key called TSR key is computed for each distinct quadruple. The mean and standard deviation of the set of TSR keys computed for a symbolic image are stored along with the total number of TSR keys as the representatives of the symbolic image. An exact match retrieval scheme based on the modified binary search technique [Guru, D.S., Raghavendra, H.J., Suraj, M.G., 2000. An adaptive binary search based sorting by insertion: An efficient and simple algorithm, Statist. Appl., 2, 85-96] is also presented in this paper. The presented retrieval scheme requires O(logn) search time in the worst case, where n is the total number of symbolic images in the SID. An extensive experimentation on a large database of 13,680 symbolic images is conducted to corroborate the superiority of the model.