Biased minimax probability machine active learning for relevance feedback in content-based image retrieval

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we apply Biased Minimax Probability Machine (BMPM) to address the problem of relevance feedback in Content-based Image Retrieval (CBIR). In our proposed methodology we treat relevance feedback task in CBIR as an imbalanced learning task which is more reasonable than traditional methods since the negative instances largely outnumber the positive instances. Furthermore we incorporate active learning in order to improve the framework performance, i.e., try to reduce the number of iterations used to achieve the optimal boundary between relevant and irrelevant images. Different from previous works, this model builds up a biased classifier and achieves the optimal boundary using fewer iterations. Experiments are performed to evaluate the efficiency of our method, and promising experimental results are obtained. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Xiang, P., & King, I. (2006). Biased minimax probability machine active learning for relevance feedback in content-based image retrieval. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 953–960). Springer Verlag. https://doi.org/10.1007/11875581_114

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free