Progressive Mode-Seeking on Graphs for Sparse Feature Matching thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Progressive Mode-Seeking on Graphs for Sparse Feature Matching

Published on Oct 29, 20142634 Views

Sparse feature matching poses three challenges to graph-based methods: (1) the combinatorial nature makes the number of possible matches huge; (2) most possible matches might be outliers; (3) high com

Related categories

Chapter list

Progressive mode-seeking on graphs for sparse feature matching00:00
Outline00:16
Sparse feature matching - 100:37
Sparse feature matching - 200:59
Sparse feature matching - 301:40
Sparse feature matching - 401:54
Motivation - 102:17
Motivation - 202:49
Motivation - 303:39
Motivation - 404:45
Motivation - 505:47
Motivation - 606:19
Motivation - 706:46
Motivation - 807:00
Proposed method - 107:16
Proposed method - 207:46
Proposed method - 308:20
Proposed method - 409:02
Proposed method - 511:09
Experiments - 111:11
Experiments - 211:11
Experiments - 311:25
Limitations11:36
Conclusion12:06