Image Segmentation by Size-Dependent Single Linkage Clustering of a Watershed Basin Graph

2015/05/01 by Aleksandar Zlateski, H. Sebastian Seung, Zlateski, Aleksandar +1
Computer Science · #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #cs.CV

paper · pdf · doi:10.48550/arxiv.1505.00249

8 pages

arxiv created 2015/05/01 · arxiv updated 2015/05/04

Abstract

We present a method for hierarchical image segmentation that defines a disaffinity graph on the image, over-segments it into watershed basins, defines a new graph on the basins, and then merges basins with a modified, size-dependent version of single linkage clustering. The quasilinear runtime of the method makes it suitable for segmenting large images. We illustrate the method on the challenging problem of segmenting 3D electron microscopic brain images.

Related

• Large-scale image segmentation based on distributed clustering algorithms
• Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation
• Flood-Filling Networks
• Revisiting Graph Construction for Fast Image Segmentation
• Realtime Hierarchical Clustering based on Boundary and Surface Statistics