Sign inSign up
Fast Segmentation via Randomized Hashing thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Fast Segmentation via Randomized Hashing

Published on Dec 01, 20093791 Views

Camillo J. Taylor

BMVC 2009 - London

Related categories

Computer Vision

Chapter list

Fast Segmentation via Randomized Hashing00:00
The Segmentation Problem00:24
Prior Work00:36
A Simple Clustering Scenario01:47
Random Projection / Splitting (1)03:15
Random Projection / Splitting (2)03:19
Random Projection / Splitting (3)03:31
Random Projection / Splitting (4)03:47
Random Projection / Splitting (5)03:59
Splitting planes04:34
Locality Sensitive Hashing07:14
Pseudo-Code for Segmentation Algorithm07:50
Important Parameters08:34
A Difficult Situation09:06
Sample Segmentations09:46
Sample Segmentations (1)09:52
Sample Segmentations (2)10:20
Sample Segmentations (3)10:28
Evaluating Segmentations10:44
Histogram of GCE values over the dataset12:16
Histogram of Rand Index values over the dataset12:30
Comparing reported GCE values on Berkeley dataset12:45
Comparison to Mean Shift13:16
Comparison to Mean Shift GCE13:40
Comparison to Mean Shift Rand Index13:48
Implementation13:52
Simple Ball Detector14:36
Live Demo (missing video demo)15:38
Future Work16:21
Summary16:53