Iconic indexing by 2-D strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity retrieval of iconic image database
Pattern Recognition
Pyramidal algorithms for iconic indexing
Computer Vision, Graphics, and Image Processing
An image algebra for pictorial data manipulation
CVGIP: Image Understanding
The reconstruction of binary patterns from their projections
Communications of the ACM
A Unifying Approach to Iconic Indexing for 2-D and 3-D Scenes
IEEE Transactions on Knowledge and Data Engineering
An Intelligent Image Database System
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In the present paper, we introduce a variation of the 2D string representation for symbolic pictures, the non-redundant 2D string, and analyze it with respect to compactness and non ambiguity. It results that the non-redundant 2D string is a more compact representation than the 2D string, and that the class of unambiguous pictures under the non-redundant 2D string is almost equal to the class of unambiguous pictures under the reduced 2D string [2], up to a special case. Moreover, we show that the compactness of the new index does not affect the time complexity of picture retrieval.