Visual Tracking with Online Multiple Instance Learning

Slides:



Advertisements
Similar presentations
Igor Markov Face Detection and Classification on Mobile Devices.
Advertisements

EE462 MLCV Lecture 5-6 Object Detection – Boosting Tae-Kyun Kim.
Learning Techniques for Video Shot Detection Under the guidance of Prof. Sharat Chandran by M. Nithya.
Patch to the Future: Unsupervised Visual Prediction
CMPUT 466/551 Principal Source: CMU
Online Multiple Classifier Boosting for Object Tracking Tae-Kyun Kim 1 Thomas Woodley 1 Björn Stenger 2 Roberto Cipolla 1 1 Dept. of Engineering, University.
AdaBoost & Its Applications
Foreground Modeling The Shape of Things that Came Nathan Jacobs Advisor: Robert Pless Computer Science Washington University in St. Louis.
Forward-Backward Correlation for Template-Based Tracking Xiao Wang ECE Dept. Clemson University.
Robust Object Tracking via Sparsity-based Collaborative Model
Cos 429: Face Detection (Part 2) Viola-Jones and AdaBoost Guest Instructor: Andras Ferencz (Your Regular Instructor: Fei-Fei Li) Thanks to Fei-Fei Li,
EE462 MLCV Lecture 5-6 Object Detection – Boosting Tae-Kyun Kim.
Robust Moving Object Detection & Categorization using self- improving classifiers Omar Javed, Saad Ali & Mubarak Shah.
Boosting CMPUT 615 Boosting Idea We have a weak classifier, i.e., it’s error rate is a little bit better than 0.5. Boosting combines a lot of such weak.
HCI Final Project Robust Real Time Face Detection Paul Viola, Michael Jones, Robust Real-Time Face Detetion, International Journal of Computer Vision,
Graz University of Technology, AUSTRIA Institute for Computer Graphics and Vision Fast Visual Object Identification and Categorization Michael Grabner,
Generic Object Detection using Feature Maps Oscar Danielsson Stefan Carlsson
Multiple-Instance Learning Paper 1: A Framework for Multiple-Instance Learning [Maron and Lozano-Perez, 1998] Paper 2: EM-DD: An Improved Multiple-Instance.
A Brief Introduction to Adaboost
Ensemble Tracking Shai Avidan IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE February 2007.
Adaboost and its application
Boosting Main idea: train classifiers (e.g. decision trees) in a sequence. a new classifier should focus on those cases which were incorrectly classified.
Latent Boosting for Action Recognition Zhi Feng Huang et al. BMVC Jeany Son.
Face Detection using the Viola-Jones Method
Face Alignment Using Cascaded Boosted Regression Active Shape Models
A Tutorial on Object Detection Using OpenCV
BraMBLe: The Bayesian Multiple-BLob Tracker By Michael Isard and John MacCormick Presented by Kristin Branson CSE 252C, Fall 2003.
EADS DS / SDC LTIS Page 1 7 th CNES/DLR Workshop on Information Extraction and Scene Understanding for Meter Resolution Image – 29/03/07 - Oberpfaffenhofen.
Boris Babenko Department of Computer Science and Engineering University of California, San Diego Semi-supervised and Unsupervised Feature Scaling.
“Secret” of Object Detection Zheng Wu (Summer intern in MSRNE) Sep. 3, 2010 Joint work with Ce Liu (MSRNE) William T. Freeman (MIT) Adam Kalai (MSRNE)
Detecting Pedestrians Using Patterns of Motion and Appearance Paul Viola Microsoft Research Irfan Ullah Dept. of Info. and Comm. Engr. Myongji University.
Window-based models for generic object detection Mei-Chen Yeh 04/24/2012.
Benk Erika Kelemen Zsolt
Lecture 29: Face Detection Revisited CS4670 / 5670: Computer Vision Noah Snavely.
Multiple Instance Real Boosting with Aggregation Functions Hossein Hajimirsadeghi and Greg Mori School of Computing Science Simon Fraser University International.
1 Copyright 2008, Toshiba Corporation. Björn Stenger 28 Sep 京都 Tutorial – Part 3 Tracking Using Classification and Online Learning.
BOOSTING David Kauchak CS451 – Fall Admin Final project.
DIEGO AGUIRRE COMPUTER VISION INTRODUCTION 1. QUESTION What is Computer Vision? 2.
Boris Babenko 1, Ming-Hsuan Yang 2, Serge Belongie 1 1. University of California, San Diego 2. University of California, Merced OLCV, Kyoto, Japan.
Boris 2 Boris Babenko 1 Ming-Hsuan Yang 2 Serge Belongie 1 (University of California, Merced, USA) 2 (University of California, San Diego, USA) Visual.
Supervised Learning of Edges and Object Boundaries Piotr Dollár Zhuowen Tu Serge Belongie.
Ensemble Learning Spring 2009 Ben-Gurion University of the Negev.
BAGGING ALGORITHM, ONLINE BOOSTING AND VISION Se – Hoon Park.
Stable Multi-Target Tracking in Real-Time Surveillance Video
Limitations of Cotemporary Classification Algorithms Major limitations of classification algorithms like Adaboost, SVMs, or Naïve Bayes include, Requirement.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
Robust Object Tracking with Online Multiple Instance Learning
Concept learning, Regression Adapted from slides from Alpaydin’s book and slides by Professor Doina Precup, Mcgill University.
Boris Babenko, Steve Branson, Serge Belongie University of California, San Diego ICCV 2009, Kyoto, Japan.
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
COP5992 – DATA MINING TERM PROJECT RANDOM SUBSPACE METHOD + CO-TRAINING by SELIM KALAYCI.
Learning to Detect Faces A Large-Scale Application of Machine Learning (This material is not in the text: for further information see the paper by P.
Week 10 Emily Hand UNR.
A Brief Introduction on Face Detection Mei-Chen Yeh 04/06/2010 P. Viola and M. J. Jones, Robust Real-Time Face Detection, IJCV 2004.
Learning video saliency from human gaze using candidate selection CVPR2013 Poster.
Max-Confidence Boosting With Uncertainty for Visual tracking WEN GUO, LIANGLIANG CAO, TONY X. HAN, SHUICHENG YAN AND CHANGSHENG XU IEEE TRANSACTIONS ON.
AdaBoost Algorithm and its Application on Object Detection Fayin Li.
Adaboost (Adaptive boosting) Jo Yeong-Jun Schapire, Robert E., and Yoram Singer. "Improved boosting algorithms using confidence- rated predictions."
Week 3 Emily Hand UNR. Online Multiple Instance Learning The goal of MIL is to classify unseen bags, instances, by using the labeled bags as training.
1 Bilinear Classifiers for Visual Recognition Computational Vision Lab. University of California Irvine To be presented in NIPS 2009 Hamed Pirsiavash Deva.
Combining Models Foundations of Algorithms and Machine Learning (CS60020), IIT KGP, 2017: Indrajit Bhattacharya.
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization Authors: Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, Leiguang Gong and.
2. Skin - color filtering.
Krishna Kumar Singh, Yong Jae Lee University of California, Davis
Session 7: Face Detection (cont.)
Boosting and Additive Trees
Incremental Boosting Incremental Learning of Boosted Face Detector ICCV 2007 Unsupervised Incremental Learning for Improved Object Detection in a Video.
Cos 429: Face Detection (Part 2) Viola-Jones and AdaBoost Guest Instructor: Andras Ferencz (Your Regular Instructor: Fei-Fei Li) Thanks to Fei-Fei.
Introduction to Data Mining, 2nd Edition
Boris Babenko, Steve Branson, Serge Belongie
Presentation transcript:

Visual Tracking with Online Multiple Instance Learning Boris Babenko1, Ming-Hsuan Yang2, Serge Belongie1 1. University of California, San Diego 2. University of California, Merced

Tracking Problem: track arbitrary object in video given location in first frame Typical Tracking System: Appearance Model Color histograms, filter banks, subspaces, etc Motion/Dynamic Model Optimization/Search Greedy local search, particle filter, etc [Ross et al. ‘07]

Tracking Problem: track arbitrary object in video given location in first frame Typical Tracking System: Appearance Model Color histograms, filter banks, subspaces, etc Motion/Dynamic Model Optimization/Search Greedy local search, particle filter, etc [Ross et al. ‘07]

Tracking by Detection Recent tracking work Focus on appearance model Borrow techniques from obj. detection Slide a discriminative classifier around image Adaptive appearance model [Collins et al. ‘05, Grabner et al. ’06, Ross et al. ‘08]

Tracking by Detection First frame is labeled

Tracking by Detection First frame is labeled Classifier Online classifier (i.e. Online AdaBoost)

Tracking by Detection Grab one positive patch, and some negative patch, and train/update the model. negative positive Classifier

Tracking by Detection Get next frame negative positive Classifier

Tracking by Detection Evaluate classifier in some search window negative positive Classifier Classifier

Tracking by Detection Evaluate classifier in some search window negative positive old location X Classifier Classifier

Tracking by Detection Find max response negative positive old location new location X X Classifier Classifier

Tracking by Detection Repeat… negative negative positive positive Classifier Classifier

Problems with Adaptive Appearance Models What if classifier is a bit off? Tracker starts to drift How to choose training examples?

How to Get Training Examples MIL Classifier Classifier Classifier

Multiple Instance Learning (MIL) Ambiguity in training data Instead of instance/label pairs, get bag of instances/label pairs Bag is positive if one or more of it’s members is positive [Keeler ‘90, Dietterich et al. ‘97]

Object Detection Problem: Labeling with rectangles is inherently ambiguous Labeling is sloppy [Viola et al. ‘05]

MIL for Object Detection Solution: Take all of these patches, put into positive bag At least one patch in bag is “correct” [Viola et al. ‘05]

Multiple Instance Learning (MIL) Supervised Learning Training Input MIL Training Input

Multiple Instance Learning (MIL) Positive bag contains at least one positive instance Goal: learning instance classifier Classifier is same format as standard learning

How to Get Training Examples MIL Classifier Classifier Classifier

How to Get Training Examples MIL Classifier Classifier Classifier

Online MILBoost Need an online MIL algorithm Combine ideas from MILBoost and Online Boosting [Oza et al. ‘01, Viola et al. ’05, Grabner et al. ‘06]

Boosting Train classifier of the form: where is a weak classifier Can make binary predictions using [Freund et al. ‘97]

MILBoost Objective to maximize: Log likelihood of bags: where (as in LogitBoost) (Noisy-OR) [Viola et al. ’05, Friedman et al. ‘00]

MILBoost Train weak classifier in a greedy fashion For batch MILBoost can optimize using functional gradient descent. We need an online version…

Online MILBoost At all times, keep a pool of weak classifier candidates [Grabner et al. ‘06]

Updating Online MILBoost At time t get more training data Update all candidate classifiers Pick best K in a greedy fashion

Update all classifiers Online MILBoost Frame t Frame t+1 Get data (bags) Update all classifiers in pool Greedily add best K to strong classifier

MILTrack MILTrack = Online MILBoost + Stumps for weak classifiers + Randomized Haar features + Simple motion model + greedy local search [Dollar et al. ‘07]

Experiments Compare MILTrack to: All params were FIXED OAB1 = Online AdaBoost w/ 1 pos. per frame OAB5 = Online AdaBoost w/ 45 pos. per frame SemiBoost = Online Semi-supervised Boosting FragTrack = Static appearance model All params were FIXED 8 videos, labeled every 5 frames by hand (available on the web) [Grabner ‘06, Adam ‘06, Grabner ’08]

OAB1 OAB5 MILTrack MIL Classifier Classifier Classifier

Videos…

Results

Results

Results Best Second Best Ground truth: labeled every 5 frames

Conclusions Proposed Online MILBoost algorithm Using MIL to train an appearance model results in more robust tracking Data and code on my website

Thanks! Special thanks to: Supported by: Kristin Branson, Piotr Dollár, David Ross Supported by: NSF CAREER Grant #0448615, NSF IGERT Grant DGE-0333451, and ONR MURI Grant #N00014-08-1-0638, Honda Research Institute USA.

Updating candidate classifiers Subtlety: need instance labels to update candidate weak classifiers… Set Not optimal; weak classifiers try to minimize instance error The weak classifiers are chosen to minimize bag error

Online MILBoost

Illustration { } { } OAB MIL Frame 1 Clf Initialize Frame 2 Clf Update (Labeled) Clf Initialize OAB MIL Frame 2 Initial Positive Example Ftr Pool: OAB Clf = { } MIL Clf = Apply Clf Extracted Positive Examples (a Bag) { } Clf Update 1 2 3 Frame 3

Future Work Interested in: Tracking with a stereo rig / rough depth estimate Tracking with very high frame rate Tracking with transfer learning (i.e. when you have a very good prior model)