.png){kind=icon}
返回
Active learning paradigms for CBIR systems based on optimum-path forest classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2011.04.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper discusses methods for content-based image retrieval (CBIR) systems based on relevance feedback according to two active learning paradigms, named greedy and planned. In greedy methods, the system aims to return the most relevant images for a query at each iteration. in planned methods, the most informative images are returned during a few iterations and the most relevant ones are only presented afterward. In the past, we proposed a greedy approach based on optimum-path forest classification (OPF) and demonstrated its gain in effectiveness with respect to a planned method based on support-vector machines and another greedy approach based on multi-point query. In this work, we introduce a planned approach based on the OFF classifier and demonstrate its gain in effectiveness over all methods above using more image databases. In our tests, the most informative images are better obtained from images that are classified as relevant, which differs from the original definition. The results also indicate that both OPF-based methods require less user involvement (efficiency) to satisfy the user's expectation (effectiveness), and provide interactive response times. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Content-based image retrieval
Relevance feedback
Optimum-path forest classifiers
Active learning
Image pattern analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Stress–Corrosion Cracking of Surface-Engineered Alloys in a Simulated Boiling-Water Reactor Environment.png)
Corrosion
CorrosionIF0
PREAI
分享收藏分享收藏
查看更多内容