DocumentCode :
781170
Title :
Non-redundant 2D strings
Author :
Costagliola, Gennaro ; Ferrucci, Filomena ; Tortora, Genoveffa ; Tucci, Maurizio
Author_Institution :
Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy
Volume :
7
Issue :
2
fYear :
1995
fDate :
4/1/1995 12:00:00 AM
Firstpage :
347
Lastpage :
350
Abstract :
Introduces 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, up to a special case. Moreover, we show that the compactness of the new index does not affect the time complexity of picture retrieval
Keywords :
computational complexity; database theory; graphical user interfaces; indexing; information retrieval; spatial data structures; visual databases; compactness; data structure; iconic indexing; image database systems; nonambiguity; nonredundant 2D string representation; picture retrieval; reduced 2D string; symbolic picture representation; time complexity; unambiguous pictures; Application software; Data structures; Database systems; Image databases; Image reconstruction; Image retrieval; Indexing; Information retrieval; Medical robotics; Office automation;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/69.386114
Filename :
386114
Link To Document :
بازگشت