Introduction to algorithms
Query refinement for multimedia similarity retrieval in MARS
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Support vector machine active learning for image retrieval
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
SIMPLIcity: Semantics-Sensitive Integrated Matching for Picture LIbraries
IEEE Transactions on Pattern Analysis and Machine Intelligence
A compact and efficient image retrieval approach based on border/interior pixel classification
Proceedings of the eleventh international conference on Information and knowledge management
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
QCluster: relevance feedback using adaptive clustering for content-based image retrieval
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multimodal concept-dependent active learning for image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 12 - Volume 12
A Semi-Supervised Active Learning Framework for Image Retrieval
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Active learning in very large databases
Multimedia Tools and Applications
Image retrieval: Ideas, influences, and trends of the new age
ACM Computing Surveys (CSUR)
Local invariant feature detectors: a survey
Foundations and Trends® in Computer Graphics and Vision
A genetic programming framework for content-based image retrieval
Pattern Recognition
High-dimensional descriptor indexing for large multimedia databases
Proceedings of the 17th ACM conference on Information and knowledge management
Semisupervised SVM batch mode active learning with applications to image retrieval
ACM Transactions on Information Systems (TOIS)
Fast Query Point Movement Techniques for Large CBIR Systems
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Supervised pattern classification based on optimum-path forest
International Journal of Imaging Systems and Technology - Contemporary Challenges in Combinatorial Image Analysis
The Pascal Visual Object Classes (VOC) Challenge
International Journal of Computer Vision
Optimizing Optimum-Path Forest Classification for Huge Datasets
ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Leveraging active learning for relevance feedback using an information theoretic diversity measure
CIVR'06 Proceedings of the 5th international conference on Image and Video Retrieval
Computer Vision and Image Understanding
Inconsistency-based active learning for support vector machines
Pattern Recognition
Image retrieval by content based on a visual attention model and genetic algorithms
SBIA'12 Proceedings of the 21st Brazilian conference on Advances in Artificial Intelligence
Active graph matching based on pairwise probabilities between nodes
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A data reduction and organization approach for efficient image annotation
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.01 |
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 OPF 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.