Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala,...

20
Learning Everything about Anything: Webly-Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin

Transcript of Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala,...

Page 1: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

Learning Everything about Anything: Webly-Supervised Visual Concept Learning

Santosh K. Divvala, Ali Farhadi, Carlos Guestrin

Page 2: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Overview

• Fully-automated approach for learning models for a wide range of variations within a concept; such as, actions, interactions, attributes, etc.

• Need to discover the vocabulary of variance• Vast resources of online books used• Data collection and modelling steps intertwined => no need for explicit

human supervision in training the models• Introduce a novel “webly-supervised” approach to discover and model

the intra-concept visual variance.

Page 3: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Contributions

i. A novel approach, using no explicit supervision, for: 1) discovering a comprehensive vocabulary2) training a full-fledged detection model for any concept

ii. Showing substantial improvement over existing weakly supervised state-of-the-art methods

iii. Presenting impressive results for unsupervised action detectioniv. An open-source online system (http://levan.cs.washington.edu/) that,

given any query concept, automatically learns everything visual about it

Page 4: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Page 5: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Main motivation

• Scalability • Exhaustively covering all appearance variations, while requiring minimal

or no human supervision for compiling the vocabulary of visual variance

Page 6: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

The Problem

Learn all possible appearance variations of a concept (everything) of different concepts for which visual models are to be learned (anything)

Page 7: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Related Work

• Taming intra-class variance: Previous works use simple annotations based on aspect-ratio, viewpoint, and feature-space clustering.

• Weakly-supervised object localization: 1) Poor existing image-based methods when object is highly cluttered or when it occupies only a small portion of the image (e.g., bottle). 2) Video-based methods perform poorly when there are no motion cues (e.g., tv-monitor). 3) Models of all existing methods trained on weakly-labeled datasets where each training image or video contains the object

• Learning from web images: Either the data is not labelled precisely enough or requires manual labelling.

Page 8: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Drawbacks of Supervision in Variance Discovery

• Extensivity: a manually-defined vocabulary may have cultural biases, leading to the creation of very biased datasets.

• Specificity: tedious to define all concept-specific vocabulary (e.g., ‘rearing’ can modify a ‘horse’ with very characteristic appearance, but does not extend to ‘sheep’)

Page 9: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Drawbacks of Supervision in Variance Modeling

• Flexibility: best for annotations to be modified based on feature representation and the learning algorithm.

• Scalability: creating a new dataset or adding new annotations to an existing dataset is a huge task. Also, since the modelling step and the discovery step are done independently, the annotations for modeling the intra-concept variance are often disjoint from those gathered during variance discovery.

Page 10: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

The New Technical Approach

• Vocabulary of variance discovered using vast online books (Google Books Ngrams) => both extensive and concept-specific

• Can query Google Ngrams in Python: https://pypi.python.org/pypi/google-ngram-downloader/

• Visual variance modeled by intertwining the vocabulary discovery and the model learning steps.

• Use recent progress in text-based web image search engines, and weakly supervised object localization methods

Page 11: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Discovering the vocabulary of variance

• Use the Google books ngram English 2012 corpora to obtain all keywords

• Specifically the dependency gram data (contains parts-of-speech (POS) tagged head=>modifier dependencies between pairs of words)

• POS tags help partially disambiguate the context of the query• Selected ngram dependencies for a given concept have modifiers that

are tagged either as noun, verb, adjective, or adverb. • Sum up the frequencies across different years• End up with around 5000 ngrams for a concept • Not all concepts are visually salient => use a simple and fast image-

classifier based pruning method

Page 12: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Classifier-based Pruning

An image-based classifier trained for a visually salient ngram should accurately predict unseen samples of that ngramProcess:1. Train image set for each ngram i.2. Split set into equal-sized training and validation sets 3. Augment the training images with their mirrored versions4. Gather a random pool of background images 5. Train a linear SVM for each ngram with as positive and as negative training images6. Evaluate the SVM on

An ngram is visually salient if the Average Precision (A.P.) of the SVM is about a threshold, set at 10%. Typically end up with around 1000 ngrams for a concept.

Page 13: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Space of Visual VarianceTo avoid training separate models for visually similar ngrams and to combine relevant training data, calculate quality and coverage • G = {V, E}: the space of all ngrams• Each node represents an ngram, with a score corresponding to the quality of (i.e., the A.P. of the SVM

on )• Each edge represents the visual similarity between them, with weights corresponding to the visual

distance between two ngrams i,j (i.e., the ranked score of the jth ngram classifier on the ith ngram validation set .

• Rank-based measure used on instances in the validation set of an ngram against the pool of background images

• : ranks of images in against scored using • Normalized median rank as the edge weight Summary of finding a representative subset of ngrams: searching for the subset that maximizes the quality of that subset:

O is a soft coverage function that implicitly pushes for diversity:

Page 14: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Page 15: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Model Learning 1) Images for training the detectors gathered using Image Search with the query phrases as the ngrams

constituting the superngram2) 200 full-sized, ‘full’ color, ‘photo’ type images downloaded per query 3) Images resized to a maximum of 500 pixels (preserving aspect-ratio)4) All near-duplicates discarded5) Images with extreme aspect-ratios discarded6) Training a mixture of roots: Trained a separate Deformable Parts Model (DPM) for each ngram

where the visual variance is constrained. a) Initialized the bounding box to a sub-image within the image that ignores the image boundaries.b) Initialized the model using feature space clustering c) To deal with appearance variations (e.g., ‘jumping horse’ contains images of horses jumping at different orientations), they used a mixture of components initialized with feature space clustering.

Since approximately 70% of the components per ngram act as noise sinks they first trained root filters for each component and pruned the noisy ones.

Page 16: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Model Learning (cont’d)

7) Pruning noisy components: Basically the same as the slide on classifier-based pruning

8) Merging pruned components: Basically the same as the slide on Space of Visual Variance

Page 17: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Strengths/Weaknesses of the approach

Page 18: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

The Experimental Evaluation

Page 19: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Strengths and Weaknesses of the evaluation

Sources of errors:• Extent of overlap: e.g., an image of horse-drawn carriage would have

the ‘profile horse’, the ‘horse carriage’ and ‘horse head’ detected The VOC criterion demands a single unique detection box for each test instance that has 50% overlap => all the other valid detections are declared as false-positives either due to poor localization or multiple detections.

• Polysemy: e.g., the car model includes some bus-like car componentsThe VOC dataset exclusively focuses on typical cars (and moreover, discriminates cars from buses).

Page 20: Learning Everything about Anything: Webly- Supervised Visual Concept Learning Santosh K. Divvala, Ali Farhadi, Carlos Guestrin.

University of Toronto

Discussion: Future direction

Some future directions (suggested by authors):• Coreference resolution: Determining when two textual mentions name the same entity.

The Stanford state-of- the-art system does not link ‘Mohandas Gandhi’ to ‘Mahatma Gandhi’, and ‘Mrs. Gandhi’ to ‘Indira Gandhi’ in: “Indira Gandhi was the third Indian prime minister. Mohandas Gandhi was the leader of Indian nationalism. Mrs. Gandhi was inspired by Mahatma Gandhi’s writings.”Whereas, the method presented here finds the appropriate coreferences.

• Paraphrasing: For example, they discovered that ‘grazing horse’ is semantically very similar to ‘eating horse’. Their method can produce a semantic similarity score for textual phrases.

• Temporal evolution of concepts: Can model the visual variance of a concept along the temporal axis, using year-based frequency information in the ngram corpus to identify the peaks over a period of time and then learn models for them. This can help in not only learning the evolution of a concept [26], but also in automatically dating detected instances [35].

• Deeper image interpretation: E.g., providing object part boxes (e.g., ‘horse head’, ‘horse foot’, etc) and annotating object action (e.g., ‘fighting’) or type (e.g., ‘jennet horse’).

• Understanding actions: e.g., ‘horse fighting’, ‘reining horse’