event thumbnail image
6th IARP -TC-15 Workshop on Graphbased Representations in Pattern Recognition

Grouping Using Factor Graphs: an Approach for Finding Text with a Camera Phone

author: Huiying Shen, Smith-Kettlewell Eye Research Institute (SKERI)

Description

We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables. The ability of factor graphs to express interactions higher than pairwise order (the highest order encountered in most graphical models used in computer vision) is useful for modeling a variety of pattern recognition problems. In particular, we show how this property makes factor graphs a natural framework for performing grouping and segmentation, which we apply to the problem of finding text in natural scenes. We demonstrate an implementation of our factor graph-based algorithm for finding text on a Nokia camera phone, which is intended for eventual use in a camera phone system that finds and reads text (such as street signs) in natural environments for blind users.

You might be experiencing some problems with Your Video player.
Slides
0:00 Grouping Using Factor Graph: An Approach for finding Text with a Camera Phone
1:05 Motivation
1:55 Motivation
2:53 More Examples
3:21 Why a Cell Phone (1)
4:16 Why a Cell Phone (2)
4:47 Why a Cell Phone (3)
4:55 Why a Cell Phone (4)
5:47 Why a Cell Phone (5)
5:57 Our Algorithm: Feature Selection and Factor Graph (1)
5:59 Our Algorithm: Feature Selection and Factor Graph (2)
6:26 Our Algorithm: Feature Selection and Factor Graph (3)
6:54 Feature Selection (1)
7:09 Feature Selection (2)
7:41 Feature Selection: bottom up
8:10 Matched Vertical/Horizontal Edgelets
8:40 Anchored Vertical Edgelets
8:50 Matched Vertical/Horizontal Edgelets
8:54 Anchored Vertical Edgelets
9:17 Matched Vertical/Horizontal Edgelets
9:52 Anchored Vertical Edgelets
10:06 A factor graph model
10:59 The Equations
11:35 A factor graph model
11:40 The Equations
13:36 Our Simplifications (1)
14:04 Matched Vertical/Horizontal Edgelets
14:05 Anchored Vertical Edgelets
14:15 Our Simplifications (1)
14:22 Our Simplifications (2)
15:06 Our Simplifications (3)
15:50 An Example Factor Graph (1)
16:34 An Example Factor Graph (2)
17:50 Our Non-Iterative Algorithm (1)
18:50 The Equations
18:58 Our Non-Iterative Algorithm (1)
19:00 Our Non-Iterative Algorithm (2)
19:33 An example
20:01 More examples (1)
20:12 More examples (2)
20:35 More examples (3)
20:46 More examples (4)
21:00 More examples (5)
21:06 Summary / Discussion (1)
21:22 Summary / Discussion (2)
21:29 Summary / Discussion (3)
21:36 Summary / Discussion (4)
21:44 Summary / Discussion (5)
21:53 Summary / Discussion (6)

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: