Computer Vision – Final Project
Graph Recognition
Ilya Mirsky 310680657
Tal Baumel 38041653
The Goal
• Making an adjacency matrix from a rough
sketch of a graph.
2
1
0 1
1 0
0 1
3
0
1
0
Course of Action
• Hough transform to detect shapes
• Eliminating redundant objects
• Finding correspondence between edges and
nodes
• Constructing the adjacency matrix
Results
Hough transform
Results
Eliminating
Redundant
Objects
Results
Constructing
the matrix
0 1
1 0
1 0
1
0
0
Results
0
0
0
1
0
0
1
0
0
1
0
0
1
0
0
0
Results
0
1
0
0
0
1
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
1
0
0
Limitations
• Some line orientations weren't recognized
• Circles radius range is strict
• Only handle pseudo straight lines
Future improvements
•
•
•
•
Better line detection
Adding OCR features for weighted graphs
Making an interactive model
Using a dynamic range for circle radius