Issue No. 02 - April (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.386114
<p><it>Abstract</it>—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 [<ref rid="BIBK03472" type="bib">2</ref>], up to a special case. Moreover, we show that the compactness of the new index does not affect the time complexity of picture retrieval.</p>
Image database systems, symbolic picture representation, iconic indexing, data structure.
F. Ferrucci, M. Tucci, G. Tortora and G. Costagliola, "Non-Redundant 2D Strings," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 347-350, 1995.