Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching

Published on Nov 07, 20141738 Views

Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph match

Related categories

Chapter list

Robust multimodal graph matching: sparse coding meets graph matching00:00
The graph matching problem00:06
Graph matching meets sparse estimation01:17
Experimental results02:18