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
Picture algebra for spatial reasoning of iconic images represented in 2D C-string
Pattern Recognition Letters
A spatial knowledge structure for image information systems using symbolic projections
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A generalized prime-number-based matrix strategy for efficient iconic indexing of symbolic pictures
Pattern Recognition Letters
Virtual Images for Similarity Retrieval in Image Databases
IEEE Transactions on Knowledge and Data Engineering
A bit-pattern-based matrix strategy for efficient iconic indexing of symbolic pictures
Pattern Recognition Letters
Extended Symbolic Projections as a Knowledge Structure for Spatial Reasoning
Proceedings of the 4th International Conference on Pattern Recognition
Pattern Recognition Letters
An efficient iconic indexing strategy for image rotation and reflection in image databases
Journal of Systems and Software
Journal of Visual Languages and Computing
A new relevance feedback technique for iconic image retrieval based on spatial relationships
Journal of Systems and Software
Similarity retrieval of videos by using 3D C-string knowledge representation
Journal of Visual Communication and Image Representation
SVARS: symbolic video archival and retrieval system
Proceedings of the Third Annual ACM Bangalore Conference
Multiple-instance image database retrieval by spatial similarity based on Interval Neighbor Group
Proceedings of the ACM International Conference on Image and Video Retrieval
The similarity of video based on the association graph construction of video objects
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
A review on automatic image annotation techniques
Pattern Recognition
Hi-index | 0.10 |
The knowledge structure called the 2D C+-string, proposed by Huang et al., to represent symbolic pictures allows a natural way to construct iconic indexes for images. According to the cutting mechanism of the 2D C+-string, an object may be partitioned into several subparts The number of partitioned subparts is bounded to O(n2), where n is the number of objects in the image. Hence, the string length is also bounded to O(n2). In this paper, we propose a new spatial knowledge representation called the 2D Z-string. Since there are no cuttings between objects in the 2D Z-string, the integrity of objects is preserved and the string length is bounded to O(n). Finally, some experiments are conducted to compare the performance of both approaches.