A convex method for locating regions of interest with multi-instance learning

68Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomplished with multi-instance learning techniques by treating each image as a bag of instances (regions). Many SVM-based methods are successful in predicting the bag labels, however, few of them can locate the ROIs. Moreover, they are often based on either local search or an EM-style strategy, and may get stuck in local minima easily. In this paper, we propose two convex optimization methods which maximize the margin of concepts via key instance generation at the instance-level and bag-level, respectively. Our formulation can be solved efficiently with a cutting plane algorithm. Experiments show that the proposed methods can effectively locate ROIs, and they also achieve performances competitive with state-of-the-art algorithms on benchmark data sets. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, Y. F., Kwok, J. T., Tsang, I. W., & Zhou, Z. H. (2009). A convex method for locating regions of interest with multi-instance learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5782 LNAI, pp. 15–30). https://doi.org/10.1007/978-3-642-04174-7_2

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