A Convex Method for Locating Regions of Interest with Multi-Instance Learning

author: Yu-Feng Li, LAMDA Group, Department of Computer Science and Technology, Nanjing University
published: Oct. 20, 2009,   recorded: September 2009,   views: 3794


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


In content-based image retrieval (CBIR) and image screening, it is often desirable to automatically locate the regions of interest (ROI) in the images. 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 label. However, very few of them can locate the ROIs and often they are based on either the local search or an EM-type strategy, which may get stuck in local minima. To address this problem, we propose in this paper two convex optimization methods which maximize the margin of concepts via key instance generation in the instance-level and bag-level, respectively. Moreover, this can be efficiently solved with a cutting plane algorithm. Experiments show that the proposed methods can effectively locate ROIs. Moreover, on the benchmark data sets, they achieve performance that are competitive with state-of-the-art algorithms.

See Also:

Download slides icon Download slides: ecmlpkdd09_li_cmlrimil_01.ppt (3.3┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: