收录:
摘要:
Content-based image retrieval represents images as N-dimensional feature vectors. Similar image retrieval is computed over these high dimensional feature vectors. A sequential scan of the feature vectors for a query method is costly for a large number of images when N is high. The search time and search space can be reduced through indexing the data. In this paper we proposed a hierarchical clustering tree for building indices of the image database. Experiment shows that the hierarchical tree has the attribute of quick response time when retrieve image based on the query and also provide a convenient structure for users to browse the database. ©2009 IEEE.
关键词:
通讯作者信息:
电子邮件地址:
来源 :
年份: 2009
语种: 英文
归属院系: