首页> 外文会议> >Using rival penalized competitive clustering for feature indexing in Hong Kong's textile and fashion image database
【24h】

Using rival penalized competitive clustering for feature indexing in Hong Kong's textile and fashion image database

机译:利用竞争对手的惩罚性竞争聚类在香港的纺织和时尚图像数据库中进行特征索引

获取原文

摘要

Efficient content-based information retrieval in image databases depends on good indexing structures of the extracted features. While indexing structures for text retrieval are well understood, efficient and robust indexing structures for image retrieval are still elusive. We use the rival penalized competitive learning (RPCL) clustering algorithm to partition extracted feature vectors from images to produce an indexing structure for Montage, an image database developed for Hong Kong's textile, clothing, and fashion industry supporting content-based retrieval, e.g., by color, texture, sketch, and shape. RPCL is a stochastic heuristic clustering method which provides good cluster center approximation and is computationally efficient. Using synthetic data, we demonstrate the recall and precision performance of nearest-neighbor feature retrieval based on the indexing structure generated by RPCL.
机译:图像数据库中基于内容的有效信息检索取决于所提取特征的良好索引结构。虽然很好地理解了用于文本检索的索引结构,但是用于图像检索的有效且健壮的索引结构仍然难以捉摸。我们使用竞争对手的惩罚性竞争学习(RPCL)聚类算法对图像中提取的特征向量进行划分,以生成Montage的索引结构,该图像结构是为香港的纺织,服装和时装行业开发的图像数据库,支持基于内容的检索,例如,颜色,纹理,草图和形状。 RPCL是一种随机启发式聚类方法,可提供良好的聚类中心近似值,并且计算效率高。使用合成数据,我们演示了基于RPCL生成的索引结构的最近邻特征检索的查全率和精确度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号