Learning Object Detectors From Weakly Supervised Image Data
•Download as PPTX, PDF•
3 likes•1,653 views
This document summarizes research on using computer vision and machine learning techniques to perform object detection without full bounding box annotations. It describes a new multiple instance learning (MIL) method called CR-MILBOOST that can learn from weakly labeled image data where only the image label is provided, not exact object locations. It also discusses adapting pre-trained deep convolutional neural networks from classification to detection by fine-tuning layers on detection data. Experimental results show these methods can dramatically improve object detection performance compared to fully supervised training even when annotations are weak.
Recommended
More Related Content
Viewers also liked
Viewers also liked (11)
Similar to Learning Object Detectors From Weakly Supervised Image Data
Similar to Learning Object Detectors From Weakly Supervised Image Data (20)
More from Yandex
More from Yandex (20)
Recently uploaded
Recently uploaded (20)
Learning Object Detectors From Weakly Supervised Image Data
- 1. КОМПЬЮТЕРНОЕ ЗРЕНИЕ: ОБУЧЕНИЕ РАСПОЗНАВАНИЮ ОБЪЕКТОВ Kate Saenko, University of Massachusetts, Lowell
- 2. COMPUTER VISION: LEARNING TO DETECT OBJECTS Kate Saenko, University of Massachusetts, Lowell
- 3. What is computer vision?2
- 4. Computer Vision 3 Terminator 2 we’re not quite there yet, but…. terminator 2, enemy of the state (from UCSD “Fact or Fiction” DVD)
- 5. Machine Learning: What is it? Program a computer to learn from experience Learn from “big data”
- 6. Machine Learning in practice
- 7. Machine learning is not perfect 6
- 8. Machine learning is not perfect 7
- 9. Personal photo albums Lots of image data available!
- 10. Data for computer vision
- 11. What are applications of computer vision? 10
- 12. Surveillance and security Computer Vision: Surveillance and Security
- 13. Smart cars Mobileye Vision systems currently in high-end BMW, GM, Volvo models By 2010: 70% of car manufacturers Slide content courtesy of Amnon Shashua
- 15. Medical Imaging Image guided surgery Grimson et al., MIT 3D imaging MRI, CT slide by S. Seitz
- 16. Vision for Robotics http://www.robocup.org/NASA’s Mars Spirit Rover http://en.wikipedia.org/wiki/Spirit_rover slide by S. Seitz
- 17. Object Detection: Face Detection Viola and Jones, Robust object detection using a boosted cascade of simple features, CVPR 2001
- 18. What is object detection?17
- 19. Goal of object detection 18 Detect: PERSON
- 20. Why is object detection difficult? 19
- 21. Why is object detection difficult? 20 Can you detect all objects in this image?
- 22. Easy to collect data on the web! 21
- 23. Difficult to label image annotations 22 Easy to label from search engine Much more difficult and costly to label dog apple dog apple
- 24. Goal of this research: 23 Learn from weakly labeled data!
- 25. How well can we do without bounding box labels?24 Computer detecting pedestrians
- 26. 25 Computer detecting 7,000 object categories How well can we do without bounding box labels?
- 27. Join work with Karim Ali Confidence-rated Multiple instance Boosting for Detection
- 28. Motivation 27 Object Detection High accuracy requires large labeled data sets Scalability Reducing annotation requirements Semi-supervised Learning Active Learning Multiple-Instance Learning
- 30. Multiple instance learning with noise 29 MI Learning cannot handle noisy bags
- 31. Outline 30 Reminder: What is MIL? CR-MILBoost (CVPR’14) Conclusion & Future Work Discussion
- 32. Reminder: What is MIL? 31 Supervised Learning Each instance has an associated label MIL: Weaker Supervision Examples come in bags Each Bag has a label Negative Bag: all instances in bag are negative Positive Bag: at least one instance in bag is positive
- 33. Supervised vs MIL (binary) 32 Supervised Learning MI Learning xi, yi( ) Î RD ´ -1,1{ } Xi = xi1,… , xiK{ }, yi( )Î RD ( ) K ´ -1,1{ } j x( )> 0 if y = +1 j x( )< 0 if y = -1 max j j(xij ) > 0 if yi = +1 max j j(xij ) < 0 if yi = -1 j* x( )= argmin j x( ) L j;x, y( ) j* x( )= argmin j x( ) L j;X, y( )
- 34. Related Methods 33 How to estimate latent labels for positives Gartner, ICML’02 Xi = 1 N xijå Xu, ICML’04 j(Xi ) = 1 N j(xijå ) Andrews, NIPS’03 j(Xi )= max j j(xij ) Bunescu, ICML’07 SVM Constraints Viola, NIPS’07 pi =1-Õj (1- pij ) Supervised MIL
- 35. CR-MILBOOST 34 j* (x) = argminÕ pi ti (1- pi )1-ti pij = 1 1+e -j xij( ) pi =1-Õj (1- pij ) MILBoost
- 36. CR-MILBOOST 35 j* (x) = argminÕ pi ti (1- pi )1-ti MILBoost wij = yi - pi pi pij j(x) = akhk (x) k å
- 37. CR-MILBOOST 36 Two Step Procedure Estimate Probabilities on latent label Integrate estimate in new loss Mitigates label estimation error by incorporating priors
- 38. CR-MILBOOST 37 Q = j1 x( ),j2 x( ),… ,jq x( ){ } hij º P yij = yi Q( )= 1 1+e -yi jq xij( )å hi º P yi Q( )= max j hij Step 1
- 39. CR-MILBOOST 38 Step 2 j* (x) = argminÕ pi ti (1- pi )1-ti pij = 1 1+e -j xij( ) pi =1-Õj (1- pij ) hij hi
- 40. CR-MILBOOST 39 Step 2 wij = yi - pi hi pi hij pij j(x) = akhk (x) k å
- 41. Experiments: Features 40 h* e,R (x) = xe (x,m) mÎR å xd (x,m) dÎF,mÎR å Weak Learners: An edge orientation A sub-window A threshold e,R,t( ) Simple, Efficient Q=4, number of stumps f x( ) = akhk x( ) k å
- 42. Experiments: Pedestrian Detection 41 Training Data 200 images automatically downloaded from the web 200 “objectness” bounding boxes
- 43. Experiments: Pedestrian Detection 42 Testing Data INRIA Person 300 images containing 600 pedestrians
- 47. Experiments: Horse Detection 46 Training Data 200 images automatically downloaded from the web 200 “objectness” bounding boxes
- 48. Experiments: Horse Detection 47 Testing Data 200 images containing 200 side-view horses
- 52. Conclusion 51 New MIL method: CR-MILBOOST Two step procedure Dramatic increase in performance 200% on two datasets Quality of selected examples still suffer from additional ambiguity when compared to the fully supervised examples
- 53. Joint work with Judy Hoffman, Eric Tzeng, Sergio Guadarrama and Trevor Darrell at UC Berkeley Adapting Deep CNNs from Classification to Detection 53
- 54. Recall: classification is easier than detection 54 Classification label: Easy to label Detection label: much more difficult and costly! dog apple dog apple
- 55. ICLASSIFY dogapple I DET dog apple ICLASSIFY cat W CLASSIFY dog W CLASSIFY apple Classifiers WDET dog WDET apple Detectors WCLASSIFY cat WDET cat IDET ? Main idea behind the approach
- 56. cat: 0.90 dog: 0.85 airplane: 0.05 person: 0.10 layers 1-5 fc6 fc7 fcA fcB Classification data from categories A and B Train Classification CNN Deep Convolutional Neural Network
- 57. dog: 0.87 person: 0.15 cat: 0.90 dog: 0.85 background: 0.25 airplane: 0.05 person: 0.10 layers 1-5 det layers 1-5 fc6 det fc6 fc7 det fc7 fcA fcB det fcB Classification data from categories A and B Train Classification CNN Detection data from categories B Labeled warped region Train adapted detection CNN dog background background: 0.25 det layers 1-5 det fc6 det fc7 Final Combined and fully adapted CNN cat: 0.90 airplane: 0.02det fcA dog: 0.45 person: 0.15 det fcB adapt background (c) Output Layer Adaptation (a)ClassificationCNN (b) Hidden Layer Adaptation
- 58. Results on ILSVRC 2013 Detection
- 59. Results on ILSVRC 2013 Detection
- 60. Results on ILSVRC 2013 Detection
- 62. Preliminary results on 7K categories 62
- 63. Conclusion 63 Presented two new methods for object detector training with minimal bounding box annotation MIL based method for learning from results of image search Adaptation from classification to detection task
- 64. Questions? 64