event thumbnail image
Learning to Compare Examples

Learning Visual Distance Function for Object Identification from one Example

author: Frederic Jurie, INRIA - The French National Institute for Research in Computer Science and Control

Description

Comparing images is essential to several computer vision problems, like image retrieval or object identification. The comparison of two images heavily relies on the definition of a good distance function. Standard functions (e.g. the euclidean distance in the original feature space) are too generic and fail to encode the domain specific information. In this paper, we propose to learn a similarity measure specific to a given category (e.g. cars). This distance is learned from a training set of pairs of images labeled “same” or “different”, indicating if the two images represent the same object (e.g. same car model) or not. After learning, this measure is used to predict how similar two images of never seen objects are.

You might be experiencing some problems with Your Video player.
Slides
0:00 Learning Visual Distance Function
for Identification from one Example
0:21 This is an object you've never seen before ... can you recognize it in the following images?
1:00 This is an object you've never seen before ... can you recognize it in the following images?01
2:02 This is an object you've never seen before ... can you recognize it in the following images?02
2:24 This is an object you've never seen before ... can you recognize it in the following images?03
2:49 This is an object you've never seen before ... can you recognize it in the following images?04
3:48 Our goal: Learning from one Example
with Equivalence Constraints
4:23 How to compare images ?
5:30 How to learn the distance ?
6:34 How to be robust to occlusion,
view point changes ?
7:32 Computation of
corresponding patches
8:26 From multiple local similarities
to one global similarity
9:32 Patch independence:
a bad assumption
11:35 Vector quantization of
pair difference
12:07 Computation of the trees
13:14 Computation of the trees01
14:02 From clusters to Similarity
16:04 Similarity measure
19:38 Conclusions

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.

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: