One-class multiple instance learning and applications to target tracking

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

Abstract

Existing work in the field of Multiple Instance Learning (MIL) have only looked at the standard two-class problem assuming both positive and negative bags are available. In this work, we propose the first analysis of the one-class version of MIL problem where one is only provided input data in the form of positive bags. We also propose an SVM-based formulation to solve this problem setting. To make the approach computationally tractable we further develop a iterative heuristic algorithm using instance priors. We demonstrate the validity of our approach with synthetic data and compare it with the two-class approach. While previous work in target tracking using MIL have made certain run-time assumptions (such as motion) to address the problem, we generalize the approach and demonstrate the applicability of our work to this problem domain. We develop a scene prior modeling technique to obtain foreground-background priors to aid our one-class MIL algorithm and demonstrate its performance on standard tracking sequences. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Sankaranarayanan, K., & Davis, J. W. (2013). One-class multiple instance learning and applications to target tracking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7726 LNCS, pp. 126–139). https://doi.org/10.1007/978-3-642-37431-9_10

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