Automatic image annotation and retrieval using subspace clustering algorithm

Lei Wang, Li Liu, L. Khan
{"title":"Automatic image annotation and retrieval using subspace clustering algorithm","authors":"Lei Wang, Li Liu, L. Khan","doi":"10.1145/1032604.1032621","DOIUrl":null,"url":null,"abstract":"The development of technology generates huge amounts of non-textual information, such as images. An efficient image annotation and retrieval system is highly desired. Clustering algorithms make it possible to represent visual features of images with finite symbols. Based on this, many statistical models, which analyze correspondence between visual features and words and discover hidden semantics, have been published. These models improve the annotation and retrieval of large image databases. However, image data usually have a large number of dimensions. Traditional clustering algorithms assign equal weights to these dimensions, and become confounded in the process of dealing with these dimensions. In this paper, we propose a top-down, subspace clustering algorithm as a solution to this problem. For a given cluster, we determine relevant features based on histogram analysis and assign greater weight to relevant features as compared to less relevant features. We have implemented four different models to link visual tokens with keywords based on the clustering results of our clustering algorithm and K-means algorithm, and evaluated performance using precision, recall and correspondence accuracy using benchmark dataset. The results show that our algorithm is better than traditional ones for automatic image annotation and retrieval.","PeriodicalId":415406,"journal":{"name":"ACM International Workshop on Multimedia Databases","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM International Workshop on Multimedia Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1032604.1032621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

The development of technology generates huge amounts of non-textual information, such as images. An efficient image annotation and retrieval system is highly desired. Clustering algorithms make it possible to represent visual features of images with finite symbols. Based on this, many statistical models, which analyze correspondence between visual features and words and discover hidden semantics, have been published. These models improve the annotation and retrieval of large image databases. However, image data usually have a large number of dimensions. Traditional clustering algorithms assign equal weights to these dimensions, and become confounded in the process of dealing with these dimensions. In this paper, we propose a top-down, subspace clustering algorithm as a solution to this problem. For a given cluster, we determine relevant features based on histogram analysis and assign greater weight to relevant features as compared to less relevant features. We have implemented four different models to link visual tokens with keywords based on the clustering results of our clustering algorithm and K-means algorithm, and evaluated performance using precision, recall and correspondence accuracy using benchmark dataset. The results show that our algorithm is better than traditional ones for automatic image annotation and retrieval.
基于子空间聚类算法的图像自动标注与检索
技术的发展产生了大量的非文本信息,如图像。人们迫切需要一个高效的图像标注和检索系统。聚类算法使得用有限的符号表示图像的视觉特征成为可能。在此基础上,许多分析视觉特征与词汇对应关系、发现隐藏语义的统计模型相继问世。这些模型改进了大型图像数据库的标注和检索。然而,图像数据通常具有大量的维度。传统的聚类算法对这些维度赋予相同的权重,在处理这些维度的过程中容易产生混淆。在本文中,我们提出了一种自顶向下的子空间聚类算法来解决这个问题。对于给定的聚类,我们基于直方图分析确定相关特征,并为相关特征分配比不相关特征更大的权重。基于我们的聚类算法和K-means算法的聚类结果,我们实现了四种不同的模型来链接视觉标记和关键字,并使用基准数据集使用精度、召回率和对应精度来评估性能。结果表明,该算法在图像自动标注和检索方面优于传统算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信