DocumentCode :
2182331
Title :
Mathematical modeling of image database complexity
Author :
Rao, Akhila ; Srihari ; Zhu, Lei ; Zhang, Aidong
Author_Institution :
CEDAR, State Univ. of New York, Buffalo, NY, USA
fYear :
2000
fDate :
2000
Firstpage :
106
Lastpage :
110
Abstract :
The performance of a content based image retrieval system strongly depends on its testbed. A theoretical framework is proposed for modeling image database complexity. The goal is to investigate the relationship between a given indexing technique and a given image database. As an analogy to the concept of perplexity of a text corpus, the complexity of an image database is introduced. This is a quantitative measure of the quality of an image database for the task of content access to the database. The complexity of an image database is an intrinsic property of the database and can be used to distinguish the difficulty of image retrieval on different databases. On the other hand, the measure can be used to compare the effectiveness of different indexing techniques
Keywords :
computational complexity; content-based retrieval; database indexing; database theory; visual databases; content access; content based image retrieval system; image database complexity; indexing technique; indexing techniques; mathematical modeling; quantitative measure; text corpus; Image databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Content-based Access of Image and Video Libraries, 2000. Proceedings. IEEE Workshop on
Conference_Location :
Hilton Head Island, SC
Print_ISBN :
0-7695-0695-X
Type :
conf
DOI :
10.1109/IVL.2000.853849
Filename :
853849
Link To Document :
بازگشت