Sign inSign up
Fast Global Registration 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

Fast Global Registration

Published on Oct 24, 20164061 Views

Vladlen Koltun

We present an algorithm for fast global registration of partially overlapping 3D surfaces. The algorithm operates on candidate matches that cover the surfaces. A single objective is optimized to align

ECCV 2016 - Amsterdam

Related categories

Computer Vision

Chapter list

Fast Global Registration00:00
Example : Dog Silhouette - 100:01
Example : Dog Silhouette - 200:03
Example : Dog Silhouette - 300:18
Example : Dog Silhouette - 400:27
Iterative Closest Points - 100:58
Iterative Closest Points - 201:12
Iterative Closest Points - 301:23
Iterative Closest Points - 401:54
Iterative Closest Points - 502:05
Iterative Closest Points - 602:14
Global Registration - 102:28
Global Registration - 203:05
Issues03:49
Fast Global Registration - 104:48
Fast Global Registration - 206:01
Optimization06:35
Fast Global Registration - 308:44
Fast Global Registration - 409:03
Fast Global Registration - 509:35
Fast Global Registration - 609:47
Results - 110:00
Results - 210:43
Results - 310:52
Results - 412:14
Summary12:49
Thank you13:24